diff --git a/locale/de/LC_MESSAGES/pgrouting_doc_strings.po b/locale/de/LC_MESSAGES/pgrouting_doc_strings.po index 3049c7286a..33a826f5d9 100644 --- a/locale/de/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/de/LC_MESSAGES/pgrouting_doc_strings.po @@ -6,11 +6,10 @@ msgid "" msgstr "" "Project-Id-Version: pgRouting v4.1\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2025-10-08 19:15+0000\n" +"POT-Creation-Date: 2025-12-05 23:37+0000\n" "PO-Revision-Date: 2025-09-22 16:28+0000\n" "Last-Translator: Anonymous \n" -"Language-Team: German \n" +"Language-Team: German \n" "Language: de\n" "MIME-Version: 1.0\n" "Content-Type: text/plain; charset=UTF-8\n" @@ -81,9 +80,7 @@ msgstr "" msgid "Identifier of the root vertex of the tree." msgstr "" -msgid "" -"When value is :math:`0` then gets the spanning forest starting in aleatory " -"nodes for each tree in the forest." +msgid "When value is :math:`0` then gets the spanning forest starting in aleatory nodes for each tree in the forest." msgstr "" msgid "**root vids**" @@ -182,9 +179,7 @@ msgstr "" msgid "Weight of the edge (``target``, ``source``)" msgstr "" -msgid "" -"When negative: edge (``target``, ``source``) does not exist, therefore it's " -"not part of the graph." +msgid "When negative: edge (``target``, ``source``) does not exist, therefore it's not part of the graph." msgstr "" msgid "``SMALLINT``, ``INTEGER``, ``BIGINT``" @@ -253,24 +248,16 @@ msgstr "" msgid "See Also" msgstr "" -msgid "" -"`Boost: Prim's algorithm `__" +msgid "`Boost: Prim's algorithm `__" msgstr "" -msgid "" -"`Boost: Kruskal's algorithm `__" +msgid "`Boost: Kruskal's algorithm `__" msgstr "" -msgid "" -"`Wikipedia: Prim's algorithm `__" +msgid "`Wikipedia: Prim's algorithm `__" msgstr "" -msgid "" -"`Wikipedia: Kruskal's algorithm `__" +msgid "`Wikipedia: Kruskal's algorithm `__" msgstr "" msgid "Indices and tables" @@ -315,8 +302,7 @@ msgstr "" msgid "Documentation might need refinement." msgstr "" -msgid "" -":doc:`pgr_depthFirstSearch` - Depth first search traversal of the graph." +msgid ":doc:`pgr_depthFirstSearch` - Depth first search traversal of the graph." msgstr "" msgid "In general:" @@ -346,8 +332,7 @@ msgstr "" msgid ":doc:`pgr_trsp_withPoints` - Vertex/Point routing with restrictions." msgstr "" -msgid "" -":doc:`pgr_trspVia_withPoints` - Via Vertex/point routing with restrictions." +msgid ":doc:`pgr_trspVia_withPoints` - Via Vertex/point routing with restrictions." msgstr "" msgid "Experimental" @@ -392,21 +377,13 @@ msgstr "" msgid "Introduction" msgstr "" -msgid "" -"Road restrictions are a sequence of road segments that can not be taken in a " -"sequential manner. Some restrictions are implicit on a directed graph, for " -"example, one way roads where the wrong way edge is not even inserted on the " -"graph. But normally on turns like no left turn or no right turn, hence the " -"name turn restrictions, there are sometimes restrictions." +msgid "Road restrictions are a sequence of road segments that can not be taken in a sequential manner. Some restrictions are implicit on a directed graph, for example, one way roads where the wrong way edge is not even inserted on the graph. But normally on turns like no left turn or no right turn, hence the name turn restrictions, there are sometimes restrictions." msgstr "" msgid "TRSP algorithm" msgstr "" -msgid "" -"The internal TRSP algorithm performs a lookahead over the dijkstra algorithm " -"in order to find out if the attempted path has a restriction. This allows " -"the algorithm to pass twice on the same vertex." +msgid "The internal TRSP algorithm performs a lookahead over the dijkstra algorithm in order to find out if the attempted path has a restriction. This allows the algorithm to pass twice on the same vertex." msgstr "" msgid "`Edges SQL`_ query as described." @@ -430,14 +407,10 @@ msgstr "" msgid "Restrictions" msgstr "" -msgid "" -"On road networks, there are restrictions such as left or right turn " -"restrictions, no U turn restrictions." +msgid "On road networks, there are restrictions such as left or right turn restrictions, no U turn restrictions." msgstr "" -msgid "" -"A restriction is a sequence of edges, called path and that path is to be " -"avoided." +msgid "A restriction is a sequence of edges, called path and that path is to be avoided." msgstr "" msgid "**Restrictions on the road network**" @@ -446,10 +419,7 @@ msgstr "" msgid "These restrictions are represented on a table as follows:" msgstr "" -msgid "" -"The table has an identifier, which maybe is needed for the administration of " -"the restrictions, but the algorithms do not need that information. If given " -"it will be ignored." +msgid "The table has an identifier, which maybe is needed for the administration of the restrictions, but the algorithms do not need that information. If given it will be ignored." msgstr "" msgid "Restrictions SQL" @@ -461,10 +431,7 @@ msgstr "" msgid "``ARRAY`` [**ANY-INTEGER**]" msgstr "" -msgid "" -"Sequence of edge identifiers that form a path that is not allowed to be " -"taken. - Empty arrays or ``NULL`` arrays are ignored. - Arrays that have a " -"``NULL`` element will raise an exception." +msgid "Sequence of edge identifiers that form a path that is not allowed to be taken. - Empty arrays or ``NULL`` arrays are ignored. - Arrays that have a ``NULL`` element will raise an exception." msgstr "" msgid "``Cost``" @@ -494,24 +461,16 @@ msgstr "" msgid "The travelling salesperson problem (TSP) asks the following question:" msgstr "" -msgid "" -"*Given a list of cities and the distances between each pair of cities, which " -"is the shortest possible route that visits each city exactly once and " -"returns to the origin city?*" +msgid "*Given a list of cities and the distances between each pair of cities, which is the shortest possible route that visits each city exactly once and returns to the origin city?*" msgstr "" msgid "Origin" msgstr "" -msgid "" -"The traveling sales person problem was studied in the 18th century by " -"mathematicians **Sir William Rowam Hamilton** and **Thomas Penyngton " -"Kirkman**." +msgid "The traveling sales person problem was studied in the 18th century by mathematicians **Sir William Rowam Hamilton** and **Thomas Penyngton Kirkman**." msgstr "" -msgid "" -"A discussion about the work of Hamilton & Kirkman can be found in the book " -"**Graph Theory (Biggs et al. 1976)**." +msgid "A discussion about the work of Hamilton & Kirkman can be found in the book **Graph Theory (Biggs et al. 1976)**." msgstr "" msgid "ISBN-13: 978-0198539162" @@ -520,13 +479,7 @@ msgstr "" msgid "ISBN-10: 0198539169" msgstr "" -msgid "" -"It is believed that the general form of the TSP have been first studied by " -"Kalr Menger in Vienna and Harvard. The problem was later promoted by " -"Hassler, Whitney & Merrill at Princeton. A detailed description about the " -"connection between Menger & Whitney, and the development of the TSP can be " -"found in `On the history of combinatorial optimization (till 1960) `__" +msgid "It is believed that the general form of the TSP have been first studied by Kalr Menger in Vienna and Harvard. The problem was later promoted by Hassler, Whitney & Merrill at Princeton. A detailed description about the connection between Menger & Whitney, and the development of the TSP can be found in `On the history of combinatorial optimization (till 1960) `__" msgstr "" msgid "To calculate the number of different tours through :math:`n` cities:" @@ -544,9 +497,7 @@ msgstr "" msgid "Multiplying these together we get :math:`(n-1)! = (n-1) (n-2) . . 1`." msgstr "" -msgid "" -"Now since the travel costs do not depend on the direction taken around the " -"tour:" +msgid "Now since the travel costs do not depend on the direction taken around the tour:" msgstr "" msgid "this number by 2" @@ -564,9 +515,7 @@ msgstr "" msgid "Metric Algorithm is used" msgstr "" -msgid "" -"Implementation generates solutions that *are twice as long as the optimal " -"tour in the worst case*:" +msgid "Implementation generates solutions that *are twice as long as the optimal tour in the worst case*:" msgstr "" msgid "Graph characteristics for best performance:" @@ -584,9 +533,7 @@ msgstr "" msgid "The traveling costs are symmetric:" msgstr "" -msgid "" -"Traveling costs from ``u`` to ``v`` are just as much as traveling from ``v`` " -"to ``u``" +msgid "Traveling costs from ``u`` to ``v`` are just as much as traveling from ``v`` to ``u``" msgstr "" msgid "TSP optional parameters" @@ -610,29 +557,22 @@ msgstr "" msgid "Last visiting vertex before returning to ``start_vid``." msgstr "" -msgid "" -"When ``0`` any vertex can become the last visiting vertex before returning " -"to ``start_id``." +msgid "When ``0`` any vertex can become the last visiting vertex before returning to ``start_id``." msgstr "" -msgid "" -"When ``NOT 0`` and ``start_id = 0`` then it is the first and last vertex" +msgid "When ``NOT 0`` and ``start_id = 0`` then it is the first and last vertex" msgstr "" msgid "References" msgstr "" -msgid "" -"`Boost: metric TSP approx `__" +msgid "`Boost: metric TSP approx `__" msgstr "" msgid "`University of Waterloo TSP `__" msgstr "" -msgid "" -"`Wikipedia: Traveling Salesman Problem `__" +msgid "`Wikipedia: Traveling Salesman Problem `__" msgstr "" msgid "Vehicle Routing Functions - Category" @@ -644,8 +584,7 @@ msgstr "" msgid ":doc:`pgr_pickDeliver` - Pickup & Delivery using a Cost Matrix" msgstr "" -msgid "" -":doc:`pgr_pickDeliverEuclidean` - Pickup & Delivery with Euclidean distances" +msgid ":doc:`pgr_pickDeliverEuclidean` - Pickup & Delivery with Euclidean distances" msgstr "" msgid "Distribution problem" @@ -657,9 +596,7 @@ msgstr "" msgid "Contents" msgstr "" -msgid "" -"Vehicle Routing Problems `VRP` are **NP-hard** optimization problem, it " -"generalises the travelling salesman problem (TSP)." +msgid "Vehicle Routing Problems `VRP` are **NP-hard** optimization problem, it generalises the travelling salesman problem (TSP)." msgstr "" msgid "The objective of the VRP is to minimize the total route cost." @@ -671,20 +608,13 @@ msgstr "" msgid "**pgRouting does not try to implement all variants.**" msgstr "" -msgid "" -"Capacitated Vehicle Routing Problem `CVRP` where The vehicles have limited " -"carrying capacity of the goods." +msgid "Capacitated Vehicle Routing Problem `CVRP` where The vehicles have limited carrying capacity of the goods." msgstr "" -msgid "" -"Vehicle Routing Problem with Time Windows `VRPTW` where the locations have " -"time windows within which the vehicle's visits must be made." +msgid "Vehicle Routing Problem with Time Windows `VRPTW` where the locations have time windows within which the vehicle's visits must be made." msgstr "" -msgid "" -"Vehicle Routing Problem with Pickup and Delivery `VRPPD` where a number of " -"goods need to be moved from certain pickup locations to other delivery " -"locations." +msgid "Vehicle Routing Problem with Pickup and Delivery `VRPPD` where a number of goods need to be moved from certain pickup locations to other delivery locations." msgstr "" msgid "Limitations" @@ -705,9 +635,7 @@ msgstr "" msgid "Pick & Delivery" msgstr "" -msgid "" -"Problem: `CVRPPDTW` Capacitated Pick and Delivery Vehicle Routing problem " -"with Time Windows" +msgid "Problem: `CVRPPDTW` Capacitated Pick and Delivery Vehicle Routing problem with Time Windows" msgstr "" msgid "Times are relative to `0`" @@ -737,9 +665,7 @@ msgstr "" msgid "Have pickup and delivery duration service times." msgstr "" -msgid "" -"have a demand request for moving goods from the pickup location to the " -"delivery location." +msgid "have a demand request for moving goods from the pickup location to the delivery location." msgstr "" msgid "Time based calculations:" @@ -829,12 +755,10 @@ msgstr "" msgid "``4`` Optimize insert." msgstr "" -msgid "" -"``5`` Push back order that allows more orders to be inserted at the back" +msgid "``5`` Push back order that allows more orders to be inserted at the back" msgstr "" -msgid "" -"``6`` Push front order that allows more orders to be inserted at the front" +msgid "``6`` Push front order that allows more orders to be inserted at the front" msgstr "" msgid "Orders SQL" @@ -897,30 +821,22 @@ msgstr "" msgid "The duration of the unloading at the delivery location." msgstr "" -msgid "" -"For :doc:`pgr_pickDeliver` the pickup and delivery identifiers of the " -"locations are needed:" +msgid "For :doc:`pgr_pickDeliver` the pickup and delivery identifiers of the locations are needed:" msgstr "" msgid "``p_node_id``" msgstr "" -msgid "" -"The node identifier of the pickup, must match a vertex identifier in the " -"`Matrix SQL`_." +msgid "The node identifier of the pickup, must match a vertex identifier in the `Matrix SQL`_." msgstr "" msgid "``d_node_id``" msgstr "" -msgid "" -"The node identifier of the delivery, must match a vertex identifier in the " -"`Matrix SQL`_." +msgid "The node identifier of the delivery, must match a vertex identifier in the `Matrix SQL`_." msgstr "" -msgid "" -"For :doc:`pgr_pickDeliverEuclidean` the :math:`(x, y)` values of the " -"locations are needed:" +msgid "For :doc:`pgr_pickDeliverEuclidean` the :math:`(x, y)` values of the locations are needed:" msgstr "" msgid "``p_x``" @@ -1010,25 +926,19 @@ msgstr "" msgid "When missing: A duration in ``start_service`` is used." msgstr "" -msgid "" -"For :doc:`pgr_pickDeliver` the starting and ending identifiers of the " -"locations are needed:" +msgid "For :doc:`pgr_pickDeliver` the starting and ending identifiers of the locations are needed:" msgstr "" msgid "``start_node_id``" msgstr "" -msgid "" -"The node identifier of the start location, must match a vertex identifier in " -"the `Matrix SQL`_." +msgid "The node identifier of the start location, must match a vertex identifier in the `Matrix SQL`_." msgstr "" msgid "[``end_node_id``]" msgstr "" -msgid "" -"The node identifier of the end location, must match a vertex identifier in " -"the `Matrix SQL`_." +msgid "The node identifier of the end location, must match a vertex identifier in the `Matrix SQL`_." msgstr "" msgid "When missing: ``end_node_id`` is used." @@ -1088,9 +998,7 @@ msgstr "" msgid "``vehicle_seq``" msgstr "" -msgid "" -"Sequential value starting from **1** for current vehicles. The :math:`n_{th}" -"` vehicle in the solution." +msgid "Sequential value starting from **1** for current vehicles. The :math:`n_{th}` vehicle in the solution." msgstr "" msgid "Value :math:`-2` indicates it is the summary row." @@ -1108,8 +1016,7 @@ msgstr "" msgid "Summary row has the **total capacity violations**." msgstr "" -msgid "" -"A capacity violation happens when overloading or underloading a vehicle." +msgid "A capacity violation happens when overloading or underloading a vehicle." msgstr "" msgid "``stop_seq``" @@ -1118,16 +1025,13 @@ msgstr "" msgid "INTEGER" msgstr "" -msgid "" -"Sequential value starting from **1** for the stops made by the current " -"vehicle. The :math:`m_{th}` stop of the current vehicle." +msgid "Sequential value starting from **1** for the stops made by the current vehicle. The :math:`m_{th}` stop of the current vehicle." msgstr "" msgid "Summary row has the **total time windows violations**." msgstr "" -msgid "" -"A time window violation happens when arriving after the location has closed." +msgid "A time window violation happens when arriving after the location has closed." msgstr "" msgid "``stop_type``" @@ -1157,8 +1061,7 @@ msgstr "" msgid "Pickup-Delivery order pair identifier." msgstr "" -msgid "" -"Value :math:`-1`: When no order is involved on the current stop location." +msgid "Value :math:`-1`: When no order is involved on the current stop location." msgstr "" msgid "``cargo``" @@ -1230,9 +1133,7 @@ msgstr "" msgid "Summary row has the **total solution time**:" msgstr "" -msgid "" -":math:`total\\ traveling\\ time + total\\ waiting\\ time + total\\ service\\ " -"time`." +msgid ":math:`total\\ traveling\\ time + total\\ waiting\\ time + total\\ service\\ time`." msgstr "" msgid "Summary Row" @@ -1262,10 +1163,7 @@ msgstr "" msgid "Handling Parameters" msgstr "" -msgid "" -"To define a problem, several considerations have to be done, to get " -"consistent results. This section gives an insight of how parameters are to " -"be considered." +msgid "To define a problem, several considerations have to be done, to get consistent results. This section gives an insight of how parameters are to be considered." msgstr "" msgid "`Capacity and Demand Units Handling`_" @@ -1301,32 +1199,22 @@ msgstr "" msgid "Number of seats in the vehicle" msgstr "" -msgid "" -"The `demand` request of the pickup-deliver orders must use the same units as " -"the units used in the vehicle's `capacity`." +msgid "The `demand` request of the pickup-deliver orders must use the same units as the units used in the vehicle's `capacity`." msgstr "" -msgid "" -"To handle problems like: 10 (equal dimension) boxes of apples and 5 kg of " -"feathers that are to be transported (not packed in boxes)." +msgid "To handle problems like: 10 (equal dimension) boxes of apples and 5 kg of feathers that are to be transported (not packed in boxes)." msgstr "" -msgid "" -"If the vehicle's **capacity** is measured in `boxes`, a conversion of `kg of " -"feathers` to `number of boxes` is needed." +msgid "If the vehicle's **capacity** is measured in `boxes`, a conversion of `kg of feathers` to `number of boxes` is needed." msgstr "" -msgid "" -"If the vehicle's **capacity** is measured in `kg`, a conversion of `box of " -"apples` to `kg` is needed." +msgid "If the vehicle's **capacity** is measured in `kg`, a conversion of `box of apples` to `kg` is needed." msgstr "" msgid "Showing how the 2 possible conversions can be done" msgstr "" -msgid "" -"Let: - :math:`f\\_boxes`: number of boxes needed for `1` kg of feathers. - :" -"math:`a\\_weight`: weight of `1` box of apples." +msgid "Let: - :math:`f\\_boxes`: number of boxes needed for `1` kg of feathers. - :math:`a\\_weight`: weight of `1` box of apples." msgstr "" msgid "Capacity Units" @@ -1380,14 +1268,10 @@ msgstr "" msgid "Time Handling" msgstr "" -msgid "" -"The times are relative to **0**. All time units have to be converted to a " -"**0** reference and the same time units." +msgid "The times are relative to **0**. All time units have to be converted to a **0** reference and the same time units." msgstr "" -msgid "" -"Suppose that a vehicle's driver starts the shift at 9:00 am and ends the " -"shift at 4:30 pm and the service time duration is 10 minutes with 30 seconds." +msgid "Suppose that a vehicle's driver starts the shift at 9:00 am and ends the shift at 4:30 pm and the service time duration is 10 minutes with 30 seconds." msgstr "" msgid "Meaning of 0" @@ -1444,9 +1328,7 @@ msgstr "" msgid "Factor handling" msgstr "" -msgid "" -"``factor`` acts as a multiplier to convert from distance values to time " -"units the matrix values or the euclidean values." +msgid "``factor`` acts as a multiplier to convert from distance values to time units the matrix values or the euclidean values." msgstr "" msgid "When the values are already in the desired time units" @@ -1464,10 +1346,7 @@ msgstr "" msgid "For the :doc:`pgr_pickDeliverEuclidean`:" msgstr "" -msgid "" -"Working with time units in seconds, and x/y in lat/lon: Factor: would depend " -"on the location of the points and on the average velocity say 25m/s is the " -"velocity." +msgid "Working with time units in seconds, and x/y in lat/lon: Factor: would depend on the location of the points and on the average velocity say 25m/s is the velocity." msgstr "" msgid "Latitude" @@ -1497,9 +1376,7 @@ msgstr "" msgid "For the :doc:`pgr_pickDeliver`:" msgstr "" -msgid "" -"Given :math:`v = d / t` therefore :math:`t = d / v` And the ``factor`` " -"becomes :math:`1 / v`" +msgid "Given :math:`v = d / t` therefore :math:`t = d / v` And the ``factor`` becomes :math:`1 / v`" msgstr "" msgid "v" @@ -1520,14 +1397,10 @@ msgstr "" msgid "Time" msgstr "" -msgid "" -"For the following equivalences :math:`10m/s \\approx 600m/min \\approx 36 km/" -"hr`" +msgid "For the following equivalences :math:`10m/s \\approx 600m/min \\approx 36 km/hr`" msgstr "" -msgid "" -"Working with time units in seconds and the matrix been in meters: For a " -"1000m length value on the matrix:" +msgid "Working with time units in seconds and the matrix been in meters: For a 1000m length value on the matrix:" msgstr "" msgid "Units" @@ -1590,10 +1463,7 @@ msgstr "" msgid "A* - Family of functions" msgstr "" -msgid "" -"The A* (pronounced \"A Star\") algorithm is based on Dijkstra's algorithm " -"with a heuristic that allow it to solve most shortest path problems by " -"evaluation only a sub-set of the overall graph." +msgid "The A* (pronounced \"A Star\") algorithm is based on Dijkstra's algorithm with a heuristic that allow it to solve most shortest path problems by evaluation only a sub-set of the overall graph." msgstr "" msgid ":doc:`pgr_aStar` - A* algorithm for the shortest path." @@ -1689,9 +1559,7 @@ msgstr "" msgid "For less restricted results. :math:`epsilon >= 1`." msgstr "" -msgid "" -"See :ref:`heuristics ` available and :ref:`factor " -"` handling." +msgid "See :ref:`heuristics ` available and :ref:`factor ` handling." msgstr "" msgid "Advanced documentation" @@ -1709,17 +1577,13 @@ msgstr "" msgid "Analysis 1" msgstr "" -msgid "" -"Working with cost/reverse_cost as length in degrees, x/y in lat/lon: Factor " -"= 1 (no need to change units)" +msgid "Working with cost/reverse_cost as length in degrees, x/y in lat/lon: Factor = 1 (no need to change units)" msgstr "" msgid "Analysis 2" msgstr "" -msgid "" -"Working with cost/reverse_cost as length in meters, x/y in lat/lon: Factor = " -"would depend on the location of the points:" +msgid "Working with cost/reverse_cost as length in meters, x/y in lat/lon: Factor = would depend on the location of the points:" msgstr "" msgid "1 longitude degree is 78846.81 m" @@ -1737,17 +1601,13 @@ msgstr "" msgid "Analysis 3" msgstr "" -msgid "" -"Working with cost/reverse_cost as time in seconds, x/y in lat/lon: Factor: " -"would depend on the location of the points and on the average speed say 25m/" -"s is the speed." +msgid "Working with cost/reverse_cost as time in seconds, x/y in lat/lon: Factor: would depend on the location of the points and on the average speed say 25m/s is the speed." msgstr "" msgid ":doc:`bdAstar-family`" msgstr "" -msgid "" -"`Boost: A* search `__" +msgid "`Boost: A* search `__" msgstr "" msgid "https://en.wikipedia.org/wiki/A*_search_algorithm" @@ -1771,24 +1631,16 @@ msgstr "" msgid "It does not return a path." msgstr "" -msgid "" -"Returns the sum of the costs of the shortest path for each pair of nodes in " -"the graph." +msgid "Returns the sum of the costs of the shortest path for each pair of nodes in the graph." 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." +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 "" -msgid "" -"We return only the non infinity values in form of a set of `(start_vid, " -"end_vid, agg_cost)`." +msgid "We return only the non infinity values in form of a set of `(start_vid, end_vid, agg_cost)`." msgstr "" -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)`." +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 "" msgid "For the undirected graph, the results are symmetric." @@ -1860,10 +1712,7 @@ msgstr "" msgid "One" msgstr "" -msgid "" -"This test is not with a bounding box The density of the passed graph is " -"extremely low. For each 30 tests were executed to get the average The " -"tested query is:" +msgid "This test is not with a bounding box The density of the passed graph is extremely low. For each 30 tests were executed to get the average The tested query is:" msgstr "" msgid "The results of this tests are presented as:" @@ -2205,10 +2054,7 @@ msgstr "" msgid "Two" msgstr "" -msgid "" -"This test is with a bounding box The density of the passed graph higher than " -"of the Test One. For each 30 tests were executed to get the average " -"The tested edge query is:" +msgid "This test is with a bounding box The density of the passed graph higher than of the Test One. For each 30 tests were executed to get the average The tested edge query is:" msgstr "" msgid "The tested queries" @@ -2511,44 +2357,28 @@ msgstr "" msgid ":doc:`pgr_floydWarshall`" msgstr "" -msgid "" -"Boost `floyd-Warshall `__" +msgid "Boost `floyd-Warshall `__" msgstr "" msgid "Bidirectional A* - Family of functions" msgstr "" -msgid "" -"The bidirectional A* (pronounced \"A Star\") algorithm is based on the A* " -"algorithm." +msgid "The bidirectional A* (pronounced \"A Star\") algorithm is based on the A* algorithm." msgstr "" msgid ":doc:`pgr_bdAstar` - Bidirectional A* algorithm for obtaining paths." msgstr "" -msgid "" -":doc:`pgr_bdAstarCost` - Bidirectional A* algorithm to calculate the cost of " -"the paths." +msgid ":doc:`pgr_bdAstarCost` - Bidirectional A* algorithm to calculate the cost of the paths." msgstr "" -msgid "" -":doc:`pgr_bdAstarCostMatrix` - Bidirectional A* algorithm to calculate a " -"cost matrix of paths." +msgid ":doc:`pgr_bdAstarCostMatrix` - Bidirectional A* algorithm to calculate a cost matrix of paths." msgstr "" -msgid "" -"Based on A* algorithm, the bidirectional search finds a shortest path from a " -"starting vertex (``start_vid``) to an ending vertex (``end_vid``). It runs " -"two simultaneous searches: one forward from the ``start_vid``, and one " -"backward from the ``end_vid``, stopping when the two meet in the middle. " -"This implementation can be used with a directed graph and an undirected " -"graph." +msgid "Based on A* algorithm, the bidirectional search finds a shortest path from a starting vertex (``start_vid``) to an ending vertex (``end_vid``). It runs two simultaneous searches: one forward from the ``start_vid``, and one backward from the ``end_vid``, stopping when the two meet in the middle. This implementation can be used with a directed graph and an undirected graph." msgstr "" -msgid "" -"For large graphs where there is a path between the starting vertex and " -"ending vertex:" +msgid "For large graphs where there is a path between the starting vertex and ending vertex:" msgstr "" msgid "It is expected to terminate faster than :doc:`pgr_aStar`" @@ -2560,41 +2390,28 @@ msgstr "" msgid "Bidirectional Dijkstra - Family of functions" msgstr "" -msgid "" -":doc:`pgr_bdDijkstra` - Bidirectional Dijkstra algorithm for the shortest " -"paths." +msgid ":doc:`pgr_bdDijkstra` - Bidirectional Dijkstra algorithm for the shortest paths." msgstr "" -msgid "" -":doc:`pgr_bdDijkstraCost` - Bidirectional Dijkstra to calculate the cost of " -"the shortest paths" +msgid ":doc:`pgr_bdDijkstraCost` - Bidirectional Dijkstra to calculate the cost of the shortest paths" msgstr "" -msgid "" -":doc:`pgr_bdDijkstraCostMatrix` - Bidirectional Dijkstra algorithm to create " -"a matrix of costs of the shortest paths." +msgid ":doc:`pgr_bdDijkstraCostMatrix` - Bidirectional Dijkstra algorithm to create a matrix of costs of the shortest paths." msgstr "" msgid "Synopsis" msgstr "" -msgid "" -"Based on Dijkstra's algorithm, the bidirectional search finds a shortest " -"path a starting vertex to an ending vertex." +msgid "Based on Dijkstra's algorithm, the bidirectional search finds a shortest path a starting vertex to an ending vertex." msgstr "" -msgid "" -"It runs two simultaneous searches: one forward from the source, and one " -"backward from the target, stopping when the two meet in the middle." +msgid "It runs two simultaneous searches: one forward from the source, and one backward from the target, stopping when the two meet in the middle." msgstr "" -msgid "" -"This implementation can be used with a directed graph and an undirected " -"graph." +msgid "This implementation can be used with a directed graph and an undirected graph." msgstr "" -msgid "" -"A negative value on a cost column is interpreted as the edge does not exist." +msgid "A negative value on a cost column is interpreted as the edge does not exist." msgstr "" msgid "When there is no path:" @@ -2603,31 +2420,22 @@ msgstr "" msgid "When the starting vertex and ending vertex are the same." msgstr "" -msgid "" -"The **aggregate cost** of the non included values :math:`(v, v)` is :math:`0`" +msgid "The **aggregate cost** of the non included values :math:`(v, v)` is :math:`0`" msgstr "" -msgid "" -"When the starting vertex and ending vertex are the different and there is no " -"path:" +msgid "When the starting vertex and ending vertex are the different and there is no path:" msgstr "" -msgid "" -"The **aggregate cost** the non included values :math:`(u, v)` is :math:" -"`\\infty`" +msgid "The **aggregate cost** the non included values :math:`(u, v)` is :math:`\\infty`" msgstr "" -msgid "" -"For optimization purposes, any duplicated value in the starting vertices or " -"on the ending vertices are ignored." +msgid "For optimization purposes, any duplicated value in the starting vertices or on the ending vertices are ignored." msgstr "" msgid "Running time (worse case scenario): :math:`O((V \\log V + E))`" msgstr "" -msgid "" -"For large graphs where there is a path bewtween the starting vertex and " -"ending vertex:" +msgid "For large graphs where there is a path bewtween the starting vertex and ending vertex:" msgstr "" msgid "It is expected to terminate faster than :doc:`pgr_dijkstra`" @@ -2657,25 +2465,19 @@ msgstr "" msgid "Graph must be connected." msgstr "" -msgid "" -"An Edges SQL that represents a **directed** graph with the following columns" +msgid "An Edges SQL that represents a **directed** graph with the following columns" msgstr "" msgid "Coloring - Family of functions" msgstr "" -msgid "" -":doc:`pgr_sequentialVertexColoring` - Vertex coloring algorithm using greedy " -"approach." +msgid ":doc:`pgr_sequentialVertexColoring` - Vertex coloring algorithm using greedy approach." msgstr "" -msgid "" -":doc:`pgr_bipartite` - Bipartite graph algorithm using a DFS-based coloring " -"approach." +msgid ":doc:`pgr_bipartite` - Bipartite graph algorithm using a DFS-based coloring approach." msgstr "" -msgid "" -":doc:`pgr_edgeColoring` - Edge Coloring algorithm using Vizing's theorem." +msgid ":doc:`pgr_edgeColoring` - Edge Coloring algorithm using Vizing's theorem." msgstr "" msgid "Returns set of |result_edge_color|" @@ -2699,29 +2501,22 @@ msgstr "" msgid "Color of the node." msgstr "" -msgid "" -"`Boost: `__" +msgid "`Boost: `__" msgstr "" msgid "Components - Family of functions" msgstr "" -msgid "" -":doc:`pgr_connectedComponents` - Connected components of an undirected graph." +msgid ":doc:`pgr_connectedComponents` - Connected components of an undirected graph." msgstr "" -msgid "" -":doc:`pgr_strongComponents` - Strongly connected components of a directed " -"graph." +msgid ":doc:`pgr_strongComponents` - Strongly connected components of a directed graph." msgstr "" -msgid "" -":doc:`pgr_biconnectedComponents` - Biconnected components of an undirected " -"graph." +msgid ":doc:`pgr_biconnectedComponents` - Biconnected components of an undirected graph." msgstr "" -msgid "" -":doc:`pgr_articulationPoints` - Articulation points of an undirected graph." +msgid ":doc:`pgr_articulationPoints` - Articulation points of an undirected graph." msgstr "" msgid ":doc:`pgr_bridges` - Bridges of an undirected graph." @@ -2745,18 +2540,10 @@ msgstr "" msgid ":doc:`pgr_contractionHierarchies`" msgstr "" -msgid "" -"In large graphs, like road graphs or electric networks, graph contraction " -"can be used to speed up some graph algorithms. Contraction can reduce the " -"size of the graph by removing some of the vertices and edges and adding " -"edges that represent a sequence of original edges (the original ones can be " -"kept in some methods). In this way, it decreases the total time and space " -"used by graph algorithms, particularly those searching for an optimal path." +msgid "In large graphs, like road graphs or electric networks, graph contraction can be used to speed up some graph algorithms. Contraction can reduce the size of the graph by removing some of the vertices and edges and adding edges that represent a sequence of original edges (the original ones can be kept in some methods). In this way, it decreases the total time and space used by graph algorithms, particularly those searching for an optimal path." msgstr "" -msgid "" -"This implementation gives a flexible framework for adding contraction " -"algorithms in the future. Currently, it supports three algorithms." +msgid "This implementation gives a flexible framework for adding contraction algorithms in the future. Currently, it supports three algorithms." msgstr "" msgid "Dead end contraction" @@ -2768,17 +2555,13 @@ msgstr "" msgid "Contraction hierarchies" msgstr "" -msgid "" -"The two first ones can be combined through a iterative procedure, via the " -"``pgr_contraction`` method. The third one is implemented on its own." +msgid "The two first ones can be combined through a iterative procedure, via the ``pgr_contraction`` method. The third one is implemented on its own." msgstr "" msgid "All functions allow the user to forbid contraction on a set of nodes." msgstr "" -msgid "" -"https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/" -"lecture16.pdf" +msgid "https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/lecture16.pdf" msgstr "" msgid "https://ae.iti.kit.edu/download/diploma_thesis_geisberger.pdf" @@ -2811,26 +2594,19 @@ msgstr "" msgid "Each function works as part of the family it belongs to." msgstr "" -msgid "" -"Returns the sum of the costs of the shortest path of each pair combination " -"of nodes requested." +msgid "Returns the sum of the costs of the shortest path of each pair combination of nodes requested." msgstr "" -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)``." +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 "" -msgid "" -"Depending on the function and its parameters, the results can be symmetric." +msgid "Depending on the function and its parameters, the results can be symmetric." msgstr "" -msgid "" -"The **aggregate cost** of :math:`(u, v)` is the same as for :math:`(v, u)`." +msgid "The **aggregate cost** of :math:`(u, v)` is the same as for :math:`(v, u)`." msgstr "" -msgid "" -"Any duplicated value in the start or end vertex identifiers are ignored." +msgid "Any duplicated value in the start or end vertex identifiers are ignored." msgstr "" msgid "The returned values are ordered:" @@ -2860,21 +2636,16 @@ msgstr "" msgid ":doc:`pgr_withPointsCostMatrix`" msgstr "" -msgid "" -":doc:`TSP-family` needs as input a symmetric cost matrix and no edge `(u, " -"v)` must value :math:`\\infty`." +msgid ":doc:`TSP-family` needs as input a symmetric cost matrix and no edge `(u, v)` must value :math:`\\infty`." msgstr "" -msgid "" -"This collection of functions will return a cost matrix in form of a table." +msgid "This collection of functions will return a cost matrix in form of a table." msgstr "" msgid "Can be used as input to :doc:`pgr_TSP`." msgstr "" -msgid "" -"Use directly when the resulting matrix is symmetric and there is no :math:" -"`\\infty` value." +msgid "Use directly when the resulting matrix is symmetric and there is no :math:`\\infty` value." msgstr "" msgid "It will be the users responsibility to make the matrix symmetric." @@ -2886,36 +2657,28 @@ msgstr "" msgid "By using max or min the non symmetric values." msgstr "" -msgid "" -"By setting the upper triangle to be the mirror image of the lower triangle." +msgid "By setting the upper triangle to be the mirror image of the lower triangle." msgstr "" -msgid "" -"By setting the lower triangle to be the mirror image of the upper triangle." +msgid "By setting the lower triangle to be the mirror image of the upper triangle." msgstr "" msgid "It is also the users responsibility to fix an :math:`\\infty` value." msgstr "" -msgid "" -"Returns the sum of the costs of the shortest path for pair combination of " -"nodes in the graph." +msgid "Returns the sum of the costs of the shortest path for pair combination of nodes in the graph." msgstr "" -msgid "" -"When the starting vertex and ending vertex are the same, there is no path." +msgid "When the starting vertex and ending vertex are the same, there is no path." msgstr "" msgid "The aggregate cost in the non included values `(v, v)` is `0`." msgstr "" -msgid "" -"When the starting vertex and ending vertex are the different and there is no " -"path." +msgid "When the starting vertex and ending vertex are the different and there is no path." msgstr "" -msgid "" -"The aggregate cost in the non included values `(u, v)` is :math:`\\infty`." +msgid "The aggregate cost in the non included values `(u, v)` is :math:`\\infty`." msgstr "" msgid "Let be the case the values returned are stored in a table:" @@ -2963,16 +2726,13 @@ msgstr "" msgid "Identifier of the point." msgstr "" -msgid "" -"Use with positive value, as internally will be converted to negative value" +msgid "Use with positive value, as internally will be converted to negative value" msgstr "" msgid "If column is present, it can not be NULL." msgstr "" -msgid "" -"If column is not present, a sequential negative **value** will be given " -"automatically." +msgid "If column is not present, a sequential negative **value** will be given automatically." msgstr "" msgid "``edge_id``" @@ -2984,9 +2744,7 @@ msgstr "" msgid "``fraction``" msgstr "" -msgid "" -"Value in <0,1> that indicates the relative position from the first end point " -"of the edge." +msgid "Value in <0,1> that indicates the relative position from the first end point of the edge." msgstr "" msgid "``side``" @@ -3022,18 +2780,13 @@ msgstr "" msgid ":doc:`pgr_dijkstraCost` - Get the aggregate cost of the shortest paths." msgstr "" -msgid "" -":doc:`pgr_dijkstraCostMatrix` - Use pgr_dijkstra to create a costs matrix." +msgid ":doc:`pgr_dijkstraCostMatrix` - Use pgr_dijkstra to create a costs matrix." msgstr "" -msgid "" -":doc:`pgr_drivingDistance` - Use pgr_dijkstra to calculate catchament " -"information." +msgid ":doc:`pgr_drivingDistance` - Use pgr_dijkstra to calculate catchament information." msgstr "" -msgid "" -":doc:`pgr_KSP` - Use Yen algorithm with pgr_dijkstra to get the K shortest " -"paths." +msgid ":doc:`pgr_KSP` - Use Yen algorithm with pgr_dijkstra to get the K shortest paths." msgstr "" msgid ":doc:`pgr_dijkstraVia` - Get a route of a sequence of vertices." @@ -3045,12 +2798,7 @@ msgstr "" msgid ":doc:`pgr_dijkstraNearCost` - Get the cost to the nearest vertex." msgstr "" -msgid "" -"Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra " -"in 1956. It is a graph search algorithm that solves the shortest path " -"problem for a graph with non-negative edge path costs, producing a shortest " -"path from a starting vertex to an ending vertex. This implementation can be " -"used with a directed graph and an undirected graph." +msgid "Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956. It is a graph search algorithm that solves the shortest path problem for a graph with non-negative edge path costs, producing a shortest path from a starting vertex to an ending vertex. This implementation can be used with a directed graph and an undirected graph." msgstr "" msgid "Running time: :math:`O(| start\\ vids | * (V \\log V + E))`" @@ -3101,9 +2849,7 @@ msgstr "" msgid "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgstr "" -msgid "" -"where :math:`sql = \\{(id_i, source_i, target_i, cost_i, reverse\\_cost_i)\\}" -"`" +msgid "where :math:`sql = \\{(id_i, source_i, target_i, cost_i, reverse\\_cost_i)\\}`" msgstr "" msgid "and" @@ -3133,14 +2879,7 @@ msgstr "" msgid "the set of edges :math:`E`" msgstr "" -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}`" +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 "" msgid "Undirected graph" @@ -3152,17 +2891,7 @@ msgstr "" msgid ":math:`V = source \\cup target \\cup {start_v{vid}} \\cup {end_{vid}}`" msgstr "" -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}`" +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 "" msgid "The problem" @@ -3177,17 +2906,13 @@ msgstr "" msgid ":math:`end_{vid} \\in V` an ending vertex" msgstr "" -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 ":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 "" msgid "Then:" msgstr "" -msgid "" -":math:`\\boldsymbol{\\pi} = \\{(path\\_seq_i, node_i, edge_i, cost_i, " -"agg\\_cost_i)\\}`" +msgid ":math:`\\boldsymbol{\\pi} = \\{(path\\_seq_i, node_i, edge_i, cost_i, agg\\_cost_i)\\}`" msgstr "" msgid "where:" @@ -3208,41 +2933,28 @@ msgstr "" msgid ":math:`node_{| \\pi |} = end_{vid}`" msgstr "" -msgid "" -":math:`\\forall i \\neq | \\pi |, \\quad (node_i, node_{i+1}, cost_i) \\in E`" +msgid ":math:`\\forall i \\neq | \\pi |, \\quad (node_i, node_{i+1}, cost_i) \\in E`" msgstr "" -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}`" +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 "" msgid ":math:`cost_i = cost_{(node_i, node_{i+1})}`" msgstr "" -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}`" +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 "" -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," +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 "" -msgid "" -":math:`path\\_seq` indicates the relative position in the path of the :math:" -"`node` or :math:`edge`." +msgid ":math:`path\\_seq` indicates the relative position in the path of the :math:`node` or :math:`edge`." msgstr "" msgid ":math:`cost` is the cost of the edge to be used to go to the next node." msgstr "" -msgid "" -":math:`agg\\_cost` is the cost from the :math:`start_{vid}` up to the node." +msgid ":math:`agg\\_cost` is the cost from the :math:`start_{vid}` up to the node." msgstr "" msgid "If there is no path, the resulting set is empty." @@ -3251,8 +2963,7 @@ msgstr "" msgid "Driving Distance - Category" msgstr "" -msgid "" -":doc:`pgr_drivingDistance` - Driving Distance based on Dijkstra's algorithm" +msgid ":doc:`pgr_drivingDistance` - Driving Distance based on Dijkstra's algorithm" msgstr "" msgid ":doc:`pgr_primDD` - Driving Distance based on Prim's algorithm" @@ -3267,9 +2978,7 @@ msgstr "" 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." +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." @@ -3284,9 +2993,7 @@ msgstr "" msgid "The distance from the **root** to :math:`v` > limit distance." msgstr "" -msgid "" -"No new nodes are created on the graph, so when is within the limit and is " -"not within the limit, the edge is not included." +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." @@ -3352,21 +3059,16 @@ msgstr "" msgid ":doc:`transformation-family`" msgstr "" -msgid "" -":doc:`pgr_lineGraphFull` - Transformation algorithm for generating a Line " -"Graph out of each vertex in the input graph." +msgid ":doc:`pgr_lineGraphFull` - Transformation algorithm for generating a Line Graph out of each vertex in the input graph." msgstr "" msgid ":doc:`traversal-family`" msgstr "" -msgid "" -":doc:`pgr_breadthFirstSearch` - Breath first search traversal of the graph." +msgid ":doc:`pgr_breadthFirstSearch` - Breath first search traversal of the graph." msgstr "" -msgid "" -":doc:`pgr_binaryBreadthFirstSearch` - Breath first search traversal of the " -"graph." +msgid ":doc:`pgr_binaryBreadthFirstSearch` - Breath first search traversal of the graph." msgstr "" msgid ":doc:`components-family`" @@ -3375,30 +3077,22 @@ msgstr "" msgid ":doc:`ordering-family`" msgstr "" -msgid "" -":doc:`pgr_cuthillMckeeOrdering` - Return reverse Cuthill-McKee ordering of " -"an undirected graph." +msgid ":doc:`pgr_cuthillMckeeOrdering` - Return reverse Cuthill-McKee ordering of an undirected graph." msgstr "" -msgid "" -":doc:`pgr_topologicalSort` - Linear ordering of the vertices for directed " -"acyclic graph." +msgid ":doc:`pgr_topologicalSort` - Linear ordering of the vertices for directed acyclic graph." msgstr "" -msgid "" -":doc:`pgr_sloanOrdering` - Returns the sloan ordering of an undirected graph." +msgid ":doc:`pgr_sloanOrdering` - Returns the sloan ordering of an undirected graph." msgstr "" -msgid "" -":doc:`pgr_kingOrdering` - Returns the King ordering of an undirected graph." +msgid ":doc:`pgr_kingOrdering` - Returns the King ordering of an undirected graph." msgstr "" msgid ":doc:`metrics-family`" msgstr "" -msgid "" -":doc:`pgr_betweennessCentrality` - Calculates relative betweenness " -"centrality using Brandes Algorithm" +msgid ":doc:`pgr_betweennessCentrality` - Calculates relative betweenness centrality using Brandes Algorithm" msgstr "" msgid ":doc:`pgr_bandwidth` - Computes the bandwidth of a graph." @@ -3449,37 +3143,25 @@ msgstr "" msgid "Flow - Family of functions" msgstr "" -msgid "" -":doc:`pgr_maxFlow` - Only the Max flow calculation using Push and Relabel " -"algorithm." +msgid ":doc:`pgr_maxFlow` - Only the Max flow calculation using Push and Relabel algorithm." msgstr "" -msgid "" -":doc:`pgr_boykovKolmogorov` - Boykov and Kolmogorov with details of flow on " -"edges." +msgid ":doc:`pgr_boykovKolmogorov` - Boykov and Kolmogorov with details of flow on edges." msgstr "" -msgid "" -":doc:`pgr_edmondsKarp` - Edmonds and Karp algorithm with details of flow on " -"edges." +msgid ":doc:`pgr_edmondsKarp` - Edmonds and Karp algorithm with details of flow on edges." msgstr "" -msgid "" -":doc:`pgr_pushRelabel` - Push and relabel algorithm with details of flow on " -"edges." +msgid ":doc:`pgr_pushRelabel` - Push and relabel algorithm with details of flow on edges." msgstr "" msgid "Applications" msgstr "" -msgid "" -":doc:`pgr_edgeDisjointPaths` - Calculates edge disjoint paths between two " -"groups of vertices." +msgid ":doc:`pgr_edgeDisjointPaths` - Calculates edge disjoint paths between two groups of vertices." msgstr "" -msgid "" -":doc:`pgr_maxCardinalityMatch` - Calculates a maximum cardinality matching " -"in a graph." +msgid ":doc:`pgr_maxCardinalityMatch` - Calculates a maximum cardinality matching in a graph." msgstr "" msgid "Flow Functions General Information" @@ -3491,9 +3173,7 @@ 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." +msgid "When the maximum flow is 0 then there is no flow and **EMPTY SET** is returned." msgstr "" msgid "There is no flow when source has the same value as target." @@ -3517,10 +3197,7 @@ 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:" +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 "" msgid "By aggregation of the outgoing flow from the sources" @@ -3529,10 +3206,7 @@ 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." +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 "" msgid "Capacity edges" @@ -3607,8 +3281,7 @@ msgstr "" msgid "**residual_capacity**" msgstr "" -msgid "" -"Residual capacity of the edge in the direction (``start_vid``, ``end_vid``)." +msgid "Residual capacity of the edge in the direction (``start_vid``, ``end_vid``)." msgstr "" msgid "For :doc:`pgr_maxFlowMinCost`" @@ -3629,9 +3302,7 @@ msgstr "" msgid "**cost**" msgstr "" -msgid "" -"The cost of sending this flow through the edge in the direction (source, " -"target)." +msgid "The cost of sending this flow through the edge in the direction (source, target)." msgstr "" msgid "**agg_cost**" @@ -3643,30 +3314,19 @@ msgstr "" msgid "Advanced Documentation" msgstr "" -msgid "" -"A flow network is a directed graph where each edge has a capacity and a " -"flow. The flow through an edge must not exceed the capacity of the edge. " -"Additionally, the incoming and outgoing flow of a node must be equal except " -"for source which only has outgoing flow, and the destination(sink) which " -"only has incoming flow." +msgid "A flow network is a directed graph where each edge has a capacity and a flow. The flow through an edge must not exceed the capacity of the edge. Additionally, the incoming and outgoing flow of a node must be equal except for source which only has outgoing flow, and the destination(sink) which only has incoming flow." msgstr "" -msgid "" -"Maximum flow algorithms calculate the maximum flow through the graph and the " -"flow of each edge." +msgid "Maximum flow algorithms calculate the maximum flow through the graph and the flow of each edge." msgstr "" -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." +msgid "The maximum flow through the graph is guaranteed to be the same with all implementations, but the actual flow through each edge may vary." msgstr "" msgid "pgr_maxFlow :math:`(edges\\_sql, source\\_vertex, sink\\_vertex)`" msgstr "" -msgid "" -"where :math:`edges\\_sql = \\{(id_i, source_i, target_i, capacity_i, " -"reverse\\_capacity_i)\\}`" +msgid "where :math:`edges\\_sql = \\{(id_i, source_i, target_i, capacity_i, reverse\\_capacity_i)\\}`" msgstr "" msgid "Graph definition" @@ -3678,19 +3338,10 @@ msgstr "" msgid "the set of vertices :math:`V`" msgstr "" -msgid "" -":math:`source\\_vertex \\cup sink\\_vertex \\bigcup source_i \\bigcup " -"target_i`" +msgid ":math:`source\\_vertex \\cup sink\\_vertex \\bigcup source_i \\bigcup target_i`" msgstr "" -msgid "" -":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, capacity_i) " -"\\text{ when } capacity > 0 \\} & \\quad \\text{ if } reverse\\_capacity = " -"\\varnothing \\\\ \\text{ } & \\quad \\text{ } \\\\ \\{(source_i, target_i, " -"capacity_i) \\text{ when } capacity > 0 \\} & \\text{ } \\\\ \\cup " -"\\{(target_i, source_i, reverse\\_capacity_i) \\text{ when } " -"reverse\\_capacity_i > 0)\\} & \\quad \\text{ if } reverse\\_capacity \\neq " -"\\varnothing \\\\ \\end{cases}`" +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 "" msgid "Maximum flow problem" @@ -3708,16 +3359,10 @@ msgstr "" msgid ":math:`pgr\\_maxFlow(edges\\_sql, source, sink) = \\boldsymbol{\\Phi}`" msgstr "" -msgid "" -":math:`\\boldsymbol{\\Phi} = {(id_i, edge\\_id_i, source_i, target_i, " -"flow_i, residual\\_capacity_i)}`" +msgid ":math:`\\boldsymbol{\\Phi} = {(id_i, edge\\_id_i, source_i, target_i, flow_i, residual\\_capacity_i)}`" msgstr "" -msgid "" -":math:`\\boldsymbol{\\Phi}` is a subset of the original edges with their " -"residual capacity and flow. The maximum flow through the graph can be " -"obtained by aggregating on the source or sink and summing the flow from/to " -"it. In particular:" +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 "" msgid ":math:`id_i = i`" @@ -3732,10 +3377,7 @@ msgstr "" msgid "https://en.wikipedia.org/wiki/Maximum_flow_problem" msgstr "" -msgid "" -"pgRouting extends the `PostGIS `__/`PostgreSQL `__ geospatial database to provide geospatial routing and " -"other network analysis functionality." +msgid "pgRouting extends the `PostGIS `__/`PostgreSQL `__ geospatial database to provide geospatial routing and other network analysis functionality." msgstr "" msgid "This is the manual for pgRouting |release|." @@ -3744,13 +3386,7 @@ msgstr "" msgid "Creative Commons Attribution-Share Alike 3.0 License" msgstr "" -msgid "" -"The pgRouting Manual is licensed under a `Creative Commons Attribution-Share " -"Alike 3.0 License `_. Feel " -"free to use this material any way you like, but we ask that you attribute " -"credit to the pgRouting Project and wherever possible, a link back to " -"https://pgrouting.org. For other licenses used in pgRouting see the :ref:" -"`license` page." +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 "" msgid "General" @@ -3783,9 +3419,7 @@ msgstr "" msgid ":doc:`pgr_kruskalDD`" msgstr "" -msgid "" -":doc:`pgr_degree` - Returns a set of vertices and corresponding count of " -"incident edges to the vertex." +msgid ":doc:`pgr_degree` - Returns a set of vertices and corresponding count of incident edges to the vertex." msgstr "" msgid ":doc:`prim-family`" @@ -3809,9 +3443,7 @@ msgstr "" msgid ":doc:`utilities-family`" msgstr "" -msgid "" -":doc:`pgr_extractVertices` - Extracts vertex information based on the edge " -"table information." +msgid ":doc:`pgr_extractVertices` - Extracts vertex information based on the edge table information." msgstr "" msgid ":doc:`pgr_findCloseEdges` - Finds close edges of points on the fly" @@ -3820,9 +3452,7 @@ msgstr "" msgid ":doc:`pgr_separateCrossing` - Breaks geometries that cross each other." msgstr "" -msgid "" -":doc:`pgr_separateTouching` - Breaks geometries that (almost) touch each " -"other." +msgid ":doc:`pgr_separateTouching` - Breaks geometries that (almost) touch each other." msgstr "" msgid ":doc:`withPoints-family`" @@ -3891,13 +3521,13 @@ msgstr "" msgid ":doc:`release_notes`" msgstr "" +msgid "pgRouting 4.0" +msgstr "" + msgid "pgRouting 4.0.0-alpha1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 4.0.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.0 `__" msgstr "" msgid "Build" @@ -3906,8 +3536,7 @@ msgstr "" msgid "C++ standard is std17" msgstr "" -msgid "" -"Using this standard, all supported toolchains across our CI matrix will work." +msgid "Using this standard, all supported toolchains across our CI matrix will work." msgstr "" msgid "The code is not yet modified to use std17:" @@ -3940,9 +3569,7 @@ msgstr "" msgid "The HTML documentation is built by default" msgstr "" -msgid "" -"The translated languages (en, es, sv, zh_Hans) HTML documentation are built " -"by default" +msgid "The translated languages (en, es, sv, zh_Hans) HTML documentation are built by default" msgstr "" msgid "`WITH-DOC` is not used anymore" @@ -4146,9 +3773,7 @@ msgstr "" msgid "pgr_trsp(text,integer,integer,boolean,boolean,text)" msgstr "" -msgid "" -"pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean,text)" +msgid "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" msgstr "" msgid "pgr_trspVia" @@ -4166,13 +3791,10 @@ msgstr "" msgid "Valid values depend on kind of graph" msgstr "" -msgid "" -"pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean," -"character,boolean)" +msgid "pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "" -msgid "" -"pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +msgid "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" msgstr "" msgid "pgr_trsp_withPoints" @@ -4181,21 +3803,16 @@ msgstr "" msgid "**Driving side** parameter is positional unnamed and compulsory." msgstr "" -msgid "" -"pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character," -"boolean)" +msgid "pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" msgstr "" -msgid "" -"pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +msgid "pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" msgstr "" -msgid "" -"pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +msgid "pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" msgstr "" -msgid "" -"pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" +msgid "pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" msgstr "" msgid "pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" @@ -4210,17 +3827,13 @@ msgstr "" msgid "Only for undirected graphs" msgstr "" -msgid "" -"pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double " -"precision,double precision,double precision,boolean)" +msgid "pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgstr "" msgid "pgr_TSPeuclidean" msgstr "" -msgid "" -"pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, " -"integer,double precision,double precision,double precision,boolean)" +msgid "pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, integer,double precision,double precision,double precision,boolean)" msgstr "" msgid "pgr_turnRestrictedPath" @@ -4280,163 +3893,106 @@ msgstr "" msgid "pgr_withPointsDD" msgstr "" -msgid "" -"pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgid "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" msgstr "" -msgid "" -"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" +msgid "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" msgstr "" msgid "pgr_withPointsKSP" msgstr "" -msgid "" -"pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character," -"boolean)" +msgid "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" msgstr "" msgid "pgr_withPointsVia" msgstr "" -msgid "" -"pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character," -"boolean)" +msgid "pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "" msgid "Functions promoted to official" msgstr "" -msgid "" -"`#2701 `__: pgr_trsp" +msgid "`#2701 `__: pgr_trsp" msgstr "" -msgid "" -"`#2701 `__: pgr_trspVia" +msgid "`#2701 `__: pgr_trspVia" msgstr "" -msgid "" -"`#2701 `__: " -"pgr_trspVia_withPoints" +msgid "`#2701 `__: pgr_trspVia_withPoints" msgstr "" -msgid "" -"`#2701 `__: " -"pgr_trsp_withPoints" +msgid "`#2701 `__: pgr_trsp_withPoints" msgstr "" -msgid "" -"`#2700 `__: " -"pgr_withPoints" +msgid "`#2700 `__: pgr_withPoints" msgstr "" -msgid "" -"`#2700 `__: " -"pgr_withPointsCost" +msgid "`#2700 `__: pgr_withPointsCost" msgstr "" -msgid "" -"`#2700 `__: " -"pgr_withPointsCostMatrix" +msgid "`#2700 `__: pgr_withPointsCostMatrix" msgstr "" -msgid "" -"`#2700 `__: " -"pgr_withPointsDD" +msgid "`#2700 `__: pgr_withPointsDD" msgstr "" -msgid "" -"`#2700 `__: " -"pgr_withPointsKSP" +msgid "`#2700 `__: pgr_withPointsKSP" msgstr "" -msgid "" -"`#2700 `__: " -"pgr_withPointsVia" +msgid "`#2700 `__: pgr_withPointsVia" msgstr "" -msgid "" -"`#2983 `__: " -"pgr_dijkstraNear" +msgid "`#2983 `__: pgr_dijkstraNear" msgstr "" -msgid "" -"`#2983 `__: " -"pgr_dijkstraNearCost" +msgid "`#2983 `__: pgr_dijkstraNearCost" msgstr "" -msgid "" -"`#2983 `__: " -"pgr_dijkstraVia" +msgid "`#2983 `__: pgr_dijkstraVia" msgstr "" msgid "Signatures promoted to official" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_aStar(Combinations)" +msgid "`#2718 `__: pgr_aStar(Combinations)" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_aStarCost(Combinations)" +msgid "`#2718 `__: pgr_aStarCost(Combinations)" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_bdAstar(Combinations)" +msgid "`#2718 `__: pgr_bdAstar(Combinations)" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_bdAstarCost(Combinations)" +msgid "`#2718 `__: pgr_bdAstarCost(Combinations)" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_bdDijkstra(Combinations)" +msgid "`#2718 `__: pgr_bdDijkstra(Combinations)" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_bdDijkstraCost(Combinations)" +msgid "`#2718 `__: pgr_bdDijkstraCost(Combinations)" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_dijkstra(Combinations)" +msgid "`#2718 `__: pgr_dijkstra(Combinations)" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_dijkstraCost(Combinations)" +msgid "`#2718 `__: pgr_dijkstraCost(Combinations)" msgstr "" -msgid "" -"`#2718 `__: pgr_KSP(All " -"signatures)" +msgid "`#2718 `__: pgr_KSP(All signatures)" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_boykovKolmogorov(Combinations)" +msgid "`#2718 `__: pgr_boykovKolmogorov(Combinations)" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_edmondsKarp(Combinations)" +msgid "`#2718 `__: pgr_edmondsKarp(Combinations)" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_maxFlow(Combinations)" +msgid "`#2718 `__: pgr_maxFlow(Combinations)" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_pushRelabel(Combinations)" +msgid "`#2718 `__: pgr_pushRelabel(Combinations)" msgstr "" msgid "New experimental functions." @@ -4445,29 +4001,22 @@ msgstr "" msgid "Metrics" msgstr "" -msgid "" -"`#2951 `__: pgr_bandwidth" +msgid "`#2951 `__: pgr_bandwidth" msgstr "" msgid "Ordering" msgstr "" -msgid "" -"`#2954 `__: " -"pgr_kingOrdering" +msgid "`#2954 `__: pgr_kingOrdering" msgstr "" -msgid "" -"`#2955 `__: " -"pgr_sloanOrdering" +msgid "`#2955 `__: pgr_sloanOrdering" msgstr "" msgid "SQL signatures and output standardization" msgstr "" -msgid "" -"`#2904 `__: Standardize " -"output columns of functions with different output" +msgid "`#2904 `__: Standardize output columns of functions with different output" msgstr "" msgid "columns within overloads" @@ -4476,686 +4025,421 @@ msgstr "" msgid "Standardized to |short-generic-result|" msgstr "" -msgid "" -"`#2905 `__: " -"pgr_withPoints" +msgid "`#2905 `__: pgr_withPoints" msgstr "" -msgid "" -"`#2906 `__: " -"pgr_bdDijkstra" +msgid "`#2906 `__: pgr_bdDijkstra" msgstr "" -msgid "" -"`#2907 `__: " -"pgr_bellmanFord" +msgid "`#2907 `__: pgr_bellmanFord" msgstr "" -msgid "" -"`#2908 `__: " -"pgr_binaryBreadthFirstSearch" +msgid "`#2908 `__: pgr_binaryBreadthFirstSearch" msgstr "" -msgid "" -"`#2910 `__: " -"pgr_edwardMoore" +msgid "`#2910 `__: pgr_edwardMoore" msgstr "" -msgid "" -"`#2913 `__: " -"pgr_dagShortestPath" +msgid "`#2913 `__: pgr_dagShortestPath" msgstr "" msgid "Standardized to |matrix-result|" msgstr "" -msgid "" -"`#2905 `__: " -"pgr_withPointsCost" +msgid "`#2905 `__: pgr_withPointsCost" msgstr "" -msgid "" -"`#2905 `__: " -"pgr_withPointsCostMatrix" +msgid "`#2905 `__: pgr_withPointsCostMatrix" msgstr "" msgid "Standardized to |generic-result|" msgstr "" -msgid "" -"`#2909 `__: " -"pgr_edgeDisjointPaths" +msgid "`#2909 `__: pgr_edgeDisjointPaths" msgstr "" -msgid "" -"`#2909 `__: " -"pgr_turnRestrictedPath" +msgid "`#2909 `__: pgr_turnRestrictedPath" msgstr "" msgid "Standardized to |result_edge_color|" msgstr "" -msgid "" -"`#2924 `__: " -"pgr_edgeColoring" +msgid "`#2924 `__: pgr_edgeColoring" msgstr "" msgid "Standardized to |result_node_color|" msgstr "" -msgid "" -"`#2924 `__: pgr_bipartite" +msgid "`#2924 `__: pgr_bipartite" msgstr "" -msgid "" -"`#2927 `__: " -"pgr_sequentialVertexColoring" +msgid "`#2927 `__: pgr_sequentialVertexColoring" msgstr "" msgid "Standardized to |result-spantree|" msgstr "" -msgid "" -"`#2931 `__: " -"pgr_breadthFirstSearch" +msgid "`#2931 `__: pgr_breadthFirstSearch" msgstr "" -msgid "" -"`#2931 `__: " -"pgr_depthFirstSearch" +msgid "`#2931 `__: pgr_depthFirstSearch" msgstr "" msgid "Standardized to |result_node_order|" msgstr "" -msgid "" -"`#2934 `__: " -"pgr_topologicalSort" +msgid "`#2934 `__: pgr_topologicalSort" msgstr "" msgid "Standardized to |result-closure|" msgstr "" -msgid "" -"`#2934 `__: " -"pgr_transitiveClosure" +msgid "`#2934 `__: pgr_transitiveClosure" msgstr "" msgid "Removal of SQL deprecated signatures" msgstr "" -msgid "" -"`#2798 `__: " -"pgr_contraction" +msgid "`#2798 `__: pgr_contraction" msgstr "" -msgid "" -"`#2683 `__: pgr_trsp" +msgid "`#2683 `__: pgr_trsp" msgstr "" -msgid "" -"`#2683 `__: pgr_trspVia" +msgid "`#2683 `__: pgr_trspVia" msgstr "" -msgid "" -"`#2888 `__: " -"pgr_findCloseEdges" +msgid "`#2888 `__: pgr_findCloseEdges" msgstr "" -msgid "" -"pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" +msgid "pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" msgstr "" -msgid "" -"pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" +msgid "pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" msgstr "" -msgid "" -"`#2890 `__: " -"pgr_withPointsDD" +msgid "`#2890 `__: pgr_withPointsDD" msgstr "" -msgid "" -"`#2895 `__: " -"pgr_withPointsKSP" +msgid "`#2895 `__: pgr_withPointsKSP" msgstr "" -msgid "" -"`#2899 `__: " -"pgr_maxCardinalityMatch" +msgid "`#2899 `__: pgr_maxCardinalityMatch" msgstr "" msgid "`#2901 `__: pgr_TSP" msgstr "" -msgid "" -"`#2901 `__: " -"pgr_TSPeuclidean" +msgid "`#2901 `__: pgr_TSPeuclidean" msgstr "" msgid "Removal of SQL deprecated functions" msgstr "" -msgid "" -"`#2681 `__: " -"pgr_trspViaedges" +msgid "`#2681 `__: pgr_trspViaedges" msgstr "" -msgid "" -"`#2682 `__: " -"pgr_trspViaVertices" +msgid "`#2682 `__: pgr_trspViaVertices" msgstr "" -msgid "" -"`#2748 `__: " -"pgr_alphaShape" +msgid "`#2748 `__: pgr_alphaShape" msgstr "" -msgid "" -"`#2751 `__: " -"pgr_createTopology" +msgid "`#2751 `__: pgr_createTopology" msgstr "" -msgid "" -"`#2752 `__: " -"pgr_analyzeGraph" +msgid "`#2752 `__: pgr_analyzeGraph" msgstr "" -msgid "" -"`#2755 `__: " -"pgr_analyzeOneWay" +msgid "`#2755 `__: pgr_analyzeOneWay" msgstr "" -msgid "" -"`#2827 `__: " -"pgr_createVerticesTable" +msgid "`#2827 `__: pgr_createVerticesTable" msgstr "" -msgid "" -"`#2886 `__: " -"pgr_nodeNetwork" +msgid "`#2886 `__: pgr_nodeNetwork" msgstr "" msgid "Removal of SQL deprecated internal functions" msgstr "" -msgid "" -"`#2748 `__ " -"_pgr_alphaShape(text,double precision)" +msgid "`#2748 `__ _pgr_alphaShape(text,double precision)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_checkVertTab(text,text[],integer,text)" +msgid "`#2861 `__ _pgr_checkVertTab(text,text[],integer,text)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_createIndex(text,text,text,integer,text)" +msgid "`#2861 `__ _pgr_createIndex(text,text,text,integer,text)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_createIndex(text,text,text,text,integer,text)" +msgid "`#2861 `__ _pgr_createIndex(text,text,text,text,integer,text)" msgstr "" -msgid "" -"`#2913 `__ " -"_pgr_dagShortestPath(text,anyarray,anyarray,boolean,boolean)" +msgid "`#2913 `__ _pgr_dagShortestPath(text,anyarray,anyarray,boolean,boolean)" msgstr "" -msgid "" -"`#2913 `__ " -"_pgr_dagShortestPath(text,text,boolean,boolean)" +msgid "`#2913 `__ _pgr_dagShortestPath(text,text,boolean,boolean)" msgstr "" -msgid "" -"`#2730 `__ " -"_pgr_dijkstraNear(text,anyarray,anyarray,bigint,boolean)" +msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,anyarray,bigint,boolean)" msgstr "" -msgid "" -"`#2730 `__ " -"_pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)" +msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)" msgstr "" -msgid "" -"`#2730 `__ " -"_pgr_dijkstraNear(text,bigint,anyarray,bigint,boolean)" +msgid "`#2730 `__ _pgr_dijkstraNear(text,bigint,anyarray,bigint,boolean)" msgstr "" -msgid "" -"`#2730 `__ " -"_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" +msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" msgstr "" -msgid "" -"`#2730 `__ " -"_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" +msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" msgstr "" -msgid "" -"`#2730 `__ " -"_pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" +msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" msgstr "" -msgid "" -"`#2730 `__ " -"_pgr_dijkstra(text,text,boolean,boolean,boolean)" +msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,boolean)" msgstr "" -msgid "" -"`#2735 `__ " -"_pgr_drivingDistance(text,anyarray,double precision,boolean,boolean)" +msgid "`#2735 `__ _pgr_drivingDistance(text,anyarray,double precision,boolean,boolean)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_endPoint(geometry)" +msgid "`#2861 `__ _pgr_endPoint(geometry)" msgstr "" -msgid "" -"`#2861 `__ " -"__pgr_getColumnName(text,text,integer,text)" +msgid "`#2861 `__ __pgr_getColumnName(text,text,integer,text)" msgstr "" -msgid "" -"`#2861 `__ " -"__pgr_getColumnName(text,text,text,integer,text)" +msgid "`#2861 `__ __pgr_getColumnName(text,text,text,integer,text)" msgstr "" -msgid "" -"`#2861 `__ " -"__pgr_getColumnType(text,text,integer,text)" +msgid "`#2861 `__ __pgr_getColumnType(text,text,integer,text)" msgstr "" -msgid "" -"`#2861 `__ " -"__pgr_getColumnType(text,text,text,integer,text)" +msgid "`#2861 `__ __pgr_getColumnType(text,text,text,integer,text)" msgstr "" -msgid "" -"`#2861 `__ " -"__pgr_getTableName(text,integer,text)" +msgid "`#2861 `__ __pgr_getTableName(text,integer,text)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_isColumnIndexed(text,text,integer,text)" +msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,integer,text)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_isColumnIndexed(text,text,text,integer,text)" +msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,text,integer,text)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_isColumnIntable(text,text)" +msgid "`#2861 `__ _pgr_isColumnIntable(text,text)" msgstr "" -msgid "" -"`#2745 `__ " -"_pgr_kruskal(text,anyarray,text,bigint,double precision)" +msgid "`#2745 `__ _pgr_kruskal(text,anyarray,text,bigint,double precision)" msgstr "" -msgid "" -"`#2897 `__ _pgr_ksp(text," -"anyarray,anyarray,integer,boolean,boolean,boolean)" +msgid "`#2897 `__ _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean)" msgstr "" -msgid "" -"`#2897 `__ _pgr_ksp(text," -"bigint,bigint,integer,boolean,boolean)" +msgid "`#2897 `__ _pgr_ksp(text,bigint,bigint,integer,boolean,boolean)" msgstr "" -msgid "" -"`#2897 `__ _pgr_ksp(text," -"text,integer,boolean,boolean)" +msgid "`#2897 `__ _pgr_ksp(text,text,integer,boolean,boolean)" msgstr "" -msgid "" -"`#2899 `__ " -"_pgr_maxCardinalityMatch(text,boolean)" +msgid "`#2899 `__ _pgr_maxCardinalityMatch(text,boolean)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_msg(integer,text,text)" +msgid "`#2861 `__ _pgr_msg(integer,text,text)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_onerror(boolean,integer,text,text,text,text)" +msgid "`#2861 `__ _pgr_onerror(boolean,integer,text,text,text,text)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_pointtoid(geometry,double precision,text,integer)" +msgid "`#2861 `__ _pgr_pointtoid(geometry,double precision,text,integer)" msgstr "" -msgid "" -"`#2743 `__ " -"_pgr_prim(text,anyarray,text,bigint,double precision)" +msgid "`#2743 `__ _pgr_prim(text,anyarray,text,bigint,double precision)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_quote_ident(text)" +msgid "`#2861 `__ _pgr_quote_ident(text)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_startPoint(geometry)" +msgid "`#2861 `__ _pgr_startPoint(geometry)" msgstr "" -msgid "" -"`#2683 `__ " -"_pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean,text)" +msgid "`#2683 `__ _pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" msgstr "" -msgid "" -"`#2683 `__ " -"_pgr_trsp(text,text,anyarray,anyarray,boolean)" +msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,anyarray,boolean)" msgstr "" -msgid "" -"`#2683 `__ " -"_pgr_trsp(text,text,anyarray,bigint,boolean)" +msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,bigint,boolean)" msgstr "" -msgid "" -"`#2683 `__ " -"_pgr_trsp(text,text,bigint,anyarray,boolean)" +msgid "`#2683 `__ _pgr_trsp(text,text,bigint,anyarray,boolean)" msgstr "" -msgid "" -"`#2683 `__ " -"_pgr_trsp(text,text,bigint,bigint,boolean)" +msgid "`#2683 `__ _pgr_trsp(text,text,bigint,bigint,boolean)" msgstr "" -msgid "" -"`#2682 `__ " -"_pgr_trspViaVertices(text,integer[],boolean,boolean,text)" +msgid "`#2682 `__ _pgr_trspViaVertices(text,integer[],boolean,boolean,text)" msgstr "" -msgid "" -"`#2919 `__ " -"_pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean," -"character,boolean)" +msgid "`#2919 `__ _pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"_pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character," -"boolean)" +msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"_pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" +msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" msgstr "" -msgid "" -"`#2901 `__ " -"_pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer," -"integer,double precision,double precision,double precision,boolean)" +msgid "`#2901 `__ _pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgstr "" -msgid "" -"`#2901 `__ _pgr_tsp(text," -"bigint,bigint,double precision,integer,integer,integer,double precision," -"double precision,double precision,boolean)" +msgid "`#2901 `__ _pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_versionLess(text,text)" +msgid "`#2861 `__ _pgr_versionLess(text,text)" msgstr "" -msgid "" -"`#2890 `__ " -"_pgr_withPointsDD(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" +msgid "`#2890 `__ _pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" msgstr "" -msgid "" -"`#2895 `__ " -"_pgr_withPointsKSP(text,text,anyarray,anyarray,integer,character,boolean," -"boolean,boolean,boolean)" +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean)" msgstr "" -msgid "" -"`#2895 `__ " -"_pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character," -"boolean)" +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" msgstr "" -msgid "" -"`#2895 `__ " -"_pgr_withPointsKSP(text,text,text,integer,character,boolean,boolean,boolean)" +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,text,integer,character,boolean,boolean,boolean)" msgstr "" -msgid "" -"`#2741 `__ " -"_pgr_withPointsVia(text,bigint[],double precision[],boolean)" +msgid "`#2741 `__ _pgr_withPointsVia(text,bigint[],double precision[],boolean)" msgstr "" -msgid "" -"`#2741 `__ " -"_pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character," -"boolean)" +msgid "`#2741 `__ _pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "" -msgid "" -"`#2683 `__ _trsp(text," -"text,anyarray,anyarray,boolean)" +msgid "`#2683 `__ _trsp(text,text,anyarray,anyarray,boolean)" msgstr "" -msgid "" -"`#2683 `__ _v4trsp(text," -"text,anyarray,anyarray,boolean)" +msgid "`#2683 `__ _v4trsp(text,text,anyarray,anyarray,boolean)" msgstr "" -msgid "" -"`#2683 `__ _v4trsp(text," -"text,text,boolean)" +msgid "`#2683 `__ _v4trsp(text,text,text,boolean)" msgstr "" msgid "Summary of functions and signatures no longer on pgrouting" msgstr "" -msgid "" -"`#2748 `__ " -"pgr_alphashape(geometry,double precision)" +msgid "`#2748 `__ pgr_alphashape(geometry,double precision)" msgstr "" -msgid "" -"`#2752 `__ " -"pgr_analyzegraph(text,double precision,text,text,text,text,text)" +msgid "`#2752 `__ pgr_analyzegraph(text,double precision,text,text,text,text,text)" msgstr "" -msgid "" -"`#2755 `__ " -"pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)" +msgid "`#2755 `__ pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)" msgstr "" -msgid "" -"`#2798 `__ " -"pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgid "`#2798 `__ pgr_contraction(text,bigint[],integer,bigint[],boolean)" msgstr "" -msgid "" -"`#2751 `__ " -"pgr_createtopology(text,double precision,text,text,text,text,text,boolean)" +msgid "`#2751 `__ pgr_createtopology(text,double precision,text,text,text,text,text,boolean)" msgstr "" -msgid "" -"`#2827 `__ " -"pgr_createverticestable(text,text,text,text,text)" +msgid "`#2827 `__ pgr_createverticestable(text,text,text,text,text)" msgstr "" -msgid "" -"`#2888 `__ " -"pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" +msgid "`#2888 `__ pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" msgstr "" -msgid "" -"`#2888 `__ " -"pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" +msgid "`#2888 `__ pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" msgstr "" -msgid "" -"`#2899 `__ " -"pgr_maxCardinalityMatch(text,boolean)" +msgid "`#2899 `__ pgr_maxCardinalityMatch(text,boolean)" msgstr "" -msgid "" -"`#2886 `__ " -"pgr_nodenetwork(text,double precision,text,text,text,text,boolean)" +msgid "`#2886 `__ pgr_nodenetwork(text,double precision,text,text,text,text,boolean)" msgstr "" -msgid "" -"`#2683 `__ pgr_trsp(text," -"integer,double precision,integer,double precision,boolean,boolean,text)" +msgid "`#2683 `__ pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" msgstr "" -msgid "" -"`#2683 `__ pgr_trsp(text," -"integer,integer,boolean,boolean,text)" +msgid "`#2683 `__ pgr_trsp(text,integer,integer,boolean,boolean,text)" msgstr "" -msgid "" -"`#2681 `__ " -"pgr_trspViaedges(text,integer[],double precision[],boolean,boolean,text)" +msgid "`#2681 `__ pgr_trspViaedges(text,integer[],double precision[],boolean,boolean,text)" msgstr "" -msgid "" -"`#2682 `__ " -"pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" +msgid "`#2682 `__ pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean," -"character,boolean)" +msgid "`#2919 `__ pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character," -"boolean)" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" msgstr "" -msgid "" -"`#2901 `__ " -"pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer," -"double precision,double precision,double precision,boolean)" +msgid "`#2901 `__ pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgstr "" -msgid "" -"`#2901 `__ pgr_tsp(text," -"bigint,bigint,double precision,integer,integer,integer,double precision," -"double precision,double precision,boolean)" +msgid "`#2901 `__ pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPointsCostMatrix(text,text,anyarray,boolean,character)" +msgid "`#2919 `__ pgr_withPointsCostMatrix(text,text,anyarray,boolean,character)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,anyarray,anyarray,boolean,character)" +msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,anyarray,boolean,character)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,anyarray,bigint,boolean,character)" +msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,bigint,boolean,character)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,bigint,anyarray,boolean,character)" +msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,anyarray,boolean,character)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,bigint,bigint,boolean,character)" +msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,bigint,boolean,character)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,text,boolean,character)" +msgid "`#2919 `__ pgr_withPointsCost(text,text,text,boolean,character)" msgstr "" -msgid "" -"`#2890 `__ " -"pgr_withPointsDD(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" +msgid "`#2890 `__ pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" msgstr "" -msgid "" -"`#2890 `__ " -"pgr_withPointsDD(text,text,bigint,double precision,boolean,character,boolean)" +msgid "`#2890 `__ pgr_withPointsDD(text,text,bigint,double precision,boolean,character,boolean)" msgstr "" -msgid "" -"`#2895 `__ " -"pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character," -"boolean)" +msgid "`#2895 `__ pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPoints(text,text,anyarray,anyarray,boolean,character,boolean)" +msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,anyarray,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPoints(text,text,anyarray,bigint,boolean,character,boolean)" +msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,bigint,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPoints(text,text,bigint,anyarray,boolean,character,boolean)" +msgid "`#2919 `__ pgr_withPoints(text,text,bigint,anyarray,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPoints(text,text,bigint,bigint,boolean,character,boolean)" +msgid "`#2919 `__ pgr_withPoints(text,text,bigint,bigint,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPoints(text,text,text,boolean,character,boolean)" +msgid "`#2919 `__ pgr_withPoints(text,text,text,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character," -"boolean)" +msgid "`#2919 `__ pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "" msgid "Code enhancements" @@ -5218,14 +4502,10 @@ msgstr "" msgid "`#2683 `__ _v4trsp" msgstr "" -msgid "" -"`#2748 `__ " -"_pgr_alphaShape" +msgid "`#2748 `__ _pgr_alphaShape" msgstr "" -msgid "" -"`#2913 `__ " -"_pgr_dagShortestPath" +msgid "`#2913 `__ _pgr_dagShortestPath" msgstr "" msgid "All releases" @@ -5234,10 +4514,7 @@ msgstr "" msgid "Kruskal - Family of functions" 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." +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 "**The main Characteristics are:**" @@ -5255,9 +4532,7 @@ msgstr "" msgid "Migration guide" msgstr "" -msgid "" -"Several functions are having changes on the signatures, and/or have been " -"replaced by new functions." +msgid "Several functions are having changes on the signatures, and/or have been replaced by new functions." msgstr "" msgid "Results can be different because of the changes." @@ -5269,9 +4544,7 @@ msgstr "" msgid "Migration to standardized columns" msgstr "" -msgid "" -"There has been an effort to standardize function output columns names and " -"types." +msgid "There has been an effort to standardize function output columns names and types." msgstr "" msgid ":ref:`pgRouting-concepts:Result columns for cost functions`" @@ -5355,14 +4628,10 @@ msgstr "" msgid "Migration of cost functions" msgstr "" -msgid "" -"The standardized :ref:`pgRouting-concepts:Result columns for cost functions` " -"are |matrix-result|" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for cost functions` are |matrix-result|" msgstr "" -msgid "" -"The following functions need to be migrated when they are being used in an " -"application." +msgid "The following functions need to be migrated when they are being used in an application." msgstr "" msgid "Version" @@ -5410,17 +4679,13 @@ msgstr "" msgid "Breaking change" msgstr "" -msgid "" -"If using ``pgr_withPointsCost``: column names must be changed after updating " -"pgRouting" +msgid "If using ``pgr_withPointsCost``: column names must be changed after updating pgRouting" msgstr "" msgid "New output columns are |matrix-result|" msgstr "" -msgid "" -"To get the old version column names: rename ``start_vid`` to ``start_pid`` " -"and ``end_vid`` to ``end_pid``." +msgid "To get the old version column names: rename ``start_vid`` to ``start_pid`` and ``end_vid`` to ``end_pid``." msgstr "" msgid "Examples" @@ -5432,9 +4697,7 @@ msgstr "" msgid "Using ``pgr_withPointsCost``" msgstr "" -msgid "" -"Migrating `this v3.8 `__ example." +msgid "Migrating `this v3.8 `__ example." msgstr "" msgid "from" @@ -5446,41 +4709,31 @@ msgstr "" msgid "Examples for One to Many for cost functions" msgstr "" -msgid "" -"Migrating `this v3.8 `__ example." +msgid "Migrating `this v3.8 `__ example." msgstr "" msgid "Examples for Many to One for cost functions" msgstr "" -msgid "" -"Migrating `this v3.8 `__ example." +msgid "Migrating `this v3.8 `__ example." msgstr "" msgid "Examples for Many to Many for cost functions" msgstr "" -msgid "" -"Migrating `this v3.8 `__ example." +msgid "Migrating `this v3.8 `__ example." msgstr "" msgid "Examples for Combinations for cost functions" msgstr "" -msgid "" -"Migrating `this v3.8 `__ example." +msgid "Migrating `this v3.8 `__ example." msgstr "" msgid "Migration of multiple paths functions" msgstr "" -msgid "" -"The standardized :ref:`pgRouting-concepts:Result columns for single path " -"functions` are |nksp-result|" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |nksp-result|" msgstr "" msgid "``pgr_KSP``" @@ -5510,9 +4763,7 @@ msgstr "" msgid "One to One example using ``pgr_KSP``" msgstr "" -msgid "" -"Using `this `__ " -"example." +msgid "Using `this `__ example." msgstr "" msgid "Migration of |result-disjoint|" @@ -5530,9 +4781,7 @@ msgstr "" msgid "One to One example using ``pgr_edgeDisjointPaths``" msgstr "" -msgid "" -"Migrating `this v3.8 `__ example." +msgid "Migrating `this v3.8 `__ example." msgstr "" msgid "Before updating pgRouting enumerate the columns: |ksp-result|" @@ -5541,9 +4790,7 @@ msgstr "" msgid "Migration of single path functions" msgstr "" -msgid "" -"The standardized :ref:`pgRouting-concepts:Result columns for single path " -"functions` are |short-generic-result|" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |short-generic-result|" msgstr "" msgid "``pgr_dijkstra``" @@ -5582,9 +4829,7 @@ msgstr "" msgid "Migration of |old-generic-result|" msgstr "" -msgid "" -"Before updating pgRouting, enumerate the corresponding columns of the " -"signature" +msgid "Before updating pgRouting, enumerate the corresponding columns of the signature" msgstr "" msgid "Migration of |old-pid-result|" @@ -5605,9 +4850,7 @@ msgstr "" msgid "``end_vid`` to ``end_pid``" msgstr "" -msgid "" -"If using ``pgr_withPoints``: column names must be changed after updating " -"pgRouting" +msgid "If using ``pgr_withPoints``: column names must be changed after updating pgRouting" msgstr "" msgid "Migration of |result-1-1|" @@ -5625,9 +4868,7 @@ msgstr "" msgid "Using ``pgr_aStar``" msgstr "" -msgid "" -"Migrating `this v3.5 `__ example." +msgid "Migrating `this v3.5 `__ example." msgstr "" msgid "Before updating pgRouting enumerate the columns: |result-1-1|" @@ -5636,17 +4877,13 @@ msgstr "" msgid "Using ``pgr_bdDijkstra``" msgstr "" -msgid "" -"Migrating `this v3.8 `__ example." +msgid "Migrating `this v3.8 `__ example." msgstr "" msgid "Using ``pgr_DAGshortestPath``" msgstr "" -msgid "" -"Migrating `this v3.8 `__ example." +msgid "Migrating `this v3.8 `__ example." msgstr "" msgid "This applies to all signatures of ``pgr_DAGshortestPath``" @@ -5658,9 +4895,7 @@ msgstr "" msgid "Using ``pgr_bdAstar``" msgstr "" -msgid "" -"Migrating `this v3.5 `__ example." +msgid "Migrating `this v3.5 `__ example." msgstr "" msgid "Before updating pgRouting enumerate the columns: |result-1-m|" @@ -5669,25 +4904,19 @@ msgstr "" msgid "Using ``pgr_withPoints``" msgstr "" -msgid "" -"Migrating `this v3.8 `__ example." +msgid "Migrating `this v3.8 `__ example." msgstr "" msgid "|pid-1-m|" msgstr "" -msgid "" -"To get the old signature column names: filter out the column ``start_vid`` " -"and rename ``end_vid`` to ``end_pid``." +msgid "To get the old signature column names: filter out the column ``start_vid`` and rename ``end_vid`` to ``end_pid``." msgstr "" msgid "Examples for Many to One with one route result" msgstr "" -msgid "" -"Migrating `this v3.8 `__ example." +msgid "Migrating `this v3.8 `__ example." msgstr "" msgid "Before updating pgRouting enumerate the columns: |result-m-1|" @@ -5696,17 +4925,13 @@ msgstr "" msgid "Using ``pgr_dijkstra``" msgstr "" -msgid "" -"Migrating `this v3.4 `__ example." +msgid "Migrating `this v3.4 `__ example." msgstr "" msgid "Examples for Many to Many with one route result" msgstr "" -msgid "" -"Migrating `this v3.8 `__ example." +msgid "Migrating `this v3.8 `__ example." msgstr "" msgid "|pid-m-m|" @@ -5715,17 +4940,13 @@ msgstr "" msgid "Examples for combinations with one route result" msgstr "" -msgid "" -"Migrating `this v3.8 `this `__ example." +msgid "Migrating `this v3.8 `this `__ example." msgstr "" msgid "Migration of spanning tree functions" msgstr "" -msgid "" -"The standardized :ref:`pgRouting-concepts:Result columns for spanning tree " -"functions` are |result-spantree|" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for spanning tree functions` are |result-spantree|" msgstr "" msgid "``pgr_drivingDistance``" @@ -5791,9 +5012,7 @@ msgstr "" msgid "Single vertex example using ``pgr_kruskalDD``" msgstr "" -msgid "" -"Migrating `this v3.6 `__ example." +msgid "Migrating `this v3.6 `__ example." msgstr "" msgid "Before updating pgRouting enumerate the columns: |result-bfs|." @@ -5802,9 +5021,7 @@ msgstr "" msgid "Multiple vertices example using ``pgr_kruskalDFS``" msgstr "" -msgid "" -"Migrating `this v3.6 `__ example." +msgid "Migrating `this v3.6 `__ example." msgstr "" msgid "Migration from |result-dij-dd|" @@ -5837,9 +5054,7 @@ msgstr "" msgid "Single vertex example using ``pgr_drivingDistance``" msgstr "" -msgid "" -"Migrating `this v3.5 `__ example." +msgid "Migrating `this v3.5 `__ example." msgstr "" msgid "Before updating pgRouting, enumerate |result-1-1-no-seq| columns" @@ -5848,14 +5063,10 @@ msgstr "" msgid "Multiple vertices example using ``pgr_drivingDistance``" msgstr "" -msgid "" -"Migrating `this v3.5 `__ example." +msgid "Migrating `this v3.5 `__ example." msgstr "" -msgid "" -"To get the old version column names |result-dij-dd-m|: filter out the column " -"``pred`` and ``depth`` and rename ``start_vid`` to ``from_v``." +msgid "To get the old version column names |result-dij-dd-m|: filter out the column ``pred`` and ``depth`` and rename ``start_vid`` to ``from_v``." msgstr "" msgid "Migration of |result-generic-no-seq|" @@ -5867,9 +5078,7 @@ msgstr "" msgid "Enumerate |result-1-1-no-seq| columns" msgstr "" -msgid "" -"Use an unnamed valid value for **driving side** after the **distance** " -"parameter." +msgid "Use an unnamed valid value for **driving side** after the **distance** parameter." msgstr "" msgid "Enumerate |result-m-1-no-seq| columns" @@ -5878,9 +5087,7 @@ msgstr "" msgid "Default value of **driving side** parameter" msgstr "" -msgid "" -"**driving side** parameter is unnamed, and valid values differ for directed " -"and undirected graphs." +msgid "**driving side** parameter is unnamed, and valid values differ for directed and undirected graphs." msgstr "" msgid "In directed graph: valid values are [``r``, ``R``, ``l``, ``L``]" @@ -5898,17 +5105,13 @@ msgstr "" msgid "Single vertex example using ``pgr_withPointsDD``" msgstr "" -msgid "" -"Migrating `this v3.5 `__ example." +msgid "Migrating `this v3.5 `__ example." msgstr "" msgid "Multiple vertices example using ``pgr_withPointsDD``" msgstr "" -msgid "" -"Migrating `this v3.5 `__ example." +msgid "Migrating `this v3.5 `__ example." msgstr "" msgid "Migration of output column name change" @@ -6034,9 +5237,7 @@ msgstr "" msgid "If you have SFCGAL, which you can install using" msgstr "" -msgid "" -"Since PostGIS 3.5+ use `CG_AlphaShape `__" +msgid "Since PostGIS 3.5+ use `CG_AlphaShape `__" msgstr "" msgid "For PostGIS 3.5+ use the old name ``ST_AlphaShape``" @@ -6054,9 +5255,7 @@ msgstr "" msgid "Migration of ``pgr_nodeNetwork``" msgstr "" -msgid "" -"**Before Deprecation:** A table with `_nodded` was created. with " -"split edges." +msgid "**Before Deprecation:** A table with `_nodded` was created. with split edges." msgstr "" msgid "**Migration**" @@ -6071,61 +5270,37 @@ msgstr "" msgid "A table with `_vertices_pgr` was created." msgstr "" -msgid "" -"**After Deprecation:** The user is responsible to create the complete " -"topology." +msgid "**After Deprecation:** The user is responsible to create the complete topology." msgstr "" msgid "Build a routing topology" msgstr "" -msgid "" -"The basic information to use the majority of the pgRouting functions ``id, " -"source, target, cost, [reverse_cost]`` is what in pgRouting is called the " -"routing topology." +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 "" -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." +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 "" -msgid "" -"When the data comes with geometries and there is no routing topology, then " -"this step is needed." +msgid "When the data comes with geometries and there is no routing topology, then this step is needed." msgstr "" -msgid "" -"All the start and end vertices of the geometries need an identifier that is " -"to be stored in a ``source`` and ``target`` columns of the table of the " -"data. Likewise, ``cost`` and ``reverse_cost`` need to have the value of " -"traversing the edge in both directions." +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 "" -msgid "" -"If the columns do not exist they need to be added to the table in question. " -"(see `ALTER TABLE `__)" +msgid "If the columns do not exist they need to be added to the table in question. (see `ALTER TABLE `__)" msgstr "" -msgid "" -"The function :doc:`pgr_extractVertices` is used to create a vertices table " -"based on the edge identifier and the geometry of the edge of the graph." +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 "" -msgid "" -"Finally using the data stored on the vertices tables the ``source`` and " -"``target`` are filled up." +msgid "Finally using the data stored on the vertices tables the ``source`` and ``target`` are filled up." msgstr "" msgid "Migration of ``pgr_createVerticesTable``" msgstr "" -msgid "" -"**After Deprecation:** The user is responsible to create the vertices table, " -"indexes, etc. They may use :doc:`pgr_extractVertices` for that purpose." +msgid "**After Deprecation:** The user is responsible to create the vertices table, indexes, etc. They may use :doc:`pgr_extractVertices` for that purpose." msgstr "" msgid "Migration of ``pgr_analyzeOneWay``" @@ -6143,14 +5318,10 @@ msgstr "" msgid "Dead ends." msgstr "" -msgid "" -"A routing problem can arise when from a vertex there is only a way on or a " -"way out but not both:" +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 "" -"Either saving or using directly :doc:`pgr_extractVertices` get the dead ends " -"information and determine if the adjacent edge is one way or not." +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 "In this example :doc:`pgr_extractVertices` has already been applied." @@ -6159,10 +5330,7 @@ msgstr "" msgid "Bridges." msgstr "" -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." +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 "To determine if the bridges are or not one way." @@ -6219,9 +5387,7 @@ msgstr "" msgid "Components." msgstr "" -msgid "" -"Instead of counting only isolated segments, determine all the components of " -"the graph." +msgid "Instead of counting only isolated segments, determine all the components of the graph." msgstr "" msgid "Depending of the final application requirements use:" @@ -6239,32 +5405,22 @@ msgstr "" msgid "For example:" msgstr "" -msgid "" -"Instead of counting the dead ends, determine all the dead ends of the graph " -"using :doc:`pgr_degree`." +msgid "Instead of counting the dead ends, determine all the dead ends of the graph using :doc:`pgr_degree`." msgstr "" msgid "Potential gaps near dead ends." msgstr "" -msgid "" -"Instead of counting potential gaps between geometries, determine the " -"geometric gaps in the graph using :doc:`pgr_findCloseEdges`." +msgid "Instead of counting potential gaps between geometries, determine the geometric gaps in the graph using :doc:`pgr_findCloseEdges`." msgstr "" msgid "Topological relationships." msgstr "" -msgid "" -"Instead of counting intersections, determine topological relationships " -"between geometries." +msgid "Instead of counting intersections, determine topological relationships between geometries." msgstr "" -msgid "" -"Several PostGIS functions can be used: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." +msgid "Several PostGIS functions can be used: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." msgstr "" msgid "Migration of ``pgr_trsp`` (Vertices)" @@ -6366,9 +5522,7 @@ msgstr "" msgid "Migration of ``pgr_withPointsKSP``" msgstr "" -msgid "" -"Starting from `v3.6.0 `__ :" -"doc:`pgr_withPointsKSP` result columns are being standardized." +msgid "Starting from `v3.6.0 `__ :doc:`pgr_withPointsKSP` result columns are being standardized." msgstr "" msgid "|ksp-result|" @@ -6377,9 +5531,7 @@ msgstr "" msgid "|generic-result|" msgstr "" -msgid "" -"And ``driving side`` parameter changed from named optional to unnamed " -"**driving side** and its validity differ for directed and undirected graphs." +msgid "And ``driving side`` parameter changed from named optional to unnamed **driving side** and its validity differ for directed and undirected graphs." msgstr "" msgid "``pgr_withPointsKSP`` (`One to One`)" @@ -6403,9 +5555,7 @@ msgstr "" msgid "New output columns are |generic-result|" msgstr "" -msgid "" -"Using `this `__ example." +msgid "Using `this `__ example." msgstr "" msgid "``start_vid`` contains the **start vid** parameter value." @@ -6414,9 +5564,7 @@ msgstr "" msgid "``end_vid`` contains the **end vid** parameter value." msgstr "" -msgid "" -"If needed filter out the additional columns, for example, to return the " -"original columns:" +msgid "If needed filter out the additional columns, for example, to return the original columns:" msgstr "" msgid "Use ``pgr_withPoints`` when there are no restrictions." @@ -6434,13 +5582,10 @@ msgstr "" msgid "Migration of ``pgr_maxCardinalityMatch``" msgstr "" -msgid "" -":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, therefore " -"the ``directed`` flag has been removed." +msgid ":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, therefore the ``directed`` flag has been removed." msgstr "" -msgid "" -"Starting from `v3.4.0 `__" +msgid "Starting from `v3.4.0 `__" msgstr "" msgid "Signature to be migrated:" @@ -6470,27 +5615,19 @@ msgstr "" msgid "Before migration" msgstr "" -msgid "" -"Columns used are ``going`` and ``coming`` to represent the existence of an " -"edge." +msgid "Columns used are ``going`` and ``coming`` to represent the existence of an edge." msgstr "" -msgid "" -"Flag ``directed`` was used to indicate if it was for a **directed** or " -"**undirected** graph." +msgid "Flag ``directed`` was used to indicate if it was for a **directed** or **undirected** graph." msgstr "" msgid "The flag ``directed`` is ignored." msgstr "" -msgid "" -"Regardless of it's value it gives the result considering the graph as " -"**undirected**." +msgid "Regardless of it's value it gives the result considering the graph as **undirected**." msgstr "" -msgid "" -"Use the columns ``cost`` and ``reverse_cost`` to represent the existence of " -"an edge." +msgid "Use the columns ``cost`` and ``reverse_cost`` to represent the existence of an edge." msgstr "" msgid "Do not use the flag ``directed``." @@ -6550,9 +5687,7 @@ msgstr "" msgid "Old restrictions contents" msgstr "" -msgid "" -"The restriction with ``rid = 2`` is representing :math:`3 \\rightarrow 5 " -"\\rightarrow9`" +msgid "The restriction with ``rid = 2`` is representing :math:`3 \\rightarrow 5 \\rightarrow9`" msgstr "" msgid ":math:`3\\rightarrow5`" @@ -6606,16 +5741,13 @@ msgstr "" msgid "Restrictions data" msgstr "" -msgid "" -"The restriction with ``rid = 2`` represents the path :math:`3 \\rightarrow5 " -"\\rightarrow9`." +msgid "The restriction with ``rid = 2`` represents the path :math:`3 \\rightarrow5 \\rightarrow9`." msgstr "" msgid "By inspection the path is clear." msgstr "" -msgid "" -"To transform the old restrictions table to the new restrictions structure," +msgid "To transform the old restrictions table to the new restrictions structure," msgstr "" msgid "Create a new table with the new restrictions structure." @@ -6624,9 +5756,7 @@ msgstr "" msgid "In this migration guide ``new_restrictions`` is been used." msgstr "" -msgid "" -"For this migration pgRouting supplies an auxiliary function for reversal of " -"an array ``_pgr_array_reverse`` needed for the migration." +msgid "For this migration pgRouting supplies an auxiliary function for reversal of an array ``_pgr_array_reverse`` needed for the migration." msgstr "" msgid "``_pgr_array_reverse``:" @@ -6653,9 +5783,7 @@ msgstr "" msgid "pgRouting Concepts" msgstr "" -msgid "" -"This is a simple guide that go through some of the steps for getting started " -"with pgRouting. This guide covers:" +msgid "This is a simple guide that go through some of the steps for getting started with pgRouting. This guide covers:" msgstr "" msgid "Graphs" @@ -6688,8 +5816,7 @@ msgstr "" msgid "Directed simple graph" msgstr "" -msgid "" -":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" +msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" msgstr "" msgid "Graphs:" @@ -6698,13 +5825,10 @@ msgstr "" msgid "Do not have geometries." msgstr "" -msgid "" -"Some graph theory problems require graphs to have weights, called **cost** " -"in pgRouting." +msgid "Some graph theory problems require graphs to have weights, called **cost** in pgRouting." msgstr "" -msgid "" -"In pgRouting there are several ways to represent a graph on the database:" +msgid "In pgRouting there are several ways to represent a graph on the database:" msgstr "" msgid "With ``cost``" @@ -6719,9 +5843,7 @@ msgstr "" msgid "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)" msgstr "" -msgid "" -"Identifier of the edge. Requirement to use the database in a consistent. " -"manner." +msgid "Identifier of the edge. Requirement to use the database in a consistent. manner." msgstr "" msgid "Identifier of a vertex." @@ -6730,20 +5852,16 @@ msgstr "" msgid "Weight of the edge (``source``, ``target``):" msgstr "" -msgid "" -"When negative the edge (``source``, ``target``) do not exist on the graph." +msgid "When negative the edge (``source``, ``target``) do not exist on the graph." msgstr "" msgid "``cost`` must exist in the query." msgstr "" -msgid "" -"When negative the edge (``target``, ``source``) do not exist on the graph." +msgid "When negative the edge (``target``, ``source``) do not exist on the graph." msgstr "" -msgid "" -"The decision of the graph to be **directed** or **undirected** is done when " -"executing a pgRouting algorithm." +msgid "The decision of the graph to be **directed** or **undirected** is done when executing a pgRouting algorithm." msgstr "" msgid "Graph with ``cost``" @@ -6758,9 +5876,7 @@ msgstr "" msgid "``SELECT id, source, target, cost FROM edges``" msgstr "" -msgid "" -":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} " -"\\ge 0 \\}`" +msgid ":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} \\ge 0 \\}`" msgstr "" msgid "Edges where ``cost`` is non negative are part of the graph." @@ -6772,9 +5888,7 @@ msgstr "" msgid "All vertices in ``source`` and ``target`` are part of the graph." msgstr "" -msgid "" -"In a directed graph the edge :math:`(source_{id}, target_{id}, cost_{id})` " -"has directionality: :math:`source_{id} \\rightarrow target_{id}`" +msgid "In a directed graph the edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`" msgstr "" msgid "For the following data:" @@ -6786,20 +5900,13 @@ msgstr "" msgid "The data is representing the following graph:" msgstr "" -msgid "" -"In an undirected graph the edge :math:`(source_{id}, target_{id}, " -"cost_{id})` does not have directionality: :math:`source_{id} \\frac{\\;\\;\\;" -"\\;\\;}{} target_{id}`" +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 "" -msgid "" -"In terms of a directed graph is like having two edges: :math:`source_{id} " -"\\leftrightarrow target_{id}`" +msgid "In terms of a directed graph is like having two edges: :math:`source_{id} \\leftrightarrow target_{id}`" msgstr "" -msgid "" -"Edge :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) is not part of the " -"graph." +msgid "Edge :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) is not part of the graph." msgstr "" msgid "Graph with ``cost`` and ``reverse_cost``" @@ -6811,21 +5918,13 @@ msgstr "" msgid "The set of edges :math:`E`:" msgstr "" -msgid "" -":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, " -"cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & " -"{\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } " -"reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" +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 "" -msgid "" -"Edges :math:`(source \\rightarrow target)` where ``cost`` is non negative " -"are part of the graph." +msgid "Edges :math:`(source \\rightarrow target)` where ``cost`` is non negative are part of the graph." msgstr "" -msgid "" -"Edges :math:`(target \\rightarrow source)` where ``reverse_cost`` is non " -"negative are part of the graph." +msgid "Edges :math:`(target \\rightarrow source)` where ``reverse_cost`` is non negative are part of the graph." msgstr "" msgid "The set of vertices :math:`V`:" @@ -6834,14 +5933,10 @@ msgstr "" msgid "In a directed graph both edges have directionality" msgstr "" -msgid "" -"edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:" -"`source_{id} \\rightarrow target_{id}`" +msgid "edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`" msgstr "" -msgid "" -"edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` has " -"directionality: :math:`target_{id} \\rightarrow source_{id}`" +msgid "edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` has directionality: :math:`target_{id} \\rightarrow source_{id}`" msgstr "" msgid "Edges not part of the graph:" @@ -6856,14 +5951,10 @@ msgstr "" msgid "In a directed graph both edges do not have directionality" msgstr "" -msgid "" -"Edge :math:`(source_{id}, target_{id}, cost_{id})` is :math:`source_{id} " -"\\frac{\\;\\;\\;\\;\\;}{} target_{id}`" +msgid "Edge :math:`(source_{id}, target_{id}, cost_{id})` is :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" msgstr "" -msgid "" -"Edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` is :math:" -"`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" +msgid "Edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` is :math:`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" msgstr "" msgid "In terms of a directed graph is like having four edges:" @@ -6884,18 +5975,13 @@ msgstr "" msgid "Graphs without geometries" msgstr "" -msgid "" -"Personal relationships, genealogy, file dependency problems can be solved " -"using pgRouting. Those problems, normally, do not come with geometries " -"associated with the graph." +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 "" msgid "Wiki example" msgstr "" -msgid "" -"Solve the example problem taken from `wikipedia `__):" +msgid "Solve the example problem taken from `wikipedia `__):" msgstr "" msgid "Problem is to find the shortest path from :math:`1` to :math:`5`." @@ -6904,8 +5990,7 @@ msgstr "" msgid "Is an undirected graph." msgstr "" -msgid "" -"Although visually looks like to have geometries, the drawing is not to scale." +msgid "Although visually looks like to have geometries, the drawing is not to scale." msgstr "" msgid "No geometries associated to the vertices or edges" @@ -6917,10 +6002,7 @@ msgstr "" msgid "Has 9 edges:" msgstr "" -msgid "" -":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\" -"\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & " -"(5,6,9) \\} \\end{align} \\end{split}`" +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 "" msgid "The graph can be represented in many ways for example:" @@ -6929,17 +6011,13 @@ msgstr "" msgid "Prepare the database" msgstr "" -msgid "" -"Create a database for the example, access the database and install " -"pgRouting: ::" +msgid "Create a database for the example, access the database and install pgRouting: ::" msgstr "" msgid "Create a table" msgstr "" -msgid "" -"The basic elements needed to perform basic routing on an undirected graph " -"are:" +msgid "The basic elements needed to perform basic routing on an undirected graph are:" msgstr "" msgid "SMALLINT, INTEGER, BIGINT, REAL, FLOAT" @@ -6957,9 +6035,7 @@ msgstr "" msgid "To solve this example :doc:`pgr_dijkstra` is used:" msgstr "" -msgid "" -"To go from :math:`1` to :math:`5` the path goes thru the following " -"vertices: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" +msgid "To go from :math:`1` to :math:`5` the path goes thru the following vertices: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" msgstr "" msgid "Vertex information" @@ -6974,16 +6050,13 @@ msgstr "" msgid "Create a routing Database" msgstr "" -msgid "" -"The first step is to create a database and load pgRouting in the database." +msgid "The first step is to create a database and load pgRouting in the database." msgstr "" msgid "Typically create a database for each project." msgstr "" -msgid "" -"Once having the database to work in, load your data and build the routing " -"application in that database." +msgid "Once having the database to work in, load your data and build the routing application in that database." msgstr "" msgid "Load Data" @@ -7001,9 +6074,7 @@ msgstr "" msgid ":doc:`sampledata`: a small graph used in the documentation examples" msgstr "" -msgid "" -"Using `osm2pgrouting `__" +msgid "Using `osm2pgrouting `__" msgstr "" msgid "There are various open source tools that can help, like:" @@ -7027,18 +6098,13 @@ msgstr "" msgid "load OSM data into postgresql" 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." +msgid "Please note that these tools will **not** import the data in a structure compatible with pgRouting and when this happens the topology needs to be adjusted." msgstr "" msgid "Breakup a segments on each segment-segment intersection" msgstr "" -msgid "" -"When missing, add columns and assign values to ``source``, ``target``, " -"``cost``, ``reverse_cost``." +msgid "When missing, add columns and assign values to ``source``, ``target``, ``cost``, ``reverse_cost``." msgstr "" msgid "Connect a disconnected graph." @@ -7062,22 +6128,13 @@ msgstr "" msgid "Prepare the graph" msgstr "" -msgid "" -"What and how to prepare the graph, will depend on the application and/or on " -"the quality of the data and/or on how close the information is to have a " -"topology usable by pgRouting and/or some other factors not mentioned." +msgid "What and how to prepare the graph, will depend on the application and/or on the quality of the data and/or on how close the information is to have a topology usable by pgRouting and/or some other factors not mentioned." msgstr "" -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." +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." msgstr "" -msgid "" -"The `workshop `__ has a step by step " -"on how to prepare a graph using Open Street Map data, for a small " -"application." +msgid "The `workshop `__ has a step by step on how to prepare a graph using Open Street Map data, for a small application." msgstr "" msgid "The use of indexes on the database design in general:" @@ -7089,32 +6146,22 @@ msgstr "" msgid "Have the identifiers columns indexed." msgstr "" -msgid "" -"Please consult the `PostgreSQL `__ " -"documentation and the `PostGIS `__ documentation." +msgid "Please consult the `PostgreSQL `__ documentation and the `PostGIS `__ documentation." 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 `__." +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 "" msgid "Adjust costs" msgstr "" -msgid "" -"For this example the ``cost`` and ``reverse_cost`` values are going to be " -"the double of the length of the geometry." +msgid "For this example the ``cost`` and ``reverse_cost`` values are going to be the double of the length of the geometry." msgstr "" msgid "Update costs to length of geometry" msgstr "" -msgid "" -"Suppose that ``cost`` and ``reverse_cost`` columns in the sample data " -"represent:" +msgid "Suppose that ``cost`` and ``reverse_cost`` columns in the sample data represent:" msgstr "" msgid ":math:`1` when the edge exists in the graph" @@ -7129,9 +6176,7 @@ msgstr "" msgid "Which gives the following results:" msgstr "" -msgid "" -"Note that to be able to follow the documentation examples, everything is " -"based on the original graph." +msgid "Note that to be able to follow the documentation examples, everything is based on the original graph." msgstr "" msgid "Returning to the original data:" @@ -7182,9 +6227,7 @@ msgstr "" msgid "A sub graph is needed for the application." msgstr "" -msgid "" -"and many other problems that the pgRouting user, that is the application " -"developer might encounter." +msgid "and many other problems that the pgRouting user, that is the application developer might encounter." msgstr "" msgid "Crossing edges" @@ -7193,21 +6236,16 @@ msgstr "" msgid "To get the crossing edges:" msgstr "" -msgid "" -"That information is correct, for example, when in terms of vehicles, is it a " -"tunnel or bridge crossing over another road." +msgid "That information is correct, for example, when in terms of vehicles, is it a tunnel or bridge crossing over another road." msgstr "" msgid "It might be incorrect, for example:" msgstr "" -msgid "" -"When it is actually an intersection of roads, where vehicles can make turns." +msgid "When it is actually an intersection of roads, where vehicles can make turns." msgstr "" -msgid "" -"When in terms of electrical lines, the electrical line is able to switch " -"roads even on a tunnel or bridge." +msgid "When in terms of electrical lines, the electrical line is able to switch roads even on a tunnel or bridge." msgstr "" msgid "When it is incorrect, it needs fixing:" @@ -7216,46 +6254,31 @@ msgstr "" msgid "For vehicles and pedestrians" 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." +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 "" -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" +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 "For very specific applications" msgstr "" -msgid "" -"The data is correct when from the point of view of routing vehicles or " -"pedestrians." +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 `__." +msgid "Once analyzed one by one the crossings, for the ones that need a local fix, the edges need to be `split `__." 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." +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 "Fixing an intersection" msgstr "" -msgid "" -"In this example the original edge table will be used to store the additional " -"geometries." +msgid "In this example the original edge table will be used to store the additional geometries." msgstr "" msgid "An example use without results" @@ -7279,18 +6302,13 @@ msgstr "" msgid "Adding new segments." msgstr "" -msgid "" -"Calling :doc:`pgr_separateCrossing` and adding the new segments to the edges " -"table." +msgid "Calling :doc:`pgr_separateCrossing` and adding the new segments to the edges table." msgstr "" msgid "Update other values" msgstr "" -msgid "" -"In this example only ``cost`` and ``reverse_cost`` are updated, where they " -"are based on the length of the geometry and the directionality is kept using " -"the ``sign`` function." +msgid "In this example only ``cost`` and ``reverse_cost`` are updated, where they are based on the length of the geometry and the directionality is kept using the ``sign`` function." msgstr "" msgid "Update the topology" @@ -7320,9 +6338,7 @@ msgstr "" msgid "Maybe there is a small barrier for vehicles but not for pedestrians." msgstr "" -msgid "" -"Once analyzed one by one the touchings, for the ones that need a local fix, " -"the edges need to be `split `__." +msgid "Once analyzed one by one the touchings, for the ones that need a local fix, the edges need to be `split `__." msgstr "" msgid "Fixing a gap" @@ -7337,9 +6353,7 @@ msgstr "" msgid "The analysis tell us that the network has a gap." msgstr "" -msgid "" -"Calling :doc:`pgr_separateTouching` and adding the new segments to the edges " -"table." +msgid "Calling :doc:`pgr_separateTouching` and adding the new segments to the edges table." msgstr "" msgid "Routing from :math:`1` to :math:`2` gives a solution." @@ -7366,25 +6380,19 @@ msgstr "" msgid "This solution requires the edge to be split." msgstr "" -msgid "" -"In this example :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` " -"will be used." +msgid "In this example :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` will be used." msgstr "" msgid "Get the connectivity" msgstr "" -msgid "" -"In this example: the edges table will need an additional column and the " -"vertex table will be rebuilt completely." +msgid "In this example: the edges table will need an additional column and the vertex table will be rebuilt completely." msgstr "" msgid "Insert new edges" msgstr "" -msgid "" -"Using :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` insert the " -"results into the edges table." +msgid "Using :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` insert the results into the edges table." msgstr "" msgid "Create the vertices table" @@ -7399,20 +6407,13 @@ msgstr "" msgid "The graph can be reduced in size using :doc:`contraction-family`" msgstr "" -msgid "" -"When to contract will depend on the size of the graph, processing times, " -"correctness of the data, on the final application, or any other factor not " -"mentioned." +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 "" -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." +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 "" -msgid "" -"A complete method on how to contract and how to use the contracted graph is " -"described on :doc:`contraction-family`" +msgid "A complete method on how to contract and how to use the contracted graph is described on :doc:`contraction-family`" msgstr "" msgid "To get the dead ends:" @@ -7421,8 +6422,7 @@ msgstr "" msgid "A dead end happens when" msgstr "" -msgid "" -"The vertex is the limit of a cul-de-sac, a no-through road or a no-exit road." +msgid "The vertex is the limit of a cul-de-sac, a no-through road or a no-exit road." msgstr "" msgid "The vertex is on the limit of the imported graph." @@ -7431,9 +6431,7 @@ msgstr "" msgid "If a larger graph is imported then the vertex might not be a dead end" msgstr "" -msgid "" -"Node :math:`4`, is a dead end on the query, even that it visually looks like " -"an end point of 3 edges." +msgid "Node :math:`4`, is a dead end on the query, even that it visually looks like an end point of 3 edges." msgstr "" msgid "Is node :math:`4` a dead end or not?" @@ -7448,27 +6446,19 @@ msgstr "" msgid "That does not allow a vehicle to use that visual intersection?" msgstr "" -msgid "" -"Is the application for pedestrians and therefore the pedestrian can easily " -"walk on the small curb?" +msgid "Is the application for pedestrians and therefore the pedestrian can easily walk on the small curb?" msgstr "" -msgid "" -"Is the application for the electricity and the electrical lines than can " -"easily be extended on top of the small curb?" +msgid "Is the application for the electricity and the electrical lines than can easily be extended on top of the small curb?" msgstr "" -msgid "" -"Is there a big cliff and from eagles view look like the dead end is close to " -"the segment?" +msgid "Is there a big cliff and from eagles view look like the dead end is close to the segment?" msgstr "" msgid "Depending on the answer, modification of the data might be needed." msgstr "" -msgid "" -"When there are many dead ends, to speed up processing, the :doc:`contraction-" -"family` functions can be used to contract the graph." +msgid "When there are many dead ends, to speed up processing, the :doc:`contraction-family` functions can be used to contract the graph." msgstr "" msgid "Linear edges" @@ -7477,22 +6467,16 @@ msgstr "" msgid "To get the linear edges:" msgstr "" -msgid "" -"These linear vertices are correct, for example, when those the vertices are " -"speed bumps, stop signals and the application is taking them into account." +msgid "These linear vertices are correct, for example, when those the vertices are speed bumps, stop signals and the application is taking them into account." msgstr "" -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." +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 "" msgid "Function's structure" msgstr "" -msgid "" -"Once the graph preparation work has been done above, it is time to use a" +msgid "Once the graph preparation work has been done above, it is time to use a" msgstr "" msgid "The general form of a pgRouting function call is:" @@ -7504,30 +6488,22 @@ msgstr "" msgid "pgr_(`Inner queries`_, **parameters**, [ ``Optional parameters``)" msgstr "" -msgid "" -"`Inner queries`_: Are compulsory parameters that are ``TEXT`` strings " -"containing SQL queries." +msgid "`Inner queries`_: Are compulsory parameters that are ``TEXT`` strings containing SQL queries." msgstr "" -msgid "" -"**parameters**: Additional compulsory parameters needed by the function." +msgid "**parameters**: Additional compulsory parameters needed by the function." msgstr "" -msgid "" -"``Optional parameters``: Are non compulsory **named** parameters that have a " -"default value when omitted." +msgid "``Optional parameters``: Are non compulsory **named** parameters that have a default value when omitted." msgstr "" -msgid "" -"The compulsory parameters are positional parameters, the optional parameters " -"are named parameters." +msgid "The compulsory parameters are positional parameters, the optional parameters are named parameters." msgstr "" msgid "For example, for this :doc:`pgr_dijkstra` signature:" msgstr "" -msgid "" -"pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" msgid "`Edges SQL`_:" @@ -7542,9 +6518,7 @@ msgstr "" msgid "It is an inner query." msgstr "" -msgid "" -"It has no name, so **Edges SQL** gives an idea of what kind of inner query " -"needs to be used" +msgid "It has no name, so **Edges SQL** gives an idea of what kind of inner query needs to be used" msgstr "" msgid "**start vid**:" @@ -7553,17 +6527,13 @@ msgstr "" msgid "Is the second parameter." msgstr "" -msgid "" -"It has no name, so **start vid** gives an idea of what the second " -"parameter's value should contain." +msgid "It has no name, so **start vid** gives an idea of what the second parameter's value should contain." msgstr "" msgid "Is the third parameter." msgstr "" -msgid "" -"It has no name, so **end vid** gives an idea of what the third parameter's " -"value should contain" +msgid "It has no name, so **end vid** gives an idea of what the third parameter's value should contain" msgstr "" msgid "Is the fourth parameter." @@ -7575,9 +6545,7 @@ msgstr "" msgid "It has a name." msgstr "" -msgid "" -"The full description of the parameters are found on the `Parameters`_ " -"section of each function." +msgid "The full description of the parameters are found on the `Parameters`_ section of each function." msgstr "" msgid "Function's overloads" @@ -7610,9 +6578,7 @@ msgstr "" msgid "**Many**: ``ARRAY`` [**ANY-INTEGER**]" msgstr "" -msgid "" -"Depending of the function the overloads may vary. But the concept of " -"parameter type change remains the same." +msgid "Depending of the function the overloads may vary. But the concept of parameter type change remains the same." msgstr "" msgid "When routing from:" @@ -7645,11 +6611,7 @@ msgstr "" msgid "Needs a `Combinations SQL`_" msgstr "" -msgid "" -"There are several kinds of valid inner queries and also the columns returned " -"are depending of the function. Which kind of inner query will depend on the " -"function's requirements. To simplify the variety of types, **ANY-INTEGER** " -"and **ANY-NUMERICAL** is used." +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 "" msgid "Edges SQL for" @@ -7664,9 +6626,7 @@ msgstr "" msgid "General with (X,Y)" msgstr "" -msgid "" -"When negative: edge (``source``, ``target``) does not exist, therefore it's " -"not part of the graph." +msgid "When negative: edge (``source``, ``target``) does not exist, therefore it's not part of the graph." msgstr "" msgid "Weight of the edge (``target``, ``source``)," @@ -7711,20 +6671,13 @@ msgstr "" msgid "Points SQL for" msgstr "" -msgid "" -"The main parameter of the majority of the pgRouting functions is a query " -"that selects the edges of the graph." +msgid "The main parameter of the majority of the pgRouting functions is a query that selects the edges of the graph." msgstr "" -msgid "" -"Depending on the family or category of a function it will have additional " -"parameters, some of them are compulsory and some are optional." +msgid "Depending on the family or category of a function it will have additional parameters, some of them are compulsory and some are optional." msgstr "" -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." +msgid "The compulsory parameters are nameless and must be given in the required order. The optional parameters are named parameters and will have a default value." msgstr "" msgid "Parameters for the Via functions" @@ -7754,16 +6707,10 @@ msgstr "" msgid "``U_turn_on_edge``" msgstr "" -msgid "" -"When ``true`` departing from a visited vertex will not try to avoid using " -"the edge used to reach it. In other words, U turn using the edge with same " -"identifier is allowed." +msgid "When ``true`` departing from a visited vertex will not try to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is allowed." msgstr "" -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." +msgid "When ``false`` when a departing from a visited vertex tries to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is used when no other path is found." msgstr "" msgid "For the TRSP functions" @@ -7772,16 +6719,13 @@ msgstr "" msgid "Array of identifiers of destination vertices." msgstr "" -msgid "" -"There are several kinds of columns returned are depending of the function." +msgid "There are several kinds of columns returned are depending of the function." msgstr "" msgid "Result columns for single path functions" msgstr "" -msgid "" -"Used in functions that return one path solution per departure and " -"destination." +msgid "Used in functions that return one path solution per departure and destination." msgstr "" msgid ":doc:`pgr_dijkstraNear`" @@ -7793,8 +6737,7 @@ msgstr "" msgid "``path_seq``" msgstr "" -msgid "" -"Relative position in the path. Has value **1** for the beginning of a path." +msgid "Relative position in the path. Has value **1** for the beginning of a path." msgstr "" msgid "Identifier of the starting vertex of the current path." @@ -7806,27 +6749,19 @@ msgstr "" msgid "Identifier of the node in the path from ``start_vid`` to ``end_vid``." msgstr "" -msgid "" -"Identifier of the edge used to go from ``node`` to the next node in the path " -"sequence. **-1** for the last node of the path." +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 "" -msgid "" -"Cost to traverse from ``node`` using ``edge`` to the next node in the path " -"sequence." +msgid "Cost to traverse from ``node`` using ``edge`` to the next node in the path sequence." msgstr "" -msgid "" -"When ``start_vid`` or ``end_vid`` columns have negative values, the " -"identifier is for a Point." +msgid "When ``start_vid`` or ``end_vid`` columns have negative values, the identifier is for a Point." msgstr "" msgid "Result columns for multiple paths functions" msgstr "" -msgid "" -"Used in functions that return many paths solutions per departure and " -"destination." +msgid "Used in functions that return many paths solutions per departure and destination." msgstr "" msgid ":doc:`pgr_KSP`" @@ -7844,8 +6779,7 @@ msgstr "" msgid "Path identifier." msgstr "" -msgid "" -"Has value **1** for the first of a path from ``start_vid`` to ``end_vid``." +msgid "Has value **1** for the first of a path from ``start_vid`` to ``end_vid``." msgstr "" msgid "Result columns for cost functions" @@ -7854,9 +6788,7 @@ msgstr "" msgid "Used by:" msgstr "" -msgid "" -"When start_vid or end_vid columns have negative values, the identifier is " -"for a Point." +msgid "When start_vid or end_vid columns have negative values, the identifier is for a Point." msgstr "" msgid "Result columns for flow functions" @@ -7883,13 +6815,10 @@ msgstr "" msgid "For the Routing functions" msgstr "" -msgid "" -"To get faster results bound the queries to an area of interest of routing." +msgid "To get faster results bound the queries to an area of interest of routing." msgstr "" -msgid "" -"In this example Use an inner query SQL that does not include some edges in " -"the routing function and is within the area of the results." +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 "" msgid "Given this area:" @@ -7904,33 +6833,25 @@ msgstr "" msgid "Wiki" msgstr "" -msgid "" -"Edit an existing `pgRouting Wiki `__ page." +msgid "Edit an existing `pgRouting Wiki `__ page." msgstr "" msgid "Or create a new Wiki page" msgstr "" -msgid "" -"Create a page on the `pgRouting Wiki `__" +msgid "Create a page on the `pgRouting Wiki `__" msgstr "" msgid "Give the title an appropriate name" msgstr "" -msgid "" -"`Example `__" +msgid "`Example `__" msgstr "" msgid "Adding Functionality to pgRouting" msgstr "" -msgid "" -"Consult the `developer's documentation `__" +msgid "Consult the `developer's documentation `__" msgstr "" msgid "See also" @@ -7939,17 +6860,10 @@ msgstr "" msgid "Installation" msgstr "" -msgid "" -"Instructions for downloading and installing binaries for different operating " -"systems, additional notes and corrections not included in this documentation " -"can be found in `Installation wiki `__" +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 "" -"To use pgRouting, PostGIS needs to be installed, please read the information " -"about installation in this `Install Guide `__" +msgid "To use pgRouting, PostGIS needs to be installed, please read the information about installation in this `Install Guide `__" msgstr "" msgid "Short Version" @@ -7961,25 +6875,19 @@ msgstr "" msgid "To compile assuming you have all the dependencies in your search path:" msgstr "" -msgid "" -"Once pgRouting is installed, it needs to be enabled in each individual " -"database you want to use it in." +msgid "Once pgRouting is installed, it needs to be enabled in each individual database you want to use it in." msgstr "" msgid "Get the sources" msgstr "" -msgid "" -"The pgRouting latest release can be found in https://github.com/pgRouting/" -"pgrouting/releases/latest" +msgid "The pgRouting latest release can be found in https://github.com/pgRouting/pgrouting/releases/latest" msgstr "" msgid "To download this release:" msgstr "" -msgid "" -"Go to :ref:`install-short` for more instructions on extracting tar ball and " -"compiling pgRouting." +msgid "Go to :ref:`install-short` for more instructions on extracting tar ball and compiling pgRouting." msgstr "" msgid "git" @@ -7988,10 +6896,7 @@ msgstr "" msgid "To download the repository" msgstr "" -msgid "" -"Go to :ref:`install-short` for more instructions on compiling pgRouting " -"(there is no tar ball involved while downloading pgRouting repository from " -"GitHub)." +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 "" msgid "Enabling and upgrading in the database" @@ -8000,27 +6905,19 @@ msgstr "" msgid "Enabling the database" 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." +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 "" -msgid "" -"Checking PostGIS and pgRouting version after enabling them in the database." +msgid "Checking PostGIS and pgRouting version after enabling them in the database." msgstr "" msgid "Upgrading the database" msgstr "" -msgid "" -"To upgrade pgRouting in the database to version 4.0.0 use the following " -"command:" +msgid "To upgrade pgRouting in the database to version 4.1.0 use the following command:" msgstr "" -msgid "" -"More information can be found in https://www.postgresql.org/docs/current/sql-" -"createextension.html" +msgid "More information can be found in https://www.postgresql.org/docs/current/sql-createextension.html" msgstr "" msgid "Dependencies" @@ -8029,21 +6926,16 @@ msgstr "" msgid "Compilation Dependencies" msgstr "" -msgid "" -"To be able to compile pgRouting, make sure that the following dependencies " -"are met:" +msgid "To be able to compile pgRouting, make sure that the following dependencies are met:" msgstr "" msgid "C and C++0x compilers" msgstr "" -msgid "" -"Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with C++03 " -"or C++11 standard support" +msgid "Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with C++03 or C++11 standard support" msgstr "" -msgid "" -"Compiling with Boost 1.75 requires C++ Compiler with C++14 standard support" +msgid "Compiling with Boost 1.75 requires C++ Compiler with C++14 standard support" msgstr "" msgid "Postgresql version >= 13" @@ -8115,14 +7007,10 @@ msgstr "" msgid "Configuring The Documentation" msgstr "" -msgid "" -"User and developers documentation are not build if prerequisites are not " -"found." +msgid "User and developers documentation are not build if prerequisites are not found." msgstr "" -msgid "" -"Most of the effort of the documentation has been on the HTML files. Some " -"variables for building documentation:" +msgid "Most of the effort of the documentation has been on the HTML files. Some variables for building documentation:" msgstr "" msgid "Variable" @@ -8200,9 +7088,7 @@ msgstr "" msgid "The following instructions start from ``path/to/pgrouting/build``" msgstr "" -msgid "" -"We have tested on several platforms, For installing or reinstalling all the " -"steps are needed." +msgid "We have tested on several platforms, For installing or reinstalling all the steps are needed." msgstr "" msgid "Linux" @@ -8217,21 +7103,10 @@ msgstr "" msgid "Currently there is no :code:`make test` and testing is done as follows" msgstr "" -msgid "" -"pgRouting is an extension of `PostGIS `__ and " -"`PostgreSQL `__ geospatial database and adds " -"routing and other network analysis functionality. A predecessor of pgRouting " -"– pgDijkstra, written by Sylvain Pasche from `Camptocamp `__, was later extended by Orkney and renamed to pgRouting. The project " -"is now supported and maintained by `Georepublic `__, `Paragon Corporation `__ and " -"a broad user community." +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 "" -msgid "" -"pgRouting is part of `OSGeo Community Projects `__ from the `OSGeo Foundation `__ and included on `OSGeoLive `__." +msgid "pgRouting is part of `OSGeo Community Projects `__ from the `OSGeo Foundation `__ and included on `OSGeoLive `__." msgstr "" msgid "Licensing" @@ -8246,34 +7121,25 @@ msgstr "" msgid "GNU General Public License v2.0 or later" msgstr "" -msgid "" -"Most features of pgRouting are available under `GNU General Public License " -"v2.0 or later `_." +msgid "Most features of pgRouting are available under `GNU General Public License v2.0 or later `_." msgstr "" msgid "Boost Software License - Version 1.0" msgstr "" -msgid "" -"Some Boost extensions are available under `Boost Software License - Version " -"1.0 `_." +msgid "Some Boost extensions are available under `Boost Software License - Version 1.0 `_." msgstr "" msgid "MIT-X License" msgstr "" -msgid "" -"Some code contributed by iMaptools.com is available under MIT-X license." +msgid "Some code contributed by iMaptools.com is available under MIT-X license." msgstr "" -msgid "" -"The pgRouting Manual is licensed under a `Creative Commons Attribution-Share " -"Alike 3.0 License `_." +msgid "The pgRouting Manual is licensed under a `Creative Commons Attribution-Share Alike 3.0 License `_." msgstr "" -msgid "" -"In general license information should be included in the header of each " -"source file." +msgid "In general license information should be included in the header of each source file." msgstr "" msgid "Contributors" @@ -8288,10 +7154,7 @@ msgstr "" msgid "Bipasha Gayary, Fan Wu, Regina Obe, Saloni kumari, Vicky Vergara" msgstr "" -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." +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 "" msgid "Translators (in alphabetical order)" @@ -8318,9 +7181,7 @@ msgstr "" msgid "Corporate Sponsors in this release (in alphabetical order)" msgstr "" -msgid "" -"These are corporate entities that have contributed developer time, hosting, " -"or direct monetary funding to the pgRouting project:" +msgid "These are corporate entities that have contributed developer time, hosting, or direct monetary funding to the pgRouting project:" msgstr "" msgid "`OSGeo `__" @@ -8344,20 +7205,7 @@ msgstr "" msgid "Individuals (in alphabetical order)" msgstr "" -msgid "" -"Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio " -"Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf " -"Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, " -"Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, " -"Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, " -"Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu " -"Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko " -"Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim " -"Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish " -"Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni " -"Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen " -"Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, " -"Vidhan Jain, Virginia Vergara, Yige Huang" +msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" msgstr "" msgid "Corporate Sponsors (in alphabetical order)" @@ -8402,14 +7250,10 @@ msgstr "" msgid "More Information" msgstr "" -msgid "" -"The latest software, documentation and news items are available at the " -"pgRouting web site https://pgrouting.org." +msgid "The latest software, documentation and news items are available at the pgRouting web site https://pgrouting.org." msgstr "" -msgid "" -"PostgreSQL database server at the PostgreSQL main site https://www." -"postgresql.org." +msgid "PostgreSQL database server at the PostgreSQL main site https://www.postgresql.org." msgstr "" msgid "PostGIS extension at the PostGIS project web site https://postgis.net." @@ -8472,9 +7316,7 @@ msgstr "" msgid "Official function." msgstr "" -msgid "" -"The K shortest path routing algorithm based on Yen's algorithm. \"K\" is the " -"number of shortest paths desired." +msgid "The K shortest path routing algorithm based on Yen's algorithm. \"K\" is the number of shortest paths desired." msgstr "" msgid "|Boost| Boost Graph Inside" @@ -8492,16 +7334,13 @@ msgstr "" msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vid**, **K**, [**options**])" msgstr "" -msgid "" -"pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" +msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" msgstr "" -msgid "" -"pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" +msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" msgstr "" -msgid "" -"pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" +msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" msgstr "" msgid "pgr_KSP(`Edges SQL`_, `Combinations SQL`_, **K**, [**options**])" @@ -8522,19 +7361,13 @@ msgstr "" msgid "Get 2 paths from :math:`6` to :math:`17` on a directed graph." msgstr "" -msgid "" -"Get 2 paths from vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a " -"directed graph." +msgid "Get 2 paths from vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph." msgstr "" -msgid "" -"Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a " -"directed graph." +msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph." msgstr "" -msgid "" -"Get 2 paths vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on " -"a directed graph." +msgid "Get 2 paths vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on a directed graph." msgstr "" msgid "Using a combinations table on an directed graph" @@ -8567,9 +7400,7 @@ msgstr "" msgid "When ``true`` all the calculated paths while processing are returned." msgstr "" -msgid "" -"Roughly, when the shortest path has ``N`` edges, the heap will contain about " -"than ``N * K`` paths for small value of ``K`` and ``K > 5``." +msgid "Roughly, when the shortest path has ``N`` edges, the heap will contain about than ``N * K`` paths for small value of ``K`` and ``K > 5``." msgstr "" msgid "Additional Examples" @@ -8584,9 +7415,7 @@ msgstr "" msgid "Get 2 paths using combinations table on an undirected graph" msgstr "" -msgid "" -"Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a " -"undirected graph." +msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a undirected graph." msgstr "" msgid "https://en.wikipedia.org/wiki/K_shortest_path_routing" @@ -8604,19 +7433,13 @@ msgstr "" msgid "Version 3.2.1" msgstr "" -msgid "" -"Metric Algorithm from `Boost library `__" +msgid "Metric Algorithm from `Boost library `__" msgstr "" msgid "Simulated Annealing Algorithm no longer supported" msgstr "" -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`" +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 "" msgid "Version 2.3.0" @@ -8628,9 +7451,7 @@ msgstr "" msgid "Negative costs are ignored." msgstr "" -msgid "" -"Can be Used with :doc:`costMatrix-category` functions preferably with " -"`directed => false`." +msgid "Can be Used with :doc:`costMatrix-category` functions preferably with `directed => false`." msgstr "" msgid "With ``directed => false``" @@ -8651,62 +7472,43 @@ msgstr "" msgid "When ``start_vid = 0 OR end_vid = 0``" msgstr "" -msgid "" -"The solutions generated are guaranteed to be *twice as long as the optimal " -"tour in the worst case*" +msgid "The solutions generated are guaranteed to be *twice as long as the optimal tour in the worst case*" msgstr "" msgid "When ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``" msgstr "" -msgid "" -"It is **not guaranteed** that the solution will be, in the worst case, twice " -"as long as the optimal tour, due to the fact that `end_vid` is forced to be " -"in a fixed position." +msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour, due to the fact that `end_vid` is forced to be in a fixed position." msgstr "" msgid "With ``directed => true``" msgstr "" -msgid "" -"It is **not guaranteed** that the solution will be, in the worst case, twice " -"as long as the optimal tour" +msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour" msgstr "" msgid "is directed" msgstr "" -msgid "" -"some (or all) traveling costs on edges might not obey the triangle " -"inequality." +msgid "some (or all) traveling costs on edges might not obey the triangle inequality." msgstr "" -msgid "" -"As an undirected graph is required, the directed graph is transformed as " -"follows:" +msgid "As an undirected graph is required, the directed graph is transformed as follows:" msgstr "" -msgid "" -"edges `(u, v)` and `(v, u)` is considered to be the same edge (denoted `(u, " -"v)`" +msgid "edges `(u, v)` and `(v, u)` is considered to be the same edge (denoted `(u, v)`" msgstr "" msgid "if ``agg_cost`` differs between one or more instances of edge `(u, v)`" 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)`" +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 "" -msgid "" -"Some (or all) traveling costs on edges will still might not obey the " -"triangle inequality." +msgid "Some (or all) traveling costs on edges will still might not obey the triangle inequality." msgstr "" -msgid "" -"When the data does not come from an undirected graph or its not fully " -"connected:" +msgid "When the data does not come from an undirected graph or its not fully connected:" msgstr "" msgid "Missing values will be calculated with dijkstra algorithm." @@ -8715,20 +7517,13 @@ msgstr "" msgid "When the graph has more than one component:" msgstr "" -msgid "" -"``start_vid`` or ``end_vid`` are defined and are on the same component: the " -"TSP tour will happen on that component." +msgid "``start_vid`` or ``end_vid`` are defined and are on the same component: the TSP tour will happen on that component." msgstr "" -msgid "" -"``start_vid`` or ``end_vid`` are defined and are not on the same component: " -"the TSP tour will propose a tour that has both components where connecting " -"costs are estimated." +msgid "``start_vid`` or ``end_vid`` are defined and are not on the same component: the TSP tour will propose a tour that has both components where connecting costs are estimated." msgstr "" -msgid "" -"``start_vid`` or ``end_vid`` are not defined: the starting point could be on " -"any component and will include data only from that component." +msgid "``start_vid`` or ``end_vid`` are not defined: the starting point could be on any component and will include data only from that component." msgstr "" msgid "One cycle attempt to remove crossing edges is done to the TSP results." @@ -8743,9 +7538,7 @@ msgstr "" msgid "Using :doc:`pgr_dijkstraCostMatrix` to generate the matrix information" msgstr "" -msgid "" -"**Line 4** Vertices :math:`\\{2, 4, 13, 14\\}` are not included because they " -"are not connected." +msgid "**Line 4** Vertices :math:`\\{2, 4, 13, 14\\}` are not included because they are not connected." msgstr "" msgid "`Matrix SQL`_ as described below" @@ -8772,9 +7565,7 @@ msgstr "" msgid "Identifier of the node/coordinate/point." msgstr "" -msgid "" -"Cost to traverse from the current ``node`` to the next ``node`` in the path " -"sequence." +msgid "Cost to traverse from the current ``node`` to the next ``node`` in the path sequence." msgstr "" msgid "``0`` for the last row in the tour sequence." @@ -8798,22 +7589,16 @@ msgstr "" msgid "To generate an asymmetric matrix:" msgstr "" -msgid "" -"**Line 4** The ``side`` information of ``pointsOfInterset`` is ignored by " -"not including it in the query" +msgid "**Line 4** The ``side`` information of ``pointsOfInterset`` is ignored by not including it in the query" msgstr "" msgid "**Line 6** Generating an asymmetric matrix with ``directed => true``" msgstr "" -msgid "" -":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered as " -"the ``agg_cost``" +msgid ":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered as the ``agg_cost``" msgstr "" -msgid "" -"The solution that can be larger than *twice as long as the optimal tour* " -"because:" +msgid "The solution that can be larger than *twice as long as the optimal tour* because:" msgstr "" msgid "Triangle inequality might not be satisfied." @@ -8825,14 +7610,10 @@ msgstr "" msgid "Connected incomplete data" msgstr "" -msgid "" -"Using selected edges :math:`\\{2, 4, 5, 8, 9, 15\\}` the matrix is not " -"complete." +msgid "Using selected edges :math:`\\{2, 4, 5, 8, 9, 15\\}` the matrix is not complete." msgstr "" -msgid "" -"Cost value for :math:`17 \\rightarrow 10` do not exist on the matrix, but " -"the value used is taken from :math:`10 \\rightarrow 17`." +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 "" msgid "``pgr_TSPeuclidean``" @@ -8841,9 +7622,7 @@ msgstr "" msgid "``pgr_TSPeuclidean`` - Approximation using *metric* algorithm." msgstr "" -msgid "" -"Using `Boost: metric TSP approx `__" +msgid "Using `Boost: metric TSP approx `__" msgstr "" msgid "Name change from pgr_eucledianTSP" @@ -8855,17 +7634,13 @@ msgstr "" msgid "Results change depending on input order of the `Coordinates SQL`_" msgstr "" -msgid "" -"Any duplicated identifier will be ignored. The coordinates that will be kept " -"is arbitrarily." +msgid "Any duplicated identifier will be ignored. The coordinates that will be kept is arbitrarily." msgstr "" -msgid "" -"The coordinates are quite similar for the same identifier, for example ::" +msgid "The coordinates are quite similar for the same identifier, for example ::" msgstr "" -msgid "" -"The coordinates are quite different for the same identifier, for example ::" +msgid "The coordinates are quite different for the same identifier, for example ::" msgstr "" msgid "pgr_TSPeuclidean(`Coordinates SQL`_, ``[start_id, end_id]``)" @@ -8898,11 +7673,7 @@ msgstr "" msgid "Test 29 cities of Western Sahara" msgstr "" -msgid "" -"This example shows how to make performance tests using University of " -"Waterloo's `example data `__ using the 29 cities of `Western Sahara dataset `__" +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 "" msgid "Creating a table for the data and storing the data" @@ -8914,9 +7685,7 @@ msgstr "" msgid "Total tour cost" msgstr "" -msgid "" -"Getting a total cost of the tour, compare the value with the length of an " -"optimal tour is 27603, given on the dataset" +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 "" msgid "Getting a geometry of the tour" @@ -8925,10 +7694,7 @@ msgstr "" msgid "Visual results" msgstr "" -msgid "" -"Visually, The first image is the `optimal solution `__ and the second image is the solution " -"obtained with ``pgr_TSPeuclidean``." +msgid "Visually, The first image is the `optimal solution `__ and the second image is the solution obtained with ``pgr_TSPeuclidean``." msgstr "" msgid "``pgr_aStar`` — Shortest path using the A* algorithm." @@ -8967,9 +7733,7 @@ msgstr "" msgid "Signature change on pgr_aStar(One to One)" msgstr "" -msgid "" -"The results are equivalent to the union of the results of the `pgr_aStar(` " -"`One to One`_ `)` on the:" +msgid "The results are equivalent to the union of the results of the `pgr_aStar(` `One to One`_ `)` on the:" msgstr "" msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" @@ -8996,28 +7760,19 @@ msgstr "" msgid "Optional parameters are `named parameters` and have a default value." msgstr "" -msgid "" -"From vertex :math:`6` to vertex :math:`12` on a **directed** graph with " -"heuristic :math:`2`" +msgid "From vertex :math:`6` to vertex :math:`12` on a **directed** graph with heuristic :math:`2`" msgstr "" -msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 12\\}` on a **directed** " -"graph with heuristic :math:`3` and factor :math:`3.5`" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 12\\}` on a **directed** graph with heuristic :math:`3` and factor :math:`3.5`" msgstr "" -msgid "" -"From vertices :math:`\\{6, 8\\}` to vertex :math:`10` on an **undirected** " -"graph with heuristic :math:`4`" +msgid "From vertices :math:`\\{6, 8\\}` to vertex :math:`10` on an **undirected** graph with heuristic :math:`4`" msgstr "" -msgid "" -"From vertices :math:`\\{6, 8\\}` to vertices :math:`\\{10, 12\\}` on a " -"**directed** graph with factor :math:`0.5`" +msgid "From vertices :math:`\\{6, 8\\}` to vertices :math:`\\{10, 12\\}` on a **directed** graph with factor :math:`0.5`" msgstr "" -msgid "" -"Using a combinations table on a **directed** graph with factor :math:`0.5`." +msgid "Using a combinations table on a **directed** graph with factor :math:`0.5`." msgstr "" msgid "Example 1" @@ -9041,8 +7796,7 @@ msgstr "" msgid "``pgr_aStarCost``" msgstr "" -msgid "" -"``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." +msgid "``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." msgstr "" msgid "pgr_aStarCost(Combinations)" @@ -9051,14 +7805,10 @@ msgstr "" msgid "New proposed function." msgstr "" -msgid "" -"The ``pgr_aStarCost`` function summarizes the cost of the shortest path " -"using the A* algorithm." +msgid "The ``pgr_aStarCost`` function summarizes the cost of the shortest path using the A* algorithm." msgstr "" -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)`" +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 "" msgid "For undirected graphs, the results are symmetric." @@ -9082,8 +7832,7 @@ msgstr "" msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -msgid "" -"pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "" msgid "pgr_aStarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" @@ -9098,9 +7847,7 @@ msgstr "" msgid "``pgr_aStarCostMatrix``" msgstr "" -msgid "" -"``pgr_aStarCostMatrix`` - Calculates the a cost matrix using :doc:" -"`pgr_aStar`." +msgid "``pgr_aStarCostMatrix`` - Calculates the a cost matrix using :doc:`pgr_aStar`." msgstr "" msgid "Using internally the :doc:`pgr_aStar` algorithm" @@ -9133,9 +7880,7 @@ msgstr "" msgid "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" msgstr "" -msgid "" -"Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an " -"**undirected** graph using heuristic :math:`2`" +msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph using heuristic :math:`2`" msgstr "" msgid "Use with :doc:`pgr_TSP`" @@ -9144,9 +7889,7 @@ msgstr "" msgid "``pgr_articulationPoints``" msgstr "" -msgid "" -"``pgr_articulationPoints`` - Return the articulation points of an undirected " -"graph." +msgid "``pgr_articulationPoints`` - Return the articulation points of an undirected graph." msgstr "" msgid "Result columns change: ``seq`` is removed" @@ -9155,11 +7898,7 @@ msgstr "" msgid "Version 2.5.0" 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." +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 "Works for **undirected** graphs." @@ -9186,14 +7925,10 @@ msgstr "" msgid "Identifier of the vertex." msgstr "" -msgid "" -"`Boost: Biconnected components & articulation points `__" +msgid "`Boost: Biconnected components & articulation points `__" msgstr "" -msgid "" -"wikipedia: `Biconnected component `__" +msgid "wikipedia: `Biconnected component `__" msgstr "" msgid "``pgr_bandwidth`` - Experimental" @@ -9202,14 +7937,10 @@ msgstr "" msgid "``pgr_bandwidth`` - Calculates the bandwidth of the graph" msgstr "" -msgid "" -"Bandwidth measures how \"spread out\" the connections are in a graph when " -"vertices are arranged in a linear order (like numbering them 1, 2, 3, etc.)." +msgid "Bandwidth measures how \"spread out\" the connections are in a graph when vertices are arranged in a linear order (like numbering them 1, 2, 3, etc.)." msgstr "" -msgid "" -"For each edge in the graph, calculate the distance between the vertex " -"numbers it connects" +msgid "For each edge in the graph, calculate the distance between the vertex numbers it connects" msgstr "" msgid "The bandwidth is the maximum of all these distances" @@ -9245,8 +7976,7 @@ msgstr "" msgid "Undirected graph with edges after optimization." msgstr "" -msgid "" -"`Boost: bandwidth `_" +msgid "`Boost: bandwidth `_" msgstr "" msgid "``pgr_bdAstar``" @@ -9279,9 +8009,7 @@ msgstr "" msgid "Signature change on pgr_bdAstar(One to One)" msgstr "" -msgid "" -"The results are equivalent to the union of the results of pgr_bdAStar(One to " -"One) on the:" +msgid "The results are equivalent to the union of the results of pgr_bdAStar(One to One) on the:" msgstr "" msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" @@ -9302,33 +8030,25 @@ msgstr "" msgid "``pgr_bdAstarCost``" msgstr "" -msgid "" -"``pgr_bdAstarCost`` - Total cost of the shortest path using the " -"bidirectional A* algorithm." +msgid "``pgr_bdAstarCost`` - Total cost of the shortest path using the bidirectional A* algorithm." msgstr "" msgid "pgr_bdAstarCost(Combinations)" msgstr "" -msgid "" -"The ``pgr_bdAstarCost`` function summarizes the cost of the shortest path " -"using the bidirectional A* algorithm." +msgid "The ``pgr_bdAstarCost`` function summarizes the cost of the shortest path using the bidirectional A* algorithm." msgstr "" -msgid "" -"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" msgstr "" -msgid "" -"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgstr "" -msgid "" -"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -msgid "" -"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "" msgid "pgr_bdAstarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" @@ -9337,9 +8057,7 @@ msgstr "" msgid "``pgr_bdAstarCostMatrix``" msgstr "" -msgid "" -"``pgr_bdAstarCostMatrix`` - Calculates the cost matrix using :doc:" -"`pgr_bdAstar`." +msgid "``pgr_bdAstarCostMatrix`` - Calculates the cost matrix using :doc:`pgr_bdAstar`." msgstr "" msgid "Internally uses the :doc:`pgr_bdAstar` algorithm." @@ -9348,9 +8066,7 @@ msgstr "" msgid "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" msgstr "" -msgid "" -"``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra " -"algorithm." +msgid "``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra algorithm." msgstr "" msgid "pgr_bdDijkstra(Combinations)" @@ -9368,20 +8084,16 @@ msgstr "" msgid "Signature change on pgr_bdDijkstra(One to One)" msgstr "" -msgid "" -"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "" -"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" @@ -9390,18 +8102,13 @@ msgstr "" msgid "From vertex :math:`6` to vertex :math:`10` on a **directed** graph" msgstr "" -msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed** " -"graph" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed** graph" msgstr "" -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** graph" +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** graph" msgstr "" -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an " -"**undirected** graph" +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an **undirected** graph" msgstr "" msgid "Using a combinations table on an **undirected** graph" @@ -9413,35 +8120,25 @@ msgstr "" msgid "``pgr_bdDijkstraCost``" msgstr "" -msgid "" -"``pgr_bdDijkstraCost`` — Returns the shortest path's cost using " -"Bidirectional Dijkstra algorithm." +msgid "``pgr_bdDijkstraCost`` — Returns the shortest path's cost using Bidirectional Dijkstra algorithm." msgstr "" msgid "pgr_bdDijkstraCost(Combinations)" msgstr "" -msgid "" -"The ``pgr_bdDijkstraCost`` function summarizes the cost of the shortest path " -"using the bidirectional Dijkstra Algorithm." +msgid "The ``pgr_bdDijkstraCost`` function summarizes the cost of the shortest path using the bidirectional Dijkstra Algorithm." msgstr "" -msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" msgstr "" -msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , " -"[``directed``])" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , [``directed``])" msgstr "" -msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [ ``directed``])" @@ -9453,27 +8150,22 @@ msgstr "" msgid "``pgr_bdDijkstraCostMatrix``" msgstr "" -msgid "" -"``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using :doc:" -"`pgr_bdDijkstra`." +msgid "``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_bdDijkstra`." msgstr "" -msgid "" -"Using bidirectional Dijkstra algorithm, calculate and return a cost matrix." +msgid "Using bidirectional Dijkstra algorithm, calculate and return a cost matrix." msgstr "" msgid "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" msgstr "" -msgid "" -"Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an " -"**undirected** graph" +msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph" msgstr "" msgid "Use with :doc:`pgr_TSP`." msgstr "" -msgid "``pgr_bellmanFord - Experimental``" +msgid "``pgr_bellmanFord`` - Experimental" msgstr "" msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm." @@ -9482,89 +8174,58 @@ msgstr "" msgid "pgr_bellmanFord(Combinations)" msgstr "" -msgid "" -"Bellman-Ford's algorithm, is named after Richard Bellman and Lester Ford, " -"who first published it in 1958 and 1956, respectively.It is a graph search " -"algorithm that computes shortest paths from a starting vertex " -"(``start_vid``) to an ending vertex (``end_vid``) in a graph where some of " -"the edge weights may be negative. Though it is more versatile, it is slower " -"than Dijkstra's algorithm.This implementation can be used with a directed " -"graph and an undirected graph." +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 "" -msgid "" -"Process is valid for edges with both positive and negative edge weights." +msgid "Process is valid for edges with both positive and negative edge weights." msgstr "" -msgid "" -"When the start vertex and the end vertex are the same, there is no path. The " -"agg_cost would be :math:`0`." +msgid "When the start vertex and the end vertex are the same, there is no path. The agg_cost would be :math:`0`." msgstr "" -msgid "" -"When the start vertex and the end vertex are different, and there exists a " -"path between them without having a *negative cycle*. The agg_cost would be " -"some finite value denoting the shortest distance between them." +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 "" -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." +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 "" -msgid "" -"When the start vertex and the end vertex are different, and there is no " -"path. The agg_cost is :math:`\\infty`." +msgid "When the start vertex and the end vertex are different, and there is no path. The agg_cost is :math:`\\infty`." msgstr "" -msgid "" -"For optimization purposes, any duplicated value in the `start_vids` or " -"`end_vids` are ignored." +msgid "For optimization purposes, any duplicated value in the `start_vids` or `end_vids` are ignored." msgstr "" msgid "Running time: :math:`O(| start\\_vids | * ( V * E))`" msgstr "" -msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" msgid "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph" msgstr "" -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph" +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph" msgstr "" -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an " -"undirected graph" +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an undirected graph" msgstr "" msgid "Using a combinations table on an undirected graph" msgstr "" -msgid "" -"`Boost: Bellman Ford `__" +msgid "`Boost: Bellman Ford `__" msgstr "" msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" @@ -9573,29 +8234,19 @@ msgstr "" msgid "``pgr_betweennessCentrality`` - Experimental" msgstr "" -msgid "" -"``pgr_betweennessCentrality`` - Calculates the relative betweenness " -"centrality using Brandes Algorithm" +msgid "``pgr_betweennessCentrality`` - Calculates the relative betweenness centrality using Brandes Algorithm" msgstr "" msgid "Version 3.7.0" msgstr "" -msgid "" -"The Brandes Algorithm takes advantage of the sparse graphs for evaluating " -"the betweenness centrality score of all vertices." +msgid "The Brandes Algorithm takes advantage of the sparse graphs for evaluating the betweenness centrality score of all vertices." msgstr "" -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." +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 "" -"The removal of these vertices will affect the network by disrupting the it, " -"as most of the shortest paths between vertices pass through them." +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 "This implementation work for both directed and undirected graphs." @@ -9628,9 +8279,7 @@ msgstr "" msgid "The leaf vertices have betweenness centrality :math:`0`." msgstr "" -msgid "" -"Betweenness centrality of vertex :math:`6` is higher than of vertex :math:" -"`10`." +msgid "Betweenness centrality of vertex :math:`6` is higher than of vertex :math:`10`." msgstr "" msgid "Removing vertex :math:`6` will create three graph components." @@ -9645,21 +8294,16 @@ msgstr "" msgid "``centrality``" msgstr "" -msgid "" -"Relative betweenness centrality score of the vertex (will be in range [0,1])" +msgid "Relative betweenness centrality score of the vertex (will be in range [0,1])" msgstr "" -msgid "" -"`Boost: betweenness centrality `_" +msgid "`Boost: betweenness centrality `_" msgstr "" msgid "``pgr_biconnectedComponents``" msgstr "" -msgid "" -"``pgr_biconnectedComponents`` — Biconnected components of an undirected " -"graph." +msgid "``pgr_biconnectedComponents`` — Biconnected components of an undirected graph." msgstr "" msgid "Result columns change:" @@ -9671,13 +8315,7 @@ msgstr "" msgid "``seq`` changed type to ``BIGINT``" msgstr "" -msgid "" -"The biconnected components of an undirected graph are the maximal subsets of " -"vertices such that the removal of a vertex from particular component will " -"not disconnect the component. Unlike connected components, vertices may " -"belong to multiple biconnected components. Vertices can be present in " -"multiple biconnected components, but each edge can only be contained in a " -"single biconnected component." +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 "" msgid "Components are described by edges." @@ -9713,103 +8351,61 @@ msgstr "" msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" msgstr "" -msgid "" -"``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary " -"graph." +msgid "``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary graph." msgstr "" -msgid "" -"Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-" -"negative integer, is termed as a 'binary graph'." +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 "" msgid "pgr_binaryBreadthFirstSearch(Combinations)" msgstr "" -msgid "" -"It is well-known that the shortest paths between a single source and all " -"other vertices can be found using Breadth First Search in :math:`O(|E|)` in " -"an unweighted graph, i.e. the distance is the minimal number of edges that " -"you need to traverse from the source to another vertex. We can interpret " -"such a graph also as a weighted graph, where every edge has the weight :math:" -"`1`. If not all edges in graph have the same weight, then we a more general " -"algorithm is needed, like Dijkstra's Algorithm which runs in :math:`O(|E|log|" -"V|)` time." +msgid "It is well-known that the shortest paths between a single source and all other vertices can be found using Breadth First Search in :math:`O(|E|)` in an unweighted graph, i.e. the distance is the minimal number of edges that you need to traverse from the source to another vertex. We can interpret such a graph also as a weighted graph, where every edge has the weight :math:`1`. If not all edges in graph have the same weight, then we a more general algorithm is needed, like Dijkstra's Algorithm which runs in :math:`O(|E|log|V|)` time." msgstr "" -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." +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 "" -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.)" +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 "" msgid "Running time: :math:`O(| start\\_vids | * |E|)`" msgstr "" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, " -"[``directed``])" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, " -"[``directed``])" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, " -"[``directed``])" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, " -"[``directed``])" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid "" -"**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :" -"math:`1``)" +msgid "**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :math:`1``)" msgstr "" -msgid "" -"`Boost: Breadth First Search `__" +msgid "`Boost: Breadth First Search `__" msgstr "" msgid "https://cp-algorithms.com/graph/01_bfs.html" msgstr "" -msgid "" -"https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" +msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" msgstr "" msgid "``pgr_bipartite`` - Experimental" msgstr "" -msgid "" -"``pgr_bipartite`` — Disjoint sets of vertices such that no two vertices " -"within the same set are adjacent." +msgid "``pgr_bipartite`` — Disjoint sets of vertices such that no two vertices within the same set are adjacent." msgstr "" -msgid "" -"A bipartite graph is a graph with two sets of vertices which are connected " -"to each other, but not within themselves. A bipartite graph is possible if " -"the graph coloring is possible using two colors such that vertices in a set " -"are colored with the same color." +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 "The algorithm works in undirected graph only." @@ -9818,10 +8414,7 @@ msgstr "" msgid "The returned values are not ordered." msgstr "" -msgid "" -"The algorithm checks graph is bipartite or not. If it is bipartite then it " -"returns the node along with two colors `0` and `1` which represents two " -"different sets." +msgid "The algorithm checks graph is bipartite or not. If it is bipartite then it returns the node along with two colors `0` and `1` which represents two different sets." msgstr "" msgid "If graph is not bipartite then algorithm returns empty set." @@ -9839,32 +8432,22 @@ msgstr "" msgid "The odd length cyclic graph can not be bipartite." msgstr "" -msgid "" -"The edge :math:`5 \\rightarrow 1` will make subgraph with vertices :math:" -"`\\{1, 3, 7, 6, 5\\}` an odd length cyclic graph, as the cycle has 5 " -"vertices." +msgid "The edge :math:`5 \\rightarrow 1` will make subgraph with vertices :math:`\\{1, 3, 7, 6, 5\\}` an odd length cyclic graph, as the cycle has 5 vertices." msgstr "" msgid "Edges in blue represent odd length cycle subgraph." msgstr "" -msgid "" -"`Boost: is_bipartite `__" +msgid "`Boost: is_bipartite `__" msgstr "" -msgid "" -"`Wikipedia: bipartite graph `__" +msgid "`Wikipedia: bipartite graph `__" msgstr "" msgid "``pgr_boykovKolmogorov``" 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." +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 "" msgid "pgr_boykovKolmogorov(Combinations)" @@ -9906,42 +8489,31 @@ msgstr "" msgid "From vertices :math:`\\{11, 3, 17\\}` to vertex :math:`12`" msgstr "" -msgid "" -"From vertices :math:`\\{11, 3, 17\\}` to vertices :math:`\\{5, 10, 12\\}`" +msgid "From vertices :math:`\\{11, 3, 17\\}` to vertices :math:`\\{5, 10, 12\\}`" msgstr "" -msgid "" -"Using a combinations table, equivalent to calculating result from vertices :" -"math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`." +msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`." msgstr "" -msgid "" -"`Boost: Boykov Kolmogorov max flow `__" +msgid "`Boost: Boykov Kolmogorov max flow `__" msgstr "" msgid "``pgr_breadthFirstSearch`` - Experimental" msgstr "" -msgid "" -"``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth " -"First Search algorithm." +msgid "``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth First Search algorithm." msgstr "" msgid "Version 4.0.0:" msgstr "" -msgid "" -"Provides the Breadth First Search traversal order from a root vertex to a " -"particular depth." +msgid "Provides the Breadth First Search traversal order from a root vertex to a particular depth." msgstr "" msgid "The implementation will work on any type of graph." msgstr "" -msgid "" -"Provides the Breadth First Search traversal order from a source node to a " -"target depth level." +msgid "Provides the Breadth First Search traversal order from a source node to a target depth level." msgstr "" msgid "Running time: :math:`O(E + V)`" @@ -9956,14 +8528,10 @@ msgstr "" msgid "**options:** ``[max_depth, directed]``" msgstr "" -msgid "" -"From root vertex :math:`6` on a **directed** graph with edges in ascending " -"order of ``id``" +msgid "From root vertex :math:`6` on a **directed** graph with edges in ascending order of ``id``" msgstr "" -msgid "" -"From root vertices :math:`\\{12, 6\\}` on an **undirected** graph with " -"**depth** :math:`<= 2` and edges in ascending order of ``id``" +msgid "From root vertices :math:`\\{12, 6\\}` on an **undirected** graph with **depth** :math:`<= 2` and edges in ascending order of ``id``" msgstr "" msgid "DFS optional parameters" @@ -9978,9 +8546,7 @@ msgstr "" msgid "The resulting traversal is different." msgstr "" -msgid "" -"The left image shows the result with ascending order of ids and the right " -"image shows with descending order of the edge identifiers." +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 "" msgid "|ascending| |descending|" @@ -9992,9 +8558,7 @@ msgstr "" msgid "descending" msgstr "" -msgid "" -"`Wikipedia: Breadth First Search algorithm `__" +msgid "`Wikipedia: Breadth First Search algorithm `__" msgstr "" msgid "``pgr_bridges``" @@ -10003,10 +8567,7 @@ msgstr "" msgid "``pgr_bridges`` - Return the bridges of an undirected graph." 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." +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 "``edge`` ascending" @@ -10030,17 +8591,13 @@ msgstr "" msgid "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" msgstr "" -msgid "" -"`Boost: Connected components `__" +msgid "`Boost: Connected components `__" msgstr "" msgid "``pgr_chinesePostman`` - Experimental" msgstr "" -msgid "" -"``pgr_chinesePostman`` — Calculates the shortest circuit path which contains " -"every edge in a directed graph and starts and ends on the same vertex." +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 "" msgid "Returns ``EMPTY SET`` on a disconnected graph" @@ -10058,9 +8615,7 @@ msgstr "" msgid "Sequential value starting from ``1``" msgstr "" -msgid "" -"Identifier of the edge used to go from ``node`` to the next node in the path " -"sequence. ``-1`` for the last node of the path." +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 "" msgid "Aggregate cost from ``start_v`` to ``node``." @@ -10069,10 +8624,7 @@ msgstr "" msgid "``pgr_chinesePostmanCost`` - Experimental" msgstr "" -msgid "" -"``pgr_chinesePostmanCost`` — Calculates the minimum costs of a circuit path " -"which contains every edge in a directed graph and starts and ends on the " -"same vertex." +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 "" msgid "Return value when the graph if disconnected" @@ -10093,14 +8645,10 @@ msgstr "" msgid "``pgr_connectedComponents``" msgstr "" -msgid "" -"``pgr_connectedComponents`` — Connected components of an undirected graph " -"using a DFS-based approach." +msgid "``pgr_connectedComponents`` — Connected components of an undirected graph using a DFS-based approach." msgstr "" -msgid "" -"A connected component of an undirected graph is a set of vertices that are " -"all reachable from each other." +msgid "A connected component of an undirected graph is a set of vertices that are all reachable from each other." msgstr "" msgid "Components are described by vertices" @@ -10127,17 +8675,13 @@ msgstr "" msgid "Connecting disconnected components" msgstr "" -msgid "" -"wikipedia: `Connected component `__" +msgid "wikipedia: `Connected component `__" msgstr "" msgid "``pgr_contraction``" msgstr "" -msgid "" -"``pgr_contraction`` — Performs graph contraction and returns the contracted " -"vertices and edges." +msgid "``pgr_contraction`` — Performs graph contraction and returns the contracted vertices and edges." msgstr "" msgid "Version 3.8.0" @@ -10146,16 +8690,13 @@ msgstr "" msgid "New signature:" msgstr "" -msgid "" -"Previously compulsory parameter **Contraction order** is now optional with " -"name ``methods``." +msgid "Previously compulsory parameter **Contraction order** is now optional with name ``methods``." msgstr "" msgid "New name and order of optional parameters." msgstr "" -msgid "" -"Deprecated signature pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgid "Deprecated signature pgr_contraction(text,bigint[],integer,bigint[],boolean)" msgstr "" msgid "Name change from ``pgr_contractGraph``" @@ -10164,10 +8705,7 @@ msgstr "" msgid "Bug fixes" msgstr "" -msgid "" -"Contraction reduces the size of the graph by removing some of the vertices " -"and edges and, for example, might add edges that represent a sequence of " -"original edges decreasing the total time and space used in graph algorithms." +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 "" msgid "Does not return the full contracted graph." @@ -10194,9 +8732,7 @@ msgstr "" msgid "column ``id`` with negative numbers descending when its a new edge." msgstr "" -msgid "" -"Currently there are two types of contraction methods included in this " -"function:" +msgid "Currently there are two types of contraction methods included in this function:" msgstr "" msgid "Dead End Contraction. See :doc:`pgr_contractionDeadEnd`." @@ -10295,9 +8831,7 @@ msgstr "" msgid "Decreasing sequence starting from **-1**." msgstr "" -msgid "" -"Representing a pseudo `id` as is not incorporated in the set of original " -"edges." +msgid "Representing a pseudo `id` as is not incorporated in the set of original edges." msgstr "" msgid "``contracted_vertices``" @@ -10309,18 +8843,13 @@ msgstr "" msgid "When ``type`` = **'v'**: :math:`-1`" msgstr "" -msgid "" -"When ``type`` = **'e'**: Identifier of the source vertex of the current edge " -"(``source``, ``target``)." +msgid "When ``type`` = **'e'**: Identifier of the source vertex of the current edge (``source``, ``target``)." msgstr "" -msgid "" -"When ``type`` = **'e'**: Identifier of the target vertex of the current edge " -"(``source``, ``target``)." +msgid "When ``type`` = **'e'**: Identifier of the target vertex of the current edge (``source``, ``target``)." msgstr "" -msgid "" -"When ``type`` = **'e'**: Weight of the current edge (``source``, ``target``)." +msgid "When ``type`` = **'e'**: Weight of the current edge (``source``, ``target``)." msgstr "" msgid "Only dead end contraction" @@ -10332,11 +8861,7 @@ msgstr "" msgid "The cycle" msgstr "" -msgid "" -"Contracting a graph can be done with more than one operation. The order of " -"the operations affect the resulting contracted graph, after applying one " -"operation, the set of vertices that can be contracted by another operation " -"changes." +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 ``cycles`` times through the ``methods`` ." @@ -10345,9 +8870,7 @@ msgstr "" msgid "Contracting sample data" msgstr "" -msgid "" -"In this section, building and using a contracted graph will be shown by " -"example." +msgid "In this section, building and using a contracted graph will be shown by example." msgstr "" msgid "The :doc:`sampledata` for an undirected graph is used" @@ -10362,15 +8885,10 @@ msgstr "" msgid "The original graph:" msgstr "" -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." +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 "" -"Observe that vertices, for example, :math:`6` do not appear in the results " -"because it was not affected by the contraction algorithm." +msgid "Observe that vertices, for example, :math:`6` do not appear in the results because it was not affected by the contraction algorithm." msgstr "" msgid "After doing the dead end contraction operation:" @@ -10385,9 +8903,7 @@ msgstr "" msgid "Add additional columns" msgstr "" -msgid "" -"Adding extra columns to the edges and vertices tables. In this documentation " -"the following will be used:" +msgid "Adding extra columns to the edges and vertices tables. In this documentation the following will be used:" msgstr "" msgid "Column." @@ -10402,13 +8918,10 @@ msgstr "" msgid "On the vertex table" msgstr "" -msgid "" -"when ``true`` the vertex is contracted, its not part of the contracted graph." +msgid "when ``true`` the vertex is contracted, its not part of the contracted graph." msgstr "" -msgid "" -"when ``false`` the vertex is not contracted, its part of the contracted " -"graph." +msgid "when ``false`` the vertex is not contracted, its part of the contracted graph." msgstr "" msgid "``is_new``" @@ -10417,14 +8930,10 @@ msgstr "" msgid "On the edge table" msgstr "" -msgid "" -"when ``true`` the edge was generated by the contraction algorithm. its part " -"of the contracted graph." +msgid "when ``true`` the edge was generated by the contraction algorithm. its part of the contracted graph." msgstr "" -msgid "" -"when ``false`` the edge is an original edge, might be or not part of the " -"contracted graph." +msgid "when ``false`` the edge is an original edge, might be or not part of the contracted graph." msgstr "" msgid "Store contraction information" @@ -10436,13 +8945,10 @@ msgstr "" msgid "Update the edges and vertices tables" msgstr "" -msgid "" -"Use ``is_contracted`` column to indicate the vertices that are contracted." +msgid "Use ``is_contracted`` column to indicate the vertices that are contracted." msgstr "" -msgid "" -"Fill ``contracted_vertices`` with the information from the results that " -"belong to the vertices." +msgid "Fill ``contracted_vertices`` with the information from the results that belong to the vertices." msgstr "" msgid "Insert the new edges generated by pgr_contraction." @@ -10463,16 +8969,10 @@ msgstr "" msgid "Using the contracted graph" msgstr "" -msgid "" -"Depending on the final application the graph is to be prepared. In this " -"example the final application will be to calculate the cost from two " -"vertices in the original graph by using the contracted graph with " -"``pgr_dijkstraCost``" +msgid "Depending on the final application the graph is to be prepared. In this example the final application will be to calculate the cost from two vertices in the original graph by using the contracted graph with ``pgr_dijkstraCost``" msgstr "" -msgid "" -"There are three cases when calculating the shortest path between a given " -"source and target in a contracted graph:" +msgid "There are three cases when calculating the shortest path between a given source and target in a contracted graph:" msgstr "" msgid "Case 1: Both source and target belong to the contracted graph." @@ -10493,20 +8993,16 @@ msgstr "" msgid "Create the function that will use the contracted graph." msgstr "" -msgid "" -"Case 2: Source and/or target belong to an edge that has contracted vertices." +msgid "Case 2: Source and/or target belong to an edge that has contracted vertices." msgstr "" -msgid "" -"Case 3: Source and/or target belong to a vertex that has been contracted." +msgid "Case 3: Source and/or target belong to a vertex that has been contracted." msgstr "" msgid "``pgr_contractionDeadEnd`` - Proposed" msgstr "" -msgid "" -"``pgr_contractionDeadEnd`` — Performs graph contraction and returns the " -"contracted vertices and edges." +msgid "``pgr_contractionDeadEnd`` — Performs graph contraction and returns the contracted vertices and edges." msgstr "" msgid "A node is considered a dead end node when:" @@ -10524,8 +9020,7 @@ msgstr "" msgid "When there is only one adjacent vertex or" msgstr "" -msgid "" -"When all edges are incoming regardless of the number of adjacent vertices." +msgid "When all edges are incoming regardless of the number of adjacent vertices." msgstr "" msgid "pgr_contractionDeadEnd(`Edges SQL`_, [**options**])" @@ -10576,8 +9071,7 @@ msgstr "" msgid "The green nodes are dead end nodes" msgstr "" -msgid "" -"The blue nodes have an unlimited number of incoming and/or outgoing edges." +msgid "The blue nodes have an unlimited number of incoming and/or outgoing edges." msgstr "" msgid "Node" @@ -10640,37 +9134,25 @@ msgstr "" msgid "Many adjacent nodes." msgstr "" -msgid "" -"Has more than one adjacent node and some edges are incoming and some are " -"outgoing." +msgid "Has more than one adjacent node and some edges are incoming and some are outgoing." msgstr "" -msgid "" -"From above, nodes :math:`\\{6, 7, 9\\}` are dead ends because the total " -"number of adjacent vertices is one." +msgid "From above, nodes :math:`\\{6, 7, 9\\}` are dead ends because the total number of adjacent vertices is one." msgstr "" -msgid "" -"When there are more than one adjacent vertex, all edges need to be all " -"incoming edges otherwise it is not a dead end." +msgid "When there are more than one adjacent vertex, all edges need to be all incoming edges otherwise it is not a dead end." msgstr "" msgid "Step by step dead end contraction" msgstr "" -msgid "" -"The dead end contraction will stop until there are no more dead end nodes. " -"For example, from the following graph where :math:`3` is the dead end node:" +msgid "The dead end contraction will stop until there are no more dead end nodes. For example, from the following graph where :math:`3` is the dead end node:" msgstr "" -msgid "" -"After contracting :math:`3`, node :math:`2` is now a dead end node and is " -"contracted:" +msgid "After contracting :math:`3`, node :math:`2` is now a dead end node and is contracted:" msgstr "" -msgid "" -"After contracting :math:`2`, stop. Node :math:`1` has the information of " -"nodes that were contracted." +msgid "After contracting :math:`2`, stop. Node :math:`1` has the information of nodes that were contracted." msgstr "" msgid "Creating the contracted graph" @@ -10700,74 +9182,34 @@ msgstr "" msgid "``pgr_contractionHierarchies`` - Experimental" msgstr "" -msgid "" -"``pgr_contractionHierarchies`` — Performs graph contraction according to the " -"contraction hierarchies method and returns the contracted vertices and " -"shortcut edges created." +msgid "``pgr_contractionHierarchies`` — Performs graph contraction according to the contraction hierarchies method and returns the contracted vertices and shortcut edges created." msgstr "" -msgid "" -"The contraction hierarchies method builds, from an initial order of the " -"vertices, a hierarchical order, giving priority to some vertices during the " -"processing of label fixing of shortest paths algorithms. Furthermore, the " -"contraction hierarchies algorithm adds shortcut edges in the graph, that " -"helps the shortest paths algorithm to follow the created hierarchical graph " -"structure." +msgid "The contraction hierarchies method builds, from an initial order of the vertices, a hierarchical order, giving priority to some vertices during the processing of label fixing of shortest paths algorithms. Furthermore, the contraction hierarchies algorithm adds shortcut edges in the graph, that helps the shortest paths algorithm to follow the created hierarchical graph structure." msgstr "" -msgid "" -"The idea of the hierarchy is to put at a high priority level vertices that " -"belong to the long distance network (highways for example in a road network) " -"and to a low level of priority nodes that belong to the short distance " -"network (arterials or secondary roads for example in road networks)." +msgid "The idea of the hierarchy is to put at a high priority level vertices that belong to the long distance network (highways for example in a road network) and to a low level of priority nodes that belong to the short distance network (arterials or secondary roads for example in road networks)." msgstr "" -msgid "" -"The contraction hierarchies algorithm makes the assumption that there is " -"already a valuable vertices order that is used to initialize the contraction " -"process. As in most cases there is no valuable initial node ordering, we use " -"the order given by vertices ID. Then, the contraction process is made on the " -"basis of this first order to give the final hierarchy." +msgid "The contraction hierarchies algorithm makes the assumption that there is already a valuable vertices order that is used to initialize the contraction process. As in most cases there is no valuable initial node ordering, we use the order given by vertices ID. Then, the contraction process is made on the basis of this first order to give the final hierarchy." msgstr "" -msgid "" -"The basic idea is to keep the vertices in a priority queue sorted by some " -"estimate of how attractive is their contraction. The implemented case uses " -"the metric called *edge difference*, which corresponds to the difference " -"between the number of shortcuts produced by a vertex contraction and the " -"number of incident edges in the graph before contraction (``#shortcuts - " -"#incident edges``)." +msgid "The basic idea is to keep the vertices in a priority queue sorted by some estimate of how attractive is their contraction. The implemented case uses the metric called *edge difference*, which corresponds to the difference between the number of shortcuts produced by a vertex contraction and the number of incident edges in the graph before contraction (``#shortcuts - #incident edges``)." msgstr "" -msgid "" -"Finally, the aim is to reduce the explored part of the graph, when using a " -"bidirectional Dijkstra-like algorithm. The vertices order is used to feed " -"the oriented search. The search is made without losing optimality." +msgid "Finally, the aim is to reduce the explored part of the graph, when using a bidirectional Dijkstra-like algorithm. The vertices order is used to feed the oriented search. The search is made without losing optimality." msgstr "" -msgid "" -"Finding an optimal vertices ordering for contraction is a difficult problem. " -"Nevertheless, very simple local heuristics work quite well, according to " -"Geisberger et al. [2]. The principle here is to a priori estimate the value " -"of the *edge difference* and to contract the node at the top of the queue " -"only if the new value of the metric keeps it at the top of the queue. " -"Otherwise, it is reinserted in the queue, at its right place corresponding " -"to the new metric value." +msgid "Finding an optimal vertices ordering for contraction is a difficult problem. Nevertheless, very simple local heuristics work quite well, according to Geisberger et al. [2]. The principle here is to a priori estimate the value of the *edge difference* and to contract the node at the top of the queue only if the new value of the metric keeps it at the top of the queue. Otherwise, it is reinserted in the queue, at its right place corresponding to the new metric value." msgstr "" msgid "The process is done on graphs having only edges with positive costs." msgstr "" -msgid "" -"It is necessary to remember that there are no deleted vertices with this " -"function. At the end, the graph keeps every vertex it had, but has some " -"added edges, corresponding to shortcuts. The vertices which have been " -"contracted, to build the shortcut edges, are kept and hierarchically ordered." +msgid "It is necessary to remember that there are no deleted vertices with this function. At the end, the graph keeps every vertex it had, but has some added edges, corresponding to shortcuts. The vertices which have been contracted, to build the shortcut edges, are kept and hierarchically ordered." msgstr "" -msgid "" -"As for the other contraction methods, it does not return the full contracted " -"graph, only the changes. They are here of two types:" +msgid "As for the other contraction methods, it does not return the full contracted graph, only the changes. They are here of two types:" msgstr "" msgid "added shortcut edges, with negative identifiers;" @@ -10776,8 +9218,7 @@ msgstr "" msgid "contracted nodes with an order." msgstr "" -msgid "" -"The ``pgr_contractionHierarchies`` function has the following signature:" +msgid "The ``pgr_contractionHierarchies`` function has the following signature:" msgstr "" msgid "pgr_contractionHierarchies(`Edges SQL`_, [**options**])" @@ -10792,9 +9233,7 @@ msgstr "" msgid "True if the graph is directed, False otherwise." msgstr "" -msgid "" -"The function returns many rows (one per vertex and one per shortcut edge " -"created). The columns of the rows are:" +msgid "The function returns many rows (one per vertex and one per shortcut edge created). The columns of the rows are:" msgstr "" msgid "Type of the ``id``." @@ -10815,40 +9254,25 @@ msgstr "" msgid "On an undirected graph" msgstr "" -msgid "" -"The following query shows the original data involved in the contraction " -"operation on an undirected graph." +msgid "The following query shows the original data involved in the contraction operation on an undirected graph." msgstr "" msgid "building contraction hierarchies on the whole graph" msgstr "" -msgid "" -"The results do not represent the contracted graph. They represent the " -"changes done to the graph after applying the contraction algorithm and give " -"the vertex order built by the algorithm, by ordering vertices according to " -"the *edge difference* metric. As a consequence, vertices are all represented " -"in the result (except of course forbidden ones). Only shortcut built by the " -"algorithm are represented in the result." +msgid "The results do not represent the contracted graph. They represent the changes done to the graph after applying the contraction algorithm and give the vertex order built by the algorithm, by ordering vertices according to the *edge difference* metric. As a consequence, vertices are all represented in the result (except of course forbidden ones). Only shortcut built by the algorithm are represented in the result." msgstr "" -msgid "" -"After computing the contraction hierarchies, an order is now given to the " -"vertices," +msgid "After computing the contraction hierarchies, an order is now given to the vertices," msgstr "" -msgid "" -"in order to be used with a specific Dijkstra algorithm (implementation " -"coming in a future version), which speeds up the search." +msgid "in order to be used with a specific Dijkstra algorithm (implementation coming in a future version), which speeds up the search." msgstr "" msgid "We obtain the contracted graph above:" msgstr "" -msgid "" -"We can see without surprise that the vertices belonging to the shortcuts " -"have a tendency to have a high priority level in the resulting vertices " -"order." +msgid "We can see without surprise that the vertices belonging to the shortcuts have a tendency to have a high priority level in the resulting vertices order." msgstr "" msgid "On an undirected graph with forbidden vertices" @@ -10863,24 +9287,13 @@ msgstr "" msgid "Shortcut building process" msgstr "" -msgid "" -"A vertex ``v`` is contracted by adding shortcuts replacing former paths of " -"the form ``(u, v, w)`` by an edge ``(u, w)``. The shortcut ``(u, w)`` is " -"only needed when ``(u, v, w)`` is the only shortest path between ``u`` and " -"``w``." +msgid "A vertex ``v`` is contracted by adding shortcuts replacing former paths of the form ``(u, v, w)`` by an edge ``(u, w)``. The shortcut ``(u, w)`` is only needed when ``(u, v, w)`` is the only shortest path between ``u`` and ``w``." msgstr "" -msgid "" -"When all shortcuts have been added for a given vertex ``v``, the incident " -"edges of ``v`` are removed and another vertex is contracted with the " -"remaining graph." +msgid "When all shortcuts have been added for a given vertex ``v``, the incident edges of ``v`` are removed and another vertex is contracted with the remaining graph." msgstr "" -msgid "" -"The procedure is destructive for the graph and a copy is made to be able to " -"manipulate it again as a whole. The contraction process adds all discovered " -"shortcuts to the edge set ``E`` and attributes a metric to each contracted " -"vertex. This metric is giving what is called the *contraction hierarchy*." +msgid "The procedure is destructive for the graph and a copy is made to be able to manipulate it again as a whole. The contraction process adds all discovered shortcuts to the edge set ``E`` and attributes a metric to each contracted vertex. This metric is giving what is called the *contraction hierarchy*." msgstr "" msgid "Initialize the queue with a first vertices order" @@ -10922,51 +9335,28 @@ msgstr "" msgid "Adjacent edges are removed." msgstr "" -msgid "" -"Shortcuts are built from predecessors of ``v`` to successors of ``v`` if and " -"only if the path through ``v`` corresponds to the only shortest path between " -"the predecessor and the successor of ``v`` in the graph. The *edge " -"difference* metric here takes the value of -2." +msgid "Shortcuts are built from predecessors of ``v`` to successors of ``v`` if and only if the path through ``v`` corresponds to the only shortest path between the predecessor and the successor of ``v`` in the graph. The *edge difference* metric here takes the value of -2." msgstr "" -msgid "" -"Then the following vertex is contracted. The process goes on until each node " -"of the graph has been contracted. At the end, there are no more edges in the " -"graph, which has been destroyed by the process." +msgid "Then the following vertex is contracted. The process goes on until each node of the graph has been contracted. At the end, there are no more edges in the graph, which has been destroyed by the process." msgstr "" -msgid "" -"This first contraction will give a vertices order, given by ordering them in " -"ascending order on the metric (edge difference). A total vertices order is " -"built. If ``u < v``, then ``u`` is less important than ``v``. The algorithm " -"keeps the vertices into a queue in this order." +msgid "This first contraction will give a vertices order, given by ordering them in ascending order on the metric (edge difference). A total vertices order is built. If ``u < v``, then ``u`` is less important than ``v``. The algorithm keeps the vertices into a queue in this order." msgstr "" -msgid "" -"A hierarchy will now be constructed by contracting again the vertices in " -"this order." +msgid "A hierarchy will now be constructed by contracting again the vertices in this order." msgstr "" msgid "Build the final vertex order" msgstr "" -msgid "" -"Once the first order built, the algorithm uses it to browse the graph once " -"again. For each vertex taken in the queue, the algorithm simulates " -"contraction and calculates its edge difference. If the computed value is " -"greater than the one of the next vertex to be contracted, then the algorithm " -"puts it back in the queue (heuristic approach). Otherwise it contracts it " -"permanently." +msgid "Once the first order built, the algorithm uses it to browse the graph once again. For each vertex taken in the queue, the algorithm simulates contraction and calculates its edge difference. If the computed value is greater than the one of the next vertex to be contracted, then the algorithm puts it back in the queue (heuristic approach). Otherwise it contracts it permanently." msgstr "" msgid "Add shortcuts to the initial graph" msgstr "" -msgid "" -"At the end, the algorithm takes the initial graph (before edges deletions) " -"and adds the shortcut edges to it. It gives you the contracted graph, ready " -"to use with a specialized Dijkstra algorithm, which takes into account the " -"order of the nodes in the hierarchy." +msgid "At the end, the algorithm takes the initial graph (before edges deletions) and adds the shortcut edges to it. It gives you the contracted graph, ready to use with a specialized Dijkstra algorithm, which takes into account the order of the nodes in the hierarchy." msgstr "" msgid "Use the contraction" @@ -10978,8 +9368,7 @@ msgstr "" msgid "Add shortcuts and hierarchy in the existing tables" msgstr "" -msgid "" -"Add new columns in the `vertices` and `edges` tables to store the results:" +msgid "Add new columns in the `vertices` and `edges` tables to store the results:" msgstr "" msgid "Update and insert the results in the two tables." @@ -10988,17 +9377,13 @@ msgstr "" msgid "Use a Dijkstra shortest path algorithm on it" msgstr "" -msgid "" -"Then you can use any Dijkstra-like algorithm, waiting for the adapted one " -"which will take into account the built vertices hierarchy. For example:" +msgid "Then you can use any Dijkstra-like algorithm, waiting for the adapted one which will take into account the built vertices hierarchy. For example:" msgstr "" msgid "``pgr_contractionLinear`` - Proposed" msgstr "" -msgid "" -"``pgr_contractionLinear`` — Performs graph contraction and returns the " -"contracted vertices and edges." +msgid "``pgr_contractionLinear`` — Performs graph contraction and returns the contracted vertices and edges." msgstr "" msgid "pgr_contractionLinear(`Edges SQL`_, [**options**])" @@ -11007,9 +9392,7 @@ msgstr "" msgid "Linear contraction on an undirected graph." msgstr "" -msgid "" -"The green nodes are linear nodes and will not be part of the contracted " -"graph." +msgid "The green nodes are linear nodes and will not be part of the contracted graph." msgstr "" msgid "All edges adjacent will not be part of the contracted graph." @@ -11021,9 +9404,7 @@ msgstr "" msgid "**contraction Order**" msgstr "" -msgid "" -"Number of times the contraction operations on ``contraction_order`` will be " -"performed." +msgid "Number of times the contraction operations on ``contraction_order`` will be performed." msgstr "" msgid "A node connects two (or more) `linear` edges when" @@ -11044,14 +9425,10 @@ msgstr "" msgid "Graph where linearity is not symmetrical." msgstr "" -msgid "" -"When the graph is processed as a directed graph, linearity is not " -"symmetrical, therefore the graph can not be contracted." +msgid "When the graph is processed as a directed graph, linearity is not symmetrical, therefore the graph can not be contracted." msgstr "" -msgid "" -"When the same graph is processed as an undirected graph, linearity is " -"symmetrical, therefore the graph can be contracted." +msgid "When the same graph is processed as an undirected graph, linearity is symmetrical, therefore the graph can be contracted." msgstr "" msgid "The three edges can be replaced by one undirected edge" @@ -11087,9 +9464,7 @@ msgstr "" msgid "Step by step linear contraction" msgstr "" -msgid "" -"The linear contraction will stop when there are no more linear edges. For " -"example from the following graph there are linear edges" +msgid "The linear contraction will stop when there are no more linear edges. For example from the following graph there are linear edges" msgstr "" msgid "Contracting vertex :math:`3`," @@ -11098,13 +9473,10 @@ msgstr "" msgid "The vertex :math:`3` is removed from the graph" msgstr "" -msgid "" -"The edges :math:`2 \\rightarrow 3` and :math:`w \\rightarrow z` are removed " -"from the graph." +msgid "The edges :math:`2 \\rightarrow 3` and :math:`w \\rightarrow z` are removed from the graph." msgstr "" -msgid "" -"A new edge :math:`2 \\rightarrow 4` is inserted represented with red color." +msgid "A new edge :math:`2 \\rightarrow 4` is inserted represented with red color." msgstr "" msgid "Contracting vertex :math:`2`:" @@ -11113,18 +9485,13 @@ msgstr "" msgid "The vertex :math:`2` is removed from the graph" msgstr "" -msgid "" -"The edges :math:`1 \\rightarrow 2` and :math:`2 \\rightarrow 3` are removed " -"from the graph." +msgid "The edges :math:`1 \\rightarrow 2` and :math:`2 \\rightarrow 3` are removed from the graph." msgstr "" -msgid "" -"A new edge :math:`1 \\rightarrow 3` is inserted represented with red color." +msgid "A new edge :math:`1 \\rightarrow 3` is inserted represented with red color." msgstr "" -msgid "" -"Edge :math:`1 \\rightarrow 3` has the information of cost and the nodes that " -"were contracted." +msgid "Edge :math:`1 \\rightarrow 3` has the information of cost and the nodes that were contracted." msgstr "" msgid "Create the contracted graph." @@ -11133,32 +9500,22 @@ msgstr "" msgid "``pgr_cuthillMckeeOrdering`` - Experimental" msgstr "" -msgid "" -"``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of " -"an undirected graphs" +msgid "``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of an undirected graphs" msgstr "" msgid "Version 3.4.0" msgstr "" -msgid "" -"In numerical linear algebra, the Cuthill-McKee algorithm (CM), named after " -"Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse " -"matrix that has a symmetric sparsity pattern into a band matrix form with a " -"small bandwidth." +msgid "In numerical linear algebra, the Cuthill-McKee algorithm (CM), named after Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse matrix that has a symmetric sparsity pattern into a band matrix form with a small bandwidth." msgstr "" -msgid "" -"The vertices are basically assigned a breadth-first search order, except " -"that at each step, the adjacent vertices are placed in the queue in order of " -"increasing degree." +msgid "The vertices are basically assigned a breadth-first search order, except that at each step, the adjacent vertices are placed in the queue in order of increasing degree." msgstr "" msgid "The implementation is for **undirected** graphs." msgstr "" -msgid "" -"The bandwidth minimization problems are considered NP-complete problems." +msgid "The bandwidth minimization problems are considered NP-complete problems." msgstr "" msgid "The running time complexity is: :math:`O(m log(m)|V|)`" @@ -11188,49 +9545,31 @@ msgstr "" msgid "New ordering in reverse order." msgstr "" -msgid "" -"`Boost: Cuthill-McKee Ordering `__" +msgid "`Boost: Cuthill-McKee Ordering `__" msgstr "" -msgid "" -"`Wikipedia: Cuthill-McKee Ordering `__" +msgid "`Wikipedia: Cuthill-McKee Ordering `__" msgstr "" msgid "``pgr_dagShortestPath`` - Experimental" msgstr "" -msgid "" -"``pgr_dagShortestPath`` — Returns the shortest path for weighted directed " -"acyclic graphs(DAG). In particular, the DAG shortest paths algorithm " -"implemented by Boost.Graph." +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 "" msgid "pgr_dagShortestPath(Combinations)" msgstr "" -msgid "" -"Shortest Path for Directed Acyclic Graph(DAG) is a graph search algorithm " -"that solves the shortest path problem for weighted directed acyclic graph, " -"producing a shortest path from a starting vertex (``start_vid``) to an " -"ending vertex (``end_vid``)." +msgid "Shortest Path for Directed Acyclic Graph(DAG) is a graph search algorithm that solves the shortest path problem for weighted directed acyclic graph, producing a shortest path from a starting vertex (``start_vid``) to an ending vertex (``end_vid``)." msgstr "" -msgid "" -"This implementation can only be used with a **directed** graph with no " -"cycles i.e. directed acyclic graph." +msgid "This implementation can only be used with a **directed** graph with no cycles i.e. directed acyclic graph." msgstr "" -msgid "" -"The algorithm relies on topological sorting the dag to impose a linear " -"ordering on the vertices, and thus is more efficient for DAG's than either " -"the Dijkstra or Bellman-Ford algorithm." +msgid "The algorithm relies on topological sorting the dag to impose a linear ordering on the vertices, and thus is more efficient for DAG's than either the Dijkstra or Bellman-Ford algorithm." msgstr "" -msgid "" -"Process is valid for weighted directed acyclic graphs only. otherwise it " -"will throw warnings." +msgid "Process is valid for weighted directed acyclic graphs only. otherwise it will throw warnings." msgstr "" msgid "The `agg_cost` the non included values `(v, v)` is `0`" @@ -11266,9 +9605,7 @@ msgstr "" msgid "From vertices :math:`\\{5, 10\\}` to vertex :math:`11`" msgstr "" -msgid "" -"From vertices :math:`\\{5, 15\\}` to vertices :math:`\\{11, 17\\}` on an " -"**undirected** graph" +msgid "From vertices :math:`\\{5, 15\\}` to vertices :math:`\\{11, 17\\}` on an **undirected** graph" msgstr "" msgid "Return columns" @@ -11277,9 +9614,7 @@ msgstr "" msgid "Making **start_vids** the same as **end_vids**" msgstr "" -msgid "" -"`Boost: DAG shortest paths `__" +msgid "`Boost: DAG shortest paths `__" msgstr "" msgid "https://en.wikipedia.org/wiki/Topological_sorting" @@ -11288,9 +9623,7 @@ msgstr "" msgid "``pgr_degree``" msgstr "" -msgid "" -"``pgr_degree`` — For each vertex in an undirected graph, return the count of " -"edges incident to the vertex." +msgid "``pgr_degree`` — For each vertex in an undirected graph, return the count of edges incident to the vertex." msgstr "" msgid "Error messages adjustment." @@ -11302,9 +9635,7 @@ msgstr "" msgid "Calculates the degree of the vertices of an undirected graph" msgstr "" -msgid "" -"The degree (or valency) of a vertex of a graph is the number of edges that " -"are incident to the vertex." +msgid "The degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex." msgstr "" msgid "A loop contributes 2 to a vertex's degree." @@ -11316,18 +9647,13 @@ msgstr "" msgid "Isolated vertex is not part of the result" msgstr "" -msgid "" -"Vertex not participating on the subgraph is considered and isolated vertex." +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``." +msgid "There can be a ``dryrun`` execution and the code used to get the answer will be shown in a PostgreSQL ``NOTICE``." msgstr "" -msgid "" -"The code can be used as base code for the particular application " -"requirements." +msgid "The code can be used as base code for the particular application requirements." msgstr "" msgid "No ordering is performed." @@ -11360,9 +9686,7 @@ msgstr "" msgid "``pgr_degree`` can use :doc:`pgr_extractVertices` embedded in the call." msgstr "" -msgid "" -"For decent size networks, it is best to prepare your vertices table before " -"hand and use it on ``pgr_degree`` calls. (See `Using a vertex table`_)" +msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls. (See `Using a vertex table`_)" msgstr "" msgid "Calculate the degree of the nodes:" @@ -11392,9 +9716,7 @@ msgstr "" msgid "``in_edges``" msgstr "" -msgid "" -"Array of identifiers of the edges that have the vertex ``id`` as *first end " -"point*." +msgid "Array of identifiers of the edges that have the vertex ``id`` as *first end point*." msgstr "" msgid "When missing, ``out_edges`` must exist." @@ -11403,9 +9725,7 @@ msgstr "" msgid "``out_edges``" msgstr "" -msgid "" -"Array of identifiers of the edges that have the vertex ``id`` as *second end " -"point*." +msgid "Array of identifiers of the edges that have the vertex ``id`` as *second end point*." msgstr "" msgid "When missing, ``in_edges`` must exist." @@ -11453,9 +9773,7 @@ msgstr "" msgid "Using a vertex table" msgstr "" -msgid "" -"For decent size networks, it is best to prepare your vertices table before " -"hand and use it on ``pgr_degree`` calls." +msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls." msgstr "" msgid "Extract the vertex information and save into a table:" @@ -11464,24 +9782,16 @@ msgstr "" msgid "Dry run execution" msgstr "" -msgid "" -"To get the query generated used to get the vertex information, use ``dryrun " -"=> true``." +msgid "To get the query generated used to get the vertex information, use ``dryrun => true``." msgstr "" -msgid "" -"The results can be used as base code to make a refinement based on the " -"backend development needs." +msgid "The results can be used as base code to make a refinement based on the backend development needs." msgstr "" msgid "Finding dead ends" msgstr "" -msgid "" -"If there is a vertices table already built using ``pgr_extractVertices`` and " -"want the degree of the whole graph rather than a subset, it can be forgo " -"using ``pgr_degree`` and work with the ``in_edges`` and ``out_edges`` " -"columns directly." +msgid "If there is a vertices table already built using ``pgr_extractVertices`` and want the degree of the whole graph rather than a subset, it can be forgo using ``pgr_degree`` and work with the ``in_edges`` and ``out_edges`` columns directly." msgstr "" msgid "The degree of a dead end is 1." @@ -11493,8 +9803,7 @@ msgstr "" msgid "The degree of a linear vertex is 2." msgstr "" -msgid "" -"If there is a vertices table already built using the ``pgr_extractVertices``" +msgid "If there is a vertices table already built using the ``pgr_extractVertices``" msgstr "" msgid ":doc:`pgr_extractVertices`" @@ -11503,43 +9812,28 @@ msgstr "" msgid "``pgr_depthFirstSearch`` - Proposed" msgstr "" -msgid "" -"``pgr_depthFirstSearch`` — Returns a depth first search traversal of the " -"graph. The graph can be directed or undirected." +msgid "``pgr_depthFirstSearch`` — Returns a depth first search traversal of the graph. The graph can be directed or undirected." msgstr "" msgid "Version 3.3.0" msgstr "" -msgid "" -"Depth First Search algorithm is a traversal algorithm which starts from a " -"root vertex, goes as deep as possible, and backtracks once a vertex is " -"reached with no adjacent vertices or with all visited adjacent vertices. The " -"traversal continues until all the vertices reachable from the root vertex " -"are visited." +msgid "Depth First Search algorithm is a traversal algorithm which starts from a root vertex, goes as deep as possible, and backtracks once a vertex is reached with no adjacent vertices or with all visited adjacent vertices. The traversal continues until all the vertices reachable from the root vertex are visited." msgstr "" -msgid "" -"The implementation works for both **directed** and **undirected** graphs." +msgid "The implementation works for both **directed** and **undirected** graphs." msgstr "" -msgid "" -"Provides the Depth First Search traversal order from a root vertex or from a " -"set of root vertices." +msgid "Provides the Depth First Search traversal order from a root vertex or from a set of root vertices." msgstr "" -msgid "" -"An optional non-negative maximum depth parameter to limit the results up to " -"a particular depth." +msgid "An optional non-negative maximum depth parameter to limit the results up to a particular depth." msgstr "" -msgid "" -"For optimization purposes, any duplicated values in the `Root vids` are " -"ignored." +msgid "For optimization purposes, any duplicated values in the `Root vids` are ignored." msgstr "" -msgid "" -"It does not produce the shortest path from a root vertex to a target vertex." +msgid "It does not produce the shortest path from a root vertex to a target vertex." msgstr "" msgid "The aggregate cost of traversal is not guaranteed to be minimal." @@ -11563,19 +9857,13 @@ msgstr "" msgid "Same as `Single vertex`_ but with edges in descending order of ``id``." msgstr "" -msgid "" -"`Boost: Depth First Search `__" +msgid "`Boost: Depth First Search `__" msgstr "" -msgid "" -"`Boost: Undirected DFS `__" +msgid "`Boost: Undirected DFS `__" msgstr "" -msgid "" -"`Wikipedia: Depth First Search algorithm `__" +msgid "`Wikipedia: Depth First Search algorithm `__" msgstr "" msgid "``pgr_dijkstra`` — Shortest path using Dijkstra algorithm." @@ -11626,12 +9914,10 @@ msgstr "" msgid "pgr_dijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**" msgstr "" -msgid "" -"The examples of this section are based on the :doc:`sampledata` network." +msgid "The examples of this section are based on the :doc:`sampledata` network." msgstr "" msgid "For **directed** graphs with ``cost`` and ``reverse_cost`` columns" @@ -11673,8 +9959,7 @@ msgstr "" msgid "8) Using `Combinations`_ to get the solution of examples 1 to 3" msgstr "" -msgid "" -"Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" +msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" msgstr "" msgid "For **undirected** graphs with ``cost`` and ``reverse_cost`` columns" @@ -11770,8 +10055,7 @@ msgstr "" msgid "Equvalences between signatures" msgstr "" -msgid "" -"The following examples find the path for :math:`\\{6\\}\\rightarrow\\{10\\}`" +msgid "The following examples find the path for :math:`\\{6\\}\\rightarrow\\{10\\}`" msgstr "" msgid "33) Using `One to One`_" @@ -11789,9 +10073,7 @@ msgstr "" msgid "37) Using `Combinations`_" msgstr "" -msgid "" -"`Boost: Dijkstra shortest paths `__" +msgid "`Boost: Dijkstra shortest paths `__" msgstr "" msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" @@ -11800,33 +10082,25 @@ msgstr "" msgid "``pgr_dijkstraCost``" msgstr "" -msgid "" -"``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra " -"algorithm." +msgid "``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra algorithm." msgstr "" msgid "pgr_dijkstraCost(Combinations)" msgstr "" -msgid "" -"The ``pgr_dijkstraCost`` function summarizes of the cost of the shortest " -"path using Dijkstra Algorithm." +msgid "The ``pgr_dijkstraCost`` function summarizes of the cost of the shortest path using Dijkstra Algorithm." msgstr "" -msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" msgid "pgr_dijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" @@ -11835,9 +10109,7 @@ msgstr "" msgid "``pgr_dijkstraCostMatrix``" msgstr "" -msgid "" -"``pgr_dijkstraCostMatrix`` - Calculates a cost matrix using :doc:" -"`pgr_dijkstra`." +msgid "``pgr_dijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_dijkstra`." msgstr "" msgid "Using Dijkstra algorithm, calculate and return a cost matrix." @@ -11849,15 +10121,10 @@ msgstr "" msgid "``pgr_dijkstraNear``" msgstr "" -msgid "" -"``pgr_dijkstraNear`` — Using Dijkstra's algorithm, finds the route that " -"leads to the nearest vertex." +msgid "``pgr_dijkstraNear`` — Using Dijkstra's algorithm, finds the route that leads to the nearest vertex." msgstr "" -msgid "" -"Given a graph, a starting vertex and a set of ending vertices, this function " -"finds the shortest path from the starting vertex to the nearest ending " -"vertex." +msgid "Given a graph, a starting vertex and a set of ending vertices, this function finds the shortest path from the starting vertex to the nearest ending vertex." msgstr "" msgid "Uses Dijkstra algorithm." @@ -11905,16 +10172,13 @@ msgstr "" msgid "Combinations: :math:`drt * |Starting vids|`" msgstr "" -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" msgstr "" -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" msgstr "" -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" msgstr "" msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options B**])" @@ -11926,8 +10190,7 @@ msgstr "" msgid "**options B:** ``[directed, cap, global]``" msgstr "" -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgstr "" msgid "**options:** ``[directed, cap]``" @@ -11939,8 +10202,7 @@ msgstr "" msgid "Using a **directed** graph for car routing." msgstr "" -msgid "" -"The subway stations are on the following vertices :math:`\\{1, 10, 11\\}`" +msgid "The subway stations are on the following vertices :math:`\\{1, 10, 11\\}`" msgstr "" msgid "The defaults used:" @@ -11955,13 +10217,10 @@ msgstr "" msgid "The result shows that station at vertex :math:`11` is the nearest." msgstr "" -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -msgid "" -"Departing on a car from a subway station find the nearest **two** stations " -"to vertex :math:`2`" +msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`2`" msgstr "" msgid "On line `4`: using the positional parameter: `directed` set to ``true``" @@ -11970,13 +10229,10 @@ msgstr "" msgid "In line `5`: using named parameter `cap => 2`" msgstr "" -msgid "" -"The result shows that station at vertex :math:`10` is the nearest and the " -"next best is :math:`11`." +msgid "The result shows that station at vertex :math:`10` is the nearest and the next best is :math:`11`." msgstr "" -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "" msgid "**options:** ``[directed, cap, global]``" @@ -12000,21 +10256,16 @@ msgstr "" msgid "`global => true`" msgstr "" -msgid "" -"For a pedestrian the best connection is to get on/off is at vertex :math:" -"`15` of the first subway line and at vertex :math:`10` of the second subway " -"line." +msgid "For a pedestrian the best connection is to get on/off is at vertex :math:`15` of the first subway line and at vertex :math:`10` of the second subway line." msgstr "" -msgid "" -"Only `one` route is returned because `global` is ``true`` and `cap` is ``1``" +msgid "Only `one` route is returned because `global` is ``true`` and `cap` is ``1``" msgstr "" msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" -msgid "" -"Find the best car connection between all the stations of two subway lines" +msgid "Find the best car connection between all the stations of two subway lines" msgstr "" msgid "The first subway line stations stops are at :math:`\\{1, 10, 11\\}`" @@ -12026,14 +10277,10 @@ msgstr "" msgid "The combinations contents:" msgstr "" -msgid "" -"lines `3~4` sets the start vertices to be from the first subway line and the " -"ending vertices to be from the second subway line" +msgid "lines `3~4` sets the start vertices to be from the first subway line and the ending vertices to be from the second subway line" msgstr "" -msgid "" -"lines `6~7` sets the start vertices to be from the first subway line and the " -"ending vertices to be from the first subway line" +msgid "lines `6~7` sets the start vertices to be from the first subway line and the ending vertices to be from the first subway line" msgstr "" msgid "On line `8`: using the named parameter is `global => false`" @@ -12042,34 +10289,22 @@ msgstr "" msgid "From the results:" msgstr "" -msgid "" -"making a connection from the first subway line :math:`\\{1, 10, 11\\}` to " -"the second :math:`\\{15, 16\\}`:" +msgid "making a connection from the first subway line :math:`\\{1, 10, 11\\}` to the second :math:`\\{15, 16\\}`:" msgstr "" -msgid "" -"The best connections from all the stations from the first line are: :math:" -"`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" +msgid "The best connections from all the stations from the first line are: :math:`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" msgstr "" -msgid "" -"The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` " -"(lines: `11` and `12`)" +msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `11` and `12`)" msgstr "" -msgid "" -"making a connection from the second subway line :math:`\\{15, 16\\}` to the " -"first :math:`\\{1, 10, 11\\}`:" +msgid "making a connection from the second subway line :math:`\\{15, 16\\}` to the first :math:`\\{1, 10, 11\\}`:" msgstr "" -msgid "" -"The best connections from all the stations from the second line are: :math:" -"`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" +msgid "The best connections from all the stations from the second line are: :math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" msgstr "" -msgid "" -"Both are equally good as they have the same cost. (lines: `13` and `14` and " -"lines: `15` and `16`)" +msgid "Both are equally good as they have the same cost. (lines: `13` and `14` and lines: `15` and `16`)" msgstr "" msgid "Dijkstra optional parameters" @@ -12099,60 +10334,40 @@ msgstr "" msgid "``pgr_dijkstraNearCost``" msgstr "" -msgid "" -"``pgr_dijkstraNearCost`` — Using dijkstra algorithm, finds the route that " -"leads to the nearest vertex." +msgid "``pgr_dijkstraNearCost`` — Using dijkstra algorithm, finds the route that leads to the nearest vertex." msgstr "" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options " -"A**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" msgstr "" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options " -"A**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" msgstr "" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options " -"B**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" msgstr "" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" msgstr "" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, " -"[**options**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgstr "" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, " -"[**options**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -msgid "" -"Departing on a car from a subway station find the nearest **two** stations " -"to vertex :math:`6`" +msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`6`" msgstr "" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, " -"[**options**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "" msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" -msgid "" -"The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` " -"(lines: `1`)" +msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `1`)" msgstr "" -msgid "" -"Both are equally good as they have the same cost. (lines: `12` and `13`)" +msgid "Both are equally good as they have the same cost. (lines: `12` and `13`)" msgstr "" msgid "``pgr_dijkstraVia``" @@ -12161,10 +10376,7 @@ msgstr "" msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices." msgstr "" -msgid "" -"Given a list of vertices and a graph, this function is equivalent to finding " -"the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :" -"math:`i < size\\_of(via\\;vertices)`." +msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)`." msgstr "" msgid "Route" @@ -12191,9 +10403,7 @@ msgstr "" msgid "Returns set of |via-result|" msgstr "" -msgid "" -"Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order " -"on an directed graph." +msgid "Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order on an directed graph." msgstr "" msgid "Via optional parameters" @@ -12205,9 +10415,7 @@ msgstr "" msgid "Identifier of a path. Has value **1** for the first path." msgstr "" -msgid "" -"Identifier of the edge used to go from ``node`` to the next node in the path " -"sequence." +msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence." msgstr "" msgid "-1 for the last node of the path." @@ -12219,14 +10427,10 @@ msgstr "" msgid "``route_agg_cost``" msgstr "" -msgid "" -"Total cost from ``start_vid`` of ``seq = 1`` to ``end_vid`` of the current " -"``seq``." +msgid "Total cost from ``start_vid`` of ``seq = 1`` to ``end_vid`` of the current ``seq``." msgstr "" -msgid "" -"All this examples are about the route that visits the vertices :math:`\\{5, " -"7, 1, 8, 15\\}` in that order on a **directed** graph." +msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a **directed** graph." msgstr "" msgid "The main query" @@ -12253,8 +10457,7 @@ msgstr "" msgid ":doc:`dijkstra-family`." msgstr "" -msgid "" -"``pgr_drivingDistance`` - Returns the driving distance from a start node." +msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." msgstr "" msgid "pgr_drivingDistance(Single vertex)" @@ -12284,18 +10487,13 @@ msgstr "" msgid "pgr_drivingDistance(multiple vertices)" msgstr "" -msgid "" -"Using the Dijkstra algorithm, extracts all the nodes that have costs less " -"than or equal to the value ``distance``. The edges extracted will conform to " -"the corresponding spanning tree." +msgid "Using the Dijkstra algorithm, extracts all the nodes that have costs less than or equal to the value ``distance``. The edges extracted will conform to the corresponding spanning tree." msgstr "" -msgid "" -"pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" +msgid "pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" msgstr "" -msgid "" -"pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" +msgid "pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" msgstr "" msgid "**options:** [directed, equicost]" @@ -12310,9 +10508,7 @@ msgstr "" msgid "Multiple Vertices" msgstr "" -msgid "" -"From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` with equi-" -"cost on a directed graph" +msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` with equi-cost on a directed graph" msgstr "" msgid "Driving distance optional parameters" @@ -12321,36 +10517,25 @@ msgstr "" msgid "``equicost``" msgstr "" -msgid "" -"When ``true`` the node will only appear in the closest ``start_vid`` list. " -"Tie brakes are arbitrary." +msgid "When ``true`` the node will only appear in the closest ``start_vid`` list. Tie brakes are arbitrary." msgstr "" -msgid "" -"When ``false`` which resembles several calls using the single vertex " -"signature." +msgid "When ``false`` which resembles several calls using the single vertex signature." msgstr "" msgid "end-before" msgstr "" -msgid "" -"From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` on an " -"undirected graph" +msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` on an undirected graph" msgstr "" msgid "``pgr_edgeColoring`` - Experimental" msgstr "" -msgid "" -"``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free " -"graphs" +msgid "``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free graphs" msgstr "" -msgid "" -"Edge Coloring is an algorithm used for coloring of the edges for the " -"vertices in the graph. It is an assignment of colors to the edges of the " -"graph so that no two adjacent edges have the same color." +msgid "Edge Coloring is an algorithm used for coloring of the edges for the vertices in the graph. It is an assignment of colors to the edges of the graph so that no two adjacent edges have the same color." msgstr "" msgid "The implementation is for **undirected** and **loop-free** graphs" @@ -12362,24 +10547,16 @@ msgstr "" msgid "no self-loops and no parallel edges." msgstr "" -msgid "" -"Provides the color to be assigned to all the edges present in the graph." +msgid "Provides the color to be assigned to all the edges present in the graph." msgstr "" -msgid "" -"At most :math:`\\Delta + 1` colors are used, where :math:`\\Delta` is the " -"degree of the graph." +msgid "At most :math:`\\Delta + 1` colors are used, where :math:`\\Delta` is the degree of the graph." msgstr "" -msgid "" -"This is optimal for some graphs, and by Vizing's theorem it uses at most one " -"color more than the optimal for all others." +msgid "This is optimal for some graphs, and by Vizing's theorem it uses at most one color more than the optimal for all others." msgstr "" -msgid "" -"the chromatic number :math:`x'(G)` (minimum number of colors needed for " -"proper edge coloring of graph) is equal to the degree :math:`\\Delta + 1` of " -"the graph, (:math:`x'(G) = \\Delta`)" +msgid "the chromatic number :math:`x'(G)` (minimum number of colors needed for proper edge coloring of graph) is equal to the degree :math:`\\Delta + 1` of the graph, (:math:`x'(G) = \\Delta`)" msgstr "" msgid "The algorithm tries to assign the least possible color to every edge." @@ -12388,8 +10565,7 @@ msgstr "" msgid "Does not always produce optimal coloring." msgstr "" -msgid "" -"The returned rows are ordered in ascending order of the edge identifier." +msgid "The returned rows are ordered in ascending order of the edge identifier." msgstr "" msgid "Efficient graph coloring is an NP-Hard problem, and therefore:" @@ -12410,26 +10586,19 @@ msgstr "" msgid "Graph coloring of pgRouting :doc:`sampledata`" msgstr "" -msgid "" -"`Boost: Edge Coloring `__" +msgid "`Boost: Edge Coloring `__" msgstr "" -msgid "" -"`Wikipedia: Graph coloring `__" +msgid "`Wikipedia: Graph coloring `__" msgstr "" -msgid "" -"``pgr_edgeDisjointPaths`` — Calculates edge disjoint paths between two " -"groups of vertices." +msgid "``pgr_edgeDisjointPaths`` — Calculates edge disjoint paths between two groups of vertices." msgstr "" msgid "pgr_edgeDisjointPaths(Combinations)" msgstr "" -msgid "" -"Calculates the edge disjoint paths between two groups of vertices. Utilizes " -"underlying maximum flow algorithms to calculate the paths." +msgid "Calculates the edge disjoint paths between two groups of vertices. Utilizes underlying maximum flow algorithms to calculate the paths." msgstr "" msgid "The main characterics are:" @@ -12438,9 +10607,7 @@ msgstr "" msgid "Calculates the edge disjoint paths between any two groups of vertices." msgstr "" -msgid "" -"Returns EMPTY SET when source and destination are the same, or cannot be " -"reached." +msgid "Returns EMPTY SET when source and destination are the same, or cannot be reached." msgstr "" msgid "The graph can be directed or undirected." @@ -12449,34 +10616,22 @@ msgstr "" msgid "Uses :doc:`pgr_boykovKolmogorov` to calculate the paths." msgstr "" -msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, " -"[``directed``])" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vids**, " -"[``directed``])" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vid**, " -"[``directed``])" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid "" -"Using a combinations table, equivalent to calculating result from vertices :" -"math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}` on an undirected " -"graph." +msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}` on an undirected graph." msgstr "" msgid "Manually assigned vertex combinations on an undirected graph." @@ -12485,9 +10640,7 @@ msgstr "" msgid "``pgr_edmondsKarp``" msgstr "" -msgid "" -"``pgr_edmondsKarp`` — Calculates the flow on the graph edges that maximizes " -"the flow from the sources to the targets using Edmonds Karp Algorithm." +msgid "``pgr_edmondsKarp`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Edmonds Karp Algorithm." msgstr "" msgid "pgr_edmondsKarp(Combinations)" @@ -12514,9 +10667,7 @@ msgstr "" msgid "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -msgid "" -"`Boost: Edmonds Karp max flow `__" +msgid "`Boost: Edmonds Karp max flow `__" msgstr "" msgid "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" @@ -12525,36 +10676,22 @@ msgstr "" msgid "``pgr_edwardMoore`` - Experimental" msgstr "" -msgid "" -"``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore algorithm." +msgid "``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore algorithm." msgstr "" -msgid "" -"Edward Moore’s Algorithm is an improvement of the Bellman-Ford Algorithm. It " -"can compute the shortest paths from a single source vertex to all other " -"vertices in a weighted directed graph. The main difference between Edward " -"Moore's Algorithm and Bellman Ford's Algorithm lies in the run time." +msgid "Edward Moore’s Algorithm is an improvement of the Bellman-Ford Algorithm. It can compute the shortest paths from a single source vertex to all other vertices in a weighted directed graph. The main difference between Edward Moore's Algorithm and Bellman Ford's Algorithm lies in the run time." msgstr "" -msgid "" -"The worst-case running time of the algorithm is :math:`O(| V | * | E |)` " -"similar to the time complexity of Bellman-Ford algorithm. However, " -"experiments suggest that this algorithm has an average running time " -"complexity of :math:`O( | E | )` for random graphs. This is significantly " -"faster in terms of computation speed." +msgid "The worst-case running time of the algorithm is :math:`O(| V | * | E |)` similar to the time complexity of Bellman-Ford algorithm. However, experiments suggest that this algorithm has an average running time complexity of :math:`O( | E | )` for random graphs. This is significantly faster in terms of computation speed." msgstr "" -msgid "" -"Thus, the algorithm is at-best, significantly faster than Bellman-Ford " -"algorithm and is at-worst,as good as Bellman-Ford algorithm" +msgid "Thus, the algorithm is at-best, significantly faster than Bellman-Ford algorithm and is at-worst,as good as Bellman-Ford algorithm" msgstr "" msgid "The `agg_cost` the non included values `(v, v)` is :math:`0`" msgstr "" -msgid "" -"For optimization purposes, any duplicated value in the `start vids` or `end " -"vids` are ignored." +msgid "For optimization purposes, any duplicated value in the `start vids` or `end vids` are ignored." msgstr "" msgid "Running time:" @@ -12566,20 +10703,16 @@ msgstr "" msgid "Average case: :math:`O( | E | )`" msgstr "" -msgid "" -"pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "" -"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" msgid "pgr_edwardMoore(`Edges SQL`_, `Combinations SQL`_, [``directed``])" @@ -12597,14 +10730,10 @@ msgstr "" msgid "``pgr_extractVertices`` — Extracts the vertices information" msgstr "" -msgid "" -"This is an auxiliary function for extracting the vertex information of the " -"set of edges of a graph." +msgid "This is an auxiliary function for extracting the vertex information of the set of edges of a graph." msgstr "" -msgid "" -"When the edge identifier is given, then it will also calculate the in and " -"out edges" +msgid "When the edge identifier is given, then it will also calculate the in and out edges" msgstr "" msgid "pgr_extractVertices(`Edges SQL`_, [``dryrun``])" @@ -12628,9 +10757,7 @@ msgstr "" msgid "Geometry of the edge." msgstr "" -msgid "" -"This inner query takes precedence over the next two inner query, therefore " -"other columns are ignored when ``geom`` column appears." +msgid "This inner query takes precedence over the next two inner query, therefore other columns are ignored when ``geom`` column appears." msgstr "" msgid "Ignored columns:" @@ -12645,9 +10772,7 @@ msgstr "" msgid "When vertex geometry is known" msgstr "" -msgid "" -"To use this inner query the column ``geom`` should not be part of the set of " -"columns." +msgid "To use this inner query the column ``geom`` should not be part of the set of columns." msgstr "" msgid "``POINT``" @@ -12659,17 +10784,13 @@ msgstr "" msgid "POINT geometry of the ending vertex." msgstr "" -msgid "" -"This inner query takes precedence over the next inner query, therefore other " -"columns are ignored when ``startpoint`` and ``endpoint`` columns appears." +msgid "This inner query takes precedence over the next inner query, therefore other columns are ignored when ``startpoint`` and ``endpoint`` columns appears." msgstr "" msgid "When identifiers of vertices are known" msgstr "" -msgid "" -"To use this inner query the columns ``geom``, ``startpoint`` and " -"``endpoint`` should not be part of the set of columns." +msgid "To use this inner query the columns ``geom``, ``startpoint`` and ``endpoint`` should not be part of the set of columns." msgstr "" msgid "``NULL`` When the ``id`` is not part of the inner query" @@ -12684,9 +10805,7 @@ msgstr "" msgid "Geometry of the point" msgstr "" -msgid "" -"To get the query generated used to get the vertex information, use ``dryrun :" -"= true``." +msgid "To get the query generated used to get the vertex information, use ``dryrun := true``." msgstr "" msgid "Create a routing topology" @@ -12698,8 +10817,7 @@ msgstr "" msgid "Clean up the columns of the routing topology to be created" msgstr "" -msgid "" -"When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, )``" +msgid "When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, )``" msgstr "" msgid "For big edge tables that are been prepared," @@ -12738,29 +10856,22 @@ msgstr "" msgid "``partial`` option is removed." msgstr "" -msgid "" -"``pgr_findCloseEdges`` - An utility function that finds the closest edge to " -"a point geometry." +msgid "``pgr_findCloseEdges`` - An utility function that finds the closest edge to a point geometry." msgstr "" -msgid "" -"The geometries must be in the same coordinate system (have the same SRID)." +msgid "The geometries must be in the same coordinate system (have the same SRID)." msgstr "" -msgid "" -"The code to do the calculations can be obtained for further specific " -"adjustments needed by the application." +msgid "The code to do the calculations can be obtained for further specific adjustments needed by the application." msgstr "" msgid "``EMPTY SET`` is returned on dryrun executions" msgstr "" -msgid "" -"pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" +msgid "pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" msgstr "" -msgid "" -"pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" +msgid "pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" msgstr "" msgid "**options:** ``[cap, dryrun]``" @@ -12811,9 +10922,7 @@ msgstr "" msgid "When ``false`` calculations are performed." msgstr "" -msgid "" -"When ``true`` calculations are not performed and the query to do the " -"calculations is exposed in a PostgreSQL ``NOTICE``." +msgid "When ``true`` calculations are not performed and the query to do the calculations is exposed in a PostgreSQL ``NOTICE``." msgstr "" msgid "``geometry``" @@ -12825,9 +10934,7 @@ msgstr "" msgid "When :math:`cap = 1`, it is the closest edge." msgstr "" -msgid "" -"Value in <0,1> that indicates the relative position from the first end-point " -"of the edge." +msgid "Value in <0,1> that indicates the relative position from the first end-point of the edge." msgstr "" msgid "Value in ``[r, l]`` indicating if the point is:" @@ -12851,9 +10958,7 @@ msgstr "" msgid "Original ``POINT`` geometry." msgstr "" -msgid "" -"``LINESTRING`` geometry that connects the original **point** to the closest " -"point of the edge with identifier ``edge_id``" +msgid "``LINESTRING`` geometry that connects the original **point** to the closest point of the edge with identifier ``edge_id``" msgstr "" msgid "One point in an edge" @@ -12865,9 +10970,7 @@ msgstr "" msgid "``geom`` has the value of the original point." msgstr "" -msgid "" -"The geometry ``edge`` is a line that connects the original point with the " -"edge :math:`sp \\rightarrow ep` edge." +msgid "The geometry ``edge`` is a line that connects the original point with the edge :math:`sp \\rightarrow ep` edge." msgstr "" msgid "The point is located at the left of the edge." @@ -12888,9 +10991,7 @@ msgstr "" msgid "Generates a PostgreSQL ``NOTICE`` with the code used." msgstr "" -msgid "" -"The generated code can be used as a starting base code for additional " -"requirements, like taking into consideration the SRID." +msgid "The generated code can be used as a starting base code for additional requirements, like taking into consideration the SRID." msgstr "" msgid "Many points in an edge" @@ -12899,15 +11000,10 @@ msgstr "" msgid "The green nodes are the **original points**" msgstr "" -msgid "" -"The geometry ``geom``, marked as **g1** and **g2** are the **original " -"points**" +msgid "The geometry ``geom``, marked as **g1** and **g2** are the **original points**" msgstr "" -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." +msgid "The geometry ``edge``, marked as **edge1** and **edge2** is a line that connects the **original point** with the closest point on the :math:`sp \\rightarrow ep` edge." msgstr "" msgid "Many points dry run execution" @@ -12916,8 +11012,7 @@ msgstr "" msgid "Do not process query" msgstr "" -msgid "" -"Generate a PostgreSQL ``NOTICE`` with the code used to calculate all columns" +msgid "Generate a PostgreSQL ``NOTICE`` with the code used to calculate all columns" msgstr "" msgid "Find at most two routes to a given point" @@ -12935,20 +11030,13 @@ msgstr "" msgid "Points of interest" msgstr "" -msgid "" -"Some times the applications work \"on the fly\" starting from a location " -"that is not a vertex in the graph. Those locations, in pgRrouting are called " -"points of interest." +msgid "Some times the applications work \"on the fly\" starting from a location that is not a vertex in the graph. Those locations, in pgRrouting are called points of interest." msgstr "" -msgid "" -"The information needed in the points of interest is ``pid``, ``edge_id``, " -"``side``, ``fraction``." +msgid "The information needed in the points of interest is ``pid``, ``edge_id``, ``side``, ``fraction``." msgstr "" -msgid "" -"On this documentation there will be some 6 fixed points of interest and they " -"will be stored on a table." +msgid "On this documentation there will be some 6 fixed points of interest and they will be stored on a table." msgstr "" msgid "A unique identifier." @@ -12969,9 +11057,7 @@ msgstr "" msgid "The distance between ``geom`` and the segment ``edge_id``." msgstr "" -msgid "" -"A segment that connects the ``geom`` of the point to the closest point on " -"the segment ``edge_id``." +msgid "A segment that connects the ``geom`` of the point to the closest point on the segment ``edge_id``." msgstr "" msgid "``newPoint``" @@ -12989,9 +11075,7 @@ msgstr "" 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." +msgid "Any other additional modification: In this manual, point :math:`6` can be reached from both sides." msgstr "" msgid "The points of interest:" @@ -13000,16 +11084,10 @@ msgstr "" msgid "``pgr_floydWarshall``" msgstr "" -msgid "" -"``pgr_floydWarshall`` - Returns the sum of the costs of the shortest path " -"for each pair of nodes in the graph using Floyd-Warshall algorithm." +msgid "``pgr_floydWarshall`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Floyd-Warshall algorithm." msgstr "" -msgid "" -"The Floyd-Warshall algorithm, also known as Floyd's algorithm, is a good " -"choice to calculate the sum of the costs of the shortest path for each pair " -"of nodes in the graph, for *dense graphs*. We use Boost's implementation " -"which runs in :math:`\\Theta(V^3)` time," +msgid "The Floyd-Warshall algorithm, also known as Floyd's algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *dense graphs*. We use Boost's implementation which runs in :math:`\\Theta(V^3)` time," msgstr "" msgid "pgr_floydWarshall(`Edges SQL`_, [``directed``])" @@ -13018,16 +11096,13 @@ msgstr "" msgid "For a directed subgraph with edges :math:`\\{1, 2, 3, 4\\}`." msgstr "" -msgid "" -"Boost `Floyd-Warshall `_" +msgid "Boost `Floyd-Warshall `_" msgstr "" msgid "``pgr_full_version``" msgstr "" -msgid "" -"``pgr_full_version`` — Get the details of pgRouting version information." +msgid "``pgr_full_version`` — Get the details of pgRouting version information." msgstr "" msgid "Get complete details of pgRouting version information" @@ -13099,27 +11174,13 @@ msgstr "" msgid "``pgr_hawickCircuits`` - Experimental" msgstr "" -msgid "" -"``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits " -"algorithm." +msgid "``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits algorithm." msgstr "" -msgid "" -"Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. " -"James. This algorithm solves the problem of detecting and enumerating " -"circuits in graphs. It is capable of circuit enumeration in graphs with " -"directed-arcs, multiple-arcs and self-arcs with a memory efficient and high-" -"performance im-plementation. It is an extension of Johnson's Algorithm of " -"finding all the elementary circuits of a directed graph." +msgid "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. James. This algorithm solves the problem of detecting and enumerating circuits in graphs. It is capable of circuit enumeration in graphs with directed-arcs, multiple-arcs and self-arcs with a memory efficient and high-performance im-plementation. It is an extension of Johnson's Algorithm of finding all the elementary circuits of a directed graph." msgstr "" -msgid "" -"There are 2 variations defined in the Boost Graph Library. Here, we have " -"implemented only 2nd as it serves the most suitable and practical usecase. " -"In this variation we get the circuits after filtering out the circuits " -"caused by parallel edges. Parallel edge circuits have more use cases when " -"you want to count the no. of circuits.Maybe in future, we will also " -"implemenent this variation." +msgid "There are 2 variations defined in the Boost Graph Library. Here, we have implemented only 2nd as it serves the most suitable and practical usecase. In this variation we get the circuits after filtering out the circuits caused by parallel edges. Parallel edge circuits have more use cases when you want to count the no. of circuits.Maybe in future, we will also implemenent this variation." msgstr "" msgid "The algorithm implementation works only for directed graph" @@ -13146,8 +11207,7 @@ msgstr "" msgid "Id of the circuit starting from ``1``" msgstr "" -msgid "" -"Relative position in the path. Has value ``0`` for beginning of the path" +msgid "Relative position in the path. Has value ``0`` for beginning of the path" msgstr "" msgid "Identifier of the starting vertex of the circuit." @@ -13159,32 +11219,22 @@ msgstr "" msgid "Identifier of the node in the path from a vid to next vid." msgstr "" -msgid "" -"`Boost: Hawick Circuit Algorithm `__" +msgid "`Boost: Hawick Circuit Algorithm `__" msgstr "" msgid "``pgr_isPlanar`` - Experimental" msgstr "" -msgid "" -"``pgr_isPlanar`` — Returns a boolean depending upon the planarity of the " -"graph." +msgid "``pgr_isPlanar`` — Returns a boolean depending upon the planarity of the graph." msgstr "" -msgid "" -"A graph is planar if it can be drawn in two-dimensional space with no two of " -"its edges crossing. Such a drawing of a planar graph is called a plane " -"drawing. Every planar graph also admits a straight-line drawing, which is a " -"plane drawing where each edge is represented by a line segment. When a graph " -"has :math:`K_5` or :math:`K_{3, 3}` as subgraph then the graph is not planar." +msgid "A graph is planar if it can be drawn in two-dimensional space with no two of its edges crossing. Such a drawing of a planar graph is called a plane drawing. Every planar graph also admits a straight-line drawing, which is a plane drawing where each edge is represented by a line segment. When a graph has :math:`K_5` or :math:`K_{3, 3}` as subgraph then the graph is not planar." msgstr "" msgid "This implementation use the Boyer-Myrvold Planarity Testing." msgstr "" -msgid "" -"It will return a boolean value depending upon the planarity of the graph." +msgid "It will return a boolean value depending upon the planarity of the graph." msgstr "" msgid "Applicable only for **undirected** graphs." @@ -13214,71 +11264,46 @@ msgstr "" msgid "`false` when the graph is not planar." msgstr "" -msgid "" -"The following edges will make the subgraph with vertices {10, 15, 11, 16, " -"13} a :math:`K_1` graph." +msgid "The following edges will make the subgraph with vertices {10, 15, 11, 16, 13} a :math:`K_1` graph." msgstr "" -msgid "" -"The new graph is not planar because it has a :math:`K_5` subgraph. Edges in " -"blue represent :math:`K_5` subgraph." +msgid "The new graph is not planar because it has a :math:`K_5` subgraph. Edges in blue represent :math:`K_5` subgraph." msgstr "" -msgid "" -"`Boost: Boyer Myrvold `__" +msgid "`Boost: Boyer Myrvold `__" msgstr "" msgid "``pgr_johnson``" msgstr "" -msgid "" -"``pgr_johnson`` - Returns the sum of the costs of the shortest path for each " -"pair of nodes in the graph using Johnson algorithm." +msgid "``pgr_johnson`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Johnson algorithm." msgstr "" -msgid "" -"The Johnson algorithm, is a good choice to calculate the sum of the costs of " -"the shortest path for each pair of nodes in the graph, for *sparse graphs*. " -"It uses the Boost's implementation which runs in :math:`O(V E \\log V)` time," +msgid "The Johnson algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *sparse graphs*. It uses the Boost's implementation which runs in :math:`O(V E \\log V)` time," msgstr "" msgid "pgr johnson(`Edges SQL`_, [``directed``])" msgstr "" -msgid "" -"Boost `Johnson `_" +msgid "Boost `Johnson `_" msgstr "" msgid "``pgr_kingOrdering`` - Experimental" msgstr "" -msgid "" -"``pgr_kingOrdering`` — Returns the King ordering of an undirected graph." +msgid "``pgr_kingOrdering`` — Returns the King ordering of an undirected graph." msgstr "" -msgid "" -"In numerical linear algebra and graph theory, the King ordering algorithm is " -"a heuristic designed to reorder the vertices of a graph so as to reduce its " -"bandwidth." +msgid "In numerical linear algebra and graph theory, the King ordering algorithm is a heuristic designed to reorder the vertices of a graph so as to reduce its bandwidth." msgstr "" -msgid "" -"The method follows a breadth-first search (BFS) traversal, but with a " -"refinement: at each step, the unvisited neighbors of the current vertex are " -"inserted into the queue in ascending order of their pseudo-degree, where the " -"pseudo-degree of a vertex is the number of edges connecting it to yet-" -"unvisited vertices. This prioritization often yields a smaller bandwidth " -"compared to simpler BFS orderings." +msgid "The method follows a breadth-first search (BFS) traversal, but with a refinement: at each step, the unvisited neighbors of the current vertex are inserted into the queue in ascending order of their pseudo-degree, where the pseudo-degree of a vertex is the number of edges connecting it to yet-unvisited vertices. This prioritization often yields a smaller bandwidth compared to simpler BFS orderings." msgstr "" msgid "The implementation targets undirected graphs." msgstr "" -msgid "" -"Bandwidth minimization is an NP-complete problem; King ordering provides a " -"practical local minimization approach." +msgid "Bandwidth minimization is an NP-complete problem; King ordering provides a practical local minimization approach." msgstr "" msgid "The time complexity is: :math:`O(m^2 \\log(m)|E|)`" @@ -13293,21 +11318,16 @@ msgstr "" msgid "pgr_kingOrdering(`Edges SQL`_)" msgstr "" -msgid "" -"`Boost: King Ordering `__" +msgid "`Boost: King Ordering `__" msgstr "" msgid "``pgr_kruskal``" msgstr "" -msgid "" -"``pgr_kruskal`` — Minimum spanning tree of a graph using Kruskal's algorithm." +msgid "``pgr_kruskal`` — Minimum spanning tree of a graph using Kruskal's algorithm." msgstr "" -msgid "" -"This algorithm finds the minimum spanning forest in a possibly disconnected " -"graph using Kruskal's algorithm." +msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Kruskal's algorithm." msgstr "" msgid "EMPTY SET is returned when there are no edges in the graph." @@ -13322,17 +11342,13 @@ msgstr "" msgid "Minimum spanning forest" msgstr "" -msgid "" -"``pgr_kruskalBFS`` — Kruskal's algorithm for Minimum Spanning Tree with " -"breadth First Search ordering." +msgid "``pgr_kruskalBFS`` — Kruskal's algorithm for Minimum Spanning Tree with breadth First Search ordering." msgstr "" msgid "Added ``pred`` result columns." msgstr "" -msgid "" -"Visits and extracts the nodes information in Breath First Search ordering of " -"the Minimum Spanning Tree created using Kruskal's algorithm." +msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." msgstr "" msgid "Returned tree nodes from a root vertex are on Breath First Search order" @@ -13350,18 +11366,13 @@ msgstr "" msgid "The Minimum Spanning Tree having as root vertex :math:`6`" msgstr "" -msgid "" -"The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:" -"`depth \\leq 3`" +msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`depth \\leq 3`" msgstr "" msgid "``pgr_kruskalDD`` — Catchament nodes using Kruskal's algorithm." msgstr "" -msgid "" -"Using Kruskal's algorithm, extracts the nodes that have aggregate costs less " -"than or equal to a **distance** from a **root** vertex (or vertices) within " -"the calculated minimum spanning tree." +msgid "Using Kruskal's algorithm, extracts the nodes that have aggregate costs less than or equal to a **distance** from a **root** vertex (or vertices) within the calculated minimum spanning tree." msgstr "" msgid "Returned tree nodes from a root vertex are on Depth First Search order." @@ -13376,24 +11387,16 @@ msgstr "" msgid "pgr_kruskalDD(`Edges SQL`_, **root vids**, **distance**)" msgstr "" -msgid "" -"The Minimum Spanning Tree starting on vertex :math:`6` with :math:`distance " -"\\leq 3.5`" +msgid "The Minimum Spanning Tree starting on vertex :math:`6` with :math:`distance \\leq 3.5`" msgstr "" -msgid "" -"The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:" -"`distance \\leq 3.5`" +msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`distance \\leq 3.5`" msgstr "" -msgid "" -"``pgr_kruskalDFS`` — Kruskal's algorithm for Minimum Spanning Tree with " -"Depth First Search ordering." +msgid "``pgr_kruskalDFS`` — Kruskal's algorithm for Minimum Spanning Tree with Depth First Search ordering." msgstr "" -msgid "" -"Visits and extracts the nodes information in Depth First Search ordering of " -"the Minimum Spanning Tree created using Kruskal's algorithm." +msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." msgstr "" msgid "Returned tree nodes from a root vertex are on Depth First Search order" @@ -13408,15 +11411,10 @@ msgstr "" msgid "``pgr_lengauerTarjanDominatorTree`` - Experimental" msgstr "" -msgid "" -"``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all " -"vertices." +msgid "``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all vertices." msgstr "" -msgid "" -"The algorithm calculates the *immediate dominator* of each vertex called " -"**idom**, once **idom** of each vertex is calculated then by making every " -"**idom** of each vertex as its parent, the dominator tree can be built." +msgid "The algorithm calculates the *immediate dominator* of each vertex called **idom**, once **idom** of each vertex is calculated then by making every **idom** of each vertex as its parent, the dominator tree can be built." msgstr "" msgid "The algorithm works in directed graph only." @@ -13425,8 +11423,7 @@ msgstr "" msgid "The algorithm returns *idom* of each vertex." msgstr "" -msgid "" -"If the *root vertex* not present in the graph then it returns empty set." +msgid "If the *root vertex* not present in the graph then it returns empty set." msgstr "" msgid "Running time: :math:`O((V+E)log(V+E))`" @@ -13465,50 +11462,37 @@ msgstr "" msgid "Dominator tree of another component." msgstr "" -msgid "" -"`Boost: Lengauer-Tarjan dominator `__" +msgid "`Boost: Lengauer-Tarjan dominator `__" msgstr "" -msgid "" -"`Wikipedia: dominator tree `__" +msgid "`Wikipedia: dominator tree `__" msgstr "" msgid "``pgr_lineGraph`` - Proposed" msgstr "" -msgid "" -"``pgr_lineGraph`` — Transforms the given graph into its corresponding edge-" -"based graph." +msgid "``pgr_lineGraph`` — Transforms the given graph into its corresponding edge-based graph." msgstr "" 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:" +msgid "Given a graph :math:`G`, its line graph :math:`L(G)` is a graph such that:" msgstr "" msgid "Each vertex of :math:`L(G)` represents an edge of :math:`G`." msgstr "" -msgid "" -"Two vertices of :math:`L(G)` are adjacent if and only if their corresponding " -"edges share a common endpoint in :math:`G`" +msgid "Two vertices of :math:`L(G)` are adjacent if and only if their corresponding edges share a common endpoint in :math:`G`" msgstr "" -msgid "" -"The ``cost`` and ``reverse_cost`` columns of the result represent existence " -"of the edge." +msgid "The ``cost`` and ``reverse_cost`` columns of the result represent existence of the edge." msgstr "" msgid "When the graph is directed the result is directed." msgstr "" -msgid "" -"To get the complete Line Graph use unique identifiers on the double way " -"edges (See `Additional Examples`_)." +msgid "To get the complete Line Graph use unique identifiers on the double way edges (See `Additional Examples`_)." msgstr "" msgid "When the graph is undirected the result is undirected." @@ -13538,34 +11522,25 @@ msgstr "" msgid "Weight of the edge (``source``, ``target``)." msgstr "" -msgid "" -"When `negative`: edge (``source``, ``target``) does not exist, therefore " -"it’s not part of the graph." +msgid "When `negative`: edge (``source``, ``target``) does not exist, therefore it’s not part of the graph." msgstr "" msgid "Weight of the edge (``target``, ``source``)." msgstr "" -msgid "" -"When `negative`: edge (``target``, ``source``) does not exist, therefore " -"it’s not part of the graph." +msgid "When `negative`: edge (``target``, ``source``) does not exist, therefore it’s not part of the graph." msgstr "" msgid "Given the following directed graph" 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\\})`" +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 "" msgid "Representation as directed with shared edge identifiers" msgstr "" -msgid "" -"For the simplicity, the design of the edges table on the database, has the " -"edge's identifiers are represented with 3 digits:" +msgid "For the simplicity, the design of the edges table on the database, has the edge's identifiers are represented with 3 digits:" msgstr "" msgid "hundreds" @@ -13589,26 +11564,19 @@ msgstr "" msgid "In this image," msgstr "" -msgid "" -"Single or double head arrows represent one edge (row) on the edges table." +msgid "Single or double head arrows represent one edge (row) on the edges table." msgstr "" msgid "The numbers in the yellow shadow are the edge identifiers." msgstr "" -msgid "" -"Two pair of edges share the same identifier when the ``reverse_cost`` column " -"is used." +msgid "Two pair of edges share the same identifier when the ``reverse_cost`` column is used." msgstr "" -msgid "" -"Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with one " -"edge row with :math:`id=203`." +msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with one edge row with :math:`id=203`." msgstr "" -msgid "" -"Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with one " -"edge row with :math:`id=304`." +msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with one edge row with :math:`id=304`." msgstr "" msgid "The graph can be created as follows:" @@ -13620,15 +11588,13 @@ msgstr "" msgid "The result is a directed graph." msgstr "" -msgid "" -"For :math:`seq=4` from :math:`203 \\leftrightarrow 304` represent two edges" +msgid "For :math:`seq=4` from :math:`203 \\leftrightarrow 304` represent two edges" msgstr "" msgid "For all the other values of ``seq`` represent one edge." msgstr "" -msgid "" -"The ``cost`` and ``reverse_cost`` values represent the existence of the edge." +msgid "The ``cost`` and ``reverse_cost`` values represent the existence of the edge." msgstr "" msgid "When positive: the edge exists." @@ -13646,85 +11612,61 @@ msgstr "" msgid "There are no double head arrows" msgstr "" -msgid "" -"Two pair of edges share the same ending nodes and the ``reverse_cost`` " -"column is not used." +msgid "Two pair of edges share the same ending nodes and the ``reverse_cost`` column is not used." msgstr "" -msgid "" -"Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with two " -"edges :math:`id=203` and :math:`id=302` respectively." +msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with two edges :math:`id=203` and :math:`id=302` respectively." msgstr "" -msgid "" -"Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with two " -"edges :math:`id=304` and :math:`id=403` respectively." +msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with two edges :math:`id=304` and :math:`id=403` respectively." msgstr "" msgid "Line Graph of a directed graph represented with unique edges" msgstr "" -msgid "" -"For :math:`seq=7` from :math:`203 \\leftrightarrow 302` represent two edges." +msgid "For :math:`seq=7` from :math:`203 \\leftrightarrow 302` represent two edges." msgstr "" -msgid "" -"For :math:`seq=8` from :math:`304 \\leftrightarrow 403` represent two edges." +msgid "For :math:`seq=8` from :math:`304 \\leftrightarrow 403` represent two edges." msgstr "" msgid "wikipedia: `Line Graph `__" msgstr "" -msgid "" -"mathworld: `Line Graph `__" +msgid "mathworld: `Line Graph `__" msgstr "" msgid "``pgr_lineGraphFull`` - Experimental" msgstr "" -msgid "" -"``pgr_lineGraphFull`` — Transforms a given graph into a new graph where all " -"of the vertices from the original graph are converted to line graphs." +msgid "``pgr_lineGraphFull`` — Transforms a given graph into a new graph where all of the vertices from the original graph are converted to line graphs." msgstr "" msgid "Version 2.6.0" msgstr "" -msgid "" -"``pgr_lineGraphFull``, converts original directed graph to a directed line " -"graph by converting each vertex to a complete graph and keeping all the " -"original edges. The new connecting edges have a cost 0 and go between the " -"adjacent original edges, respecting the directionality." +msgid "``pgr_lineGraphFull``, converts original directed graph to a directed line graph by converting each vertex to a complete graph and keeping all the original edges. The new connecting edges have a cost 0 and go between the adjacent original edges, respecting the directionality." msgstr "" -msgid "" -"A possible application of the resulting graph is **\"routing with two edge " -"restrictions\"**:" +msgid "A possible application of the resulting graph is **\"routing with two edge restrictions\"**:" msgstr "" -msgid "" -"Setting a cost of using the vertex when routing between edges on the " -"connecting edge" +msgid "Setting a cost of using the vertex when routing between edges on the connecting edge" msgstr "" msgid "Forbid the routing between two edges by removing the connecting edge" msgstr "" -msgid "" -"This is possible because each of the intersections (vertices) in the " -"original graph are now complete graphs that have a new edge for each " -"possible turn across that intersection." +msgid "This is possible because each of the intersections (vertices) in the original graph are now complete graphs that have a new edge for each possible turn across that intersection." msgstr "" msgid "This function is for **directed** graphs." msgstr "" -msgid "" -"Results are undefined when a negative vertex id is used in the input graph." +msgid "Results are undefined when a negative vertex id is used in the input graph." msgstr "" -msgid "" -"Results are undefined when a duplicated edge id is used in the input graph." +msgid "Results are undefined when a duplicated edge id is used in the input graph." msgstr "" msgid "Running time: TBD" @@ -13739,17 +11681,13 @@ msgstr "" msgid "Full line graph of subgraph of edges :math:`\\{4, 7, 8, 10\\}`" msgstr "" -msgid "" -"The examples include the subgraph including edges 4, 7, 8, and 10 with " -"``reverse_cost``." +msgid "The examples include the subgraph including edges 4, 7, 8, and 10 with ``reverse_cost``." msgstr "" msgid "The data" msgstr "" -msgid "" -"This example displays how this graph transformation works to create " -"additional edges for each possible turn in a graph." +msgid "This example displays how this graph transformation works to create additional edges for each possible turn in a graph." msgstr "" msgid "|first|" @@ -13767,36 +11705,22 @@ msgstr "" msgid "second" msgstr "" -msgid "" -"In the transformed graph, all of the edges from the original graph are still " -"present (yellow), but we now have additional edges for every turn that could " -"be made across vertex 7 (orange)." +msgid "In the transformed graph, all of the edges from the original graph are still present (yellow), but we now have additional edges for every turn that could be made across vertex 7 (orange)." msgstr "" msgid "Creating table that identifies transformed vertices" msgstr "" -msgid "" -"The vertices in the transformed graph are each created by splitting up the " -"vertices in the original graph. Unless a vertex in the original graph is a " -"leaf vertex, it will generate more than one vertex in the transformed graph. " -"One of the newly created vertices in the transformed graph will be given the " -"same vertex identifier as the vertex that it was created from in the " -"original graph, but the rest of the newly created vertices will have " -"negative vertex ids." +msgid "The vertices in the transformed graph are each created by splitting up the vertices in the original graph. Unless a vertex in the original graph is a leaf vertex, it will generate more than one vertex in the transformed graph. One of the newly created vertices in the transformed graph will be given the same vertex identifier as the vertex that it was created from in the original graph, but the rest of the newly created vertices will have negative vertex ids." msgstr "" -msgid "" -"Following is an example of how to generate a table that maps the ids of the " -"newly created vertices with the original vertex that they were created from" +msgid "Following is an example of how to generate a table that maps the ids of the newly created vertices with the original vertex that they were created from" msgstr "" msgid "Store edge results" msgstr "" -msgid "" -"The first step is to store the results of the ``pgr_lineGraphFull`` call " -"into a table" +msgid "The first step is to store the results of the ``pgr_lineGraphFull`` call into a table" msgstr "" msgid "Create the mapping table" @@ -13817,9 +11741,7 @@ msgstr "" msgid "Inspecting the vertices map" msgstr "" -msgid "" -"The self loops happen when there is no cost traveling to the ``target`` and " -"the source has an original value." +msgid "The self loops happen when there is no cost traveling to the ``target`` and the source has an original value." msgstr "" msgid "Updating values from self loops" @@ -13834,22 +11756,16 @@ msgstr "" msgid "Adding a soft restriction" msgstr "" -msgid "" -"A soft restriction going from vertex 6 to vertex 3 using edges 4 -> 7 is " -"wanted." +msgid "A soft restriction going from vertex 6 to vertex 3 using edges 4 -> 7 is wanted." msgstr "" msgid "Identifying the restriction" msgstr "" -msgid "" -"Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where the " -"cost will be increased" +msgid "Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where the cost will be increased" msgstr "" -msgid "" -"The edge to be altered is ``WHERE cost = 0 AND seq != 1 AND edge != -1`` " -"from the previous query:" +msgid "The edge to be altered is ``WHERE cost = 0 AND seq != 1 AND edge != -1`` from the previous query:" msgstr "" msgid "Adding a value to the restriction" @@ -13867,8 +11783,7 @@ msgstr "" msgid "Simplifying leaf vertices" msgstr "" -msgid "" -"In this example, there is no additional cost for traversing a leaf vertex." +msgid "In this example, there is no additional cost for traversing a leaf vertex." msgstr "" msgid "Using the vertex map give the leaf verices their original value." @@ -13889,9 +11804,7 @@ msgstr "" msgid "Which can be removed" msgstr "" -msgid "" -"Routing can be done now using the original vertices id using :doc:" -"`pgr_dijkstra`" +msgid "Routing can be done now using the original vertices id using :doc:`pgr_dijkstra`" msgstr "" msgid "Complete routing graph" @@ -13900,9 +11813,7 @@ msgstr "" msgid "Add edges from the original graph" msgstr "" -msgid "" -"Add all the edges that are not involved in the line graph process to the new " -"table" +msgid "Add all the edges that are not involved in the line graph process to the new table" msgstr "" msgid "Some administrative tasks to get new identifiers for the edges" @@ -13914,9 +11825,7 @@ msgstr "" msgid "Using the routing graph" msgstr "" -msgid "" -"When using this method for routing with soft restrictions there will be " -"uturns" +msgid "When using this method for routing with soft restrictions there will be uturns" msgstr "" msgid "Routing from :math:`5` to :math:`1`" @@ -13934,23 +11843,13 @@ msgstr "" msgid "``pgr_makeConnected`` — Set of edges that will connect the graph." msgstr "" -msgid "" -"Adds the minimum number of edges needed to make the input graph connected. " -"The algorithm first identifies all of the connected components in the graph, " -"then adds edges to connect those components together in a path. For example, " -"if a graph contains three connected components A, B, and C, make_connected " -"will add two edges. The two edges added might consist of one connecting a " -"vertex in A with a vertex in B and one connecting a vertex in B with a " -"vertex in C." +msgid "Adds the minimum number of edges needed to make the input graph connected. The algorithm first identifies all of the connected components in the graph, then adds edges to connect those components together in a path. For example, if a graph contains three connected components A, B, and C, make_connected will add two edges. The two edges added might consist of one connecting a vertex in A with a vertex in B and one connecting a vertex in B with a vertex in C." msgstr "" -msgid "" -"It will give a minimum list of all edges which are needed in the graph to " -"make connect it." +msgid "It will give a minimum list of all edges which are needed in the graph to make connect it." msgstr "" -msgid "" -"The algorithm does not considers geometric topology in the calculations." +msgid "The algorithm does not considers geometric topology in the calculations." msgstr "" msgid "pgr_makeConnected(`Edges SQL`_)" @@ -13962,17 +11861,13 @@ msgstr "" msgid "List of edges that are needed to connect the graph." msgstr "" -msgid "" -"`Boost: make connected `__" +msgid "`Boost: make connected `__" msgstr "" msgid "``pgr_maxCardinalityMatch``" msgstr "" -msgid "" -"``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a " -"graph." +msgid "``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a graph." msgstr "" msgid "pgr_maxCardinalityMatch(text) returns only ``edge`` column." @@ -13987,14 +11882,10 @@ msgstr "" msgid "Renamed from ``pgr_maximumCardinalityMatching``" msgstr "" -msgid "" -"A matching or independent edge set in a graph is a set of edges without " -"common vertices." +msgid "A matching or independent edge set in a graph is a set of edges without common vertices." msgstr "" -msgid "" -"A maximum matching is a matching that contains the largest possible number " -"of edges." +msgid "A maximum matching is a matching that contains the largest possible number of edges." msgstr "" msgid "There may be many maximum matchings." @@ -14015,26 +11906,19 @@ msgstr "" msgid "Using all edges." msgstr "" -msgid "" -"SQL query, which should return a set of rows with the following columns:" +msgid "SQL query, which should return a set of rows with the following columns:" msgstr "" -msgid "" -"A positive value represents the existence of the edge (``source``, " -"``target``)." +msgid "A positive value represents the existence of the edge (``source``, ``target``)." msgstr "" -msgid "" -"A positive value represents the existence of the edge (``target``, " -"``source``)" +msgid "A positive value represents the existence of the edge (``target``, ``source``)" msgstr "" msgid "Identifier of the edge in the original query." msgstr "" -msgid "" -"`Boost: maximum_matching `__" +msgid "`Boost: maximum_matching `__" msgstr "" msgid "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" @@ -14046,9 +11930,7 @@ msgstr "" msgid "``pgr_maxFlow``" msgstr "" -msgid "" -"``pgr_maxFlow`` — Calculates the maximum flow in a directed graph from the " -"source(s) to the targets(s) using the Push Relabel algorithm." +msgid "``pgr_maxFlow`` — Calculates the maximum flow in a directed graph from the source(s) to the targets(s) using the Push Relabel algorithm." msgstr "" msgid "pgr_maxFlow(Combinations)" @@ -14057,8 +11939,7 @@ msgstr "" msgid "Calculates the maximum flow from the sources to the targets." msgstr "" -msgid "" -"When the maximum flow is **0** then there is no flow and **0** is returned." +msgid "When the maximum flow is **0** then there is no flow and **0** is returned." msgstr "" msgid "Uses the :doc:`pgr_pushRelabel ` algorithm." @@ -14088,21 +11969,16 @@ msgstr "" msgid "Maximum flow possible from the source(s) to the target(s)" msgstr "" -msgid "" -"`Boost: push relabel max flow `__" +msgid "`Boost: push relabel max flow `__" msgstr "" -msgid "" -"https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" +msgid "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" msgstr "" msgid "``pgr_maxFlowMinCost`` - Experimental" msgstr "" -msgid "" -"``pgr_maxFlowMinCost`` — Calculates the edges that minimizes the total cost " -"of the maximum flow on a graph" +msgid "``pgr_maxFlowMinCost`` — Calculates the edges that minimizes the total cost of the maximum flow on a graph" msgstr "" msgid "pgr_maxFlowMinCost(Combinations)" @@ -14129,9 +12005,7 @@ msgstr "" msgid "where :math:`U` is the value of the max flow." msgstr "" -msgid "" -":math:`U` is upper bound on number of iterations. In many real world cases " -"number of iterations is much smaller than :math:`U`." +msgid ":math:`U` is upper bound on number of iterations. In many real world cases number of iterations is much smaller than :math:`U`." msgstr "" msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vid**)" @@ -14155,9 +12029,7 @@ msgstr "" msgid "``pgr_maxFlowMinCost_Cost`` - Experimental" msgstr "" -msgid "" -"``pgr_maxFlowMinCost_Cost`` — Calculates the minimum total cost of the " -"maximum flow on a graph" +msgid "``pgr_maxFlowMinCost_Cost`` — Calculates the minimum total cost of the maximum flow on a graph" msgstr "" msgid "pgr_maxFlowMinCost_Cost(Combinations)" @@ -14199,9 +12071,7 @@ msgstr "" msgid "``pgr_pickDeliver`` - Pickup and delivery Vehicle Routing Problem" msgstr "" -msgid "" -"Problem: Distribute and optimize the pickup-delivery pairs into a fleet of " -"vehicles." +msgid "Problem: Distribute and optimize the pickup-delivery pairs into a fleet of vehicles." msgstr "" msgid "Optimization problem is NP-hard." @@ -14258,16 +12128,13 @@ msgstr "" msgid "The speed, max_cycles, ma_capacity have illegal values" msgstr "" -msgid "" -"Six different initial will be optimized - the best solution found will be " -"result" +msgid "Six different initial will be optimized - the best solution found will be result" msgstr "" msgid "Signature" msgstr "" -msgid "" -"pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" +msgid "pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" msgstr "" msgid "**options:** ``[factor, max_cycles, initial_sol]``" @@ -14312,8 +12179,7 @@ msgstr "" msgid "``pgr_pickDeliverEuclidean`` - Experimental" msgstr "" -msgid "" -"``pgr_pickDeliverEuclidean`` - Pickup and delivery Vehicle Routing Problem" +msgid "``pgr_pickDeliverEuclidean`` - Pickup and delivery Vehicle Routing Problem" msgstr "" msgid "Replaces ``pgr_gsoc_vrppdtw``" @@ -14367,9 +12233,7 @@ msgstr "" msgid "[ end_x, end_y, end_open, end_close, end_service ]" msgstr "" -msgid "" -"This data example **lc101** is from data published at https://www.sintef.no/" -"projectweb/top/pdptw/li-lim-benchmark/" +msgid "This data example **lc101** is from data published at https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/" msgstr "" msgid "There are 25 vehicles in the problem all with the same characteristics." @@ -14378,9 +12242,7 @@ msgstr "" msgid "The original orders" msgstr "" -msgid "" -"The data comes in different rows for the pickup and the delivery of the same " -"order." +msgid "The data comes in different rows for the pickup and the delivery of the same order." msgstr "" msgid "The original data needs to be converted to an appropriate table:" @@ -14389,10 +12251,7 @@ msgstr "" msgid "The query" msgstr "" -msgid "" -"Showing only the relevant information to compare with the best solution " -"information published on https://www.sintef.no/projectweb/top/pdptw/100-" -"customers/" +msgid "Showing only the relevant information to compare with the best solution information published on https://www.sintef.no/projectweb/top/pdptw/100-customers/" msgstr "" msgid "The best solution found for **lc101** is a travel time: 828.94" @@ -14404,13 +12263,10 @@ msgstr "" msgid "``pgr_prim``" msgstr "" -msgid "" -"``pgr_prim`` — Minimum spanning forest of a graph using Prim's algorithm." +msgid "``pgr_prim`` — Minimum spanning forest of a graph using Prim's algorithm." msgstr "" -msgid "" -"This algorithm finds the minimum spanning forest in a possibly disconnected " -"graph using Prim's algorithm." +msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Prim's algorithm." msgstr "" msgid "Prim's running time: :math:`O(E * log V)`" @@ -14422,19 +12278,13 @@ msgstr "" msgid "Minimum spanning forest of a subgraph" msgstr "" -msgid "" -"`Boost: Prim's algorithm documentation `__" +msgid "`Boost: Prim's algorithm documentation `__" msgstr "" -msgid "" -"``pgr_primBFS`` — Prim's algorithm for Minimum Spanning Tree with Depth " -"First Search ordering." +msgid "``pgr_primBFS`` — Prim's algorithm for Minimum Spanning Tree with Depth First Search ordering." msgstr "" -msgid "" -"Visits and extracts the nodes information in Breath First Search ordering of " -"the Minimum Spanning Tree created using Prims's algorithm." +msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." msgstr "" msgid "pgr_primBFS(`Edges SQL`_, **root vid**, [``max_depth``])" @@ -14446,10 +12296,7 @@ msgstr "" msgid "``pgr_primDD`` — Catchament nodes using Prim's algorithm." msgstr "" -msgid "" -"Using Prim's algorithm, extracts the nodes that have aggregate costs less " -"than or equal to a distance from a root vertex (or vertices) within the " -"calculated minimum spanning tree." +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 "" msgid "pgr_primDD(`Edges SQL`_, **root vid**, **distance**)" @@ -14458,14 +12305,10 @@ msgstr "" msgid "pgr_primDD(`Edges SQL`_, **root vids**, **distance**)" msgstr "" -msgid "" -"``pgr_primDFS`` — Prim algorithm for Minimum Spanning Tree with Depth First " -"Search ordering." +msgid "``pgr_primDFS`` — Prim algorithm for Minimum Spanning Tree with Depth First Search ordering." msgstr "" -msgid "" -"Visits and extracts the nodes information in Depth First Search ordering of " -"the Minimum Spanning Tree created using Prims's algorithm." +msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." msgstr "" msgid "pgr_primDFS(`Edges SQL`_, **root vid**, [``max_depth``])" @@ -14477,9 +12320,7 @@ msgstr "" msgid "``pgr_pushRelabel``" msgstr "" -msgid "" -"``pgr_pushRelabel`` — Calculates the flow on the graph edges that maximizes " -"the flow from the sources to the targets using Push Relabel Algorithm." +msgid "``pgr_pushRelabel`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Push Relabel Algorithm." msgstr "" msgid "pgr_pushRelabel(Combinations)" @@ -14506,9 +12347,7 @@ msgstr "" msgid "``pgr_separateCrossing``" msgstr "" -msgid "" -"``pgr_separateCrossing`` - From crossing geometries generates geometries " -"that do not cross." +msgid "``pgr_separateCrossing`` - From crossing geometries generates geometries that do not cross." msgstr "" msgid "Proposed function." @@ -14538,24 +12377,16 @@ msgstr "" msgid "Get the code for further refinement." msgstr "" -msgid "" -"When there are special details that need to be taken care of because of the " -"final application or the quality of the data, the code can be obtained On a " -"PostgreSQL ``NOTICE`` using the ``dryrun`` flag." +msgid "When there are special details that need to be taken care of because of the final application or the quality of the data, the code can be obtained On a PostgreSQL ``NOTICE`` using the ``dryrun`` flag." msgstr "" msgid "``pgr_separateTouching``" msgstr "" -msgid "" -"``pgr_separateTouching`` - From touching geometries generates geometries " -"that are properly connected at endpoints" +msgid "``pgr_separateTouching`` - From touching geometries generates geometries that are properly connected at endpoints" msgstr "" -msgid "" -"This is an auxiliary function for processing geometries that touch but don't " -"share exact endpoints, splitting them at their intersection points to " -"improve network connectivity." +msgid "This is an auxiliary function for processing geometries that touch but don't share exact endpoints, splitting them at their intersection points to improve network connectivity." msgstr "" msgid "pgr_separateTouching(`Edges SQL`_, [``tolerance``, ``dryrun``])" @@ -14564,22 +12395,16 @@ msgstr "" msgid "``pgr_sequentialVertexColoring`` - Proposed" msgstr "" -msgid "" -"``pgr_sequentialVertexColoring`` — Returns the vertex coloring of an " -"undirected graph, using greedy approach." +msgid "``pgr_sequentialVertexColoring`` — Returns the vertex coloring of an undirected graph, using greedy approach." msgstr "" -msgid "" -"Sequential vertex coloring algorithm is a graph coloring algorithm in which " -"color identifiers are assigned to the vertices of a graph in a sequential " -"manner, such that no edge connects two identically colored vertices." +msgid "Sequential vertex coloring algorithm is a graph coloring algorithm in which color identifiers are assigned to the vertices of a graph in a sequential manner, such that no edge connects two identically colored vertices." msgstr "" msgid "The implementation is applicable only for **undirected** graphs." msgstr "" -msgid "" -"Provides the color to be assigned to all the vertices present in the graph." +msgid "Provides the color to be assigned to all the vertices present in the graph." msgstr "" msgid "Color identifiers values are in the Range :math:`[1, |V|]`" @@ -14588,12 +12413,7 @@ msgstr "" msgid "The algorithm tries to assign the least possible color to every vertex." msgstr "" -msgid "" -"Efficient graph coloring is an NP-Hard problem, and therefore, this " -"algorithm does not always produce optimal coloring. It follows a greedy " -"strategy by iterating through all the vertices sequentially, and assigning " -"the smallest possible color that is not used by its neighbors, to each " -"vertex." +msgid "Efficient graph coloring is an NP-Hard problem, and therefore, this algorithm does not always produce optimal coloring. It follows a greedy strategy by iterating through all the vertices sequentially, and assigning the smallest possible color that is not used by its neighbors, to each vertex." msgstr "" msgid "The returned rows are ordered in ascending order of the vertex value." @@ -14611,44 +12431,31 @@ msgstr "" msgid "pgr_sequentialVertexColoring(`Edges SQL`_)" msgstr "" -msgid "" -"`Boost: Sequential Vertex Coloring `__" +msgid "`Boost: Sequential Vertex Coloring `__" msgstr "" msgid "``pgr_sloanOrdering`` - Experimental" msgstr "" -msgid "" -"``pgr_sloanOrdering`` — Returns the Sloan ordering of an undirected graph" +msgid "``pgr_sloanOrdering`` — Returns the Sloan ordering of an undirected graph" msgstr "" -msgid "" -"The Sloan ordering algorithm reorders the vertices of a graph to reduce " -"bandwidth, profile, and wavefront properties, which is particularly useful " -"for sparse matrix computations and finite element analysis." +msgid "The Sloan ordering algorithm reorders the vertices of a graph to reduce bandwidth, profile, and wavefront properties, which is particularly useful for sparse matrix computations and finite element analysis." msgstr "" msgid "Finds a pseudoperipheral vertex pair to determine good starting points" msgstr "" -msgid "" -"Uses a priority-based algorithm that balances vertex degree and distance " -"from the start vertex." +msgid "Uses a priority-based algorithm that balances vertex degree and distance from the start vertex." msgstr "" -msgid "" -"Aims to minimize bandwidth (maximum difference between connected vertex " -"indices." +msgid "Aims to minimize bandwidth (maximum difference between connected vertex indices." msgstr "" -msgid "" -"Typically produces better orderings than simple breadth-first approaches." +msgid "Typically produces better orderings than simple breadth-first approaches." msgstr "" -msgid "" -"Time complexity: :math:`O(V² + E)` where V is the number of vertices and E " -"is the number of edges." +msgid "Time complexity: :math:`O(V² + E)` where V is the number of vertices and E is the number of edges." msgstr "" msgid "pgr_sloanOrdering(`Edges SQL`_)" @@ -14663,9 +12470,7 @@ msgstr "" msgid "Sloan ordering of Original graph from Boost example (vertices 0-9)." msgstr "" -msgid "" -"`Boost: Sloan Ordering `__" +msgid "`Boost: Sloan Ordering `__" msgstr "" msgid "``pgr_stoerWagner`` - Experimental" @@ -14677,23 +12482,10 @@ msgstr "" msgid "Version 3.0" msgstr "" -msgid "" -"In graph theory, the Stoer–Wagner algorithm is a recursive algorithm to " -"solve the minimum cut problem in undirected weighted graphs with non-" -"negative weights. The essential idea of this algorithm is to shrink the " -"graph by merging the most intensive vertices, until the graph only contains " -"two combined vertex sets. At each phase, the algorithm finds the minimum s-t " -"cut for two vertices s and t chosen as its will. Then the algorithm shrinks " -"the edge between s and t to search for non s-t cuts. The minimum cut found " -"in all phases will be the minimum weighted cut of the graph." +msgid "In graph theory, the Stoer–Wagner algorithm is a recursive algorithm to solve the minimum cut problem in undirected weighted graphs with non-negative weights. The essential idea of this algorithm is to shrink the graph by merging the most intensive vertices, until the graph only contains two combined vertex sets. At each phase, the algorithm finds the minimum s-t cut for two vertices s and t chosen as its will. Then the algorithm shrinks the edge between s and t to search for non s-t cuts. The minimum cut found in all phases will be the minimum weighted cut of the graph." msgstr "" -msgid "" -"A cut is a partition of the vertices of a graph into two disjoint subsets. A " -"minimum cut is a cut for which the size or weight of the cut is not larger " -"than the size of any other cut. For an unweighted graph, the minimum cut " -"would simply be the cut with the least edges. For a weighted graph, the sum " -"of all edges' weight on the cut determines whether it is a minimum cut." +msgid "A cut is a partition of the vertices of a graph into two disjoint subsets. A minimum cut is a cut for which the size or weight of the cut is not larger than the size of any other cut. For an unweighted graph, the minimum cut would simply be the cut with the least edges. For a weighted graph, the sum of all edges' weight on the cut determines whether it is a minimum cut." msgstr "" msgid "Sum of the weights of all edges between the two sets is mincut." @@ -14711,9 +12503,7 @@ msgstr "" msgid "When the graph is unconnected then EMPTY SET is return." msgstr "" -msgid "" -"Sometimes a graph has multiple min-cuts, but all have the same weight. The " -"this function determines exactly one of the min-cuts as well as its weight." +msgid "Sometimes a graph has multiple min-cuts, but all have the same weight. The this function determines exactly one of the min-cuts as well as its weight." msgstr "" msgid "Running time: :math:`O(V*E + V^2*log V)`." @@ -14752,9 +12542,7 @@ msgstr "" msgid "Using :doc:`pgr_connectedComponents`" msgstr "" -msgid "" -"`Boost: Stoer Wagner min cut `__" +msgid "`Boost: Stoer Wagner min cut `__" msgstr "" msgid "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" @@ -14763,14 +12551,10 @@ msgstr "" msgid "``pgr_strongComponents``" msgstr "" -msgid "" -"``pgr_strongComponents`` — Strongly connected components of a directed graph " -"using Tarjan's algorithm based on DFS." +msgid "``pgr_strongComponents`` — Strongly connected components of a directed graph using Tarjan's algorithm based on DFS." msgstr "" -msgid "" -"A strongly connected component of a directed graph is a set of vertices that " -"are all reachable from each other." +msgid "A strongly connected component of a directed graph is a set of vertices that are all reachable from each other." msgstr "" msgid "Works for **directed** graphs." @@ -14785,37 +12569,25 @@ msgstr "" msgid "The strong components of the graph" msgstr "" -msgid "" -"`Boost: Strong components `__" +msgid "`Boost: Strong components `__" msgstr "" -msgid "" -"wikipedia: `Strongly connected component `__" +msgid "wikipedia: `Strongly connected component `__" msgstr "" msgid "``pgr_topologicalSort`` - Experimental" msgstr "" -msgid "" -"``pgr_topologicalSort`` — Linear ordering of the vertices for directed " -"acyclic graphs (DAG)." +msgid "``pgr_topologicalSort`` — Linear ordering of the vertices for directed acyclic graphs (DAG)." msgstr "" -msgid "" -"The topological sort algorithm creates a linear ordering of the vertices " -"such that if edge :math:`(u,v)` appears in the graph, then :math:`v` comes " -"before :math:`u` in the ordering." +msgid "The topological sort algorithm creates a linear ordering of the vertices such that if edge :math:`(u,v)` appears in the graph, then :math:`v` comes before :math:`u` in the ordering." msgstr "" -msgid "" -"Process is valid for directed acyclic graphs only. otherwise it will throw " -"warnings." +msgid "Process is valid for directed acyclic graphs only. otherwise it will throw warnings." msgstr "" -msgid "" -"For optimization purposes, if there are more than one answer, the function" +msgid "For optimization purposes, if there are more than one answer, the function" msgstr "" msgid "will return one of them." @@ -14845,20 +12617,16 @@ msgstr "" msgid "Graph is not a DAG" msgstr "" -msgid "" -"`Boost: topological sort `__" +msgid "`Boost: topological sort `__" msgstr "" msgid "``pgr_transitiveClosure`` - Experimental" msgstr "" -msgid "" -"``pgr_transitiveClosure`` — Transitive closure graph of a directed graph." +msgid "``pgr_transitiveClosure`` — Transitive closure graph of a directed graph." msgstr "" -msgid "" -"Transforms the input directed graph into the transitive closure of the graph." +msgid "Transforms the input directed graph into the transitive closure of the graph." msgstr "" msgid "Process is valid for directed graphs." @@ -14867,9 +12635,7 @@ msgstr "" msgid "The transitive closure of an undirected graph produces a cluster graph" msgstr "" -msgid "" -"Reachability between vertices on an undirected graph happens when they " -"belong to the same connected component. (see :doc:`pgr_connectedComponents`)" +msgid "Reachability between vertices on an undirected graph happens when they belong to the same connected component. (see :doc:`pgr_connectedComponents`)" msgstr "" msgid "The returned values are not ordered" @@ -14905,9 +12671,7 @@ msgstr "" msgid "Identifiers of the vertices that are reachable from vertex v." msgstr "" -msgid "" -"`Boost: transitive closure `__" +msgid "`Boost: transitive closure `__" msgstr "" msgid "https://en.wikipedia.org/wiki/Transitive_closure" @@ -14949,14 +12713,10 @@ msgstr "" msgid "pgr_trspViaEdges" msgstr "" -msgid "" -"Turn restricted shortest path (TRSP) is an algorithm that receives turn " -"restrictions in form of a query like those found in real world navigable " -"road networks." +msgid "Turn restricted shortest path (TRSP) is an algorithm that receives turn restrictions in form of a query like those found in real world navigable road networks." msgstr "" -msgid "" -"It does no guarantee the shortest path as it might contain restriction paths." +msgid "It does no guarantee the shortest path as it might contain restriction paths." msgstr "" msgid "The general algorithm is as follows:" @@ -14971,65 +12731,46 @@ msgstr "" msgid "Execute the **TRSP** algorithm with restrictions." msgstr "" -msgid "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, " -"[``directed``])" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vids**, " -"[``directed``])" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vid**, " -"[``directed``])" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, " -"[``directed``])" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, " -"[``directed``])" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" msgid "From vertex :math:`6` to vertex :math:`10` on an undirected graph." msgstr "" -msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 1\\}` on an undirected graph." +msgid "From vertex :math:`6` to vertices :math:`\\{10, 1\\}` on an undirected graph." msgstr "" -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertex :math:`8` on a directed graph." +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`8` on a directed graph." msgstr "" -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 8\\}` on an " -"undirected graph." +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 8\\}` on an undirected graph." msgstr "" msgid "Using a combinations table on an undirected graph." msgstr "" -msgid "" -"`Deprecated documentation `_" +msgid "`Deprecated documentation `_" msgstr "" msgid "``pgr_trspVia``" msgstr "" -msgid "" -"``pgr_trspVia`` Route that goes through a list of vertices with restrictions." +msgid "``pgr_trspVia`` Route that goes through a list of vertices with restrictions." msgstr "" -msgid "" -"Given a list of vertices and a graph, this function is equivalent to finding " -"the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :" -"math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." +msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." msgstr "" msgid "The paths represents the sections of the route." @@ -15038,8 +12779,7 @@ msgstr "" msgid "Execute a :doc:`pgr_dijkstraVia`." msgstr "" -msgid "" -"For the set of sub paths of the solution that pass through a restriction then" +msgid "For the set of sub paths of the solution that pass through a restriction then" msgstr "" msgid "Execute the **TRSP** algorithm with restrictions for the paths." @@ -15048,14 +12788,10 @@ msgstr "" msgid "**NOTE** when this is done, ``U_turn_on_edge`` flag is ignored." msgstr "" -msgid "" -"pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, " -"[**options**])" +msgid "pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, [**options**])" 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." +msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a directed graph." msgstr "" msgid "Simulation of how algorithm works." @@ -15064,18 +12800,13 @@ msgstr "" msgid "The algorithm performs a :doc:`pgr_dijkstraVia`" msgstr "" -msgid "" -"Detects which of the sub paths pass through a restriction in this case is " -"for the ``path_id = 5`` from ``6`` to ``3`` because the path :math:`15 " -"\\rightarrow 1` is restricted." +msgid "Detects which of the sub paths pass through a restriction in this case is for the ``path_id = 5`` from ``6`` to ``3`` because the path :math:`15 \\rightarrow 1` is restricted." msgstr "" msgid "Executes the :doc:`pgr_trsp` algorithm for the conflicting paths." msgstr "" -msgid "" -"From the :doc:`pgr_dijkstraVia` result it removes the conflicting paths and " -"builds the solution with the results of the :doc:`pgr_trsp` algorithm:" +msgid "From the :doc:`pgr_dijkstraVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" msgstr "" msgid "Getting the same result as ``pgr_trspVia``:" @@ -15087,20 +12818,13 @@ msgstr "" msgid "Sometimes ``U_turn_on_edge`` flag is ignored when is set to ``false``." msgstr "" -msgid "" -"The first step, doing a :doc:`pgr_dijkstraVia` does consider not making a U " -"turn on the same edge. But the path :math:`16 \\rightarrow 13` (Rows 4 and " -"5) is restricted and the result is using it." +msgid "The first step, doing a :doc:`pgr_dijkstraVia` does consider not making a U turn on the same edge. But the path :math:`16 \\rightarrow 13` (Rows 4 and 5) is restricted and the result is using it." msgstr "" -msgid "" -"When executing the :doc:`pgr_trsp` algorithm for the conflicting path, there " -"is no ``U_turn_on_edge`` flag." +msgid "When executing the :doc:`pgr_trsp` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." msgstr "" -msgid "" -"Therefore the result ignores the ``U_turn_on_edge`` flag when set to " -"``false``." +msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``." msgstr "" msgid ":doc:`via-category`" @@ -15109,17 +12833,10 @@ msgstr "" msgid "``pgr_trspVia_withPoints``" msgstr "" -msgid "" -"``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/" -"or points with restrictions." +msgid "``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/or points with restrictions." msgstr "" -msgid "" -"Given a graph, a set of restriction on the graph edges, a set of points on " -"the graphs edges and a list of vertices, this function is equivalent to " -"finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` " -"(where :math:`vertex` can be a vertex or a point on the graph) for all :math:" -"`i < size\\_of(via\\;vertices)` trying not to use restricted paths." +msgid "Given a graph, a set of restriction on the graph edges, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." msgstr "" msgid "is a sequence of paths" @@ -15137,8 +12854,7 @@ msgstr "" msgid "Execute a :doc:`pgr_withPointsVia`." msgstr "" -msgid "" -"For the set of paths of the solution that pass through a restriction then" +msgid "For the set of paths of the solution that pass through a restriction then" msgstr "" msgid "Execute the **TRSP** algorithm with restrictions for the path." @@ -15147,17 +12863,13 @@ msgstr "" msgid "Do not use negative values on identifiers of the inner queries." msgstr "" -msgid "" -"pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**via vertices**, [**driving side**,] [**options**])" +msgid "pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, [**driving side**,] [**options**])" msgstr "" msgid "**options:** ``[directed, strict, U_turn_on_edge, details]``" msgstr "" -msgid "" -"Find the route that visits the vertices :math:`\\{-6, 15, -5\\}` in that " -"order on an directed graph." +msgid "Find the route that visits the vertices :math:`\\{-6, 15, -5\\}` in that order on an directed graph." msgstr "" msgid "When positive it is considered a vertex identifier" @@ -15169,9 +12881,7 @@ msgstr "" msgid "[**driving side**]" msgstr "" -msgid "" -"Value in [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] indicating if the " -"driving side is:" +msgid "Value in [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] indicating if the driving side is:" msgstr "" msgid "For directed graph:" @@ -15210,13 +12920,10 @@ msgstr "" msgid "When ``true`` the results will include the points that are in the path." msgstr "" -msgid "" -"When ``false`` the results will not include the points that are in the path." +msgid "When ``false`` the results will not include the points that are in the path." msgstr "" -msgid "" -"When ``start_vid``, ``end_vid`` and ``node`` columns have negative values, " -"the identifier is for a Point." +msgid "When ``start_vid``, ``end_vid`` and ``node`` columns have negative values, the identifier is for a Point." msgstr "" msgid "Use ``pgr_findCloseEdges`` for points on the fly" @@ -15225,30 +12932,22 @@ msgstr "" msgid "Using :doc:`pgr_findCloseEdges`:" msgstr "" -msgid "" -"Visit from vertex :math:`1` to the two locations on the graph of point " -"`(2.9, 1.8)` in order of closeness to the graph." +msgid "Visit from vertex :math:`1` to the two locations on the graph of point `(2.9, 1.8)` in order of closeness to the graph." msgstr "" -msgid "" -"Point :math:`-1` corresponds to the closest edge from point `(2.9, 1.8)`." +msgid "Point :math:`-1` corresponds to the closest edge from point `(2.9, 1.8)`." msgstr "" -msgid "" -"Point :math:`-2` corresponds to the next close edge from point `(2.9, 1.8)`." +msgid "Point :math:`-2` corresponds to the next close edge from point `(2.9, 1.8)`." msgstr "" -msgid "" -"Point :math:`-2` is visited on the route to from vertex :math:`1` to Point :" -"math:`-1` (See row where :math:`seq = 4`)." +msgid "Point :math:`-2` is visited on the route to from vertex :math:`1` to Point :math:`-1` (See row where :math:`seq = 4`)." msgstr "" msgid "Usage variations" msgstr "" -msgid "" -"All this examples are about the route that visits the vertices :math:`\\{-6, " -"7, -4, 8, -2\\}` in that order on a directed graph." +msgid "All this examples are about the route that visits the vertices :math:`\\{-6, 7, -4, 8, -2\\}` in that order on a directed graph." msgstr "" msgid "Status of \"passes in front\" or \"visits\" of the nodes and points." @@ -15257,40 +12956,25 @@ msgstr "" msgid "The algorithm performs a :doc:`pgr_withPointsVia`" msgstr "" -msgid "" -"Detects which of the paths pass through a restriction in this case is for " -"the ``path_id = 1`` from ``-6`` to ``15`` because the path :math:`9 " -"\\rightarrow 16` is restricted." +msgid "Detects which of the paths pass through a restriction in this case is for the ``path_id = 1`` from ``-6`` to ``15`` because the path :math:`9 \\rightarrow 16` is restricted." msgstr "" -msgid "" -"Executes the :ref:`TRSP-family:TRSP algorithm` for the conflicting paths." +msgid "Executes the :ref:`TRSP-family:TRSP algorithm` for the conflicting paths." msgstr "" -msgid "" -"From the :doc:`pgr_withPointsVia` result it removes the conflicting paths " -"and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" +msgid "From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" msgstr "" msgid "Getting the same result as ``pgr_trspVia_withPoints``:" msgstr "" -msgid "" -"The first step, doing a :doc:`pgr_withPointsVia` does consider not making a " -"U turn on the same edge. But the path :math:`9 \\rightarrow 16` (Rows 4 and " -"5) is restricted and the result is using it." +msgid "The first step, doing a :doc:`pgr_withPointsVia` does consider not making a U turn on the same edge. But the path :math:`9 \\rightarrow 16` (Rows 4 and 5) is restricted and the result is using it." msgstr "" -msgid "" -"When executing the :doc:`pgr_trsp_withPoints` algorithm for the conflicting " -"path, there is no ``U_turn_on_edge`` flag." +msgid "When executing the :doc:`pgr_trsp_withPoints` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." msgstr "" -msgid "" -"Therefore the result ignores the ``U_turn_on_edge`` flag when set to " -"``false``. From the :doc:`pgr_withPointsVia` result it removes the " -"conflicting paths and builds the solution with the results of the :doc:" -"`pgr_trsp` algorithm. In this case a U turn is been done using the same edge." +msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``. From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm. In this case a U turn is been done using the same edge." msgstr "" msgid "``pgr_trsp_withPoints``" @@ -15299,10 +12983,7 @@ msgstr "" msgid "``pgr_trsp_withPoints`` Routing Vertex/Point with restrictions." msgstr "" -msgid "" -"Modify the graph to include points defined by `Points SQL`_. Consider the " -"invalid paths on `Restrictions SQL`_. Using Dijkstra algorithm, find the " -"shortest path." +msgid "Modify the graph to include points defined by `Points SQL`_. Consider the invalid paths on `Restrictions SQL`_. Using Dijkstra algorithm, find the shortest path." msgstr "" msgid "Vertices of the graph are:" @@ -15320,82 +13001,55 @@ msgstr "" msgid "The `agg_cost` in the non included values `(u, v)` is :math:`\\infty`" msgstr "" -msgid "" -"For optimization purposes, any duplicated value in the input arrays of " -"**start vids** or **end vids** or are ignored." +msgid "For optimization purposes, any duplicated value in the input arrays of **start vids** or **end vids** or are ignored." msgstr "" msgid "Running time: :math:`O(|start\\_vids|\\times(V \\log V + E))`" msgstr "" -msgid "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**start vid**, **end vid**, [**driving side**,] [**options**])" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**,] [**options**])" msgstr "" -msgid "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**start vid**, **end vids**, [**driving side**,] [**options**])" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**,] [**options**])" msgstr "" -msgid "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**start vids**, **end vid**, [**driving side**,] [**options**])" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**,] [**options**])" msgstr "" -msgid "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**start vids**, **end vids**, [**driving side**,] [**options**])" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**,] [**options**])" msgstr "" -msgid "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"`Combinations SQL`_, [**driving side**,] [**options**])" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**,] [**options**])" msgstr "" msgid "**options:** ``[directed, details]``" msgstr "" -msgid "" -"From point :math:`1` to vertex :math:`10` with right driving side in " -"directed graph. (with details)" +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (with details)" msgstr "" -msgid "" -"From point :math:`1` to point :math:`3` and vertex :math:`7` on an " -"undirected graph" +msgid "From point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" msgstr "" -msgid "" -"From point :math:`1` and vertex :math:`6` to point :math:`3` with right " -"driving side in directed graph. (without details)" +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph. (without details)" msgstr "" -msgid "" -"From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :" -"math:`1` with left side driving." +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` with left side driving." msgstr "" msgid "Two combinations" msgstr "" -msgid "" -"From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to " -"point :math:`3` with right side driving. (with details)" +msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving. (with details)" msgstr "" msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_." msgstr "" -msgid "" -"Find the routes from vertex :math:`1` to the two closest locations on the " -"graph of point `(2.9, 1.8)`." +msgid "Find the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." msgstr "" -msgid "" -"All the examples are about traveling from point :math:`1` and vertex :math:" -"`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}` with " -"restrictions" +msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}` with restrictions" msgstr "" msgid "Passes in front or visits with right side driving." @@ -15410,19 +13064,13 @@ msgstr "" msgid "``pgr_turnRestrictedPath`` - Experimental" msgstr "" -msgid "" -"``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex - Vertex routing " -"with restrictions" +msgid "``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex - Vertex routing with restrictions" 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" +msgid "Using Yen's algorithm to obtain K shortest paths and analyze the paths to select the paths that do not use the restrictions" msgstr "" -msgid "" -"pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, " -"**end vid**, **K**, [**options**])" +msgid "pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, **K**, [**options**])" msgstr "" msgid "**options:** ``[directed, heap_paths, stop_on_first, strict]``" @@ -15437,8 +13085,7 @@ msgstr "" msgid "``stop_on_first``" msgstr "" -msgid "" -"When ``true`` stops on first path found that dos not violate restrictions" +msgid "When ``true`` stops on first path found that dos not violate restrictions" msgstr "" msgid "When ``false`` returns at most K paths" @@ -15498,94 +13145,61 @@ msgstr "" msgid "TBD" msgstr "" -msgid "" -"``pgr_withPoints`` - Returns the shortest path in a graph with additional " -"temporary vertices." +msgid "``pgr_withPoints`` - Returns the shortest path in a graph with additional temporary vertices." msgstr "" msgid "pgr_withPoints(Combinations)" msgstr "" -msgid "" -"Modify the graph to include points defined by `Points SQL`_. Using Dijkstra " -"algorithm, find the shortest path." +msgid "Modify the graph to include points defined by `Points SQL`_. Using Dijkstra algorithm, find the shortest path." msgstr "" -msgid "" -"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, " -"[**driving side**] [**options**])" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" msgstr "" -msgid "" -"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, " -"[**driving side**] [**options**])" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" msgstr "" -msgid "" -"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, " -"[**driving side**] [**options**])" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" msgstr "" -msgid "" -"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, " -"[**driving side**] [**options**])" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" msgstr "" -msgid "" -"pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving " -"side**] [**options**])" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" msgstr "" msgid "**options:** ``[directed, details])``" msgstr "" -msgid "" -"From point :math:`1` to vertex :math:`10` with right driving side in " -"directed graph. (without details)" +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (without details)" msgstr "" -msgid "" -"Identifier of the starting vertex of the path. Negative value is for point’s " -"identifier." +msgid "Identifier of the starting vertex of the path. Negative value is for point’s identifier." msgstr "" -msgid "" -"Array of identifiers of starting vertices. Negative values are for point’s " -"identifiers." +msgid "Array of identifiers of starting vertices. Negative values are for point’s identifiers." msgstr "" -msgid "" -"Identifier of the ending vertex of the path. Negative value is for point’s " -"identifier." +msgid "Identifier of the ending vertex of the path. Negative value is for point’s identifier." msgstr "" -msgid "" -"Array of identifiers of ending vertices. Negative values are for point’s " -"identifiers." +msgid "Array of identifiers of ending vertices. Negative values are for point’s identifiers." msgstr "" -msgid "" -"All the examples are about traveling from point :math:`1` and vertex :math:" -"`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" +msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" msgstr "" -msgid "" -"``pgr_withPointsCost`` - Calculates the shortest path and returns only the " -"aggregate cost of the shortest path found, for the combination of points " -"given." +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 "" msgid "pgr_withPointsCost(Combinations)" msgstr "" -msgid "" -"Modify the graph to include points defined by points_sql. Using Dijkstra " -"algorithm, return only the aggregate cost of the shortest path found." +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 "" -msgid "" -"Returns the sum of the costs of the shortest path for pair combination of " -"vertices in the modified graph." +msgid "Returns the sum of the costs of the shortest path for pair combination of vertices in the modified graph." msgstr "" msgid "The returned values are in the form of a set of |matrix-result|." @@ -15597,65 +13211,43 @@ msgstr "" msgid "**negative** when it belongs to the points_sql" msgstr "" -msgid "" -"If the values returned are stored in a table, the unique index would be the " -"pair: `(start_vid, end_vid)`." +msgid "If the values returned are stored in a table, the unique index would be the pair: `(start_vid, end_vid)`." msgstr "" msgid "For **undirected** graphs, the results are **symmetric**." msgstr "" -msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, " -"[**driving side**] [**options**])" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" msgstr "" -msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, " -"[**driving side**] [**options**])" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" msgstr "" -msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, " -"[**driving side**] [**options**])" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" msgstr "" -msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end " -"vids**, [**driving side**] [**options**])" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" msgstr "" -msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, " -"[**driving side**] [**options**])" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" msgstr "" msgid "**options:** ``[directed]``" msgstr "" -msgid "" -"There is no **details** flag, unlike the other members of the withPoints " -"family of functions." +msgid "There is no **details** flag, unlike the other members of the withPoints family of functions." msgstr "" -msgid "" -"From point :math:`1` to vertex :math:`10` with right driving side in " -"directed graph." +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph." msgstr "" -msgid "" -"From point :math:`1` and vertex :math:`6` to point :math:`3` with right " -"driving side in directed graph." +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph." msgstr "" -msgid "" -"From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to " -"point :math:`3` with right side driving." +msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving." msgstr "" -msgid "" -"Find the cost of the routes from vertex :math:`1` to the two closest " -"locations on the graph of point `(2.9, 1.8)`." +msgid "Find the cost of the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." msgstr "" msgid "Being close to the graph does not mean have a shorter route." @@ -15664,9 +13256,7 @@ msgstr "" msgid "Right side driving topology" msgstr "" -msgid "" -"Traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, " -"3, 6\\}` and vertices :math:`\\{10, 11\\}`" +msgid "Traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" msgstr "" msgid "Left side driving topology" @@ -15675,19 +13265,13 @@ msgstr "" msgid "Does not matter driving side driving topology" msgstr "" -msgid "" -"``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:" -"`pgr_withPoints`." +msgid "``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:`pgr_withPoints`." msgstr "" -msgid "" -"pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, " -"[**driving side**] [**options**])" +msgid "pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, [**driving side**] [**options**])" msgstr "" -msgid "" -"Cost matrix for points :math:`\\{1, 6\\}` and vertices :math:`\\{10, 11\\}` " -"on an **undirected** graph" +msgid "Cost matrix for points :math:`\\{1, 6\\}` and vertices :math:`\\{10, 11\\}` on an **undirected** graph" msgstr "" msgid "Returning a **symmetrical** cost matrix" @@ -15699,14 +13283,10 @@ msgstr "" msgid "Using the default ``driving side`` value" msgstr "" -msgid "" -"Find the matrix cost of the routes from vertex :math:`1` and the two closest " -"locations on the graph of point `(2.9, 1.8)`." +msgid "Find the matrix cost of the routes from vertex :math:`1` and the two closest locations on the graph of point `(2.9, 1.8)`." msgstr "" -msgid "" -"``pgr_withPointsDD`` - Returns the driving **distance** from a starting " -"point." +msgid "``pgr_withPointsDD`` - Returns the driving **distance** from a starting point." msgstr "" msgid "Output columns standardized to |result-spantree|" @@ -15721,21 +13301,13 @@ msgstr "" msgid "Deprecated signatures:" msgstr "" -msgid "" -"Modify the graph to include points and using Dijkstra algorithm, extracts " -"all the nodes and points that have costs less than or equal to the value " -"``**distance**`` from the starting point. The edges extracted will conform " -"the corresponding spanning tree." +msgid "Modify the graph to include points and using Dijkstra algorithm, extracts all the nodes and points that have costs less than or equal to the value ``**distance**`` from the starting point. The edges extracted will conform the corresponding spanning tree." msgstr "" -msgid "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, " -"[**driving side**], [**options A**])" +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options A**])" msgstr "" -msgid "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, " -"[**driving side**], [**options B**])" +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options B**])" msgstr "" msgid "**options A:** ``[directed, details]``" @@ -15744,60 +13316,43 @@ msgstr "" msgid "**options B:** ``[directed, details, equicost]``" msgstr "" -msgid "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, " -"[**driving side**], [**options**])" +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options**])" msgstr "" -msgid "" -"Right side driving topology, from point :math:`1` within a distance of :math:" -"`3.3` with details." +msgid "Right side driving topology, from point :math:`1` within a distance of :math:`3.3` with details." msgstr "" -msgid "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, " -"[**driving side**], [**options**])" +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options**])" msgstr "" msgid "**options:** ``[directed, details, equicost]``" msgstr "" -msgid "" -"From point :math:`1` and vertex :math:`16` within a distance of :math:`3.3` " -"with ``equicost`` on a directed graph" +msgid "From point :math:`1` and vertex :math:`16` within a distance of :math:`3.3` with ``equicost`` on a directed graph" msgstr "" msgid "Negative values represent a point" msgstr "" -msgid "" -"Find the driving distance from the two closest locations on the graph of " -"point `(2.9, 1.8)`." +msgid "Find the driving distance from the two closest locations on the graph of point `(2.9, 1.8)`." msgstr "" -msgid "" -"Point :math:`-1` corresponds to the closest edge from point :math:`(2.9, " -"1.8)`." +msgid "Point :math:`-1` corresponds to the closest edge from point :math:`(2.9, 1.8)`." msgstr "" -msgid "" -"Point :math:`-2` corresponds to the next close edge from point :math:`(2.9, " -"1.8)`." +msgid "Point :math:`-2` corresponds to the next close edge from point :math:`(2.9, 1.8)`." msgstr "" msgid "Driving side does not matter" msgstr "" -msgid "" -"From point :math:`1` within a distance of :math:`3.3`, does not matter " -"driving side, with details." +msgid "From point :math:`1` within a distance of :math:`3.3`, does not matter driving side, with details." msgstr "" msgid "``pgr_withPointsKSP``" msgstr "" -msgid "" -"``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." +msgid "``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." msgstr "" msgid "pgr_withPointsKSP(One to Many)" @@ -15812,42 +13367,28 @@ msgstr "" msgid "pgr_withPointsKSP(Combinations)" msgstr "" -msgid "" -"Modifies the graph to include the points defined in the `Points SQL`_ and " -"using Yen algorithm, finds the :math:`K` shortest paths." +msgid "Modifies the graph to include the points defined in the `Points SQL`_ and using Yen algorithm, finds the :math:`K` shortest paths." msgstr "" -msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, " -"**K**, [**driving side**], [**options**])" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, [**driving side**], [**options**])" msgstr "" -msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, " -"**K**, [**driving side**], [**options**])" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, [**driving side**], [**options**])" msgstr "" -msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, " -"**K**, [**driving side**], [**options**])" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, [**driving side**], [**options**])" msgstr "" -msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, " -"**K**, [**driving side**], [**options**])" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, [**driving side**], [**options**])" msgstr "" -msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, " -"[**driving side**], [**options**])" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, [**driving side**], [**options**])" msgstr "" msgid "**options:** ``[directed, heap_paths, details]``" msgstr "" -msgid "" -"Get 2 paths from Point :math:`1` to point :math:`2` on a directed graph with " -"**left** side driving." +msgid "Get 2 paths from Point :math:`1` to point :math:`2` on a directed graph with **left** side driving." msgstr "" msgid "For a directed graph." @@ -15859,21 +13400,13 @@ msgstr "" msgid "No heap paths are returned." msgstr "" -msgid "" -"Get 2 paths from point :math:`1` to point :math:`3` and vertex :math:`7` on " -"an undirected graph" +msgid "Get 2 paths from point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" msgstr "" -msgid "" -"Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` on a " -"**directed** graph with **right** side driving and **details** set to " -"**True**" +msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` on a **directed** graph with **right** side driving and **details** set to **True**" msgstr "" -msgid "" -"Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` and " -"vertex :math:`1` on a **directed** graph with **left** side driving and " -"**heap_paths** set to **True**" +msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` on a **directed** graph with **left** side driving and **heap_paths** set to **True**" msgstr "" msgid "Using a combinations table on an **directed** graph" @@ -15885,101 +13418,64 @@ msgstr "" msgid "withPointsKSP optional parameters" msgstr "" -msgid "" -"Get :math:`2` paths using left side driving topology, from vertex :math:`1` " -"to the closest location on the graph of point `(2.9, 1.8)`." +msgid "Get :math:`2` paths using left side driving topology, from vertex :math:`1` to the closest location on the graph of point `(2.9, 1.8)`." msgstr "" 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." +msgid "Get :math:`2` paths using left side driving topology, from point :math:`1` to point :math:`3` with details." msgstr "" msgid "Right driving side" msgstr "" -msgid "" -"Get :math:`2` paths using right side driving topology from, point :math:`1` " -"to point :math:`2` with heap paths and details." +msgid "Get :math:`2` paths using right side driving topology from, point :math:`1` to point :math:`2` with heap paths and details." msgstr "" msgid "``pgr_withPointsVia``" msgstr "" -msgid "" -"``pgr_withPointsVia`` - Route that goes through a list of vertices and/or " -"points." +msgid "``pgr_withPointsVia`` - Route that goes through a list of vertices and/or points." msgstr "" -msgid "" -"Given a graph, a set of points on the graphs edges and a list of vertices, " -"this function is equivalent to finding the shortest path between :math:" -"`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or " -"a point on the graph) for all :math:`i < size\\_of(via\\;vertices)`." +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 "" -msgid "" -"pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, [**driving " -"side**] [**options**])" +msgid "pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, [**driving side**] [**options**])" msgstr "" -msgid "" -"Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that " -"order with right driving side in directed graph.." +msgid "Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that order with right driving side in directed graph.." msgstr "" msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_" msgstr "" -msgid "" -"All this examples are about the route that visits the vertices :math:`\\{-1, " -"7, -3, 16, 15\\}` in that order on a **directed** graph." +msgid "All this examples are about the route that visits the vertices :math:`\\{-1, 7, -3, 16, 15\\}` in that order on a **directed** graph." msgstr "" msgid "Prim - Family of functions" msgstr "" -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." +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 "" -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 "This algorithms find the minimum spanning forest in a possibly disconnected graph; in contrast, the most basic form of Prim's algorithm only finds minimum spanning trees in connected graphs. However, running Prim's algorithm separately for each connected component of the graph, then it is called minimum spanning forest." msgstr "" -msgid "" -"From boost Graph: \"The algorithm as implemented in Boost.Graph does not " -"produce correct results on graphs with parallel edges.\"" +msgid "From boost Graph: \"The algorithm as implemented in Boost.Graph does not produce correct results on graphs with parallel edges.\"" msgstr "" -msgid "" -"Boost: `Prim's algorithm `__" +msgid "Boost: `Prim's algorithm `__" msgstr "" -msgid "" -"Wikipedia: `Prim's algorithm `__" +msgid "Wikipedia: `Prim's algorithm `__" msgstr "" msgid "Proposed Functions" msgstr "" -msgid "" -":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." +msgid ":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." msgstr "" msgid "Reference" @@ -15988,9 +13484,7 @@ msgstr "" msgid "Release Notes" msgstr "" -msgid "" -"To see the full list of changes check the list of `Git commits `_ on Github." +msgid "To see the full list of changes check the list of `Git commits `_ on Github." msgstr "" msgid "Mayors" @@ -16002,7 +13496,16 @@ msgstr "" msgid "Minors 4.x" msgstr "" -msgid "pgRouting 4.0" +msgid "pgRouting 4.1" +msgstr "" + +msgid "pgRouting 4.1.0 Release Notes" +msgstr "" + +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.1.0 `__" +msgstr "" + +msgid "No changes yet" msgstr "" msgid "pgRouting 3" @@ -16017,10 +13520,7 @@ msgstr "" msgid "pgRouting 3.8.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.8.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.8.0 `__" msgstr "" msgid "Promotion to official function of pgRouting." @@ -16029,32 +13529,22 @@ msgstr "" msgid "Metric" msgstr "" -msgid "" -"`#2760 `__: Promoted to " -"official pgr_degree in version 3.8" +msgid "`#2760 `__: Promoted to official pgr_degree in version 3.8" msgstr "" msgid "Utilities" msgstr "" -msgid "" -"`#2772 `__: Promoted to " -"official pgr_extractVertices in version 3.8" +msgid "`#2772 `__: Promoted to official pgr_extractVertices in version 3.8" msgstr "" -msgid "" -"`#2774 `__: Promoted to " -"official pgr_findCloseEdges in version 3.8" +msgid "`#2774 `__: Promoted to official pgr_findCloseEdges in version 3.8" msgstr "" -msgid "" -"`#2873 `__: Promoted to " -"official pgr_separateCrossing in version 3.8" +msgid "`#2873 `__: Promoted to official pgr_separateCrossing in version 3.8" msgstr "" -msgid "" -"`#2874 `__: Promoted to " -"official pgr_separateTouching in version 3.8" +msgid "`#2874 `__: Promoted to official pgr_separateTouching in version 3.8" msgstr "" msgid "Proposed functions" @@ -16063,45 +13553,31 @@ msgstr "" msgid "Contraction" msgstr "" -msgid "" -"`#2790 `__: " -"pgr_contractionDeadEnd new contraction function" +msgid "`#2790 `__: pgr_contractionDeadEnd new contraction function" msgstr "" -msgid "" -"`#2791 `__: " -"pgr_contractionLinear new contraction function" +msgid "`#2791 `__: pgr_contractionLinear new contraction function" msgstr "" -msgid "" -"`#2536 `__: Support for " -"contraction hierarchies (pgr_contractionHierarchies)" +msgid "`#2536 `__: Support for contraction hierarchies (pgr_contractionHierarchies)" msgstr "" -msgid "" -"`#2848 `__: Create " -"pgr_separateCrossing new utility function" +msgid "`#2848 `__: Create pgr_separateCrossing new utility function" msgstr "" -msgid "" -"`#2849 `__: Create of " -"pgr_separateTouching new utility function" +msgid "`#2849 `__: Create of pgr_separateTouching new utility function" msgstr "" msgid "Official functions changes" msgstr "" -msgid "" -"`#2786 `__: " -"pgr_contraction(edges) new signature" +msgid "`#2786 `__: pgr_contraction(edges) new signature" msgstr "" msgid "C/C++ code enhancements" msgstr "" -msgid "" -"`#2802 `__: Code " -"reorganization on pgr_contraction" +msgid "`#2802 `__: Code reorganization on pgr_contraction" msgstr "" msgid "Other enhancements:" @@ -16113,37 +13589,25 @@ msgstr "" msgid "SQL code enhancements" msgstr "" -msgid "" -"`#2850 `__: Rewrite " -"pgr_nodeNetwork" +msgid "`#2850 `__: Rewrite pgr_nodeNetwork" msgstr "" msgid "Deprecation of SQL functions" msgstr "" -msgid "" -"`#2749 `__: Deprecate " -"pgr_AlphaShape in 3.8" +msgid "`#2749 `__: Deprecate pgr_AlphaShape in 3.8" msgstr "" -msgid "" -"`#2750 `__: Deprecate " -"pgr_CreateTopology in 3.8" +msgid "`#2750 `__: Deprecate pgr_CreateTopology in 3.8" msgstr "" -msgid "" -"`#2753 `__: Deprecate " -"pgr_analyzeGraph in 3.8" +msgid "`#2753 `__: Deprecate pgr_analyzeGraph in 3.8" msgstr "" -msgid "" -"`#2754 `__: Deprecate " -"pgr_analyzeOneWay in 3.8" +msgid "`#2754 `__: Deprecate pgr_analyzeOneWay in 3.8" msgstr "" -msgid "" -"`#2826 `__: Deprecate " -"pgr_createVerticesTable in 3.8" +msgid "`#2826 `__: Deprecate pgr_createVerticesTable in 3.8" msgstr "" msgid "In the deprecated functions:" @@ -16161,29 +13625,19 @@ msgstr "" msgid "pgRouting 3.7.3 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.7.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.3 `__" msgstr "" -msgid "" -"`#2731 `__: Build " -"Failure on Ubuntu 22" +msgid "`#2731 `__: Build Failure on Ubuntu 22" msgstr "" msgid "pgRouting 3.7.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.7.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.2 `__" msgstr "" -msgid "" -"`#2713 `__: cmake " -"missing some policies and min version" +msgid "`#2713 `__: cmake missing some policies and min version" msgstr "" msgid "Using OLD policies: CMP0148, CMP0144, CMP0167" @@ -16192,33 +13646,22 @@ msgstr "" msgid "Minimum cmake version 3.12" msgstr "" -msgid "" -"`#2707 `__: Build " -"failure in pgRouting 3.7.1 on Alpine" +msgid "`#2707 `__: Build failure in pgRouting 3.7.1 on Alpine" msgstr "" -msgid "" -"`#2706 `__: winnie " -"crashing on pgr_betweennessCentrality" +msgid "`#2706 `__: winnie crashing on pgr_betweennessCentrality" msgstr "" msgid "pgRouting 3.7.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.7.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.1 `__" msgstr "" -msgid "" -"`#2680 `__: fails to " -"compile under mingw64 gcc 13.2" +msgid "`#2680 `__: fails to compile under mingw64 gcc 13.2" msgstr "" -msgid "" -"`#2689 `__: When point " -"is a vertex, the withPoints family do not return results." +msgid "`#2689 `__: When point is a vertex, the withPoints family do not return results." msgstr "" msgid "C/C++ code enhancemet" @@ -16230,18 +13673,13 @@ msgstr "" msgid "pgRouting 3.7.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.7.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.0 `__" msgstr "" msgid "Support" msgstr "" -msgid "" -"`#2656 `__: Stop support " -"of PostgreSQL12 on pgrouting v3.7" +msgid "`#2656 `__: Stop support of PostgreSQL12 on pgrouting v3.7" msgstr "" msgid "Stopping support of PostgreSQL 12" @@ -16253,9 +13691,7 @@ msgstr "" msgid "pgr_betweennessCentrality" msgstr "" -msgid "" -"`#2605 `__: Standardize " -"spanning tree functions output" +msgid "`#2605 `__: Standardize spanning tree functions output" msgstr "" msgid "Functions:" @@ -16264,9 +13700,7 @@ msgstr "" msgid "Experimental promoted to proposed." msgstr "" -msgid "" -"`#2635 `__: " -"pgr_LineGraph ignores directed flag and use negative values for identifiers." +msgid "`#2635 `__: pgr_LineGraph ignores directed flag and use negative values for identifiers." msgstr "" msgid "``pgr_lineGraph``" @@ -16275,19 +13709,13 @@ msgstr "" msgid "Code enhancement" msgstr "" -msgid "" -"`#2599 `__: Driving " -"distance cleanup" +msgid "`#2599 `__: Driving distance cleanup" msgstr "" -msgid "" -"`#2607 `__: Read " -"postgresql data on C++" +msgid "`#2607 `__: Read postgresql data on C++" msgstr "" -msgid "" -"`#2614 `__: Clang tidy " -"does not work" +msgid "`#2614 `__: Clang tidy does not work" msgstr "" msgid "pgRouting 3.6" @@ -16296,10 +13724,7 @@ msgstr "" msgid "pgRouting 3.6.3 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.6.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.3 `__" msgstr "" msgid "Explicit minimum requirements:" @@ -16329,9 +13754,7 @@ msgstr "" msgid "Add a clang tidy test on changed files." msgstr "" -msgid "" -"Update test not done on versions: 3.0.1, 3.0.2, 3.0.3, 3.0.4, 3.1.0, 3.1.1, " -"3.1.2" +msgid "Update test not done on versions: 3.0.1, 3.0.2, 3.0.3, 3.0.4, 3.1.0, 3.1.1, 3.1.2" msgstr "" msgid "Documentation" @@ -16352,10 +13775,7 @@ msgstr "" msgid "pgRouting 3.6.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.6.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.2 `__" msgstr "" msgid "Upgrade fix" @@ -16379,110 +13799,73 @@ msgstr "" msgid "pgRouting 3.6.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.6.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.1 `__" msgstr "" -msgid "" -"`#2588 `__: pgrouting " -"3.6.0 fails to build on OSX" +msgid "`#2588 `__: pgrouting 3.6.0 fails to build on OSX" msgstr "" msgid "pgRouting 3.6.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.6.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.0 `__" msgstr "" -msgid "" -"`#2516 `__: Standardize " -"output pgr_aStar" +msgid "`#2516 `__: Standardize output pgr_aStar" msgstr "" msgid "Standardize output columns to |short-generic-result|" msgstr "" -msgid "" -"`#2523 `__: Standardize " -"output pgr_bdAstar" +msgid "`#2523 `__: Standardize output pgr_bdAstar" msgstr "" -msgid "" -"`#2547 `__: Standardize " -"output and modifying signature pgr_KSP" +msgid "`#2547 `__: Standardize output and modifying signature pgr_KSP" msgstr "" -msgid "" -"`#2548 `__: Standardize " -"output pgr_drivingDistance" +msgid "`#2548 `__: Standardize output pgr_drivingDistance" msgstr "" msgid "Proposed functions changes" msgstr "" -msgid "" -"`#2544 `__: Standardize " -"output and modifying signature pgr_withPointsDD" +msgid "`#2544 `__: Standardize output and modifying signature pgr_withPointsDD" msgstr "" -msgid "" -"`#2546 `__: Standardize " -"output and modifying signature pgr_withPointsKSP" +msgid "`#2546 `__: Standardize output and modifying signature pgr_withPointsKSP" msgstr "" -msgid "" -"`#2504 `__: To C++ pg " -"data get, fetch and check." +msgid "`#2504 `__: To C++ pg data get, fetch and check." msgstr "" msgid "Stopping support for compilation with MSVC." msgstr "" -msgid "" -"`#2505 `__: Using " -"namespace." +msgid "`#2505 `__: Using namespace." msgstr "" -msgid "" -"`#2512 `__: [Dijkstra] " -"Removing duplicate code on Dijkstra." +msgid "`#2512 `__: [Dijkstra] Removing duplicate code on Dijkstra." msgstr "" -msgid "" -"`#2517 `__: Astar code " -"simplification." +msgid "`#2517 `__: Astar code simplification." msgstr "" -msgid "" -"`#2521 `__: Dijkstra " -"code simplification." +msgid "`#2521 `__: Dijkstra code simplification." msgstr "" -msgid "" -"`#2522 `__: bdAstar code " -"simplification." +msgid "`#2522 `__: bdAstar code simplification." msgstr "" -msgid "" -"`#2490 `__: Automatic " -"page history links." +msgid "`#2490 `__: Automatic page history links." msgstr "" msgid "..rubric:: Standardize SQL" msgstr "" -msgid "" -"`#2555 `__: Standardize " -"deprecated messages" +msgid "`#2555 `__: Standardize deprecated messages" msgstr "" -msgid "" -"On new internal function: do not use named parameters and default parameters." +msgid "On new internal function: do not use named parameters and default parameters." msgstr "" msgid "pgRouting 3.5" @@ -16491,10 +13874,7 @@ msgstr "" msgid "pgRouting 3.5.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.5.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.5.1 `__" msgstr "" msgid "Documentation fixes" @@ -16518,22 +13898,16 @@ msgstr "" msgid "Issue fixes" msgstr "" -msgid "" -"`#2565 `__: " -"pgr_lengauerTarjanDominatorTree triggers an assertion" +msgid "`#2565 `__: pgr_lengauerTarjanDominatorTree triggers an assertion" msgstr "" msgid "SQL enhancements" msgstr "" -msgid "" -"`#2561 `__: Not use " -"wildcards on SQL" +msgid "`#2561 `__: Not use wildcards on SQL" msgstr "" -msgid "" -"`#2559 `__: pgtap test " -"using sampledata" +msgid "`#2559 `__: pgtap test using sampledata" msgstr "" msgid "Build fixes" @@ -16551,10 +13925,7 @@ msgstr "" msgid "pgRouting 3.5.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.5.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.5.0 `__" msgstr "" msgid "Dijkstra" @@ -16566,54 +13937,34 @@ msgstr "" msgid "pgRouting 3.4.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.4.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.4.2 `__" msgstr "" -msgid "" -"`#2394 `__: pgr_bdAstar " -"accumulates heuristic cost in visited node cost." +msgid "`#2394 `__: pgr_bdAstar accumulates heuristic cost in visited node cost." msgstr "" -msgid "" -"`#2427 `__: " -"pgr_createVerticesTable & pgr_createTopology, variable should be of type " -"Record." +msgid "`#2427 `__: pgr_createVerticesTable & pgr_createTopology, variable should be of type Record." msgstr "" msgid "pgRouting 3.4.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.4.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.4.1 `__" msgstr "" -msgid "" -"`#2401 `__: pgRouting " -"3.4.0 do not build docs when sphinx is too low or missing" +msgid "`#2401 `__: pgRouting 3.4.0 do not build docs when sphinx is too low or missing" msgstr "" -msgid "" -"`#2398 `__: v3.4.0 does " -"not upgrade from 3.3.3" +msgid "`#2398 `__: v3.4.0 does not upgrade from 3.3.3" msgstr "" msgid "pgRouting 3.4.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.4.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.4.0 `__" msgstr "" -msgid "" -"`#1891 `__: pgr_ksp " -"doesn't give all correct shortest path" +msgid "`#1891 `__: pgr_ksp doesn't give all correct shortest path" msgstr "" msgid "New proposed functions." @@ -16694,47 +14045,31 @@ msgstr "" msgid "pgRouting 3.3.5 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.5 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.5 `__" msgstr "" msgid "pgRouting 3.3.4 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.4 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.4 `__" msgstr "" -msgid "" -"`#2400 `__: pgRouting " -"3.3.3 does not build in focal" +msgid "`#2400 `__: pgRouting 3.3.3 does not build in focal" msgstr "" msgid "pgRouting 3.3.3 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.3 `__" msgstr "" -msgid "" -"Ignoring optional boolean parameter, as the algorithm works only for " -"undirected graphs." +msgid "Ignoring optional boolean parameter, as the algorithm works only for undirected graphs." msgstr "" msgid "pgRouting 3.3.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.2 `__" msgstr "" msgid "Revised documentation" @@ -16767,72 +14102,46 @@ msgstr "" msgid "Restructure of the pgRouting concepts page." msgstr "" -msgid "" -"`#2276 `__: " -"edgeDisjointPaths issues with start_vid and combinations" +msgid "`#2276 `__: edgeDisjointPaths issues with start_vid and combinations" msgstr "" -msgid "" -"`#2312 `__: " -"pgr_extractVertices error when target is not BIGINT" +msgid "`#2312 `__: pgr_extractVertices error when target is not BIGINT" msgstr "" -msgid "" -"`#2357 `__: Apply clang-" -"tidy performance-*" +msgid "`#2357 `__: Apply clang-tidy performance-*" msgstr "" msgid "pgRouting 3.3.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.1 `__" msgstr "" -msgid "" -"`#2216 `__: Warnings " -"when using clang" +msgid "`#2216 `__: Warnings when using clang" msgstr "" -msgid "" -"`#2266 `__: Error " -"processing restrictions" +msgid "`#2266 `__: Error processing restrictions" msgstr "" msgid "pgRouting 3.3.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.0 `__" msgstr "" -msgid "" -"`#2057 `__: trspViaEdges " -"columns in different order" +msgid "`#2057 `__: trspViaEdges columns in different order" msgstr "" -msgid "" -"`#2087 `__: " -"pgr_extractVertices to proposed" +msgid "`#2087 `__: pgr_extractVertices to proposed" msgstr "" -msgid "" -"`#2201 `__: " -"pgr_depthFirstSearch to proposed" +msgid "`#2201 `__: pgr_depthFirstSearch to proposed" msgstr "" -msgid "" -"`#2202 `__: " -"pgr_sequentialVertexColoring to proposed" +msgid "`#2202 `__: pgr_sequentialVertexColoring to proposed" msgstr "" -msgid "" -"`#2203 `__: " -"pgr_dijkstraNear and pgr_dijkstraNearCost to proposed" +msgid "`#2203 `__: pgr_dijkstraNear and pgr_dijkstraNearCost to proposed" msgstr "" msgid "Coloring" @@ -16883,42 +14192,28 @@ msgstr "" msgid "pgRouting 3.2.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.2.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.2.2 `__" msgstr "" -msgid "" -"`#2093 `__: Compilation " -"on Visual Studio" +msgid "`#2093 `__: Compilation on Visual Studio" msgstr "" -msgid "" -"`#2189 `__: Build error " -"on RHEL 7" +msgid "`#2189 `__: Build error on RHEL 7" msgstr "" msgid "pgRouting 3.2.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.2.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.2.1 `__" msgstr "" -msgid "" -"`#1883 `__: " -"pgr_TSPEuclidean crashes connection on Windows" +msgid "`#1883 `__: pgr_TSPEuclidean crashes connection on Windows" msgstr "" msgid "The solution is to use Boost::graph::metric_tsp_approx" msgstr "" -msgid "" -"To not break user's code the optional parameters related to the TSP " -"Annaeling are ignored" +msgid "To not break user's code the optional parameters related to the TSP Annaeling are ignored" msgstr "" msgid "The function with the annaeling optional parameters is deprecated" @@ -16927,15 +14222,10 @@ msgstr "" msgid "pgRouting 3.2.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.2.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.2.0 `__" msgstr "" -msgid "" -"`#1850 `__: Change Boost " -"min version to 1.56" +msgid "`#1850 `__: Change Boost min version to 1.56" msgstr "" msgid "Removing support for Boost v1.53, v1.54 & v1.55" @@ -16968,10 +14258,7 @@ msgstr "" msgid "pgRouting 3.1.4 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.1.4 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.4 `__" msgstr "" msgid "Issues fixes" @@ -16980,102 +14267,64 @@ msgstr "" msgid "pgRouting 3.1.3 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.1.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.3 `__" msgstr "" -msgid "" -"`#1825 `__: Boost " -"versions are not honored" +msgid "`#1825 `__: Boost versions are not honored" msgstr "" -msgid "" -"`#1849 `__: Boost 1.75.0 " -"geometry \"point_xy.hpp\" build error on macOS environment" +msgid "`#1849 `__: Boost 1.75.0 geometry \"point_xy.hpp\" build error on macOS environment" msgstr "" -msgid "" -"`#1861 `__: vrp " -"functions crash server" +msgid "`#1861 `__: vrp functions crash server" msgstr "" msgid "pgRouting 3.1.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.1.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.2 `__" msgstr "" -msgid "" -"`#1304 `__: FreeBSD 12 " -"64-bit crashes on pgr_vrOneDepot tests Experimental Function" +msgid "`#1304 `__: FreeBSD 12 64-bit crashes on pgr_vrOneDepot tests Experimental Function" msgstr "" -msgid "" -"`#1356 `__: tools/" -"testers/pg_prove_tests.sh fails when PostgreSQL port is not passed" +msgid "`#1356 `__: tools/testers/pg_prove_tests.sh fails when PostgreSQL port is not passed" msgstr "" -msgid "" -"`#1725 `__: Server crash " -"on pgr_pickDeliver and pgr_vrpOneDepot on openbsd" +msgid "`#1725 `__: Server crash on pgr_pickDeliver and pgr_vrpOneDepot on openbsd" msgstr "" -msgid "" -"`#1760 `__: TSP server " -"crash on ubuntu 20.04 #1760" +msgid "`#1760 `__: TSP server crash on ubuntu 20.04 #1760" msgstr "" -msgid "" -"`#1770 `__: Remove " -"warnings when using clang compiler" +msgid "`#1770 `__: Remove warnings when using clang compiler" msgstr "" msgid "pgRouting 3.1.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.1.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.1 `__" msgstr "" -msgid "" -"`#1733 `__: pgr_bdAstar " -"fails when source or target vertex does not exist in the graph" +msgid "`#1733 `__: pgr_bdAstar fails when source or target vertex does not exist in the graph" msgstr "" -msgid "" -"`#1647 `__: Linear " -"Contraction contracts self loops" +msgid "`#1647 `__: Linear Contraction contracts self loops" msgstr "" -msgid "" -"`#1640 `__: " -"pgr_withPoints fails when points_sql is empty" +msgid "`#1640 `__: pgr_withPoints fails when points_sql is empty" msgstr "" -msgid "" -"`#1616 `__: Path " -"evaluation on C++ not updated before the results go back to C" +msgid "`#1616 `__: Path evaluation on C++ not updated before the results go back to C" msgstr "" -msgid "" -"`#1300 `__: " -"pgr_chinesePostman crash on test data" +msgid "`#1300 `__: pgr_chinesePostman crash on test data" msgstr "" msgid "pgRouting 3.1.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.1.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.0 `__" msgstr "" msgid "pgr_dijkstra(combinations)" @@ -17096,19 +14345,13 @@ msgstr "" msgid "pgRouting 3.0.6 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.6 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.6 `__" msgstr "" msgid "pgRouting 3.0.5 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.5 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.5 `__" msgstr "" msgid "Backport issue fixes" @@ -17117,89 +14360,58 @@ msgstr "" msgid "pgRouting 3.0.4 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.4 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.4 `__" msgstr "" msgid "pgRouting 3.0.3 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.3 `__" msgstr "" msgid "pgRouting 3.0.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.2 `__" msgstr "" -msgid "" -"`#1378 `__: Visual " -"Studio build failing" +msgid "`#1378 `__: Visual Studio build failing" msgstr "" msgid "pgRouting 3.0.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.1 `__" msgstr "" -msgid "" -"`#232 `__: Honor client " -"cancel requests in C /C++ code" +msgid "`#232 `__: Honor client cancel requests in C /C++ code" msgstr "" msgid "pgRouting 3.0.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.0 `__" msgstr "" msgid "Fixed Issues" msgstr "" -msgid "" -"`#1153 `__: Renamed " -"pgr_eucledianTSP to pgr_TSPeuclidean" +msgid "`#1153 `__: Renamed pgr_eucledianTSP to pgr_TSPeuclidean" msgstr "" -msgid "" -"`#1188 `__: Removed CGAL " -"dependency" +msgid "`#1188 `__: Removed CGAL dependency" msgstr "" -msgid "" -"`#1002 `__: Fixed " -"contraction issues:" +msgid "`#1002 `__: Fixed contraction issues:" msgstr "" -msgid "" -"`#1004 `__: Contracts " -"when forbidden vertices do not belong to graph" +msgid "`#1004 `__: Contracts when forbidden vertices do not belong to graph" msgstr "" -msgid "" -"`#1005 `__: Intermideate " -"results eliminated" +msgid "`#1005 `__: Intermideate results eliminated" msgstr "" -msgid "" -"`#1006 `__: No loss of " -"information" +msgid "`#1006 `__: No loss of information" msgstr "" msgid "New Functions" @@ -17454,58 +14666,37 @@ msgstr "" msgid "pgRouting 2.6.3 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.6.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.3 `__" msgstr "" -msgid "" -"`#1219 `__: Implicit " -"cast for via_path integer to text" +msgid "`#1219 `__: Implicit cast for via_path integer to text" msgstr "" -msgid "" -"`#1193 `__: Fixed " -"pgr_pointsAsPolygon breaking when comparing strings in WHERE clause" +msgid "`#1193 `__: Fixed pgr_pointsAsPolygon breaking when comparing strings in WHERE clause" msgstr "" -msgid "" -"`#1185 `__: Improve " -"FindPostgreSQL.cmake" +msgid "`#1185 `__: Improve FindPostgreSQL.cmake" msgstr "" msgid "pgRouting 2.6.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.6.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.2 `__" msgstr "" -msgid "" -"`#1152 `__: Fixes " -"driving distance when vertex is not part of the graph" +msgid "`#1152 `__: Fixes driving distance when vertex is not part of the graph" msgstr "" -msgid "" -"`#1098 `__: Fixes " -"windows test" +msgid "`#1098 `__: Fixes windows test" msgstr "" -msgid "" -"`#1165 `__: Fixes build " -"for python3 and perl5" +msgid "`#1165 `__: Fixes build for python3 and perl5" msgstr "" msgid "pgRouting 2.6.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.6.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.1 `__" msgstr "" msgid "Fixes server crash on several functions." @@ -17586,18 +14777,13 @@ msgstr "" msgid "pgRouting 2.6.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.6.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.0 `__" msgstr "" msgid "pgr_lineGraphFull" msgstr "" -msgid "" -"Fix pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean[,text])" +msgid "Fix pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean[,text])" msgstr "" msgid "without restrictions" @@ -17618,9 +14804,7 @@ msgstr "" msgid "Internal code" msgstr "" -msgid "" -"Cleaned the internal code of trsp(text,integer,integer,boolean,boolean [, " -"text])" +msgid "Cleaned the internal code of trsp(text,integer,integer,boolean,boolean [, text])" msgstr "" msgid "Removed the use of pointers" @@ -17638,10 +14822,7 @@ msgstr "" msgid "pgRouting 2.5.5 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.5 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.5 `__" msgstr "" msgid "Fixes driving distance when vertex is not part of the graph" @@ -17656,33 +14837,22 @@ msgstr "" msgid "pgRouting 2.5.4 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.4 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.4 `__" msgstr "" msgid "pgRouting 2.5.3 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.3 `__" msgstr "" -msgid "" -"Fix for postgresql 11: Removed a compilation error when compiling with " -"postgreSQL" +msgid "Fix for postgresql 11: Removed a compilation error when compiling with postgreSQL" msgstr "" msgid "pgRouting 2.5.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.2 `__" msgstr "" msgid "Fix for postgresql 10.1: Removed a compiler condition" @@ -17691,10 +14861,7 @@ msgstr "" msgid "pgRouting 2.5.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.1 `__" msgstr "" msgid "Fixed prerequisite minimum version of: cmake" @@ -17703,10 +14870,7 @@ msgstr "" msgid "pgRouting 2.5.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.0 `__" msgstr "" msgid "enhancement:" @@ -17769,10 +14933,7 @@ msgstr "" msgid "pgRouting 2.4.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.4.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.4.2 `__" msgstr "" msgid "Improvement" @@ -17784,17 +14945,13 @@ msgstr "" msgid "Fixed: Unexpected error column \"cname\"" msgstr "" -msgid "" -"Replace __linux__ with __GLIBC__ for glibc-specific headers and functions" +msgid "Replace __linux__ with __GLIBC__ for glibc-specific headers and functions" msgstr "" msgid "pgRouting 2.4.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.4.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.4.1 `__" msgstr "" msgid "Fixed compiling error on macOS" @@ -17806,10 +14963,7 @@ msgstr "" msgid "pgRouting 2.4.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.4.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.4.0 `__" msgstr "" msgid "Deprecated signatures." @@ -17836,10 +14990,7 @@ msgstr "" msgid "pgRouting 2.3.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.3.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.3.2 `__" msgstr "" msgid "Fixed pgr_gsoc_vrppdtw crash when all orders fit on one truck." @@ -17857,10 +15008,7 @@ msgstr "" msgid "pgRouting 2.3.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.3.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.3.1 `__" msgstr "" msgid "Leaks on proposed max_flow functions" @@ -17875,10 +15023,7 @@ msgstr "" msgid "pgRouting 2.3.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.3.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.3.0 `__" msgstr "" msgid "pgr_eucledianTSP" @@ -17950,10 +15095,7 @@ msgstr "" msgid "pgRouting 2.2.4 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.2.4 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.4 `__" msgstr "" msgid "Bogus uses of extern \"C\"" @@ -17968,10 +15110,7 @@ msgstr "" msgid "pgRouting 2.2.3 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.2.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.3 `__" msgstr "" msgid "Fixed compatibility issues with PostgreSQL 9.6." @@ -17980,10 +15119,7 @@ msgstr "" msgid "pgRouting 2.2.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.2.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.2 `__" msgstr "" msgid "Fixed regression error on pgr_drivingDistance" @@ -17992,10 +15128,7 @@ msgstr "" msgid "pgRouting 2.2.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.2.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.1 `__" msgstr "" msgid "Server crash fix on pgr_alphaShape" @@ -18007,10 +15140,7 @@ msgstr "" msgid "pgRouting 2.2.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.2.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.0 `__" msgstr "" msgid "Improvements" @@ -18100,10 +15230,7 @@ msgstr "" msgid "pgRouting 2.1.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.1.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.1.0 `__" msgstr "" msgid "Refactored" @@ -18112,40 +15239,28 @@ msgstr "" msgid "pgr_dijkstra(One to One)" msgstr "" -msgid "" -"pgr_alphaShape function now can generate better (multi)polygon with holes " -"and alpha parameter." +msgid "pgr_alphaShape function now can generate better (multi)polygon with holes and alpha parameter." msgstr "" -msgid "" -"Proposed functions from Steve Woodbridge, (Classified as Convenience by the " -"author.)" +msgid "Proposed functions from Steve Woodbridge, (Classified as Convenience by the author.)" msgstr "" -msgid "" -"pgr_pointToEdgeNode - convert a point geometry to a vertex_id based on " -"closest edge." +msgid "pgr_pointToEdgeNode - convert a point geometry to a vertex_id based on closest edge." msgstr "" -msgid "" -"pgr_flipEdges - flip the edges in an array of geometries so the connect end " -"to end." +msgid "pgr_flipEdges - flip the edges in an array of geometries so the connect end to end." msgstr "" -msgid "" -"pgr_textToPoints - convert a string of x,y;x,y;... locations into point " -"geometries." +msgid "pgr_textToPoints - convert a string of x,y;x,y;... locations into point geometries." msgstr "" -msgid "" -"pgr_pointsToVids - convert an array of point geometries into vertex ids." +msgid "pgr_pointsToVids - convert an array of point geometries into vertex ids." msgstr "" msgid "pgr_pointsToDMatrix - Create a distance matrix from an array of points." msgstr "" -msgid "" -"pgr_vidsToDMatrix - Create a distance matrix from an array of vertix_id." +msgid "pgr_vidsToDMatrix - Create a distance matrix from an array of vertix_id." msgstr "" msgid "Added proposed functions from GSoc Projects:" @@ -18217,9 +15332,7 @@ msgstr "" msgid "allow any-numerical on the cost/reverse_cost columns" msgstr "" -msgid "" -"Instead of generating many libraries: - All functions are encapsulated in " -"one library - The library has the prefix 2-1-0" +msgid "Instead of generating many libraries: - All functions are encapsulated in one library - The library has the prefix 2-1-0" msgstr "" msgid "pgRouting 2.0" @@ -18228,10 +15341,7 @@ msgstr "" msgid "pgRouting 2.0.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.0.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.0.1 `__" msgstr "" msgid "Minor bug fixes." @@ -18243,16 +15353,10 @@ msgstr "" msgid "pgRouting 2.0.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.0.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.0.0 `__" msgstr "" -msgid "" -"With the release of pgRouting 2.0.0 the library has abandoned backwards " -"compatibility to `pgRouting 1.0`_ releases. The main Goals for this release " -"are:" +msgid "With the release of pgRouting 2.0.0 the library has abandoned backwards compatibility to `pgRouting 1.0`_ releases. The main Goals for this release are:" msgstr "" msgid "Major restructuring of pgRouting." @@ -18285,21 +15389,16 @@ msgstr "" msgid "Important Changes" msgstr "" -msgid "" -"Graph Analytics - tools for detecting and fixing connection some problems in " -"a graph" +msgid "Graph Analytics - tools for detecting and fixing connection some problems in a graph" msgstr "" msgid "A collection of useful utility functions" msgstr "" -msgid "" -"Two new All Pairs Short Path algorithms (pgr_apspJohnson, pgr_apspWarshall)" +msgid "Two new All Pairs Short Path algorithms (pgr_apspJohnson, pgr_apspWarshall)" msgstr "" -msgid "" -"Bi-directional Dijkstra and A-star search algorithms (pgr_bdAstar, " -"pgr_bdDijkstra)" +msgid "Bi-directional Dijkstra and A-star search algorithms (pgr_bdAstar, pgr_bdDijkstra)" msgstr "" msgid "One to many nodes search (pgr_kDijkstra)" @@ -18308,9 +15407,7 @@ msgstr "" msgid "K alternate paths shortest path (pgr_ksp)" msgstr "" -msgid "" -"New TSP solver that simplifies the code and the build process (pgr_tsp), " -"dropped \"Gaul Library\" dependency" +msgid "New TSP solver that simplifies the code and the build process (pgr_tsp), dropped \"Gaul Library\" dependency" msgstr "" msgid "Turn Restricted shortest path (pgr_trsp) that replaces Shooting Star" @@ -18319,21 +15416,16 @@ msgstr "" msgid "Dropped support for Shooting Star" msgstr "" -msgid "" -"Built a test infrastructure that is run before major code changes are " -"checked in" +msgid "Built a test infrastructure that is run before major code changes are checked in" msgstr "" -msgid "" -"Tested and fixed most all of the outstanding bugs reported against 1.x that " -"existing in the 2.0-dev code base." +msgid "Tested and fixed most all of the outstanding bugs reported against 1.x that existing in the 2.0-dev code base." msgstr "" msgid "Improved build process for Windows" msgstr "" -msgid "" -"Automated testing on Linux and Windows platforms trigger by every commit" +msgid "Automated testing on Linux and Windows platforms trigger by every commit" msgstr "" msgid "Modular library design" @@ -18372,11 +15464,7 @@ msgstr "" msgid "pgRouting 1.0" msgstr "" -msgid "" -"To see the issues closed by this release see the `Git closed issues for 1.x " -"`_ on Github. The following release notes have been copied " -"from the previous ``RELEASE_NOTES`` file and are kept as a reference." +msgid "To see the issues closed by this release see the `Git closed issues for 1.x `_ on Github. The following release notes have been copied from the previous ``RELEASE_NOTES`` file and are kept as a reference." msgstr "" msgid "Changes for release 1.05" @@ -18430,8 +15518,7 @@ msgstr "" msgid "PostgreSQL 8.2 support" msgstr "" -msgid "" -"Shortest path functions return empty result if they could not find any path" +msgid "Shortest path functions return empty result if they could not find any path" msgstr "" msgid "Changes for release 0.9.8" @@ -18452,10 +15539,7 @@ msgstr "" msgid "Sample Data" msgstr "" -msgid "" -"The documentation provides very simple example queries based on a small " -"sample network that resembles a city. To be able to execute the majority of " -"the examples queries, follow the instructions below." +msgid "The documentation provides very simple example queries based on a small sample network that resembles a city. To be able to execute the majority of the examples queries, follow the instructions below." msgstr "" msgid "Main graph" @@ -18467,22 +15551,13 @@ msgstr "" msgid "The following city is to be inserted into the database:" msgstr "" -msgid "" -"Information known at this point is the geometry of the edges, cost values, " -"capacity values, category values and some locations that are not in the " -"graph." +msgid "Information known at this point is the geometry of the edges, cost values, capacity values, category values and some locations that are not in the graph." msgstr "" -msgid "" -"The process to have working topology starts by inserting the edges. After " -"that everything else is calculated." +msgid "The process to have working topology starts by inserting the edges. After that everything else is calculated." msgstr "" -msgid "" -"The database design for the documentation of pgRouting, keeps in the same " -"row 2 segments, one in the direction of the geometry and the second in the " -"opposite direction. Therefore some information has the ``reverse_`` prefix " -"which corresponds to the segment on the opposite direction of the geometry." +msgid "The database design for the documentation of pgRouting, keeps in the same row 2 segments, one in the direction of the geometry and the second in the opposite direction. Therefore some information has the ``reverse_`` prefix which corresponds to the segment on the opposite direction of the geometry." msgstr "" msgid "Identifier of the starting vertex of the geometry ``geom``." @@ -18512,17 +15587,13 @@ msgstr "" msgid ":math:`x` coordinate of the starting vertex of the geometry." msgstr "" -msgid "" -"For convenience it is saved on the table but can be calculated as " -"``ST_X(ST_StartPoint(geom))``." +msgid "For convenience it is saved on the table but can be calculated as ``ST_X(ST_StartPoint(geom))``." msgstr "" msgid ":math:`y` coordinate of the ending vertex of the geometry." msgstr "" -msgid "" -"For convenience it is saved on the table but can be calculated as " -"``ST_Y(ST_EndPoint(geom))``." +msgid "For convenience it is saved on the table but can be calculated as ``ST_Y(ST_EndPoint(geom))``." msgstr "" msgid "The geometry of the segments." @@ -18531,21 +15602,16 @@ msgstr "" msgid "Starting on PostgreSQL 12::" msgstr "" -msgid "" -"Optionally indexes on different columns can be created. The recommendation " -"is to have" +msgid "Optionally indexes on different columns can be created. The recommendation is to have" msgstr "" msgid "``id`` indexed." msgstr "" -msgid "" -"``source`` and ``target`` columns indexed to speed up pgRouting queries." +msgid "``source`` and ``target`` columns indexed to speed up pgRouting queries." msgstr "" -msgid "" -"``geom`` indexed to speed up geometry processes that might be needed in the " -"front end." +msgid "``geom`` indexed to speed up geometry processes that might be needed in the front end." msgstr "" msgid "For this small example the indexes are skipped, except for ``id``" @@ -18557,23 +15623,16 @@ msgstr "" msgid "Inserting into the database the information of the edges:" msgstr "" -msgid "" -"Negative values on the cost, capacity and category means that the edge do " -"not exist." +msgid "Negative values on the cost, capacity and category means that the edge do not exist." msgstr "" msgid "Vertices" msgstr "" -msgid "" -"The vertex information is calculated based on the identifier of the edge and " -"the geometry and saved on a table. Saving all the information provided by :" -"doc:`pgr_extractVertices`:" +msgid "The vertex information is calculated based on the identifier of the edge and the geometry and saved on a table. Saving all the information provided by :doc:`pgr_extractVertices`:" msgstr "" -msgid "" -"In this case the because the ``CREATE`` statement was not used, the " -"definition of an index on the table is needed." +msgid "In this case the because the ``CREATE`` statement was not used, the definition of an index on the table is needed." msgstr "" msgid "The structure of the table is:" @@ -18585,17 +15644,13 @@ msgstr "" msgid "The saved information of the vertices is:" msgstr "" -msgid "" -"Here is where adding more columns to the vertices table can be done. " -"Additional columns names and types will depend on the application." +msgid "Here is where adding more columns to the vertices table can be done. Additional columns names and types will depend on the application." msgstr "" msgid "The topology" msgstr "" -msgid "" -"This queries based on the vertices data create a topology by filling the " -"``source`` and ``target`` columns in the edges table." +msgid "This queries based on the vertices data create a topology by filling the ``source`` and ``target`` columns in the edges table." msgstr "" msgid "Topology data" @@ -18607,14 +15662,10 @@ msgstr "" msgid "Support tables" msgstr "" -msgid "" -"Many functions can be used with a combinations of ``(source, target)`` pairs " -"when wanting a route from ``source`` to ``target``." +msgid "Many functions can be used with a combinations of ``(source, target)`` pairs when wanting a route from ``source`` to ``target``." msgstr "" -msgid "" -"For convenience of this documentation, some combinations will be stored on a " -"table:" +msgid "For convenience of this documentation, some combinations will be stored on a table:" msgstr "" msgid "Inserting the data:" @@ -18644,9 +15695,7 @@ msgstr "" msgid "Directed graph with ``cost`` and ``reverse_cost``" msgstr "" -msgid "" -"When working with city networks, this is recommended for point of view of " -"vehicles." +msgid "When working with city networks, this is recommended for point of view of vehicles." msgstr "" msgid "Directed, with cost and reverse_cost" @@ -18655,9 +15704,7 @@ msgstr "" msgid "Undirected graph with ``cost`` and ``reverse_cost``" msgstr "" -msgid "" -"When working with city networks, this is recommended for point of view of " -"pedestrians." +msgid "When working with city networks, this is recommended for point of view of pedestrians." msgstr "" msgid "Undirected, with cost and reverse cost" @@ -18681,111 +15728,70 @@ msgstr "" msgid "Spanning Tree - Category" msgstr "" -msgid "" -"A spanning tree of an undirected graph is a tree that includes all the " -"vertices of G with the minimum possible number of edges." +msgid "A spanning tree of an undirected graph is a tree that includes all the vertices of G with the minimum possible number of edges." msgstr "" -msgid "" -"For a disconnected graph, there there is no single tree, but a spanning " -"forest, consisting of a spanning tree of each connected component." +msgid "For a disconnected graph, there there is no single tree, but a spanning forest, consisting of a spanning tree of each connected component." msgstr "" msgid "Characteristics:" msgstr "" -msgid "" -"pgRouting community support is available through the `pgRouting website " -"`_, `documentation `_, tutorials, mailing lists and others. If you’re looking " -"for :ref:`commercial support `, find below a list of " -"companies providing pgRouting development and consulting services." +msgid "pgRouting community support is available through the `pgRouting website `_, `documentation `_, tutorials, mailing lists and others. If you’re looking for :ref:`commercial support `, find below a list of companies providing pgRouting development and consulting services." msgstr "" msgid "Reporting Problems" msgstr "" -msgid "" -"Bugs are reported and managed in an `issue tracker `_. Please follow these steps:" +msgid "Bugs are reported and managed in an `issue tracker `_. Please follow these steps:" msgstr "" -msgid "" -"Search the tickets to see if your problem has already been reported. If so, " -"add any extra context you might have found, or at least indicate that you " -"too are having the problem. This will help us prioritize common issues." +msgid "Search the tickets to see if your problem has already been reported. If so, add any extra context you might have found, or at least indicate that you too are having the problem. This will help us prioritize common issues." msgstr "" -msgid "" -"If your problem is unreported, create a `new issue `__ for it." +msgid "If your problem is unreported, create a `new issue `__ for it." msgstr "" -msgid "" -"In your report include explicit instructions to replicate your issue. The " -"best tickets include the exact SQL necessary to replicate a problem." +msgid "In your report include explicit instructions to replicate your issue. The best tickets include the exact SQL necessary to replicate a problem." msgstr "" -msgid "" -"If you can test older versions of PostGIS for your problem, please do. On " -"your ticket, note the earliest version the problem appears." +msgid "If you can test older versions of PostGIS for your problem, please do. On your ticket, note the earliest version the problem appears." msgstr "" -msgid "" -"For the versions where you can replicate the problem, note the operating " -"system and version of pgRouting, PostGIS and PostgreSQL." +msgid "For the versions where you can replicate the problem, note the operating system and version of pgRouting, PostGIS and PostgreSQL." msgstr "" -msgid "" -"It is recommended to use the following wrapper on the problem to pin point " -"the step that is causing the problem." +msgid "It is recommended to use the following wrapper on the problem to pin point the step that is causing the problem." msgstr "" msgid "Mailing List, Matrix, GIS StackExchange" msgstr "" -msgid "" -"There are two mailing lists for pgRouting hosted on OSGeo discourse server:" +msgid "There are two mailing lists for pgRouting hosted on OSGeo discourse server:" msgstr "" -msgid "" -"User mailing list: https://discourse.osgeo.org/c/pgrouting/pgrouting-users/" +msgid "User mailing list: https://discourse.osgeo.org/c/pgrouting/pgrouting-users/" msgstr "" -msgid "" -"Developer mailing list: https://discourse.osgeo.org/c/pgrouting/pgrouting-" -"dev/" +msgid "Developer mailing list: https://discourse.osgeo.org/c/pgrouting/pgrouting-dev/" msgstr "" msgid "Subscribe: https://discourse.osgeo.org/g/pgrouting-dev" msgstr "" -msgid "" -"For general questions and topics about how to use pgRouting, please write to " -"the user mailing list." +msgid "For general questions and topics about how to use pgRouting, please write to the user mailing list." msgstr "" -msgid "" -"If you want to chat with fellow pgRouting users and contributors, you can " -"join our matrix channel: `pgRouting matrix channel `_." +msgid "If you want to chat with fellow pgRouting users and contributors, you can join our matrix channel: `pgRouting matrix channel `_." msgstr "" -msgid "" -"You can also ask at `GIS StackExchange `_ " -"and tag the question with ``pgrouting``. Find all questions tagged with " -"``pgrouting`` under https://gis.stackexchange.com/questions/tagged/pgrouting " -"or subscribe to the `pgRouting questions feed `_." +msgid "You can also ask at `GIS StackExchange `_ and tag the question with ``pgrouting``. Find all questions tagged with ``pgrouting`` under https://gis.stackexchange.com/questions/tagged/pgrouting or subscribe to the `pgRouting questions feed `_." msgstr "" msgid "Commercial Support" msgstr "" -msgid "" -"For users who require professional support, development and consulting " -"services, consider contacting any of the following organizations, which have " -"significantly contributed to the development of pgRouting:" +msgid "For users who require professional support, development and consulting services, consider contacting any of the following organizations, which have significantly contributed to the development of pgRouting:" msgstr "" msgid "**Company**" @@ -18821,9 +15827,7 @@ msgstr "" msgid "Transformation - Family of functions" msgstr "" -msgid "" -"This family of functions is used for transforming a given input graph :math:" -"`G(V,E)` into a new graph :math:`G'(V',E')`." +msgid "This family of functions is used for transforming a given input graph :math:`G(V,E)` into a new graph :math:`G'(V',E')`." msgstr "" msgid "Traversal - Family of functions" @@ -18838,14 +15842,10 @@ msgstr "" msgid "This category intends to solve the general problem:" msgstr "" -msgid "" -"Given a graph and a list of vertices, find the shortest path between :math:" -"`vertex_i` and :math:`vertex_{i+1}` for all vertices" +msgid "Given a graph and a list of vertices, find the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all vertices" msgstr "" -msgid "" -"In other words, find a continuous route that visits all the vertices in the " -"order given." +msgid "In other words, find a continuous route that visits all the vertices in the order given." msgstr "" msgid "path" @@ -18863,9 +15863,7 @@ msgstr "" msgid "**Used in:**" msgstr "" -msgid "" -"Besides the compulsory parameters each function has, there are optional " -"parameters that exist due to the kind of function." +msgid "Besides the compulsory parameters each function has, there are optional parameters that exist due to the kind of function." msgstr "" msgid "Used in all Via functions" @@ -18880,32 +15878,19 @@ msgstr "" msgid "When points are added to the graph." msgstr "" -msgid "" -"The **with points** category modifies the graph on the fly by adding points " -"on edges as required by the `Points SQL`_ query." +msgid "The **with points** category modifies the graph on the fly by adding points on edges as required by the `Points SQL`_ query." msgstr "" -msgid "" -"The functions within this category give the ability to process between " -"arbitrary points located outside the original graph." +msgid "The functions within this category give the ability to process between arbitrary points located outside the original graph." msgstr "" -msgid "" -"This category of functions was thought for routing vehicles, but might as " -"well work for some other application not involving vehicles." +msgid "This category of functions was thought for routing vehicles, but might as well work for some other application not involving vehicles." msgstr "" -msgid "" -"When given a point identifier ``pid`` that its being mapped to an edge with " -"an identifier ``edge_id``, with a fraction from the source to the target " -"along the edge ``fraction`` and some additional information about which side " -"of the edge the point is on ``side``, then processing from arbitrary points " -"can be done on fixed networks." +msgid "When given a point identifier ``pid`` that its being mapped to an edge with an identifier ``edge_id``, with a fraction from the source to the target along the edge ``fraction`` and some additional information about which side of the edge the point is on ``side``, then processing from arbitrary points can be done on fixed networks." msgstr "" -msgid "" -"All this functions consider as many traits from the \"real world\" as " -"possible:" +msgid "All this functions consider as many traits from the \"real world\" as possible:" msgstr "" msgid "Kind of graph:" @@ -18920,8 +15905,7 @@ msgstr "" msgid "Arriving at the point:" msgstr "" -msgid "" -"Compulsory arrival on the side of the segment where the point is located." +msgid "Compulsory arrival on the side of the segment where the point is located." msgstr "" msgid "On either side of the segment." @@ -18939,13 +15923,10 @@ msgstr "" msgid "Some points are:" msgstr "" -msgid "" -"**Permanent**: for example the set of points of clients stored in a table in " -"the data base." +msgid "**Permanent**: for example the set of points of clients stored in a table in the data base." msgstr "" -msgid "" -"The graph has been modified to permanently have those points as vertices." +msgid "The graph has been modified to permanently have those points as vertices." msgstr "" msgid "There is a table on the database that describes the points" @@ -18957,9 +15938,7 @@ msgstr "" msgid "The numbering of the points are handled with negative sign." msgstr "" -msgid "" -"This sign change is to avoid confusion when there is a vertex with the same " -"identifier as the point identifier." +msgid "This sign change is to avoid confusion when there is a vertex with the same identifier as the point identifier." msgstr "" msgid "Original point identifiers are to be positive." @@ -18980,10 +15959,7 @@ msgstr "" msgid "About points" msgstr "" -msgid "" -"For this section the following city (see :doc:`sampledata`) some interesting " -"points such as restaurant, supermarket, post office, etc. will be used as " -"example." +msgid "For this section the following city (see :doc:`sampledata`) some interesting points such as restaurant, supermarket, post office, etc. will be used as example." msgstr "" msgid "The graph is **directed**" @@ -18995,9 +15971,7 @@ msgstr "" msgid "Blue arrows show the ``(target, source)`` of the edge on the edge table" msgstr "" -msgid "" -"Each point location shows where it is located with relation of the edge " -"``(source, target)``" +msgid "Each point location shows where it is located with relation of the edge ``(source, target)``" msgstr "" msgid "On the right for points **2** and **4**." @@ -19009,9 +15983,7 @@ msgstr "" msgid "On both sides for point **6**." msgstr "" -msgid "" -"The representation on the data base follows the `Points SQL`_ description, " -"and for this example:" +msgid "The representation on the data base follows the `Points SQL`_ description, and for this example:" msgstr "" msgid "Driving side" @@ -19026,9 +15998,7 @@ msgstr "" msgid "The temporary vertices are added according to the driving side," msgstr "" -msgid "" -"visually showing the differences on how depending on the driving side the " -"data is interpreted." +msgid "visually showing the differences on how depending on the driving side the data is interpreted." msgstr "" msgid "Point **1** located on edge ``(6, 5)``" @@ -19079,9 +16049,7 @@ msgstr "" msgid "Creating temporary vertices" msgstr "" -msgid "" -"This section will demonstrate how a temporary vertex is created internally " -"on the graph." +msgid "This section will demonstrate how a temporary vertex is created internally on the graph." msgstr "" msgid "Problem" @@ -19108,9 +16076,7 @@ msgstr "" msgid "Create two new edges:" msgstr "" -msgid "" -"Edge ``(16, -2)`` with cost ``0.4`` (original cost * fraction == :math:`1 * " -"0.4`)" +msgid "Edge ``(16, -2)`` with cost ``0.4`` (original cost * fraction == :math:`1 * 0.4`)" msgstr "" msgid "Edge ``(-2, 17)`` with cost ``0.6`` (the remaining cost)" @@ -19119,8 +16085,7 @@ msgstr "" msgid "The total cost of the additional edges is equal to the original cost." msgstr "" -msgid "" -"If more points are on the same edge, the process is repeated recursevly." +msgid "If more points are on the same edge, the process is repeated recursevly." msgstr "" msgid "On a left hand side driving network" @@ -19135,22 +16100,16 @@ msgstr "" msgid "It only affects the edge ``(17, 16)``, therefore the edge is removed." msgstr "" -msgid "" -"Work with the original edge ``(16, 17)`` as the fraction is a fraction of " -"the original:" +msgid "Work with the original edge ``(16, 17)`` as the fraction is a fraction of the original:" msgstr "" msgid "Flip the Edges and add them to the graph:" msgstr "" -msgid "" -"Edge ``(17, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the " -"graph." +msgid "Edge ``(17, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the graph." msgstr "" -msgid "" -"Edge ``(-2, 16)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the " -"graph." +msgid "Edge ``(-2, 16)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the graph." msgstr "" msgid "When driving side does not matter" @@ -19159,9 +16118,7 @@ msgstr "" msgid "Arrival to point ``-2`` can be achieved via vertices **16** or **17**." msgstr "" -msgid "" -"Affects the edges ``(16, 17)`` and ``(17, 16)``, therefore the edges are " -"removed." +msgid "Affects the edges ``(16, 17)`` and ``(17, 16)``, therefore the edges are removed." msgstr "" msgid "Create four new edges:" @@ -19176,23 +16133,16 @@ msgstr "" msgid "Edge ``(-2, 17)`` is added to the graph." msgstr "" -msgid "" -"Edge ``(16, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the " -"graph." +msgid "Edge ``(16, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the graph." msgstr "" -msgid "" -"Edge ``(-2, 17)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the " -"graph." +msgid "Edge ``(-2, 17)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the graph." msgstr "" msgid "withPoints - Family of functions" msgstr "" -msgid "" -"This family of functions belongs to the :doc:`withPoints-category` and the " -"functions that compose them are based one way or another on dijkstra " -"algorithm." +msgid "This family of functions belongs to the :doc:`withPoints-category` and the functions that compose them are based one way or another on dijkstra algorithm." msgstr "" msgid "Depending on the name:" diff --git a/locale/es/LC_MESSAGES/pgrouting_doc_strings.po b/locale/es/LC_MESSAGES/pgrouting_doc_strings.po index 0cb5d49608..b2fc1989ea 100644 --- a/locale/es/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/es/LC_MESSAGES/pgrouting_doc_strings.po @@ -7,7 +7,20 @@ # Celia Virginia Vergara Castillo , 2023, 2024, 2025. # DeepL , 2024, 2025. msgid "" -msgstr "Project-Id-Version: pgRouting v4.1\nReport-Msgid-Bugs-To: \nPOT-Creation-Date: 2025-10-08 19:15+0000\nPO-Revision-Date: 2025-10-10 21:42+0000\nLast-Translator: Celia Virginia Vergara Castillo \nLanguage-Team: Spanish \nLanguage: es\nMIME-Version: 1.0\nContent-Type: text/plain; charset=UTF-8\nContent-Transfer-Encoding: 8bit\nPlural-Forms: nplurals=2; plural=n != 1;\nX-Generator: Weblate 5.4.3\nGenerated-By: Babel 2.10.3\n" +msgstr "" +"Project-Id-Version: pgRouting v4.1\n" +"Report-Msgid-Bugs-To: \n" +"POT-Creation-Date: 2025-12-05 23:37+0000\n" +"PO-Revision-Date: 2025-10-10 21:42+0000\n" +"Last-Translator: Celia Virginia Vergara Castillo \n" +"Language-Team: Spanish \n" +"Language: es\n" +"MIME-Version: 1.0\n" +"Content-Type: text/plain; charset=UTF-8\n" +"Content-Transfer-Encoding: 8bit\n" +"Plural-Forms: nplurals=2; plural=n != 1;\n" +"X-Generator: Weblate 5.4.3\n" +"Generated-By: Babel 2.10.3\n" msgid "BFS - Category" msgstr "BFS - Categoría" @@ -72,12 +85,8 @@ msgstr "``BIGINT``" msgid "Identifier of the root vertex of the tree." msgstr "Identificador del vértice raíz del árbol." -msgid "" -"When value is :math:`0` then gets the spanning forest starting in aleatory " -"nodes for each tree in the forest." -msgstr "" -"Cuando el valor es :math:`0` se obtiene el bosque de expansión que comienza " -"en nodos aleatorios para cada árbol del bosque." +msgid "When value is :math:`0` then gets the spanning forest starting in aleatory nodes for each tree in the forest." +msgstr "Cuando el valor es :math:`0` se obtiene el bosque de expansión que comienza en nodos aleatorios para cada árbol del bosque." msgid "**root vids**" msgstr "**raices**" @@ -175,12 +184,8 @@ msgstr "-1" msgid "Weight of the edge (``target``, ``source``)" msgstr "Peso de la arista (``target``, ``source``)" -msgid "" -"When negative: edge (``target``, ``source``) does not exist, therefore it's " -"not part of the graph." -msgstr "" -"Cuando negativo: la arista (``target``, ``source``) no existe, por lo tanto " -"no es parte del grafo." +msgid "When negative: edge (``target``, ``source``) does not exist, therefore it's not part of the graph." +msgstr "Cuando negativo: la arista (``target``, ``source``) no existe, por lo tanto no es parte del grafo." msgid "``SMALLINT``, ``INTEGER``, ``BIGINT``" msgstr "``SMALLINT``, ``INTEGER``, ``BIGINT``" @@ -195,9 +200,7 @@ msgid "Result columns" msgstr "Columnas de resultados" msgid "Returns set of ``(seq, depth, start_vid, node, edge, cost, agg_cost)``" -msgstr "" -"Devuelve el conjunto de ``(seq, depth, start_vid, node, edge, cost, " -"agg_cost)``" +msgstr "Devuelve el conjunto de ``(seq, depth, start_vid, node, edge, cost, agg_cost)``" msgid "``seq``" msgstr "``seq``" @@ -250,33 +253,17 @@ msgstr "Costo agregado desde ``start_vid`` hasta ``node``." msgid "See Also" msgstr "Ver también" -msgid "" -"`Boost: Prim's algorithm `__" -msgstr "" -"`Boost: Algoritmo de Prim `__" +msgid "`Boost: Prim's algorithm `__" +msgstr "`Boost: Algoritmo de Prim `__" -msgid "" -"`Boost: Kruskal's algorithm `__" -msgstr "" -"`Boost: algoritmo de Kruskal `__" +msgid "`Boost: Kruskal's algorithm `__" +msgstr "`Boost: algoritmo de Kruskal `__" -msgid "" -"`Wikipedia: Prim's algorithm `__" -msgstr "" -"`Wikipedia: algoritmo de Prim `__" +msgid "`Wikipedia: Prim's algorithm `__" +msgstr "`Wikipedia: algoritmo de Prim `__" -msgid "" -"`Wikipedia: Kruskal's algorithm `__" -msgstr "" -"`Wikipedia: algoritmo de Kruskal `__" +msgid "`Wikipedia: Kruskal's algorithm `__" +msgstr "`Wikipedia: algoritmo de Kruskal `__" msgid "Indices and tables" msgstr "Índices y tablas" @@ -320,10 +307,8 @@ msgstr "Se han hecho pruebas con pgTap. Pero tal vez se necesiten más." msgid "Documentation might need refinement." msgstr "Es posible que la documentación necesite un refinamiento." -msgid "" -":doc:`pgr_depthFirstSearch` - Depth first search traversal of the graph." -msgstr "" -":doc:`pgr_depthFirstSearch` - Recorrido de búsqueda en profundidad del grafo." +msgid ":doc:`pgr_depthFirstSearch` - Depth first search traversal of the graph." +msgstr ":doc:`pgr_depthFirstSearch` - Recorrido de búsqueda en profundidad del grafo." msgid "In general:" msgstr "En general:" @@ -352,10 +337,8 @@ msgstr ":doc:`pgr_trspVia` - Ruteo Via Vértices con restricciones." msgid ":doc:`pgr_trsp_withPoints` - Vertex/Point routing with restrictions." msgstr ":doc:`pgr_trsp_withPoints` - Ruteo de Punto/Vértice con restricciones." -msgid "" -":doc:`pgr_trspVia_withPoints` - Via Vertex/point routing with restrictions." -msgstr "" -":doc:`pgr_trspVia_withPoints` - Ruteo Vía Punto/Vértice con restricciones." +msgid ":doc:`pgr_trspVia_withPoints` - Via Vertex/point routing with restrictions." +msgstr ":doc:`pgr_trspVia_withPoints` - Ruteo Vía Punto/Vértice con restricciones." msgid "Experimental" msgstr "Experimental" @@ -399,31 +382,14 @@ msgstr ":doc:`pgr_turnRestrictedPath` - Ruteo con restricciones." msgid "Introduction" msgstr "Introducción" -msgid "" -"Road restrictions are a sequence of road segments that can not be taken in a " -"sequential manner. Some restrictions are implicit on a directed graph, for " -"example, one way roads where the wrong way edge is not even inserted on the " -"graph. But normally on turns like no left turn or no right turn, hence the " -"name turn restrictions, there are sometimes restrictions." -msgstr "" -"Las restricciones viales son una secuencia de tramos viales que no se pueden " -"tomar de manera secuencial. Algunas restricciones están implícitas en un " -"grafo dirigido, por ejemplo, caminos de un solo sentido donde el sentido " -"contrario ni siquiera se inserta en el grafo. Pero normalmente en giros como " -"prohibido vuelta a la izquierda o a la derecha, de ahí el nombre de " -"restricciones de giro, a veces hay restricciones." +msgid "Road restrictions are a sequence of road segments that can not be taken in a sequential manner. Some restrictions are implicit on a directed graph, for example, one way roads where the wrong way edge is not even inserted on the graph. But normally on turns like no left turn or no right turn, hence the name turn restrictions, there are sometimes restrictions." +msgstr "Las restricciones viales son una secuencia de tramos viales que no se pueden tomar de manera secuencial. Algunas restricciones están implícitas en un grafo dirigido, por ejemplo, caminos de un solo sentido donde el sentido contrario ni siquiera se inserta en el grafo. Pero normalmente en giros como prohibido vuelta a la izquierda o a la derecha, de ahí el nombre de restricciones de giro, a veces hay restricciones." msgid "TRSP algorithm" msgstr "Algoritmo TRSP" -msgid "" -"The internal TRSP algorithm performs a lookahead over the dijkstra algorithm " -"in order to find out if the attempted path has a restriction. This allows " -"the algorithm to pass twice on the same vertex." -msgstr "" -"Wl algoritmo interno TRSP realiza una búsqueda de avanzada sobre el " -"algoritmo de Dijkstra para encontrar un camino que contenga una restricción. " -"Esto permite que el algoritmo pase dos veces sobre el mismo vértice." +msgid "The internal TRSP algorithm performs a lookahead over the dijkstra algorithm in order to find out if the attempted path has a restriction. This allows the algorithm to pass twice on the same vertex." +msgstr "Wl algoritmo interno TRSP realiza una búsqueda de avanzada sobre el algoritmo de Dijkstra para encontrar un camino que contenga una restricción. Esto permite que el algoritmo pase dos veces sobre el mismo vértice." msgid "`Edges SQL`_ query as described." msgstr "`SQL de aristas`_ como se describen." @@ -446,19 +412,11 @@ msgstr "Arreglo ordenado de identificadores de vértices que serán visitados." msgid "Restrictions" msgstr "Restricciones" -msgid "" -"On road networks, there are restrictions such as left or right turn " -"restrictions, no U turn restrictions." -msgstr "" -"En redes de caminos, hay restricciones como vuelta a la izquierda o derecha, " -"no vuelta en U." +msgid "On road networks, there are restrictions such as left or right turn restrictions, no U turn restrictions." +msgstr "En redes de caminos, hay restricciones como vuelta a la izquierda o derecha, no vuelta en U." -msgid "" -"A restriction is a sequence of edges, called path and that path is to be " -"avoided." -msgstr "" -"Una restricción es una secuencia de aristas, llamado trayectoria y esa " -"trayectoria se debe evitar." +msgid "A restriction is a sequence of edges, called path and that path is to be avoided." +msgstr "Una restricción es una secuencia de aristas, llamado trayectoria y esa trayectoria se debe evitar." msgid "**Restrictions on the road network**" msgstr "**Restricciones en la red de calles**" @@ -466,10 +424,7 @@ msgstr "**Restricciones en la red de calles**" msgid "These restrictions are represented on a table as follows:" msgstr "Éstas restricciones son representadas en la siguiente tabla:" -msgid "" -"The table has an identifier, which maybe is needed for the administration of " -"the restrictions, but the algorithms do not need that information. If given " -"it will be ignored." +msgid "The table has an identifier, which maybe is needed for the administration of the restrictions, but the algorithms do not need that information. If given it will be ignored." msgstr "La tabla tiene un identificador, el cual pueda ser necesario para la administración de las restricciones, pero el algoritmo no necesita esa información. Si se le da, será ignorada." msgid "Restrictions SQL" @@ -481,14 +436,8 @@ msgstr "``path``" msgid "``ARRAY`` [**ANY-INTEGER**]" msgstr "``ARRAY`` [**ENTEROS**]" -msgid "" -"Sequence of edge identifiers that form a path that is not allowed to be " -"taken. - Empty arrays or ``NULL`` arrays are ignored. - Arrays that have a " -"``NULL`` element will raise an exception." -msgstr "" -"Secuencia de identificadores de aristas que forman un camino que no se " -"permite tomar. - Arreglos vacios o ``NULL`` son ignorados. - Arreglos que " -"tienen ``NULL`` arrojan una excepción." +msgid "Sequence of edge identifiers that form a path that is not allowed to be taken. - Empty arrays or ``NULL`` arrays are ignored. - Arrays that have a ``NULL`` element will raise an exception." +msgstr "Secuencia de identificadores de aristas que forman un camino que no se permite tomar. - Arreglos vacios o ``NULL`` son ignorados. - Arreglos que tienen ``NULL`` arrojan una excepción." msgid "``Cost``" msgstr "``Cost``" @@ -500,8 +449,7 @@ msgid "Traveling Sales Person - Family of functions" msgstr "Vendedor Viajante - Familia de funciones" msgid ":doc:`pgr_TSP` - When input is given as matrix cell information." -msgstr "" -":doc:`pgr_TSP` - Cuando la entrada es la información de celdas de una matriz." +msgstr ":doc:`pgr_TSP` - Cuando la entrada es la información de celdas de una matriz." msgid ":doc:`pgr_TSPeuclidean` - When input are coordinates." msgstr ":doc:`pgr_TSPeuclidean` - Cuando la información son coordenadas." @@ -518,32 +466,17 @@ msgstr "Definición del Problema" msgid "The travelling salesperson problem (TSP) asks the following question:" msgstr "En el problema del vendedor viajante (TSP) hace la siguiente pregunta:" -msgid "" -"*Given a list of cities and the distances between each pair of cities, which " -"is the shortest possible route that visits each city exactly once and " -"returns to the origin city?*" -msgstr "" -"*Dada una lista de ciudades y las distancias entre cada par de ciudades, que " -"corresponde con la ruta más corta posible que para visite cada ciudad " -"exactamente una vez y regrese a la ciudad de origen?*" +msgid "*Given a list of cities and the distances between each pair of cities, which is the shortest possible route that visits each city exactly once and returns to the origin city?*" +msgstr "*Dada una lista de ciudades y las distancias entre cada par de ciudades, que corresponde con la ruta más corta posible que para visite cada ciudad exactamente una vez y regrese a la ciudad de origen?*" msgid "Origin" msgstr "Origen" -msgid "" -"The traveling sales person problem was studied in the 18th century by " -"mathematicians **Sir William Rowam Hamilton** and **Thomas Penyngton " -"Kirkman**." -msgstr "" -"El problema del vendedor viajante fue estudiado en el siglo 18 por " -"matemáticos **Sir William Rowam Hamilton** y **Thomas Penyngton Kirkman**." +msgid "The traveling sales person problem was studied in the 18th century by mathematicians **Sir William Rowam Hamilton** and **Thomas Penyngton Kirkman**." +msgstr "El problema del vendedor viajante fue estudiado en el siglo 18 por matemáticos **Sir William Rowam Hamilton** y **Thomas Penyngton Kirkman**." -msgid "" -"A discussion about the work of Hamilton & Kirkman can be found in the book " -"**Graph Theory (Biggs et al. 1976)**." -msgstr "" -"Se puede encontrar una discusión sobre el trabajo de Hamilton & Kirkman en " -"el libro **Graph Theory (Biggs et al. 1976)**." +msgid "A discussion about the work of Hamilton & Kirkman can be found in the book **Graph Theory (Biggs et al. 1976)**." +msgstr "Se puede encontrar una discusión sobre el trabajo de Hamilton & Kirkman en el libro **Graph Theory (Biggs et al. 1976)**." msgid "ISBN-13: 978-0198539162" msgstr "ISBN-13: 978-0198539162" @@ -551,25 +484,11 @@ msgstr "ISBN-13: 978-0198539162" msgid "ISBN-10: 0198539169" msgstr "ISBN-10: 0198539169" -msgid "" -"It is believed that the general form of the TSP have been first studied by " -"Kalr Menger in Vienna and Harvard. The problem was later promoted by " -"Hassler, Whitney & Merrill at Princeton. A detailed description about the " -"connection between Menger & Whitney, and the development of the TSP can be " -"found in `On the history of combinatorial optimization (till 1960) `__" -msgstr "" -"Se cree que la forma general del TSP ha sido estudiada por primera vez por " -"Kalr Menger en Viena y Harvard. El problema fue promovido más tarde por " -"Hassler, Whitney & Merrill en Princeton. Una descripción detallada sobre la " -"conexión entre Menger & Whitney, y el desarrollo del TSP se puede encontrar " -"en `On the history of combinatorial optimization (till 1960) `_" +msgid "It is believed that the general form of the TSP have been first studied by Kalr Menger in Vienna and Harvard. The problem was later promoted by Hassler, Whitney & Merrill at Princeton. A detailed description about the connection between Menger & Whitney, and the development of the TSP can be found in `On the history of combinatorial optimization (till 1960) `__" +msgstr "Se cree que la forma general del TSP ha sido estudiada por primera vez por Kalr Menger en Viena y Harvard. El problema fue promovido más tarde por Hassler, Whitney & Merrill en Princeton. Una descripción detallada sobre la conexión entre Menger & Whitney, y el desarrollo del TSP se puede encontrar en `On the history of combinatorial optimization (till 1960) `_" msgid "To calculate the number of different tours through :math:`n` cities:" -msgstr "" -"Para calcular el número de recorridos diferentes a través de :math:`n` " -"ciudades:" +msgstr "Para calcular el número de recorridos diferentes a través de :math:`n` ciudades:" msgid "Given a starting city," msgstr "Dada una ciudad de partida," @@ -583,12 +502,8 @@ msgstr "Y :math:`n-2` opciones para la tercera ciudad, etc." msgid "Multiplying these together we get :math:`(n-1)! = (n-1) (n-2) . . 1`." msgstr "Al multiplicarlas obtenemos :math:`(n-1)! = (n-1) (n-2) . . 1`." -msgid "" -"Now since the travel costs do not depend on the direction taken around the " -"tour:" -msgstr "" -"Ahora, dado que los costos de viaje no dependen de la dirección tomada " -"alrededor del recorrido:" +msgid "Now since the travel costs do not depend on the direction taken around the tour:" +msgstr "Ahora, dado que los costos de viaje no dependen de la dirección tomada alrededor del recorrido:" msgid "this number by 2" msgstr "este número por 2" @@ -605,12 +520,8 @@ msgstr "Este problema es un problema de optimización NP-duro." msgid "Metric Algorithm is used" msgstr "Se utiliza el algoritmo métrico" -msgid "" -"Implementation generates solutions that *are twice as long as the optimal " -"tour in the worst case*:" -msgstr "" -"La implementación genera soluciones que *son el doble de largas que el " -"recorrido óptimo en el peor de los casos*:" +msgid "Implementation generates solutions that *are twice as long as the optimal tour in the worst case*:" +msgstr "La implementación genera soluciones que *son el doble de largas que el recorrido óptimo en el peor de los casos*:" msgid "Graph characteristics for best performance:" msgstr "" @@ -622,18 +533,13 @@ msgid "Graph is fully connected" msgstr "El grafo está completamente conectado" msgid "Graph where traveling costs on edges obey the triangle inequality." -msgstr "" -"Grafo donde los costos de viaje en los segmentos cumplen con la desigualdad " -"del triángulo." +msgstr "Grafo donde los costos de viaje en los segmentos cumplen con la desigualdad del triángulo." msgid "The traveling costs are symmetric:" msgstr "Los costos del viaje son simétricos:" -msgid "" -"Traveling costs from ``u`` to ``v`` are just as much as traveling from ``v`` " -"to ``u``" -msgstr "" -"Los costos del viaje de ``u`` a ``v`` son tanto como viajar de ``v`` a ``u``" +msgid "Traveling costs from ``u`` to ``v`` are just as much as traveling from ``v`` to ``u``" +msgstr "Los costos del viaje de ``u`` a ``v`` son tanto como viajar de ``v`` a ``u``" msgid "TSP optional parameters" msgstr "Parámetros opcionales de TSP" @@ -648,8 +554,7 @@ msgid "The first visiting vertex" msgstr "El primer vértice visitado" msgid "When `0` any vertex can become the first visiting vertex." -msgstr "" -"Cuando `0` cualquier vértice puede convertirse en el primer vértice visitado." +msgstr "Cuando `0` cualquier vértice puede convertirse en el primer vértice visitado." msgid "``end_id``" msgstr "``end_id``" @@ -657,37 +562,23 @@ msgstr "``end_id``" msgid "Last visiting vertex before returning to ``start_vid``." msgstr "Último vértice visitado antes de regresar a ``start_vid``." -msgid "" -"When ``0`` any vertex can become the last visiting vertex before returning " -"to ``start_id``." -msgstr "" -"Cuando ``0`` cualquier vértice puede convertirse en el último vértice " -"visitado antes de regresar a ``start_vid``." +msgid "When ``0`` any vertex can become the last visiting vertex before returning to ``start_id``." +msgstr "Cuando ``0`` cualquier vértice puede convertirse en el último vértice visitado antes de regresar a ``start_vid``." -msgid "" -"When ``NOT 0`` and ``start_id = 0`` then it is the first and last vertex" -msgstr "" -"Cuando ``NOT 0`` y ``start_vid = 0`` entonces es el primer y último vértice" +msgid "When ``NOT 0`` and ``start_id = 0`` then it is the first and last vertex" +msgstr "Cuando ``NOT 0`` y ``start_vid = 0`` entonces es el primer y último vértice" msgid "References" msgstr "Referencias" -msgid "" -"`Boost: metric TSP approx `__" -msgstr "" -"`Boost: aproximación métrica de TSP `__" +msgid "`Boost: metric TSP approx `__" +msgstr "`Boost: aproximación métrica de TSP `__" msgid "`University of Waterloo TSP `__" msgstr "`Universided de Waterloo TSP `__" -msgid "" -"`Wikipedia: Traveling Salesman Problem `__" -msgstr "" -"`Wikipedia: Problema del viajante `__" +msgid "`Wikipedia: Traveling Salesman Problem `__" +msgstr "`Wikipedia: Problema del viajante `__" msgid "Vehicle Routing Functions - Category" msgstr "Funciones de Ruteo de Vehículos - Categoría" @@ -696,31 +587,22 @@ msgid "Pickup and delivery problem" msgstr "Problema de recogida y entrega" msgid ":doc:`pgr_pickDeliver` - Pickup & Delivery using a Cost Matrix" -msgstr "" -":doc:`pgr_pickDeliver` - Recogida y Entrega utilizando una Matriz de Costos" +msgstr ":doc:`pgr_pickDeliver` - Recogida y Entrega utilizando una Matriz de Costos" -msgid "" -":doc:`pgr_pickDeliverEuclidean` - Pickup & Delivery with Euclidean distances" -msgstr "" -":doc:`pgr_pickDeliverEuclidean` - Recoger y Entregar con distancias " -"Euclideanas" +msgid ":doc:`pgr_pickDeliverEuclidean` - Pickup & Delivery with Euclidean distances" +msgstr ":doc:`pgr_pickDeliverEuclidean` - Recoger y Entregar con distancias Euclideanas" msgid "Distribution problem" msgstr "Problema de distribución" msgid ":doc:`pgr_vrpOneDepot` - From a single depot, distributes orders" -msgstr "" -":doc:`pgr_vrpOneDepot` - Desde un único depósito, distribuye los pedidos" +msgstr ":doc:`pgr_vrpOneDepot` - Desde un único depósito, distribuye los pedidos" msgid "Contents" msgstr "Contenido" -msgid "" -"Vehicle Routing Problems `VRP` are **NP-hard** optimization problem, it " -"generalises the travelling salesman problem (TSP)." -msgstr "" -"Problemas de Ruteo de Vehículos `VRP` son problemas de optimización **NP-" -"hard** , que generaliza el problema del vendedor viajante (TSP)." +msgid "Vehicle Routing Problems `VRP` are **NP-hard** optimization problem, it generalises the travelling salesman problem (TSP)." +msgstr "Problemas de Ruteo de Vehículos `VRP` son problemas de optimización **NP-hard** , que generaliza el problema del vendedor viajante (TSP)." msgid "The objective of the VRP is to minimize the total route cost." msgstr "El objetivo del VRP es minimizar el costo total de la ruta." @@ -731,29 +613,14 @@ msgstr "Hay distintas variantes del problema VRP," msgid "**pgRouting does not try to implement all variants.**" msgstr "**pgRouting no intenta implementar todas las variantes.**" -msgid "" -"Capacitated Vehicle Routing Problem `CVRP` where The vehicles have limited " -"carrying capacity of the goods." -msgstr "" -"Problema de Ruteo de Vehículos Capacitados `CVRP` donde los vehículos tienen " -"una capacidad de transporte limitada de las mercancías." +msgid "Capacitated Vehicle Routing Problem `CVRP` where The vehicles have limited carrying capacity of the goods." +msgstr "Problema de Ruteo de Vehículos Capacitados `CVRP` donde los vehículos tienen una capacidad de transporte limitada de las mercancías." -msgid "" -"Vehicle Routing Problem with Time Windows `VRPTW` where the locations have " -"time windows within which the vehicle's visits must be made." -msgstr "" -"Problema de Ruteo del Vehículo con Ventanas de Tiempo `VRPTW` donde las " -"ubicaciones tienen ventanas de tiempo dentro de las cuales se deben realizar " -"las visitas del vehículo." +msgid "Vehicle Routing Problem with Time Windows `VRPTW` where the locations have time windows within which the vehicle's visits must be made." +msgstr "Problema de Ruteo del Vehículo con Ventanas de Tiempo `VRPTW` donde las ubicaciones tienen ventanas de tiempo dentro de las cuales se deben realizar las visitas del vehículo." -msgid "" -"Vehicle Routing Problem with Pickup and Delivery `VRPPD` where a number of " -"goods need to be moved from certain pickup locations to other delivery " -"locations." -msgstr "" -"Problema de Ruteo de Vehículos con Recogida y Entrega `VRPPD` donde una " -"serie de mercancías necesitan ser trasladadas de ciertas ubicaciones de " -"recogida a otros lugares de entrega." +msgid "Vehicle Routing Problem with Pickup and Delivery `VRPPD` where a number of goods need to be moved from certain pickup locations to other delivery locations." +msgstr "Problema de Ruteo de Vehículos con Recogida y Entrega `VRPPD` donde una serie de mercancías necesitan ser trasladadas de ciertas ubicaciones de recogida a otros lugares de entrega." msgid "Limitations" msgstr "Limitaciones" @@ -773,12 +640,8 @@ msgstr "Menos tiempo de espera es mejor." msgid "Pick & Delivery" msgstr "Recogida y Entrega" -msgid "" -"Problem: `CVRPPDTW` Capacitated Pick and Delivery Vehicle Routing problem " -"with Time Windows" -msgstr "" -"Problema: `CVRPPDTW` Problema de Ruteo de vehículos de recogida y entrega " -"capacitado con Ventanas de Tiempo" +msgid "Problem: `CVRPPDTW` Capacitated Pick and Delivery Vehicle Routing problem with Time Windows" +msgstr "Problema: `CVRPPDTW` Problema de Ruteo de vehículos de recogida y entrega capacitado con Ventanas de Tiempo" msgid "Times are relative to `0`" msgstr "Los tiempos son relativos a `0`" @@ -790,9 +653,7 @@ msgid "have start and ending service duration times." msgstr "tienen tiempos de duración del servicio de inicio y fin." msgid "have opening and closing times for the start and ending locations." -msgstr "" -"tienen horarios de apertura y cierre para las ubicaciones de inicio y " -"finalización." +msgstr "tienen horarios de apertura y cierre para las ubicaciones de inicio y finalización." msgid "have a capacity." msgstr "tienen cierta capacidad." @@ -804,19 +665,13 @@ msgid "Have pick up and delivery locations." msgstr "Tener lugares de recogida y entrega." msgid "Have opening and closing times for the pickup and delivery locations." -msgstr "" -"Tener horarios de apertura y cierre para las ubicaciones de recogida y " -"entrega." +msgstr "Tener horarios de apertura y cierre para las ubicaciones de recogida y entrega." msgid "Have pickup and delivery duration service times." msgstr "Tener tiempos de servicio de recogida y entrega." -msgid "" -"have a demand request for moving goods from the pickup location to the " -"delivery location." -msgstr "" -"solicitar el traslado de mercancías desde el lugar de recogida hasta el " -"lugar de entrega." +msgid "have a demand request for moving goods from the pickup location to the delivery location." +msgstr "solicitar el traslado de mercancías desde el lugar de recogida hasta el lugar de entrega." msgid "Time based calculations:" msgstr "Cálculos basados en el tiempo:" @@ -825,8 +680,7 @@ msgid "Travel time between customers is :math:`distance / speed`" msgstr "El tiempo de viaje entre los clientes es :math:`distancia / velocidad`" msgid "Pickup and delivery order pair is done by the same vehicle." -msgstr "" -"El par de órdenes de recogida y entrega se realiza por el mismo vehículo." +msgstr "El par de órdenes de recogida y entrega se realiza por el mismo vehículo." msgid "A pickup is done before the delivery." msgstr "La recogida se realiza antes de la entrega." @@ -906,24 +760,17 @@ msgstr "``3`` Empuje la orden trasera." msgid "``4`` Optimize insert." msgstr "``4`` Optimizar inserción." -msgid "" -"``5`` Push back order that allows more orders to be inserted at the back" -msgstr "" -"``5`` Orden de retroceso que permite insertar más órdenes en la parte " -"posterior" +msgid "``5`` Push back order that allows more orders to be inserted at the back" +msgstr "``5`` Orden de retroceso que permite insertar más órdenes en la parte posterior" -msgid "" -"``6`` Push front order that allows more orders to be inserted at the front" -msgstr "" -"``6`` Orden de avance que permite insertar más órdenes en la parte frontal" +msgid "``6`` Push front order that allows more orders to be inserted at the front" +msgstr "``6`` Orden de avance que permite insertar más órdenes en la parte frontal" msgid "Orders SQL" msgstr "SQL de órdenes" msgid "Common columns for the orders SQL in both implementations:" -msgstr "" -"En general, las columnas para las órdenes SQL es la misma en ambas " -"implementaciones:" +msgstr "En general, las columnas para las órdenes SQL es la misma en ambas implementaciones:" msgid "|ANY-INTEGER|" msgstr "|ANY-INTEGER|" @@ -979,39 +826,23 @@ msgstr "[``d_service``]" msgid "The duration of the unloading at the delivery location." msgstr "La duración de la descarga en el lugar de entrega." -msgid "" -"For :doc:`pgr_pickDeliver` the pickup and delivery identifiers of the " -"locations are needed:" -msgstr "" -"Para :doc:`pgr_pickDeliver` los identificadores de ubicación de la carga y " -"envío son necesarias:" +msgid "For :doc:`pgr_pickDeliver` the pickup and delivery identifiers of the locations are needed:" +msgstr "Para :doc:`pgr_pickDeliver` los identificadores de ubicación de la carga y envío son necesarias:" msgid "``p_node_id``" msgstr "``p_node_id``" -msgid "" -"The node identifier of the pickup, must match a vertex identifier in the " -"`Matrix SQL`_." -msgstr "" -"El identificador de nodo de la recogida debe coincidir con un identificador " -"de vértice en la `SQL de matriz`_." +msgid "The node identifier of the pickup, must match a vertex identifier in the `Matrix SQL`_." +msgstr "El identificador de nodo de la recogida debe coincidir con un identificador de vértice en la `SQL de matriz`_." msgid "``d_node_id``" msgstr "``d_node_id``" -msgid "" -"The node identifier of the delivery, must match a vertex identifier in the " -"`Matrix SQL`_." -msgstr "" -"El identificador de nodo de la entrega debe coincidir con un identificador " -"de vértice en la `SQL de matriz`_." +msgid "The node identifier of the delivery, must match a vertex identifier in the `Matrix SQL`_." +msgstr "El identificador de nodo de la entrega debe coincidir con un identificador de vértice en la `SQL de matriz`_." -msgid "" -"For :doc:`pgr_pickDeliverEuclidean` the :math:`(x, y)` values of the " -"locations are needed:" -msgstr "" -"Para :doc:`pgr_pickDeliverEuclidean` los valores :math:`(x, y)` de las " -"ubicaciones son necesarias:" +msgid "For :doc:`pgr_pickDeliverEuclidean` the :math:`(x, y)` values of the locations are needed:" +msgstr "Para :doc:`pgr_pickDeliverEuclidean` los valores :math:`(x, y)` de las ubicaciones son necesarias:" msgid "``p_x``" msgstr "``p_x``" @@ -1041,9 +872,7 @@ msgid "Vehicles SQL" msgstr "SQL de Vehículos" msgid "Common columns for the vehicles SQL in both implementations:" -msgstr "" -"Las columnas comunas para vehículos SQL son las mismas en ambas " -"implementaciones:" +msgstr "Las columnas comunas para vehículos SQL son las mismas en ambas implementaciones:" msgid "Identifier of the vehicle." msgstr "Identificador del vehículo." @@ -1073,8 +902,7 @@ msgid "The duration of the loading at the starting location." msgstr "La duración de la carga en la ubicación inicial." msgid "When missing: A duration of :math:`0` time units is used." -msgstr "" -"Cuando falta: Una duración de :math: `0` unidades de tiempo son usadas." +msgstr "Cuando falta: Una duración de :math: `0` unidades de tiempo son usadas." msgid "[``end_open``]" msgstr "[``end_open``]" @@ -1103,32 +931,20 @@ msgstr "La duración de la carga en la ubicación final." msgid "When missing: A duration in ``start_service`` is used." msgstr "Cuando falte: Se usara una duración en ``start_service``." -msgid "" -"For :doc:`pgr_pickDeliver` the starting and ending identifiers of the " -"locations are needed:" -msgstr "" -"Para :doc:`pgr_pickDeliver` se necesitan los identificadores de salida y " -"destino:" +msgid "For :doc:`pgr_pickDeliver` the starting and ending identifiers of the locations are needed:" +msgstr "Para :doc:`pgr_pickDeliver` se necesitan los identificadores de salida y destino:" msgid "``start_node_id``" msgstr "``start_node_id``" -msgid "" -"The node identifier of the start location, must match a vertex identifier in " -"the `Matrix SQL`_." -msgstr "" -"El identificador de nodo de la ubicación inicial debe coincidir con un " -"identificador de vértice en la `SQL de matriz`_." +msgid "The node identifier of the start location, must match a vertex identifier in the `Matrix SQL`_." +msgstr "El identificador de nodo de la ubicación inicial debe coincidir con un identificador de vértice en la `SQL de matriz`_." msgid "[``end_node_id``]" msgstr "[``end_node_id``]" -msgid "" -"The node identifier of the end location, must match a vertex identifier in " -"the `Matrix SQL`_." -msgstr "" -"El identificador de nodo de la ubicación final debe coincidir con un " -"identificador de vértice en la `SQL de matriz`_." +msgid "The node identifier of the end location, must match a vertex identifier in the `Matrix SQL`_." +msgstr "El identificador de nodo de la ubicación final debe coincidir con un identificador de vértice en la `SQL de matriz`_." msgid "When missing: ``end_node_id`` is used." msgstr "Cuando falte: Se usara``end_node_id``." @@ -1187,12 +1003,8 @@ msgstr "Valor secuencial a partir de **1**." msgid "``vehicle_seq``" msgstr "``vehicle_seq``" -msgid "" -"Sequential value starting from **1** for current vehicles. The :math:`n_{th}" -"` vehicle in the solution." -msgstr "" -"Valor secuencial a partir de **1** para vehículos actuales. El vehículo :" -"math:`n_{th}` en la solución." +msgid "Sequential value starting from **1** for current vehicles. The :math:`n_{th}` vehicle in the solution." +msgstr "Valor secuencial a partir de **1** para vehículos actuales. El vehículo :math:`n_{th}` en la solución." msgid "Value :math:`-2` indicates it is the summary row." msgstr "Valor :math:`-2` para indicar que es una fila de resumen." @@ -1209,11 +1021,8 @@ msgstr "Identificador del vehículo actual." msgid "Summary row has the **total capacity violations**." msgstr "Fila de resumen tiene el **total de infracciones de capacidad**." -msgid "" -"A capacity violation happens when overloading or underloading a vehicle." -msgstr "" -"Cuando se sobrecarga o subrogar un vehículo, ocurre una infracción de " -"capacidad." +msgid "A capacity violation happens when overloading or underloading a vehicle." +msgstr "Cuando se sobrecarga o subrogar un vehículo, ocurre una infracción de capacidad." msgid "``stop_seq``" msgstr "``stop_seq``" @@ -1221,22 +1030,14 @@ msgstr "``stop_seq``" msgid "INTEGER" msgstr "INTEGER" -msgid "" -"Sequential value starting from **1** for the stops made by the current " -"vehicle. The :math:`m_{th}` stop of the current vehicle." -msgstr "" -"Valor secuencial a partir de **1** para las paradas realizadas por el " -"vehículo actual. La parada :math:`m_{th}` del vehículo actual." +msgid "Sequential value starting from **1** for the stops made by the current vehicle. The :math:`m_{th}` stop of the current vehicle." +msgstr "Valor secuencial a partir de **1** para las paradas realizadas por el vehículo actual. La parada :math:`m_{th}` del vehículo actual." msgid "Summary row has the **total time windows violations**." -msgstr "" -"Fila de resumen tiene el **total de violaciones de ventanas de tiempo**." +msgstr "Fila de resumen tiene el **total de violaciones de ventanas de tiempo**." -msgid "" -"A time window violation happens when arriving after the location has closed." -msgstr "" -"Una infracción de ventana de tiempo ocurre cuando se llega a la ubicación " -"después de que ésta cerró." +msgid "A time window violation happens when arriving after the location has closed." +msgstr "Una infracción de ventana de tiempo ocurre cuando se llega a la ubicación después de que ésta cerró." msgid "``stop_type``" msgstr "``stop_type``" @@ -1265,11 +1066,8 @@ msgstr "``order_id``" msgid "Pickup-Delivery order pair identifier." msgstr "Identificador de par de órdenes Recoger-Entregar." -msgid "" -"Value :math:`-1`: When no order is involved on the current stop location." -msgstr "" -"Valor :math:`-1`: Cuando no hay pedidos involucrados en la ubicación de la " -"parada actual." +msgid "Value :math:`-1`: When no order is involved on the current stop location." +msgstr "Valor :math:`-1`: Cuando no hay pedidos involucrados en la ubicación de la parada actual." msgid "``cargo``" msgstr "``cargo``" @@ -1284,8 +1082,7 @@ msgid "``travel_time``" msgstr "``travel_time``" msgid "Travel time from previous ``stop_seq`` to current ``stop_seq``." -msgstr "" -"Tiempo de viaje desde el ``stop_seq`` anterior hasta el ``stop_seq`` actual." +msgstr "Tiempo de viaje desde el ``stop_seq`` anterior hasta el ``stop_seq`` actual." msgid "Summary has the **total traveling time**:" msgstr "El resumen tiene el **tiempo total de viaje**:" @@ -1336,18 +1133,13 @@ msgid ":math:`arrival\\_time + wait\\_time + service\\_time`." msgstr ":math:`arrival\\_time + wait\\_time + service\\_time`." msgid "The ending location has the **total time** used by the current vehicle." -msgstr "" -"El destino final tiene el **tiempo total** utilizado por el vehículo actual." +msgstr "El destino final tiene el **tiempo total** utilizado por el vehículo actual." msgid "Summary row has the **total solution time**:" msgstr "La fila de resumen tiene el **tiempo total de solución**:" -msgid "" -":math:`total\\ traveling\\ time + total\\ waiting\\ time + total\\ service\\ " -"time`." -msgstr "" -":math:`total\\ traveling\\ time + total\\ waiting\\ time + total\\ service\\ " -"time`." +msgid ":math:`total\\ traveling\\ time + total\\ waiting\\ time + total\\ service\\ time`." +msgstr ":math:`total\\ traveling\\ time + total\\ waiting\\ time + total\\ service\\ time`." msgid "Summary Row" msgstr "Fila de Resumen" @@ -1376,14 +1168,8 @@ msgstr "**tiempo total de servicio**:" msgid "Handling Parameters" msgstr "Parámetros de Manipulación" -msgid "" -"To define a problem, several considerations have to be done, to get " -"consistent results. This section gives an insight of how parameters are to " -"be considered." -msgstr "" -"Para definir un problema, hay que hacer varias consideraciones, para obtener " -"resultados consistentes. En esta sección se proporciona una idea de cómo se " -"deben considerar los parámetros." +msgid "To define a problem, several considerations have to be done, to get consistent results. This section gives an insight of how parameters are to be considered." +msgstr "Para definir un problema, hay que hacer varias consideraciones, para obtener resultados consistentes. En esta sección se proporciona una idea de cómo se deben considerar los parámetros." msgid "`Capacity and Demand Units Handling`_" msgstr "`Manejo de Unidades de Capacidad y Demanda`_" @@ -1407,8 +1193,7 @@ msgid "Volume units like :math:`m^3`." msgstr "Unidades de volumen como :math:`m^3`." msgid "Area units like :math:`m^2` (when no stacking is allowed)." -msgstr "" -"Unidades de área como :math:`m^2` (cuando no se permite el apilamiento)." +msgstr "Unidades de área como :math:`m^2` (cuando no se permite el apilamiento)." msgid "Weight units like :math:`kg`." msgstr "Unidades de peso como :math:`kg`." @@ -1419,43 +1204,23 @@ msgstr "Número de cajas que caben en el vehículo." msgid "Number of seats in the vehicle" msgstr "Número de asientos en el vehículo" -msgid "" -"The `demand` request of the pickup-deliver orders must use the same units as " -"the units used in the vehicle's `capacity`." -msgstr "" -"La solicitud de `demanda` de las órdenes de recogida-entrega debe utilizar " -"las mismas unidades que las utilizadas en la `capacidad` del vehículo." +msgid "The `demand` request of the pickup-deliver orders must use the same units as the units used in the vehicle's `capacity`." +msgstr "La solicitud de `demanda` de las órdenes de recogida-entrega debe utilizar las mismas unidades que las utilizadas en la `capacidad` del vehículo." -msgid "" -"To handle problems like: 10 (equal dimension) boxes of apples and 5 kg of " -"feathers that are to be transported (not packed in boxes)." -msgstr "" -"Para manejar problemas como: 10 cajas (de igual dimensión) de manzanas y 5 " -"kg de plumas que van a ser transportadas (no embaladas en cajas)." +msgid "To handle problems like: 10 (equal dimension) boxes of apples and 5 kg of feathers that are to be transported (not packed in boxes)." +msgstr "Para manejar problemas como: 10 cajas (de igual dimensión) de manzanas y 5 kg de plumas que van a ser transportadas (no embaladas en cajas)." -msgid "" -"If the vehicle's **capacity** is measured in `boxes`, a conversion of `kg of " -"feathers` to `number of boxes` is needed." -msgstr "" -"Si la **capacidad** del vehículo se mide mediante `cajas`, se necesita una " -"conversión de `kg de plumas` a `número equivalente de cajas`." +msgid "If the vehicle's **capacity** is measured in `boxes`, a conversion of `kg of feathers` to `number of boxes` is needed." +msgstr "Si la **capacidad** del vehículo se mide mediante `cajas`, se necesita una conversión de `kg de plumas` a `número equivalente de cajas`." -msgid "" -"If the vehicle's **capacity** is measured in `kg`, a conversion of `box of " -"apples` to `kg` is needed." -msgstr "" -"Si la **capacidad** del vehículo se mide en `kg`, se necesita una conversión " -"de `cajas de manzanas` a `kg`." +msgid "If the vehicle's **capacity** is measured in `kg`, a conversion of `box of apples` to `kg` is needed." +msgstr "Si la **capacidad** del vehículo se mide en `kg`, se necesita una conversión de `cajas de manzanas` a `kg`." msgid "Showing how the 2 possible conversions can be done" msgstr "Mostrar cómo se pueden hacer las 2 conversiones posibles" -msgid "" -"Let: - :math:`f\\_boxes`: number of boxes needed for `1` kg of feathers. - :" -"math:`a\\_weight`: weight of `1` box of apples." -msgstr "" -"Sea: - :math:`f_boxes`: el número de cajas necesarias para `1` kg de plumas. " -"- :math:`a_weight`: peso de `1` caja de manzanas." +msgid "Let: - :math:`f\\_boxes`: number of boxes needed for `1` kg of feathers. - :math:`a\\_weight`: weight of `1` box of apples." +msgstr "Sea: - :math:`f_boxes`: el número de cajas necesarias para `1` kg de plumas. - :math:`a_weight`: peso de `1` caja de manzanas." msgid "Capacity Units" msgstr "Unidades de Capacidad" @@ -1488,27 +1253,19 @@ msgid "When using :doc:`pgr_pickDeliverEuclidean`:" msgstr "Cuando se use :doc:`pgr_pickDeliverEuclidean`:" msgid "The vehicles have :math:`(x, y)` pairs for start and ending locations." -msgstr "" -"Los vehículos tienen :math:`(x, y)` pares para las ubicaciones de inicio y " -"fin." +msgstr "Los vehículos tienen :math:`(x, y)` pares para las ubicaciones de inicio y fin." msgid "The orders Have :math:`(x, y)` pairs for pickup and delivery locations." -msgstr "" -"Los pedidos tienen :math:`(x, y)` pares para ubicaciones de recogida y " -"entrega." +msgstr "Los pedidos tienen :math:`(x, y)` pares para ubicaciones de recogida y entrega." msgid "When using :doc:`pgr_pickDeliver`:" msgstr "Cuando se use :doc:`pgr_pickDeliver`:" msgid "The vehicles have identifiers for the start and ending locations." -msgstr "" -"Los vehículos tienen identificadores para las ubicaciones de inicio y " -"finalización." +msgstr "Los vehículos tienen identificadores para las ubicaciones de inicio y finalización." msgid "The orders have identifiers for the pickup and delivery locations." -msgstr "" -"Los pedidos tienen identificadores para las ubicaciones de recogida y " -"entrega." +msgstr "Los pedidos tienen identificadores para las ubicaciones de recogida y entrega." msgid "All the identifiers are indices to the given matrix." msgstr "Todos los identificadores son índices de la matriz dada." @@ -1516,20 +1273,11 @@ msgstr "Todos los identificadores son índices de la matriz dada." msgid "Time Handling" msgstr "Manejo del Tiempo" -msgid "" -"The times are relative to **0**. All time units have to be converted to a " -"**0** reference and the same time units." -msgstr "" -"El tiempo es relativo a **0**. Todas las unidades de tiempo se convierte a " -"la referencia de **0** y las mismas unidades de tiempo." +msgid "The times are relative to **0**. All time units have to be converted to a **0** reference and the same time units." +msgstr "El tiempo es relativo a **0**. Todas las unidades de tiempo se convierte a la referencia de **0** y las mismas unidades de tiempo." -msgid "" -"Suppose that a vehicle's driver starts the shift at 9:00 am and ends the " -"shift at 4:30 pm and the service time duration is 10 minutes with 30 seconds." -msgstr "" -"Supongamos que el conductor de un vehículo comienza el turno a las 9:00 am y " -"termina el turno a las 4:30 pm y la duración del tiempo de servicio es de 10 " -"minutos con 30 segundos." +msgid "Suppose that a vehicle's driver starts the shift at 9:00 am and ends the shift at 4:30 pm and the service time duration is 10 minutes with 30 seconds." +msgstr "Supongamos que el conductor de un vehículo comienza el turno a las 9:00 am y termina el turno a las 4:30 pm y la duración del tiempo de servicio es de 10 minutos con 30 segundos." msgid "Meaning of 0" msgstr "Significado de 0" @@ -1585,12 +1333,8 @@ msgstr ":math:`7.5*60 = 540`" msgid "Factor handling" msgstr "Manipulación del Factor" -msgid "" -"``factor`` acts as a multiplier to convert from distance values to time " -"units the matrix values or the euclidean values." -msgstr "" -"``factor`` funciona como un multiplicador que convierte valores de distancia " -"a unidades de tiempo, ya sea en valores matriciales o euclidianos." +msgid "``factor`` acts as a multiplier to convert from distance values to time units the matrix values or the euclidean values." +msgstr "``factor`` funciona como un multiplicador que convierte valores de distancia a unidades de tiempo, ya sea en valores matriciales o euclidianos." msgid "When the values are already in the desired time units" msgstr "Los valores ya están en la unidad de tiempo deseada" @@ -1607,14 +1351,8 @@ msgstr "Cuando ``factor`` > 1 el tiempo de viaje es más lento" msgid "For the :doc:`pgr_pickDeliverEuclidean`:" msgstr "Para el :doc:`pgr_pickDeliverEuclidean`:" -msgid "" -"Working with time units in seconds, and x/y in lat/lon: Factor: would depend " -"on the location of the points and on the average velocity say 25m/s is the " -"velocity." -msgstr "" -"Trabajando con la unidad de tiempo en segundos, con x/y en lat/lon : Factor: " -"dependería en la ubicación de los puntos y la velocidad promedio, digamos " -"con velocidad de 25m/s." +msgid "Working with time units in seconds, and x/y in lat/lon: Factor: would depend on the location of the points and on the average velocity say 25m/s is the velocity." +msgstr "Trabajando con la unidad de tiempo en segundos, con x/y en lat/lon : Factor: dependería en la ubicación de los puntos y la velocidad promedio, digamos con velocidad de 25m/s." msgid "Latitude" msgstr "Latitud" @@ -1643,12 +1381,8 @@ msgstr "4452 s" msgid "For the :doc:`pgr_pickDeliver`:" msgstr "Para el :doc:`pgr_pickDeliver`:" -msgid "" -"Given :math:`v = d / t` therefore :math:`t = d / v` And the ``factor`` " -"becomes :math:`1 / v`" -msgstr "" -"Dado :math:`v = d / t`entonces :math:`t = d / v` y el ``factor`` se " -"convierte en :math:`1 / v`" +msgid "Given :math:`v = d / t` therefore :math:`t = d / v` And the ``factor`` becomes :math:`1 / v`" +msgstr "Dado :math:`v = d / t`entonces :math:`t = d / v` y el ``factor`` se convierte en :math:`1 / v`" msgid "v" msgstr "v" @@ -1668,19 +1402,11 @@ msgstr "t" msgid "Time" msgstr "Tiempo" -msgid "" -"For the following equivalences :math:`10m/s \\approx 600m/min \\approx 36 km/" -"hr`" -msgstr "" -"Para las siguientes equivalencias :math:`10m/s \\approx 600m/min \\approx 36 " -"km/hr`" +msgid "For the following equivalences :math:`10m/s \\approx 600m/min \\approx 36 km/hr`" +msgstr "Para las siguientes equivalencias :math:`10m/s \\approx 600m/min \\approx 36 km/hr`" -msgid "" -"Working with time units in seconds and the matrix been in meters: For a " -"1000m length value on the matrix:" -msgstr "" -"Trabajando con segundos para las unidades de tiempo y la matriz en metros: " -"Para un valor de longitud de 1000m en la matriz:" +msgid "Working with time units in seconds and the matrix been in meters: For a 1000m length value on the matrix:" +msgstr "Trabajando con segundos para las unidades de tiempo y la matriz en metros: Para un valor de longitud de 1000m en la matriz:" msgid "Units" msgstr "Unidades" @@ -1742,26 +1468,17 @@ msgstr ":doc:`sampledata`" msgid "A* - Family of functions" msgstr "A* - Familia de Funciones" -msgid "" -"The A* (pronounced \"A Star\") algorithm is based on Dijkstra's algorithm " -"with a heuristic that allow it to solve most shortest path problems by " -"evaluation only a sub-set of the overall graph." -msgstr "" -"El algoritmo A * (pronunciado \"A estrella\") se basa en el algoritmo de " -"Dijkstra con una heurística que permite resolver problemas de ruta más " -"cortos evaluando sólo un subconjunto de la gráfica." +msgid "The A* (pronounced \"A Star\") algorithm is based on Dijkstra's algorithm with a heuristic that allow it to solve most shortest path problems by evaluation only a sub-set of the overall graph." +msgstr "El algoritmo A * (pronunciado \"A estrella\") se basa en el algoritmo de Dijkstra con una heurística que permite resolver problemas de ruta más cortos evaluando sólo un subconjunto de la gráfica." msgid ":doc:`pgr_aStar` - A* algorithm for the shortest path." msgstr ":doc:`pgr_aStar` - Algoritmo A* para la ruta más corta." msgid ":doc:`pgr_aStarCost` - Get the aggregate cost of the shortest paths." -msgstr "" -":doc:`pgr_aStarCost` - Obtener el costo agregado de las rutas más cortas." +msgstr ":doc:`pgr_aStarCost` - Obtener el costo agregado de las rutas más cortas." msgid ":doc:`pgr_aStarCostMatrix` - Get the cost matrix of the shortest paths." -msgstr "" -":doc:`pgr_aStarCostMatrix` - Obtener la matriz de costos de las rutas más " -"cortas." +msgstr ":doc:`pgr_aStarCostMatrix` - Obtener la matriz de costos de las rutas más cortas." msgid "The main Characteristics are:" msgstr "Las características principales son:" @@ -1800,13 +1517,10 @@ msgid "``agg_cost`` from `v` to `u` is :math:`0`" msgstr "``agg_cost`` de `v` a `u` es :math:`0`" msgid "When :math:`(x,y)` coordinates for the same vertex identifier differ:" -msgstr "" -"Cuando las coordenadas (x,y) para el mismo identificador de vértice difieren:" +msgstr "Cuando las coordenadas (x,y) para el mismo identificador de vértice difieren:" msgid "A random selection of the vertex's :math:`(x,y)` coordinates is used." -msgstr "" -"Se utiliza una selección aleatoria de las coordenadas del vértice :math:`(x," -"y)`." +msgstr "Se utiliza una selección aleatoria de las coordenadas del vértice :math:`(x,y)`." msgid "Running time: :math:`O((E + V) * \\log V)`" msgstr "Tiempo de ejecución: :math:`O((E + V) * \\log V)`" @@ -1821,8 +1535,7 @@ msgid "Heuristic number. Current valid values 0~5." msgstr "Número heurístico. Valores válidos 0~5." msgid "0: :math:`h(v) = 0` (Use this value to compare with pgr_dijkstra)" -msgstr "" -"0: :math:`h(v) = 0` (Utilizar este valor para comparar con pgr_dijkstra)" +msgstr "0: :math:`h(v) = 0` (Utilizar este valor para comparar con pgr_dijkstra)" msgid "1: :math:`h(v) = abs(max(\\Delta x, \\Delta y))`" msgstr "1: :math:`h(v) = abs(max(\\Delta x, \\Delta y))`" @@ -1851,12 +1564,8 @@ msgstr "``epsilon``" msgid "For less restricted results. :math:`epsilon >= 1`." msgstr "Para resultados menos restringidos. :math:`epsilon >= 1`." -msgid "" -"See :ref:`heuristics ` available and :ref:`factor " -"` handling." -msgstr "" -"Ver :ref:`heuristicas ` disponibles y manupulación de :ref:" -"`factor `." +msgid "See :ref:`heuristics ` available and :ref:`factor ` handling." +msgstr "Ver :ref:`heuristicas ` disponibles y manupulación de :ref:`factor `." msgid "Advanced documentation" msgstr "Documentación avanzada" @@ -1873,22 +1582,14 @@ msgstr "Donde :math:`\\Delta x = x_1 - x_0` y :math:`\\Delta y = y_1 - y_0`" msgid "Analysis 1" msgstr "Análisis 1" -msgid "" -"Working with cost/reverse_cost as length in degrees, x/y in lat/lon: Factor " -"= 1 (no need to change units)" -msgstr "" -"Trabajando con coste/coste_inverso como longitud en grados, x/y en lat/lon: " -"Factor = 1 (no es necesario cambiar las unidades)" +msgid "Working with cost/reverse_cost as length in degrees, x/y in lat/lon: Factor = 1 (no need to change units)" +msgstr "Trabajando con coste/coste_inverso como longitud en grados, x/y en lat/lon: Factor = 1 (no es necesario cambiar las unidades)" msgid "Analysis 2" msgstr "Análisis 2" -msgid "" -"Working with cost/reverse_cost as length in meters, x/y in lat/lon: Factor = " -"would depend on the location of the points:" -msgstr "" -"Trabajando con coste/coste_inverso como longitud en metros, x/y en lat/lon: " -"Factor = dependería de la ubicación de los puntos:" +msgid "Working with cost/reverse_cost as length in meters, x/y in lat/lon: Factor = would depend on the location of the points:" +msgstr "Trabajando con coste/coste_inverso como longitud en metros, x/y en lat/lon: Factor = dependería de la ubicación de los puntos:" msgid "1 longitude degree is 78846.81 m" msgstr "1 grado de longitud son 78846.81 m" @@ -1905,23 +1606,14 @@ msgstr "111319" msgid "Analysis 3" msgstr "Análisis 3" -msgid "" -"Working with cost/reverse_cost as time in seconds, x/y in lat/lon: Factor: " -"would depend on the location of the points and on the average speed say 25m/" -"s is the speed." -msgstr "" -"Trabajando con cost/reverse_cost con el tiempo en segundos, x / y en lat/" -"lon: Factor: que depende de la ubicación de los puntos y en la velocidad " -"promedio, digamos que 25m/s es la velocidad." +msgid "Working with cost/reverse_cost as time in seconds, x/y in lat/lon: Factor: would depend on the location of the points and on the average speed say 25m/s is the speed." +msgstr "Trabajando con cost/reverse_cost con el tiempo en segundos, x / y en lat/lon: Factor: que depende de la ubicación de los puntos y en la velocidad promedio, digamos que 25m/s es la velocidad." msgid ":doc:`bdAstar-family`" msgstr ":doc:`bdAstar-family`" -msgid "" -"`Boost: A* search `__" -msgstr "" -"`Boost: Búsqueda A* `__" +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" @@ -1930,9 +1622,7 @@ msgid "All Pairs - Family of Functions" msgstr "Todos los Pares - Familia de Funciones" msgid "The following functions work on all vertices pair combinations" -msgstr "" -"Las siguientes funciones funcionan en todas las combinaciones de pares de " -"vértices" +msgstr "Las siguientes funciones funcionan en todas las combinaciones de pares de vértices" msgid ":doc:`pgr_floydWarshall` - Floyd-Warshall's algorithm." msgstr ":doc:`pgr_floydWarshall` - Algoritmo de Floyd-Warshall." @@ -1946,33 +1636,17 @@ msgstr "Las principales características son:" msgid "It does not return a path." msgstr "No devuelve una ruta." -msgid "" -"Returns the sum of the costs of the shortest path for each pair of nodes in " -"the graph." -msgstr "" -"Regresa la suma de los costos de la ruta más corta para cada par de nodos " -"del grafo." +msgid "Returns the sum of the costs of the shortest path for each pair of nodes in the graph." +msgstr "Regresa la suma de los costos de la ruta más corta para cada par de nodos del grafo." -msgid "" -"Boost returns a :math:`V \\times V` matrix, where the infinity values. " -"Represent the distance between vertices for which there is no path." -msgstr "" -"Boost devuelve una matriz :math:`V \\times V` donde los valores infinitos " -"representan la distancia entre vértices para los que no hay ruta." +msgid "Boost returns a :math:`V \\times V` matrix, where the infinity values. Represent the distance between vertices for which there is no path." +msgstr "Boost devuelve una matriz :math:`V \\times V` donde los valores infinitos representan la distancia entre vértices para los que no hay ruta." -msgid "" -"We return only the non infinity values in form of a set of `(start_vid, " -"end_vid, agg_cost)`." -msgstr "" -"Solo regresa los valores no infinitos en forma de un conjunto de " -"`(start_vid, end_vid, agg_cost)`." +msgid "We return only the non infinity values in form of a set of `(start_vid, end_vid, agg_cost)`." +msgstr "Solo regresa los valores no infinitos en forma de un conjunto de `(start_vid, end_vid, agg_cost)`." -msgid "" -"Let be the case the values returned are stored in a table, so the unique " -"index would be the pair: `(start_vid, end_vid)`." -msgstr "" -"Sea el caso donde los valores devueltos se almacenan en una tabla, por lo " -"que el índice único sería el par: `(start_vid, end_vid)`." +msgid "Let be the case the values returned are stored in a table, so the unique index would be the pair: `(start_vid, end_vid)`." +msgstr "Sea el caso donde los valores devueltos se almacenan en una tabla, por lo que el índice único sería el par: `(start_vid, end_vid)`." msgid "For the undirected graph, the results are symmetric." msgstr "Para el grafo no dirigido, los resultados son simétricos." @@ -1984,8 +1658,7 @@ msgid "When `start_vid` = `end_vid`, the `agg_cost` = 0." msgstr "Cuando `start_vid` = `end_vid`, el `agg_cost` = 0." msgid "**Recommended, use a bounding box of no more than 3500 edges.**" -msgstr "" -"**Recomendación: utilice un cuadro delimitador de no más de 3500 aristas.**" +msgstr "**Recomendación: utilice un cuadro delimitador de no más de 3500 aristas.**" msgid "Optional parameters" msgstr "Parámetros opcionales" @@ -2044,14 +1717,8 @@ msgstr "Prueba" msgid "One" msgstr "Uno" -msgid "" -"This test is not with a bounding box The density of the passed graph is " -"extremely low. For each 30 tests were executed to get the average The " -"tested query is:" -msgstr "" -"Esta prueba no se hace con cuadro delimitador. La densidad del gráfico que " -"se pasa es extremadamente baja. Para cada se ejecutaron 30 pruebas " -"para obtener el medio. La consulta probada es:" +msgid "This test is not with a bounding box The density of the passed graph is extremely low. For each 30 tests were executed to get the average The tested query is:" +msgstr "Esta prueba no se hace con cuadro delimitador. La densidad del gráfico que se pasa es extremadamente baja. Para cada se ejecutaron 30 pruebas para obtener el medio. La consulta probada es:" msgid "The results of this tests are presented as:" msgstr "Los resultados de la prueba son:" @@ -2392,14 +2059,8 @@ msgstr "6.51" msgid "Two" msgstr "Dos" -msgid "" -"This test is with a bounding box The density of the passed graph higher than " -"of the Test One. For each 30 tests were executed to get the average " -"The tested edge query is:" -msgstr "" -"Esta prueba se hace con cuadro delimitador. La densidad del gráfico que se " -"pasa es superior a la de la prueba 1. Para cada se ejecutaron 30 " -"pruebas para obtener el medio. La consulta de arista que se prueba es:" +msgid "This test is with a bounding box The density of the passed graph higher than of the Test One. For each 30 tests were executed to get the average The tested edge query is:" +msgstr "Esta prueba se hace con cuadro delimitador. La densidad del gráfico que se pasa es superior a la de la prueba 1. Para cada se ejecutaron 30 pruebas para obtener el medio. La consulta de arista que se prueba es:" msgid "The tested queries" msgstr "Las consultas probadas" @@ -2701,61 +2362,29 @@ msgstr ":doc:`pgr_johnson`" msgid ":doc:`pgr_floydWarshall`" msgstr ":doc:`pgr_floydWarshall`" -msgid "" -"Boost `floyd-Warshall `__" -msgstr "" -"Boost `floyd-Warshall `_" +msgid "Boost `floyd-Warshall `__" +msgstr "Boost `floyd-Warshall `_" msgid "Bidirectional A* - Family of functions" msgstr "A* Bidireccional - Familia de Funciones" -msgid "" -"The bidirectional A* (pronounced \"A Star\") algorithm is based on the A* " -"algorithm." -msgstr "" -"El algoritmo bidirectional A* (leído \"A estrella\") se basa en el algoritmo " -"A*." +msgid "The bidirectional A* (pronounced \"A Star\") algorithm is based on the A* algorithm." +msgstr "El algoritmo bidirectional A* (leído \"A estrella\") se basa en el algoritmo A*." msgid ":doc:`pgr_bdAstar` - Bidirectional A* algorithm for obtaining paths." msgstr ":doc:`pgr_bdAstar` - Algoritmo bidireccional A* para obtener rutas." -msgid "" -":doc:`pgr_bdAstarCost` - Bidirectional A* algorithm to calculate the cost of " -"the paths." -msgstr "" -":doc:`pgr_bdAstarCost` - Algoritmo bidireccional A* para calcular el coste " -"de las rutas." +msgid ":doc:`pgr_bdAstarCost` - Bidirectional A* algorithm to calculate the cost of the paths." +msgstr ":doc:`pgr_bdAstarCost` - Algoritmo bidireccional A* para calcular el coste de las rutas." -msgid "" -":doc:`pgr_bdAstarCostMatrix` - Bidirectional A* algorithm to calculate a " -"cost matrix of paths." -msgstr "" -":doc:`pgr_bdAstarCostMatrix` - Algoritmo bidireccional A* para calcular una " -"matriz de costes de rutas." +msgid ":doc:`pgr_bdAstarCostMatrix` - Bidirectional A* algorithm to calculate a cost matrix of paths." +msgstr ":doc:`pgr_bdAstarCostMatrix` - Algoritmo bidireccional A* para calcular una matriz de costes de rutas." -msgid "" -"Based on A* algorithm, the bidirectional search finds a shortest path from a " -"starting vertex (``start_vid``) to an ending vertex (``end_vid``). It runs " -"two simultaneous searches: one forward from the ``start_vid``, and one " -"backward from the ``end_vid``, stopping when the two meet in the middle. " -"This implementation can be used with a directed graph and an undirected " -"graph." -msgstr "" -"La búsqueda bidireccional, basado en algoritmo de A*, encuentra el camino " -"más corto desde el vértice inicial (``start_vid``) hasta el vértice final " -"(``end_vid``). Ejecuta dos búsquedas simultáneas: uno hacia adelande del " -"``start_vid`` y la otra en reversa desde el ``end_vid``, parando cuando las " -"dos se encuentran en el medio. Esta aplicación puede utilizarse con un grafo " -"dirigido y un grafo sin dirección." +msgid "Based on A* algorithm, the bidirectional search finds a shortest path from a starting vertex (``start_vid``) to an ending vertex (``end_vid``). It runs two simultaneous searches: one forward from the ``start_vid``, and one backward from the ``end_vid``, stopping when the two meet in the middle. This implementation can be used with a directed graph and an undirected graph." +msgstr "La búsqueda bidireccional, basado en algoritmo de A*, encuentra el camino más corto desde el vértice inicial (``start_vid``) hasta el vértice final (``end_vid``). Ejecuta dos búsquedas simultáneas: uno hacia adelande del ``start_vid`` y la otra en reversa desde el ``end_vid``, parando cuando las dos se encuentran en el medio. Esta aplicación puede utilizarse con un grafo dirigido y un grafo sin dirección." -msgid "" -"For large graphs where there is a path between the starting vertex and " -"ending vertex:" -msgstr "" -"Para grandes grafos donde hay un camino entre el vértice inicial y el " -"vértice final:" +msgid "For large graphs where there is a path between the starting vertex and ending vertex:" +msgstr "Para grandes grafos donde hay un camino entre el vértice inicial y el vértice final:" msgid "It is expected to terminate faster than :doc:`pgr_aStar`" msgstr "Se espera que termine más rápido que :doc:`pgr_aStar`" @@ -2766,55 +2395,29 @@ msgstr ":doc:`aStar-family`" msgid "Bidirectional Dijkstra - Family of functions" msgstr "Bidirectional Dijkstra - Familia de funciones" -msgid "" -":doc:`pgr_bdDijkstra` - Bidirectional Dijkstra algorithm for the shortest " -"paths." -msgstr "" -":doc:`pgr_bdDijkstra` - Algoritmo Dijkstra bidireccional para las rutas más " -"cortas." +msgid ":doc:`pgr_bdDijkstra` - Bidirectional Dijkstra algorithm for the shortest paths." +msgstr ":doc:`pgr_bdDijkstra` - Algoritmo Dijkstra bidireccional para las rutas más cortas." -msgid "" -":doc:`pgr_bdDijkstraCost` - Bidirectional Dijkstra to calculate the cost of " -"the shortest paths" -msgstr "" -":doc:`pgr_bdDijkstraCost` - Dijkstra bidireccional para calcular el costo de " -"las rutas más cortas" +msgid ":doc:`pgr_bdDijkstraCost` - Bidirectional Dijkstra to calculate the cost of the shortest paths" +msgstr ":doc:`pgr_bdDijkstraCost` - Dijkstra bidireccional para calcular el costo de las rutas más cortas" -msgid "" -":doc:`pgr_bdDijkstraCostMatrix` - Bidirectional Dijkstra algorithm to create " -"a matrix of costs of the shortest paths." -msgstr "" -":doc:`pgr_bdDijkstraCostMatrix` - Algoritmo bidireccional de Dijkstra para " -"crear una matriz de costes de las rutas más cortas." +msgid ":doc:`pgr_bdDijkstraCostMatrix` - Bidirectional Dijkstra algorithm to create a matrix of costs of the shortest paths." +msgstr ":doc:`pgr_bdDijkstraCostMatrix` - Algoritmo bidireccional de Dijkstra para crear una matriz de costes de las rutas más cortas." msgid "Synopsis" msgstr "Sinopsis" -msgid "" -"Based on Dijkstra's algorithm, the bidirectional search finds a shortest " -"path a starting vertex to an ending vertex." -msgstr "" -"Basado en el algoritmo de Dijkstra, la búsqueda bidireccional encuentra el " -"camino más corto entre el vértice de inicio al vértice final." +msgid "Based on Dijkstra's algorithm, the bidirectional search finds a shortest path a starting vertex to an ending vertex." +msgstr "Basado en el algoritmo de Dijkstra, la búsqueda bidireccional encuentra el camino más corto entre el vértice de inicio al vértice final." -msgid "" -"It runs two simultaneous searches: one forward from the source, and one " -"backward from the target, stopping when the two meet in the middle." -msgstr "" -"Corre dos búsquedas simultaneas: una adelante de la fuente y otra atrás del " -"objetivo, parándose cuando los dos coinciden en medio." +msgid "It runs two simultaneous searches: one forward from the source, and one backward from the target, stopping when the two meet in the middle." +msgstr "Corre dos búsquedas simultaneas: una adelante de la fuente y otra atrás del objetivo, parándose cuando los dos coinciden en medio." -msgid "" -"This implementation can be used with a directed graph and an undirected " -"graph." -msgstr "" -"Esta implementación se puede usar para los grafos dirigidos y no dirigidos." +msgid "This implementation can be used with a directed graph and an undirected graph." +msgstr "Esta implementación se puede usar para los grafos dirigidos y no dirigidos." -msgid "" -"A negative value on a cost column is interpreted as the edge does not exist." -msgstr "" -"Valor no negativo en una columna de costo se interpreta como la arista no " -"exite." +msgid "A negative value on a cost column is interpreted as the edge does not exist." +msgstr "Valor no negativo en una columna de costo se interpreta como la arista no exite." msgid "When there is no path:" msgstr "Cuando no hay ruta:" @@ -2822,41 +2425,23 @@ msgstr "Cuando no hay ruta:" msgid "When the starting vertex and ending vertex are the same." msgstr "Cuando el vértice de salida y el vértice destino son iguales." -msgid "" -"The **aggregate cost** of the non included values :math:`(v, v)` is :math:`0`" -msgstr "" -"El **costo agregado** de los valores no incluídos :math:`(v, v)` es :math:`0`" +msgid "The **aggregate cost** of the non included values :math:`(v, v)` is :math:`0`" +msgstr "El **costo agregado** de los valores no incluídos :math:`(v, v)` es :math:`0`" -msgid "" -"When the starting vertex and ending vertex are the different and there is no " -"path:" -msgstr "" -"Cuando el vértice de salida y el vértice destino son diferentes y no hay " -"ninguna ruta:" +msgid "When the starting vertex and ending vertex are the different and there is no path:" +msgstr "Cuando el vértice de salida y el vértice destino son diferentes y no hay ninguna ruta:" -msgid "" -"The **aggregate cost** the non included values :math:`(u, v)` is :math:" -"`\\infty`" -msgstr "" -"El **costo agregado** de los valores no incluídos :math:`(u, v)` es :math: " -"`\\infty`" +msgid "The **aggregate cost** the non included values :math:`(u, v)` is :math:`\\infty`" +msgstr "El **costo agregado** de los valores no incluídos :math:`(u, v)` es :math: `\\infty`" -msgid "" -"For optimization purposes, any duplicated value in the starting vertices or " -"on the ending vertices are ignored." -msgstr "" -"Para fines de optimización, se ignora cualquier valor duplicado en los " -"vertices de salida o destino." +msgid "For optimization purposes, any duplicated value in the starting vertices or on the ending vertices are ignored." +msgstr "Para fines de optimización, se ignora cualquier valor duplicado en los vertices de salida o destino." msgid "Running time (worse case scenario): :math:`O((V \\log V + E))`" msgstr "Tiempo de ejecución (peor de los casos): :math:`O((V \\log V + E))`" -msgid "" -"For large graphs where there is a path bewtween the starting vertex and " -"ending vertex:" -msgstr "" -"Para grandes gráficos donde hay un camino entre el vértice inicial y el " -"vértice final:" +msgid "For large graphs where there is a path bewtween the starting vertex and ending vertex:" +msgstr "Para grandes gráficos donde hay un camino entre el vértice inicial y el vértice final:" msgid "It is expected to terminate faster than :doc:`pgr_dijkstra`" msgstr "Se espera que termine más rápido que :doc:`pgr_dijkstra`" @@ -2885,34 +2470,20 @@ msgstr "Tiempo de ejecución: :math:`O(E * (E + V * logV))`" msgid "Graph must be connected." msgstr "El grafo debe estar conectado." -msgid "" -"An Edges SQL that represents a **directed** graph with the following columns" -msgstr "" -"Un SQL de aristas que representa un grafo **dirigido** con las siguientes " -"columnas" +msgid "An Edges SQL that represents a **directed** graph with the following columns" +msgstr "Un SQL de aristas que representa un grafo **dirigido** con las siguientes columnas" msgid "Coloring - Family of functions" msgstr "Coloración - Familia de funciones" -msgid "" -":doc:`pgr_sequentialVertexColoring` - Vertex coloring algorithm using greedy " -"approach." -msgstr "" -":doc:`pgr_sequentialVertexColoring`- Algoritmo de coloración de vértices " -"mediante un enfoque codicioso." +msgid ":doc:`pgr_sequentialVertexColoring` - Vertex coloring algorithm using greedy approach." +msgstr ":doc:`pgr_sequentialVertexColoring`- Algoritmo de coloración de vértices mediante un enfoque codicioso." -msgid "" -":doc:`pgr_bipartite` - Bipartite graph algorithm using a DFS-based coloring " -"approach." -msgstr "" -":doc:`pgr_bipartite` - Algoritmo de grafo bipartito mediante un enfoque de " -"coloración basado en DFS." +msgid ":doc:`pgr_bipartite` - Bipartite graph algorithm using a DFS-based coloring approach." +msgstr ":doc:`pgr_bipartite` - Algoritmo de grafo bipartito mediante un enfoque de coloración basado en DFS." -msgid "" -":doc:`pgr_edgeColoring` - Edge Coloring algorithm using Vizing's theorem." -msgstr "" -":doc:`pgr_edgeColoring` - Algoritmo de coloración de segmentos utilizando el " -"teorema de Vizing." +msgid ":doc:`pgr_edgeColoring` - Edge Coloring algorithm using Vizing's theorem." +msgstr ":doc:`pgr_edgeColoring` - Algoritmo de coloración de segmentos utilizando el teorema de Vizing." msgid "Returns set of |result_edge_color|" msgstr "Regresa el conjunto de |result_edge_color|" @@ -2935,46 +2506,29 @@ msgstr "Identificador del nodo." msgid "Color of the node." msgstr "Color del nodo." -msgid "" -"`Boost: `__" -msgstr "" -"`Boost: `__" +msgid "`Boost: `__" +msgstr "`Boost: `__" msgid "Components - Family of functions" msgstr "Componentes - Familia de funciones" -msgid "" -":doc:`pgr_connectedComponents` - Connected components of an undirected graph." -msgstr "" -":doc:`pgr_connectedComponents` - Componentes conectados de un grafo no " -"dirigido." +msgid ":doc:`pgr_connectedComponents` - Connected components of an undirected graph." +msgstr ":doc:`pgr_connectedComponents` - Componentes conectados de un grafo no dirigido." -msgid "" -":doc:`pgr_strongComponents` - Strongly connected components of a directed " -"graph." -msgstr "" -":doc:`pgr_strongComponents` - Componentes fuertemente conectados de un grafo " -"dirigido." +msgid ":doc:`pgr_strongComponents` - Strongly connected components of a directed graph." +msgstr ":doc:`pgr_strongComponents` - Componentes fuertemente conectados de un grafo dirigido." -msgid "" -":doc:`pgr_biconnectedComponents` - Biconnected components of an undirected " -"graph." -msgstr "" -":doc:`pgr_biconnectedComponents` - Componentes biconectados de un grafo no " -"dirigido." +msgid ":doc:`pgr_biconnectedComponents` - Biconnected components of an undirected graph." +msgstr ":doc:`pgr_biconnectedComponents` - Componentes biconectados de un grafo no dirigido." -msgid "" -":doc:`pgr_articulationPoints` - Articulation points of an undirected graph." -msgstr "" -":doc:`pgr_articulationPoints` - Puntos de articulación de un grafo no " -"dirigido." +msgid ":doc:`pgr_articulationPoints` - Articulation points of an undirected graph." +msgstr ":doc:`pgr_articulationPoints` - Puntos de articulación de un grafo no dirigido." msgid ":doc:`pgr_bridges` - Bridges of an undirected graph." msgstr ":doc:`pgr_bridges` - Puentes de un grafo no dirigido." msgid ":doc:`pgr_makeConnected` - Details of edges to make graph connected." -msgstr "" -":doc:`pgr_makeConnected` - Detalles de aristas para hacer grafos conectados." +msgstr ":doc:`pgr_makeConnected` - Detalles de aristas para hacer grafos conectados." msgid "Contraction - Family of functions" msgstr "Contraction - Familia de funciones" @@ -2991,29 +2545,11 @@ msgstr ":doc:`pgr_contractionLinear`" msgid ":doc:`pgr_contractionHierarchies`" msgstr ":doc:`pgr_contractionHierarchies`" -msgid "" -"In large graphs, like road graphs or electric networks, graph contraction " -"can be used to speed up some graph algorithms. Contraction can reduce the " -"size of the graph by removing some of the vertices and edges and adding " -"edges that represent a sequence of original edges (the original ones can be " -"kept in some methods). In this way, it decreases the total time and space " -"used by graph algorithms, particularly those searching for an optimal path." -msgstr "" -"En grafos de gran tamaño, como los grafos de carreteras o las redes " -"eléctricas, la contracción de grafos puede utilizarse para acelerar algunos " -"algoritmos de grafos. La contracción puede reducir el tamaño del grafo " -"eliminando algunos de los vértices y aristas y añadiendo aristas que " -"representen una secuencia de aristas originales (en algunos métodos pueden " -"conservarse las originales). De este modo, disminuye el tiempo y el espacio " -"totales utilizados por los algoritmos de grafos, en particular los que " -"buscan un camino óptimo." +msgid "In large graphs, like road graphs or electric networks, graph contraction can be used to speed up some graph algorithms. Contraction can reduce the size of the graph by removing some of the vertices and edges and adding edges that represent a sequence of original edges (the original ones can be kept in some methods). In this way, it decreases the total time and space used by graph algorithms, particularly those searching for an optimal path." +msgstr "En grafos de gran tamaño, como los grafos de carreteras o las redes eléctricas, la contracción de grafos puede utilizarse para acelerar algunos algoritmos de grafos. La contracción puede reducir el tamaño del grafo eliminando algunos de los vértices y aristas y añadiendo aristas que representen una secuencia de aristas originales (en algunos métodos pueden conservarse las originales). De este modo, disminuye el tiempo y el espacio totales utilizados por los algoritmos de grafos, en particular los que buscan un camino óptimo." -msgid "" -"This implementation gives a flexible framework for adding contraction " -"algorithms in the future. Currently, it supports three algorithms." -msgstr "" -"Esta implementación ofrece un marco flexible para agregar algoritmos de " -"contracción en el futuro, actualmente, admite dos algoritmos." +msgid "This implementation gives a flexible framework for adding contraction algorithms in the future. Currently, it supports three algorithms." +msgstr "Esta implementación ofrece un marco flexible para agregar algoritmos de contracción en el futuro, actualmente, admite dos algoritmos." msgid "Dead end contraction" msgstr "Contracción sin salida" @@ -3024,22 +2560,14 @@ msgstr "Contracción lineal" msgid "Contraction hierarchies" msgstr "Jerarquías de contracción" -msgid "" -"The two first ones can be combined through a iterative procedure, via the " -"``pgr_contraction`` method. The third one is implemented on its own." +msgid "The two first ones can be combined through a iterative procedure, via the ``pgr_contraction`` method. The third one is implemented on its own." msgstr "" msgid "All functions allow the user to forbid contraction on a set of nodes." -msgstr "" -"Todas las funciones permiten al usuario prohibir la contracción en un " -"conjunto de nodos." +msgstr "Todas las funciones permiten al usuario prohibir la contracción en un conjunto de nodos." -msgid "" -"https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/" -"lecture16.pdf" -msgstr "" -"https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/" -"lecture16.pdf" +msgid "https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/lecture16.pdf" +msgstr "https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/lecture16.pdf" msgid "https://ae.iti.kit.edu/download/diploma_thesis_geisberger.pdf" msgstr "https://ae.iti.kit.edu/download/diploma_thesis_geisberger.pdf" @@ -3071,36 +2599,20 @@ msgstr ":doc:`pgr_withPointsCost`" msgid "Each function works as part of the family it belongs to." msgstr "Cada función funciona como parte de la familia a la que pertenece." -msgid "" -"Returns the sum of the costs of the shortest path of each pair combination " -"of nodes requested." -msgstr "" -"Devuelve la suma de los costos de la ruta más corta para cada par de " -"combinación de nodos requeridos." +msgid "Returns the sum of the costs of the shortest path of each pair combination of nodes requested." +msgstr "Devuelve la suma de los costos de la ruta más corta para cada par de combinación de nodos requeridos." -msgid "" -"Let be the case the values returned are stored in a table, so the unique " -"index would be the pair: ``(start_vid, end_vid)``." -msgstr "" -"Sea el caso que los valores devueltos se almacenen en una tabla, el índice " -"único sería el par: `(start_vid, end_vid)`." +msgid "Let be the case the values returned are stored in a table, so the unique index would be the pair: ``(start_vid, end_vid)``." +msgstr "Sea el caso que los valores devueltos se almacenen en una tabla, el índice único sería el par: `(start_vid, end_vid)`." -msgid "" -"Depending on the function and its parameters, the results can be symmetric." -msgstr "" -"Dependiendo de la función y sus parámetros, los resultados pueden ser " -"simétricos." +msgid "Depending on the function and its parameters, the results can be symmetric." +msgstr "Dependiendo de la función y sus parámetros, los resultados pueden ser simétricos." -msgid "" -"The **aggregate cost** of :math:`(u, v)` is the same as for :math:`(v, u)`." -msgstr "" -"El **costo agregado** de :math:`(u, v)` es el mismo que para :math:`(v, u)`." +msgid "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 "Any duplicated value in the start or end vertex identifiers are ignored." +msgstr "Se omite cualquier valor duplicado en los identificadores de vertices de inicio y destino." msgid "The returned values are ordered:" msgstr "Los valores regresados se ordenan:" @@ -3129,81 +2641,50 @@ msgstr ":doc:`pgr_bdDijkstraCostMatrix`" msgid ":doc:`pgr_withPointsCostMatrix`" msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "" -":doc:`TSP-family` needs as input a symmetric cost matrix and no edge `(u, " -"v)` must value :math:`\\infty`." -msgstr "" -":doc:`TSP-family` necesita como entrada una matriz de costos simétrica y sin " -"borde `(u, v)`, debe valorar :math:`\\infty`." +msgid ":doc:`TSP-family` needs as input a symmetric cost matrix and no edge `(u, v)` must value :math:`\\infty`." +msgstr ":doc:`TSP-family` necesita como entrada una matriz de costos simétrica y sin borde `(u, v)`, debe valorar :math:`\\infty`." -msgid "" -"This collection of functions will return a cost matrix in form of a table." -msgstr "" -"Esta colección de funciones devolverá una matriz de costes en forma de tabla." +msgid "This collection of functions will return a cost matrix in form of a table." +msgstr "Esta colección de funciones devolverá una matriz de costes en forma de tabla." msgid "Can be used as input to :doc:`pgr_TSP`." msgstr "Se puede utilizar como entrada para :doc:`pgr_TSP`." -msgid "" -"Use directly when the resulting matrix is symmetric and there is no :math:" -"`\\infty` value." -msgstr "" -"Usar directamente cuando la matriz resultante es simétrica y no hay valor :" -"math:`\\infty`." +msgid "Use directly when the resulting matrix is symmetric and there is no :math:`\\infty` value." +msgstr "Usar directamente cuando la matriz resultante es simétrica y no hay valor :math:`\\infty`." msgid "It will be the users responsibility to make the matrix symmetric." msgstr "Es responsabilidad dels usuario hacer que la matriz sea simétrica." msgid "By using geometric or harmonic average of the non symmetric values." -msgstr "" -"Mediante el uso de la media geométrica o armónica de los valores no " -"simétricos." +msgstr "Mediante el uso de la media geométrica o armónica de los valores no simétricos." msgid "By using max or min the non symmetric values." msgstr "Mediante el uso de max o min, los valores no simétricos." -msgid "" -"By setting the upper triangle to be the mirror image of the lower triangle." -msgstr "" -"Estableciendo el triángulo superior para que sea la imagen reflejada del " -"triángulo inferior." +msgid "By setting the upper triangle to be the mirror image of the lower triangle." +msgstr "Estableciendo el triángulo superior para que sea la imagen reflejada del triángulo inferior." -msgid "" -"By setting the lower triangle to be the mirror image of the upper triangle." -msgstr "" -"Estableciendo el triángulo inferior para que sea la imagen reflejada del " -"triángulo superior." +msgid "By setting the lower triangle to be the mirror image of the upper triangle." +msgstr "Estableciendo el triángulo inferior para que sea la imagen reflejada del triángulo superior." msgid "It is also the users responsibility to fix an :math:`\\infty` value." -msgstr "" -"También es responsabilidad de los usuarios para fijar un valor :math:" -"`\\infty`." +msgstr "También es responsabilidad de los usuarios para fijar un valor :math:`\\infty`." -msgid "" -"Returns the sum of the costs of the shortest path for pair combination of " -"nodes in the graph." -msgstr "" -"Devuelve la suma de los costos de la ruta más corta para la combinación de " -"pares de nodos en el grafo." +msgid "Returns the sum of the costs of the shortest path for pair combination of nodes in the graph." +msgstr "Devuelve la suma de los costos de la ruta más corta para la combinación de pares de nodos en el grafo." -msgid "" -"When the starting vertex and ending vertex are the same, there is no path." -msgstr "" -"Cuando el vértice inicial y el vértice final son iguales, no hay camino." +msgid "When the starting vertex and ending vertex are the same, there is no path." +msgstr "Cuando el vértice inicial y el vértice final son iguales, no hay camino." msgid "The aggregate cost in the non included values `(v, v)` is `0`." msgstr "El costo agregado de los valores no incluídos `(v, v)` es `0`." -msgid "" -"When the starting vertex and ending vertex are the different and there is no " -"path." -msgstr "" -"Cuando el vértice inicial y el vértice final son diferentes y no hay ruta." +msgid "When the starting vertex and ending vertex are the different and there is no path." +msgstr "Cuando el vértice inicial y el vértice final son diferentes y no hay ruta." -msgid "" -"The aggregate cost in the non included values `(u, v)` is :math:`\\infty`." -msgstr "" -"El costo agregado de los valores no incluídos ``(u, v)`` es :math: `\\infty`." +msgid "The aggregate cost in the non included values `(u, v)` is :math:`\\infty`." +msgstr "El costo agregado de los valores no incluídos ``(u, v)`` es :math: `\\infty`." msgid "Let be the case the values returned are stored in a table:" msgstr "Sea el caso, los valores devueltos se almacenan en una tabla:" @@ -3250,21 +2731,14 @@ msgstr "**valor**" msgid "Identifier of the point." msgstr "Identificador del punto." -msgid "" -"Use with positive value, as internally will be converted to negative value" -msgstr "" -"Use con un valor positivo, dado que internamente se convertirá a un valor " -"negativo" +msgid "Use with positive value, as internally will be converted to negative value" +msgstr "Use con un valor positivo, dado que internamente se convertirá a un valor negativo" msgid "If column is present, it can not be NULL." msgstr "Si columna esta presente, no puede ser NULL." -msgid "" -"If column is not present, a sequential negative **value** will be given " -"automatically." -msgstr "" -"Si columna no esta presente, un **valor** secuencial negativo se otorgará " -"automáticamente." +msgid "If column is not present, a sequential negative **value** will be given automatically." +msgstr "Si columna no esta presente, un **valor** secuencial negativo se otorgará automáticamente." msgid "``edge_id``" msgstr "``edge_id``" @@ -3275,12 +2749,8 @@ msgstr "Identificador de la arista \"más cercana\" al punto." msgid "``fraction``" msgstr "``fraction``" -msgid "" -"Value in <0,1> that indicates the relative position from the first end point " -"of the edge." -msgstr "" -"El valor en <0,1> que indica la posición relativa desde el primer punto " -"final de la arista." +msgid "Value in <0,1> that indicates the relative position from the first end point of the edge." +msgstr "El valor en <0,1> que indica la posición relativa desde el primer punto final de la arista." msgid "``side``" msgstr "``side``" @@ -3313,59 +2783,34 @@ msgid ":doc:`pgr_dijkstra` - Dijkstra's algorithm for the shortest paths." msgstr ":doc:`pgr_dijkstra` - Algoritmo de Dijkstra para las rutas más cortas." msgid ":doc:`pgr_dijkstraCost` - Get the aggregate cost of the shortest paths." -msgstr "" -":doc:`pgr_dijkstraCost` - Obtener el costo agregado de las rutas más cortas." +msgstr ":doc:`pgr_dijkstraCost` - Obtener el costo agregado de las rutas más cortas." -msgid "" -":doc:`pgr_dijkstraCostMatrix` - Use pgr_dijkstra to create a costs matrix." -msgstr "" -":doc:`pgr_dijkstraCostMatrix` - Usar pgr_dijkstra para crear una matriz de " -"costes." +msgid ":doc:`pgr_dijkstraCostMatrix` - Use pgr_dijkstra to create a costs matrix." +msgstr ":doc:`pgr_dijkstraCostMatrix` - Usar pgr_dijkstra para crear una matriz de costes." -msgid "" -":doc:`pgr_drivingDistance` - Use pgr_dijkstra to calculate catchament " -"information." -msgstr "" -":doc:`pgr_drivingDistance` - Usar pgr_dijkstra para calcular información de " -"captación." +msgid ":doc:`pgr_drivingDistance` - Use pgr_dijkstra to calculate catchament information." +msgstr ":doc:`pgr_drivingDistance` - Usar pgr_dijkstra para calcular información de captación." -msgid "" -":doc:`pgr_KSP` - Use Yen algorithm with pgr_dijkstra to get the K shortest " -"paths." -msgstr "" -":doc:`pgr_KSP` - Usar el algoritmo Yen con pgr_dijkstra para obtener las K " -"rutas más cortas." +msgid ":doc:`pgr_KSP` - Use Yen algorithm with pgr_dijkstra to get the K shortest paths." +msgstr ":doc:`pgr_KSP` - Usar el algoritmo Yen con pgr_dijkstra para obtener las K rutas más cortas." msgid ":doc:`pgr_dijkstraVia` - Get a route of a sequence of vertices." -msgstr "" -":doc:`pgr_dijkstraVia` - Obtener una ruta para una secuencia de vértices." +msgstr ":doc:`pgr_dijkstraVia` - Obtener una ruta para una secuencia de vértices." msgid ":doc:`pgr_dijkstraNear` - Get the route to the nearest vertex." msgstr ":doc:`pgr_dijkstraNear` - Obtener la ruta al vértice más cercano." msgid ":doc:`pgr_dijkstraNearCost` - Get the cost to the nearest vertex." -msgstr "" -":doc:`pgr_dijkstraNearCost` - Consigue el costo del vértice más cercano." +msgstr ":doc:`pgr_dijkstraNearCost` - Consigue el costo del vértice más cercano." -msgid "" -"Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra " -"in 1956. It is a graph search algorithm that solves the shortest path " -"problem for a graph with non-negative edge path costs, producing a shortest " -"path from a starting vertex to an ending vertex. This implementation can be " -"used with a directed graph and an undirected graph." -msgstr "" -"Algoritmo de Dijkstra, concebido por el informático holandés Edsger Dijkstra " -"en 1956. Es un algoritmo de búsqueda en grafos que resuelve el problema de " -"ruta más corta para un grafo con costos de aristas no negativos, produciendo " -"la ruta más corta desde un vértice inicial a un vértice final . Esta " -"implementación se puede utilizar con un grafos dirigidos y no dirigidos." +msgid "Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956. It is a graph search algorithm that solves the shortest path problem for a graph with non-negative edge path costs, producing a shortest path from a starting vertex to an ending vertex. This implementation can be used with a directed graph and an undirected graph." +msgstr "Algoritmo de Dijkstra, concebido por el informático holandés Edsger Dijkstra en 1956. Es un algoritmo de búsqueda en grafos que resuelve el problema de ruta más corta para un grafo con costos de aristas no negativos, produciendo la ruta más corta desde un vértice inicial a un vértice final . Esta implementación se puede utilizar con un grafos dirigidos y no dirigidos." msgid "Running time: :math:`O(| start\\ vids | * (V \\log V + E))`" msgstr "Tiempo de ejecución: :math:`O(| start\\_vids | * (V \\log V + E))`" msgid "The Dijkstra family functions are based on the Dijkstra algorithm." -msgstr "" -"Las funciones de la familia de Dijkstra se basan en el algoritmo de Dijkstra." +msgstr "Las funciones de la familia de Dijkstra se basan en el algoritmo de Dijkstra." msgid "`Combinations SQL`_" msgstr "`SQL de combinaciones`_" @@ -3409,12 +2854,8 @@ msgstr "Dada la siguiente consulta:" msgid "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" -msgid "" -"where :math:`sql = \\{(id_i, source_i, target_i, cost_i, reverse\\_cost_i)\\}" -"`" -msgstr "" -"Donde :math:`sql = \\{(id_i, source_i, target_i, cost_i, reverse\\_cost_i)\\}" -"`" +msgid "where :math:`sql = \\{(id_i, source_i, target_i, cost_i, reverse\\_cost_i)\\}`" +msgstr "Donde :math:`sql = \\{(id_i, source_i, target_i, cost_i, reverse\\_cost_i)\\}`" msgid "and" msgstr "y" @@ -3443,22 +2884,8 @@ msgstr ":math:`V = source \\cup target \\cup {start_{vid}} \\cup {end_{vid}}`" msgid "the set of edges :math:`E`" msgstr "El conjunto de aristas :math:`E`" -msgid "" -":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) " -"\\text{ when } cost >=0 \\} & \\quad \\text{if } reverse\\_cost = " -"\\varnothing \\\\ \\text{ } \\text{ } & \\quad \\text{ } \\\\ \\text{ } " -"\\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & \\quad " -"\\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) " -"\\text{ when } reverse\\_cost_i>=0 \\} & \\quad \\text{if } reverse\\_cost " -"\\neq \\varnothing \\\\ \\end{cases}`" -msgstr "" -":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) " -"\\text{ when } cost >=0 \\} & \\quad \\text{if } reverse\\_cost = " -"\\varnothing \\\\ \\text{ } \\text{ } & \\quad \\text{ } \\\\ \\text{ } " -"\\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & \\quad " -"\\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) " -"\\text{ when } reverse\\_cost_i>=0 \\} & \\quad \\text{if } reverse\\_cost " -"\\neq \\varnothing \\\\ \\end{cases}`" +msgid ":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & \\quad \\text{if } reverse\\_cost = \\varnothing \\\\ \\text{ } \\text{ } & \\quad \\text{ } \\\\ \\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & \\quad \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) \\text{ when } reverse\\_cost_i>=0 \\} & \\quad \\text{if } reverse\\_cost \\neq \\varnothing \\\\ \\end{cases}`" +msgstr ":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & \\quad \\text{if } reverse\\_cost = \\varnothing \\\\ \\text{ } \\text{ } & \\quad \\text{ } \\\\ \\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & \\quad \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) \\text{ when } reverse\\_cost_i>=0 \\} & \\quad \\text{if } reverse\\_cost \\neq \\varnothing \\\\ \\end{cases}`" msgid "Undirected graph" msgstr "Grafo no dirigido" @@ -3469,28 +2896,8 @@ msgstr "El grafo ponderado no dirigido, :math:`G_u(V,E)`, es definido por:" msgid ":math:`V = source \\cup target \\cup {start_v{vid}} \\cup {end_{vid}}`" msgstr ":math:`V = source \\cup target \\cup {start_v{vid}} \\cup {end_{vid}}`" -msgid "" -":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) " -"\\text{ when } cost >=0 \\} & \\quad \\text{ } \\\\ \\cup \\{(target_i, " -"source_i, cost_i) \\text{ when } cost >=0 \\} & \\quad \\text{ if } " -"reverse\\_cost = \\varnothing \\\\ \\text{ } \\text{ } & \\text{ } \\\\ " -"\\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & " -"\\text{ } \\\\ \\cup \\{(target_i, source_i, cost_i) \\text{ when } cost >=0 " -"\\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) " -"\\text{ when } reverse\\_cost_i >=0)\\} & \\text{ } \\\\ \\cup \\{(source_i, " -"target_i, reverse\\_cost_i) \\text{ when } reverse\\_cost_i >=0)\\} & \\quad " -"\\text{ if } reverse\\_cost \\neq \\varnothing \\\\ \\end{cases}`" -msgstr "" -":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) " -"\\text{ when } cost >=0 \\} & \\quad \\text{ } \\\\ \\cup \\{(target_i, " -"source_i, cost_i) \\text{ when } cost >=0 \\} & \\quad \\text{ if } " -"reverse\\_cost = \\varnothing \\\\ \\text{ } \\text{ } & \\text{ } \\\\ " -"\\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & " -"\\text{ } \\\\ \\cup \\{(target_i, source_i, cost_i) \\text{ when } cost >=0 " -"\\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) " -"\\text{ when } reverse\\_cost_i >=0)\\} & \\text{ } \\\\ \\cup \\{(source_i, " -"target_i, reverse\\_cost_i) \\text{ when } reverse\\_cost_i >=0)\\} & \\quad " -"\\text{ if } reverse\\_cost \\neq \\varnothing \\\\ \\end{cases}`" +msgid ":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & \\quad \\text{ } \\\\ \\cup \\{(target_i, source_i, cost_i) \\text{ when } cost >=0 \\} & \\quad \\text{ if } reverse\\_cost = \\varnothing \\\\ \\text{ } \\text{ } & \\text{ } \\\\ \\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, cost_i) \\text{ when } cost >=0 \\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) \\text{ when } reverse\\_cost_i >=0)\\} & \\text{ } \\\\ \\cup \\{(source_i, target_i, reverse\\_cost_i) \\text{ when } reverse\\_cost_i >=0)\\} & \\quad \\text{ if } reverse\\_cost \\neq \\varnothing \\\\ \\end{cases}`" +msgstr ":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & \\quad \\text{ } \\\\ \\cup \\{(target_i, source_i, cost_i) \\text{ when } cost >=0 \\} & \\quad \\text{ if } reverse\\_cost = \\varnothing \\\\ \\text{ } \\text{ } & \\text{ } \\\\ \\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, cost_i) \\text{ when } cost >=0 \\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) \\text{ when } reverse\\_cost_i >=0)\\} & \\text{ } \\\\ \\cup \\{(source_i, target_i, reverse\\_cost_i) \\text{ when } reverse\\_cost_i >=0)\\} & \\quad \\text{ if } reverse\\_cost \\neq \\varnothing \\\\ \\end{cases}`" msgid "The problem" msgstr "El problema" @@ -3504,22 +2911,14 @@ msgstr ":math:`start_{vid} \\in V` un vértice inicial" msgid ":math:`end_{vid} \\in V` an ending vertex" msgstr ":math:`end_{vid} \\in V` un vértice final" -msgid "" -":math:`G(V,E) = \\begin{cases} G_d(V,E) & \\quad \\text{ if6 } directed = " -"true \\\\ G_u(V,E) & \\quad \\text{ if5 } directed = false \\\\ \\end{cases}`" -msgstr "" -":math:`G(V,E) = \\begin{cases} G_d(V,E) & \\quad \\text{ if6 } directed = " -"true \\\\ G_u(V,E) & \\quad \\text{ if5 } directed = false \\\\ \\end{cases}`" +msgid ":math:`G(V,E) = \\begin{cases} G_d(V,E) & \\quad \\text{ if6 } directed = true \\\\ G_u(V,E) & \\quad \\text{ if5 } directed = false \\\\ \\end{cases}`" +msgstr ":math:`G(V,E) = \\begin{cases} G_d(V,E) & \\quad \\text{ if6 } directed = true \\\\ G_u(V,E) & \\quad \\text{ if5 } directed = false \\\\ \\end{cases}`" msgid "Then:" msgstr "Entonces:" -msgid "" -":math:`\\boldsymbol{\\pi} = \\{(path\\_seq_i, node_i, edge_i, cost_i, " -"agg\\_cost_i)\\}`" -msgstr "" -":math:`\\boldsymbol{\\pi} = \\{(path\\_seq_i, node_i, edge_i, cost_i, " -"agg\\_cost_i)\\}`" +msgid ":math:`\\boldsymbol{\\pi} = \\{(path\\_seq_i, node_i, edge_i, cost_i, agg\\_cost_i)\\}`" +msgstr ":math:`\\boldsymbol{\\pi} = \\{(path\\_seq_i, node_i, edge_i, cost_i, agg\\_cost_i)\\}`" msgid "where:" msgstr "donde:" @@ -3539,57 +2938,29 @@ 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:`\\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:`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 ":math:`agg\\_cost_i = \\begin{cases} 0 &\\quad \\text{when } i = 1 \\\\ \\displaystyle\\sum_{k=1}^{i} cost_{(node_{k-1}, node_k)} &\\quad \\text{when } i \\neq 1 \\\\ \\end{cases}`" +msgstr ":math:`agg\\_cost_i = \\begin{cases} 0 &\\quad \\text{when } i = 1 \\\\ \\displaystyle\\sum_{k=1}^{i} cost_{(node_{k-1}, node_k)} &\\quad \\text{when } i \\neq 1 \\\\ \\end{cases}`" -msgid "" -"In other words: The algorithm returns a the shortest path between :math:" -"`start_{vid}` and :math:`end_{vid}`, if it exists, in terms of a sequence of " -"nodes and of edges," -msgstr "" -"En otras palabras: El algoritmo devuelve la ruta más corta entre :math:" -"`start_{vid}` y :math:`end_{vid}`, si es que existe, en términos de una " -"secuencia de nodos y de aristas," +msgid "In other words: The algorithm returns a the shortest path between :math:`start_{vid}` and :math:`end_{vid}`, if it exists, in terms of a sequence of nodes and of edges," +msgstr "En otras palabras: El algoritmo devuelve la ruta más corta entre :math:`start_{vid}` y :math:`end_{vid}`, si es que existe, en términos de una secuencia de nodos y de aristas," -msgid "" -":math:`path\\_seq` indicates the relative position in the path of the :math:" -"`node` or :math:`edge`." -msgstr "" -":math:`path\\_seq` indica la posición relativa en el camino de :math:`node` " -"o :math:`edge`." +msgid ":math:`path\\_seq` indicates the relative position in the path of the :math:`node` or :math:`edge`." +msgstr ":math:`path\\_seq` indica la posición relativa en el camino de :math:`node` o :math:`edge`." msgid ":math:`cost` is the cost of the edge to be used to go to the next node." -msgstr "" -":math:`cost` es el coste del borde que se utilizará para ir al siguiente " -"nodo." +msgstr ":math:`cost` es el coste del borde que se utilizará para ir al siguiente nodo." -msgid "" -":math:`agg\\_cost` is the cost from the :math:`start_{vid}` up to the node." -msgstr "" -":math:`agg\\_cost` es el costo desde el :math:`start_{vid}` hasta el nodo." +msgid ":math:`agg\\_cost` is the cost from the :math:`start_{vid}` up to the node." +msgstr ":math:`agg\\_cost` es el costo desde el :math:`start_{vid}` hasta el nodo." msgid "If there is no path, the resulting set is empty." msgstr "Si no hay ruta, el conjunto resultante estará vacío." @@ -3597,18 +2968,14 @@ msgstr "Si no hay ruta, el conjunto resultante estará vacío." msgid "Driving Distance - Category" msgstr "Distancia Manejando - Categoría" -msgid "" -":doc:`pgr_drivingDistance` - Driving Distance based on Dijkstra's algorithm" -msgstr "" -":doc:`pgr_drivingDistance` - Distancia de Manejo basada en el algoritmo de " -"Dijkstra" +msgid ":doc:`pgr_drivingDistance` - Driving Distance based on Dijkstra's algorithm" +msgstr ":doc:`pgr_drivingDistance` - Distancia de Manejo basada en el algoritmo de Dijkstra" msgid ":doc:`pgr_primDD` - Driving Distance based on Prim's algorithm" msgstr ":doc:`pgr_primDD` - Distancia de manejo basada en el algoritmo de Prim" msgid ":doc:`pgr_kruskalDD` - Driving Distance based on Kruskal's algorithm" -msgstr "" -":doc:`pgr_kruskalDD` - Distancia de Manejo basada en el algoritmo de Kruskal" +msgstr ":doc:`pgr_kruskalDD` - Distancia de Manejo basada en el algoritmo de Kruskal" msgid ":doc:`pgr_withPointsDD` - Driving Distance based on pgr_withPoints" msgstr ":doc:`pgr_withPointsDD` - Distancia Manejando basada en pgr_withPoints" @@ -3616,16 +2983,11 @@ msgstr ":doc:`pgr_withPointsDD` - Distancia Manejando basada en pgr_withPoints" msgid "Calculate nodes that are within a distance." msgstr "Calcular nodos que están dentro de una distancia." -msgid "" -"Extracts all the nodes that have costs less than or equal to the value " -"distance." -msgstr "" -"Extrae todos los nodos que tienen costos menor o igual al valor de la " -"distancia." +msgid "Extracts all the nodes that have costs less than or equal to the value distance." +msgstr "Extrae todos los nodos que tienen costos menor o igual al valor de la distancia." msgid "The edges extracted will conform to the corresponding spanning tree." -msgstr "" -"Las aristas extraídas conformarán el correspondiente árbol de expansión." +msgstr "Las aristas extraídas conformarán el correspondiente árbol de expansión." msgid "Edge :math:`(u, v)` will not be included when:" msgstr "Arista :math:`(u, v)` no se incluye cuando:" @@ -3636,13 +2998,8 @@ msgstr "La distancia de la **raiz** a:math:`u` > límite de la distancia." msgid "The distance from the **root** to :math:`v` > limit distance." msgstr "La distancia de la **raiz** a :math:`v` > límite de la distancia." -msgid "" -"No new nodes are created on the graph, so when is within the limit and is " -"not within the limit, the edge is not included." -msgstr "" -"No se crean nuevos nodos en el grafo, por lo que cuando el vértice está " -"dentro de los límites y parte de la arista no está dentro de los límites, la " -"arsta no se incluye." +msgid "No new nodes are created on the graph, so when is within the limit and is not within the limit, the edge is not included." +msgstr "No se crean nuevos nodos en el grafo, por lo que cuando el vértice está dentro de los límites y parte de la arista no está dentro de los límites, la arsta no se incluye." msgid "Edges SQL as described below." msgstr "SQL de aristas como se describen abajo." @@ -3678,9 +3035,7 @@ msgid "When ``node`` = ``start_vid`` then has the value ``node``." msgstr "Cuando ``node`` = ``start_vid`` entonces tiene el valor ``node``." msgid "Identifier of the ``edge`` used to arrive from ``pred`` to ``node``." -msgstr "" -"Identificador del ``edge`` utilizado para llegar desde ``pred`` hasta " -"``node``." +msgstr "Identificador del ``edge`` utilizado para llegar desde ``pred`` hasta ``node``." msgid "Experimental Functions" msgstr "Funciones Experimentales" @@ -3692,8 +3047,7 @@ msgid ":doc:`flow-family`" msgstr ":doc:`flow-family`" msgid ":doc:`pgr_maxFlowMinCost` - Details of flow and cost on edges." -msgstr "" -":doc:`pgr_maxFlowMinCost` - Detalles del flujo y el coste en los bordes." +msgstr ":doc:`pgr_maxFlowMinCost` - Detalles del flujo y el coste en los bordes." msgid ":doc:`pgr_maxFlowMinCost_Cost` - Only the Min Cost calculation." msgstr ":doc:`pgr_maxFlowMinCost_Cost` - Solo el cálculo del Coste Mínimo." @@ -3710,27 +3064,17 @@ msgstr ":doc:`contraction-family`" msgid ":doc:`transformation-family`" msgstr ":doc:`transformation-family`" -msgid "" -":doc:`pgr_lineGraphFull` - Transformation algorithm for generating a Line " -"Graph out of each vertex in the input graph." -msgstr "" -":doc:`pgr_lineGraphFull` - Algoritmo de transformación para generar un grafo " -"de líneas a partir de cada vértice en el grafo de entrada." +msgid ":doc:`pgr_lineGraphFull` - Transformation algorithm for generating a Line Graph out of each vertex in the input graph." +msgstr ":doc:`pgr_lineGraphFull` - Algoritmo de transformación para generar un grafo de líneas a partir de cada vértice en el grafo de entrada." msgid ":doc:`traversal-family`" msgstr ":doc:`traversal-family`" -msgid "" -":doc:`pgr_breadthFirstSearch` - Breath first search traversal of the graph." -msgstr "" -":doc:`pgr_breadthFirstSearch` - Recorrido de búsqueda en anchura del grafo." +msgid ":doc:`pgr_breadthFirstSearch` - Breath first search traversal of the graph." +msgstr ":doc:`pgr_breadthFirstSearch` - Recorrido de búsqueda en anchura del grafo." -msgid "" -":doc:`pgr_binaryBreadthFirstSearch` - Breath first search traversal of the " -"graph." -msgstr "" -":doc:`pgr_binaryBreadthFirstSearch` - Recorrido de búsqueda en anchura del " -"grafo." +msgid ":doc:`pgr_binaryBreadthFirstSearch` - Breath first search traversal of the graph." +msgstr ":doc:`pgr_binaryBreadthFirstSearch` - Recorrido de búsqueda en anchura del grafo." msgid ":doc:`components-family`" msgstr ":doc:`components-family`" @@ -3738,41 +3082,23 @@ msgstr ":doc:`components-family`" msgid ":doc:`ordering-family`" msgstr ":doc:`ordering-family`" -msgid "" -":doc:`pgr_cuthillMckeeOrdering` - Return reverse Cuthill-McKee ordering of " -"an undirected graph." -msgstr "" -":doc:`pgr_cuthillMckeeOrdering` - Ordenamiento Cuthill-McKee de grafo sin no " -"dirigido." +msgid ":doc:`pgr_cuthillMckeeOrdering` - Return reverse Cuthill-McKee ordering of an undirected graph." +msgstr ":doc:`pgr_cuthillMckeeOrdering` - Ordenamiento Cuthill-McKee de grafo sin no dirigido." -msgid "" -":doc:`pgr_topologicalSort` - Linear ordering of the vertices for directed " -"acyclic graph." -msgstr "" -":doc:`pgr_topologicalSort` - Orden lineal de los vértices para grafos " -"acíclicos dirigidos." +msgid ":doc:`pgr_topologicalSort` - Linear ordering of the vertices for directed acyclic graph." +msgstr ":doc:`pgr_topologicalSort` - Orden lineal de los vértices para grafos acíclicos dirigidos." -msgid "" -":doc:`pgr_sloanOrdering` - Returns the sloan ordering of an undirected graph." -msgstr "" -":doc:`pgr_sloanOrdering` - Regresa el ordenamiento Sloan de un grafo no " -"dirigido." +msgid ":doc:`pgr_sloanOrdering` - Returns the sloan ordering of an undirected graph." +msgstr ":doc:`pgr_sloanOrdering` - Regresa el ordenamiento Sloan de un grafo no dirigido." -msgid "" -":doc:`pgr_kingOrdering` - Returns the King ordering of an undirected graph." -msgstr "" -":doc:`pgr_kingOrdering` - Regresa el ordenamiento King de un grafo no " -"dirigido." +msgid ":doc:`pgr_kingOrdering` - Returns the King ordering of an undirected graph." +msgstr ":doc:`pgr_kingOrdering` - Regresa el ordenamiento King de un grafo no dirigido." msgid ":doc:`metrics-family`" msgstr ":doc:`metrics-family`" -msgid "" -":doc:`pgr_betweennessCentrality` - Calculates relative betweenness " -"centrality using Brandes Algorithm" -msgstr "" -":doc:`pgr_betweennessCentrality` - Calcula la centralidad intermedia " -"relativa mediante el algoritmo de Brandes" +msgid ":doc:`pgr_betweennessCentrality` - Calculates relative betweenness centrality using Brandes Algorithm" +msgstr ":doc:`pgr_betweennessCentrality` - Calcula la centralidad intermedia relativa mediante el algoritmo de Brandes" msgid ":doc:`pgr_bandwidth` - Computes the bandwidth of a graph." msgstr ":doc:`pgr_bandwidth` - Calcula el ancho de banda de un grafo." @@ -3822,50 +3148,26 @@ msgstr ":doc:`pgr_hawickCircuits`" msgid "Flow - Family of functions" msgstr "Flow - Familia de funciones" -msgid "" -":doc:`pgr_maxFlow` - Only the Max flow calculation using Push and Relabel " -"algorithm." -msgstr "" -":doc:`pgr_maxFlow` - Solo el flujo máximo se calcula usando el algoritmo " -"empuja y reetiquetado." +msgid ":doc:`pgr_maxFlow` - Only the Max flow calculation using Push and Relabel algorithm." +msgstr ":doc:`pgr_maxFlow` - Solo el flujo máximo se calcula usando el algoritmo empuja y reetiquetado." -msgid "" -":doc:`pgr_boykovKolmogorov` - Boykov and Kolmogorov with details of flow on " -"edges." -msgstr "" -":doc:`pgr_boykovKolmogorov` - Algoritmo Boykov y Kolmogorov con detalles del " -"flujo en aristas." +msgid ":doc:`pgr_boykovKolmogorov` - Boykov and Kolmogorov with details of flow on edges." +msgstr ":doc:`pgr_boykovKolmogorov` - Algoritmo Boykov y Kolmogorov con detalles del flujo en aristas." -msgid "" -":doc:`pgr_edmondsKarp` - Edmonds and Karp algorithm with details of flow on " -"edges." -msgstr "" -":doc:`pgr_edmondsKarp` - Algoritmo Edmonds y Karp con detalles de flujo del " -"flujo en aristas." +msgid ":doc:`pgr_edmondsKarp` - Edmonds and Karp algorithm with details of flow on edges." +msgstr ":doc:`pgr_edmondsKarp` - Algoritmo Edmonds y Karp con detalles de flujo del flujo en aristas." -msgid "" -":doc:`pgr_pushRelabel` - Push and relabel algorithm with details of flow on " -"edges." -msgstr "" -":doc:`pgr_pushRelabel` - Algoritmo empuja y reetiquetado con detalles del " -"flujo en aristas." +msgid ":doc:`pgr_pushRelabel` - Push and relabel algorithm with details of flow on edges." +msgstr ":doc:`pgr_pushRelabel` - Algoritmo empuja y reetiquetado con detalles del flujo en aristas." msgid "Applications" msgstr "Aplicaciones" -msgid "" -":doc:`pgr_edgeDisjointPaths` - Calculates edge disjoint paths between two " -"groups of vertices." -msgstr "" -":doc:`pgr_edgeDisjointPaths` - Calcula rutas de aristas disjuntas entre dos " -"grupos de vértices." +msgid ":doc:`pgr_edgeDisjointPaths` - Calculates edge disjoint paths between two groups of vertices." +msgstr ":doc:`pgr_edgeDisjointPaths` - Calcula rutas de aristas disjuntas entre dos grupos de vértices." -msgid "" -":doc:`pgr_maxCardinalityMatch` - Calculates a maximum cardinality matching " -"in a graph." -msgstr "" -":doc:`pgr_maxCardinalityMatch` - Calcular una cardinalidad máxima de " -"coincidencia dentro de un grafo." +msgid ":doc:`pgr_maxCardinalityMatch` - Calculates a maximum cardinality matching in a graph." +msgstr ":doc:`pgr_maxCardinalityMatch` - Calcular una cardinalidad máxima de coincidencia dentro de un grafo." msgid "Flow Functions General Information" msgstr "Información General de las Funciones de Flujo" @@ -3876,12 +3178,8 @@ msgstr "El grafo es **dirigido**." msgid "Process is done only on edges with positive capacities." msgstr "El proceso se realiza sólo en aristas con capacidades positivas." -msgid "" -"When the maximum flow is 0 then there is no flow and **EMPTY SET** is " -"returned." -msgstr "" -"Cuando el flujo máximo es 0 entonces no hay flujo, se devolverá: **EMPTY " -"SET**." +msgid "When the maximum flow is 0 then there is no flow and **EMPTY SET** is returned." +msgstr "Cuando el flujo máximo es 0 entonces no hay flujo, se devolverá: **EMPTY SET**." msgid "There is no flow when source has the same value as target." msgstr "No hay flujo cuando el origen tiene el mismo valor que el destino." @@ -3904,14 +3202,8 @@ msgstr "una **super fuente** y aristas desde ella a todas las fuentes," msgid "a **super target** and edges from it to all the targetss." msgstr "un **super objetivo** y aristas desde él a todos los objetivos." -msgid "" -"The maximum flow through the graph is guaranteed to be the value returned " -"by :doc:`pgr_maxFlow ` 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 "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 "By aggregation of the outgoing flow from the sources" msgstr "Mediante la suma de los flujos salientes de las fuentes" @@ -3919,14 +3211,8 @@ msgstr "Mediante la suma de los flujos salientes de las fuentes" msgid "By aggregation of the incoming flow to the targets" msgstr "Mediante la suma de los flujos llegantes a los destinos" -msgid "" -":doc:`pgr_maxFlow` is the maximum Flow and that maximum is guaranteed to be " -"the same on the functions :doc:`pgr_pushRelabel`, :doc:`pgr_edmondsKarp`, :" -"doc:`pgr_boykovKolmogorov`, but the actual flow through each edge may vary." -msgstr "" -":doc:`pgr_maxFlow` es el flujo máximo y este máximo tiene garantía de ser el " -"mismo en las funciones :doc:`pgr_pushRelabel`, :doc:`pgr_edmondsKarp`, :doc:" -"`pgr_boykovKolmogorov`, pero el flujo actual para cada arista puede variar." +msgid ":doc:`pgr_maxFlow` is the maximum Flow and that maximum is guaranteed to be the same on the functions :doc:`pgr_pushRelabel`, :doc:`pgr_edmondsKarp`, :doc:`pgr_boykovKolmogorov`, but the actual flow through each edge may vary." +msgstr ":doc:`pgr_maxFlow` es el flujo máximo y este máximo tiene garantía de ser el mismo en las funciones :doc:`pgr_pushRelabel`, :doc:`pgr_edmondsKarp`, :doc:`pgr_boykovKolmogorov`, pero el flujo actual para cada arista puede variar." msgid "Capacity edges" msgstr "Aristas de capacidad" @@ -3995,16 +3281,13 @@ msgid "**flow**" msgstr "**flujo**" msgid "Flow through the edge in the direction (``start_vid``, ``end_vid``)." -msgstr "" -"Flujo a través del arista en la dirección (``start_vid``, ``end_vid``)." +msgstr "Flujo a través del arista en la dirección (``start_vid``, ``end_vid``)." msgid "**residual_capacity**" msgstr "**residual_capacity**" -msgid "" -"Residual capacity of the edge in the direction (``start_vid``, ``end_vid``)." -msgstr "" -"Capacidad residual del arista en la dirección (``start_vid``, ``end_vid``)." +msgid "Residual capacity of the edge in the direction (``start_vid``, ``end_vid``)." +msgstr "Capacidad residual del arista en la dirección (``start_vid``, ``end_vid``)." msgid "For :doc:`pgr_maxFlowMinCost`" msgstr "Para :doc:`pgr_maxFlowMinCost`" @@ -4024,12 +3307,8 @@ msgstr "Capacidad residual de la arista en la dirección (origen, destino)." msgid "**cost**" msgstr "**costo**" -msgid "" -"The cost of sending this flow through the edge in the direction (source, " -"target)." -msgstr "" -"El costo de enviar este flujo a través de la arista en la dirección (origen, " -"destino)." +msgid "The cost of sending this flow through the edge in the direction (source, target)." +msgstr "El costo de enviar este flujo a través de la arista en la dirección (origen, destino)." msgid "**agg_cost**" msgstr "**agg_cost**" @@ -4040,43 +3319,20 @@ msgstr "El costo agregado." msgid "Advanced Documentation" msgstr "Documentación Avanzada" -msgid "" -"A flow network is a directed graph where each edge has a capacity and a " -"flow. The flow through an edge must not exceed the capacity of the edge. " -"Additionally, the incoming and outgoing flow of a node must be equal except " -"for source which only has outgoing flow, and the destination(sink) which " -"only has incoming flow." -msgstr "" -"Una red de flujo es un gráfico dirigido donde cada arista tiene una " -"capacidad y un flujo. El flujo a través de una arista no debe exceder la " -"capacidad de la misma. Además, el flujo entrante y saliente de un nodo debe " -"ser igual, excepto para el origen que solo tiene flujo saliente, y el " -"destino (receptor) que solo tiene flujo entrante." +msgid "A flow network is a directed graph where each edge has a capacity and a flow. The flow through an edge must not exceed the capacity of the edge. Additionally, the incoming and outgoing flow of a node must be equal except for source which only has outgoing flow, and the destination(sink) which only has incoming flow." +msgstr "Una red de flujo es un gráfico dirigido donde cada arista tiene una capacidad y un flujo. El flujo a través de una arista no debe exceder la capacidad de la misma. Además, el flujo entrante y saliente de un nodo debe ser igual, excepto para el origen que solo tiene flujo saliente, y el destino (receptor) que solo tiene flujo entrante." -msgid "" -"Maximum flow algorithms calculate the maximum flow through the graph and the " -"flow of each edge." -msgstr "" -"Los algoritmos de Flujo Máximo se calculan a través del grafo del flujo " -"máximo y el flujo de cada arista." +msgid "Maximum flow algorithms calculate the maximum flow through the graph and the flow of each edge." +msgstr "Los algoritmos de Flujo Máximo se calculan a través del grafo del flujo máximo y el flujo de cada arista." -msgid "" -"The maximum flow through the graph is guaranteed to be the same with all " -"implementations, but the actual flow through each edge may vary." -msgstr "" -"Se garantiza que el flujo máximo a través del grafo sea el mismo con todas " -"las implementaciones, pero el flujo real a través de cada arista puede " -"variar." +msgid "The maximum flow through the graph is guaranteed to be the same with all implementations, but the actual flow through each edge may vary." +msgstr "Se garantiza que el flujo máximo a través del grafo sea el mismo con todas las implementaciones, pero el flujo real a través de cada arista puede variar." msgid "pgr_maxFlow :math:`(edges\\_sql, source\\_vertex, sink\\_vertex)`" msgstr "pgr_maxFlow :math:`(edges\\_sql, source\\_vertex, sink\\_vertex)`" -msgid "" -"where :math:`edges\\_sql = \\{(id_i, source_i, target_i, capacity_i, " -"reverse\\_capacity_i)\\}`" -msgstr "" -"donde: :math:`edges\\_sql = \\{(id_i, source_i, target_i, capacity_i, " -"reverse\\_capacity_i)\\}`" +msgid "where :math:`edges\\_sql = \\{(id_i, source_i, target_i, capacity_i, reverse\\_capacity_i)\\}`" +msgstr "donde: :math:`edges\\_sql = \\{(id_i, source_i, target_i, capacity_i, reverse\\_capacity_i)\\}`" msgid "Graph definition" msgstr "Definición de grafo" @@ -4087,29 +3343,11 @@ msgstr "El grafo ponderado dirigido, :math:`G(V,E)`, se define como:" msgid "the set of vertices :math:`V`" msgstr "Conjunto de vértices :math:`V`" -msgid "" -":math:`source\\_vertex \\cup sink\\_vertex \\bigcup source_i \\bigcup " -"target_i`" -msgstr "" -":math:`source\\_vertex \\cup sink\\_vertex \\bigcup source_i " -"\\bigcuptarget_i`" +msgid ":math:`source\\_vertex \\cup sink\\_vertex \\bigcup source_i \\bigcup target_i`" +msgstr ":math:`source\\_vertex \\cup sink\\_vertex \\bigcup source_i \\bigcuptarget_i`" -msgid "" -":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, capacity_i) " -"\\text{ when } capacity > 0 \\} & \\quad \\text{ if } reverse\\_capacity = " -"\\varnothing \\\\ \\text{ } & \\quad \\text{ } \\\\ \\{(source_i, target_i, " -"capacity_i) \\text{ when } capacity > 0 \\} & \\text{ } \\\\ \\cup " -"\\{(target_i, source_i, reverse\\_capacity_i) \\text{ when } " -"reverse\\_capacity_i > 0)\\} & \\quad \\text{ if } reverse\\_capacity \\neq " -"\\varnothing \\\\ \\end{cases}`" -msgstr "" -":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, capacity_i) " -"\\text{ when } capacity > 0 \\} & \\quad \\text{ if } reverse\\_capacity = " -"\\varnothing \\\\ \\text{ } & \\quad \\text{ } \\\\ \\{(source_i, target_i, " -"capacity_i) \\text{ when } capacity > 0 \\} & \\text{ } \\\\ \\cup " -"\\{(target_i, source_i, reverse\\_capacity_i) \\text{ when } " -"reverse\\_capacity_i > 0)\\} & \\quad \\text{ if } reverse\\_capacity \\neq " -"\\varnothing \\\\ \\end{cases}`" +msgid ":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, capacity_i) \\text{ when } capacity > 0 \\} & \\quad \\text{ if } reverse\\_capacity = \\varnothing \\\\ \\text{ } & \\quad \\text{ } \\\\ \\{(source_i, target_i, capacity_i) \\text{ when } capacity > 0 \\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_capacity_i) \\text{ when } reverse\\_capacity_i > 0)\\} & \\quad \\text{ if } reverse\\_capacity \\neq \\varnothing \\\\ \\end{cases}`" +msgstr ":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, capacity_i) \\text{ when } capacity > 0 \\} & \\quad \\text{ if } reverse\\_capacity = \\varnothing \\\\ \\text{ } & \\quad \\text{ } \\\\ \\{(source_i, target_i, capacity_i) \\text{ when } capacity > 0 \\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_capacity_i) \\text{ when } reverse\\_capacity_i > 0)\\} & \\quad \\text{ if } reverse\\_capacity \\neq \\varnothing \\\\ \\end{cases}`" msgid "Maximum flow problem" msgstr "Problema de Flujo Máximo" @@ -4126,23 +3364,11 @@ msgstr ":math:`sink\\_vertex \\in V` el vértice pozo" msgid ":math:`pgr\\_maxFlow(edges\\_sql, source, sink) = \\boldsymbol{\\Phi}`" msgstr ":math:`pgr\\_maxFlow(edges\\_sql, source, sink) = \\boldsymbol{\\Phi}`" -msgid "" -":math:`\\boldsymbol{\\Phi} = {(id_i, edge\\_id_i, source_i, target_i, " -"flow_i, residual\\_capacity_i)}`" -msgstr "" -":math:`\\boldsymbol{\\Phi} = {(id_i, edge\\_id_i, source_i, target_i, " -"flow_i, residual\\_capacity_i)}`" +msgid ":math:`\\boldsymbol{\\Phi} = {(id_i, edge\\_id_i, source_i, target_i, flow_i, residual\\_capacity_i)}`" +msgstr ":math:`\\boldsymbol{\\Phi} = {(id_i, edge\\_id_i, source_i, target_i, flow_i, residual\\_capacity_i)}`" -msgid "" -":math:`\\boldsymbol{\\Phi}` is a subset of the original edges with their " -"residual capacity and flow. The maximum flow through the graph can be " -"obtained by aggregating on the source or sink and summing the flow from/to " -"it. In particular:" -msgstr "" -":math:`\\boldsymbol{\\Phi}` es un subconjunto de las aristas originales con " -"su flujo y capacidad residual. El flujo máximo a través del grafo se puede " -"obtener agregando en el origen o sumidero y sumiendo el flujo hacia él. En " -"particular:" +msgid ":math:`\\boldsymbol{\\Phi}` is a subset of the original edges with their residual capacity and flow. The maximum flow through the graph can be obtained by aggregating on the source or sink and summing the flow from/to it. In particular:" +msgstr ":math:`\\boldsymbol{\\Phi}` es un subconjunto de las aristas originales con su flujo y capacidad residual. El flujo máximo a través del grafo se puede obtener agregando en el origen o sumidero y sumiendo el flujo hacia él. En particular:" msgid ":math:`id_i = i`" msgstr ":math:`id_i = i`" @@ -4156,14 +3382,8 @@ msgstr ":math:`residual\\_capacity_i = capacity_i - flow_i`" msgid "https://en.wikipedia.org/wiki/Maximum_flow_problem" msgstr "https://en.wikipedia.org/wiki/Maximum_flow_problem" -msgid "" -"pgRouting extends the `PostGIS `__/`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." +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." msgid "This is the manual for pgRouting |release|." msgstr "Este es el manual para la version |release| de pgRouting." @@ -4171,20 +3391,8 @@ msgstr "Este es el manual para la version |release| de pgRouting." msgid "Creative Commons Attribution-Share Alike 3.0 License" msgstr "Licencia de Creative Commons Attribution-Share Alike 3.0" -msgid "" -"The pgRouting Manual is licensed under a `Creative Commons Attribution-Share " -"Alike 3.0 License `_. Feel " -"free to use this material any way you like, but we ask that you attribute " -"credit to the pgRouting Project and wherever possible, a link back to " -"https://pgrouting.org. For other licenses used in pgRouting see the :ref:" -"`license` page." -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 "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 "General" msgstr "General" @@ -4216,12 +3424,8 @@ msgstr ":doc:`pgr_kruskal`" msgid ":doc:`pgr_kruskalDD`" msgstr ":doc:`pgr_kruskalDD`" -msgid "" -":doc:`pgr_degree` - Returns a set of vertices and corresponding count of " -"incident edges to the vertex." -msgstr "" -":doc:`pgr_degree` - Regresa un conjunto de vertices y la cantidad de aristas " -"incidentes al vértice." +msgid ":doc:`pgr_degree` - Returns a set of vertices and corresponding count of incident edges to the vertex." +msgstr ":doc:`pgr_degree` - Regresa un conjunto de vertices y la cantidad de aristas incidentes al vértice." msgid ":doc:`prim-family`" msgstr ":doc:`prim-family`" @@ -4244,32 +3448,23 @@ msgstr ":doc:`pgr_full_version`" msgid ":doc:`utilities-family`" msgstr ":doc:`utilities-family`" -msgid "" -":doc:`pgr_extractVertices` - Extracts vertex information based on the edge " -"table information." -msgstr "" -":doc:`pgr_extractVertices` - Extrae información de vértices basada en la " -"tabla de aristas." +msgid ":doc:`pgr_extractVertices` - Extracts vertex information based on the edge table information." +msgstr ":doc:`pgr_extractVertices` - Extrae información de vértices basada en la tabla de aristas." msgid ":doc:`pgr_findCloseEdges` - Finds close edges of points on the fly" -msgstr "" -":doc:`pgr_findCloseEdges` - Encuentra las aristas cercanas a una geometría " -"al vuelo" +msgstr ":doc:`pgr_findCloseEdges` - Encuentra las aristas cercanas a una geometría al vuelo" msgid ":doc:`pgr_separateCrossing` - Breaks geometries that cross each other." msgstr "" -msgid "" -":doc:`pgr_separateTouching` - Breaks geometries that (almost) touch each " -"other." +msgid ":doc:`pgr_separateTouching` - Breaks geometries that (almost) touch each other." msgstr "" msgid ":doc:`withPoints-family`" msgstr ":doc:`withPoints-family`" msgid ":doc:`pgr_withPoints` - Route from/to points anywhere on the graph." -msgstr "" -":doc:`pgr_withPoints` - Ruta desde/hacia puntos en cualquier parte del grafo." +msgstr ":doc:`pgr_withPoints` - Ruta desde/hacia puntos en cualquier parte del grafo." msgid ":doc:`pgr_withPointsCost` - Costs of the shortest paths." msgstr ":doc:`pgr_withPointsCost` - Costos de las tutas más cortas." @@ -4331,18 +3526,14 @@ msgstr ":doc:`experimental`" msgid ":doc:`release_notes`" msgstr ":doc:`release_notes`" +msgid "pgRouting 4.0" +msgstr "pgRouting 4.0" + msgid "pgRouting 4.0.0-alpha1 Release Notes" msgstr "Notas de la versión de pgRouting 4.0.0-alpha1" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 4.0.0 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `Github milestone for 4.0.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.0 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `Github milestone for 4.0.0 `__" msgid "Build" msgstr "Construir" @@ -4350,8 +3541,7 @@ msgstr "Construir" msgid "C++ standard is std17" msgstr "" -msgid "" -"Using this standard, all supported toolchains across our CI matrix will work." +msgid "Using this standard, all supported toolchains across our CI matrix will work." msgstr "" msgid "The code is not yet modified to use std17:" @@ -4384,12 +3574,8 @@ msgstr "La documentación doxygen se construye por defecto" msgid "The HTML documentation is built by default" msgstr "La documentación HTML se crea por defecto" -msgid "" -"The translated languages (en, es, sv, zh_Hans) HTML documentation are built " -"by default" -msgstr "" -"Los idiomas traducidos (en, es, sv, zh_Hans) para documentación HTML se " -"construyen por defecto" +msgid "The translated languages (en, es, sv, zh_Hans) HTML documentation are built by default" +msgstr "Los idiomas traducidos (en, es, sv, zh_Hans) para documentación HTML se construyen por defecto" msgid "`WITH-DOC` is not used anymore" msgstr "" @@ -4592,12 +3778,8 @@ msgstr "pgr_trsp" msgid "pgr_trsp(text,integer,integer,boolean,boolean,text)" msgstr "pgr_trsp(text,integer,integer,boolean,boolean,text)" -msgid "" -"pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean,text)" -msgstr "" -"pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean,text)" +msgid "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +msgstr "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" msgid "pgr_trspVia" msgstr "pgr_trspVia" @@ -4609,53 +3791,34 @@ msgid "pgr_trspVia_withPoints" msgstr "pgr_trspVia_withPoints" msgid "**Driving side** parameter is positional unnamed." -msgstr "" -"El parámetro **Lado de Manejo** era opcional ahora es obligatorio posicional " -"sin nombre." +msgstr "El parámetro **Lado de Manejo** era opcional ahora es obligatorio posicional sin nombre." msgid "Valid values depend on kind of graph" msgstr "Valores válidos dependen del tipo de grafo" -msgid "" -"pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean," -"character,boolean)" -msgstr "" -"pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean," -"character,boolean)" +msgid "pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgstr "pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgid "" -"pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" -msgstr "" -"pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +msgid "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +msgstr "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" msgid "pgr_trsp_withPoints" msgstr "pgr_trsp_withPoints" msgid "**Driving side** parameter is positional unnamed and compulsory." -msgstr "" -"El parámetro **driving_side** era opcional ahora es obligatorio sin nombre." +msgstr "El parámetro **driving_side** era opcional ahora es obligatorio sin nombre." -msgid "" -"pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character," -"boolean)" -msgstr "" -"pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character," -"boolean)" +msgid "pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +msgstr "pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" -msgid "" -"pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" -msgstr "" -"pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +msgid "pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +msgstr "pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" -msgid "" -"pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" -msgstr "" -"pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +msgid "pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +msgstr "pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" -msgid "" -"pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" -msgstr "" -"pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" +msgid "pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" +msgstr "pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" msgid "pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" msgstr "pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" @@ -4669,22 +3832,14 @@ msgstr "Los resultados cambian dependiendo el orden de entrada" msgid "Only for undirected graphs" msgstr "Solo para grafos no dirigidos" -msgid "" -"pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double " -"precision,double precision,double precision,boolean)" -msgstr "" -"pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double " -"precision,double precision,double precision,boolean)" +msgid "pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgstr "pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgid "pgr_TSPeuclidean" msgstr "pgr_TSPeuclidean" -msgid "" -"pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, " -"integer,double precision,double precision,double precision,boolean)" -msgstr "" -"pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, " -"integer,double precision,double precision,double precision,boolean)" +msgid "pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, integer,double precision,double precision,double precision,boolean)" +msgstr "pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, integer,double precision,double precision,double precision,boolean)" msgid "pgr_turnRestrictedPath" msgstr "pgr_turnRestrictedPath" @@ -4743,215 +3898,107 @@ msgstr "pgr_withpointscostmatrix(text,text,anyarray,boolean,character)" msgid "pgr_withPointsDD" msgstr "pgr_withPointsDD" -msgid "" -"pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" -msgstr "" -"pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgid "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" -msgid "" -"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" -msgstr "" -"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" +msgid "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" msgid "pgr_withPointsKSP" msgstr "pgr_withPointsKSP" -msgid "" -"pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character," -"boolean)" -msgstr "" -"pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character," -"boolean)" +msgid "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" msgid "pgr_withPointsVia" msgstr "pgr_withPointsVia" -msgid "" -"pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character," -"boolean)" -msgstr "" -"pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character," -"boolean)" +msgid "pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgstr "pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgid "Functions promoted to official" msgstr "Funciones promovidas a oficial" -msgid "" -"`#2701 `__: pgr_trsp" -msgstr "" -"`#2701 `__: pgr_trsp" +msgid "`#2701 `__: pgr_trsp" +msgstr "`#2701 `__: pgr_trsp" -msgid "" -"`#2701 `__: pgr_trspVia" -msgstr "" -"`#2701 `__: pgr_trspVia" +msgid "`#2701 `__: pgr_trspVia" +msgstr "`#2701 `__: pgr_trspVia" -msgid "" -"`#2701 `__: " -"pgr_trspVia_withPoints" -msgstr "" -"`#2701 `__: " -"pgr_trspVia_withPoints" +msgid "`#2701 `__: pgr_trspVia_withPoints" +msgstr "`#2701 `__: pgr_trspVia_withPoints" -msgid "" -"`#2701 `__: " -"pgr_trsp_withPoints" -msgstr "" -"`#2701 `__: " -"pgr_trsp_withPoints" +msgid "`#2701 `__: pgr_trsp_withPoints" +msgstr "`#2701 `__: pgr_trsp_withPoints" -msgid "" -"`#2700 `__: " -"pgr_withPoints" -msgstr "" -"`#2700 `__: " -"pgr_withPoints" +msgid "`#2700 `__: pgr_withPoints" +msgstr "`#2700 `__: pgr_withPoints" -msgid "" -"`#2700 `__: " -"pgr_withPointsCost" -msgstr "" -"`#2700 `__: " -"pgr_withPointsCost" +msgid "`#2700 `__: pgr_withPointsCost" +msgstr "`#2700 `__: pgr_withPointsCost" -msgid "" -"`#2700 `__: " -"pgr_withPointsCostMatrix" -msgstr "" -"`#2700 `__: " -"pgr_withPointsCostMatrix" +msgid "`#2700 `__: pgr_withPointsCostMatrix" +msgstr "`#2700 `__: pgr_withPointsCostMatrix" -msgid "" -"`#2700 `__: " -"pgr_withPointsDD" -msgstr "" -"`#2700 `__: " -"pgr_withPointsDD" +msgid "`#2700 `__: pgr_withPointsDD" +msgstr "`#2700 `__: pgr_withPointsDD" -msgid "" -"`#2700 `__: " -"pgr_withPointsKSP" -msgstr "" -"`#2700 `__: " -"pgr_withPointsKSP" +msgid "`#2700 `__: pgr_withPointsKSP" +msgstr "`#2700 `__: pgr_withPointsKSP" -msgid "" -"`#2700 `__: " -"pgr_withPointsVia" -msgstr "" -"`#2700 `__: " -"pgr_withPointsVia" +msgid "`#2700 `__: pgr_withPointsVia" +msgstr "`#2700 `__: pgr_withPointsVia" -msgid "" -"`#2983 `__: " -"pgr_dijkstraNear" +msgid "`#2983 `__: pgr_dijkstraNear" msgstr "`#2983 `__: pgr_dijkstraNear" -msgid "" -"`#2983 `__: " -"pgr_dijkstraNearCost" +msgid "`#2983 `__: pgr_dijkstraNearCost" msgstr "`#2983 `__: pgr_dijkstraNearCost" -msgid "" -"`#2983 `__: " -"pgr_dijkstraVia" +msgid "`#2983 `__: pgr_dijkstraVia" msgstr "`#2983 `__: pgr_dijkstraVia" msgid "Signatures promoted to official" msgstr "Firmas promovidas a oficial" -msgid "" -"`#2718 `__: " -"pgr_aStar(Combinations)" -msgstr "" -"`#2718 `__: " -"pgr_aStar(Combinaciones)" +msgid "`#2718 `__: pgr_aStar(Combinations)" +msgstr "`#2718 `__: pgr_aStar(Combinaciones)" -msgid "" -"`#2718 `__: " -"pgr_aStarCost(Combinations)" -msgstr "" -"`#2718 `__: " -"pgr_aStarCost(Combinaciones)" +msgid "`#2718 `__: pgr_aStarCost(Combinations)" +msgstr "`#2718 `__: pgr_aStarCost(Combinaciones)" -msgid "" -"`#2718 `__: " -"pgr_bdAstar(Combinations)" -msgstr "" -"`#2718 `__: " -"pgr_bdAstar(Combinaciones)" +msgid "`#2718 `__: pgr_bdAstar(Combinations)" +msgstr "`#2718 `__: pgr_bdAstar(Combinaciones)" -msgid "" -"`#2718 `__: " -"pgr_bdAstarCost(Combinations)" -msgstr "" -"`#2718 `__: " -"pgr_bdAstarCost(Combinaciones)" +msgid "`#2718 `__: pgr_bdAstarCost(Combinations)" +msgstr "`#2718 `__: pgr_bdAstarCost(Combinaciones)" -msgid "" -"`#2718 `__: " -"pgr_bdDijkstra(Combinations)" -msgstr "" -"`#2718 `__: " -"pgr_bdDijkstra(Combinaciones)" +msgid "`#2718 `__: pgr_bdDijkstra(Combinations)" +msgstr "`#2718 `__: pgr_bdDijkstra(Combinaciones)" -msgid "" -"`#2718 `__: " -"pgr_bdDijkstraCost(Combinations)" -msgstr "" -"`#2718 `__: " -"pgr_bdDijkstraCost(Combinaciones)" +msgid "`#2718 `__: pgr_bdDijkstraCost(Combinations)" +msgstr "`#2718 `__: pgr_bdDijkstraCost(Combinaciones)" -msgid "" -"`#2718 `__: " -"pgr_dijkstra(Combinations)" -msgstr "" -"`#2718 `__: " -"pgr_dijkstra(Combinaciones)" +msgid "`#2718 `__: pgr_dijkstra(Combinations)" +msgstr "`#2718 `__: pgr_dijkstra(Combinaciones)" -msgid "" -"`#2718 `__: " -"pgr_dijkstraCost(Combinations)" -msgstr "" -"`#2718 `__: " -"pgr_dijkstraCost(Combinaciones)" +msgid "`#2718 `__: pgr_dijkstraCost(Combinations)" +msgstr "`#2718 `__: pgr_dijkstraCost(Combinaciones)" -msgid "" -"`#2718 `__: pgr_KSP(All " -"signatures)" -msgstr "" -"`#2718 `__: " -"pgr_KSP(Todas las firmas)" +msgid "`#2718 `__: pgr_KSP(All signatures)" +msgstr "`#2718 `__: pgr_KSP(Todas las firmas)" -msgid "" -"`#2718 `__: " -"pgr_boykovKolmogorov(Combinations)" -msgstr "" -"`#2718 `__: " -"pgr_boykovKolmogorov(Combinaciones)" +msgid "`#2718 `__: pgr_boykovKolmogorov(Combinations)" +msgstr "`#2718 `__: pgr_boykovKolmogorov(Combinaciones)" -msgid "" -"`#2718 `__: " -"pgr_edmondsKarp(Combinations)" -msgstr "" -"`#2718 `__: " -"pgr_edmondsKarp(Combinaciones)" +msgid "`#2718 `__: pgr_edmondsKarp(Combinations)" +msgstr "`#2718 `__: pgr_edmondsKarp(Combinaciones)" -msgid "" -"`#2718 `__: " -"pgr_maxFlow(Combinations)" -msgstr "" -"`#2718 `__: " -"pgr_maxFlow(Combinaciones)" +msgid "`#2718 `__: pgr_maxFlow(Combinations)" +msgstr "`#2718 `__: pgr_maxFlow(Combinaciones)" -msgid "" -"`#2718 `__: " -"pgr_pushRelabel(Combinations)" -msgstr "" -"`#2718 `__: " -"pgr_pushRelabel(Combinaciones)" +msgid "`#2718 `__: pgr_pushRelabel(Combinations)" +msgstr "`#2718 `__: pgr_pushRelabel(Combinaciones)" msgid "New experimental functions." msgstr "Nuevas funciones experimentales." @@ -4959,37 +4006,23 @@ msgstr "Nuevas funciones experimentales." msgid "Metrics" msgstr "Métricas" -msgid "" -"`#2951 `__: pgr_bandwidth" -msgstr "" -"`#2951 `__: pgr_bandwidth" +msgid "`#2951 `__: pgr_bandwidth" +msgstr "`#2951 `__: pgr_bandwidth" msgid "Ordering" msgstr "Ordenamiento" -msgid "" -"`#2954 `__: " -"pgr_kingOrdering" -msgstr "" -"`#2954 `__: " -"pgr_kingOrdering" +msgid "`#2954 `__: pgr_kingOrdering" +msgstr "`#2954 `__: pgr_kingOrdering" -msgid "" -"`#2955 `__: " -"pgr_sloanOrdering" -msgstr "" -"`#2955 `__: " -"pgr_sloanOrdering" +msgid "`#2955 `__: pgr_sloanOrdering" +msgstr "`#2955 `__: pgr_sloanOrdering" msgid "SQL signatures and output standardization" msgstr "" -msgid "" -"`#2904 `__: Standardize " -"output columns of functions with different output" -msgstr "" -"`#2904 `__: Estandarizar " -"columnas de resultados de funciones con diferente salida" +msgid "`#2904 `__: Standardize output columns of functions with different output" +msgstr "`#2904 `__: Estandarizar columnas de resultados de funciones con diferente salida" msgid "columns within overloads" msgstr "columnas dentro de las sobrecargas" @@ -4997,953 +4030,422 @@ msgstr "columnas dentro de las sobrecargas" msgid "Standardized to |short-generic-result|" msgstr "Estandardizar de las columnas de resultados a |short-generic-result|" -msgid "" -"`#2905 `__: " -"pgr_withPoints" -msgstr "" -"`#2905 `__: " -"pgr_withPoints" +msgid "`#2905 `__: pgr_withPoints" +msgstr "`#2905 `__: pgr_withPoints" -msgid "" -"`#2906 `__: " -"pgr_bdDijkstra" -msgstr "" -"`#2906 `__: " -"pgr_bdDijkstra" +msgid "`#2906 `__: pgr_bdDijkstra" +msgstr "`#2906 `__: pgr_bdDijkstra" -msgid "" -"`#2907 `__: " -"pgr_bellmanFord" -msgstr "" -"`#2907 `__: " -"pgr_bellmanFord" +msgid "`#2907 `__: pgr_bellmanFord" +msgstr "`#2907 `__: pgr_bellmanFord" -msgid "" -"`#2908 `__: " -"pgr_binaryBreadthFirstSearch" -msgstr "" -"`#2908 `__: " -"pgr_binaryBreadthFirstSearch" +msgid "`#2908 `__: pgr_binaryBreadthFirstSearch" +msgstr "`#2908 `__: pgr_binaryBreadthFirstSearch" -msgid "" -"`#2910 `__: " -"pgr_edwardMoore" -msgstr "" -"`#2910 `__: " -"pgr_edwardMoore" +msgid "`#2910 `__: pgr_edwardMoore" +msgstr "`#2910 `__: pgr_edwardMoore" -msgid "" -"`#2913 `__: " -"pgr_dagShortestPath" -msgstr "" -"`#2913 `__: " -"pgr_dagShortestPath" +msgid "`#2913 `__: pgr_dagShortestPath" +msgstr "`#2913 `__: pgr_dagShortestPath" msgid "Standardized to |matrix-result|" msgstr "Estandardizar de las columnas de resultados a |matrix-result|" -msgid "" -"`#2905 `__: " -"pgr_withPointsCost" -msgstr "" -"`#2905 `__: " -"pgr_withPointsCost" +msgid "`#2905 `__: pgr_withPointsCost" +msgstr "`#2905 `__: pgr_withPointsCost" -msgid "" -"`#2905 `__: " -"pgr_withPointsCostMatrix" -msgstr "" -"`#2905 `__: " -"pgr_withPointsCostMatrix" +msgid "`#2905 `__: pgr_withPointsCostMatrix" +msgstr "`#2905 `__: pgr_withPointsCostMatrix" msgid "Standardized to |generic-result|" msgstr "Estandardizar de las columnas de resultados a |generic-result|" -msgid "" -"`#2909 `__: " -"pgr_edgeDisjointPaths" -msgstr "" -"`#2909 `__: " -"pgr_edgeDisjointPaths" +msgid "`#2909 `__: pgr_edgeDisjointPaths" +msgstr "`#2909 `__: pgr_edgeDisjointPaths" -msgid "" -"`#2909 `__: " -"pgr_turnRestrictedPath" -msgstr "" -"`#2909 `__: " -"pgr_turnRestrictedPath" +msgid "`#2909 `__: pgr_turnRestrictedPath" +msgstr "`#2909 `__: pgr_turnRestrictedPath" msgid "Standardized to |result_edge_color|" msgstr "Estandardizar de las columnas de resultados a |result_edge_color|" -msgid "" -"`#2924 `__: " -"pgr_edgeColoring" -msgstr "" -"`#2924 `__: " -"pgr_edgeColoring" +msgid "`#2924 `__: pgr_edgeColoring" +msgstr "`#2924 `__: pgr_edgeColoring" msgid "Standardized to |result_node_color|" msgstr "Estandardizar de las columnas de resultados a |result_node_color|" -msgid "" -"`#2924 `__: pgr_bipartite" -msgstr "" -"`#2924 `__: pgr_bipartite" +msgid "`#2924 `__: pgr_bipartite" +msgstr "`#2924 `__: pgr_bipartite" -msgid "" -"`#2927 `__: " -"pgr_sequentialVertexColoring" -msgstr "" -"`#2927 `__: " -"pgr_sequentialVertexColoring" +msgid "`#2927 `__: pgr_sequentialVertexColoring" +msgstr "`#2927 `__: pgr_sequentialVertexColoring" msgid "Standardized to |result-spantree|" msgstr "Estandardizar de las columnas de resultados a |result-spantree|" -msgid "" -"`#2931 `__: " -"pgr_breadthFirstSearch" -msgstr "" -"`#2931 `__: " -"pgr_breadthFirstSearch" +msgid "`#2931 `__: pgr_breadthFirstSearch" +msgstr "`#2931 `__: pgr_breadthFirstSearch" -msgid "" -"`#2931 `__: " -"pgr_depthFirstSearch" -msgstr "" -"`#2931 `__: " -"pgr_depthFirstSearch" +msgid "`#2931 `__: pgr_depthFirstSearch" +msgstr "`#2931 `__: pgr_depthFirstSearch" msgid "Standardized to |result_node_order|" msgstr "Estandardizar de las columnas de resultados a |result_node_order|" -msgid "" -"`#2934 `__: " -"pgr_topologicalSort" -msgstr "" -"`#2934 `__: " -"pgr_topologicalSort" +msgid "`#2934 `__: pgr_topologicalSort" +msgstr "`#2934 `__: pgr_topologicalSort" msgid "Standardized to |result-closure|" msgstr "Estandardizar de las columnas de resultados a |result-closure|" -msgid "" -"`#2934 `__: " -"pgr_transitiveClosure" -msgstr "" -"`#2934 `__: " -"pgr_transitiveClosure" +msgid "`#2934 `__: pgr_transitiveClosure" +msgstr "`#2934 `__: pgr_transitiveClosure" msgid "Removal of SQL deprecated signatures" msgstr "Eliminación de funciones SQL obsoletas" -msgid "" -"`#2798 `__: " -"pgr_contraction" -msgstr "" -"`#2798 `__: " -"pgr_contraction" +msgid "`#2798 `__: pgr_contraction" +msgstr "`#2798 `__: pgr_contraction" -msgid "" -"`#2683 `__: pgr_trsp" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2683 `__: pgr_trsp" +msgstr "`#2683 `__: pgr_trsp" -msgid "" -"`#2683 `__: pgr_trspVia" -msgstr "" -"`#2683 `__: pgr_trspVia" +msgid "`#2683 `__: pgr_trspVia" +msgstr "`#2683 `__: pgr_trspVia" -msgid "" -"`#2888 `__: " -"pgr_findCloseEdges" -msgstr "" -"`#2888 `__: " -"pgr_findCloseEdges" +msgid "`#2888 `__: pgr_findCloseEdges" +msgstr "`#2888 `__: pgr_findCloseEdges" -msgid "" -"pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" -msgstr "" -"pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" +msgid "pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" +msgstr "pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" -msgid "" -"pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" -msgstr "" -"pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" +msgid "pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" +msgstr "pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" -msgid "" -"`#2890 `__: " -"pgr_withPointsDD" -msgstr "" -"`#2890 `__: " -"pgr_withPointsDD" +msgid "`#2890 `__: pgr_withPointsDD" +msgstr "`#2890 `__: pgr_withPointsDD" -msgid "" -"`#2895 `__: " -"pgr_withPointsKSP" -msgstr "" -"`#2895 `__: " -"pgr_withPointsKSP" +msgid "`#2895 `__: pgr_withPointsKSP" +msgstr "`#2895 `__: pgr_withPointsKSP" -msgid "" -"`#2899 `__: " -"pgr_maxCardinalityMatch" -msgstr "" -"`#2899 `__: " -"pgr_maxCardinalityMatch" +msgid "`#2899 `__: pgr_maxCardinalityMatch" +msgstr "`#2899 `__: pgr_maxCardinalityMatch" msgid "`#2901 `__: pgr_TSP" -msgstr "" -"`#2901 `__: pgr_TSP" +msgstr "`#2901 `__: pgr_TSP" -msgid "" -"`#2901 `__: " -"pgr_TSPeuclidean" -msgstr "" -"`#2901 `__: " -"pgr_TSPeuclidean" +msgid "`#2901 `__: pgr_TSPeuclidean" +msgstr "`#2901 `__: pgr_TSPeuclidean" msgid "Removal of SQL deprecated functions" msgstr "Eliminación de funciones obsoletas" -msgid "" -"`#2681 `__: " -"pgr_trspViaedges" -msgstr "" -"`#2681 `__: " -"pgr_trspViaedges" +msgid "`#2681 `__: pgr_trspViaedges" +msgstr "`#2681 `__: pgr_trspViaedges" -msgid "" -"`#2682 `__: " -"pgr_trspViaVertices" -msgstr "" -"`#2682 `__: " -"pgr_trspViaVertices" +msgid "`#2682 `__: pgr_trspViaVertices" +msgstr "`#2682 `__: pgr_trspViaVertices" -msgid "" -"`#2748 `__: " -"pgr_alphaShape" -msgstr "" -"`#2748 `__: " -"pgr_alphaShape" +msgid "`#2748 `__: pgr_alphaShape" +msgstr "`#2748 `__: pgr_alphaShape" -msgid "" -"`#2751 `__: " -"pgr_createTopology" -msgstr "" -"`#2751 `__: " -"pgr_createTopology" +msgid "`#2751 `__: pgr_createTopology" +msgstr "`#2751 `__: pgr_createTopology" -msgid "" -"`#2752 `__: " -"pgr_analyzeGraph" -msgstr "" -"`#2752 `__: " -"pgr_analyzeGraph" +msgid "`#2752 `__: pgr_analyzeGraph" +msgstr "`#2752 `__: pgr_analyzeGraph" -msgid "" -"`#2755 `__: " -"pgr_analyzeOneWay" -msgstr "" -"`#2755 `__: " -"pgr_analyzeOneWay" +msgid "`#2755 `__: pgr_analyzeOneWay" +msgstr "`#2755 `__: pgr_analyzeOneWay" -msgid "" -"`#2827 `__: " -"pgr_createVerticesTable" -msgstr "" -"`#2827 `__: " -"pgr_createVerticesTable" +msgid "`#2827 `__: pgr_createVerticesTable" +msgstr "`#2827 `__: pgr_createVerticesTable" -msgid "" -"`#2886 `__: " -"pgr_nodeNetwork" -msgstr "" -"`#2886 `__: " -"pgr_nodeNetwork" +msgid "`#2886 `__: pgr_nodeNetwork" +msgstr "`#2886 `__: pgr_nodeNetwork" msgid "Removal of SQL deprecated internal functions" msgstr "Eliminación de funciones internas SQL obsoletas" -msgid "" -"`#2748 `__ " -"_pgr_alphaShape(text,double precision)" -msgstr "" -"`#2748 `__ " -"_pgr_alphaShape(text,double precision)" +msgid "`#2748 `__ _pgr_alphaShape(text,double precision)" +msgstr "`#2748 `__ _pgr_alphaShape(text,double precision)" -msgid "" -"`#2861 `__ " -"_pgr_checkVertTab(text,text[],integer,text)" -msgstr "" -"`#2861 `__ " -"_pgr_checkVertTab(text,text[],integer,text)" +msgid "`#2861 `__ _pgr_checkVertTab(text,text[],integer,text)" +msgstr "`#2861 `__ _pgr_checkVertTab(text,text[],integer,text)" -msgid "" -"`#2861 `__ " -"_pgr_createIndex(text,text,text,integer,text)" -msgstr "" -"`#2861 `__ " -"_pgr_createIndex(text,text,text,integer,text)" +msgid "`#2861 `__ _pgr_createIndex(text,text,text,integer,text)" +msgstr "`#2861 `__ _pgr_createIndex(text,text,text,integer,text)" -msgid "" -"`#2861 `__ " -"_pgr_createIndex(text,text,text,text,integer,text)" -msgstr "" -"`#2861 `__ " -"_pgr_createIndex(text,text,text,text,integer,text)" +msgid "`#2861 `__ _pgr_createIndex(text,text,text,text,integer,text)" +msgstr "`#2861 `__ _pgr_createIndex(text,text,text,text,integer,text)" -msgid "" -"`#2913 `__ " -"_pgr_dagShortestPath(text,anyarray,anyarray,boolean,boolean)" -msgstr "" -"`#2913 `__ " -"_pgr_dagShortestPath(text,anyarray,anyarray,boolean,boolean)" +msgid "`#2913 `__ _pgr_dagShortestPath(text,anyarray,anyarray,boolean,boolean)" +msgstr "`#2913 `__ _pgr_dagShortestPath(text,anyarray,anyarray,boolean,boolean)" -msgid "" -"`#2913 `__ " -"_pgr_dagShortestPath(text,text,boolean,boolean)" -msgstr "" -"`#2913 `__ " -"_pgr_dagShortestPath(text,text,boolean,boolean)" +msgid "`#2913 `__ _pgr_dagShortestPath(text,text,boolean,boolean)" +msgstr "`#2913 `__ _pgr_dagShortestPath(text,text,boolean,boolean)" -msgid "" -"`#2730 `__ " -"_pgr_dijkstraNear(text,anyarray,anyarray,bigint,boolean)" -msgstr "" -"`#2730 `__ " -"_pgr_dijkstraNear(text,anyarray,anyarray,bigint,boolean)" +msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,anyarray,bigint,boolean)" +msgstr "`#2730 `__ _pgr_dijkstraNear(text,anyarray,anyarray,bigint,boolean)" -msgid "" -"`#2730 `__ " -"_pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)" -msgstr "" -"`#2730 `__ " -"_pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)" +msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)" +msgstr "`#2730 `__ _pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)" -msgid "" -"`#2730 `__ " -"_pgr_dijkstraNear(text,bigint,anyarray,bigint,boolean)" -msgstr "" -"`#2730 `__ " -"_pgr_dijkstranear(text,bigint,anyarray,bigint,boolean)" +msgid "`#2730 `__ _pgr_dijkstraNear(text,bigint,anyarray,bigint,boolean)" +msgstr "`#2730 `__ _pgr_dijkstranear(text,bigint,anyarray,bigint,boolean)" -msgid "" -"`#2730 `__ " -"_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" -msgstr "" -"`#2730 `__ " -"_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" +msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" +msgstr "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" -msgid "" -"`#2730 `__ " -"_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" -msgstr "" -"`#2730 `__ " -"_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" +msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" +msgstr "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" -msgid "" -"`#2730 `__ " -"_pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" -msgstr "" -"`#2730 `__ " -"_pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" +msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" +msgstr "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" -msgid "" -"`#2730 `__ " -"_pgr_dijkstra(text,text,boolean,boolean,boolean)" -msgstr "" -"`#2730 `__ " -"_pgr_dijkstra(text,text,boolean,boolean,boolean)" +msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,boolean)" +msgstr "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,boolean)" -msgid "" -"`#2735 `__ " -"_pgr_drivingDistance(text,anyarray,double precision,boolean,boolean)" -msgstr "" -"`#2735 `__ " -"_pgr_drivingDistance(text,anyarray,double precision,boolean,boolean)" +msgid "`#2735 `__ _pgr_drivingDistance(text,anyarray,double precision,boolean,boolean)" +msgstr "`#2735 `__ _pgr_drivingDistance(text,anyarray,double precision,boolean,boolean)" -msgid "" -"`#2861 `__ " -"_pgr_endPoint(geometry)" -msgstr "" -"`#2861 `__ " -"_pgr_endPoint(geometry)" +msgid "`#2861 `__ _pgr_endPoint(geometry)" +msgstr "`#2861 `__ _pgr_endPoint(geometry)" -msgid "" -"`#2861 `__ " -"__pgr_getColumnName(text,text,integer,text)" -msgstr "" -"`#2861 `__ " -"__pgr_getColumnName(text,text,integer,text)" +msgid "`#2861 `__ __pgr_getColumnName(text,text,integer,text)" +msgstr "`#2861 `__ __pgr_getColumnName(text,text,integer,text)" -msgid "" -"`#2861 `__ " -"__pgr_getColumnName(text,text,text,integer,text)" -msgstr "" -"`#2861 `__ " -"__pgr_getColumnName(text,text,text,integer,text)" +msgid "`#2861 `__ __pgr_getColumnName(text,text,text,integer,text)" +msgstr "`#2861 `__ __pgr_getColumnName(text,text,text,integer,text)" -msgid "" -"`#2861 `__ " -"__pgr_getColumnType(text,text,integer,text)" -msgstr "" -"`#2861 `__ " -"_pgr_getcolumntype(text,text,integer,text)" +msgid "`#2861 `__ __pgr_getColumnType(text,text,integer,text)" +msgstr "`#2861 `__ _pgr_getcolumntype(text,text,integer,text)" -msgid "" -"`#2861 `__ " -"__pgr_getColumnType(text,text,text,integer,text)" -msgstr "" -"`#2861 `__ " -"__pgr_getColumnType(text,text,text,integer,text)" +msgid "`#2861 `__ __pgr_getColumnType(text,text,text,integer,text)" +msgstr "`#2861 `__ __pgr_getColumnType(text,text,text,integer,text)" -msgid "" -"`#2861 `__ " -"__pgr_getTableName(text,integer,text)" -msgstr "" -"`#2861 `__ " -"__pgr_getTableName(text,integer,text)" +msgid "`#2861 `__ __pgr_getTableName(text,integer,text)" +msgstr "`#2861 `__ __pgr_getTableName(text,integer,text)" -msgid "" -"`#2861 `__ " -"_pgr_isColumnIndexed(text,text,integer,text)" -msgstr "" -"`#2861 `__ " -"_pgr_isColumnIndexed(text,text,integer,text)" +msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,integer,text)" +msgstr "`#2861 `__ _pgr_isColumnIndexed(text,text,integer,text)" -msgid "" -"`#2861 `__ " -"_pgr_isColumnIndexed(text,text,text,integer,text)" -msgstr "" -"`#2861 `__ " -"_pgr_isColumnIndexed(text,text,text,integer,text)" +msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,text,integer,text)" +msgstr "`#2861 `__ _pgr_isColumnIndexed(text,text,text,integer,text)" -msgid "" -"`#2861 `__ " -"_pgr_isColumnIntable(text,text)" -msgstr "" -"`#2861 `__ " -"_pgr_isColumnIntable(text,text)" +msgid "`#2861 `__ _pgr_isColumnIntable(text,text)" +msgstr "`#2861 `__ _pgr_isColumnIntable(text,text)" -msgid "" -"`#2745 `__ " -"_pgr_kruskal(text,anyarray,text,bigint,double precision)" -msgstr "" -"`#2745 `__ " -"_pgr_kruskal(text,anyarray,text,bigint,double precision)" +msgid "`#2745 `__ _pgr_kruskal(text,anyarray,text,bigint,double precision)" +msgstr "`#2745 `__ _pgr_kruskal(text,anyarray,text,bigint,double precision)" -msgid "" -"`#2897 `__ _pgr_ksp(text," -"anyarray,anyarray,integer,boolean,boolean,boolean)" -msgstr "" -"`#2897 `__ _pgr_ksp(text," -"anyarray,anyarray,integer,boolean,boolean,boolean)" +msgid "`#2897 `__ _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean)" +msgstr "`#2897 `__ _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean)" -msgid "" -"`#2897 `__ _pgr_ksp(text," -"bigint,bigint,integer,boolean,boolean)" -msgstr "" -"`#2897 `__ _pgr_ksp(text," -"bigint,bigint,integer,boolean,boolean)" +msgid "`#2897 `__ _pgr_ksp(text,bigint,bigint,integer,boolean,boolean)" +msgstr "`#2897 `__ _pgr_ksp(text,bigint,bigint,integer,boolean,boolean)" -msgid "" -"`#2897 `__ _pgr_ksp(text," -"text,integer,boolean,boolean)" -msgstr "" -"`#2897 `__ _pgr_ksp(text," -"text,integer,boolean,boolean)" +msgid "`#2897 `__ _pgr_ksp(text,text,integer,boolean,boolean)" +msgstr "`#2897 `__ _pgr_ksp(text,text,integer,boolean,boolean)" -msgid "" -"`#2899 `__ " -"_pgr_maxCardinalityMatch(text,boolean)" -msgstr "" -"`#2899 `__ " -"_pgr_maxCardinalityMatch(text,boolean)" +msgid "`#2899 `__ _pgr_maxCardinalityMatch(text,boolean)" +msgstr "`#2899 `__ _pgr_maxCardinalityMatch(text,boolean)" -msgid "" -"`#2861 `__ " -"_pgr_msg(integer,text,text)" -msgstr "" -"`#2861 `__ " -"_pgr_msg(integer,text,text)" +msgid "`#2861 `__ _pgr_msg(integer,text,text)" +msgstr "`#2861 `__ _pgr_msg(integer,text,text)" -msgid "" -"`#2861 `__ " -"_pgr_onerror(boolean,integer,text,text,text,text)" -msgstr "" -"`#2861 `__ " -"_pgr_onerror(boolean,integer,text,text,text,text)" +msgid "`#2861 `__ _pgr_onerror(boolean,integer,text,text,text,text)" +msgstr "`#2861 `__ _pgr_onerror(boolean,integer,text,text,text,text)" -msgid "" -"`#2861 `__ " -"_pgr_pointtoid(geometry,double precision,text,integer)" -msgstr "" -"`#2861 `__ " -"_pgr_pointtoid(geometry,double precision,text,integer)" +msgid "`#2861 `__ _pgr_pointtoid(geometry,double precision,text,integer)" +msgstr "`#2861 `__ _pgr_pointtoid(geometry,double precision,text,integer)" -msgid "" -"`#2743 `__ " -"_pgr_prim(text,anyarray,text,bigint,double precision)" -msgstr "" -"`#2743 `__ " -"_pgr_prim(text,anyarray,text,bigint,double precision)" +msgid "`#2743 `__ _pgr_prim(text,anyarray,text,bigint,double precision)" +msgstr "`#2743 `__ _pgr_prim(text,anyarray,text,bigint,double precision)" -msgid "" -"`#2861 `__ " -"_pgr_quote_ident(text)" -msgstr "" -"`#2861 `__ " -"_pgr_quote_ident(text)" +msgid "`#2861 `__ _pgr_quote_ident(text)" +msgstr "`#2861 `__ _pgr_quote_ident(text)" -msgid "" -"`#2861 `__ " -"_pgr_startPoint(geometry)" -msgstr "" -"`#2861 `__ " -"_pgr_startPoint(geometry)" +msgid "`#2861 `__ _pgr_startPoint(geometry)" +msgstr "`#2861 `__ _pgr_startPoint(geometry)" -msgid "" -"`#2683 `__ " -"_pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean,text)" -msgstr "" -"`#2683 `__ " -"_pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean,text)" +msgid "`#2683 `__ _pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +msgstr "`#2683 `__ _pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" -msgid "" -"`#2683 `__ " -"_pgr_trsp(text,text,anyarray,anyarray,boolean)" -msgstr "" -"`#2683 `__ " -"_pgr_trsp(text,text,anyarray,anyarray,boolean)" +msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,anyarray,boolean)" +msgstr "`#2683 `__ _pgr_trsp(text,text,anyarray,anyarray,boolean)" -msgid "" -"`#2683 `__ " -"_pgr_trsp(text,text,anyarray,bigint,boolean)" -msgstr "" -"`#2683 `__ " -"_pgr_trsp(text,text,anyarray,bigint,boolean)" +msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,bigint,boolean)" +msgstr "`#2683 `__ _pgr_trsp(text,text,anyarray,bigint,boolean)" -msgid "" -"`#2683 `__ " -"_pgr_trsp(text,text,bigint,anyarray,boolean)" -msgstr "" -"`#2683 `__ " -"_pgr_trsp(text,text,bigint,anyarray,boolean)" +msgid "`#2683 `__ _pgr_trsp(text,text,bigint,anyarray,boolean)" +msgstr "`#2683 `__ _pgr_trsp(text,text,bigint,anyarray,boolean)" -msgid "" -"`#2683 `__ " -"_pgr_trsp(text,text,bigint,bigint,boolean)" -msgstr "" -"`#2683 `__ " -"_pgr_trsp(text,text,bigint,bigint,boolean)" +msgid "`#2683 `__ _pgr_trsp(text,text,bigint,bigint,boolean)" +msgstr "`#2683 `__ _pgr_trsp(text,text,bigint,bigint,boolean)" -msgid "" -"`#2682 `__ " -"_pgr_trspViaVertices(text,integer[],boolean,boolean,text)" -msgstr "" -"`#2682 `__ " -"_pgr_trspViaVertices(text,integer[],boolean,boolean,text)" +msgid "`#2682 `__ _pgr_trspViaVertices(text,integer[],boolean,boolean,text)" +msgstr "`#2682 `__ _pgr_trspViaVertices(text,integer[],boolean,boolean,text)" -msgid "" -"`#2919 `__ " -"_pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean," -"character,boolean)" -msgstr "" -"`#2919 `__ " -"_pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean," -"character,boolean)" +msgid "`#2919 `__ _pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgstr "`#2919 `__ _pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgid "" -"`#2919 `__ " -"_pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character," -"boolean)" -msgstr "" -"`#2919 `__ " -"_pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character," -"boolean)" +msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +msgstr "`#2919 `__ _pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" -msgid "" -"`#2919 `__ " -"_pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" -msgstr "" -"`#2919 `__ " -"_pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" +msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" +msgstr "`#2919 `__ _pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" -msgid "" -"`#2901 `__ " -"_pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer," -"integer,double precision,double precision,double precision,boolean)" -msgstr "" -"`#2901 `__ " -"_pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer," -"integer,double precision,double precision,double precision,boolean)" +msgid "`#2901 `__ _pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgstr "`#2901 `__ _pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" -msgid "" -"`#2901 `__ _pgr_tsp(text," -"bigint,bigint,double precision,integer,integer,integer,double precision," -"double precision,double precision,boolean)" -msgstr "" -"`#2901 `__ _pgr_tsp(text," -"bigint,bigint,double precision,integer,integer,integer,double precision," -"double precision,double precision,boolean)" +msgid "`#2901 `__ _pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgstr "`#2901 `__ _pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" -msgid "" -"`#2861 `__ " -"_pgr_versionLess(text,text)" -msgstr "" -"`#2861 `__ " -"_pgr_versionLess(text,text)" +msgid "`#2861 `__ _pgr_versionLess(text,text)" +msgstr "`#2861 `__ _pgr_versionLess(text,text)" -msgid "" -"`#2890 `__ " -"_pgr_withPointsDD(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" -msgstr "" -"`#2890 `__ " -"_pgr_withPointsDD(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" +msgid "`#2890 `__ _pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgstr "`#2890 `__ _pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" -msgid "" -"`#2895 `__ " -"_pgr_withPointsKSP(text,text,anyarray,anyarray,integer,character,boolean," -"boolean,boolean,boolean)" -msgstr "" -"`#2895 `__ " -"_pgr_withPointsKSP(text,text,anyarray,anyarray,integer,character,boolean," -"boolean,boolean,boolean)" +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean)" +msgstr "`#2895 `__ _pgr_withPointsKSP(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean)" -msgid "" -"`#2895 `__ " -"_pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character," -"boolean)" -msgstr "" -"`#2895 `__ " -"_pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character," -"boolean)" +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +msgstr "`#2895 `__ _pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" -msgid "" -"`#2895 `__ " -"_pgr_withPointsKSP(text,text,text,integer,character,boolean,boolean,boolean)" -msgstr "" -"`#2895 `__ " -"_pgr_withPointsKSP(text,text,text,integer,character,boolean,boolean,boolean)" +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,text,integer,character,boolean,boolean,boolean)" +msgstr "`#2895 `__ _pgr_withPointsKSP(text,text,text,integer,character,boolean,boolean,boolean)" -msgid "" -"`#2741 `__ " -"_pgr_withPointsVia(text,bigint[],double precision[],boolean)" -msgstr "" -"`#2741 `__ " -"_pgr_withPointsVia(text,bigint[],double precision[],boolean)" +msgid "`#2741 `__ _pgr_withPointsVia(text,bigint[],double precision[],boolean)" +msgstr "`#2741 `__ _pgr_withPointsVia(text,bigint[],double precision[],boolean)" -msgid "" -"`#2741 `__ " -"_pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character," -"boolean)" -msgstr "" -"`#2741 `__ " -"_pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character," -"boolean)" +msgid "`#2741 `__ _pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgstr "`#2741 `__ _pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgid "" -"`#2683 `__ _trsp(text," -"text,anyarray,anyarray,boolean)" -msgstr "" -"`#2683 `__ _trsp(text," -"text,anyarray,anyarray,boolean)" +msgid "`#2683 `__ _trsp(text,text,anyarray,anyarray,boolean)" +msgstr "`#2683 `__ _trsp(text,text,anyarray,anyarray,boolean)" -msgid "" -"`#2683 `__ _v4trsp(text," -"text,anyarray,anyarray,boolean)" -msgstr "" -"`#2683 `__ _v4trsp(text," -"text,anyarray,anyarray,boolean)" +msgid "`#2683 `__ _v4trsp(text,text,anyarray,anyarray,boolean)" +msgstr "`#2683 `__ _v4trsp(text,text,anyarray,anyarray,boolean)" -msgid "" -"`#2683 `__ _v4trsp(text," -"text,text,boolean)" -msgstr "" -"`#2683 `__ _v4trsp(text," -"text,text,boolean)" +msgid "`#2683 `__ _v4trsp(text,text,text,boolean)" +msgstr "`#2683 `__ _v4trsp(text,text,text,boolean)" msgid "Summary of functions and signatures no longer on pgrouting" msgstr "Resumen de funciones y firmas que ya no están en pgrouting" -msgid "" -"`#2748 `__ " -"pgr_alphashape(geometry,double precision)" -msgstr "" -"`#2748 `__ " -"pgr_alphashape(geometry,double precision)" +msgid "`#2748 `__ pgr_alphashape(geometry,double precision)" +msgstr "`#2748 `__ pgr_alphashape(geometry,double precision)" -msgid "" -"`#2752 `__ " -"pgr_analyzegraph(text,double precision,text,text,text,text,text)" -msgstr "" -"`#2752 `__ " -"pgr_analyzegraph(text,double precision,text,text,text,text,text)" +msgid "`#2752 `__ pgr_analyzegraph(text,double precision,text,text,text,text,text)" +msgstr "`#2752 `__ pgr_analyzegraph(text,double precision,text,text,text,text,text)" -msgid "" -"`#2755 `__ " -"pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)" -msgstr "" -"`#2755 `__ " -"pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)" +msgid "`#2755 `__ pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)" +msgstr "`#2755 `__ pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)" -msgid "" -"`#2798 `__ " -"pgr_contraction(text,bigint[],integer,bigint[],boolean)" -msgstr "" -"`#2798 `__ " -"pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgid "`#2798 `__ pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgstr "`#2798 `__ pgr_contraction(text,bigint[],integer,bigint[],boolean)" -msgid "" -"`#2751 `__ " -"pgr_createtopology(text,double precision,text,text,text,text,text,boolean)" -msgstr "" -"`#2751 `__ " -"pgr_createtopology(text,double precision,text,text,text,text,text,boolean)" +msgid "`#2751 `__ pgr_createtopology(text,double precision,text,text,text,text,text,boolean)" +msgstr "`#2751 `__ pgr_createtopology(text,double precision,text,text,text,text,text,boolean)" -msgid "" -"`#2827 `__ " -"pgr_createverticestable(text,text,text,text,text)" -msgstr "" -"`#2827 `__ " -"pgr_createverticestable(text,text,text,text,text)" +msgid "`#2827 `__ pgr_createverticestable(text,text,text,text,text)" +msgstr "`#2827 `__ pgr_createverticestable(text,text,text,text,text)" -msgid "" -"`#2888 `__ " -"pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" -msgstr "" -"`#2888 `__ " -"pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" +msgid "`#2888 `__ pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" +msgstr "`#2888 `__ pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" -msgid "" -"`#2888 `__ " -"pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" -msgstr "" -"`#2888 `__ " -"pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" +msgid "`#2888 `__ pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" +msgstr "`#2888 `__ pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" -msgid "" -"`#2899 `__ " -"pgr_maxCardinalityMatch(text,boolean)" -msgstr "" -"`#2899 `__ " -"pgr_maxCardinalityMatch(text,boolean)" +msgid "`#2899 `__ pgr_maxCardinalityMatch(text,boolean)" +msgstr "`#2899 `__ pgr_maxCardinalityMatch(text,boolean)" -msgid "" -"`#2886 `__ " -"pgr_nodenetwork(text,double precision,text,text,text,text,boolean)" -msgstr "" -"`#2886 `__ " -"pgr_nodenetwork(text,double precision,text,text,text,text,boolean)" +msgid "`#2886 `__ pgr_nodenetwork(text,double precision,text,text,text,text,boolean)" +msgstr "`#2886 `__ pgr_nodenetwork(text,double precision,text,text,text,text,boolean)" -msgid "" -"`#2683 `__ pgr_trsp(text," -"integer,double precision,integer,double precision,boolean,boolean,text)" -msgstr "" -"`#2683 `__ pgr_trsp(text," -"integer,double precision,integer,double precision,boolean,boolean,text)" +msgid "`#2683 `__ pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +msgstr "`#2683 `__ pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" -msgid "" -"`#2683 `__ pgr_trsp(text," -"integer,integer,boolean,boolean,text)" -msgstr "" -"`#2683 `__ pgr_trsp(text," -"integer,integer,boolean,boolean,text)" +msgid "`#2683 `__ pgr_trsp(text,integer,integer,boolean,boolean,text)" +msgstr "`#2683 `__ pgr_trsp(text,integer,integer,boolean,boolean,text)" -msgid "" -"`#2681 `__ " -"pgr_trspViaedges(text,integer[],double precision[],boolean,boolean,text)" -msgstr "" -"`#2681 `__ " -"pgr_trspViaedges(text,integer[],double precision[],boolean,boolean,text)" +msgid "`#2681 `__ pgr_trspViaedges(text,integer[],double precision[],boolean,boolean,text)" +msgstr "`#2681 `__ pgr_trspViaedges(text,integer[],double precision[],boolean,boolean,text)" -msgid "" -"`#2682 `__ " -"pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" -msgstr "" -"`#2682 `__ " -"pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" +msgid "`#2682 `__ pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" +msgstr "`#2682 `__ pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" -msgid "" -"`#2919 `__ " -"pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean," -"character,boolean)" -msgstr "" -"`#2919 `__ " -"pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean," -"character,boolean)" +msgid "`#2919 `__ pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgid "" -"`#2919 `__ " -"pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character," -"boolean)" -msgstr "" -"`#2919 `__ " -"pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character," -"boolean)" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" -msgid "" -"`#2919 `__ " -"pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)" -msgstr "" -"`#2919 `__ " -"pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)" -msgid "" -"`#2919 `__ " -"pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)" -msgstr "" -"`#2919 `__ " -"pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)" -msgid "" -"`#2919 `__ " -"pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)" -msgstr "" -"`#2919 `__ " -"pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)" -msgid "" -"`#2919 `__ " -"pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" -msgstr "" -"`#2919 `__ " -"pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" -msgid "" -"`#2901 `__ " -"pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer," -"double precision,double precision,double precision,boolean)" -msgstr "" -"`#2901 `__ " -"pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer," -"double precision,double precision,double precision,boolean)" +msgid "`#2901 `__ pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgstr "`#2901 `__ pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" -msgid "" -"`#2901 `__ pgr_tsp(text," -"bigint,bigint,double precision,integer,integer,integer,double precision," -"double precision,double precision,boolean)" -msgstr "" -"`#2901 `__ pgr_tsp(text," -"bigint,bigint,double precision,integer,integer,integer,double precision," -"double precision,double precision,boolean)" +msgid "`#2901 `__ pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgstr "`#2901 `__ pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" -msgid "" -"`#2919 `__ " -"pgr_withPointsCostMatrix(text,text,anyarray,boolean,character)" -msgstr "" -"`#2919 `__ " -"pgr_withPointsCostMatrix(text,text,anyarray,boolean,character)" +msgid "`#2919 `__ pgr_withPointsCostMatrix(text,text,anyarray,boolean,character)" +msgstr "`#2919 `__ pgr_withPointsCostMatrix(text,text,anyarray,boolean,character)" -msgid "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,anyarray,anyarray,boolean,character)" -msgstr "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,anyarray,anyarray,boolean,character)" +msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,anyarray,boolean,character)" +msgstr "`#2919 `__ pgr_withPointsCost(text,text,anyarray,anyarray,boolean,character)" -msgid "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,anyarray,bigint,boolean,character)" -msgstr "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,anyarray,bigint,boolean,character)" +msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,bigint,boolean,character)" +msgstr "`#2919 `__ pgr_withPointsCost(text,text,anyarray,bigint,boolean,character)" -msgid "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,bigint,anyarray,boolean,character)" -msgstr "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,bigint,anyarray,boolean,character)" +msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,anyarray,boolean,character)" +msgstr "`#2919 `__ pgr_withPointsCost(text,text,bigint,anyarray,boolean,character)" -msgid "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,bigint,bigint,boolean,character)" -msgstr "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,bigint,bigint,boolean,character)" +msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,bigint,boolean,character)" +msgstr "`#2919 `__ pgr_withPointsCost(text,text,bigint,bigint,boolean,character)" -msgid "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,text,boolean,character)" -msgstr "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,text,boolean,character)" +msgid "`#2919 `__ pgr_withPointsCost(text,text,text,boolean,character)" +msgstr "`#2919 `__ pgr_withPointsCost(text,text,text,boolean,character)" -msgid "" -"`#2890 `__ " -"pgr_withPointsDD(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" -msgstr "" -"`#2890 `__ " -"pgr_withPointsDD(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" +msgid "`#2890 `__ pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgstr "`#2890 `__ pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" -msgid "" -"`#2890 `__ " -"pgr_withPointsDD(text,text,bigint,double precision,boolean,character,boolean)" -msgstr "" -"`#2890 `__ " -"pgr_withPointsDD(text,text,bigint,double precision,boolean,character,boolean)" +msgid "`#2890 `__ pgr_withPointsDD(text,text,bigint,double precision,boolean,character,boolean)" +msgstr "`#2890 `__ pgr_withPointsDD(text,text,bigint,double precision,boolean,character,boolean)" -msgid "" -"`#2895 `__ " -"pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character," -"boolean)" -msgstr "" -"`#2895 `__ " -"pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character," -"boolean)" +msgid "`#2895 `__ pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +msgstr "`#2895 `__ pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" -msgid "" -"`#2919 `__ " -"pgr_withPoints(text,text,anyarray,anyarray,boolean,character,boolean)" -msgstr "" -"`#2919 `__ " -"pgr_withPoints(text,text,anyarray,anyarray,boolean,character,boolean)" +msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,anyarray,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_withPoints(text,text,anyarray,anyarray,boolean,character,boolean)" -msgid "" -"`#2919 `__ " -"pgr_withPoints(text,text,anyarray,bigint,boolean,character,boolean)" -msgstr "" -"`#2919 `__ " -"pgr_withPoints(text,text,anyarray,bigint,boolean,character,boolean)" +msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,bigint,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_withPoints(text,text,anyarray,bigint,boolean,character,boolean)" -msgid "" -"`#2919 `__ " -"pgr_withPoints(text,text,bigint,anyarray,boolean,character,boolean)" -msgstr "" -"`#2919 `__ " -"pgr_withPoints(text,text,bigint,anyarray,boolean,character,boolean)" +msgid "`#2919 `__ pgr_withPoints(text,text,bigint,anyarray,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_withPoints(text,text,bigint,anyarray,boolean,character,boolean)" -msgid "" -"`#2919 `__ " -"pgr_withPoints(text,text,bigint,bigint,boolean,character,boolean)" -msgstr "" -"`#2919 `__ " -"pgr_withPoints(text,text,bigint,bigint,boolean,character,boolean)" +msgid "`#2919 `__ pgr_withPoints(text,text,bigint,bigint,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_withPoints(text,text,bigint,bigint,boolean,character,boolean)" -msgid "" -"`#2919 `__ " -"pgr_withPoints(text,text,text,boolean,character,boolean)" -msgstr "" -"`#2919 `__ " -"pgr_withPoints(text,text,text,boolean,character,boolean)" +msgid "`#2919 `__ pgr_withPoints(text,text,text,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_withPoints(text,text,text,boolean,character,boolean)" -msgid "" -"`#2919 `__ " -"pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character," -"boolean)" -msgstr "" -"`#2919 `__ " -"pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character," -"boolean)" +msgid "`#2919 `__ pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgstr "`#2919 `__ pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgid "Code enhancements" msgstr "Mejoras del código" @@ -6005,19 +4507,11 @@ msgstr "`#2683 `__ _trsp" msgid "`#2683 `__ _v4trsp" msgstr "`#2683 `__ _v4trsp" -msgid "" -"`#2748 `__ " -"_pgr_alphaShape" -msgstr "" -"`#2748 `__ " -"_pgr_alphaShape" +msgid "`#2748 `__ _pgr_alphaShape" +msgstr "`#2748 `__ _pgr_alphaShape" -msgid "" -"`#2913 `__ " -"_pgr_dagShortestPath" -msgstr "" -"`#2913 `__ " -"_pgr_dagShortestPath" +msgid "`#2913 `__ _pgr_dagShortestPath" +msgstr "`#2913 `__ _pgr_dagShortestPath" msgid "All releases" msgstr "Todas las versiones" @@ -6025,14 +4519,8 @@ msgstr "Todas las versiones" msgid "Kruskal - Family of functions" msgstr "Kruskal - Familia de funciones" -msgid "" -"Kruskal's algorithm is a greedy minimum spanning tree algorithm that in each " -"cycle finds and adds the edge of the least possible weight that connects any " -"two trees in the forest." -msgstr "" -"Kruskal es un ambicioso algoritmo para generar un árbol de expansión mínimo " -"que en cada ciclo encuentra y agrega la arista del menor peso posible que " -"conecta dos árboles en el bosque." +msgid "Kruskal's algorithm is a greedy minimum spanning tree algorithm that in each cycle finds and adds the edge of the least possible weight that connects any two trees in the forest." +msgstr "Kruskal es un ambicioso algoritmo para generar un árbol de expansión mínimo que en cada ciclo encuentra y agrega la arista del menor peso posible que conecta dos árboles en el bosque." msgid "**The main Characteristics are:**" msgstr "**Las características principales son:**" @@ -6049,27 +4537,19 @@ 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 "Several functions are having changes on the signatures, and/or have been replaced by new functions." +msgstr "Varias funciones están teniendo cambios en las firmas, y/o han sido remplazadas por nuevas funciones." msgid "Results can be different because of the changes." msgstr "Resultados pueden ser diferentes dado los cambios." msgid "All deprecated functions will be removed on next major version 4.0.0" -msgstr "" -"Todas las funciones obsoletas serán removidas en las siguiente versión mayor " -"4.0.0" +msgstr "Todas las funciones obsoletas serán removidas en las siguiente versión mayor 4.0.0" msgid "Migration to standardized columns" msgstr "Migración a columnas estandarizadas" -msgid "" -"There has been an effort to standardize function output columns names and " -"types." +msgid "There has been an effort to standardize function output columns names and types." msgstr "" #, fuzzy @@ -6156,14 +4636,10 @@ msgstr "`Migración de las funciones de coste`_" msgid "Migration of cost functions" msgstr "Migración de las funciones de coste" -msgid "" -"The standardized :ref:`pgRouting-concepts:Result columns for cost functions` " -"are |matrix-result|" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for cost functions` are |matrix-result|" msgstr "" -msgid "" -"The following functions need to be migrated when they are being used in an " -"application." +msgid "The following functions need to be migrated when they are being used in an application." msgstr "" msgid "Version" @@ -6211,17 +4687,13 @@ msgstr "Combinaciones" msgid "Breaking change" msgstr "Cambio de ruptura" -msgid "" -"If using ``pgr_withPointsCost``: column names must be changed after updating " -"pgRouting" +msgid "If using ``pgr_withPointsCost``: column names must be changed after updating pgRouting" msgstr "" msgid "New output columns are |matrix-result|" msgstr "Las nuevas columnas de salida son |matrix-result|" -msgid "" -"To get the old version column names: rename ``start_vid`` to ``start_pid`` " -"and ``end_vid`` to ``end_pid``." +msgid "To get the old version column names: rename ``start_vid`` to ``start_pid`` and ``end_vid`` to ``end_pid``." msgstr "" msgid "Examples" @@ -6233,12 +4705,8 @@ msgstr "Ejemplos de uno a uno para funciones de coste" msgid "Using ``pgr_withPointsCost``" msgstr "Usando ``pgr_withPointsCost``" -msgid "" -"Migrating `this v3.8 `__ example." -msgstr "" -"Migrando ejemplo `de v3.8 `__." +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrando ejemplo `de v3.8 `__." msgid "from" msgstr "de" @@ -6250,54 +4718,36 @@ msgstr "a" msgid "Examples for One to Many for cost functions" msgstr "Columnas de resultados de las funciones de costes" -msgid "" -"Migrating `this v3.8 `__ example." -msgstr "" -"Migrando ejemplo `de v3.8 `__." +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrando ejemplo `de v3.8 `__." #, fuzzy msgid "Examples for Many to One for cost functions" msgstr "Columnas de resultados de las funciones de costes" -msgid "" -"Migrating `this v3.8 `__ example." -msgstr "" -"Migrando ejemplo `de v3.8 `__." +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrando ejemplo `de v3.8 `__." #, fuzzy msgid "Examples for Many to Many for cost functions" msgstr "Columnas de resultados de las funciones de costes" -msgid "" -"Migrating `this v3.8 `__ example." -msgstr "" -"Migrando ejemplo `de v3.8 `__." +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrando ejemplo `de v3.8 `__." #, fuzzy msgid "Examples for Combinations for cost functions" msgstr "Columnas de resultados de las funciones de costes" -msgid "" -"Migrating `this v3.8 `__ example." -msgstr "" -"Migrando ejemplo `de v3.8 `__." +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrando ejemplo `de v3.8 `__." #, fuzzy msgid "Migration of multiple paths functions" msgstr "Migración de restricciones" #, fuzzy -msgid "" -"The standardized :ref:`pgRouting-concepts:Result columns for single path " -"functions` are |nksp-result|" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |nksp-result|" msgstr "Estandard de las columnas de salida a |short-generic-result|" msgid "``pgr_KSP``" @@ -6330,12 +4780,8 @@ msgstr "Cambio estructural en las columnas de resultados" msgid "One to One example using ``pgr_KSP``" msgstr "" -msgid "" -"Using `this `__ " -"example." -msgstr "" -"Usando `éste `__ " -"ejemplo." +msgid "Using `this `__ example." +msgstr "Usando `éste `__ ejemplo." msgid "Migration of |result-disjoint|" msgstr "Migración de |result-disjoint|" @@ -6355,12 +4801,8 @@ msgstr "luego por ``end_vid``" msgid "One to One example using ``pgr_edgeDisjointPaths``" msgstr "``pgr_edgeDisjointPaths``" -msgid "" -"Migrating `this v3.8 `__ example." -msgstr "" -"Migrando ejemplo `de v3.6 `__." +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrando ejemplo `de v3.6 `__." #, fuzzy msgid "Before updating pgRouting enumerate the columns: |ksp-result|" @@ -6371,9 +4813,7 @@ msgid "Migration of single path functions" msgstr "Migración de restricciones" #, fuzzy -msgid "" -"The standardized :ref:`pgRouting-concepts:Result columns for single path " -"functions` are |short-generic-result|" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |short-generic-result|" msgstr "Estandard de las columnas de salida a |short-generic-result|" msgid "``pgr_dijkstra``" @@ -6412,9 +4852,7 @@ msgstr "|old-pid-result|" msgid "Migration of |old-generic-result|" msgstr "Migración de |old-generic-result|" -msgid "" -"Before updating pgRouting, enumerate the corresponding columns of the " -"signature" +msgid "Before updating pgRouting, enumerate the corresponding columns of the signature" msgstr "" msgid "Migration of |old-pid-result|" @@ -6435,9 +4873,7 @@ msgstr "``start_vid`` a ``end_pid``" msgid "``end_vid`` to ``end_pid``" msgstr "``end_vid`` a ``end_pid``" -msgid "" -"If using ``pgr_withPoints``: column names must be changed after updating " -"pgRouting" +msgid "If using ``pgr_withPoints``: column names must be changed after updating pgRouting" msgstr "" msgid "Migration of |result-1-1|" @@ -6456,12 +4892,8 @@ msgstr "" msgid "Using ``pgr_aStar``" msgstr "Usando ``pgr_aStar``" -msgid "" -"Migrating `this v3.5 `__ example." -msgstr "" -"Migrando ejemplo `de v3.5 `__." +msgid "Migrating `this v3.5 `__ example." +msgstr "Migrando ejemplo `de v3.5 `__." msgid "Before updating pgRouting enumerate the columns: |result-1-1|" msgstr "" @@ -6469,22 +4901,14 @@ msgstr "" msgid "Using ``pgr_bdDijkstra``" msgstr "Usando ``pgr_bdDijkstra``" -msgid "" -"Migrating `this v3.8 `__ example." -msgstr "" -"Migrando ejemplo `de v3.8 `__." +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrando ejemplo `de v3.8 `__." msgid "Using ``pgr_DAGshortestPath``" msgstr "Usando ``pgr_DAGshortestPath``" -msgid "" -"Migrating `this v3.8 `__ example." -msgstr "" -"Migrando ejemplo `de v3.8 `__." +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrando ejemplo `de v3.8 `__." msgid "This applies to all signatures of ``pgr_DAGshortestPath``" msgstr "" @@ -6495,12 +4919,8 @@ msgstr "" msgid "Using ``pgr_bdAstar``" msgstr "Usando ``pgr_bdAstar``" -msgid "" -"Migrating `this v3.5 `__ example." -msgstr "" -"Migrando ejemplo `de v3.5 `__." +msgid "Migrating `this v3.5 `__ example." +msgstr "Migrando ejemplo `de v3.5 `__." msgid "Before updating pgRouting enumerate the columns: |result-1-m|" msgstr "" @@ -6508,31 +4928,21 @@ msgstr "" msgid "Using ``pgr_withPoints``" msgstr "Usando ``pgr_withPoints``" -msgid "" -"Migrating `this v3.8 `__ example." -msgstr "" -"Migrando ejemplo `de v3.8 `__." +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrando ejemplo `de v3.8 `__." msgid "|pid-1-m|" msgstr "" #, fuzzy -msgid "" -"To get the old signature column names: filter out the column ``start_vid`` " -"and rename ``end_vid`` to ``end_pid``." +msgid "To get the old signature column names: filter out the column ``start_vid`` and rename ``end_vid`` to ``end_pid``." msgstr "las columnas ``start_vid`` y ``end_vid`` no existen." msgid "Examples for Many to One with one route result" msgstr "" -msgid "" -"Migrating `this v3.8 `__ example." -msgstr "" -"Migrando ejemplo `de v3.8 `__." +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrando ejemplo `de v3.8 `__." msgid "Before updating pgRouting enumerate the columns: |result-m-1|" msgstr "" @@ -6540,22 +4950,14 @@ msgstr "" msgid "Using ``pgr_dijkstra``" msgstr "Usando ``pgr_dijkstra``" -msgid "" -"Migrating `this v3.4 `__ example." -msgstr "" -"Migrando ejemplo `de v3.4 `__." +msgid "Migrating `this v3.4 `__ example." +msgstr "Migrando ejemplo `de v3.4 `__." msgid "Examples for Many to Many with one route result" msgstr "" -msgid "" -"Migrating `this v3.8 `__ example." -msgstr "" -"Migrando ejemplo `de v3.8 `__." +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrando ejemplo `de v3.8 `__." msgid "|pid-m-m|" msgstr "" @@ -6563,20 +4965,14 @@ msgstr "" msgid "Examples for combinations with one route result" msgstr "" -msgid "" -"Migrating `this v3.8 `this `__ example." -msgstr "" -"Migrando ejemplo `de v3.8 `this `__." +msgid "Migrating `this v3.8 `this `__ example." +msgstr "Migrando ejemplo `de v3.8 `this `__." #, fuzzy msgid "Migration of spanning tree functions" msgstr "Columnas de resultados para funciones de árbol de expansión" -msgid "" -"The standardized :ref:`pgRouting-concepts:Result columns for spanning tree " -"functions` are |result-spantree|" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for spanning tree functions` are |result-spantree|" msgstr "" msgid "``pgr_drivingDistance``" @@ -6644,12 +5040,8 @@ msgstr "" msgid "Single vertex example using ``pgr_kruskalDD``" msgstr "``pgr_kruskalDD``" -msgid "" -"Migrating `this v3.6 `__ example." -msgstr "" -"Migrando ejemplo `de v3.6 `__." +msgid "Migrating `this v3.6 `__ example." +msgstr "Migrando ejemplo `de v3.6 `__." msgid "Before updating pgRouting enumerate the columns: |result-bfs|." msgstr "" @@ -6658,12 +5050,8 @@ msgstr "" msgid "Multiple vertices example using ``pgr_kruskalDFS``" msgstr "``pgr_kruskalDFS``" -msgid "" -"Migrating `this v3.6 `__ example." -msgstr "" -"Migrando ejemplo `de v3.6 `__." +msgid "Migrating `this v3.6 `__ example." +msgstr "Migrando ejemplo `de v3.6 `__." msgid "Migration from |result-dij-dd|" msgstr "Migración de |result-dij-dd|" @@ -6698,12 +5086,8 @@ msgstr "renombrar ``start_vid`` a ``from_v``." msgid "Single vertex example using ``pgr_drivingDistance``" msgstr "``pgr_drivingDistance``" -msgid "" -"Migrating `this v3.5 `__ example." -msgstr "" -"Migrando ejemplo `de v3.5 `__." +msgid "Migrating `this v3.5 `__ example." +msgstr "Migrando ejemplo `de v3.5 `__." #, fuzzy msgid "Before updating pgRouting, enumerate |result-1-1-no-seq| columns" @@ -6713,16 +5097,10 @@ msgstr "Las columnas de resultados eran |result-1-1-no-seq|" msgid "Multiple vertices example using ``pgr_drivingDistance``" msgstr "``pgr_drivingDistance``" -msgid "" -"Migrating `this v3.5 `__ example." -msgstr "" -"Migrando ejemplo `de v3.5 `__." +msgid "Migrating `this v3.5 `__ example." +msgstr "Migrando ejemplo `de v3.5 `__." -msgid "" -"To get the old version column names |result-dij-dd-m|: filter out the column " -"``pred`` and ``depth`` and rename ``start_vid`` to ``from_v``." +msgid "To get the old version column names |result-dij-dd-m|: filter out the column ``pred`` and ``depth`` and rename ``start_vid`` to ``from_v``." msgstr "" msgid "Migration of |result-generic-no-seq|" @@ -6735,12 +5113,8 @@ msgstr "" msgid "Enumerate |result-1-1-no-seq| columns" msgstr "Las columnas de resultados eran |result-1-1-no-seq|" -msgid "" -"Use an unnamed valid value for **driving side** after the **distance** " -"parameter." -msgstr "" -"Usar un valor válido sin nombre para **lado de manejo** después del " -"parámetro **distancia**." +msgid "Use an unnamed valid value for **driving side** after the **distance** parameter." +msgstr "Usar un valor válido sin nombre para **lado de manejo** después del parámetro **distancia**." #, fuzzy msgid "Enumerate |result-m-1-no-seq| columns" @@ -6751,16 +5125,11 @@ msgid "Default value of **driving side** parameter" msgstr "Lado de manejo derecho" #, fuzzy -msgid "" -"**driving side** parameter is unnamed, and valid values differ for directed " -"and undirected graphs." -msgstr "" -"El parámetro **lado de manjeo** es obligatorio sin nombre, y los valores " -"válidos difieren para grafos dirigidos y no dirigidos." +msgid "**driving side** parameter is unnamed, and valid values differ for directed and undirected graphs." +msgstr "El parámetro **lado de manjeo** es obligatorio sin nombre, y los valores válidos difieren para grafos dirigidos y no dirigidos." msgid "In directed graph: valid values are [``r``, ``R``, ``l``, ``L``]" -msgstr "" -"En grafos dirigidos: Los valores válidos son [``r``, ``R``, ``l``, ``L``]" +msgstr "En grafos dirigidos: Los valores válidos son [``r``, ``R``, ``l``, ``L``]" msgid "Default value = 'r';" msgstr "Valor por defecto = 'r';" @@ -6775,23 +5144,15 @@ msgstr "Valor por defecto = 'b';" msgid "Single vertex example using ``pgr_withPointsDD``" msgstr "``pgr_withPointsDD``" -msgid "" -"Migrating `this v3.5 `__ example." -msgstr "" -"Migrando ejemplo `de v3.5 `__." +msgid "Migrating `this v3.5 `__ example." +msgstr "Migrando ejemplo `de v3.5 `__." #, fuzzy msgid "Multiple vertices example using ``pgr_withPointsDD``" msgstr "``pgr_withPointsDD``" -msgid "" -"Migrating `this v3.5 `__ example." -msgstr "" -"Migrando ejemplo `de v3.5 `__." +msgid "Migrating `this v3.5 `__ example." +msgstr "Migrando ejemplo `de v3.5 `__." #, fuzzy msgid "Migration of output column name change" @@ -6923,9 +5284,7 @@ msgstr "" msgid "If you have SFCGAL, which you can install using" msgstr "" -msgid "" -"Since PostGIS 3.5+ use `CG_AlphaShape `__" +msgid "Since PostGIS 3.5+ use `CG_AlphaShape `__" msgstr "" msgid "For PostGIS 3.5+ use the old name ``ST_AlphaShape``" @@ -6943,9 +5302,7 @@ msgstr "" msgid "Migration of ``pgr_nodeNetwork``" msgstr "Migración de ``pgr_nodeNetwork``" -msgid "" -"**Before Deprecation:** A table with `_nodded` was created. with " -"split edges." +msgid "**Before Deprecation:** A table with `_nodded` was created. with split edges." msgstr "" msgid "**Migration**" @@ -6960,87 +5317,38 @@ msgstr "Migración de ``pgr_createTopology``" msgid "A table with `_vertices_pgr` was created." msgstr "Se ha creado una tabla con `_vertices_pgr`." -msgid "" -"**After Deprecation:** The user is responsible to create the complete " -"topology." -msgstr "" -"**Después de la depreciación** El usuario es responsable de crear la " -"topología completa." +msgid "**After Deprecation:** The user is responsible to create the complete topology." +msgstr "**Después de la depreciación** El usuario es responsable de crear la topología completa." msgid "Build a routing topology" msgstr "Construir una topología de ruteo" -msgid "" -"The basic information to use the majority of the pgRouting functions ``id, " -"source, target, cost, [reverse_cost]`` is what in pgRouting is called the " -"routing topology." -msgstr "" -"La información básica para usar la mayoría de las funciones de pgRouting " -"``id, source, target, cost, [reverse_cost]`` es lo que en pgRouting se llama " -"topología de ruteo." +msgid "The basic information to use the majority of the pgRouting functions ``id, source, target, cost, [reverse_cost]`` is what in pgRouting is called the routing topology." +msgstr "La información básica para usar la mayoría de las funciones de pgRouting ``id, source, target, cost, [reverse_cost]`` es lo que en pgRouting se llama topología de ruteo." -msgid "" -"``reverse_cost`` is optional but strongly recommended to have in order to " -"reduce the size of the database due to the size of the geometry columns. " -"Having said that, in this documentation ``reverse_cost`` is used in this " -"documentation." -msgstr "" -"``reverse_cost`` es opcional pero se recomienda encarecidamente tenerlo para " -"reducir el tamaño de la base de datos debido al tamaño de las columnas de " -"geometría. Dicho esto, en esta documentación se utiliza ``reverse_cost``." +msgid "``reverse_cost`` is optional but strongly recommended to have in order to reduce the size of the database due to the size of the geometry columns. Having said that, in this documentation ``reverse_cost`` is used in this documentation." +msgstr "``reverse_cost`` es opcional pero se recomienda encarecidamente tenerlo para reducir el tamaño de la base de datos debido al tamaño de las columnas de geometría. Dicho esto, en esta documentación se utiliza ``reverse_cost``." -msgid "" -"When the data comes with geometries and there is no routing topology, then " -"this step is needed." -msgstr "" -"Cuando los datos vienen con geometrías y no hay topología de ruteo, entonces " -"este paso es necesario." +msgid "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 "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 "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 "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 "Finally using the data stored on the vertices tables the ``source`` and ``target`` are filled up." +msgstr "Finalmente, utilizando los datos almacenados en las tablas de vértices, se rellenan los campos ``source`` y ``target``." msgid "Migration of ``pgr_createVerticesTable``" msgstr "Migracion de ``pgr_createVerticesTable``" -msgid "" -"**After Deprecation:** The user is responsible to create the vertices table, " -"indexes, etc. They may use :doc:`pgr_extractVertices` for that purpose." -msgstr "" -"**Después de la depreciación:** El usuario es responsable de crear la tabla " -"de vértices, índices, etc. Para ello puede utilizar :doc:" -"`pgr_extractVertices`." +msgid "**After Deprecation:** The user is responsible to create the vertices table, indexes, etc. They may use :doc:`pgr_extractVertices` for that purpose." +msgstr "**Después de la depreciación:** El usuario es responsable de crear la tabla de vértices, índices, etc. Para ello puede utilizar :doc:`pgr_extractVertices`." msgid "Migration of ``pgr_analyzeOneWay``" msgstr "Migración de ``pgr_analyzeOneWay``" @@ -7057,20 +5365,11 @@ msgstr "Los problemas de dirección se calcularon a partir de códigos." msgid "Dead ends." msgstr "Callejones sin salida." -msgid "" -"A routing problem can arise when from a vertex there is only a way on or a " -"way out but not both:" -msgstr "" -"Un problema de ruteo puede surgir cuando desde un vértice sólo hay una " -"salida o una entrada, pero no ambas:" +msgid "A routing problem can arise when from a vertex there is only a way on or a way out but not both:" +msgstr "Un problema de ruteo puede surgir cuando desde un vértice sólo hay una salida o una entrada, pero no ambas:" -msgid "" -"Either saving or using directly :doc:`pgr_extractVertices` get the dead ends " -"information and determine if the adjacent edge is one way or not." -msgstr "" -"Guardando o usando directamente :doc:`pgr_extractVertices` se obtiene la " -"información de los callejones sin salida y se determina si la arista " -"adyacente es unidireccional o no." +msgid "Either saving or using directly :doc:`pgr_extractVertices` get the dead ends information and determine if the adjacent edge is one way or not." +msgstr "Guardando o usando directamente :doc:`pgr_extractVertices` se obtiene la información de los callejones sin salida y se determina si la arista adyacente es unidireccional o no." msgid "In this example :doc:`pgr_extractVertices` has already been applied." msgstr "En este ejemplo :doc:`pgr_extractVertices` ya se ha aplicado." @@ -7078,14 +5377,8 @@ msgstr "En este ejemplo :doc:`pgr_extractVertices` ya se ha aplicado." msgid "Bridges." msgstr "Puentes." -msgid "" -"Another routing problem can arise when there is an edge of an undirected " -"graph whose deletion increases its number of connected components, and the " -"bridge is only one way." -msgstr "" -"Otro problema para ruteo puede surgir cuando en un grafo no dirigido hay una " -"arista cuya eliminación aumenta el numero de componentes conectados, y el " -"puente es solo de un sentido." +msgid "Another routing problem can arise when there is an edge of an undirected graph whose deletion increases its number of connected components, and the bridge is only one way." +msgstr "Otro problema para ruteo puede surgir cuando en un grafo no dirigido hay una arista cuya eliminación aumenta el numero de componentes conectados, y el puente es solo de un sentido." msgid "To determine if the bridges are or not one way." msgstr "Para determinar si los puentes son o no unidireccionales." @@ -7100,8 +5393,7 @@ msgid "Number of dead ends." msgstr "Cantidad de callejones sin salida." msgid "Number of potential gaps found near dead ends." -msgstr "" -"Número de huecos potenciales encontrados cerca de callejones sin salida." +msgstr "Número de huecos potenciales encontrados cerca de callejones sin salida." msgid "Number of intersections. (between 2 edges)" msgstr "Número de intersecciones. (entre 2 aristas)" @@ -7142,12 +5434,8 @@ msgstr "Migración." msgid "Components." msgstr "Componentes." -msgid "" -"Instead of counting only isolated segments, determine all the components of " -"the graph." -msgstr "" -"En lugar de contar sólo segmentos aislados, determinar todos los componentes " -"del grafo." +msgid "Instead of counting only isolated segments, determine all the components of the graph." +msgstr "En lugar de contar sólo segmentos aislados, determinar todos los componentes del grafo." msgid "Depending of the final application requirements use:" msgstr "Dependiendo de los requisitos de la aplicación final utilizar:" @@ -7164,39 +5452,23 @@ msgstr ":doc:`pgr_biconnectedComponents`" msgid "For example:" msgstr "Por ejemplo:" -msgid "" -"Instead of counting the dead ends, determine all the dead ends of the graph " -"using :doc:`pgr_degree`." -msgstr "" -"En lugar de contar los callejones sin salida, determine todos los callejones " -"sin salida del grafo utilizando :doc:`pgr_degree`." +msgid "Instead of counting the dead ends, determine all the dead ends of the graph using :doc:`pgr_degree`." +msgstr "En lugar de contar los callejones sin salida, determine todos los callejones sin salida del grafo utilizando :doc:`pgr_degree`." msgid "Potential gaps near dead ends." msgstr "Huecos potenciales cerca de callejones sin salida." -msgid "" -"Instead of counting potential gaps between geometries, determine the " -"geometric gaps in the graph using :doc:`pgr_findCloseEdges`." +msgid "Instead of counting potential gaps between geometries, determine the geometric gaps in the graph using :doc:`pgr_findCloseEdges`." msgstr "" msgid "Topological relationships." msgstr "Relaciones topológicas." -msgid "" -"Instead of counting intersections, determine topological relationships " -"between geometries." +msgid "Instead of counting intersections, determine topological relationships between geometries." msgstr "" -msgid "" -"Several PostGIS functions can be used: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." -msgstr "" -"Se pueden utilizar varias funciones de PostGIS: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." +msgid "Several PostGIS functions can be used: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." +msgstr "Se pueden utilizar varias funciones de PostGIS: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." msgid "Migration of ``pgr_trsp`` (Vertices)" msgstr "Migración de `pgr_trsp`` (Vértices)" @@ -7297,13 +5569,8 @@ msgstr "" msgid "Migration of ``pgr_withPointsKSP``" msgstr "Migración de ``pgr_withPointsKSP``" -msgid "" -"Starting from `v3.6.0 `__ :" -"doc:`pgr_withPointsKSP` result columns are being standardized." -msgstr "" -"A partir de `v3.6.0 `__ " -"en :doc:`pgr_withPointsKSP` las columnas de resultados están siendo " -"estandarizadas." +msgid "Starting from `v3.6.0 `__ :doc:`pgr_withPointsKSP` result columns are being standardized." +msgstr "A partir de `v3.6.0 `__ en :doc:`pgr_withPointsKSP` las columnas de resultados están siendo estandarizadas." msgid "|ksp-result|" msgstr "|ksp-result|" @@ -7312,13 +5579,8 @@ msgid "|generic-result|" msgstr "|generic-result|" #, fuzzy -msgid "" -"And ``driving side`` parameter changed from named optional to unnamed " -"**driving side** and its validity differ for directed and undirected graphs." -msgstr "" -"Y el parámetro \"driving side\" ha cambiado de opcional con nombre a " -"obligatorio sin nombre **driving side** y su validez difiere para grafos " -"dirigidos y no dirigidos." +msgid "And ``driving side`` parameter changed from named optional to unnamed **driving side** and its validity differ for directed and undirected graphs." +msgstr "Y el parámetro \"driving side\" ha cambiado de opcional con nombre a obligatorio sin nombre **driving side** y su validez difiere para grafos dirigidos y no dirigidos." msgid "``pgr_withPointsKSP`` (`One to One`)" msgstr "``pgr_withPointsKSP`` (`Uno a Uno`)" @@ -7336,19 +5598,14 @@ msgid "Migration" msgstr "Migración" msgid "Be aware of the existence of the additional result Columns." -msgstr "" -"Tener en cuenta la existencia de las columnas adicionales de resultados." +msgstr "Tener en cuenta la existencia de las columnas adicionales de resultados." #, fuzzy msgid "New output columns are |generic-result|" msgstr "Las nuevas columnas de salida son |nksp-result|" -msgid "" -"Using `this `__ example." -msgstr "" -"Usando `este `__ ejemplo." +msgid "Using `this `__ example." +msgstr "Usando `este `__ ejemplo." msgid "``start_vid`` contains the **start vid** parameter value." msgstr "``start_vid`` contiene el valor del parámetro **start vid**." @@ -7356,12 +5613,8 @@ msgstr "``start_vid`` contiene el valor del parámetro **start vid**." msgid "``end_vid`` contains the **end vid** parameter value." msgstr "``end_vid`` contiene el valor del parámetro **end vid**." -msgid "" -"If needed filter out the additional columns, for example, to return the " -"original columns:" -msgstr "" -"Si es necesario, filtrar las columnas adicionales, por ejemplo, para " -"devolver las columnas originales:" +msgid "If needed filter out the additional columns, for example, to return the original columns:" +msgstr "Si es necesario, filtrar las columnas adicionales, por ejemplo, para devolver las columnas originales:" msgid "Use ``pgr_withPoints`` when there are no restrictions." msgstr "Usar ``pgr_withPoints`` cuando no hay restricciones." @@ -7378,17 +5631,11 @@ msgstr "Utilizar en su lugar :doc:`pgr_trsp_withPoints`." msgid "Migration of ``pgr_maxCardinalityMatch``" msgstr "Migración de ``pgr_maxCardinalityMatch``" -msgid "" -":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, therefore " -"the ``directed`` flag has been removed." -msgstr "" -":doc:`pgr_maxCardinalityMatch` funciona solamente para grafos no dirigidos, " -"entonces la bandera ``directed`` ha sido removida." +msgid ":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, therefore the ``directed`` flag has been removed." +msgstr ":doc:`pgr_maxCardinalityMatch` funciona solamente para grafos no dirigidos, entonces la bandera ``directed`` ha sido removida." -msgid "" -"Starting from `v3.4.0 `__" -msgstr "" -"A partir de v3.4.0 `__" +msgid "Starting from `v3.4.0 `__" +msgstr "A partir de v3.4.0 `__" msgid "Signature to be migrated:" msgstr "Firma que serán migrada:" @@ -7409,8 +5656,7 @@ msgid "New signature" msgstr "Nueva firma" msgid "``pgr_maxCardinalityMatch(text)`` returns only ``edge`` column." -msgstr "" -"``pgr_maxCardinalityMatch(text)`` regresa solamente la columna ``edge``." +msgstr "``pgr_maxCardinalityMatch(text)`` regresa solamente la columna ``edge``." msgid "The optional flag ``directed`` is removed." msgstr "La bandera opcional ``directed`` es removida." @@ -7418,36 +5664,20 @@ msgstr "La bandera opcional ``directed`` es removida." msgid "Before migration" msgstr "Antes de migración" -msgid "" -"Columns used are ``going`` and ``coming`` to represent the existence of an " -"edge." -msgstr "" -"Las columnas usadas son ``going`` y ``coming`` para representar la " -"existencia de la arista." +msgid "Columns used are ``going`` and ``coming`` to represent the existence of an edge." +msgstr "Las columnas usadas son ``going`` y ``coming`` para representar la existencia de la arista." -msgid "" -"Flag ``directed`` was used to indicate if it was for a **directed** or " -"**undirected** graph." -msgstr "" -"La flag ``directed`` es usada para indicar si fue para un grafo **dirigido** " -"or **no dirigido**." +msgid "Flag ``directed`` was used to indicate if it was for a **directed** or **undirected** graph." +msgstr "La flag ``directed`` es usada para indicar si fue para un grafo **dirigido** or **no dirigido**." msgid "The flag ``directed`` is ignored." msgstr "La bandera ``directed`` es ignorada." -msgid "" -"Regardless of it's value it gives the result considering the graph as " -"**undirected**." -msgstr "" -"Independiente de su valor, da el resultado considerando el grafo como **no " -"dirigido**." +msgid "Regardless of it's value it gives the result considering the graph as **undirected**." +msgstr "Independiente de su valor, da el resultado considerando el grafo como **no dirigido**." -msgid "" -"Use the columns ``cost`` and ``reverse_cost`` to represent the existence of " -"an edge." -msgstr "" -"Usa las columnas ``cost`` y ``reverse_cost`` para representar la existenica " -"de una arista." +msgid "Use the columns ``cost`` and ``reverse_cost`` to represent the existence of an edge." +msgstr "Usa las columnas ``cost`` y ``reverse_cost`` para representar la existenica de una arista." msgid "Do not use the flag ``directed``." msgstr "No use la bandera ``directed``." @@ -7506,12 +5736,8 @@ msgstr "Las viejas restricciones se llenan" msgid "Old restrictions contents" msgstr "Contenido de viejas restricciones" -msgid "" -"The restriction with ``rid = 2`` is representing :math:`3 \\rightarrow 5 " -"\\rightarrow9`" -msgstr "" -"La restricción con ``rid = 2`` representa :math:`3 \\rightarrow 5 " -"\\rightarrow9`" +msgid "The restriction with ``rid = 2`` is representing :math:`3 \\rightarrow 5 \\rightarrow9`" +msgstr "La restricción con ``rid = 2`` representa :math:`3 \\rightarrow 5 \\rightarrow9`" msgid ":math:`3\\rightarrow5`" msgstr ":math:`3\\rightarrow5`" @@ -7564,21 +5790,14 @@ msgstr "Agregando las restricciones" msgid "Restrictions data" msgstr "Datos de restricciones" -msgid "" -"The restriction with ``rid = 2`` represents the path :math:`3 \\rightarrow5 " -"\\rightarrow9`." -msgstr "" -"La restricción con``rid = 2`` representa el camino :math:`3 \\rightarrow5 " -"\\rightarrow9`." - +msgid "The restriction with ``rid = 2`` represents the path :math:`3 \\rightarrow5 \\rightarrow9`." +msgstr "La restricción con``rid = 2`` representa el camino :math:`3 \\rightarrow5 \\rightarrow9`." + msgid "By inspection the path is clear." msgstr "El camino es claro por inspección." -msgid "" -"To transform the old restrictions table to the new restrictions structure," -msgstr "" -"Para transformar la antigua tabla de restricciones a la nueva estructura de " -"restricciones," +msgid "To transform the old restrictions table to the new restrictions structure," +msgstr "Para transformar la antigua tabla de restricciones a la nueva estructura de restricciones," msgid "Create a new table with the new restrictions structure." msgstr "Crea una nueva tabla con la nueva estructura de restricciones." @@ -7586,12 +5805,8 @@ msgstr "Crea una nueva tabla con la nueva estructura de restricciones." msgid "In this migration guide ``new_restrictions`` is been used." msgstr "En esta guía de migración ``new_restrictions`` está siendo usada." -msgid "" -"For this migration pgRouting supplies an auxiliary function for reversal of " -"an array ``_pgr_array_reverse`` needed for the migration." -msgstr "" -"Para esta migración pgRouting proporciona una función auxiliar para la " -"inversión de un conjunto ``_pgr_array_reverse`` necesaria para la migración." +msgid "For this migration pgRouting supplies an auxiliary function for reversal of an array ``_pgr_array_reverse`` needed for the migration." +msgstr "Para esta migración pgRouting proporciona una función auxiliar para la inversión de un conjunto ``_pgr_array_reverse`` necesaria para la migración." msgid "``_pgr_array_reverse``:" msgstr "``_pgr_array_reverse``:" @@ -7617,12 +5832,8 @@ msgstr "Ordenamiento - Familia de funciones" msgid "pgRouting Concepts" msgstr "Conceptos de pgRouting" -msgid "" -"This is a simple guide that go through some of the steps for getting started " -"with pgRouting. This guide covers:" -msgstr "" -"Esta es una guía simple que va a través de los pasos básicos para empezar " -"trabajar con pgRouting. Esta guía cubre:" +msgid "This is a simple guide that go through some of the steps for getting started with pgRouting. This guide covers:" +msgstr "Esta es una guía simple que va a través de los pasos básicos para empezar trabajar con pgRouting. Esta guía cubre:" msgid "Graphs" msgstr "Grafos" @@ -7654,10 +5865,8 @@ msgstr ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V) \\}`" msgid "Directed simple graph" msgstr "Grafo dirigido simple" -msgid "" -":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" -msgstr "" -":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" +msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" +msgstr ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" msgid "Graphs:" msgstr "Grafos:" @@ -7665,17 +5874,11 @@ msgstr "Grafos:" msgid "Do not have geometries." msgstr "No tienen geometrías." -msgid "" -"Some graph theory problems require graphs to have weights, called **cost** " -"in pgRouting." -msgstr "" -"Algunos problemas de teoría de grafos requieren tener pesos, llamados " -"**cost** en pgRouting." +msgid "Some graph theory problems require graphs to have weights, called **cost** in pgRouting." +msgstr "Algunos problemas de teoría de grafos requieren tener pesos, llamados **cost** en pgRouting." -msgid "" -"In pgRouting there are several ways to represent a graph on the database:" -msgstr "" -"En pgRouting hay varias maneras de representar in grafo en la base de datos:" +msgid "In pgRouting there are several ways to represent a graph on the database:" +msgstr "En pgRouting hay varias maneras de representar in grafo en la base de datos:" msgid "With ``cost``" msgstr "Con ``cost``" @@ -7689,12 +5892,8 @@ msgstr "Con ``cost`` y ``reverse_cost``" msgid "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)" msgstr "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)" -msgid "" -"Identifier of the edge. Requirement to use the database in a consistent. " -"manner." -msgstr "" -"Identificador de la asirsta. Requerimiento para mantener consistente la base " -"de datos." +msgid "Identifier of the edge. Requirement to use the database in a consistent. manner." +msgstr "Identificador de la asirsta. Requerimiento para mantener consistente la base de datos." msgid "Identifier of a vertex." msgstr "Identificador de un vértice." @@ -7702,25 +5901,17 @@ msgstr "Identificador de un vértice." msgid "Weight of the edge (``source``, ``target``):" msgstr "Peso de la arista (``source``, ``target``):" -msgid "" -"When negative the edge (``source``, ``target``) do not exist on the graph." -msgstr "" -"Cuando negativo: la arista (``source``, ``target``) no existe en el grafo." +msgid "When negative the edge (``source``, ``target``) do not exist on the graph." +msgstr "Cuando negativo: la arista (``source``, ``target``) no existe en el grafo." msgid "``cost`` must exist in the query." msgstr "``cost`` debe existir en la consulta." -msgid "" -"When negative the edge (``target``, ``source``) do not exist on the graph." -msgstr "" -"Cuando negativo: la arista (``target``, ``source``) no existe en el grafo." +msgid "When negative the edge (``target``, ``source``) do not exist on the graph." +msgstr "Cuando negativo: la arista (``target``, ``source``) no existe en el grafo." -msgid "" -"The decision of the graph to be **directed** or **undirected** is done when " -"executing a pgRouting algorithm." -msgstr "" -"La decisión del grafo de ser **directed** o **undirected** es resultado al " -"ejecutar el algoritmo de pgRouting." +msgid "The decision of the graph to be **directed** or **undirected** is done when executing a pgRouting algorithm." +msgstr "La decisión del grafo de ser **directed** o **undirected** es resultado al ejecutar el algoritmo de pgRouting." msgid "Graph with ``cost``" msgstr "Grafo con ``cost``" @@ -7734,12 +5925,8 @@ msgstr "Datos de l grafo se obtienen mediante una consulta" msgid "``SELECT id, source, target, cost FROM edges``" msgstr "``SELECT id, source, target, cost FROM edges``" -msgid "" -":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} " -"\\ge 0 \\}`" -msgstr "" -":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ cuando } " -"cost_{id} \\ge 0 \\}`" +msgid ":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} \\ge 0 \\}`" +msgstr ":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ cuando } cost_{id} \\ge 0 \\}`" msgid "Edges where ``cost`` is non negative are part of the graph." msgstr "Aristas donde ``cost`` es no negativo son parte del grafo." @@ -7750,12 +5937,8 @@ msgstr ":math:`V = \\{source_{id} \\cup target_{id}\\}`" msgid "All vertices in ``source`` and ``target`` are part of the graph." msgstr "Todos los vértices``source`` y ``target`` son parte del grafo." -msgid "" -"In a directed graph the edge :math:`(source_{id}, target_{id}, cost_{id})` " -"has directionality: :math:`source_{id} \\rightarrow target_{id}`" -msgstr "" -"En un grafo dirigido la arista :math:`(source_{id}, target_{id}, cost_{id})` " -"tiene direccionalidad: :math:`source_{id} \\rightarrow target_{id}`" +msgid "In a directed graph the edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`" +msgstr "En un grafo dirigido la arista :math:`(source_{id}, target_{id}, cost_{id})` tiene direccionalidad: :math:`source_{id} \\rightarrow target_{id}`" msgid "For the following data:" msgstr "Para los siguientes datos:" @@ -7766,28 +5949,14 @@ msgstr "La arista :math:`2` (:math:`1 \\rightarrow 3`) no es parte del grafo." msgid "The data is representing the following graph:" msgstr "Los datos se representan en el siguiente grafo:" -msgid "" -"In an undirected graph the edge :math:`(source_{id}, target_{id}, " -"cost_{id})` does not have directionality: :math:`source_{id} \\frac{\\;\\;\\;" -"\\;\\;}{} target_{id}`" -msgstr "" -"En un grafo no dirigido la arista :math:`(source_{id}, target_{id}, " -"cost_{id})` no tiene direccionalidad: :math:`source_{id} \\frac{\\;\\;\\;\\;" -"\\;}{} target_{id}`" +msgid "In an undirected graph the edge :math:`(source_{id}, target_{id}, cost_{id})` does not have directionality: :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" +msgstr "En un grafo no dirigido la arista :math:`(source_{id}, target_{id}, cost_{id})` no tiene direccionalidad: :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" -msgid "" -"In terms of a directed graph is like having two edges: :math:`source_{id} " -"\\leftrightarrow target_{id}`" -msgstr "" -"En términos de un grafo dirigido es como tener dos aristas: :math:" -"`source_{id} \\leftrightarrow target_{id}`" +msgid "In terms of a directed graph is like having two edges: :math:`source_{id} \\leftrightarrow target_{id}`" +msgstr "En términos de un grafo dirigido es como tener dos aristas: :math:`source_{id} \\leftrightarrow target_{id}`" -msgid "" -"Edge :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) is not part of the " -"graph." -msgstr "" -"Arista :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) no es parte del " -"grafo." +msgid "Edge :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) is not part of the graph." +msgstr "Arista :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) no es parte del grafo." msgid "Graph with ``cost`` and ``reverse_cost``" msgstr "Grafo con ``cost`` y ``reverse_cost``" @@ -7798,30 +5967,14 @@ msgstr "``SELECT id, source, target, cost, reverse_cost FROM edges``" msgid "The set of edges :math:`E`:" msgstr "El conjunto de aristas :math:`E`:" -msgid "" -":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, " -"cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & " -"{\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } " -"reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" -msgstr "" -":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, " -"cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & " -"{\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } " -"reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" +msgid ":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & {\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" +msgstr ":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & {\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" -msgid "" -"Edges :math:`(source \\rightarrow target)` where ``cost`` is non negative " -"are part of the graph." -msgstr "" -"Aristas :math:`(source \\rightarrow target)` done ``cost`` es no negativo " -"son parte del grafo." +msgid "Edges :math:`(source \\rightarrow target)` where ``cost`` is non negative are part of the graph." +msgstr "Aristas :math:`(source \\rightarrow target)` done ``cost`` es no negativo son parte del grafo." -msgid "" -"Edges :math:`(target \\rightarrow source)` where ``reverse_cost`` is non " -"negative are part of the graph." -msgstr "" -"Aristas :math:`(target \\rightarrow source)` donde ``reverse_cost`` es no " -"negativo son parte del grafo." +msgid "Edges :math:`(target \\rightarrow source)` where ``reverse_cost`` is non negative are part of the graph." +msgstr "Aristas :math:`(target \\rightarrow source)` donde ``reverse_cost`` es no negativo son parte del grafo." msgid "The set of vertices :math:`V`:" msgstr "El conjunto de vértices :math:`V`:" @@ -7829,19 +5982,11 @@ msgstr "El conjunto de vértices :math:`V`:" msgid "In a directed graph both edges have directionality" msgstr "En un grafo dirigido ambas aristas tiene direccionalidad" -msgid "" -"edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:" -"`source_{id} \\rightarrow target_{id}`" -msgstr "" -"arista :math:`(source_{id}, target_{id}, cost_{id})` tiene direccionalidad: :" -"math:`source_{id} \\rightarrow target_{id}`" +msgid "edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`" +msgstr "arista :math:`(source_{id}, target_{id}, cost_{id})` tiene direccionalidad: :math:`source_{id} \\rightarrow target_{id}`" -msgid "" -"edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` has " -"directionality: :math:`target_{id} \\rightarrow source_{id}`" -msgstr "" -"arista :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` tiene " -"direccionalidad: :math:`target_{id} \\rightarrow source_{id}`" +msgid "edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` has directionality: :math:`target_{id} \\rightarrow source_{id}`" +msgstr "arista :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` tiene direccionalidad: :math:`target_{id} \\rightarrow source_{id}`" msgid "Edges not part of the graph:" msgstr "Aristas no son parte del grafo:" @@ -7855,19 +6000,11 @@ msgstr ":math:`3` (:math:`3 \\rightarrow 2`)" msgid "In a directed graph both edges do not have directionality" msgstr "En un grafo dirigido ambas aristas no tiene direccionalidad" -msgid "" -"Edge :math:`(source_{id}, target_{id}, cost_{id})` is :math:`source_{id} " -"\\frac{\\;\\;\\;\\;\\;}{} target_{id}`" -msgstr "" -"Arista :math:`(source_{id}, target_{id}, cost_{id})` es :math:`source_{id} " -"\\frac{\\;\\;\\;\\;\\;}{} target_{id}`" +msgid "Edge :math:`(source_{id}, target_{id}, cost_{id})` is :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" +msgstr "Arista :math:`(source_{id}, target_{id}, cost_{id})` es :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" -msgid "" -"Edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` is :math:" -"`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" -msgstr "" -"Arista :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` es :math:" -"`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" +msgid "Edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` is :math:`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" +msgstr "Arista :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` es :math:`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" msgid "In terms of a directed graph is like having four edges:" msgstr "En términos de un grafo dirigido es como tener cuatro aristas:" @@ -7887,24 +6024,14 @@ msgstr ":math:`3` (:math:`3 \\frac{\\;\\;\\;\\;\\;}{} 2`)" msgid "Graphs without geometries" msgstr "Grafos sin geometrías" -msgid "" -"Personal relationships, genealogy, file dependency problems can be solved " -"using pgRouting. Those problems, normally, do not come with geometries " -"associated with the graph." -msgstr "" -"Relaciones personales, genealogía, problemas de dependencia de archivos " -"puede ser resueltos usando pgRouting. Esos problemas, normalmente, no vienen " -"con las geometrías asociadas con el grafo." +msgid "Personal relationships, genealogy, file dependency problems can be solved using pgRouting. Those problems, normally, do not come with geometries associated with the graph." +msgstr "Relaciones personales, genealogía, problemas de dependencia de archivos puede ser resueltos usando pgRouting. Esos problemas, normalmente, no vienen con las geometrías asociadas con el grafo." msgid "Wiki example" msgstr "Ejemplo de Wiki" -msgid "" -"Solve the example problem taken from `wikipedia `__):" -msgstr "" -"Resuelva el problema de ejemplo tomado de `wikipedia `__):" +msgid "Solve the example problem taken from `wikipedia `__):" +msgstr "Resuelva el problema de ejemplo tomado de `wikipedia `__):" msgid "Problem is to find the shortest path from :math:`1` to :math:`5`." msgstr "Problema es encontrar el camino mas corto desde :math:`1` a :math:`5`." @@ -7912,8 +6039,7 @@ msgstr "Problema es encontrar el camino mas corto desde :math:`1` a :math:`5`." msgid "Is an undirected graph." msgstr "Es un grafo dirigido." -msgid "" -"Although visually looks like to have geometries, the drawing is not to scale." +msgid "Although visually looks like to have geometries, the drawing is not to scale." msgstr "Aunque visualmente se vea con geometrías, el dibujo no es a escala." msgid "No geometries associated to the vertices or edges" @@ -7925,14 +6051,8 @@ msgstr "Tiene 6 vértices :math:`\\{1,2,3,4,5,6\\}`" msgid "Has 9 edges:" msgstr "Tiene 9 aristas:" -msgid "" -":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\" -"\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & " -"(5,6,9) \\} \\end{align} \\end{split}`" -msgstr "" -":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\" -"\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & " -"(5,6,9) \\} \\end{align} \\end{split}`" +msgid ":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & (5,6,9) \\} \\end{align} \\end{split}`" +msgstr ":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & (5,6,9) \\} \\end{align} \\end{split}`" msgid "The graph can be represented in many ways for example:" msgstr "El grafo puede ser representados de varias maneras por ejemplo:" @@ -7940,22 +6060,14 @@ msgstr "El grafo puede ser representados de varias maneras por ejemplo:" msgid "Prepare the database" msgstr "Prepara la base de datos" -msgid "" -"Create a database for the example, access the database and install " -"pgRouting: ::" -msgstr "" -"Crea una base de datos para el ejemplo, acceda a la base de datos e instala " -"pgRouting: ::" +msgid "Create a database for the example, access the database and install pgRouting: ::" +msgstr "Crea una base de datos para el ejemplo, acceda a la base de datos e instala pgRouting: ::" msgid "Create a table" msgstr "Crear una tabla" -msgid "" -"The basic elements needed to perform basic routing on an undirected graph " -"are:" -msgstr "" -"Los elementos básicos necesarios para realizar routing básico en un grafo no " -"dirigido son:" +msgid "The basic elements needed to perform basic routing on an undirected graph are:" +msgstr "Los elementos básicos necesarios para realizar routing básico en un grafo no dirigido son:" msgid "SMALLINT, INTEGER, BIGINT, REAL, FLOAT" msgstr "SMALLINT, INTEGER, BIGINT, REAL, FLOAT" @@ -7972,19 +6084,14 @@ msgstr "En cuentre el camino más corto" msgid "To solve this example :doc:`pgr_dijkstra` is used:" msgstr "Para resolver el ejemplo se usa :doc:`pgr_dijkstra`:" -msgid "" -"To go from :math:`1` to :math:`5` the path goes thru the following " -"vertices: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" -msgstr "" -"Para ir de :math:`1` a :math:`5` el camino que atraviesa los siguientes " -"vértices: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" +msgid "To go from :math:`1` to :math:`5` the path goes thru the following vertices: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" +msgstr "Para ir de :math:`1` a :math:`5` el camino que atraviesa los siguientes vértices: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" msgid "Vertex information" msgstr "Información de vertices" msgid "To obtain the vertices information, use :doc:`pgr_extractVertices`" -msgstr "" -"Para obtener la información de los vértices, use :doc:`pgr_extractVertices`" +msgstr "Para obtener la información de los vértices, use :doc:`pgr_extractVertices`" msgid "Graphs with geometries" msgstr "Grafos con geometrías" @@ -7992,21 +6099,14 @@ msgstr "Grafos con geometrías" msgid "Create a routing Database" msgstr "Crear una Base de Datos de Ruteo" -msgid "" -"The first step is to create a database and load pgRouting in the database." -msgstr "" -"El primer paso para crear una base de datos y cargar pgRouting en la base de " -"datos." +msgid "The first step is to create a database and load pgRouting in the database." +msgstr "El primer paso para crear una base de datos y cargar pgRouting en la base de datos." msgid "Typically create a database for each project." msgstr "Típicamente se crea una base de datos para cada proyecto." -msgid "" -"Once having the database to work in, load your data and build the routing " -"application in that database." -msgstr "" -"Una vez que se tenga una base de datos, cargue sus datos y construya la " -"aplicación de routeo en esa base de datos." +msgid "Once having the database to work in, load your data and build the routing application in that database." +msgstr "Una vez que se tenga una base de datos, cargue sus datos y construya la aplicación de routeo en esa base de datos." msgid "Load Data" msgstr "Cargar Datos" @@ -8021,16 +6121,10 @@ msgid "`Graphs without geometries`_" msgstr "`Grafos sin geometrías`_" msgid ":doc:`sampledata`: a small graph used in the documentation examples" -msgstr "" -":doc:`sampledata`: un pequeño grafo utilizado en los ejemplos de la " -"documentación" +msgstr ":doc:`sampledata`: un pequeño grafo utilizado en los ejemplos de la documentación" -msgid "" -"Using `osm2pgrouting `__" -msgstr "" -"Usando `osm2pgrouting `__" +msgid "Using `osm2pgrouting `__" +msgstr "Usando `osm2pgrouting `__" msgid "There are various open source tools that can help, like:" msgstr "Existen varias herramientas de codigo abierto que pueden ayudar, como:" @@ -8053,24 +6147,14 @@ msgstr "osm2pgsql" msgid "load OSM data into postgresql" msgstr "cargar datos de OSM a postgresql" -msgid "" -"Please note that these tools will **not** import the data in a structure " -"compatible with pgRouting and when this happens the topology needs to be " -"adjusted." -msgstr "" -"Tener en cuenta que estas herramientas **no** importan los datos a una " -"estructura compatible con pgRouting y cuando esto sucede, la topología " -"necesita ser ajustada." +msgid "Please note that these tools will **not** import the data in a structure compatible with pgRouting and when this happens the topology needs to be adjusted." +msgstr "Tener en cuenta que estas herramientas **no** importan los datos a una estructura compatible con pgRouting y cuando esto sucede, la topología necesita ser ajustada." msgid "Breakup a segments on each segment-segment intersection" msgstr "Rompe en segmentos cada intersección segmento-segmento" -msgid "" -"When missing, add columns and assign values to ``source``, ``target``, " -"``cost``, ``reverse_cost``." -msgstr "" -"Cuando falte, agregue columnas y asigne valores a ``source``, ``target``, " -"``cost``, ``reverse_cost``." +msgid "When missing, add columns and assign values to ``source``, ``target``, ``cost``, ``reverse_cost``." +msgstr "Cuando falte, agregue columnas y asigne valores a ``source``, ``target``, ``cost``, ``reverse_cost``." msgid "Connect a disconnected graph." msgstr "Conecte un grafo desconectado." @@ -8093,32 +6177,14 @@ msgstr "En pocas palabras:" msgid "Prepare the graph" msgstr "Prepara el grafo" -msgid "" -"What and how to prepare the graph, will depend on the application and/or on " -"the quality of the data and/or on how close the information is to have a " -"topology usable by pgRouting and/or some other factors not mentioned." -msgstr "" -"Qué y cómo preparar el grafo, dependerá de la aplicación y/o de la calidad " -"de los datos y/o de lo cerca que esté la información de tener una topología " -"utilizable por pgRouting y/o algunos otros factores no mencionados." +msgid "What and how to prepare the graph, will depend on the application and/or on the quality of the data and/or on how close the information is to have a topology usable by pgRouting and/or some other factors not mentioned." +msgstr "Qué y cómo preparar el grafo, dependerá de la aplicación y/o de la calidad de los datos y/o de lo cerca que esté la información de tener una topología utilizable por pgRouting y/o algunos otros factores no mencionados." -msgid "" -"The steps to prepare the graph involve geometry operations using `PostGIS " -"`__ and some others involve graph operations like :doc:" -"`pgr_contraction` to contract a graph." -msgstr "" -"Los pasos para preparar el grafo implican operaciones de geometría " -"utilizando `PostGIS `__ y algunos otros implican " -"operaciones de grafos como :doc:`pgr_contraction` para contraer un grafo." +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." +msgstr "Los pasos para preparar el grafo implican operaciones de geometría utilizando `PostGIS `__ y algunos otros implican operaciones de grafos como :doc:`pgr_contraction` para contraer un grafo." -msgid "" -"The `workshop `__ has a step by step " -"on how to prepare a graph using Open Street Map data, for a small " -"application." -msgstr "" -"El `taller `__ tiene un paso a paso " -"sobre cómo preparar un grafo utilizando datos de Open Street Map, para una " -"pequeña aplicación." +msgid "The `workshop `__ has a step by step on how to prepare a graph using Open Street Map data, for a small application." +msgstr "El `taller `__ tiene un paso a paso sobre cómo preparar un grafo utilizando datos de Open Street Map, para una pequeña aplicación." msgid "The use of indexes on the database design in general:" msgstr "El uso de índices en el diseño de bases de datos en general:" @@ -8129,43 +6195,23 @@ msgstr "Tener las geometrías indexadas." msgid "Have the identifiers columns indexed." msgstr "Tener indexadas las columnas de identificadores." -msgid "" -"Please consult the `PostgreSQL `__ " -"documentation and the `PostGIS `__ documentation." -msgstr "" -"Consultar la documentación de `PostgreSQL `__ y la documentación de `PostGIS `__." +msgid "Please consult the `PostgreSQL `__ documentation and the `PostGIS `__ documentation." +msgstr "Consultar la documentación de `PostgreSQL `__ y la documentación de `PostGIS `__." -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 "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 "For this example the ``cost`` and ``reverse_cost`` values are going to be the double of the length of the geometry." +msgstr "Para este ejemplo los valores ``coste`` y ``coste_inverso`` van a ser el doble de la longitud de la geometría." msgid "Update costs to length of geometry" msgstr "Actualizar los costes a la longitud de la geometría" -msgid "" -"Suppose that ``cost`` and ``reverse_cost`` columns in the sample data " -"represent:" -msgstr "" -"Suponer que las columnas ``cost`` y ``reverse_cost`` de los datos de la " -"muestra representan:" +msgid "Suppose that ``cost`` and ``reverse_cost`` columns in the sample data represent:" +msgstr "Suponer que las columnas ``cost`` y ``reverse_cost`` de los datos de la muestra representan:" msgid ":math:`1` when the edge exists in the graph" msgstr ":math:`1` cuando la arista existe en el grafo" @@ -8174,18 +6220,13 @@ msgid ":math:`-1` when the edge does not exist in the graph" msgstr ":math:`-1` cuando la arista no existe en el grafo" msgid "Using that information updating to the length of the geometries:" -msgstr "" -"Utilizando esa información de actualización a la longitud de las geometrías:" +msgstr "Utilizando esa información de actualización a la longitud de las geometrías:" msgid "Which gives the following results:" msgstr "Lo que da los siguientes resultados:" -msgid "" -"Note that to be able to follow the documentation examples, everything is " -"based on the original graph." -msgstr "" -"Tener en cuenta que para poder seguir los ejemplos de la documentación, todo " -"se basa en el grafo original." +msgid "Note that to be able to follow the documentation examples, everything is based on the original graph." +msgstr "Tener en cuenta que para poder seguir los ejemplos de la documentación, todo se basa en el grafo original." msgid "Returning to the original data:" msgstr "Volviendo a los datos originales:" @@ -8218,9 +6259,7 @@ msgid "There are lots of possible problems in a graph." msgstr "Hay muchos problemas posibles en un grafo." msgid "The data used may not have been designed with routing in mind." -msgstr "" -"Es posible que los datos utilizados no se hayan diseñado teniendo en cuenta " -"el ruteo." +msgstr "Es posible que los datos utilizados no se hayan diseñado teniendo en cuenta el ruteo." msgid "A graph has some very specific requirements." msgstr "Un grafo tiene unos requisitos muy específicos." @@ -8237,12 +6276,8 @@ msgstr "El grafo es demasiado grande y hay que contraerlo." msgid "A sub graph is needed for the application." msgstr "Se necesita un subgrafo para la aplicación." -msgid "" -"and many other problems that the pgRouting user, that is the application " -"developer might encounter." -msgstr "" -"y muchos otros problemas que el usuario de pgRouting, es decir, el " -"desarrollador de aplicaciones, puede encontrar." +msgid "and many other problems that the pgRouting user, that is the application developer might encounter." +msgstr "y muchos otros problemas que el usuario de pgRouting, es decir, el desarrollador de aplicaciones, puede encontrar." msgid "Crossing edges" msgstr "Aristas que se cruzan" @@ -8250,28 +6285,17 @@ msgstr "Aristas que se cruzan" msgid "To get the crossing edges:" msgstr "Para obtener las aristas que se cruzan:" -msgid "" -"That information is correct, for example, when in terms of vehicles, is it a " -"tunnel or bridge crossing over another road." -msgstr "" -"Esa información es correcta, por ejemplo, cuando en términos de vehículos, " -"es un túnel o puente cruczando sobre otra carretera." +msgid "That information is correct, for example, when in terms of vehicles, is it a tunnel or bridge crossing over another road." +msgstr "Esa información es correcta, por ejemplo, cuando en términos de vehículos, es un túnel o puente cruczando sobre otra carretera." msgid "It might be incorrect, for example:" msgstr "Puede ser incorrecto, por ejemplo:" -msgid "" -"When it is actually an intersection of roads, where vehicles can make turns." -msgstr "" -"Cuando en realidad es una intersección de carreteras, donde los vehículos " -"pueden hacer giros." +msgid "When it is actually an intersection of roads, where vehicles can make turns." +msgstr "Cuando en realidad es una intersección de carreteras, donde los vehículos pueden hacer giros." -msgid "" -"When in terms of electrical lines, the electrical line is able to switch " -"roads even on a tunnel or bridge." -msgstr "" -"En cuanto a las líneas eléctricas, son capaces de cambiar de carretera " -"incluso en un túnel o puente." +msgid "When in terms of electrical lines, the electrical line is able to switch roads even on a tunnel or bridge." +msgstr "En cuanto a las líneas eléctricas, son capaces de cambiar de carretera incluso en un túnel o puente." msgid "When it is incorrect, it needs fixing:" msgstr "Cuando es incorrecta, hay que arreglarla:" @@ -8279,60 +6303,31 @@ msgstr "Cuando es incorrecta, hay que arreglarla:" msgid "For vehicles and pedestrians" msgstr "Para vehículos y peatones" -msgid "" -"If the data comes from OSM and was imported to the database using " -"``osm2pgrouting``, the fix needs to be done in the `OSM portal `__ and the data imported again." -msgstr "" -"Si los datos provienen de OSM y fueron importados a la base de datos " -"utilizando ``osm2pgrouting``, la corrección debe hacerse en el `OSM portal " -"`__ y los datos ser importados de nuevo." +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 "Si los datos provienen de OSM y fueron importados a la base de datos utilizando ``osm2pgrouting``, la corrección debe hacerse en el `OSM portal `__ y los datos ser importados de nuevo." -msgid "" -"In general when the data comes from a supplier that has the data prepared " -"for routing vehicles, and there is a problem, the data is to be fixed from " -"the supplier" -msgstr "" -"En general, cuando los datos proceden de un proveedor que tiene los datos " -"preparados para el ruteo de vehículos, y hay un problema, los datos deben " -"ser fijados por el proveedor" +msgid "In general when the data comes from a supplier that has the data prepared for routing vehicles, and there is a problem, the data is to be fixed from the supplier" +msgstr "En general, cuando los datos proceden de un proveedor que tiene los datos preparados para el ruteo de vehículos, y hay un problema, los datos deben ser fijados por el proveedor" msgid "For very specific applications" msgstr "Para aplicaciones muy específicas" -msgid "" -"The data is correct when from the point of view of routing vehicles or " -"pedestrians." -msgstr "" -"Los datos son correctos desde el punto de vista de la circulación de " -"vehículos o peatones." +msgid "The data is correct when from the point of view of routing vehicles or pedestrians." +msgstr "Los datos son correctos desde el punto de vista de la circulación de vehículos o peatones." msgid "The data needs a local fix for the specific application." msgstr "Los datos necesitan un arreglo local para la aplicación específica." -msgid "" -"Once analyzed one by one the crossings, for the ones that need a local fix, " -"the edges need to be `split `__." -msgstr "" -"Una vez analizados uno a uno los cruces, para los que necesitan un arreglo " -"local, hay que `dividir las aristas `__." +msgid "Once analyzed one by one the crossings, for the ones that need a local fix, the edges need to be `split `__." +msgstr "Una vez analizados uno a uno los cruces, para los que necesitan un arreglo local, hay que `dividir las aristas `__." -msgid "" -"The new edges need to be added to the edges table, the rest of the " -"attributes need to be updated in the new edges, the old edges need to be " -"removed and the routing topology needs to be updated." -msgstr "" -"Hay que añadir las nuevas aristas a la tabla de aristas, actualizar el resto " -"de atributos en las nuevas aristas, eliminar las aristas antiguas y " -"actualizar la topología de encaminamiento." +msgid "The new edges need to be added to the edges table, the rest of the attributes need to be updated in the new edges, the old edges need to be removed and the routing topology needs to be updated." +msgstr "Hay que añadir las nuevas aristas a la tabla de aristas, actualizar el resto de atributos en las nuevas aristas, eliminar las aristas antiguas y actualizar la topología de encaminamiento." msgid "Fixing an intersection" msgstr "Encontrando una intersección" -msgid "" -"In this example the original edge table will be used to store the additional " -"geometries." +msgid "In this example the original edge table will be used to store the additional geometries." msgstr "" msgid "An example use without results" @@ -8358,9 +6353,7 @@ msgstr "" msgid "Adding new segments." msgstr "Añadiendo nuevos segmentos." -msgid "" -"Calling :doc:`pgr_separateCrossing` and adding the new segments to the edges " -"table." +msgid "Calling :doc:`pgr_separateCrossing` and adding the new segments to the edges table." msgstr "" #, fuzzy @@ -8368,13 +6361,8 @@ msgid "Update other values" msgstr "Actualizar la topología" #, fuzzy -msgid "" -"In this example only ``cost`` and ``reverse_cost`` are updated, where they " -"are based on the length of the geometry and the directionality is kept using " -"the ``sign`` function." -msgstr "" -"Para este ejemplo los valores ``coste`` y ``coste_inverso`` van a ser el " -"doble de la longitud de la geometría." +msgid "In this example only ``cost`` and ``reverse_cost`` are updated, where they are based on the length of the geometry and the directionality is kept using the ``sign`` function." +msgstr "Para este ejemplo los valores ``coste`` y ``coste_inverso`` van a ser el doble de la longitud de la geometría." msgid "Update the topology" msgstr "Actualizar la topología" @@ -8405,13 +6393,8 @@ msgid "Maybe there is a small barrier for vehicles but not for pedestrians." msgstr "" #, fuzzy -msgid "" -"Once analyzed one by one the touchings, for the ones that need a local fix, " -"the edges need to be `split `__." -msgstr "" -"Una vez analizados uno a uno los cruces, para los que necesitan un arreglo " -"local, hay que `dividir las aristas `__." +msgid "Once analyzed one by one the touchings, for the ones that need a local fix, the edges need to be `split `__." +msgstr "Una vez analizados uno a uno los cruces, para los que necesitan un arreglo local, hay que `dividir las aristas `__." msgid "Fixing a gap" msgstr "" @@ -8426,9 +6409,7 @@ msgstr "Analizar la red por espacios." msgid "The analysis tell us that the network has a gap." msgstr "El análisis dice que la red tiene un hueco y una intersección." -msgid "" -"Calling :doc:`pgr_separateTouching` and adding the new segments to the edges " -"table." +msgid "Calling :doc:`pgr_separateTouching` and adding the new segments to the edges table." msgstr "" msgid "Routing from :math:`1` to :math:`2` gives a solution." @@ -8455,25 +6436,19 @@ msgstr "Del vértice al vértice más cercano de la arista" msgid "This solution requires the edge to be split." msgstr "Esta solución requiere dividir el borde." -msgid "" -"In this example :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` " -"will be used." +msgid "In this example :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` will be used." msgstr "" msgid "Get the connectivity" msgstr "Obtener la conectividad" -msgid "" -"In this example: the edges table will need an additional column and the " -"vertex table will be rebuilt completely." +msgid "In this example: the edges table will need an additional column and the vertex table will be rebuilt completely." msgstr "" msgid "Insert new edges" msgstr "Insertar nuevas aristas" -msgid "" -"Using :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` insert the " -"results into the edges table." +msgid "Using :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` insert the results into the edges table." msgstr "" msgid "Create the vertices table" @@ -8486,31 +6461,16 @@ msgid "Contraction of a graph" msgstr "Contracción de un grafo" msgid "The graph can be reduced in size using :doc:`contraction-family`" -msgstr "" -"El grafo puede reducirse de tamaño utilizando :doc:`contraction-family`" +msgstr "El grafo puede reducirse de tamaño utilizando :doc:`contraction-family`" -msgid "" -"When to contract will depend on the size of the graph, processing times, " -"correctness of the data, on the final application, or any other factor not " -"mentioned." -msgstr "" -"El cuando contraer dependerá del tamaño del gráfico, de los tiempos de " -"procesamiento, de la corrección de los datos, de la aplicación final o de " -"cualquier otro factor no mencionado." +msgid "When to contract will depend on the size of the graph, processing times, correctness of the data, on the final application, or any other factor not mentioned." +msgstr "El cuando contraer dependerá del tamaño del gráfico, de los tiempos de procesamiento, de la corrección de los datos, de la aplicación final o de cualquier otro factor no mencionado." -msgid "" -"A fairly good method of finding out if contraction can be useful is because " -"of the number of dead ends and/or the number of linear edges." -msgstr "" -"Un método bastante bueno para saber si la contracción puede ser útil es por " -"el número de callejones sin salida y/o el número de aristas lineales." +msgid "A fairly good method of finding out if contraction can be useful is because of the number of dead ends and/or the number of linear edges." +msgstr "Un método bastante bueno para saber si la contracción puede ser útil es por el número de callejones sin salida y/o el número de aristas lineales." -msgid "" -"A complete method on how to contract and how to use the contracted graph is " -"described on :doc:`contraction-family`" -msgstr "" -"En :doc:`contraction-family` se describe un método completo sobre cómo " -"contraer y cómo utilizar el grafo contraído" +msgid "A complete method on how to contract and how to use the contracted graph is described on :doc:`contraction-family`" +msgstr "En :doc:`contraction-family` se describe un método completo sobre cómo contraer y cómo utilizar el grafo contraído" msgid "To get the dead ends:" msgstr "Para obtener los callejones sin salida:" @@ -8518,26 +6478,17 @@ msgstr "Para obtener los callejones sin salida:" msgid "A dead end happens when" msgstr "Un callejón sin salida se produce cuando" -msgid "" -"The vertex is the limit of a cul-de-sac, a no-through road or a no-exit road." -msgstr "" -"El vértice es el límite de un callejón sin salida, una vía de no paso o una " -"vía de no salida." +msgid "The vertex is the limit of a cul-de-sac, a no-through road or a no-exit road." +msgstr "El vértice es el límite de un callejón sin salida, una vía de no paso o una vía de no salida." msgid "The vertex is on the limit of the imported graph." msgstr "El vértice esta en el limite del grafo importado." msgid "If a larger graph is imported then the vertex might not be a dead end" -msgstr "" -"Si se importa un grafo más grande, puede que el vértice no sea un callejón " -"sin salida" +msgstr "Si se importa un grafo más grande, puede que el vértice no sea un callejón sin salida" -msgid "" -"Node :math:`4`, is a dead end on the query, even that it visually looks like " -"an end point of 3 edges." -msgstr "" -"El nodo :math:`4`, es un callejón sin salida en la consulta, aunque " -"visualmente parezca un punto final de 3 aristas." +msgid "Node :math:`4`, is a dead end on the query, even that it visually looks like an end point of 3 edges." +msgstr "El nodo :math:`4`, es un callejón sin salida en la consulta, aunque visualmente parezca un punto final de 3 aristas." msgid "Is node :math:`4` a dead end or not?" msgstr "¿Es el nodo :math:`4` un callejón sin salida o no?" @@ -8551,37 +6502,20 @@ msgstr "Hay un bordillo tan pequeño:" msgid "That does not allow a vehicle to use that visual intersection?" msgstr "¿Eso no permite a un vehículo utilizar esa intersección visual?" -msgid "" -"Is the application for pedestrians and therefore the pedestrian can easily " -"walk on the small curb?" -msgstr "" -"¿Es la aplicación para peatones y por lo tanto el peatón puede caminar " -"fácilmente en una acera pequeña?" +msgid "Is the application for pedestrians and therefore the pedestrian can easily walk on the small curb?" +msgstr "¿Es la aplicación para peatones y por lo tanto el peatón puede caminar fácilmente en una acera pequeña?" -msgid "" -"Is the application for the electricity and the electrical lines than can " -"easily be extended on top of the small curb?" -msgstr "" -"¿Es la aplicación para la electricidad y las líneas eléctricas que se puede " -"extender fácilmente en la parte superior de la acera pequeña?" +msgid "Is the application for the electricity and the electrical lines than can easily be extended on top of the small curb?" +msgstr "¿Es la aplicación para la electricidad y las líneas eléctricas que se puede extender fácilmente en la parte superior de la acera pequeña?" -msgid "" -"Is there a big cliff and from eagles view look like the dead end is close to " -"the segment?" -msgstr "" -"¿Hay un gran acantilado y desde la vista de las águilas parece que el " -"callejón sin salida está cerca del segmento?" +msgid "Is there a big cliff and from eagles view look like the dead end is close to the segment?" +msgstr "¿Hay un gran acantilado y desde la vista de las águilas parece que el callejón sin salida está cerca del segmento?" msgid "Depending on the answer, modification of the data might be needed." msgstr "Dependiendo de la respuesta, será necesario la modificación de datos." -msgid "" -"When there are many dead ends, to speed up processing, the :doc:`contraction-" -"family` functions can be used to contract the graph." -msgstr "" -"Cuando hay muchos callejones sin salida, para acelerar el procesamiento, se " -"pueden utilizar las funciones de :doc:`contraction-family` para contraer el " -"grafo." +msgid "When there are many dead ends, to speed up processing, the :doc:`contraction-family` functions can be used to contract the graph." +msgstr "Cuando hay muchos callejones sin salida, para acelerar el procesamiento, se pueden utilizar las funciones de :doc:`contraction-family` para contraer el grafo." msgid "Linear edges" msgstr "Bordes lineales" @@ -8589,30 +6523,17 @@ msgstr "Bordes lineales" msgid "To get the linear edges:" msgstr "Para obtener las aristas lineales:" -msgid "" -"These linear vertices are correct, for example, when those the vertices are " -"speed bumps, stop signals and the application is taking them into account." -msgstr "" -"Estos vértices lineales son correctos, por ejemplo, cuando esos vértices son " -"badenes, señales de alto y la aplicación los tiene en cuenta." +msgid "These linear vertices are correct, for example, when those the vertices are speed bumps, stop signals and the application is taking them into account." +msgstr "Estos vértices lineales son correctos, por ejemplo, cuando esos vértices son badenes, señales de alto y la aplicación los tiene en cuenta." -msgid "" -"When there are many linear vertices, that need not to be taken into account, " -"to speed up the processing, the :doc:`contraction-family` functions can be " -"used to contract the problem." -msgstr "" -"Cuando hay muchas aristas lineales, que no necesitan tomarse en cuenta, para " -"acelerar el procesamiento se pueden utilizar las funciones :doc:`contraction-" -"family` para contraer el grafo." +msgid "When there are many linear vertices, that need not to be taken into account, to speed up the processing, the :doc:`contraction-family` functions can be used to contract the problem." +msgstr "Cuando hay muchas aristas lineales, que no necesitan tomarse en cuenta, para acelerar el procesamiento se pueden utilizar las funciones :doc:`contraction-family` para contraer el grafo." msgid "Function's structure" msgstr "Estructura de la función" -msgid "" -"Once the graph preparation work has been done above, it is time to use a" -msgstr "" -"Una vez realizado el trabajo de preparación del grafo anterior, es el " -"momento de utilizar un" +msgid "Once the graph preparation work has been done above, it is time to use a" +msgstr "Una vez realizado el trabajo de preparación del grafo anterior, es el momento de utilizar un" msgid "The general form of a pgRouting function call is:" msgstr "La forma general de una llamada a una función de pgRouting es:" @@ -8621,43 +6542,25 @@ msgid "\\ \\" msgstr "\\ \\" msgid "pgr_(`Inner queries`_, **parameters**, [ ``Optional parameters``)" -msgstr "" -"pgr_(`Consultas internas`_, **parámetros**, [ ``Parámetros " -"opcionales``)" +msgstr "pgr_(`Consultas internas`_, **parámetros**, [ ``Parámetros opcionales``)" -msgid "" -"`Inner queries`_: Are compulsory parameters that are ``TEXT`` strings " -"containing SQL queries." -msgstr "" -"`Consultas internas`_: Son parámetros obligatorios que son ``TEXT`` que " -"contienen consultas SQL." +msgid "`Inner queries`_: Are compulsory parameters that are ``TEXT`` strings containing SQL queries." +msgstr "`Consultas internas`_: Son parámetros obligatorios que son ``TEXT`` que contienen consultas SQL." -msgid "" -"**parameters**: Additional compulsory parameters needed by the function." -msgstr "" -"**Parámetros**: Parámetros obligatorios adicionales que necesita la función." +msgid "**parameters**: Additional compulsory parameters needed by the function." +msgstr "**Parámetros**: Parámetros obligatorios adicionales que necesita la función." -msgid "" -"``Optional parameters``: Are non compulsory **named** parameters that have a " -"default value when omitted." -msgstr "" -"``Parámetros opcionales``: Son parámetros **nombrados** no obligatorios que " -"tienen un valor por defecto cuando se omiten." +msgid "``Optional parameters``: Are non compulsory **named** parameters that have a default value when omitted." +msgstr "``Parámetros opcionales``: Son parámetros **nombrados** no obligatorios que tienen un valor por defecto cuando se omiten." -msgid "" -"The compulsory parameters are positional parameters, the optional parameters " -"are named parameters." -msgstr "" -"Los parámetros obligatorios son parámetros de posición, los parámetros " -"opcionales son parámetros nombrados." +msgid "The compulsory parameters are positional parameters, the optional parameters are named parameters." +msgstr "Los parámetros obligatorios son parámetros de posición, los parámetros opcionales son parámetros nombrados." msgid "For example, for this :doc:`pgr_dijkstra` signature:" msgstr "Por ejemplo, para esta firma :doc:`pgr_dijkstra`:" -msgid "" -"pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "" -"pgr_dijkstra(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" +msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_dijkstra(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" msgid "`Edges SQL`_:" msgstr "`SQL de aristas`_:" @@ -8671,12 +6574,8 @@ msgstr "Es obligatorio." msgid "It is an inner query." msgstr "Es una consulta interna." -msgid "" -"It has no name, so **Edges SQL** gives an idea of what kind of inner query " -"needs to be used" -msgstr "" -"No tiene nombre, por lo que **SQL de aristas** da una idea del tipo de " -"consulta interna que hay que utilizar" +msgid "It has no name, so **Edges SQL** gives an idea of what kind of inner query needs to be used" +msgstr "No tiene nombre, por lo que **SQL de aristas** da una idea del tipo de consulta interna que hay que utilizar" msgid "**start vid**:" msgstr "**vid inical**:" @@ -8684,22 +6583,14 @@ msgstr "**vid inical**:" msgid "Is the second parameter." msgstr "Es el segundo parámetro." -msgid "" -"It has no name, so **start vid** gives an idea of what the second " -"parameter's value should contain." -msgstr "" -"No tiene nombre, por lo que **salida** da una idea de lo que debe contener " -"el valor del segundo parámetro." +msgid "It has no name, so **start vid** gives an idea of what the second parameter's value should contain." +msgstr "No tiene nombre, por lo que **salida** da una idea de lo que debe contener el valor del segundo parámetro." msgid "Is the third parameter." msgstr "Es el tercer parámetro." -msgid "" -"It has no name, so **end vid** gives an idea of what the third parameter's " -"value should contain" -msgstr "" -"No tiene nombre, por lo que **destino** da una idea de lo que debe contener " -"el valor del tercer parámetro" +msgid "It has no name, so **end vid** gives an idea of what the third parameter's value should contain" +msgstr "No tiene nombre, por lo que **destino** da una idea de lo que debe contener el valor del tercer parámetro" msgid "Is the fourth parameter." msgstr "Es el cuarto parámetro." @@ -8710,19 +6601,14 @@ msgstr "Es opcional." msgid "It has a name." msgstr "Tiene un nombre." -msgid "" -"The full description of the parameters are found on the `Parameters`_ " -"section of each function." -msgstr "" -"La descripción completa de los parámetros se encuentra en la sección " -"`Parámetros`_ de cada función." +msgid "The full description of the parameters are found on the `Parameters`_ section of each function." +msgstr "La descripción completa de los parámetros se encuentra en la sección `Parámetros`_ de cada función." msgid "Function's overloads" msgstr "Sobrecargas de funciones" msgid "A function might have different overloads. The most common are called:" -msgstr "" -"Una función puede tener diferentes sobrecargas. Las más comunes se llaman:" +msgstr "Una función puede tener diferentes sobrecargas. Las más comunes se llaman:" msgid "`One to One`_" msgstr "`Uno a Uno`_" @@ -8748,12 +6634,8 @@ msgstr "**Uno**: **CUALQUIER-ENTERO**" msgid "**Many**: ``ARRAY`` [**ANY-INTEGER**]" msgstr "**Muchos**: ``ARRAY`` [**CUALQUIER-ENTERO**]" -msgid "" -"Depending of the function the overloads may vary. But the concept of " -"parameter type change remains the same." -msgstr "" -"Dependiendo de la función, las sobrecargas pueden variar. Pero el concepto " -"de cambio de tipo de parámetro sigue siendo el mismo." +msgid "Depending of the function the overloads may vary. But the concept of parameter type change remains the same." +msgstr "Dependiendo de la función, las sobrecargas pueden variar. Pero el concepto de cambio de tipo de parámetro sigue siendo el mismo." msgid "When routing from:" msgstr "Cuando se rutea desde:" @@ -8785,16 +6667,8 @@ msgstr "Los usuarios pueden definir las combinaciones como deseen." msgid "Needs a `Combinations SQL`_" msgstr "Necesita una `SQL de combinaciones`_" -msgid "" -"There are several kinds of valid inner queries and also the columns returned " -"are depending of the function. Which kind of inner query will depend on the " -"function's requirements. To simplify the variety of types, **ANY-INTEGER** " -"and **ANY-NUMERICAL** is used." -msgstr "" -"Existen varios tipos de consultas internas válidas y también las columnas " -"devueltas dependen de la función. El tipo de consulta interna dependerá de " -"los requisitos de la función. Para simplificar la variedad de tipos, se " -"utiliza **ANY-INTEGER** y **ANY-NUMERICAL**." +msgid "There are several kinds of valid inner queries and also the columns returned are depending of the function. Which kind of inner query will depend on the function's requirements. To simplify the variety of types, **ANY-INTEGER** and **ANY-NUMERICAL** is used." +msgstr "Existen varios tipos de consultas internas válidas y también las columnas devueltas dependen de la función. El tipo de consulta interna dependerá de los requisitos de la función. Para simplificar la variedad de tipos, se utiliza **ANY-INTEGER** y **ANY-NUMERICAL**." msgid "Edges SQL for" msgstr "SQL de aristas para" @@ -8808,12 +6682,8 @@ msgstr "General sin ``id``" msgid "General with (X,Y)" msgstr "General con (X,Y)" -msgid "" -"When negative: edge (``source``, ``target``) does not exist, therefore it's " -"not part of the graph." -msgstr "" -"Cuando es negativo: la arista (``source``, ``target``) no existe, por lo " -"tanto no es parte del grafo." +msgid "When negative: edge (``source``, ``target``) does not exist, therefore it's not part of the graph." +msgstr "Cuando es negativo: la arista (``source``, ``target``) no existe, por lo tanto no es parte del grafo." msgid "Weight of the edge (``target``, ``source``)," msgstr "Peso de la arista (``target``, ``source``)," @@ -8857,28 +6727,14 @@ msgstr "Utilizado en combinación firmas" msgid "Points SQL for" msgstr "SQL de puntos para" -msgid "" -"The main parameter of the majority of the pgRouting functions is a query " -"that selects the edges of the graph." -msgstr "" -"El parámetro principal de la mayoría de las funciones pgRouting es una " -"consulta que selecciona las aristas del grafo." +msgid "The main parameter of the majority of the pgRouting functions is a query that selects the edges of the graph." +msgstr "El parámetro principal de la mayoría de las funciones pgRouting es una consulta que selecciona las aristas del grafo." -msgid "" -"Depending on the family or category of a function it will have additional " -"parameters, some of them are compulsory and some are optional." -msgstr "" -"Dependiendo de la familia o categoría de una función tendrá parámetros " -"adicionales, algunos de ellos son obligatorios y otros opcionales." +msgid "Depending on the family or category of a function it will have additional parameters, some of them are compulsory and some are optional." +msgstr "Dependiendo de la familia o categoría de una función tendrá parámetros adicionales, algunos de ellos son obligatorios y otros opcionales." -msgid "" -"The compulsory parameters are nameless and must be given in the required " -"order. The optional parameters are named parameters and will have a default " -"value." -msgstr "" -"Los parámetros obligatorios no tienen nombre y deben indicarse en el orden " -"requerido. Los parámetros opcionales son parámetros con nombre y tendrán un " -"valor por defecto." +msgid "The compulsory parameters are nameless and must be given in the required order. The optional parameters are named parameters and will have a default value." +msgstr "Los parámetros obligatorios no tienen nombre y deben indicarse en el orden requerido. Los parámetros opcionales son parámetros con nombre y tendrán un valor por defecto." msgid "Parameters for the Via functions" msgstr "Párametros para las funciones Via" @@ -8902,31 +6758,16 @@ msgid "When ``true`` if a path is missing stops and returns **EMPTY SET**" msgstr "Cuando ``true`` si un camino le faltan paradas y regresa **EMPTY SET**" msgid "When ``false`` ignores missing paths returning all paths found" -msgstr "" -"Cuando ``false``, ignora las rutas faltantes y devuelve todas las rutas " -"encontradas" +msgstr "Cuando ``false``, ignora las rutas faltantes y devuelve todas las rutas encontradas" msgid "``U_turn_on_edge``" msgstr "``U_turn_on_edge``" -msgid "" -"When ``true`` departing from a visited vertex will not try to avoid using " -"the edge used to reach it. In other words, U turn using the edge with same " -"identifier is allowed." -msgstr "" -"Cuando ``true`` saliendo de un vértice visitado no intentará evitar el uso " -"de la arista utilizada para alcanzarlo. En otras palabras, se permite la " -"vuelta en U usando la arista con el mismo identificador." +msgid "When ``true`` departing from a visited vertex will not try to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is allowed." +msgstr "Cuando ``true`` saliendo de un vértice visitado no intentará evitar el uso de la arista utilizada para alcanzarlo. En otras palabras, se permite la vuelta en U usando la arista con el mismo identificador." -msgid "" -"When ``false`` when a departing from a visited vertex tries to avoid using " -"the edge used to reach it. In other words, U turn using the edge with same " -"identifier is used when no other path is found." -msgstr "" -"Cuando ``false`` al salir de un vértice visitado intenta evitar el uso de la " -"arista utilizada para alcanzarlo. En otras palabras, se utiliza la vuelta en " -"U utilizando la arista con el mismo identificador cuando no se encuentra " -"ninguna otra ruta." +msgid "When ``false`` when a departing from a visited vertex tries to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is used when no other path is found." +msgstr "Cuando ``false`` al salir de un vértice visitado intenta evitar el uso de la arista utilizada para alcanzarlo. En otras palabras, se utiliza la vuelta en U utilizando la arista con el mismo identificador cuando no se encuentra ninguna otra ruta." msgid "For the TRSP functions" msgstr "Para las funciones de TRSP" @@ -8934,20 +6775,15 @@ msgstr "Para las funciones de TRSP" msgid "Array of identifiers of destination vertices." msgstr "Arreglo de identificadores de vértices destino." -msgid "" -"There are several kinds of columns returned are depending of the function." +msgid "There are several kinds of columns returned are depending of the function." msgstr "Hay varios tipos de columnas devueltas que dependen de la función." #, fuzzy msgid "Result columns for single path functions" msgstr "Columnas de resultados para funciones de árbol de expansión" -msgid "" -"Used in functions that return one path solution per departure and " -"destination." -msgstr "" -"Se utiliza en funciones que devuelven solo una solución de ruta por salida y " -"destino." +msgid "Used in functions that return one path solution per departure and destination." +msgstr "Se utiliza en funciones que devuelven solo una solución de ruta por salida y destino." msgid ":doc:`pgr_dijkstraNear`" msgstr ":doc:`pgr_dijkstraNear`" @@ -8959,11 +6795,8 @@ msgstr "Regresa el conjunto de |short-generic-result|" msgid "``path_seq``" msgstr "``path_seq``" -msgid "" -"Relative position in the path. Has value **1** for the beginning of a path." -msgstr "" -"Posición relativa en la ruta. Tiene el valor **1** para el inicio de una " -"ruta." +msgid "Relative position in the path. Has value **1** for the beginning of a path." +msgstr "Posición relativa en la ruta. Tiene el valor **1** para el inicio de una ruta." msgid "Identifier of the starting vertex of the current path." msgstr "Identificador del vértice inicial de la ruta actual." @@ -8974,38 +6807,22 @@ msgstr "Identificador del vértice final de la ruta actual." msgid "Identifier of the node in the path from ``start_vid`` to ``end_vid``." msgstr "Identificador del nodo en la ruta de ``start_vid`` a ``end_vid``." -msgid "" -"Identifier of the edge used to go from ``node`` to the next node in the path " -"sequence. **-1** for the last node of the path." -msgstr "" -"Identificador de la arista utilizado para ir del ``node`` al siguiente nodo " -"de la secuencia de ruta. ``-1`` para el último nodo de la ruta." +msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence. **-1** for the last node of the path." +msgstr "Identificador de la arista utilizado para ir del ``node`` al siguiente nodo de la secuencia de ruta. ``-1`` para el último nodo de la ruta." -msgid "" -"Cost to traverse from ``node`` using ``edge`` to the next node in the path " -"sequence." -msgstr "" -"Costo para atravesar desde ``node`` usando ``edge`` hasta el siguiente nodo " -"en la secuencia de la ruta." +msgid "Cost to traverse from ``node`` using ``edge`` to the next node in the path sequence." +msgstr "Costo para atravesar desde ``node`` usando ``edge`` hasta el siguiente nodo en la secuencia de la ruta." #, fuzzy -msgid "" -"When ``start_vid`` or ``end_vid`` columns have negative values, the " -"identifier is for a Point." -msgstr "" -"Cuando las columnas del vértice inicial o del destino continen valores " -"negativos, el identificador es para un Punto." +msgid "When ``start_vid`` or ``end_vid`` columns have negative values, the identifier is for a Point." +msgstr "Cuando las columnas del vértice inicial o del destino continen valores negativos, el identificador es para un Punto." #, fuzzy msgid "Result columns for multiple paths functions" msgstr "Columnas de resultados para funciones de árbol de expansión" -msgid "" -"Used in functions that return many paths solutions per departure and " -"destination." -msgstr "" -"Se utiliza en funciones que devuelven muchas soluciones de rutas por salida " -"y destino." +msgid "Used in functions that return many paths solutions per departure and destination." +msgstr "Se utiliza en funciones que devuelven muchas soluciones de rutas por salida y destino." #, fuzzy msgid ":doc:`pgr_KSP`" @@ -9024,10 +6841,8 @@ msgstr "``path_id``" msgid "Path identifier." msgstr "Identificador del camino." -msgid "" -"Has value **1** for the first of a path from ``start_vid`` to ``end_vid``." -msgstr "" -"Tiene valor **1** para el primero de la ruta de ``start_vid`` a ``end_vid``." +msgid "Has value **1** for the first of a path from ``start_vid`` to ``end_vid``." +msgstr "Tiene valor **1** para el primero de la ruta de ``start_vid`` a ``end_vid``." msgid "Result columns for cost functions" msgstr "Columnas de resultados de las funciones de costes" @@ -9036,12 +6851,8 @@ msgstr "Columnas de resultados de las funciones de costes" msgid "Used by:" msgstr "Usado en:" -msgid "" -"When start_vid or end_vid columns have negative values, the identifier is " -"for a Point." -msgstr "" -"Cuando las columnas del vértice inicial o del destino continen valores " -"negativos, el identificador es para un Punto." +msgid "When start_vid or end_vid columns have negative values, the identifier is for a Point." +msgstr "Cuando las columnas del vértice inicial o del destino continen valores negativos, el identificador es para un Punto." msgid "Result columns for flow functions" msgstr "Columnas de resultados para funciones de flujo" @@ -9050,8 +6861,7 @@ msgid "Result columns for spanning tree functions" msgstr "Columnas de resultados para funciones de árbol de expansión" msgid "Used in functions that return a tree solution per departure." -msgstr "" -"Se utiliza en funciones que devuelven una solución de árbol por salida." +msgstr "Se utiliza en funciones que devuelven una solución de árbol por salida." #, fuzzy msgid "Result columns for simple spanning tree functions" @@ -9069,18 +6879,11 @@ msgstr "Consejos de Rendimiento" msgid "For the Routing functions" msgstr "Para las funciones de Ruteo" -msgid "" -"To get faster results bound the queries to an area of interest of routing." -msgstr "" -"Para obtener resultados más rápidos, delimitar las consultas a un área de " -"interés para el ruteo." +msgid "To get faster results bound the queries to an area of interest of routing." +msgstr "Para obtener resultados más rápidos, delimitar las consultas a un área de interés para el ruteo." -msgid "" -"In this example Use an inner query SQL that does not include some edges in " -"the routing function and is within the area of the results." -msgstr "" -"En este ejemplo, usar una consulta SQL interna que no incluya algunas " -"aristas en la función de ruteo y dentro del área de los resultados." +msgid "In this example Use an inner query SQL that does not include some edges in the routing function and is within the area of the results." +msgstr "En este ejemplo, usar una consulta SQL interna que no incluya algunas aristas en la función de ruteo y dentro del área de los resultados." msgid "Given this area:" msgstr "Dada esta área:" @@ -9094,42 +6897,26 @@ msgstr "Cómo contribuir" msgid "Wiki" msgstr "Wiki" -msgid "" -"Edit an existing `pgRouting Wiki `__ page." -msgstr "" -"Edita una página existente `Wiki de pgRouting `_." +msgid "Edit an existing `pgRouting Wiki `__ page." +msgstr "Edita una página existente `Wiki de pgRouting `_." msgid "Or create a new Wiki page" msgstr "O crea una nueva página Wiki" -msgid "" -"Create a page on the `pgRouting Wiki `__" -msgstr "" -"Crear una página en el `Wiki de pgRouting `_" +msgid "Create a page on the `pgRouting Wiki `__" +msgstr "Crear una página en el `Wiki de pgRouting `_" msgid "Give the title an appropriate name" msgstr "Asigne al título un nombre apropiado" -msgid "" -"`Example `__" -msgstr "" -"`Ejemplo `__" +msgid "`Example `__" +msgstr "`Ejemplo `__" msgid "Adding Functionality to pgRouting" msgstr "Agregando Funcionalidad a pgRouting" -msgid "" -"Consult the `developer's documentation `__" -msgstr "" -"Consultar la `documentation de desarrolladores `__" +msgid "Consult the `developer's documentation `__" +msgstr "Consultar la `documentation de desarrolladores `__" #, fuzzy msgid "See also" @@ -9138,27 +6925,12 @@ msgstr "Ver también" msgid "Installation" msgstr "Instalación" -msgid "" -"Instructions for downloading and installing binaries for different operating " -"systems, additional notes and corrections not included in this documentation " -"can be found in `Installation wiki `__" -msgstr "" -"Las instrucciones para descargar e instalar los binarios para diferentes " -"sistemas operativos, notas adicionales y correcciones no incluidas en esta " -"documentación se pueden encontrar en `Installation wiki `__" +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 "Las instrucciones para descargar e instalar los binarios para diferentes sistemas operativos, notas adicionales y correcciones no incluidas en esta documentación se pueden encontrar en `Installation wiki `__" #, fuzzy -msgid "" -"To use pgRouting, PostGIS needs to be installed, please read the information " -"about installation in this `Install Guide `__" -msgstr "" -"Para utilizar pgRouting postGIS necesita ser instalado, por favor lea la " -"información sobre la instalación en esta `Guía de instalacoón `__" +msgid "To use pgRouting, PostGIS needs to be installed, please read the information about installation in this `Install Guide `__" +msgstr "Para utilizar pgRouting postGIS necesita ser instalado, por favor lea la información sobre la instalación en esta `Guía de instalacoón `__" msgid "Short Version" msgstr "Versión corta" @@ -9167,36 +6939,22 @@ msgid "Extracting the tar ball" msgstr "Extraer la bola de alquitrán" msgid "To compile assuming you have all the dependencies in your search path:" -msgstr "" -"Para compilar suponiendo que tiene todas las dependencias en su ruta de " -"búsqueda:" +msgstr "Para compilar suponiendo que tiene todas las dependencias en su ruta de búsqueda:" -msgid "" -"Once pgRouting is installed, it needs to be enabled in each individual " -"database you want to use it in." -msgstr "" -"Una vez que pgRouting está instalado, debe habilitarse en cada base de datos " -"individual en la que desee utilizarlo." +msgid "Once pgRouting is installed, it needs to be enabled in each individual database you want to use it in." +msgstr "Una vez que pgRouting está instalado, debe habilitarse en cada base de datos individual en la que desee utilizarlo." msgid "Get the sources" msgstr "Obtener las fuentes" -msgid "" -"The pgRouting latest release can be found in https://github.com/pgRouting/" -"pgrouting/releases/latest" -msgstr "" -"La última versión de pgRouting se puede encontrar en https://github.com/" -"pgRouting/pgrouting/releases/latest" +msgid "The pgRouting latest release can be found in https://github.com/pgRouting/pgrouting/releases/latest" +msgstr "La última versión de pgRouting se puede encontrar en https://github.com/pgRouting/pgrouting/releases/latest" msgid "To download this release:" msgstr "Para descargar esta versión:" -msgid "" -"Go to :ref:`install-short` for more instructions on extracting tar ball and " -"compiling pgRouting." -msgstr "" -"Ir a :ref:`install-short` para más instrucciones sobre la extraccion de la " -"bola tar y la compilación de pgRouting." +msgid "Go to :ref:`install-short` for more instructions on extracting tar ball and compiling pgRouting." +msgstr "Ir a :ref:`install-short` para más instrucciones sobre la extraccion de la bola tar y la compilación de pgRouting." msgid "git" msgstr "git" @@ -9204,14 +6962,8 @@ msgstr "git" msgid "To download the repository" msgstr "Para descargar el repositorio" -msgid "" -"Go to :ref:`install-short` for more instructions on compiling pgRouting " -"(there is no tar ball involved while downloading pgRouting repository from " -"GitHub)." -msgstr "" -"Ir a :ref:`install-short` para más instrucciones sobre la compilación de " -"pgRouting (no hay bola tar involucrada al descargar el repositorio pgRouting " -"desde GitHub)." +msgid "Go to :ref:`install-short` for more instructions on compiling pgRouting (there is no tar ball involved while downloading pgRouting repository from GitHub)." +msgstr "Ir a :ref:`install-short` para más instrucciones sobre la compilación de pgRouting (no hay bola tar involucrada al descargar el repositorio pgRouting desde GitHub)." msgid "Enabling and upgrading in the database" msgstr "Habilitación y actualización en la base de datos" @@ -9219,37 +6971,21 @@ msgstr "Habilitación y actualización en la base de datos" msgid "Enabling the database" msgstr "Habilitación de la base de datos" -msgid "" -"pgRouting is a PostgreSQL extension and depends on PostGIS to provide " -"functionalities to end user. Below given code demonstrates enabling PostGIS " -"and pgRouting in the database." -msgstr "" -"pgRouting es una extensión de PostgreSQL y depende de PostGIS para " -"proporcionar funcionalidades al usuario final. A continuación se muestra el " -"código demuestra que permite PostGIS y pgRouting en la base de datos." +msgid "pgRouting is a PostgreSQL extension and depends on PostGIS to provide functionalities to end user. Below given code demonstrates enabling PostGIS and pgRouting in the database." +msgstr "pgRouting es una extensión de PostgreSQL y depende de PostGIS para proporcionar funcionalidades al usuario final. A continuación se muestra el código demuestra que permite PostGIS y pgRouting en la base de datos." -msgid "" -"Checking PostGIS and pgRouting version after enabling them in the database." -msgstr "" -"Comprobación de la versión de PostGIS y pgRouting después de habilitarlos en " -"la base de datos." +msgid "Checking PostGIS and pgRouting version after enabling them in the database." +msgstr "Comprobación de la versión de PostGIS y pgRouting después de habilitarlos en la base de datos." msgid "Upgrading the database" msgstr "Actualización de la base de datos" -msgid "" -"To upgrade pgRouting in the database to version 4.0.0 use the following " -"command:" -msgstr "" -"Para actualizar pgRouting en la base de datos a la versión 4.0.0 utilice el " -"siguiente comando:" +#, fuzzy +msgid "To upgrade pgRouting in the database to version 4.1.0 use the following command:" +msgstr "Para actualizar pgRouting en la base de datos a la versión 4.0.0 utilice el siguiente comando:" -msgid "" -"More information can be found in https://www.postgresql.org/docs/current/sql-" -"createextension.html" -msgstr "" -"Puede hallar más información en https://www.postgresql.org/docs/current/sql-" -"createextension.html" +msgid "More information can be found in https://www.postgresql.org/docs/current/sql-createextension.html" +msgstr "Puede hallar más información en https://www.postgresql.org/docs/current/sql-createextension.html" msgid "Dependencies" msgstr "Dependencias" @@ -9257,28 +6993,17 @@ msgstr "Dependencias" msgid "Compilation Dependencies" msgstr "Dependencias de Compilación" -msgid "" -"To be able to compile pgRouting, make sure that the following dependencies " -"are met:" -msgstr "" -"Para poder compilar pgRouting, asegúrese de que se cumplen las siguientes " -"dependencias:" +msgid "To be able to compile pgRouting, make sure that the following dependencies are met:" +msgstr "Para poder compilar pgRouting, asegúrese de que se cumplen las siguientes dependencias:" msgid "C and C++0x compilers" msgstr "Compiladores C y C++0x" -msgid "" -"Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with C++03 " -"or C++11 standard support" -msgstr "" -"Compilar con Boost 1.56 hasta Boost 1.74 requiere un compilador C++ con " -"soporte estandard para C++03 o C++11" +msgid "Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with C++03 or C++11 standard support" +msgstr "Compilar con Boost 1.56 hasta Boost 1.74 requiere un compilador C++ con soporte estandard para C++03 o C++11" -msgid "" -"Compiling with Boost 1.75 requires C++ Compiler with C++14 standard support" -msgstr "" -"La compilación con Boost 1.75 requiere un compilador de C++ compatible con " -"el estándar C++14" +msgid "Compiling with Boost 1.75 requires C++ Compiler with C++14 standard support" +msgstr "La compilación con Boost 1.75 requiere un compilador de C++ compatible con el estándar C++14" #, fuzzy msgid "Postgresql version >= 13" @@ -9355,17 +7080,11 @@ msgstr "El directorio de compilación es diferente del directorio de origen" msgid "Configuring The Documentation" msgstr "Configurar la documentación" -msgid "" -"User and developers documentation are not build if prerequisites are not " -"found." +msgid "User and developers documentation are not build if prerequisites are not found." msgstr "" -msgid "" -"Most of the effort of the documentation has been on the HTML files. Some " -"variables for building documentation:" -msgstr "" -"La mayor parte del esfuerzo de la documentación ha estado en los archivos " -"HTML. Algunas variables para construir la documentación:" +msgid "Most of the effort of the documentation has been on the HTML files. Some variables for building documentation:" +msgstr "La mayor parte del esfuerzo de la documentación ha estado en los archivos HTML. Algunas variables para construir la documentación:" msgid "Variable" msgstr "Variable" @@ -9380,17 +7099,13 @@ msgid "BOOL=ON" msgstr "BOOL=ON" msgid "If ON, turn on/off building HTML for user's documentation" -msgstr "" -"Si está activado, active/desactive la creación de HTML para la documentación " -"del usuario" +msgstr "Si está activado, active/desactive la creación de HTML para la documentación del usuario" msgid "BUILD_DOXY" msgstr "BUILD_DOXY" msgid "If ON, turn on/off building HTML for developer's documentation" -msgstr "" -"Si está activado, active o desactive la creación de HTML para la " -"documentación del desarrollador" +msgstr "Si está activado, active o desactive la creación de HTML para la documentación del desarrollador" msgid "BUILD_LATEX" msgstr "BUILD_LATEX" @@ -9411,9 +7126,7 @@ msgid "DOC_USE_BOOTSTRAP" msgstr "DOC_USE_BOOTSTRAP" msgid "If ON, use sphinx-bootstrap for HTML pages of the users documentation" -msgstr "" -"Si está activado, utilice sphinx-bootstrap para las páginas HTML de la " -"documentación de los usuarios" +msgstr "Si está activado, utilice sphinx-bootstrap para las páginas HTML de la documentación de los usuarios" msgid "EN" msgstr "" @@ -9452,12 +7165,8 @@ msgstr "Uso de ``make`` para compilar el código y la documentación" msgid "The following instructions start from ``path/to/pgrouting/build``" msgstr "Las siguientes instrucciones comienzan desde *path/to/pgrouting/build*" -msgid "" -"We have tested on several platforms, For installing or reinstalling all the " -"steps are needed." -msgstr "" -"Hemos probado en varias plataformas, Para instalar o reinstalar todos los " -"pasos son necesarios." +msgid "We have tested on several platforms, For installing or reinstalling all the steps are needed." +msgstr "Hemos probado en varias plataformas, Para instalar o reinstalar todos los pasos son necesarios." msgid "Linux" msgstr "Linux" @@ -9470,37 +7179,13 @@ msgid "Testing" msgstr "Pruebas" msgid "Currently there is no :code:`make test` and testing is done as follows" -msgstr "" -"Actualmente no hay :code:`make test` y las pruebas se realizan de la " -"siguiente manera" +msgstr "Actualmente no hay :code:`make test` y las pruebas se realizan de la siguiente manera" -msgid "" -"pgRouting is an extension of `PostGIS `__ and " -"`PostgreSQL `__ geospatial database and adds " -"routing and other network analysis functionality. A predecessor of pgRouting " -"– pgDijkstra, written by Sylvain Pasche from `Camptocamp `__, was later extended by Orkney and renamed to pgRouting. The project " -"is now supported and maintained by `Georepublic `__, `Paragon Corporation `__ and " -"a broad user community." -msgstr "" -"pgRouting es una extensión de la base de datos geoespacial `PostGIS `__ y `PostgreSQL `__ y agrega ruteo " -"y otras funciones de análisis de redes. Un predecesor de pgRouting – " -"pgDijkstra, escrito por Sylvain Pasche de `Camptocamp `__, fue más tarde extendido por Orkney y renombrado a pgRouting. El " -"proyecto ahora es apoyado y mantenido por Georepublic `__, `Paragon Corporation `__ y " -"una amplia comunidad de usuarios." +msgid "pgRouting is an extension of `PostGIS `__ and `PostgreSQL `__ geospatial database and adds routing and other network analysis functionality. A predecessor of pgRouting – pgDijkstra, written by Sylvain Pasche from `Camptocamp `__, was later extended by Orkney and renamed to pgRouting. The project is now supported and maintained by `Georepublic `__, `Paragon Corporation `__ and a broad user community." +msgstr "pgRouting es una extensión de la base de datos geoespacial `PostGIS `__ y `PostgreSQL `__ y agrega ruteo y otras funciones de análisis de redes. Un predecesor de pgRouting – pgDijkstra, escrito por Sylvain Pasche de `Camptocamp `__, fue más tarde extendido por Orkney y renombrado a pgRouting. El proyecto ahora es apoyado y mantenido por Georepublic `__, `Paragon Corporation `__ y una amplia comunidad de usuarios." -msgid "" -"pgRouting is part of `OSGeo Community Projects `__ from the `OSGeo Foundation `__ and included on `OSGeoLive `__." -msgstr "" -"pgRouting es parte de la `Comunidad de Proyectos de OSGeo ` __ de la `Fundación OSGeo ` __ y se incluye en`OSGeoLive `__." +msgid "pgRouting is part of `OSGeo Community Projects `__ from the `OSGeo Foundation `__ and included on `OSGeoLive `__." +msgstr "pgRouting es parte de la `Comunidad de Proyectos de OSGeo ` __ de la `Fundación OSGeo ` __ y se incluye en`OSGeoLive `__." msgid "Licensing" msgstr "Licencias" @@ -9514,47 +7199,26 @@ msgstr "**Licencia**" msgid "GNU General Public License v2.0 or later" msgstr "Licencia Pública General GNU v2.0 o posterior" -msgid "" -"Most features of pgRouting are available under `GNU General Public License " -"v2.0 or later `_." -msgstr "" -"La mayoría de las características de pgRouting están disponibles en " -"`Licencia Pública General v2.0 o posterior `_." +msgid "Most features of pgRouting are available under `GNU General Public License v2.0 or later `_." +msgstr "La mayoría de las características de pgRouting están disponibles en `Licencia Pública General v2.0 o posterior `_." msgid "Boost Software License - Version 1.0" msgstr "Licencia de Software Boost - Version 1.0" -msgid "" -"Some Boost extensions are available under `Boost Software License - Version " -"1.0 `_." -msgstr "" -"Algunas extensiones de Boost están disponibles bajo `Boost Software License " -"- Version 1.0 `_." +msgid "Some Boost extensions are available under `Boost Software License - Version 1.0 `_." +msgstr "Algunas extensiones de Boost están disponibles bajo `Boost Software License - Version 1.0 `_." msgid "MIT-X License" msgstr "Licencia MIT-X" -msgid "" -"Some code contributed by iMaptools.com is available under MIT-X license." -msgstr "" -"Parte del código es contribución de iMaptools.com y está disponibe bajo la " -"licencia MIT-X." - -msgid "" -"The pgRouting Manual is licensed under a `Creative Commons Attribution-Share " -"Alike 3.0 License `_." -msgstr "" -"El Manual de pgRouting está disponible bajo una licencia `Creative Commons " -"Attribution-Share Alike 3.0 License `_." +msgid "Some code contributed by iMaptools.com is available under MIT-X license." +msgstr "Parte del código es contribución de iMaptools.com y está disponibe bajo la licencia MIT-X." -msgid "" -"In general license information should be included in the header of each " -"source file." -msgstr "" -"En general, la información de las licencias debe estar incluida en la " -"cabecera de cada archivo de origen." +msgid "The pgRouting Manual is licensed under a `Creative Commons Attribution-Share Alike 3.0 License `_." +msgstr "El Manual de pgRouting está disponible bajo una licencia `Creative Commons Attribution-Share Alike 3.0 License `_." + +msgid "In general license information should be included in the header of each source file." +msgstr "En general, la información de las licencias debe estar incluida en la cabecera de cada archivo de origen." msgid "Contributors" msgstr "Colaboradores" @@ -9570,14 +7234,8 @@ msgstr "Elementos de esta versión v3.7.x (por orden alfabético)" msgid "Bipasha Gayary, Fan Wu, Regina Obe, Saloni kumari, Vicky Vergara" msgstr "Regina Obe, Vicky Vergara" -msgid "" -"And all the people that give us a little of their time making comments, " -"finding issues, making pull requests etc. in any of our products: " -"osm2pgrouting, pgRouting, pgRoutingLayer, workshop." -msgstr "" -"Y a toda la gente que nos regala un poco de su tiempo haciendo comentarios, " -"encontrando problemas, haciendo pull requests etc. en cualquiera de nuestros " -"productos: osm2pgrouting, pgRouting, pgRoutingLayer, workshop." +msgid "And all the people that give us a little of their time making comments, finding issues, making pull requests etc. in any of our products: osm2pgrouting, pgRouting, pgRoutingLayer, workshop." +msgstr "Y a toda la gente que nos regala un poco de su tiempo haciendo comentarios, encontrando problemas, haciendo pull requests etc. en cualquiera de nuestros productos: osm2pgrouting, pgRouting, pgRoutingLayer, workshop." #, fuzzy msgid "Translators (in alphabetical order)" @@ -9605,13 +7263,8 @@ msgstr "" msgid "Corporate Sponsors in this release (in alphabetical order)" msgstr "Patrocinadores corporativos de este lanzamiento (en orden alfabético)" -msgid "" -"These are corporate entities that have contributed developer time, hosting, " -"or direct monetary funding to the pgRouting project:" -msgstr "" -"Estas son las entidades corporativas que han contribuido con tiempo de " -"desarrollo, alojamiento, o financiamiento monetario directo al proyecto de " -"pgRouting:" +msgid "These are corporate entities that have contributed developer time, hosting, or direct monetary funding to the pgRouting project:" +msgstr "Estas son las entidades corporativas que han contribuido con tiempo de desarrollo, alojamiento, o financiamiento monetario directo al proyecto de pgRouting:" msgid "`OSGeo `__" msgstr "`OSGeo `__" @@ -9636,33 +7289,8 @@ msgid "Individuals (in alphabetical order)" msgstr "Personas (en orden alfabético)" #, fuzzy -msgid "" -"Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio " -"Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf " -"Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, " -"Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, " -"Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, " -"Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu " -"Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko " -"Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim " -"Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish " -"Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni " -"Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen " -"Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, " -"Vidhan Jain, Virginia Vergara, Yige Huang" -msgstr "" -"Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio " -"Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf " -"Hossain, Ashish Kumar, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, " -"Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, " -"Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, " -"Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, " -"Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin " -"Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul " -"Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith " -"Reddy, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, " -"Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, " -"Virginia Vergara, Yige Huang" +msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" +msgstr "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, 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 "Corporate Sponsors (in alphabetical order)" msgstr "Patrocinadores corporativos (en orden alfabético)" @@ -9706,23 +7334,14 @@ msgstr "Versaterm Inc." msgid "More Information" msgstr "Más Información" -msgid "" -"The latest software, documentation and news items are available at the " -"pgRouting web site https://pgrouting.org." -msgstr "" -"Lo último en software, documentación y noticias, se encuentra disponible en " -"el sitio web de pgRouting https://pgrouting.org." +msgid "The latest software, documentation and news items are available at the pgRouting web site https://pgrouting.org." +msgstr "Lo último en software, documentación y noticias, se encuentra disponible en el sitio web de pgRouting https://pgrouting.org." -msgid "" -"PostgreSQL database server at the PostgreSQL main site https://www." -"postgresql.org." -msgstr "" -"Servidor de base de datos PostgreSQL en el sitio principal de PostgreSQL " -"https://www.postgresql.org." +msgid "PostgreSQL database server at the PostgreSQL main site https://www.postgresql.org." +msgstr "Servidor de base de datos PostgreSQL en el sitio principal de PostgreSQL https://www.postgresql.org." msgid "PostGIS extension at the PostGIS project web site https://postgis.net." -msgstr "" -"PostGIS extension en el sitio web del projecto PostGIS https://postgis.net." +msgstr "PostGIS extension en el sitio web del projecto PostGIS https://postgis.net." msgid "Boost C++ source libraries at https://www.boost.org." msgstr "Bibliotecas de código Boost C++ en https://www.boost.org." @@ -9781,12 +7400,8 @@ msgstr "Versión 2.0.0" msgid "Official function." msgstr "Función oficial." -msgid "" -"The K shortest path routing algorithm based on Yen's algorithm. \"K\" is the " -"number of shortest paths desired." -msgstr "" -"El algoritmo de ruteo para obtener la ruta más corta K basado en el " -"algoritmo de Yen . \"K\" es el número de rutas más cortas deseadas." +msgid "The K shortest path routing algorithm based on Yen's algorithm. \"K\" is the number of shortest paths desired." +msgstr "El algoritmo de ruteo para obtener la ruta más corta K basado en el algoritmo de Yen . \"K\" es el número de rutas más cortas deseadas." msgid "|Boost| Boost Graph Inside" msgstr "|Boost| Adentro: Boost Graph" @@ -9802,27 +7417,19 @@ msgid "Summary" msgstr "Resumen" msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vid**, **K**, [**options**])" -msgstr "" -"pgr_KSP(`SQL de aristas`_, **salida**, **destino**, **K**, [**opciones**])" +msgstr "pgr_KSP(`SQL de aristas`_, **salida**, **destino**, **K**, [**opciones**])" -msgid "" -"pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" -msgstr "" -"pgr_KSP(`SQL de aristas`_, **salida**, **destinos**, **K**, [**opciones**])" +msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" +msgstr "pgr_KSP(`SQL de aristas`_, **salida**, **destinos**, **K**, [**opciones**])" -msgid "" -"pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" -msgstr "" -"pgr_KSP(`SQL de aristas`_, **salidas**, **destino**, **K**, [**opciones**])" +msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" +msgstr "pgr_KSP(`SQL de aristas`_, **salidas**, **destino**, **K**, [**opciones**])" -msgid "" -"pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" -msgstr "" -"pgr_KSP(`SQL de aristas`_, **salidas**, **destinos**, **K**, [**opciones**])" +msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" +msgstr "pgr_KSP(`SQL de aristas`_, **salidas**, **destinos**, **K**, [**opciones**])" msgid "pgr_KSP(`Edges SQL`_, `Combinations SQL`_, **K**, [**options**])" -msgstr "" -"pgr_KSP(`SQL de aristas`_, `SQL de combinaciones`_, **K**, [**opciones**])" +msgstr "pgr_KSP(`SQL de aristas`_, `SQL de combinaciones`_, **K**, [**opciones**])" msgid "**options:** ``[directed, heap_paths]``" msgstr "**opcionales:** ``[directed, heap_paths]``" @@ -9837,29 +7444,16 @@ msgid "Example" msgstr "Ejemplo" msgid "Get 2 paths from :math:`6` to :math:`17` on a directed graph." -msgstr "" -"Obteners 2 caminos desde :math:`6` hasta :math:`17` en un grafo dirigido." +msgstr "Obteners 2 caminos desde :math:`6` hasta :math:`17` en un grafo dirigido." -msgid "" -"Get 2 paths from vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a " -"directed graph." -msgstr "" -"Obtener 2 rutas del vértice :math:`6` a los vértices :math:`\\{10, 17\\}` en " -"un grafo dirigido." +msgid "Get 2 paths from vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph." +msgstr "Obtener 2 rutas del vértice :math:`6` a los vértices :math:`\\{10, 17\\}` en un grafo dirigido." -msgid "" -"Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a " -"directed graph." -msgstr "" -"Obtener 2 rutas de los vértices :math:`\\{6, 1\\}` al vértice :math:`17` en " -"un grafo dirigido." +msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph." +msgstr "Obtener 2 rutas de los vértices :math:`\\{6, 1\\}` al vértice :math:`17` en un grafo dirigido." -msgid "" -"Get 2 paths vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on " -"a directed graph." -msgstr "" -"Obtener 2 rutas los vértices :math:`\\{6, 1\\}` a los vértices :math:`\\{10, " -"17\\}` en un grafo dirigido." +msgid "Get 2 paths vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on a directed graph." +msgstr "Obtener 2 rutas los vértices :math:`\\{6, 1\\}` a los vértices :math:`\\{10, 17\\}` en un grafo dirigido." msgid "Using a combinations table on an directed graph" msgstr "Usando una tabla de combinaciones en un grafo dirigido" @@ -9889,37 +7483,25 @@ msgid "When ``false`` Returns at most K paths." msgstr "Cuando ``false`` Regresa a lo más K caminos." msgid "When ``true`` all the calculated paths while processing are returned." -msgstr "" -"Cuando ``true`` se regresan todos los caminos calulados mientras se procesa." +msgstr "Cuando ``true`` se regresan todos los caminos calulados mientras se procesa." -msgid "" -"Roughly, when the shortest path has ``N`` edges, the heap will contain about " -"than ``N * K`` paths for small value of ``K`` and ``K > 5``." -msgstr "" -"Aproximadamente, si la ruta más corta tiene ``N`` aristas, las procesadas " -"contendrán aproximadamente ``N * K`` rutas para valores pequeños de ``K`` y " -"``K > 5``." +msgid "Roughly, when the shortest path has ``N`` edges, the heap will contain about than ``N * K`` paths for small value of ``K`` and ``K > 5``." +msgstr "Aproximadamente, si la ruta más corta tiene ``N`` aristas, las procesadas contendrán aproximadamente ``N * K`` rutas para valores pequeños de ``K`` y ``K > 5``." msgid "Additional Examples" msgstr "Ejemplos Adicionales" msgid "Get 2 paths from :math:`6` to :math:`17` on an undirected graph" -msgstr "" -"Obteners 2 caminos desde :math:`6` hasta :math:`17` en un grafo no dirigido" +msgstr "Obteners 2 caminos desde :math:`6` hasta :math:`17` en un grafo no dirigido" msgid "Also get the paths in the heap." msgstr "También obtener los caminos procesados." msgid "Get 2 paths using combinations table on an undirected graph" -msgstr "" -"Obtener dos rutas usando una tabla de combinaciones en un grafo no dirigido" +msgstr "Obtener dos rutas usando una tabla de combinaciones en un grafo no dirigido" -msgid "" -"Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a " -"undirected graph." -msgstr "" -"Obtener 2 rutas de los vértices :math:`\\{6, 1\\}` al vértice :math:`17` en " -"un grafo no dirigido." +msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a undirected graph." +msgstr "Obtener 2 rutas de los vértices :math:`\\{6, 1\\}` al vértice :math:`17` en un grafo no dirigido." msgid "https://en.wikipedia.org/wiki/K_shortest_path_routing" msgstr "https://en.wikipedia.org/wiki/K_shortest_path_routing" @@ -9936,26 +7518,14 @@ msgstr "Disponibilidad:" msgid "Version 3.2.1" msgstr "Versión 3.2.1" -msgid "" -"Metric Algorithm from `Boost library `__" -msgstr "" -"Algoritmo Metrico de la `Librería Boost `__" +msgid "Metric Algorithm from `Boost library `__" +msgstr "Algoritmo Metrico de la `Librería Boost `__" msgid "Simulated Annealing Algorithm no longer supported" msgstr "El algoritmo de recocido simulado ya no es utilizado" -msgid "" -"The Simulated Annealing Algorithm related parameters are ignored: " -"`max_processing_time`, `tries_per_temperature`, " -"`max_changes_per_temperature`, `max_consecutive_non_changes`, " -"`initial_temperature`, `final_temperature`, `cooling_factor`, `randomize`" -msgstr "" -"Se ignoran los parámetros relacionados con el algoritmo de recocido " -"simulado: `max_processing_time`, `tries_per_temperature`, " -"`max_changes_per_temperature`, `max_consecutive_non_changes`, " -"`initial_temperature`, `final_temperature`, `cooling_factor`, `randomize`" +msgid "The Simulated Annealing Algorithm related parameters are ignored: `max_processing_time`, `tries_per_temperature`, `max_changes_per_temperature`, `max_consecutive_non_changes`, `initial_temperature`, `final_temperature`, `cooling_factor`, `randomize`" +msgstr "Se ignoran los parámetros relacionados con el algoritmo de recocido simulado: `max_processing_time`, `tries_per_temperature`, `max_changes_per_temperature`, `max_consecutive_non_changes`, `initial_temperature`, `final_temperature`, `cooling_factor`, `randomize`" msgid "Version 2.3.0" msgstr "Versión 2.3.0" @@ -9966,12 +7536,8 @@ msgstr "" msgid "Negative costs are ignored." msgstr "Costos negativos son ignorados." -msgid "" -"Can be Used with :doc:`costMatrix-category` functions preferably with " -"`directed => false`." -msgstr "" -"Se puede utilizar con funciones :doc:`costMatrix-category` preferiblemente " -"con `directed => false`." +msgid "Can be Used with :doc:`costMatrix-category` functions preferably with `directed => false`." +msgstr "Se puede utilizar con funciones :doc:`costMatrix-category` preferiblemente con `directed => false`." msgid "With ``directed => false``" msgstr "Con ``directed => false``" @@ -9983,118 +7549,70 @@ msgid "is undirected" msgstr "es no dirigido" msgid "is fully connected (As long as the graph has one component)" -msgstr "" -"está completamente conectado (siempre que el grafo tenga un componente)" +msgstr "está completamente conectado (siempre que el grafo tenga un componente)" msgid "all traveling costs on edges obey the triangle inequality." -msgstr "" -"todos los costos de viaje en los segmentos vumplen con la desigualdad del " -"triángulo." +msgstr "todos los costos de viaje en los segmentos vumplen con la desigualdad del triángulo." msgid "When ``start_vid = 0 OR end_vid = 0``" msgstr "Cuando ``start_vid = 0 Ó end_vid = 0``" #, fuzzy -msgid "" -"The solutions generated are guaranteed to be *twice as long as the optimal " -"tour in the worst case*" -msgstr "" -"Las soluciones generadas están garantizadas para ser *el doble de largas que " -"el recorrido óptimo en el peor de los casos*" +msgid "The solutions generated are guaranteed to be *twice as long as the optimal tour in the worst case*" +msgstr "Las soluciones generadas están garantizadas para ser *el doble de largas que el recorrido óptimo en el peor de los casos*" msgid "When ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``" msgstr "Cuando ``start_vid != 0 Y end_vid != 0 Y start_vid != end_vid``" #, fuzzy -msgid "" -"It is **not guaranteed** that the solution will be, in the worst case, twice " -"as long as the optimal tour, due to the fact that `end_vid` is forced to be " -"in a fixed position." -msgstr "" -"**No está garantizado** que la solución sea, en el peor de los casos, el " -"doble de larga que el recorrido óptimo, debido al hecho de que `end_vid` se " -"ve obligado a estar en una posición fija." +msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour, due to the fact that `end_vid` is forced to be in a fixed position." +msgstr "**No está garantizado** que la solución sea, en el peor de los casos, el doble de larga que el recorrido óptimo, debido al hecho de que `end_vid` se ve obligado a estar en una posición fija." msgid "With ``directed => true``" msgstr "Con ``directed => true``" #, fuzzy -msgid "" -"It is **not guaranteed** that the solution will be, in the worst case, twice " -"as long as the optimal tour" -msgstr "" -"**No está garantizado** que la solución sea, en el peor de los casos, el " -"doble de larga que el recorrido óptimo" +msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour" +msgstr "**No está garantizado** que la solución sea, en el peor de los casos, el doble de larga que el recorrido óptimo" msgid "is directed" msgstr "es dirigido" -msgid "" -"some (or all) traveling costs on edges might not obey the triangle " -"inequality." -msgstr "" -"algunos (o todos) los costos de viaje en los segmentos podrían no obedecer a " -"la desigualdad del triángulo." +msgid "some (or all) traveling costs on edges might not obey the triangle inequality." +msgstr "algunos (o todos) los costos de viaje en los segmentos podrían no obedecer a la desigualdad del triángulo." -msgid "" -"As an undirected graph is required, the directed graph is transformed as " -"follows:" -msgstr "" -"Como se requiere un grafo no dirigido, el grafo dirigido se transforma de la " -"siguiente manera:" +msgid "As an undirected graph is required, the directed graph is transformed as follows:" +msgstr "Como se requiere un grafo no dirigido, el grafo dirigido se transforma de la siguiente manera:" -msgid "" -"edges `(u, v)` and `(v, u)` is considered to be the same edge (denoted `(u, " -"v)`" -msgstr "" -"los segmentos `(u, v)` y `(v, u)` se consideran el mismo segmentos (denotado " -"`(u, v)`" +msgid "edges `(u, v)` and `(v, u)` is considered to be the same edge (denoted `(u, v)`" +msgstr "los segmentos `(u, v)` y `(v, u)` se consideran el mismo segmentos (denotado `(u, v)`" msgid "if ``agg_cost`` differs between one or more instances of edge `(u, v)`" -msgstr "" -"Si '``agg_cost`` difiere entre una o más instancias del segmento `(u, v)`" +msgstr "Si '``agg_cost`` difiere entre una o más instancias del segmento `(u, v)`" -msgid "" -"The minimum value of the ``agg_cost`` all instances of edge `(u, v)` is " -"going to be considered as the ``agg_cost`` of edge `(u, v)`" -msgstr "" -"El valor mínimo de ``agg_cost`` en todas las instancias de la arista `(u, " -"v)` se considera como el ``agg_cost`` de la arista `(u, v)`" +msgid "The minimum value of the ``agg_cost`` all instances of edge `(u, v)` is going to be considered as the ``agg_cost`` of edge `(u, v)`" +msgstr "El valor mínimo de ``agg_cost`` en todas las instancias de la arista `(u, v)` se considera como el ``agg_cost`` de la arista `(u, v)`" -msgid "" -"Some (or all) traveling costs on edges will still might not obey the " -"triangle inequality." -msgstr "" -"Algunos (o todos) los costos de viaje en los segmentos aún podrían no " -"obedecer a la desigualdad del triángulo." +msgid "Some (or all) traveling costs on edges will still might not obey the triangle inequality." +msgstr "Algunos (o todos) los costos de viaje en los segmentos aún podrían no obedecer a la desigualdad del triángulo." -msgid "" -"When the data does not come from an undirected graph or its not fully " -"connected:" +msgid "When the data does not come from an undirected graph or its not fully connected:" msgstr "" #, fuzzy msgid "Missing values will be calculated with dijkstra algorithm." -msgstr "" -"los datos están incompletos se calcularán con el algoritmo de Dijkstra." +msgstr "los datos están incompletos se calcularán con el algoritmo de Dijkstra." msgid "When the graph has more than one component:" msgstr "Cuando el grafo tiene más de un componente:" -msgid "" -"``start_vid`` or ``end_vid`` are defined and are on the same component: the " -"TSP tour will happen on that component." +msgid "``start_vid`` or ``end_vid`` are defined and are on the same component: the TSP tour will happen on that component." msgstr "" -msgid "" -"``start_vid`` or ``end_vid`` are defined and are not on the same component: " -"the TSP tour will propose a tour that has both components where connecting " -"costs are estimated." +msgid "``start_vid`` or ``end_vid`` are defined and are not on the same component: the TSP tour will propose a tour that has both components where connecting costs are estimated." msgstr "" -msgid "" -"``start_vid`` or ``end_vid`` are not defined: the starting point could be on " -"any component and will include data only from that component." +msgid "``start_vid`` or ``end_vid`` are not defined: the starting point could be on any component and will include data only from that component." msgstr "" msgid "One cycle attempt to remove crossing edges is done to the TSP results." @@ -10107,15 +7625,10 @@ msgid "Returns set of |tsp-result|" msgstr "Regresa el conjunto de |nksp-result|" msgid "Using :doc:`pgr_dijkstraCostMatrix` to generate the matrix information" -msgstr "" -"Usando :doc:`pgr_dijkstraCostMatrix` para generar la información de la matriz" +msgstr "Usando :doc:`pgr_dijkstraCostMatrix` para generar la información de la matriz" -msgid "" -"**Line 4** Vertices :math:`\\{2, 4, 13, 14\\}` are not included because they " -"are not connected." -msgstr "" -"**Línea 5** Los vértices :math:`\\{2, 4, 13, 14\\}` no están incluidos " -"porque no están conectados." +msgid "**Line 4** Vertices :math:`\\{2, 4, 13, 14\\}` are not included because they are not connected." +msgstr "**Línea 5** Los vértices :math:`\\{2, 4, 13, 14\\}` no están incluidos porque no están conectados." msgid "`Matrix SQL`_ as described below" msgstr "`SQL de matriz`_ como se describe más adelante" @@ -10141,12 +7654,8 @@ msgstr "**node**" msgid "Identifier of the node/coordinate/point." msgstr "Identificador del nodo/coordenada/punto." -msgid "" -"Cost to traverse from the current ``node`` to the next ``node`` in the path " -"sequence." -msgstr "" -"Coste que se debe recorrer desde el ``nodo`` al siguiente ``nodo`` en la " -"secuencia de ruta." +msgid "Cost to traverse from the current ``node`` to the next ``node`` in the path sequence." +msgstr "Coste que se debe recorrer desde el ``nodo`` al siguiente ``nodo`` en la secuencia de ruta." msgid "``0`` for the last row in the tour sequence." msgstr "``0`` para la última fila en la secuencia del recorrido." @@ -10170,31 +7679,18 @@ msgstr "Uso de puntos de interés para generar una matriz asimétrica." msgid "To generate an asymmetric matrix:" msgstr "Para generar una matriz asimétrica:" -msgid "" -"**Line 4** The ``side`` information of ``pointsOfInterset`` is ignored by " -"not including it in the query" -msgstr "" -"**Línea 4** La información ``side`` de ``pointsOfInterset`` se ignora al no " -"incluirla en la consulta" +msgid "**Line 4** The ``side`` information of ``pointsOfInterset`` is ignored by not including it in the query" +msgstr "**Línea 4** La información ``side`` de ``pointsOfInterset`` se ignora al no incluirla en la consulta" #, fuzzy msgid "**Line 6** Generating an asymmetric matrix with ``directed => true``" -msgstr "" -"**Línea 6** Generación de una matriz asimétrica con ``directed => true``" +msgstr "**Línea 6** Generación de una matriz asimétrica con ``directed => true``" -msgid "" -":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered as " -"the ``agg_cost``" -msgstr "" -":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` se considera como el " -"``agg_cost``" +msgid ":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered as the ``agg_cost``" +msgstr ":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` se considera como el ``agg_cost``" -msgid "" -"The solution that can be larger than *twice as long as the optimal tour* " -"because:" -msgstr "" -"La solución que puede ser mayor que *el doble de larga que el tour óptimo* " -"porque:" +msgid "The solution that can be larger than *twice as long as the optimal tour* because:" +msgstr "La solución que puede ser mayor que *el doble de larga que el tour óptimo* porque:" msgid "Triangle inequality might not be satisfied." msgstr "La desigualdad del triángulo podría no estar satisfecha." @@ -10205,19 +7701,11 @@ msgstr "``start_id != 0 Y end_id != 0``" msgid "Connected incomplete data" msgstr "Datos incompletos conectados" -msgid "" -"Using selected edges :math:`\\{2, 4, 5, 8, 9, 15\\}` the matrix is not " -"complete." -msgstr "" -"Usando aristas seleccionadas :math:`\\{2, 4, 5, 8, 9, 15\\}` la matriz no es " -"completa." +msgid "Using selected edges :math:`\\{2, 4, 5, 8, 9, 15\\}` the matrix is not complete." +msgstr "Usando aristas seleccionadas :math:`\\{2, 4, 5, 8, 9, 15\\}` la matriz no es completa." -msgid "" -"Cost value for :math:`17 \\rightarrow 10` do not exist on the matrix, but " -"the value used is taken from :math:`10 \\rightarrow 17`." -msgstr "" -"Valor del cost para :math:`17 \\rightarrow 10` no existe en la matriz, pero " -"el valor se toma de :math:`10 \\rightarrow 17`." +msgid "Cost value for :math:`17 \\rightarrow 10` do not exist on the matrix, but the value used is taken from :math:`10 \\rightarrow 17`." +msgstr "Valor del cost para :math:`17 \\rightarrow 10` no existe en la matriz, pero el valor se toma de :math:`10 \\rightarrow 17`." msgid "``pgr_TSPeuclidean``" msgstr "``pgr_TSPeuclidean``" @@ -10225,12 +7713,8 @@ msgstr "``pgr_TSPeuclidean``" msgid "``pgr_TSPeuclidean`` - Approximation using *metric* algorithm." msgstr "``pgr_TSPeuclidean`` - Aproximación usando el algoritmo *métrico*." -msgid "" -"Using `Boost: metric TSP approx `__" -msgstr "" -"Usando `Boost: Algoritmo de aproximación Métrica de TSP `__" +msgid "Using `Boost: metric TSP approx `__" +msgstr "Usando `Boost: Algoritmo de aproximación Métrica de TSP `__" msgid "Name change from pgr_eucledianTSP" msgstr "Cambio de nombre de pgr_eucledianTSP" @@ -10241,24 +7725,14 @@ msgstr "Nueva función oficial." msgid "Results change depending on input order of the `Coordinates SQL`_" msgstr "" -msgid "" -"Any duplicated identifier will be ignored. The coordinates that will be kept " -"is arbitrarily." -msgstr "" -"Cualquier identificador duplicado será ignorado. Las coordenadas que se " -"mantendrán son arbitrarias." +msgid "Any duplicated identifier will be ignored. The coordinates that will be kept is arbitrarily." +msgstr "Cualquier identificador duplicado será ignorado. Las coordenadas que se mantendrán son arbitrarias." -msgid "" -"The coordinates are quite similar for the same identifier, for example ::" -msgstr "" -"Las coordenadas son bastante similares para el mismo identificador, por " -"ejemplo:" +msgid "The coordinates are quite similar for the same identifier, for example ::" +msgstr "Las coordenadas son bastante similares para el mismo identificador, por ejemplo:" -msgid "" -"The coordinates are quite different for the same identifier, for example ::" -msgstr "" -"Las coordenadas son bastante diferentes para el mismo identificador, por " -"ejemplo:" +msgid "The coordinates are quite different for the same identifier, for example ::" +msgstr "Las coordenadas son bastante diferentes para el mismo identificador, por ejemplo:" msgid "pgr_TSPeuclidean(`Coordinates SQL`_, ``[start_id, end_id]``)" msgstr "pgr_TSPeuclidean(`SQL de Coordenadas`_, ``[start_id, end_id]``)" @@ -10290,16 +7764,8 @@ msgstr "Valor Y de la coordenada." msgid "Test 29 cities of Western Sahara" msgstr "Prueba 29 ciudades del Sáhara Occidental" -msgid "" -"This example shows how to make performance tests using University of " -"Waterloo's `example data `__ using the 29 cities of `Western Sahara dataset `__" -msgstr "" -"Este ejemplo muestra cómo hacer pruebas de rendimiento utilizando los `datos " -"de ejemplo `__ de la " -"Universidad de Waterloo utilizando el conjunto de datos de 29 ciudades del " -"`Sáhara Occidental `__" +msgid "This example shows how to make performance tests using University of Waterloo's `example data `__ using the 29 cities of `Western Sahara dataset `__" +msgstr "Este ejemplo muestra cómo hacer pruebas de rendimiento utilizando los `datos de ejemplo `__ de la Universidad de Waterloo utilizando el conjunto de datos de 29 ciudades del `Sáhara Occidental `__" msgid "Creating a table for the data and storing the data" msgstr "Creación de una tabla para datos y almacenamiento de los datos" @@ -10310,12 +7776,8 @@ msgstr "Agregar una geometría (con fines visuales)" msgid "Total tour cost" msgstr "Costo total del tour" -msgid "" -"Getting a total cost of the tour, compare the value with the length of an " -"optimal tour is 27603, given on the dataset" -msgstr "" -"Al obtener un costo total del recorrido, comparar el valor con la duración " -"de un recorrido óptimo, que es 27603, dado en el conjunto de datos" +msgid "Getting a total cost of the tour, compare the value with the length of an optimal tour is 27603, given on the dataset" +msgstr "Al obtener un costo total del recorrido, comparar el valor con la duración de un recorrido óptimo, que es 27603, dado en el conjunto de datos" msgid "Getting a geometry of the tour" msgstr "Obtener una geometría del recorrido" @@ -10324,14 +7786,8 @@ msgid "Visual results" msgstr "Resultados visuales" #, fuzzy -msgid "" -"Visually, The first image is the `optimal solution `__ and the second image is the solution " -"obtained with ``pgr_TSPeuclidean``." -msgstr "" -"Visualmente, la primera imagen es la `solución óptima `__ y la segunda imagen es la solución " -"obtenida con ``pgr_TSPeuclidean``." +msgid "Visually, The first image is the `optimal solution `__ and the second image is the solution obtained with ``pgr_TSPeuclidean``." +msgstr "Visualmente, la primera imagen es la `solución óptima `__ y la segunda imagen es la solución obtenida con ``pgr_TSPeuclidean``." msgid "``pgr_aStar`` — Shortest path using the A* algorithm." msgstr "``pgr_aStar`` — La ruta más corta utilizando el algoritmo A*." @@ -10341,8 +7797,7 @@ msgid "Standardizing output columns to |short-generic-result|" msgstr "Estandarización de las columnas de salida a |short-generic-result|" msgid "pgr_aStar(One to One) added ``start_vid`` and ``end_vid`` columns." -msgstr "" -"pgr_aStar(Uno a Uno) ha añadido las columnas ``start_vid`` y ``end_vid``." +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``." @@ -10371,29 +7826,20 @@ msgstr "pgr_aStar(Muchos a Muchos)" msgid "Signature change on pgr_aStar(One to One)" msgstr "Cambio de firma en pgr_aStar(Uno a Uno)" -msgid "" -"The results are equivalent to the union of the results of the `pgr_aStar(` " -"`One to One`_ `)` on the:" -msgstr "" -"Los resultados son equivalentes a la unión de los resultados de " -"pgr_aStar( `Uno a Uno`_ ) en:" +msgid "The results are equivalent to the union of the results of the `pgr_aStar(` `One to One`_ `)` on the:" +msgstr "Los resultados son equivalentes a la unión de los resultados de pgr_aStar( `Uno a Uno`_ ) en:" msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgstr "" -"pgr_aStar(`SQL de aristas`_, **salida**, **destino**, **K**, [**opciones**])" +msgstr "pgr_aStar(`SQL de aristas`_, **salida**, **destino**, **K**, [**opciones**])" msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "" -"pgr_aStar(`SQL de aristas`_, **salida**, **destinos**, **K**, [**opciones**])" +msgstr "pgr_aStar(`SQL de aristas`_, **salida**, **destinos**, **K**, [**opciones**])" msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "" -"pgr_aStar(`SQL de aristas`_, **salidas**, **destino**, **K**, [**opciones**])" +msgstr "pgr_aStar(`SQL de aristas`_, **salidas**, **destino**, **K**, [**opciones**])" msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "" -"pgr_aStar(`SQL de aristas`_, **salidas**, **destinos**, **K**, " -"[**opciones**])" +msgstr "pgr_aStar(`SQL de aristas`_, **salidas**, **destinos**, **K**, [**opciones**])" msgid "pgr_aStar(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "pgr_aStar(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])" @@ -10405,43 +7851,22 @@ msgid "Returns set of |short-generic-result|" msgstr "Regresa el conjunto de |short-generic-result|" msgid "Optional parameters are `named parameters` and have a default value." -msgstr "" -"Los parámetros opcionales son `parámetros con nombre` y tienen un valor " -"predeterminado." +msgstr "Los parámetros opcionales son `parámetros con nombre` y tienen un valor predeterminado." -msgid "" -"From vertex :math:`6` to vertex :math:`12` on a **directed** graph with " -"heuristic :math:`2`" -msgstr "" -"De vértice :math:`6` a vértice :math:`12` en un grafo **dirigido** usando la " -"heurística :math:`2`" +msgid "From vertex :math:`6` to vertex :math:`12` on a **directed** graph with heuristic :math:`2`" +msgstr "De vértice :math:`6` a vértice :math:`12` en un grafo **dirigido** usando la heurística :math:`2`" -msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 12\\}` on a **directed** " -"graph with heuristic :math:`3` and factor :math:`3.5`" -msgstr "" -"Desde el vértice :math:`6` a los vértices :math:`\\{12, 10\\}` en un grafo " -"**dirigido** usando la heurística :math:`3` con factor :math:`3.5`" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 12\\}` on a **directed** graph with heuristic :math:`3` and factor :math:`3.5`" +msgstr "Desde el vértice :math:`6` a los vértices :math:`\\{12, 10\\}` en un grafo **dirigido** usando la heurística :math:`3` con factor :math:`3.5`" -msgid "" -"From vertices :math:`\\{6, 8\\}` to vertex :math:`10` on an **undirected** " -"graph with heuristic :math:`4`" -msgstr "" -"De los vértices :math:`\\{6, 8\\}` al vértice :math:`10` en un grafo **no " -"dirigido** usando la heurística :math:`4`" +msgid "From vertices :math:`\\{6, 8\\}` to vertex :math:`10` on an **undirected** graph with heuristic :math:`4`" +msgstr "De los vértices :math:`\\{6, 8\\}` al vértice :math:`10` en un grafo **no dirigido** usando la heurística :math:`4`" -msgid "" -"From vertices :math:`\\{6, 8\\}` to vertices :math:`\\{10, 12\\}` on a " -"**directed** graph with factor :math:`0.5`" -msgstr "" -"De los vértices :math:`\\{6, 8\\}` a los vértices :math:`\\{10, 12\\}` en un " -"gráfico **dirigido** con factor :math:`0.5`" +msgid "From vertices :math:`\\{6, 8\\}` to vertices :math:`\\{10, 12\\}` on a **directed** graph with factor :math:`0.5`" +msgstr "De los vértices :math:`\\{6, 8\\}` a los vértices :math:`\\{10, 12\\}` en un gráfico **dirigido** con factor :math:`0.5`" -msgid "" -"Using a combinations table on a **directed** graph with factor :math:`0.5`." -msgstr "" -"Usando una tabla de combinaciones en un grafo **dirigido** con factor :math:" -"`0.5`." +msgid "Using a combinations table on a **directed** graph with factor :math:`0.5`." +msgstr "Usando una tabla de combinaciones en un grafo **dirigido** con factor :math:`0.5`." msgid "Example 1" msgstr "Ejemplo 1" @@ -10464,11 +7889,8 @@ msgstr "Manualmente asignar combinaciones de vértices." msgid "``pgr_aStarCost``" msgstr "``pgr_aStarCost``" -msgid "" -"``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." -msgstr "" -"``pgr_aStarCost`` - Coste total del camino más corto utilizando el algoritmo " -"A*." +msgid "``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." +msgstr "``pgr_aStarCost`` - Coste total del camino más corto utilizando el algoritmo A*." msgid "pgr_aStarCost(Combinations)" msgstr "pgr_aStarCost(Combinaciones)" @@ -10477,19 +7899,11 @@ msgid "New proposed function." msgstr "Nueva función propuesta." #, fuzzy -msgid "" -"The ``pgr_aStarCost`` function summarizes the cost of the shortest path " -"using the A* algorithm." -msgstr "" -"La función ``pgr_aStarCost`` suma el coste del camino más corto utilizando " -"el algoritmo A*." +msgid "The ``pgr_aStarCost`` function summarizes the cost of the shortest path using the A* algorithm." +msgstr "La función ``pgr_aStarCost`` suma el coste del camino más corto utilizando el algoritmo A*." -msgid "" -"Let be the case the values returned are stored in a table, so the unique " -"index would be the pair: `(start_vid, end_vid)`" -msgstr "" -"Sea el caso de que los resultados se almacenen en una tabla, el índice unico " -"lo conformarían el par `(start_vid, end_vid)`" +msgid "Let be the case the values returned are stored in a table, so the unique index would be the pair: `(start_vid, end_vid)`" +msgstr "Sea el caso de que los resultados se almacenen en una tabla, el índice unico lo conformarían el par `(start_vid, end_vid)`" msgid "For undirected graphs, the results are symmetric." msgstr "Para grafos no dirigidos, los resultados son simétricos." @@ -10504,42 +7918,31 @@ msgid "`end_vid` ascending" msgstr "`end_vid` ascendente" msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgstr "" -"pgr_aStarCost(`SQL de aristas`_, **salida**, **destino**, [**opciones**])" +msgstr "pgr_aStarCost(`SQL de aristas`_, **salida**, **destino**, [**opciones**])" msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "" -"pgr_aStarCost(`SQL de aristas`_, **salida**, **destinos**, [**opciones**])" +msgstr "pgr_aStarCost(`SQL de aristas`_, **salida**, **destinos**, [**opciones**])" msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "" -"pgr_aStarCost(`SQL de aristas`_, **salidas**, **destino**, [**opciones**])" +msgstr "pgr_aStarCost(`SQL de aristas`_, **salidas**, **destino**, [**opciones**])" -msgid "" -"pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "" -"pgr_aStarCost(`SQL de aristas`_, **salidas**, **destinos**, [**opciones**])" +msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "pgr_aStarCost(`SQL de aristas`_, **salidas**, **destinos**, [**opciones**])" msgid "pgr_aStarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "" -"pgr_aStarCost(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])" +msgstr "pgr_aStarCost(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])" msgid "Returns set of |matrix-result|" msgstr "Regresa el conjunto de |matrix-result|" msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [options])" -msgstr "" -"pgr_aStarCost(`SQL de aristas`_, **salidas**, **destinos**, [opciones])" +msgstr "pgr_aStarCost(`SQL de aristas`_, **salidas**, **destinos**, [opciones])" msgid "``pgr_aStarCostMatrix``" msgstr "``pgr_aStarCostMatrix``" -msgid "" -"``pgr_aStarCostMatrix`` - Calculates the a cost matrix using :doc:" -"`pgr_aStar`." -msgstr "" -"``pgr_aStarCostMatrix`` - Calcula la matriz de costes utilizando :doc:" -"`pgr_aStar`." +msgid "``pgr_aStarCostMatrix`` - Calculates the a cost matrix using :doc:`pgr_aStar`." +msgstr "``pgr_aStarCostMatrix`` - Calcula la matriz de costes utilizando :doc:`pgr_aStar`." #, fuzzy msgid "Using internally the :doc:`pgr_aStar` algorithm" @@ -10572,12 +7975,8 @@ msgstr "Cuando el grafo es **no dirigido**, la matriz de costes es simétrica" msgid "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" msgstr "pgr_aStarCostMatrix(`SQL de aristas`_, **salidas**, [**opciones**])" -msgid "" -"Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an " -"**undirected** graph using heuristic :math:`2`" -msgstr "" -"Matriz simétrica de costes para los vértices :math:`\\{5, 6, 10, 15\\}` en " -"un grafo **no dirigido** usando la heurística :math:`2`" +msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph using heuristic :math:`2`" +msgstr "Matriz simétrica de costes para los vértices :math:`\\{5, 6, 10, 15\\}` en un grafo **no dirigido** usando la heurística :math:`2`" msgid "Use with :doc:`pgr_TSP`" msgstr "Uso con :doc:`pgr_TSP`" @@ -10585,12 +7984,8 @@ msgstr "Uso con :doc:`pgr_TSP`" msgid "``pgr_articulationPoints``" msgstr "``pgr_articulationPoints``" -msgid "" -"``pgr_articulationPoints`` - Return the articulation points of an undirected " -"graph." -msgstr "" -"``pgr_articulationPoints`` - Devuelve los puntos de articulación de un grafo " -"no dirigido." +msgid "``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" @@ -10598,17 +7993,8 @@ msgstr "Cambio de columnas de resultados: ``seq`` se elimina" msgid "Version 2.5.0" msgstr "Versión 2.5.0" -msgid "" -"Those vertices that belong to more than one biconnected component are called " -"articulation points or, equivalently, cut vertices. Articulation points are " -"vertices whose removal would increase the number of connected components in " -"the graph. This implementation can only be used with an undirected graph." -msgstr "" -"Los vértices que pertenecen a más de un componente biconectado se denominan " -"puntos de articulación o, equivalentemente, corte de vértices. Los puntos de " -"articulación son vértices cuya eliminación aumentaría el número de " -"componentes conectados en el grafo. Esta implementación solo se puede " -"utilizar con un grafo no dirigido." +msgid "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**." @@ -10634,19 +8020,11 @@ msgstr "Nodos en rojo son los puntos de articulación." msgid "Identifier of the vertex." msgstr "Identificador del vértice." -msgid "" -"`Boost: Biconnected components & articulation points `__" -msgstr "" -"`Boost: Componentes biconectados y puntos de articulación `__" +msgid "`Boost: Biconnected components & articulation points `__" +msgstr "`Boost: Componentes biconectados y puntos de articulación `__" -msgid "" -"wikipedia: `Biconnected component `__" -msgstr "" -"wikipedia: `Componentes biconnectados `__" +msgid "wikipedia: `Biconnected component `__" +msgstr "wikipedia: `Componentes biconnectados `__" #, fuzzy msgid "``pgr_bandwidth`` - Experimental" @@ -10655,14 +8033,10 @@ msgstr "``pgr_bipartite`` - Experimental" msgid "``pgr_bandwidth`` - Calculates the bandwidth of the graph" msgstr "" -msgid "" -"Bandwidth measures how \"spread out\" the connections are in a graph when " -"vertices are arranged in a linear order (like numbering them 1, 2, 3, etc.)." +msgid "Bandwidth measures how \"spread out\" the connections are in a graph when vertices are arranged in a linear order (like numbering them 1, 2, 3, etc.)." msgstr "" -msgid "" -"For each edge in the graph, calculate the distance between the vertex " -"numbers it connects" +msgid "For each edge in the graph, calculate the distance between the vertex numbers it connects" msgstr "" msgid "The bandwidth is the maximum of all these distances" @@ -10703,23 +8077,17 @@ msgid "Undirected graph with edges after optimization." msgstr "Grafo no dirigido con aristas tras la optimización." #, fuzzy -msgid "" -"`Boost: bandwidth `_" -msgstr "" -"`Boost: es bipartido `__" +msgid "`Boost: bandwidth `_" +msgstr "`Boost: es bipartido `__" msgid "``pgr_bdAstar``" msgstr "``pgr_bdAstar``" msgid "``pgr_bdAstar`` — Shortest path using the bidirectional A* algorithm." -msgstr "" -"``pgr_bdAstar`` — Devuelve la ruta más corta usando el algoritmo " -"Bidireccional A*." +msgstr "``pgr_bdAstar`` — Devuelve la ruta más corta usando el algoritmo Bidireccional A*." msgid "pgr_bdAstar(One to One) added ``start_vid`` and ``end_vid`` columns." -msgstr "" -"pgr_bdAstar(Uno a Uno) ha añadido las columnas ``start_vid`` y ``end_vid``." +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``." @@ -10743,88 +8111,58 @@ msgid "Signature change on pgr_bdAstar(One to One)" msgstr "Cambio de firma en pgr_bdAstar(Uno a Uno)" #, fuzzy -msgid "" -"The results are equivalent to the union of the results of pgr_bdAStar(One to " -"One) on the:" -msgstr "" -"Los resultados son equivalentes a la unión de los resultados de " -"pgr_bdAStar(Uno a Uno) en:" +msgid "The results are equivalent to the union of the results of pgr_bdAStar(One to One) on the:" +msgstr "Los resultados son equivalentes a la unión de los resultados de pgr_bdAStar(Uno a Uno) en:" msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgstr "" -"pgr_bdAstar(`SQL de aristas`_, **salida**, **destino**, [**opciones**])" +msgstr "pgr_bdAstar(`SQL de aristas`_, **salida**, **destino**, [**opciones**])" msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "" -"pgr_bdAstar(`SQL de aristas`_, **salida**, **destinos**, [**opciones**])" +msgstr "pgr_bdAstar(`SQL de aristas`_, **salida**, **destinos**, [**opciones**])" msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "" -"pgr_bdAstar(`SQL de aristas`_, **salidas**, **destino**, [**opciones**])" +msgstr "pgr_bdAstar(`SQL de aristas`_, **salidas**, **destino**, [**opciones**])" msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "" -"pgr_bdAstar(`SQL de aristas`_, **salidas**, **destinos**, [**opciones**])" +msgstr "pgr_bdAstar(`SQL de aristas`_, **salidas**, **destinos**, [**opciones**])" msgid "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "" -"pgr_bdAstar(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])" +msgstr "pgr_bdAstar(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])" msgid "``pgr_bdAstarCost``" msgstr "``pgr_bdAstarCost``" -msgid "" -"``pgr_bdAstarCost`` - Total cost of the shortest path using the " -"bidirectional A* algorithm." -msgstr "" -"``pgr_bdAstarCost`` - Coste total del camino más corto utilizando el " -"algoritmo bidireccional A*." +msgid "``pgr_bdAstarCost`` - Total cost of the shortest path using the bidirectional A* algorithm." +msgstr "``pgr_bdAstarCost`` - Coste total del camino más corto utilizando el algoritmo bidireccional A*." msgid "pgr_bdAstarCost(Combinations)" msgstr "pgr_bdAstarCost(Combinaciones)" #, fuzzy -msgid "" -"The ``pgr_bdAstarCost`` function summarizes the cost of the shortest path " -"using the bidirectional A* algorithm." -msgstr "" -"La función ``pgr_bdAstarCost`` suma el coste del camino más corto utilizando " -"el algoritmo bidireccional A*." +msgid "The ``pgr_bdAstarCost`` function summarizes the cost of the shortest path using the bidirectional A* algorithm." +msgstr "La función ``pgr_bdAstarCost`` suma el coste del camino más corto utilizando el algoritmo bidireccional A*." -msgid "" -"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgstr "" -"pgr_bdAstarCost(`SQL de aristas`_, **salida**, **destino**, [**opciones**])" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgstr "pgr_bdAstarCost(`SQL de aristas`_, **salida**, **destino**, [**opciones**])" -msgid "" -"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "" -"pgr_bdAstarCost(`SQL de aristas`_, **salida**, **destinos**, [**opciones**])" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "pgr_bdAstarCost(`SQL de aristas`_, **salida**, **destinos**, [**opciones**])" -msgid "" -"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "" -"pgr_bdAstarCost(`SQL de aristas`_, **salidas**, **destino**, [**opciones**])" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "pgr_bdAstarCost(`SQL de aristas`_, **salidas**, **destino**, [**opciones**])" -msgid "" -"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "" -"pgr_bdAstarCost(`SQL de aristas`_, **salidas**, **destinos**, [**opciones**])" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "pgr_bdAstarCost(`SQL de aristas`_, **salidas**, **destinos**, [**opciones**])" msgid "pgr_bdAstarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "" -"pgr_bdAstarCost(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])" +msgstr "pgr_bdAstarCost(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])" msgid "``pgr_bdAstarCostMatrix``" msgstr "``pgr_bdAstarCostMatrix``" #, fuzzy -msgid "" -"``pgr_bdAstarCostMatrix`` - Calculates the cost matrix using :doc:" -"`pgr_bdAstar`." -msgstr "" -"``pgr_bdAstarCostMatrix`` - Calcula la matriz de costes utilizando :doc:" -"`pgr_aStar`." +msgid "``pgr_bdAstarCostMatrix`` - Calculates the cost matrix using :doc:`pgr_bdAstar`." +msgstr "``pgr_bdAstarCostMatrix`` - Calcula la matriz de costes utilizando :doc:`pgr_aStar`." msgid "Internally uses the :doc:`pgr_bdAstar` algorithm." msgstr "Internamente utiliza el algoritmo :doc:`pgr_bdAstar`." @@ -10832,12 +8170,8 @@ msgstr "Internamente utiliza el algoritmo :doc:`pgr_bdAstar`." msgid "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" msgstr "pgr_bdAstarCostMatrix(`SQL de aristas`_, **salidas**, [**opciones**])" -msgid "" -"``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra " -"algorithm." -msgstr "" -"``pgr_bdDijkstra`` - Devuelve el camino más corto utilizando el algoritmo " -"Bidireccional de Dijkstra." +msgid "``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra algorithm." +msgstr "``pgr_bdDijkstra`` - Devuelve el camino más corto utilizando el algoritmo Bidireccional de Dijkstra." msgid "pgr_bdDijkstra(Combinations)" msgstr "pgr_bdDijkstra(Combinaciones)" @@ -10855,52 +8189,32 @@ msgstr "pgr_bdDijkstra(Muchos a Muchos)" msgid "Signature change on pgr_bdDijkstra(One to One)" msgstr "La firma cambió en pgr_bdDijsktra(Uno a Uno)" -msgid "" -"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "" -"pgr_bdDijkstra(`SQL de aristas`_, **salida**, **destino**, [``directed``])" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_bdDijkstra(`SQL de aristas`_, **salida**, **destino**, [``directed``])" -msgid "" -"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "" -"pgr_bdDijkstra(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_bdDijkstra(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" -msgid "" -"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "" -"pgr_bdDijkstra(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_bdDijkstra(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" -msgid "" -"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "" -"pgr_bdDijkstra(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_bdDijkstra(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "" -"pgr_bdDijkstra(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" +msgstr "pgr_bdDijkstra(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" msgid "From vertex :math:`6` to vertex :math:`10` on a **directed** graph" msgstr "Del vértice :math:`6` al vértice :math:`10` en un grafo **dirigido**" -msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed** " -"graph" -msgstr "" -"Del vértice :math:`6` a los vértices :math:`\\{10, 17\\}` en un grafo " -"**dirigido**" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed** graph" +msgstr "Del vértice :math:`6` a los vértices :math:`\\{10, 17\\}` en un grafo **dirigido**" -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** graph" -msgstr "" -"De los vértices :math:`\\{6, 1\\}` al vertice :math:`17` en un grafo " -"**dirigido**" +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** graph" +msgstr "De los vértices :math:`\\{6, 1\\}` al vertice :math:`17` en un grafo **dirigido**" -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an " -"**undirected** graph" -msgstr "" -"De los vértices :math:`\\{6, 1\\}` a los vértices :math:`\\{10, 17\\}` en un " -"grafo **no dirigido**" +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an **undirected** graph" +msgstr "De los vértices :math:`\\{6, 1\\}` a los vértices :math:`\\{10, 17\\}` en un grafo **no dirigido**" msgid "Using a combinations table on an **undirected** graph" msgstr "Usando una tabla de combinaciones en un grafo **no dirigido**" @@ -10911,224 +8225,118 @@ msgstr "https://en.wikipedia.org/wiki/Bidirectional_search" msgid "``pgr_bdDijkstraCost``" msgstr "``pgr_bdDijkstraCost``" -msgid "" -"``pgr_bdDijkstraCost`` — Returns the shortest path's cost using " -"Bidirectional Dijkstra algorithm." -msgstr "" -"``pgr_bdDijkstraCost`` - Devuelve el coste del camino más corto utilizando " -"el algoritmo Bidireccional de Dijkstra." +msgid "``pgr_bdDijkstraCost`` — Returns the shortest path's cost using Bidirectional Dijkstra algorithm." +msgstr "``pgr_bdDijkstraCost`` - Devuelve el coste del camino más corto utilizando el algoritmo Bidireccional de Dijkstra." msgid "pgr_bdDijkstraCost(Combinations)" msgstr "pgr_bdDijkstraCost(Combinaciones)" #, fuzzy -msgid "" -"The ``pgr_bdDijkstraCost`` function summarizes 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 "The ``pgr_bdDijkstraCost`` function summarizes 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 "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" -msgstr "" -"pgr_bdDijkstraCost(`SQL de aristas`_, **salida**, **destino**, " -"[``directed``])" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" +msgstr "pgr_bdDijkstraCost(`SQL de aristas`_, **salida**, **destino**, [``directed``])" -msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "" -"pgr_bdDijkstraCost(`SQL de aristas`_, **salida**, **destinos**, " -"[``directed``])" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_bdDijkstraCost(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" -msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , " -"[``directed``])" -msgstr "" -"pgr_bdDijkstraCost(`SQL de aristas`_, **salidas**, **destino**, " -"[``directed``])" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , [``directed``])" +msgstr "pgr_bdDijkstraCost(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" -msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" -msgstr "" -"pgr_bdDijkstraCost(`SQL de aristas`_, **salidas**, **destinos**, " -"[``directed``])" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_bdDijkstraCost(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [ ``directed``])" -msgstr "" -"pgr_bdDijkstraCost(`SQL de aristas`_, `SQL de combinaciones`_, " -"[ ``directed``])" +msgstr "pgr_bdDijkstraCost(`SQL de aristas`_, `SQL de combinaciones`_, [ ``directed``])" msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "" -"pgr_bdDijkstraCost(`SQL de aristas`_, `SQL de combinaciones`_, " -"[``directed``])" +msgstr "pgr_bdDijkstraCost(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" msgid "``pgr_bdDijkstraCostMatrix``" msgstr "``pgr_bdDijkstraCostMatrix``" -msgid "" -"``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using :doc:" -"`pgr_bdDijkstra`." -msgstr "" -"``pgr_bdDijkstraCostMatrix`` - Calcula la matriz de costes utilizando :doc:" -"`pgr_bdDijkstra`." +msgid "``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_bdDijkstra`." +msgstr "``pgr_bdDijkstraCostMatrix`` - Calcula la matriz de costes utilizando :doc:`pgr_bdDijkstra`." -msgid "" -"Using bidirectional Dijkstra algorithm, calculate and return a cost matrix." -msgstr "" -"Usando el algoritmo bidireccional de Dijkstra, calcular y regresar una " -"matriz de costos." +msgid "Using bidirectional Dijkstra algorithm, calculate and return a cost matrix." +msgstr "Usando el algoritmo bidireccional de Dijkstra, calcular y regresar una matriz de costos." msgid "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" -msgstr "" -"pgr_bdDijkstraCostMatrix(`SQL de aristas`_, **salidas**, [``directed``])" +msgstr "pgr_bdDijkstraCostMatrix(`SQL de aristas`_, **salidas**, [``directed``])" -msgid "" -"Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an " -"**undirected** graph" -msgstr "" -"Matriz de costos simétrica para vértices :math:`\\{5, 6, 10, 15\\}` en un " -"grafo **no dirigido**" +msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph" +msgstr "Matriz de costos simétrica para vértices :math:`\\{5, 6, 10, 15\\}` en un grafo **no dirigido**" msgid "Use with :doc:`pgr_TSP`." msgstr "Usar con :doc:`pgr_TSP`." -msgid "``pgr_bellmanFord - Experimental``" +#, fuzzy +msgid "``pgr_bellmanFord`` - Experimental" msgstr "``pgr_bellmanFord`` - Experimental" msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm." -msgstr "" -"``pgr_bellmanFord`` - Camino más corto utilizando el algoritmo de Bellman-" -"Ford." +msgstr "``pgr_bellmanFord`` - Camino más corto utilizando el algoritmo de Bellman-Ford." msgid "pgr_bellmanFord(Combinations)" msgstr "pgr_bellmanFord(Combinaciones)" -msgid "" -"Bellman-Ford's algorithm, is named after Richard Bellman and Lester Ford, " -"who first published it in 1958 and 1956, respectively.It is a graph search " -"algorithm that computes shortest paths from a starting vertex " -"(``start_vid``) to an ending vertex (``end_vid``) in a graph where some of " -"the edge weights may be negative. Though it is more versatile, it is slower " -"than Dijkstra's algorithm.This implementation can be used with a directed " -"graph and an undirected graph." -msgstr "" -"El algoritmo de Bellman-Ford, lleva el nombre de Richard Bellman y Lester " -"Ford, quienes lo publicaron por primera vez en 1958 y 1956, respectivamente. " -"Es un algoritmo de búsqueda de grafos que calcula las rutas más cortas desde " -"un vértice inicial (``start_vid``) hasta un vértice final (``end_vid``) en " -"un grafo donde algunos de los pesos de borde pueden ser números negativos. " -"Aunque es más versátil, es más lento que el algoritmo de Dijkstra/ Esta " -"implementación se puede utilizar con un grafo dirigido y un grafo no " -"dirigido." +msgid "Bellman-Ford's algorithm, is named after Richard Bellman and Lester Ford, who first published it in 1958 and 1956, respectively.It is a graph search algorithm that computes shortest paths from a starting vertex (``start_vid``) to an ending vertex (``end_vid``) in a graph where some of the edge weights may be negative. Though it is more versatile, it is slower than Dijkstra's algorithm.This implementation can be used with a directed graph and an undirected graph." +msgstr "El algoritmo de Bellman-Ford, lleva el nombre de Richard Bellman y Lester Ford, quienes lo publicaron por primera vez en 1958 y 1956, respectivamente. Es un algoritmo de búsqueda de grafos que calcula las rutas más cortas desde un vértice inicial (``start_vid``) hasta un vértice final (``end_vid``) en un grafo donde algunos de los pesos de borde pueden ser números negativos. Aunque es más versátil, es más lento que el algoritmo de Dijkstra/ Esta implementación se puede utilizar con un grafo dirigido y un grafo no dirigido." -msgid "" -"Process is valid for edges with both positive and negative edge weights." -msgstr "" -"El proceso es válido para aristas con grosores de arista positivos y " -"negativos." +msgid "Process is valid for edges with both positive and negative edge weights." +msgstr "El proceso es válido para aristas con grosores de arista positivos y negativos." -msgid "" -"When the start vertex and the end vertex are the same, there is no path. The " -"agg_cost would be :math:`0`." -msgstr "" -"Cuando el vértice inicial y el vértice final son los mismos, no hay ruta. El " -"agg_cost sería :math:`0`." +msgid "When the start vertex and the end vertex are the same, there is no path. The agg_cost would be :math:`0`." +msgstr "Cuando el vértice inicial y el vértice final son los mismos, no hay ruta. El agg_cost sería :math:`0`." -msgid "" -"When the start vertex and the end vertex are different, and there exists a " -"path between them without having a *negative cycle*. The agg_cost would be " -"some finite value denoting the shortest distance between them." -msgstr "" -"Cuando el vértice inicial y el vértice final son diferentes, y existe una " -"ruta entre ellos sin tener un *ciclo negativo*. El agg_cost sería un valor " -"finito que indica la distancia más corta entre ellos." +msgid "When the start vertex and the end vertex are different, and there exists a path between them without having a *negative cycle*. The agg_cost would be some finite value denoting the shortest distance between them." +msgstr "Cuando el vértice inicial y el vértice final son diferentes, y existe una ruta entre ellos sin tener un *ciclo negativo*. El agg_cost sería un valor finito que indica la distancia más corta entre ellos." -msgid "" -"When the start vertex and the end vertex are different, and there exists a " -"path between them, but it contains a *negative cycle*. In such case, " -"agg_cost for those vertices keep on decreasing furthermore, Hence agg_cost " -"can’t be defined for them." -msgstr "" -"Cuando el vértice inicial y el vértice final son diferentes y existe una " -"ruta entre ellos, pero contiene un *ciclo negativo*. En tal caso, agg_cost " -"para esos vértices siguen disminuyendo además, por lo tanto agg_cost no se " -"puede definir para ellos." +msgid "When the start vertex and the end vertex are different, and there exists a path between them, but it contains a *negative cycle*. In such case, agg_cost for those vertices keep on decreasing furthermore, Hence agg_cost can’t be defined for them." +msgstr "Cuando el vértice inicial y el vértice final son diferentes y existe una ruta entre ellos, pero contiene un *ciclo negativo*. En tal caso, agg_cost para esos vértices siguen disminuyendo además, por lo tanto agg_cost no se puede definir para ellos." -msgid "" -"When the start vertex and the end vertex are different, and there is no " -"path. The agg_cost is :math:`\\infty`." -msgstr "" -"Cuando el vértice inicial y el vértice final son diferentes y no hay ruta. " -"El agg_cost es :math:`\\infty`." +msgid "When the start vertex and the end vertex are different, and there is no path. The agg_cost is :math:`\\infty`." +msgstr "Cuando el vértice inicial y el vértice final son diferentes y no hay ruta. El agg_cost es :math:`\\infty`." -msgid "" -"For optimization purposes, any duplicated value in the `start_vids` or " -"`end_vids` are ignored." -msgstr "" -"Para fines de optimización, se ignora cualquier valor duplicado en " -"`start_vids` o `end_vids`." +msgid "For optimization purposes, any duplicated value in the `start_vids` or `end_vids` are ignored." +msgstr "Para fines de optimización, se ignora cualquier valor duplicado en `start_vids` o `end_vids`." msgid "Running time: :math:`O(| start\\_vids | * ( V * E))`" msgstr "Tiempo de ejecución :math:`O(| start\\_vids | * ( V * E))`" -msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "" -"pgr_bellmanFord(`SQL de aristas`_, **salida**, **destino**, [``directed``])" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_bellmanFord(`SQL de aristas`_, **salida**, **destino**, [``directed``])" -msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "" -"pgr_bellmanFord(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_bellmanFord(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" -msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "" -"pgr_bellmanFord(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_bellmanFord(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" -msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "" -"pgr_bellmanFord(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_bellmanFord(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" msgid "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "" -"pgr_bellmanFord(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" +msgstr "pgr_bellmanFord(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" #, fuzzy -msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph" -msgstr "" -"Del vértice :math:`6` a los vértices :math:`\\{10, 17\\}` en un grafo " -"**dirigido**" +msgid "From 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**" #, fuzzy -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph" -msgstr "" -"De los vértices :math:`\\{6, 1\\}` al vertice :math:`17` en un grafo " -"**dirigido**" +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph" +msgstr "De los vértices :math:`\\{6, 1\\}` al vertice :math:`17` en un grafo **dirigido**" #, fuzzy -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 "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an undirected graph" +msgstr "De los vértices :math:`\\{6, 1\\}` a los vértices :math:`\\{10, 17\\}` en un grafo **no dirigido**" msgid "Using a combinations table on an undirected graph" msgstr "Usando una tabla de combinaciones en un grafo no dirigido" -msgid "" -"`Boost: Bellman Ford `__" -msgstr "" -"`Boost: Bellman Ford `__" +msgid "`Boost: Bellman Ford `__" +msgstr "`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" @@ -11136,45 +8344,23 @@ msgstr "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" msgid "``pgr_betweennessCentrality`` - Experimental" msgstr "``pgr_betweennessCentrality`` - Experimental" -msgid "" -"``pgr_betweennessCentrality`` - Calculates the relative betweenness " -"centrality using Brandes Algorithm" -msgstr "" -"``pgr_betweennessCentrality`` - Calcula la centralidad intermedia relativa " -"mediante el algoritmo de Brandes" +msgid "``pgr_betweennessCentrality`` - Calculates the relative betweenness centrality using Brandes Algorithm" +msgstr "``pgr_betweennessCentrality`` - Calcula la centralidad intermedia relativa mediante el algoritmo de Brandes" msgid "Version 3.7.0" msgstr "Versión 3.7.0" -msgid "" -"The Brandes Algorithm takes advantage of the sparse graphs for evaluating " -"the betweenness centrality score of all vertices." -msgstr "" -"El algoritmo Brandes aprovecha los grafos dispersos para evaluar la " -"puntuación de centralidad intermedia de todos los vértices." +msgid "The Brandes Algorithm takes advantage of the sparse graphs for evaluating the betweenness centrality score of all vertices." +msgstr "El algoritmo Brandes aprovecha los grafos dispersos para evaluar la puntuación de centralidad intermedia de todos los vértices." -msgid "" -"Betweenness centrality measures the extent to which a vertex lies on the " -"shortest paths between all other pairs of vertices. Vertices with a high " -"betweenness centrality score may have considerable influence in a network by " -"the virtue of their control over the shortest paths passing between them." -msgstr "" -"La centralidad de interrelación mide hasta qué punto un vértice se encuentra " -"en las rutas más cortas entre todos los demás pares de vértices. Los " -"vértices con una alta centralidad entre pares pueden tener una influencia " -"considerable en una red gracias a su control sobre los caminos más cortos " -"que pasan entre ellos." +msgid "Betweenness centrality measures the extent to which a vertex lies on the shortest paths between all other pairs of vertices. Vertices with a high betweenness centrality score may have considerable influence in a network by the virtue of their control over the shortest paths passing between them." +msgstr "La centralidad de interrelación mide hasta qué punto un vértice se encuentra en las rutas más cortas entre todos los demás pares de vértices. Los vértices con una alta centralidad entre pares pueden tener una influencia considerable en una red gracias a su control sobre los caminos más cortos que pasan entre ellos." -msgid "" -"The removal of these vertices will affect the network by disrupting the it, " -"as most of the shortest paths between vertices pass through them." -msgstr "" -"La eliminación de estos vértices afectará a la red al perturbarla, ya que la " -"mayoría de los caminos más cortos entre vértices pasan por ellos." +msgid "The removal of these vertices will affect the network by disrupting the it, as most of the shortest paths between vertices pass through them." +msgstr "La eliminación de estos vértices afectará a la red al perturbarla, ya que la mayoría de los caminos más cortos entre vértices pasan por ellos." msgid "This implementation work for both directed and undirected graphs." -msgstr "" -"Esta implementación funciona tanto para grafos dirigidos como no dirigidos." +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)`" @@ -11203,19 +8389,14 @@ msgstr "La centralidad intermedia está entre paréntesis." msgid "The leaf vertices have betweenness centrality :math:`0`." msgstr "Los vértices de las hojas tienen una centralidad intermedia :math:`0`." -msgid "" -"Betweenness centrality of vertex :math:`6` is higher than of vertex :math:" -"`10`." -msgstr "" -"La centralidad de entrecruzamiento del vértice :math:`6` es mayor que la del " -"vértice :math:`10`." +msgid "Betweenness centrality of vertex :math:`6` is higher than of vertex :math:`10`." +msgstr "La centralidad de entrecruzamiento del vértice :math:`6` es mayor que la del vértice :math:`10`." msgid "Removing vertex :math:`6` will create three graph components." msgstr "Al eliminar el vértice :math:`6` se crearían tres componentes." msgid "Removing vertex :math:`10` will create two graph components." -msgstr "" -"Al eliminar el vértice :math:`10` se crearán dos componentes del grafo." +msgstr "Al eliminar el vértice :math:`10` se crearán dos componentes del grafo." msgid "``vid``" msgstr "``vid``" @@ -11223,27 +8404,17 @@ msgstr "``vid``" msgid "``centrality``" msgstr "``centrality``" -msgid "" -"Relative betweenness centrality score of the vertex (will be in range [0,1])" -msgstr "" -"Puntuación relativa de centralidad entre vértices (estará en el rango [0,1])" +msgid "Relative betweenness centrality score of the vertex (will be in range [0,1])" +msgstr "Puntuación relativa de centralidad entre vértices (estará en el rango [0,1])" -msgid "" -"`Boost: betweenness centrality `_" -msgstr "" -"`Boost: Centralidad de intermediación `__" +msgid "`Boost: betweenness centrality `_" +msgstr "`Boost: Centralidad de intermediación `__" msgid "``pgr_biconnectedComponents``" msgstr "``pgr_biconnectedComponents``" -msgid "" -"``pgr_biconnectedComponents`` — Biconnected components of an undirected " -"graph." -msgstr "" -"``pgr_biconnectedComponents`` — Componentes biconectados de un grafo no " -"dirigido." +msgid "``pgr_biconnectedComponents`` — Biconnected components of an undirected graph." +msgstr "``pgr_biconnectedComponents`` — Componentes biconectados de un grafo no dirigido." msgid "Result columns change:" msgstr "Las columnas de resultados cambian:" @@ -11254,21 +8425,8 @@ msgstr "``n_seq`` se elimina" msgid "``seq`` changed type to ``BIGINT``" msgstr "``seq`` cambió el tipo a ``BIGINT``'" -msgid "" -"The biconnected components of an undirected graph are the maximal subsets of " -"vertices such that the removal of a vertex from particular component will " -"not disconnect the component. Unlike connected components, vertices may " -"belong to multiple biconnected components. Vertices can be present in " -"multiple biconnected components, but each edge can only be contained in a " -"single biconnected component." -msgstr "" -"Los componentes biconectados de un grafo no dirigido son los subconjuntos " -"máximos de vértices de modo que la eliminación de un vértice de un " -"componente determinado no desconectará el mismo. A diferencia de los " -"componentes conectados, los vértices pueden pertenecer a varios componentes " -"biconectados. Los vértices pueden estar presentes en varios componentes " -"biconectados, pero cada arista solo puede estar contenida en un único " -"componente biconectado." +msgid "The biconnected components of an undirected graph are the maximal subsets of vertices such that the removal of a vertex from particular component will not disconnect the component. Unlike connected components, vertices may belong to multiple biconnected components. Vertices can be present in multiple biconnected components, but each edge can only be contained in a single biconnected component." +msgstr "Los componentes biconectados de un grafo no dirigido son los subconjuntos máximos de vértices de modo que la eliminación de un vértice de un componente determinado no desconectará el mismo. A diferencia de los componentes conectados, los vértices pueden pertenecer a varios componentes biconectados. Los vértices pueden estar presentes en varios componentes biconectados, pero cada arista solo puede estar contenida en un único componente biconectado." msgid "Components are described by edges." msgstr "Los componentes se describen mediante aristas." @@ -11303,148 +8461,63 @@ msgstr "Identificador de arista que pertenece a ``component``." msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" msgstr "``pgr_binaryBreadthFirstSearch`` - Experimental" -msgid "" -"``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary " -"graph." -msgstr "" -"``pgr_binaryBreadthFirstSearch`` - Devuelve el camino más corto en un grafo " -"binario." +msgid "``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary graph." +msgstr "``pgr_binaryBreadthFirstSearch`` - Devuelve el camino más corto en un grafo binario." -msgid "" -"Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-" -"negative integer, is termed as a 'binary graph'." -msgstr "" -"Un grafo cuyos pesos de las aristas pertenece al conjunto {0, X}, donde 'X' " -"es un entero no negativo, se le llama 'grafo binario'." +msgid "Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-negative integer, is termed as a 'binary graph'." +msgstr "Un grafo cuyos pesos de las aristas pertenece al conjunto {0, X}, donde 'X' es un entero no negativo, se le llama 'grafo binario'." msgid "pgr_binaryBreadthFirstSearch(Combinations)" msgstr "pgr_binaryBreadthFirstSearch(Combinaciones)" #, fuzzy -msgid "" -"It is well-known that the shortest paths between a single source and all " -"other vertices can be found using Breadth First Search in :math:`O(|E|)` in " -"an unweighted graph, i.e. the distance is the minimal number of edges that " -"you need to traverse from the source to another vertex. We can interpret " -"such a graph also as a weighted graph, where every edge has the weight :math:" -"`1`. If not all edges in graph have the same weight, then we a more general " -"algorithm is needed, like Dijkstra's Algorithm which runs in :math:`O(|E|log|" -"V|)` time." -msgstr "" -"Es bien sabido que los caminos más cortos entre un único origen y todos los " -"demás vértices se pueden encontrar utilizando la búsqueda rápida en :math:" -"`O(|E|)` en un grafo no ponderado, es decir, la distancia es el número " -"mínimo de aristas que hay que recorrer desde el origen hasta otro vértice. " -"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 "It is well-known that the shortest paths between a single source and all other vertices can be found using Breadth First Search in :math:`O(|E|)` in an unweighted graph, i.e. the distance is the minimal number of edges that you need to traverse from the source to another vertex. We can interpret such a graph also as a weighted graph, where every edge has the weight :math:`1`. If not all edges in graph have the same weight, then we a more general algorithm is needed, like Dijkstra's Algorithm which runs in :math:`O(|E|log|V|)` time." +msgstr "Es bien sabido que los caminos más cortos entre un único origen y todos los demás vértices se pueden encontrar utilizando la búsqueda rápida en :math:`O(|E|)` en un grafo no ponderado, es decir, la distancia es el número mínimo de aristas que hay que recorrer desde el origen hasta otro vértice. 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 "" -"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 "However if the weights are more constrained, we can use a faster algorithm. This algorithm, termed as 'Binary Breadth First Search' as well as '0-1 BFS', is a variation of the standard Breadth First Search problem to solve the SSSP (single-source shortest path) problem in :math:`O(|E|)`, if the weights of each edge belongs to the set {0,X}, where 'X' is any non-negative real integer." +msgstr "Sin embargo, si los pesos están más restringidos, podemos usar un algoritmo más rápido. Este algoritmo, llamado 'búsqueda binaria de primero profundidad' así como '0-1 BFS', es una variación del problema estándar de búsqueda de primero profundidad para resolver el problema SSSP (ruta más corta de una sola fuente) en :math:`O(|E|)`, si los pesos de cada arista pertenecen al conjunto de caracteres de {0,X}, donde 'X' es cualquier entero no negativo." -msgid "" -"Process is done only on 'binary graphs'. ('Binary Graph': Any graph whose " -"edge-weights belongs to the set {0,X}, where 'X' is any non-negative real " -"integer.)" -msgstr "" -"El proceso se realiza sólo en 'grafos binarios'. ('Grafo binario': Cualquier " -"grafo cuyos pesos de aristas pertenezcan al conjunto {0, X}, donde 'X' es " -"cualquier entero real no negativo.)" +msgid "Process is done only on 'binary graphs'. ('Binary Graph': Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-negative real integer.)" +msgstr "El proceso se realiza sólo en 'grafos binarios'. ('Grafo binario': Cualquier grafo cuyos pesos de aristas pertenezcan al conjunto {0, X}, donde 'X' es cualquier entero real no negativo.)" msgid "Running time: :math:`O(| start\\_vids | * |E|)`" msgstr "Tiempo de ejecución: :math:`O(| start\\_vids | * |E|)`" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, " -"[``directed``])" -msgstr "" -"pgr_binaryBreadthFirstSearch(`SQL de aristas`_, **salida**, **destino**, " -"[``directed``])" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_binaryBreadthFirstSearch(`SQL de aristas`_, **salida**, **destino**, [``directed``])" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, " -"[``directed``])" -msgstr "" -"pgr_binaryBreadthFirstSearch(`SQL de aristas`_, **salida**, **destinos**, " -"[``directed``])" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_binaryBreadthFirstSearch(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, " -"[``directed``])" -msgstr "" -"pgr_binaryBreadthFirstSearch(`SQL de aristas`_, **salidas**, **destino**, " -"[``directed``])" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_binaryBreadthFirstSearch(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" -msgstr "" -"pgr_binaryBreadthFirstSearch(`SQL de aristas`_, **salidas**, **destinos**, " -"[``directed``])" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_binaryBreadthFirstSearch(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, " -"[``directed``])" -msgstr "" -"pgr_binaryBreadthFirstSearch(`SQL de aristas`_, `SQL de combinaciones`_, " -"[``directed``])" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_binaryBreadthFirstSearch(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" -msgid "" -"**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :" -"math:`1``)" -msgstr "" -"**Nota:** Usando la red de :doc:`sampledata` como todos los pesos son los " -"mismos (i.e :math:`1``)" +msgid "**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :math:`1``)" +msgstr "**Nota:** Usando la red de :doc:`sampledata` como todos los pesos son los mismos (i.e :math:`1``)" -msgid "" -"`Boost: Breadth First Search `__" -msgstr "" -"`Boost: Primera búsqueda en amplitud `__" +msgid "`Boost: Breadth First Search `__" +msgstr "`Boost: Primera búsqueda en amplitud `__" msgid "https://cp-algorithms.com/graph/01_bfs.html" msgstr "https://cp-algorithms.com/graph/01_bfs.html" -msgid "" -"https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" -msgstr "" -"https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" +msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" +msgstr "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" msgid "``pgr_bipartite`` - Experimental" msgstr "``pgr_bipartite`` - Experimental" -msgid "" -"``pgr_bipartite`` — Disjoint sets of vertices such that no two vertices " -"within the same set are adjacent." -msgstr "" -"``pgr_bipartite`` — Conjuntos disjuntos tal que ningun par de vertices en el " -"mismo conjunto son adjacentes." +msgid "``pgr_bipartite`` — Disjoint sets of vertices such that no two vertices within the same set are adjacent." +msgstr "``pgr_bipartite`` — Conjuntos disjuntos tal que ningun par de vertices en el mismo conjunto son adjacentes." -msgid "" -"A bipartite graph is a graph with two sets of vertices which are connected " -"to each other, but not within themselves. A bipartite graph is possible if " -"the graph coloring is possible using two colors such that vertices in a set " -"are colored with the same color." -msgstr "" -"Un grafo bipartito es un grafo con dos conjuntos de vértices que están " -"conectados entre sí, pero no dentro de sí mismos. Un gráfico bipartito es " -"posible si el color del gráfico es posible utilizando dos colores, de modo " -"que los vértices de un conjunto se colorean con el mismo color." +msgid "A bipartite graph is a graph with two sets of vertices which are connected to each other, but not within themselves. A bipartite graph is possible if the graph coloring is possible using two colors such that vertices in a set are colored with the same color." +msgstr "Un grafo bipartito es un grafo con dos conjuntos de vértices que están conectados entre sí, pero no dentro de sí mismos. Un gráfico bipartito es posible si el color del gráfico es posible utilizando dos colores, de modo que los vértices de un conjunto se colorean con el mismo color." msgid "The algorithm works in undirected graph only." msgstr "El algoritmo solo funciona en un grafo no dirigido." @@ -11452,14 +8525,8 @@ msgstr "El algoritmo solo funciona en un grafo no dirigido." msgid "The returned values are not ordered." msgstr "Los valores devueltos no están ordenados." -msgid "" -"The algorithm checks graph is bipartite or not. If it is bipartite then it " -"returns the node along with two colors `0` and `1` which represents two " -"different sets." -msgstr "" -"El algoritmo comprueba si el grafo es bipartito o no. Si es bipartito " -"entonces devuelve el nodo junto con dos colores `0` y `1` que representan " -"dos conjuntos diferentes." +msgid "The algorithm checks graph is bipartite or not. If it is bipartite then it returns the node along with two colors `0` and `1` which represents two different sets." +msgstr "El algoritmo comprueba si el grafo es bipartito o no. Si es bipartito entonces devuelve el nodo junto con dos colores `0` y `1` que representan dos conjuntos diferentes." msgid "If graph is not bipartite then algorithm returns empty set." msgstr "Si el grafo no es bipartito, el algoritmo devuelve un conjunto vacío." @@ -11476,43 +8543,23 @@ msgstr "Ejemplo Adicional" msgid "The odd length cyclic graph can not be bipartite." msgstr "El gráfico cíclico de longitud impar no puede ser bipartito." -msgid "" -"The edge :math:`5 \\rightarrow 1` will make subgraph with vertices :math:" -"`\\{1, 3, 7, 6, 5\\}` an odd length cyclic graph, as the cycle has 5 " -"vertices." -msgstr "" -"La arista :math:`5 \\rightarrow 1` hace que el sub-grafo con vértices:math:" -"`\\{1, 3, 7, 6, 5\\}` se un grafo de ciclo impar, ya que ciclo tiene 5 " -"vértices." +msgid "The edge :math:`5 \\rightarrow 1` will make subgraph with vertices :math:`\\{1, 3, 7, 6, 5\\}` an odd length cyclic graph, as the cycle has 5 vertices." +msgstr "La arista :math:`5 \\rightarrow 1` hace que el sub-grafo con vértices:math:`\\{1, 3, 7, 6, 5\\}` se un grafo de ciclo impar, ya que ciclo tiene 5 vértices." msgid "Edges in blue represent odd length cycle subgraph." msgstr "Aristas en azul representan un grafo de ciclo impar." -msgid "" -"`Boost: is_bipartite `__" -msgstr "" -"`Boost: es bipartido `__" +msgid "`Boost: is_bipartite `__" +msgstr "`Boost: es bipartido `__" -msgid "" -"`Wikipedia: bipartite graph `__" -msgstr "" -"`Wikipedia: grafo bipartito `__" +msgid "`Wikipedia: bipartite graph `__" +msgstr "`Wikipedia: grafo bipartito `__" msgid "``pgr_boykovKolmogorov``" msgstr "``pgr_boykovKolmogorov``" -msgid "" -"``pgr_boykovKolmogorov`` — Calculates the flow on the graph edges that " -"maximizes the flow from the sources to the targets using Boykov Kolmogorov " -"algorithm." -msgstr "" -"``pgr_boykovKolmogorov`` — Calcula el flujo en las aristas del grafo que " -"maximiza el flujo de las fuentes a los objetivos utilizando el algoritmo " -"Boykov Kolmogorov." +msgid "``pgr_boykovKolmogorov`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Boykov Kolmogorov algorithm." +msgstr "``pgr_boykovKolmogorov`` — Calcula el flujo en las aristas del grafo que maximiza el flujo de las fuentes a los objetivos utilizando el algoritmo Boykov Kolmogorov." msgid "pgr_boykovKolmogorov(Combinations)" msgstr "pgr_boykovKolmogorov(Combinaciones)" @@ -11553,55 +8600,32 @@ msgstr "Desde el vértice :math:`11` a los vértices :math:`\\{5, 10, 12\\}`" msgid "From vertices :math:`\\{11, 3, 17\\}` to vertex :math:`12`" msgstr "De los vértices vertices :math:`\\{11, 3, 17\\}` al vértice :math:`12`" -msgid "" -"From vertices :math:`\\{11, 3, 17\\}` to vertices :math:`\\{5, 10, 12\\}`" -msgstr "" -"De los vértices :math:`\\{11, 3, 17\\}` a los vértices :math:`\\{5, 10, 12\\}" -"`" +msgid "From vertices :math:`\\{11, 3, 17\\}` to vertices :math:`\\{5, 10, 12\\}`" +msgstr "De los vértices :math:`\\{11, 3, 17\\}` a los vértices :math:`\\{5, 10, 12\\}`" -msgid "" -"Using a combinations table, equivalent to calculating result from vertices :" -"math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`." -msgstr "" -"Usando una tabla de combinaciones, equivalente a calcular el resultado de " -"los vértices :math:`\\{5, 6\\}` a los vértices :math:`\\{10, 15, 14\\}`." +msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`." +msgstr "Usando una tabla de combinaciones, equivalente a calcular el resultado de los vértices :math:`\\{5, 6\\}` a los vértices :math:`\\{10, 15, 14\\}`." -msgid "" -"`Boost: Boykov Kolmogorov max flow `__" -msgstr "" -"`Boost: Flujo máximo Boykov Kolmogorov `__" +msgid "`Boost: Boykov Kolmogorov max flow `__" +msgstr "`Boost: Flujo máximo Boykov Kolmogorov `__" msgid "``pgr_breadthFirstSearch`` - Experimental" msgstr "``pgr_breadthFirstSearch`` - Experimental" -msgid "" -"``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth " -"First Search algorithm." -msgstr "" -"``pgr_breadthFirstSearch`` — Devuelve los orden(es) transversales mediante " -"el algoritmo Breadth First Search." +msgid "``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth First Search algorithm." +msgstr "``pgr_breadthFirstSearch`` — Devuelve los orden(es) transversales mediante el algoritmo Breadth First Search." msgid "Version 4.0.0:" msgstr "Versión 4.0.0:" -msgid "" -"Provides the Breadth First Search traversal order from a root vertex to a " -"particular depth." -msgstr "" -"Proporciona el orden transversal de Primera Búsqueda de Amplitud desde un " -"vértice raíz hasta una profundidad particular." +msgid "Provides the Breadth First Search traversal order from a root vertex to a particular depth." +msgstr "Proporciona el orden transversal de Primera Búsqueda de Amplitud desde un vértice raíz hasta una profundidad particular." msgid "The implementation will work on any type of graph." msgstr "La implementación funcionará en cualquier tipo de grafo." -msgid "" -"Provides the Breadth First Search traversal order from a source node to a " -"target depth level." -msgstr "" -"Proporciona el orden de recorrido de Búsqueda de Primero Amplitud desde un " -"nodo de origen a un nivel de profundidad objetivo." +msgid "Provides the Breadth First Search traversal order from a source node to a target depth level." +msgstr "Proporciona el orden de recorrido de Búsqueda de Primero Amplitud desde un nodo de origen a un nivel de profundidad objetivo." msgid "Running time: :math:`O(E + V)`" msgstr "Tiempo de ejecución: :math:`O(E + V)`" @@ -11615,20 +8639,11 @@ msgstr "pgr_breadthFirstSearch(`SQL de aristas`_, **raices**, [**options**])" msgid "**options:** ``[max_depth, directed]``" msgstr "**opcionales:** ``[max_depth, directed]``" -msgid "" -"From root vertex :math:`6` on a **directed** graph with edges in ascending " -"order of ``id``" -msgstr "" -"Desde el vértice raíz :math:`6` en un grafo **dirigido** con aristas en " -"orden ascendente de ``id``" +msgid "From root vertex :math:`6` on a **directed** graph with edges in ascending order of ``id``" +msgstr "Desde el vértice raíz :math:`6` en un grafo **dirigido** con aristas en orden ascendente de ``id``" -msgid "" -"From root vertices :math:`\\{12, 6\\}` on an **undirected** graph with " -"**depth** :math:`<= 2` and edges in ascending order of ``id``" -msgstr "" -"A partir de los vértices de la raíz :math:`\\{12, 6\\}` en un grafo **no " -"dirigido** con **profundidad** :math:`<= 2` y aristas ordenadas " -"ascendentemente in términos de ``id``" +msgid "From root vertices :math:`\\{12, 6\\}` on an **undirected** graph with **depth** :math:`<= 2` and edges in ascending order of ``id``" +msgstr "A partir de los vértices de la raíz :math:`\\{12, 6\\}` en un grafo **no dirigido** con **profundidad** :math:`<= 2` y aristas ordenadas ascendentemente in términos de ``id``" msgid "DFS optional parameters" msgstr "Parámetros opcionales de DFS" @@ -11642,13 +8657,8 @@ msgstr "Igual que `Vértice único`_ con aritas en orden descendente de ``id``." msgid "The resulting traversal is different." msgstr "El recorrido resultante es diferente." -msgid "" -"The left image shows the result with ascending order of ids and the right " -"image shows with descending order of the edge identifiers." -msgstr "" -"La imagen izquierda muestra el resultado con el orden ascendente de los ids " -"y la imagen derecha muestra con el orden descendente de los identificadores " -"de aristas." +msgid "The left image shows the result with ascending order of ids and the right image shows with descending order of the edge identifiers." +msgstr "La imagen izquierda muestra el resultado con el orden ascendente de los ids y la imagen derecha muestra con el orden descendente de los identificadores de aristas." msgid "|ascending| |descending|" msgstr "|ascending| |descending|" @@ -11659,12 +8669,8 @@ msgstr "ascendente" msgid "descending" msgstr "descendente" -msgid "" -"`Wikipedia: Breadth First Search algorithm `__" -msgstr "" -"`Wikipedia: Breadth First Search `__" +msgid "`Wikipedia: Breadth First Search algorithm `__" +msgstr "`Wikipedia: Breadth First Search `__" msgid "``pgr_bridges``" msgstr "``pgr_bridges``" @@ -11672,14 +8678,8 @@ msgstr "``pgr_bridges``" msgid "``pgr_bridges`` - Return the bridges of an undirected graph." msgstr "``pgr_bridges`` - Calcula los puentes de un grafo no dirigido." -msgid "" -"A bridge is an edge of an undirected graph whose deletion increases its " -"number of connected components. This implementation can only be used with an " -"undirected graph." -msgstr "" -"Un puente es un borde de un grafo no dirigido cuya eliminación aumenta su " -"número de componentes conectados. Esta implementación solo se puede utilizar " -"con un grafo no dirigido." +msgid "A bridge is an edge of an undirected graph whose deletion increases its number of connected components. This implementation can only be used with an undirected graph." +msgstr "Un puente es un borde de un grafo no dirigido cuya eliminación aumenta su número de componentes conectados. Esta implementación solo se puede utilizar con un grafo no dirigido." msgid "``edge`` ascending" msgstr "``edge`` ascendente" @@ -11702,22 +8702,14 @@ msgstr "Identificador del borde que es un puente." msgid "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" msgstr "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" -msgid "" -"`Boost: Connected components `__" -msgstr "" -"`Boost: Componentes conectados `__" +msgid "`Boost: Connected components `__" +msgstr "`Boost: Componentes conectados `__" msgid "``pgr_chinesePostman`` - Experimental" msgstr "``pgr_chinesePostman`` - Experimental" -msgid "" -"``pgr_chinesePostman`` — Calculates the shortest circuit path which contains " -"every edge in a directed graph and starts and ends on the same vertex." -msgstr "" -"``pgr_chinesePostman`` — Calcula la ruta de circuito más corta que contiene " -"cada arista en un grafo dirigido y comienza y termina en el mismo vértice." +msgid "``pgr_chinesePostman`` — Calculates the shortest circuit path which contains every edge in a directed graph and starts and ends on the same vertex." +msgstr "``pgr_chinesePostman`` — Calcula la ruta de circuito más corta que contiene cada arista en un grafo dirigido y comienza y termina en el mismo vértice." msgid "Returns ``EMPTY SET`` on a disconnected graph" msgstr "Devuelve ``EMPTY SET`` en un grafo desconectado" @@ -11734,12 +8726,8 @@ msgstr "Devuelve un conjunto de ``(seq, node, edge, cost, agg_cost)``" msgid "Sequential value starting from ``1``" msgstr "Valor secuencial a partir de ``1``" -msgid "" -"Identifier of the edge used to go from ``node`` to the next node in the path " -"sequence. ``-1`` for the last node of the path." -msgstr "" -"Identificador del borde utilizado para ir del ``nodo`` al siguiente nodo de " -"la secuencia de ruta. ``-1`` para el último nodo de la ruta." +msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence. ``-1`` for the last node of the path." +msgstr "Identificador del borde utilizado para ir del ``nodo`` al siguiente nodo de la secuencia de ruta. ``-1`` para el último nodo de la ruta." msgid "Aggregate cost from ``start_v`` to ``node``." msgstr "Coste agregado de ``start_v`` to ``node``." @@ -11747,14 +8735,8 @@ msgstr "Coste agregado de ``start_v`` to ``node``." msgid "``pgr_chinesePostmanCost`` - Experimental" msgstr "``pgr_chinesePostmanCost`` - Experimental" -msgid "" -"``pgr_chinesePostmanCost`` — Calculates the minimum costs of a circuit path " -"which contains every edge in a directed graph and starts and ends on the " -"same vertex." -msgstr "" -"``pgr_chinesePostmanCost`` — Calcula los costes mínimos de una ruta de " -"circuito que contiene cada arista de un grafo dirigido y comienza y termina " -"en el mismo vértice." +msgid "``pgr_chinesePostmanCost`` — Calculates the minimum costs of a circuit path which contains every edge in a directed graph and starts and ends on the same vertex." +msgstr "``pgr_chinesePostmanCost`` — Calcula los costes mínimos de una ruta de circuito que contiene cada arista de un grafo dirigido y comienza y termina en el mismo vértice." msgid "Return value when the graph if disconnected" msgstr "Valor devuelto cuando el grafo está desconectado" @@ -11774,19 +8756,11 @@ msgstr "Costes mínimos de una trayectoria de circuito." msgid "``pgr_connectedComponents``" msgstr "``pgr_connectedComponents``" -msgid "" -"``pgr_connectedComponents`` — Connected components of an undirected graph " -"using a DFS-based approach." -msgstr "" -"``pgr_connectedComponents`` — Componentes conectados de un grafo no dirigido " -"mediante un enfoque basado en DFS." +msgid "``pgr_connectedComponents`` — Connected components of an undirected graph using a DFS-based approach." +msgstr "``pgr_connectedComponents`` — Componentes conectados de un grafo no dirigido mediante un enfoque basado en DFS." -msgid "" -"A connected component of an undirected graph is a set of vertices that are " -"all reachable from each other." -msgstr "" -"Un componente conectado de un gráfico no direccionado es un conjunto de " -"vértices que son todos accesibles entre sí." +msgid "A connected component of an undirected graph is a set of vertices that are all reachable from each other." +msgstr "Un componente conectado de un gráfico no direccionado es un conjunto de vértices que son todos accesibles entre sí." msgid "Components are described by vertices" msgstr "Los componentes se describen mediante vértices" @@ -11812,22 +8786,14 @@ msgstr "Identificador del vértice que pertenece al ``component``." msgid "Connecting disconnected components" msgstr "Conectando componentes desconectados" -msgid "" -"wikipedia: `Connected component `__" -msgstr "" -"wikipedia: `Componente conectado `__" +msgid "wikipedia: `Connected component `__" +msgstr "wikipedia: `Componente conectado `__" msgid "``pgr_contraction``" msgstr "``pgr_contraction``" -msgid "" -"``pgr_contraction`` — Performs graph contraction and returns the contracted " -"vertices and edges." -msgstr "" -"``pgr_contraction`` — Realiza la contracción del grafo y devuelve los " -"vértices y aristas contraídos.." +msgid "``pgr_contraction`` — Performs graph contraction and returns the contracted vertices and edges." +msgstr "``pgr_contraction`` — Realiza la contracción del grafo y devuelve los vértices y aristas contraídos.." msgid "Version 3.8.0" msgstr "Versión 3.8.0" @@ -11835,18 +8801,13 @@ msgstr "Versión 3.8.0" msgid "New signature:" msgstr "Nueva firma:" -msgid "" -"Previously compulsory parameter **Contraction order** is now optional with " -"name ``methods``." -msgstr "" -"El parámetro **Orden de contracción**, antes obligatorio, es ahora opcional " -"con el nombre ``methods``." +msgid "Previously compulsory parameter **Contraction order** is now optional with name ``methods``." +msgstr "El parámetro **Orden de contracción**, antes obligatorio, es ahora opcional con el nombre ``methods``." msgid "New name and order of optional parameters." msgstr "Nuevo nombre y orden de parámetros opcionales." -msgid "" -"Deprecated signature pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgid "Deprecated signature pgr_contraction(text,bigint[],integer,bigint[],boolean)" msgstr "Firma obsoleta pgr_contraction(text,bigint[],integer,bigint[],boolean)" msgid "Name change from ``pgr_contractGraph``" @@ -11855,15 +8816,8 @@ msgstr "Cambio de nombre de ``pgr_contractGraph``" msgid "Bug fixes" msgstr "Correcciones" -msgid "" -"Contraction reduces the size of the graph by removing some of the vertices " -"and edges and, for example, might add edges that represent a sequence of " -"original edges decreasing the total time and space used in graph algorithms." -msgstr "" -"La contracción reduce el tamaño del grafo eliminando algunos de los vértices " -"y aristas, también por ejemplo, podría agregar aristas que representan una " -"secuencia de aristas originales disminuyendo el tiempo total y el espacio " -"utilizados en los algoritmos de grafo." +msgid "Contraction reduces the size of the graph by removing some of the vertices and edges and, for example, might add edges that represent a sequence of original edges decreasing the total time and space used in graph algorithms." +msgstr "La contracción reduce el tamaño del grafo eliminando algunos de los vértices y aristas, también por ejemplo, podría agregar aristas que representan una secuencia de aristas originales disminuyendo el tiempo total y el espacio utilizados en los algoritmos de grafo." msgid "Does not return the full contracted graph." msgstr "No devuelve el grafo contraído completo." @@ -11887,15 +8841,10 @@ msgid "column ``id`` ascending when its a modified vertex." msgstr "columna ``id`` ascendente cuando es un vértice modificado." msgid "column ``id`` with negative numbers descending when its a new edge." -msgstr "" -"columna ``id`` con números negativos descendentes cuando es una nueva arista." +msgstr "columna ``id`` con números negativos descendentes cuando es una nueva arista." -msgid "" -"Currently there are two types of contraction methods included in this " -"function:" -msgstr "" -"Actualmente hay dos tipos de métodos de contracción incluidos en esta " -"función:" +msgid "Currently there are two types of contraction methods included in this function:" +msgstr "Actualmente hay dos tipos de métodos de contracción incluidos en esta función:" msgid "Dead End Contraction. See :doc:`pgr_contractionDeadEnd`." msgstr "Contracción sin salida. Véase :doc:`pgr_contractionDeadEnd`." @@ -11913,9 +8862,7 @@ msgid "Returns set of |result-contract|" msgstr "Regresa conjunto de |result-contract|" msgid "Dead end and linear contraction in that order on an undirected graph." -msgstr "" -"Hacer una contracción de callejón sin salida y una contracción lineal en ese " -"orden en un grafo no dirigido." +msgstr "Hacer una contracción de callejón sin salida y una contracción lineal en ese orden en un grafo no dirigido." msgid "Contraction optional parameters" msgstr "Parámetros opcionales de Contracción" @@ -11995,12 +8942,8 @@ msgstr "En caso de ``type`` = **'e'**." msgid "Decreasing sequence starting from **-1**." msgstr "Disminución de la secuencia a partir de **-1**." -msgid "" -"Representing a pseudo `id` as is not incorporated in the set of original " -"edges." -msgstr "" -"Representando un pseudo `id` como no incorporado en el conjunto de aristas " -"originales." +msgid "Representing a pseudo `id` as is not incorporated in the set of original edges." +msgstr "Representando un pseudo `id` como no incorporado en el conjunto de aristas originales." msgid "``contracted_vertices``" msgstr "``contracted_vertices``" @@ -12011,25 +8954,14 @@ msgstr "Arreglo de identificadores de vértices contraídos." msgid "When ``type`` = **'v'**: :math:`-1`" msgstr "En caso de ``type`` = **'v'**: :math:`-1`" -msgid "" -"When ``type`` = **'e'**: Identifier of the source vertex of the current edge " -"(``source``, ``target``)." -msgstr "" -"En caso de ``type`` = **'e'**: Identificador del vétice de la arista actual " -"(``source``, ``target``)." +msgid "When ``type`` = **'e'**: Identifier of the source vertex of the current edge (``source``, ``target``)." +msgstr "En caso de ``type`` = **'e'**: Identificador del vétice de la arista actual (``source``, ``target``)." -msgid "" -"When ``type`` = **'e'**: Identifier of the target vertex of the current edge " -"(``source``, ``target``)." -msgstr "" -"En caso de ``type`` = **'e'**: Identificador del vértice objetivo de la " -"arista actual (``source``, ``target``)." +msgid "When ``type`` = **'e'**: Identifier of the target vertex of the current edge (``source``, ``target``)." +msgstr "En caso de ``type`` = **'e'**: Identificador del vértice objetivo de la arista actual (``source``, ``target``)." -msgid "" -"When ``type`` = **'e'**: Weight of the current edge (``source``, ``target``)." -msgstr "" -"En caso de ``type`` = **'e'**: Peso de la arista actual (``source``, " -"``target``)." +msgid "When ``type`` = **'e'**: Weight of the current edge (``source``, ``target``)." +msgstr "En caso de ``type`` = **'e'**: Peso de la arista actual (``source``, ``target``)." msgid "Only dead end contraction" msgstr "Sólo contracción sin salida" @@ -12040,30 +8972,17 @@ msgstr "Sólo contracción lineal" msgid "The cycle" msgstr "El ciclo" -msgid "" -"Contracting a graph can be done with more than one operation. The order of " -"the operations affect the resulting contracted graph, after applying one " -"operation, the set of vertices that can be contracted by another operation " -"changes." -msgstr "" -"Contraer un grafo se puede hacer con más de una operación. El orden de las " -"operaciones afecta al grafo contraído resultante, después de aplicar una " -"operación, el conjunto de vértices que se pueden contraer con otra operación " -"cambia." +msgid "Contracting a graph can be done with more than one operation. The order of the operations affect the resulting contracted graph, after applying one operation, the set of vertices that can be contracted by another operation changes." +msgstr "Contraer un grafo se puede hacer con más de una operación. El orden de las operaciones afecta al grafo contraído resultante, después de aplicar una operación, el conjunto de vértices que se pueden contraer con otra operación cambia." msgid "This implementation cycles ``cycles`` times through the ``methods`` ." -msgstr "" -"Esta implementación cicla `` cycles`` veces a través de los ``methods``." +msgstr "Esta implementación cicla `` cycles`` veces a través de los ``methods``." msgid "Contracting sample data" msgstr "Contracción de los datos de muestra" -msgid "" -"In this section, building and using a contracted graph will be shown by " -"example." -msgstr "" -"En esta sección, la creación y el uso de un grafo contraído se mostrarán en " -"el ejemplo." +msgid "In this section, building and using a contracted graph will be shown by example." +msgstr "En esta sección, la creación y el uso de un grafo contraído se mostrarán en el ejemplo." msgid "The :doc:`sampledata` for an undirected graph is used" msgstr "Se usa :doc:`sampledata` para un grafo no dirigido" @@ -12077,21 +8996,11 @@ msgstr "Construcción del grafo en la base de datos" msgid "The original graph:" msgstr "El grafo original:" -msgid "" -"The results do not represent the contracted graph. They represent the " -"changes that need to be done to the graph after applying the contraction " -"methods." -msgstr "" -"Los resultados no representan al grafo contraído. Representan los cambios " -"que necesitan hacerse en el grafo después de aplicar los métodos de " -"contracción." +msgid "The results do not represent the contracted graph. They represent the changes that need to be done to the graph after applying the contraction methods." +msgstr "Los resultados no representan al grafo contraído. Representan los cambios que necesitan hacerse en el grafo después de aplicar los métodos de contracción." -msgid "" -"Observe that vertices, for example, :math:`6` do not appear in the results " -"because it was not affected by the contraction algorithm." -msgstr "" -"Observe que los vértices, por ejemplo, :math:`6` , no aparecen en los " -"resultados porque no se vieron afectados por el algoritmo de contracción." +msgid "Observe that vertices, for example, :math:`6` do not appear in the results because it was not affected by the contraction algorithm." +msgstr "Observe que los vértices, por ejemplo, :math:`6` , no aparecen en los resultados porque no se vieron afectados por el algoritmo de contracción." msgid "After doing the dead end contraction operation:" msgstr "Después de realizar la operación de contracción sin salida:" @@ -12105,9 +9014,7 @@ msgstr "El proceso para crear el grafo de contracción en la base de datos:" msgid "Add additional columns" msgstr "Añadir columnas adicionales" -msgid "" -"Adding extra columns to the edges and vertices tables. In this documentation " -"the following will be used:" +msgid "Adding extra columns to the edges and vertices tables. In this documentation the following will be used:" msgstr "" msgid "Column." @@ -12122,17 +9029,11 @@ msgstr "``is_contracted``" msgid "On the vertex table" msgstr "En la tabla de vértices" -msgid "" -"when ``true`` the vertex is contracted, its not part of the contracted graph." -msgstr "" -"En caso de ''true'' se contrae el vértice, no forma parte del grafo " -"contraído." +msgid "when ``true`` the vertex is contracted, its not part of the contracted graph." +msgstr "En caso de ''true'' se contrae el vértice, no forma parte del grafo contraído." -msgid "" -"when ``false`` the vertex is not contracted, its part of the contracted " -"graph." -msgstr "" -"En caso de ''false'' el vértice no se contrae, su parte del grafo contraído." +msgid "when ``false`` the vertex is not contracted, its part of the contracted graph." +msgstr "En caso de ''false'' el vértice no se contrae, su parte del grafo contraído." msgid "``is_new``" msgstr "``is_new``" @@ -12140,19 +9041,11 @@ msgstr "``is_new``" msgid "On the edge table" msgstr "En la tabla de aristas" -msgid "" -"when ``true`` the edge was generated by the contraction algorithm. its part " -"of the contracted graph." -msgstr "" -"En caso de `` true``, la arista se generó por el algoritmo de contracción. " -"Es parte del grafo contraído." +msgid "when ``true`` the edge was generated by the contraction algorithm. its part of the contracted graph." +msgstr "En caso de `` true``, la arista se generó por el algoritmo de contracción. Es parte del grafo contraído." -msgid "" -"when ``false`` the edge is an original edge, might be or not part of the " -"contracted graph." -msgstr "" -"En caso de ``false`` , la arista es una arista original, podría ser o no " -"parte del grafo contraído." +msgid "when ``false`` the edge is an original edge, might be or not part of the contracted graph." +msgstr "En caso de ``false`` , la arista es una arista original, podría ser o no parte del grafo contraído." msgid "Store contraction information" msgstr "Almacenar información de contracción" @@ -12163,17 +9056,11 @@ msgstr "Almacenar los resultados de la contracción en una tabla." msgid "Update the edges and vertices tables" msgstr "Actualizar las tablas de aristas y vértices" -msgid "" -"Use ``is_contracted`` column to indicate the vertices that are contracted." -msgstr "" -"Usar la columna ``is_contracted`` para indicar los vértices contraídos." +msgid "Use ``is_contracted`` column to indicate the vertices that are contracted." +msgstr "Usar la columna ``is_contracted`` para indicar los vértices contraídos." -msgid "" -"Fill ``contracted_vertices`` with the information from the results that " -"belong to the vertices." -msgstr "" -"Llenar ``contracted_vertices`` con la información de los resultados que " -"pertenecen a los vértices." +msgid "Fill ``contracted_vertices`` with the information from the results that belong to the vertices." +msgstr "Llenar ``contracted_vertices`` con la información de los resultados que pertenecen a los vértices." msgid "Insert the new edges generated by pgr_contraction." msgstr "Inserte las nuevas aristas generadas por pgr_contraction." @@ -12193,19 +9080,11 @@ msgstr "Visualmente:" msgid "Using the contracted graph" msgstr "Usando el grafo contraído" -msgid "" -"Depending on the final application the graph is to be prepared. In this " -"example the final application will be to calculate the cost from two " -"vertices in the original graph by using the contracted graph with " -"``pgr_dijkstraCost``" +msgid "Depending on the final application the graph is to be prepared. In this example the final application will be to calculate the cost from two vertices in the original graph by using the contracted graph with ``pgr_dijkstraCost``" msgstr "" -msgid "" -"There are three cases when calculating the shortest path between a given " -"source and target in a contracted graph:" -msgstr "" -"Hay tres casos al calcular la ruta más corta entre un origen y un destino " -"determinados en un grafo contraído:" +msgid "There are three cases when calculating the shortest path between a given source and target in a contracted graph:" +msgstr "Hay tres casos al calcular la ruta más corta entre un origen y un destino determinados en un grafo contraído:" msgid "Case 1: Both source and target belong to the contracted graph." msgstr "Caso 1: Tanto el origen como el destino pertenecen al grafo contraído." @@ -12225,27 +9104,17 @@ msgstr "Crear una vista (o tabla) del grafo Contraído:" msgid "Create the function that will use the contracted graph." msgstr "Crear la función que va a utilizar el grafo contraído." -msgid "" -"Case 2: Source and/or target belong to an edge that has contracted vertices." -msgstr "" -"Caso 2: El origen y/o el destino pertenecen a una arista que ha contraído " -"vertices." +msgid "Case 2: Source and/or target belong to an edge that has contracted vertices." +msgstr "Caso 2: El origen y/o el destino pertenecen a una arista que ha contraído vertices." -msgid "" -"Case 3: Source and/or target belong to a vertex that has been contracted." -msgstr "" -"Caso 3: El origen y/o el destino pertenecen a un vértice que ha sido " -"contraído." +msgid "Case 3: Source and/or target belong to a vertex that has been contracted." +msgstr "Caso 3: El origen y/o el destino pertenecen a un vértice que ha sido contraído." msgid "``pgr_contractionDeadEnd`` - Proposed" msgstr "``pgr_contractionDeadEnd`` - Propuesto" -msgid "" -"``pgr_contractionDeadEnd`` — Performs graph contraction and returns the " -"contracted vertices and edges." -msgstr "" -"``pgr_contractionDeadEnd`` — Realiza la contracción del grafo y devuelve los " -"vértices y aristas contraídos.." +msgid "``pgr_contractionDeadEnd`` — Performs graph contraction and returns the contracted vertices and edges." +msgstr "``pgr_contractionDeadEnd`` — Realiza la contracción del grafo y devuelve los vértices y aristas contraídos.." msgid "A node is considered a dead end node when:" msgstr "Un nodo se considera sin salida cuando:" @@ -12262,8 +9131,7 @@ msgstr "En grafos dirigidos:" msgid "When there is only one adjacent vertex or" msgstr "Cuando hay solo un vértice adyacente o" -msgid "" -"When all edges are incoming regardless of the number of adjacent vertices." +msgid "When all edges are incoming regardless of the number of adjacent vertices." msgstr "" msgid "pgr_contractionDeadEnd(`Edges SQL`_, [**options**])" @@ -12279,9 +9147,7 @@ msgid "The green nodes are dead end nodes." msgstr "Los nodos verdes son nodos sin salida." msgid "Node :math:`3` is a dead end node after node :math:`1` is contracted." -msgstr "" -"El nodo :math:`3` es sin salida después de haberse contraído el nodo :math:" -"`1`." +msgstr "El nodo :math:`3` es sin salida después de haberse contraído el nodo :math:`1`." msgid "``ARRAY[`` |ANY-INTEGER| ``]``" msgstr "``ARRAY[`` |ANY-INTEGER| ``]``" @@ -12316,11 +9182,8 @@ msgstr "Vértice sin salida en un grafo dirigido" msgid "The green nodes are dead end nodes" msgstr "Los nodos verdes son nodos sin salida" -msgid "" -"The blue nodes have an unlimited number of incoming and/or outgoing edges." -msgstr "" -"Los nodos azules tienen un número ilimitado de aristas entrantes y/o " -"salientes." +msgid "The blue nodes have an unlimited number of incoming and/or outgoing edges." +msgstr "Los nodos azules tienen un número ilimitado de aristas entrantes y/o salientes." msgid "Node" msgstr "Nodo" @@ -12382,47 +9245,26 @@ msgstr ":math:`1,2,3,4,5`" msgid "Many adjacent nodes." msgstr "Muchos nodos adyacentes." -msgid "" -"Has more than one adjacent node and some edges are incoming and some are " -"outgoing." +msgid "Has more than one adjacent node and some edges are incoming and some are outgoing." msgstr "" -msgid "" -"From above, nodes :math:`\\{6, 7, 9\\}` are dead ends because the total " -"number of adjacent vertices is one." -msgstr "" -"De arriba, nodes :math:`\\{6, 7, 9\\}` son sin salida por que el número de " -"vértices adyacentes es 1." +msgid "From above, nodes :math:`\\{6, 7, 9\\}` are dead ends because the total number of adjacent vertices is one." +msgstr "De arriba, nodes :math:`\\{6, 7, 9\\}` son sin salida por que el número de vértices adyacentes es 1." -msgid "" -"When there are more than one adjacent vertex, all edges need to be all " -"incoming edges otherwise it is not a dead end." +msgid "When there are more than one adjacent vertex, all edges need to be all incoming edges otherwise it is not a dead end." msgstr "" msgid "Step by step dead end contraction" msgstr "Paso a paso contracción sin salida" -msgid "" -"The dead end contraction will stop until there are no more dead end nodes. " -"For example, from the following graph where :math:`3` is the dead end node:" -msgstr "" -"La contracción sin salida se detendrá hasta que no haya más nodos sin " -"salida. Por ejemplo, del siguiente grafo donde :math:`3` es el nodo sin " -"salida:" +msgid "The dead end contraction will stop until there are no more dead end nodes. For example, from the following graph where :math:`3` is the dead end node:" +msgstr "La contracción sin salida se detendrá hasta que no haya más nodos sin salida. Por ejemplo, del siguiente grafo donde :math:`3` es el nodo sin salida:" -msgid "" -"After contracting :math:`3`, node :math:`2` is now a dead end node and is " -"contracted:" -msgstr "" -"Después de contraer :math:`3`, el nodo ` :math:`2` es ahora un nodo sin " -"salida y es contraído:" +msgid "After contracting :math:`3`, node :math:`2` is now a dead end node and is contracted:" +msgstr "Después de contraer :math:`3`, el nodo ` :math:`2` es ahora un nodo sin salida y es contraído:" -msgid "" -"After contracting :math:`2`, stop. Node :math:`1` has the information of " -"nodes that were contracted." -msgstr "" -"Después de contraer :math:`2`, detener. El nodo :math:`1` tiene la " -"información de los nodos que se contraen." +msgid "After contracting :math:`2`, stop. Node :math:`1` has the information of nodes that were contracted." +msgstr "Después de contraer :math:`2`, detener. El nodo :math:`1` tiene la información de los nodos que se contraen." msgid "Creating the contracted graph" msgstr "Creando el grafo contraído" @@ -12453,77 +9295,35 @@ msgid "``pgr_contractionHierarchies`` - Experimental" msgstr "``pgr_breadthFirstSearch`` - Experimental" #, fuzzy -msgid "" -"``pgr_contractionHierarchies`` — Performs graph contraction according to the " -"contraction hierarchies method and returns the contracted vertices and " -"shortcut edges created." -msgstr "" -"``pgr_contractionLinear`` — Realiza la contracción del grafo y devuelve los " -"vértices y aristas contraídos.." +msgid "``pgr_contractionHierarchies`` — Performs graph contraction according to the contraction hierarchies method and returns the contracted vertices and shortcut edges created." +msgstr "``pgr_contractionLinear`` — Realiza la contracción del grafo y devuelve los vértices y aristas contraídos.." -msgid "" -"The contraction hierarchies method builds, from an initial order of the " -"vertices, a hierarchical order, giving priority to some vertices during the " -"processing of label fixing of shortest paths algorithms. Furthermore, the " -"contraction hierarchies algorithm adds shortcut edges in the graph, that " -"helps the shortest paths algorithm to follow the created hierarchical graph " -"structure." +msgid "The contraction hierarchies method builds, from an initial order of the vertices, a hierarchical order, giving priority to some vertices during the processing of label fixing of shortest paths algorithms. Furthermore, the contraction hierarchies algorithm adds shortcut edges in the graph, that helps the shortest paths algorithm to follow the created hierarchical graph structure." msgstr "" -msgid "" -"The idea of the hierarchy is to put at a high priority level vertices that " -"belong to the long distance network (highways for example in a road network) " -"and to a low level of priority nodes that belong to the short distance " -"network (arterials or secondary roads for example in road networks)." +msgid "The idea of the hierarchy is to put at a high priority level vertices that belong to the long distance network (highways for example in a road network) and to a low level of priority nodes that belong to the short distance network (arterials or secondary roads for example in road networks)." msgstr "" -msgid "" -"The contraction hierarchies algorithm makes the assumption that there is " -"already a valuable vertices order that is used to initialize the contraction " -"process. As in most cases there is no valuable initial node ordering, we use " -"the order given by vertices ID. Then, the contraction process is made on the " -"basis of this first order to give the final hierarchy." +msgid "The contraction hierarchies algorithm makes the assumption that there is already a valuable vertices order that is used to initialize the contraction process. As in most cases there is no valuable initial node ordering, we use the order given by vertices ID. Then, the contraction process is made on the basis of this first order to give the final hierarchy." msgstr "" -msgid "" -"The basic idea is to keep the vertices in a priority queue sorted by some " -"estimate of how attractive is their contraction. The implemented case uses " -"the metric called *edge difference*, which corresponds to the difference " -"between the number of shortcuts produced by a vertex contraction and the " -"number of incident edges in the graph before contraction (``#shortcuts - " -"#incident edges``)." +msgid "The basic idea is to keep the vertices in a priority queue sorted by some estimate of how attractive is their contraction. The implemented case uses the metric called *edge difference*, which corresponds to the difference between the number of shortcuts produced by a vertex contraction and the number of incident edges in the graph before contraction (``#shortcuts - #incident edges``)." msgstr "" -msgid "" -"Finally, the aim is to reduce the explored part of the graph, when using a " -"bidirectional Dijkstra-like algorithm. The vertices order is used to feed " -"the oriented search. The search is made without losing optimality." +msgid "Finally, the aim is to reduce the explored part of the graph, when using a bidirectional Dijkstra-like algorithm. The vertices order is used to feed the oriented search. The search is made without losing optimality." msgstr "" -msgid "" -"Finding an optimal vertices ordering for contraction is a difficult problem. " -"Nevertheless, very simple local heuristics work quite well, according to " -"Geisberger et al. [2]. The principle here is to a priori estimate the value " -"of the *edge difference* and to contract the node at the top of the queue " -"only if the new value of the metric keeps it at the top of the queue. " -"Otherwise, it is reinserted in the queue, at its right place corresponding " -"to the new metric value." +msgid "Finding an optimal vertices ordering for contraction is a difficult problem. Nevertheless, very simple local heuristics work quite well, according to Geisberger et al. [2]. The principle here is to a priori estimate the value of the *edge difference* and to contract the node at the top of the queue only if the new value of the metric keeps it at the top of the queue. Otherwise, it is reinserted in the queue, at its right place corresponding to the new metric value." msgstr "" #, fuzzy msgid "The process is done on graphs having only edges with positive costs." msgstr "El proceso se realiza sólo en aristas con costos positivos." -msgid "" -"It is necessary to remember that there are no deleted vertices with this " -"function. At the end, the graph keeps every vertex it had, but has some " -"added edges, corresponding to shortcuts. The vertices which have been " -"contracted, to build the shortcut edges, are kept and hierarchically ordered." +msgid "It is necessary to remember that there are no deleted vertices with this function. At the end, the graph keeps every vertex it had, but has some added edges, corresponding to shortcuts. The vertices which have been contracted, to build the shortcut edges, are kept and hierarchically ordered." msgstr "" -msgid "" -"As for the other contraction methods, it does not return the full contracted " -"graph, only the changes. They are here of two types:" +msgid "As for the other contraction methods, it does not return the full contracted graph, only the changes. They are here of two types:" msgstr "" msgid "added shortcut edges, with negative identifiers;" @@ -12533,8 +9333,7 @@ msgid "contracted nodes with an order." msgstr "" #, fuzzy -msgid "" -"The ``pgr_contractionHierarchies`` function has the following signature:" +msgid "The ``pgr_contractionHierarchies`` function has the following signature:" msgstr "La función pgr_transitiveClosure tiene la siguiente firma:" #, fuzzy @@ -12554,9 +9353,7 @@ msgid "True if the graph is directed, False otherwise." msgstr "Cuando el grafo es dirigido el resultado es dirigido." #, fuzzy -msgid "" -"The function returns many rows (one per vertex and one per shortcut edge " -"created). The columns of the rows are:" +msgid "The function returns many rows (one per vertex and one per shortcut edge created). The columns of the rows are:" msgstr "La función devuelve una sola fila. Las columnas de la fila son:" #, fuzzy @@ -12580,40 +9377,25 @@ msgstr "``vertex_id``" msgid "On an undirected graph" msgstr "En un grafo no dirigido" -msgid "" -"The following query shows the original data involved in the contraction " -"operation on an undirected graph." +msgid "The following query shows the original data involved in the contraction operation on an undirected graph." msgstr "" msgid "building contraction hierarchies on the whole graph" msgstr "" -msgid "" -"The results do not represent the contracted graph. They represent the " -"changes done to the graph after applying the contraction algorithm and give " -"the vertex order built by the algorithm, by ordering vertices according to " -"the *edge difference* metric. As a consequence, vertices are all represented " -"in the result (except of course forbidden ones). Only shortcut built by the " -"algorithm are represented in the result." +msgid "The results do not represent the contracted graph. They represent the changes done to the graph after applying the contraction algorithm and give the vertex order built by the algorithm, by ordering vertices according to the *edge difference* metric. As a consequence, vertices are all represented in the result (except of course forbidden ones). Only shortcut built by the algorithm are represented in the result." msgstr "" -msgid "" -"After computing the contraction hierarchies, an order is now given to the " -"vertices," +msgid "After computing the contraction hierarchies, an order is now given to the vertices," msgstr "" -msgid "" -"in order to be used with a specific Dijkstra algorithm (implementation " -"coming in a future version), which speeds up the search." +msgid "in order to be used with a specific Dijkstra algorithm (implementation coming in a future version), which speeds up the search." msgstr "" msgid "We obtain the contracted graph above:" msgstr "Se obtiene el grafo contraído anterior:" -msgid "" -"We can see without surprise that the vertices belonging to the shortcuts " -"have a tendency to have a high priority level in the resulting vertices " -"order." +msgid "We can see without surprise that the vertices belonging to the shortcuts have a tendency to have a high priority level in the resulting vertices order." msgstr "" #, fuzzy @@ -12631,24 +9413,13 @@ msgstr "Contracción de los datos de muestra" msgid "Shortcut building process" msgstr "Proceso de compilación con CMake" -msgid "" -"A vertex ``v`` is contracted by adding shortcuts replacing former paths of " -"the form ``(u, v, w)`` by an edge ``(u, w)``. The shortcut ``(u, w)`` is " -"only needed when ``(u, v, w)`` is the only shortest path between ``u`` and " -"``w``." +msgid "A vertex ``v`` is contracted by adding shortcuts replacing former paths of the form ``(u, v, w)`` by an edge ``(u, w)``. The shortcut ``(u, w)`` is only needed when ``(u, v, w)`` is the only shortest path between ``u`` and ``w``." msgstr "" -msgid "" -"When all shortcuts have been added for a given vertex ``v``, the incident " -"edges of ``v`` are removed and another vertex is contracted with the " -"remaining graph." +msgid "When all shortcuts have been added for a given vertex ``v``, the incident edges of ``v`` are removed and another vertex is contracted with the remaining graph." msgstr "" -msgid "" -"The procedure is destructive for the graph and a copy is made to be able to " -"manipulate it again as a whole. The contraction process adds all discovered " -"shortcuts to the edge set ``E`` and attributes a metric to each contracted " -"vertex. This metric is giving what is called the *contraction hierarchy*." +msgid "The procedure is destructive for the graph and a copy is made to be able to manipulate it again as a whole. The contraction process adds all discovered shortcuts to the edge set ``E`` and attributes a metric to each contracted vertex. This metric is giving what is called the *contraction hierarchy*." msgstr "" msgid "Initialize the queue with a first vertices order" @@ -12700,52 +9471,29 @@ msgstr ":math:`\\{2, 3\\}`" msgid "Adjacent edges are removed." msgstr "" -msgid "" -"Shortcuts are built from predecessors of ``v`` to successors of ``v`` if and " -"only if the path through ``v`` corresponds to the only shortest path between " -"the predecessor and the successor of ``v`` in the graph. The *edge " -"difference* metric here takes the value of -2." +msgid "Shortcuts are built from predecessors of ``v`` to successors of ``v`` if and only if the path through ``v`` corresponds to the only shortest path between the predecessor and the successor of ``v`` in the graph. The *edge difference* metric here takes the value of -2." msgstr "" -msgid "" -"Then the following vertex is contracted. The process goes on until each node " -"of the graph has been contracted. At the end, there are no more edges in the " -"graph, which has been destroyed by the process." +msgid "Then the following vertex is contracted. The process goes on until each node of the graph has been contracted. At the end, there are no more edges in the graph, which has been destroyed by the process." msgstr "" -msgid "" -"This first contraction will give a vertices order, given by ordering them in " -"ascending order on the metric (edge difference). A total vertices order is " -"built. If ``u < v``, then ``u`` is less important than ``v``. The algorithm " -"keeps the vertices into a queue in this order." +msgid "This first contraction will give a vertices order, given by ordering them in ascending order on the metric (edge difference). A total vertices order is built. If ``u < v``, then ``u`` is less important than ``v``. The algorithm keeps the vertices into a queue in this order." msgstr "" -msgid "" -"A hierarchy will now be constructed by contracting again the vertices in " -"this order." +msgid "A hierarchy will now be constructed by contracting again the vertices in this order." msgstr "" msgid "Build the final vertex order" msgstr "Construir el orden final de los vértices" -msgid "" -"Once the first order built, the algorithm uses it to browse the graph once " -"again. For each vertex taken in the queue, the algorithm simulates " -"contraction and calculates its edge difference. If the computed value is " -"greater than the one of the next vertex to be contracted, then the algorithm " -"puts it back in the queue (heuristic approach). Otherwise it contracts it " -"permanently." +msgid "Once the first order built, the algorithm uses it to browse the graph once again. For each vertex taken in the queue, the algorithm simulates contraction and calculates its edge difference. If the computed value is greater than the one of the next vertex to be contracted, then the algorithm puts it back in the queue (heuristic approach). Otherwise it contracts it permanently." msgstr "" #, fuzzy msgid "Add shortcuts to the initial graph" msgstr "corte mínimo de el subgrafo principal" -msgid "" -"At the end, the algorithm takes the initial graph (before edges deletions) " -"and adds the shortcut edges to it. It gives you the contracted graph, ready " -"to use with a specialized Dijkstra algorithm, which takes into account the " -"order of the nodes in the hierarchy." +msgid "At the end, the algorithm takes the initial graph (before edges deletions) and adds the shortcut edges to it. It gives you the contracted graph, ready to use with a specialized Dijkstra algorithm, which takes into account the order of the nodes in the hierarchy." msgstr "" #, fuzzy @@ -12759,8 +9507,7 @@ msgstr "Contracción sin salida" msgid "Add shortcuts and hierarchy in the existing tables" msgstr "" -msgid "" -"Add new columns in the `vertices` and `edges` tables to store the results:" +msgid "Add new columns in the `vertices` and `edges` tables to store the results:" msgstr "" msgid "Update and insert the results in the two tables." @@ -12769,20 +9516,14 @@ msgstr "" msgid "Use a Dijkstra shortest path algorithm on it" msgstr "Aplicarle el algoritmo Dijkstra del camino más corto" -msgid "" -"Then you can use any Dijkstra-like algorithm, waiting for the adapted one " -"which will take into account the built vertices hierarchy. For example:" +msgid "Then you can use any Dijkstra-like algorithm, waiting for the adapted one which will take into account the built vertices hierarchy. For example:" msgstr "" msgid "``pgr_contractionLinear`` - Proposed" msgstr "``pgr_contractionLinear`` - Propuesto" -msgid "" -"``pgr_contractionLinear`` — Performs graph contraction and returns the " -"contracted vertices and edges." -msgstr "" -"``pgr_contractionLinear`` — Realiza la contracción del grafo y devuelve los " -"vértices y aristas contraídos.." +msgid "``pgr_contractionLinear`` — Performs graph contraction and returns the contracted vertices and edges." +msgstr "``pgr_contractionLinear`` — Realiza la contracción del grafo y devuelve los vértices y aristas contraídos.." msgid "pgr_contractionLinear(`Edges SQL`_, [**options**])" msgstr "pgr_contractionLinear(`SQL de aristas`_, [**opciones**])" @@ -12790,9 +9531,7 @@ msgstr "pgr_contractionLinear(`SQL de aristas`_, [**opciones**])" msgid "Linear contraction on an undirected graph." msgstr "Contracción lineal en un grafo no dirigido." -msgid "" -"The green nodes are linear nodes and will not be part of the contracted " -"graph." +msgid "The green nodes are linear nodes and will not be part of the contracted graph." msgstr "Los nodos verdes son lineales y no forman parte del grafo contraído." msgid "All edges adjacent will not be part of the contracted graph." @@ -12804,12 +9543,8 @@ msgstr "Las lineas verdes son aristas que pertenecen al grafo contraído." msgid "**contraction Order**" msgstr "**Orden de contracciones**" -msgid "" -"Number of times the contraction operations on ``contraction_order`` will be " -"performed." -msgstr "" -"Número de veces que se realizarán las operaciones de contracción en el orden " -"``contraction_order``." +msgid "Number of times the contraction operations on ``contraction_order`` will be performed." +msgstr "Número de veces que se realizarán las operaciones de contracción en el orden ``contraction_order``." msgid "A node connects two (or more) `linear` edges when" msgstr "" @@ -12829,14 +9564,10 @@ msgstr "La linealidad no es simétrica" msgid "Graph where linearity is not symmetrical." msgstr "Grafo cuando la linealidad no es simétrica." -msgid "" -"When the graph is processed as a directed graph, linearity is not " -"symmetrical, therefore the graph can not be contracted." +msgid "When the graph is processed as a directed graph, linearity is not symmetrical, therefore the graph can not be contracted." msgstr "" -msgid "" -"When the same graph is processed as an undirected graph, linearity is " -"symmetrical, therefore the graph can be contracted." +msgid "When the same graph is processed as an undirected graph, linearity is symmetrical, therefore the graph can be contracted." msgstr "" msgid "The three edges can be replaced by one undirected edge" @@ -12872,12 +9603,8 @@ msgstr "Las cuatro aristas pueden ser reemplazadas con una arista no dirigida." msgid "Step by step linear contraction" msgstr "Contracción lineal, paso a paso" -msgid "" -"The linear contraction will stop when there are no more linear edges. For " -"example from the following graph there are linear edges" -msgstr "" -"La contracción lineal se detendrá hasta que no hayan más aristas lineales. " -"Por ejemplo, en el siguiente grafo hay aristas lineales" +msgid "The linear contraction will stop when there are no more linear edges. For example from the following graph there are linear edges" +msgstr "La contracción lineal se detendrá hasta que no hayan más aristas lineales. Por ejemplo, en el siguiente grafo hay aristas lineales" msgid "Contracting vertex :math:`3`," msgstr "Contrayendo el vértice :math:`3`," @@ -12885,18 +9612,11 @@ msgstr "Contrayendo el vértice :math:`3`," msgid "The vertex :math:`3` is removed from the graph" msgstr "El vértice :math:`3` se elimina del grafo" -msgid "" -"The edges :math:`2 \\rightarrow 3` and :math:`w \\rightarrow z` are removed " -"from the graph." -msgstr "" -"Los aristas :math:`2 \\rightarrow 3` y :math:`w \\rightarrow z` fueron " -"eliminados del grafo." +msgid "The edges :math:`2 \\rightarrow 3` and :math:`w \\rightarrow z` are removed from the graph." +msgstr "Los aristas :math:`2 \\rightarrow 3` y :math:`w \\rightarrow z` fueron eliminados del grafo." -msgid "" -"A new edge :math:`2 \\rightarrow 4` is inserted represented with red color." -msgstr "" -"Se inserta una nuevo arista :math:`2 \\rightarrow 4` y se representa con " -"color rojo." +msgid "A new edge :math:`2 \\rightarrow 4` is inserted represented with red color." +msgstr "Se inserta una nuevo arista :math:`2 \\rightarrow 4` y se representa con color rojo." msgid "Contracting vertex :math:`2`:" msgstr "Contrayendo el vértice :math:`2`:" @@ -12904,25 +9624,14 @@ msgstr "Contrayendo el vértice :math:`2`:" msgid "The vertex :math:`2` is removed from the graph" msgstr "El vértice :math:`2` se elimina del grafo" -msgid "" -"The edges :math:`1 \\rightarrow 2` and :math:`2 \\rightarrow 3` are removed " -"from the graph." -msgstr "" -"Los aristas :math:`1 \\rightarrow 2` y :math:`2 \\rightarrow 3` son " -"eliminados del grafo." +msgid "The edges :math:`1 \\rightarrow 2` and :math:`2 \\rightarrow 3` are removed from the graph." +msgstr "Los aristas :math:`1 \\rightarrow 2` y :math:`2 \\rightarrow 3` son eliminados del grafo." -msgid "" -"A new edge :math:`1 \\rightarrow 3` is inserted represented with red color." -msgstr "" -"Se inserta una nuevo arista :math:`1 \\rightarrow 3` y se representa con " -"color rojo." +msgid "A new edge :math:`1 \\rightarrow 3` is inserted represented with red color." +msgstr "Se inserta una nuevo arista :math:`1 \\rightarrow 3` y se representa con color rojo." -msgid "" -"Edge :math:`1 \\rightarrow 3` has the information of cost and the nodes that " -"were contracted." -msgstr "" -"El arista :math:`1 \\rightarrow 3` tiene la información de los costos y " -"nodos que fueron contraídos." +msgid "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." @@ -12930,44 +9639,23 @@ msgstr "Crear el grafo contraído." msgid "``pgr_cuthillMckeeOrdering`` - Experimental" msgstr "``pgr_cuthillMckeeOrdering`` - Experimental" -msgid "" -"``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of " -"an undirected graphs" -msgstr "" -"``pgr_cuthillMckeeOrdering`` —Ordenamiento Cuthill-Mckee de grapos no " -"dirigidos" +msgid "``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of an undirected graphs" +msgstr "``pgr_cuthillMckeeOrdering`` —Ordenamiento Cuthill-Mckee de grapos no dirigidos" msgid "Version 3.4.0" msgstr "Versión 3.4.0" -msgid "" -"In numerical linear algebra, the Cuthill-McKee algorithm (CM), named after " -"Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse " -"matrix that has a symmetric sparsity pattern into a band matrix form with a " -"small bandwidth." -msgstr "" -"En álgebra lineal numérica, el algoritmo Cuthill-McKee (CM), llamado así por " -"Elizabeth Cuthill y James McKee, es un algoritmo para permutar una matriz " -"dispersa que tiene un patrón de dispersidad simétrico en una forma de matriz " -"de banda con un ancho de banda pequeño." +msgid "In numerical linear algebra, the Cuthill-McKee algorithm (CM), named after Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse matrix that has a symmetric sparsity pattern into a band matrix form with a small bandwidth." +msgstr "En álgebra lineal numérica, el algoritmo Cuthill-McKee (CM), llamado así por Elizabeth Cuthill y James McKee, es un algoritmo para permutar una matriz dispersa que tiene un patrón de dispersidad simétrico en una forma de matriz de banda con un ancho de banda pequeño." -msgid "" -"The vertices are basically assigned a breadth-first search order, except " -"that at each step, the adjacent vertices are placed in the queue in order of " -"increasing degree." -msgstr "" -"Básicamente, se asigna a los vértices un orden de búsqueda breadth-first, " -"con la salvedad de que, en cada paso, los vértices adyacentes se colocan en " -"la cola por orden creciente de grado." +msgid "The vertices are basically assigned a breadth-first search order, except that at each step, the adjacent vertices are placed in the queue in order of increasing degree." +msgstr "Básicamente, se asigna a los vértices un orden de búsqueda breadth-first, con la salvedad de que, en cada paso, los vértices adyacentes se colocan en la cola por orden creciente de grado." msgid "The implementation is for **undirected** graphs." msgstr "La implementación es para grafos **no dirigidos**." -msgid "" -"The bandwidth minimization problems are considered NP-complete problems." -msgstr "" -"Los problemas de minimización del ancho de banda se consideran problemas NP-" -"completos." +msgid "The bandwidth minimization problems are considered NP-complete problems." +msgstr "Los problemas de minimización del ancho de banda se consideran problemas NP-completos." msgid "The running time complexity is: :math:`O(m log(m)|V|)`" msgstr "Tiempo de ejecución es: :math:`O(m log(m)|V|)`" @@ -12996,75 +9684,38 @@ msgstr "Valor secuencial a partir de 1." msgid "New ordering in reverse order." msgstr "Nuevo ordenamiento es en orden inverso." -msgid "" -"`Boost: Cuthill-McKee Ordering `__" -msgstr "" -"`Boost: Ordernamiento Cuthill-McKee `__" +msgid "`Boost: Cuthill-McKee Ordering `__" +msgstr "`Boost: Ordernamiento Cuthill-McKee `__" -msgid "" -"`Wikipedia: Cuthill-McKee Ordering `__" -msgstr "" -"`Wikipedia: Ordenamiento Cuthill-McKee `__" +msgid "`Wikipedia: Cuthill-McKee Ordering `__" +msgstr "`Wikipedia: Ordenamiento Cuthill-McKee `__" msgid "``pgr_dagShortestPath`` - Experimental" msgstr "``pgr_dagShortestPath`` - Experimental" -msgid "" -"``pgr_dagShortestPath`` — Returns the shortest path for weighted directed " -"acyclic graphs(DAG). In particular, the DAG shortest paths algorithm " -"implemented by Boost.Graph." -msgstr "" -"``pgr_dagShortestPath`` - Devuelve el camino más corto para grafos acíclicos " -"dirigidos ponderados (DAG). En particular, el algoritmo de caminos más " -"cortos DAG implementado por Boost.Graph." +msgid "``pgr_dagShortestPath`` — Returns the shortest path for weighted directed acyclic graphs(DAG). In particular, the DAG shortest paths algorithm implemented by Boost.Graph." +msgstr "``pgr_dagShortestPath`` - Devuelve el camino más corto para grafos acíclicos dirigidos ponderados (DAG). En particular, el algoritmo de caminos más cortos DAG implementado por Boost.Graph." msgid "pgr_dagShortestPath(Combinations)" msgstr "pgr_dagShortestPath(Combinaciones)" -msgid "" -"Shortest Path for Directed Acyclic Graph(DAG) is a graph search algorithm " -"that solves the shortest path problem for weighted directed acyclic graph, " -"producing a shortest path from a starting vertex (``start_vid``) to an " -"ending vertex (``end_vid``)." -msgstr "" -"Ruta Más Corta para grafos acíclicos dirigidos (DAG) es un algoritmo de " -"búsqueda de grafos que resuelve el problema de ruta más corta para el grafo " -"acíclico dirigido ponderado, produciendo una ruta más corta desde un vértice " -"inicial (``start_vid``) a un vértice final (``end_vid``)." +msgid "Shortest Path for Directed Acyclic Graph(DAG) is a graph search algorithm that solves the shortest path problem for weighted directed acyclic graph, producing a shortest path from a starting vertex (``start_vid``) to an ending vertex (``end_vid``)." +msgstr "Ruta Más Corta para grafos acíclicos dirigidos (DAG) es un algoritmo de búsqueda de grafos que resuelve el problema de ruta más corta para el grafo acíclico dirigido ponderado, produciendo una ruta más corta desde un vértice inicial (``start_vid``) a un vértice final (``end_vid``)." -msgid "" -"This implementation can only be used with a **directed** graph with no " -"cycles i.e. directed acyclic graph." -msgstr "" -"Esta implementación solo se puede utilizar con un grafo **dirigido** sin " -"ciclos i.e., es decir, un grafo acíclico dirigido." +msgid "This implementation can only be used with a **directed** graph with no cycles i.e. directed acyclic graph." +msgstr "Esta implementación solo se puede utilizar con un grafo **dirigido** sin ciclos i.e., es decir, un grafo acíclico dirigido." -msgid "" -"The algorithm relies on topological sorting the dag to impose a linear " -"ordering on the vertices, and thus is more efficient for DAG's than either " -"the Dijkstra or Bellman-Ford algorithm." -msgstr "" -"El algoritmo se basa en la ordenación topológica del dag para imponer un " -"orden lineal en los vértices, y por lo tanto es más eficaz para DAG que el " -"algoritmo Dijkstra o Bellman-Ford." +msgid "The algorithm relies on topological sorting the dag to impose a linear ordering on the vertices, and thus is more efficient for DAG's than either the Dijkstra or Bellman-Ford algorithm." +msgstr "El algoritmo se basa en la ordenación topológica del dag para imponer un orden lineal en los vértices, y por lo tanto es más eficaz para DAG que el algoritmo Dijkstra o Bellman-Ford." -msgid "" -"Process is valid for weighted directed acyclic graphs only. otherwise it " -"will throw warnings." -msgstr "" -"El proceso solo es válido para grafos acíclicos dirigidos ponderados, de lo " -"contrario lanzará advertencias." +msgid "Process is valid for weighted directed acyclic graphs only. otherwise it will throw warnings." +msgstr "El proceso solo es válido para grafos acíclicos dirigidos ponderados, de lo contrario lanzará advertencias." msgid "The `agg_cost` the non included values `(v, v)` is `0`" msgstr "El `agg_cost` de los valores no incluídos `(v, v)` es `0`" msgid "The `agg_cost` the non included values `(u, v)` is :math:`\\infty`" -msgstr "" -"El ``agg_cost`` de los valores no incluídos ``(u, v)`` es :math: `\\infty`" +msgstr "El ``agg_cost`` de los valores no incluídos ``(u, v)`` es :math: `\\infty`" msgid "Running time: :math:`O(| start\\_vids | * (V + E))`" msgstr "Tiempo de ejecución: :math:`O(| start\\_vids | * (V + E))`" @@ -13093,12 +9744,8 @@ msgstr "Desde el vértice :math:`5` a los vértices :math:`\\{ 7, 11\\}`" msgid "From vertices :math:`\\{5, 10\\}` to vertex :math:`11`" msgstr "Desde los vértices :math:`\\{5, 10\\}` al vértice :math:`11`" -msgid "" -"From vertices :math:`\\{5, 15\\}` to vertices :math:`\\{11, 17\\}` on an " -"**undirected** graph" -msgstr "" -"Desde los vértices :math:`\\{5, 15\\}` a los vértices :math:`\\{11, 17\\}` " -"en un grafo **no dirigido**" +msgid "From vertices :math:`\\{5, 15\\}` to vertices :math:`\\{11, 17\\}` on an **undirected** graph" +msgstr "Desde los vértices :math:`\\{5, 15\\}` a los vértices :math:`\\{11, 17\\}` en un grafo **no dirigido**" msgid "Return columns" msgstr "Columnas de Resultados" @@ -13106,12 +9753,8 @@ 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 "`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" @@ -13119,12 +9762,8 @@ msgstr "https://en.wikipedia.org/wiki/Topological_sorting" msgid "``pgr_degree``" msgstr "``pgr_degree``" -msgid "" -"``pgr_degree`` — For each vertex in an undirected graph, return the count of " -"edges incident to the vertex." -msgstr "" -"``pgr_degree`` - Para cada vértice de un grafo no dirigido, devuelve el " -"número de aristas incidentes en el vértice." +msgid "``pgr_degree`` — For each vertex in an undirected graph, return the count of edges incident to the vertex." +msgstr "``pgr_degree`` - Para cada vértice de un grafo no dirigido, devuelve el número de aristas incidentes en el vértice." msgid "Error messages adjustment." msgstr "" @@ -13135,12 +9774,8 @@ 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 "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 "" @@ -13151,20 +9786,13 @@ 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." +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 "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." +msgid "The code can be used as base code for the particular application requirements." msgstr "" msgid "No ordering is performed." @@ -13197,9 +9825,7 @@ msgstr "Extraer la información del vértice" msgid "``pgr_degree`` can use :doc:`pgr_extractVertices` embedded in the call." msgstr "" -msgid "" -"For decent size networks, it is best to prepare your vertices table before " -"hand and use it on ``pgr_degree`` calls. (See `Using a vertex table`_)" +msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls. (See `Using a vertex table`_)" msgstr "" msgid "Calculate the degree of the nodes:" @@ -13215,8 +9841,7 @@ msgid "``dryrun``" msgstr "``dryrun``" msgid "When true do not process and get in a NOTICE the resulting query." -msgstr "" -"Cuando verdadero, no procesar y recibir un AVISO de la consulta resultante." +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`_:" @@ -13230,12 +9855,8 @@ msgstr "SQL de vértices" msgid "``in_edges``" msgstr "``in_edges``" -msgid "" -"Array of identifiers of the edges that have the vertex ``id`` as *first end " -"point*." -msgstr "" -"Arreglo de identificadores de las aristas que tienen el vértice ``id`` como " -"*primer punto final*." +msgid "Array of identifiers of the edges that have the vertex ``id`` as *first end point*." +msgstr "Arreglo de identificadores de las aristas que tienen el vértice ``id`` como *primer punto final*." msgid "When missing, ``out_edges`` must exist." msgstr "Si falta, ``out_edges`` debe existir." @@ -13243,12 +9864,8 @@ msgstr "Si falta, ``out_edges`` debe existir." msgid "``out_edges``" msgstr "``out_edges``" -msgid "" -"Array of identifiers of the edges that have the vertex ``id`` as *second end " -"point*." -msgstr "" -"Arreglo de identificadores de las aristas que tienen el vértice ``id`` como " -"*segundo punto final*." +msgid "Array of identifiers of the edges that have the vertex ``id`` as *second end point*." +msgstr "Arreglo de identificadores de las aristas que tienen el vértice ``id`` como *segundo punto final*." msgid "When missing, ``in_edges`` must exist." msgstr "Si falta, ``in_edges`` debe existir." @@ -13295,12 +9912,8 @@ 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 "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:" @@ -13308,33 +9921,17 @@ msgstr "Extraer la información del vértice y almacenar en una tabla:" msgid "Dry run execution" msgstr "Ejecución de prueba" -msgid "" -"To get the query generated used to get the vertex information, use ``dryrun " -"=> true``." -msgstr "" -"Para obtener la consulta generada que se usa para obtener la información de " -"vértices, utilizar ``dryrun := true``." +msgid "To get the query generated used to get the vertex information, use ``dryrun => true``." +msgstr "Para obtener la consulta generada que se usa para obtener la información de vértices, utilizar ``dryrun := true``." -msgid "" -"The results can be used as base code to make a refinement based on the " -"backend development needs." -msgstr "" -"Los resultados se pueden usar como código base para realizar un refinamiento " -"basado en las necesidades de desarrollo de back-end." +msgid "The results can be used as base code to make a refinement based on the backend development needs." +msgstr "Los resultados se pueden usar como código base para realizar un refinamiento basado en las necesidades de desarrollo de back-end." msgid "Finding dead ends" msgstr "Encontrando callejones sin salida" -msgid "" -"If there is a vertices table already built using ``pgr_extractVertices`` and " -"want the degree of the whole graph rather than a subset, it can be forgo " -"using ``pgr_degree`` and work with the ``in_edges`` and ``out_edges`` " -"columns directly." -msgstr "" -"Si se tiene una tabla de vértices ya construida usando " -"``pgr_extractVertices`` y se quiere el grado de todo el grafo en lugar de un " -"subconjunto, se puede trabajar con las columnas ``in_edges`` y ``out_edges`` " -"directamente." +msgid "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." @@ -13345,10 +9942,8 @@ 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 "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`" @@ -13356,60 +9951,29 @@ msgstr ":doc:`pgr_extractVertices`" msgid "``pgr_depthFirstSearch`` - Proposed" msgstr "``pgr_depthFirstSearch`` - Propusto" -msgid "" -"``pgr_depthFirstSearch`` — Returns a depth first search traversal of the " -"graph. The graph can be directed or undirected." -msgstr "" -"``pgr_depthFirstSearch`` — Devuelve un recorrido de búsqueda de profundidad " -"del grafo. El grafo puede ser dirigido o no dirigido." +msgid "``pgr_depthFirstSearch`` — Returns a depth first search traversal of the graph. The graph can be directed or undirected." +msgstr "``pgr_depthFirstSearch`` — Devuelve un recorrido de búsqueda de profundidad del grafo. El grafo puede ser dirigido o no dirigido." msgid "Version 3.3.0" msgstr "Versión 3.3.0" -msgid "" -"Depth First Search algorithm is a traversal algorithm which starts from a " -"root vertex, goes as deep as possible, and backtracks once a vertex is " -"reached with no adjacent vertices or with all visited adjacent vertices. The " -"traversal continues until all the vertices reachable from the root vertex " -"are visited." -msgstr "" -"El algoritmo de Primera Búsqueda de Profundidad es un algoritmo de recorrido " -"que comienza desde un vértice raíz, va lo más profundo posible y retrocede " -"una vez que se alcanza un vértice sin vértices adyacentes o con todos los " -"vértices adyacentes visitados. El recorrido continúa hasta que se visitan " -"todos los vértices accesibles desde el vértice raíz." +msgid "Depth First Search algorithm is a traversal algorithm which starts from a root vertex, goes as deep as possible, and backtracks once a vertex is reached with no adjacent vertices or with all visited adjacent vertices. The traversal continues until all the vertices reachable from the root vertex are visited." +msgstr "El algoritmo de Primera Búsqueda de Profundidad es un algoritmo de recorrido que comienza desde un vértice raíz, va lo más profundo posible y retrocede una vez que se alcanza un vértice sin vértices adyacentes o con todos los vértices adyacentes visitados. El recorrido continúa hasta que se visitan todos los vértices accesibles desde el vértice raíz." -msgid "" -"The implementation works for both **directed** and **undirected** graphs." -msgstr "" -"La implementación funciona para los grafos **dirigidos** y **no dirigidos**." +msgid "The implementation works for both **directed** and **undirected** graphs." +msgstr "La implementación funciona para los grafos **dirigidos** y **no dirigidos**." -msgid "" -"Provides the Depth First Search traversal order from a root vertex or from a " -"set of root vertices." -msgstr "" -"Proporciona el recorrido de Búsqueda de Primero Profundidad desde un vértice " -"raíz o desde un conjunto de vértices raíz." +msgid "Provides the Depth First Search traversal order from a root vertex or from a set of root vertices." +msgstr "Proporciona el recorrido de Búsqueda de Primero Profundidad desde un vértice raíz o desde un conjunto de vértices raíz." -msgid "" -"An optional non-negative maximum depth parameter to limit the results up to " -"a particular depth." -msgstr "" -"Un parámetro opcional de profundidad máxima no negativo para limitar los " -"resultados hasta una profundidad particular." +msgid "An optional non-negative maximum depth parameter to limit the results up to a particular depth." +msgstr "Un parámetro opcional de profundidad máxima no negativo para limitar los resultados hasta una profundidad particular." -msgid "" -"For optimization purposes, any duplicated values in the `Root vids` are " -"ignored." -msgstr "" -"Para fines de optimización, se omiten los valores duplicados en los `Root " -"vids`." +msgid "For optimization purposes, any duplicated values in the `Root vids` are ignored." +msgstr "Para fines de optimización, se omiten los valores duplicados en los `Root vids`." -msgid "" -"It does not produce the shortest path from a root vertex to a target vertex." -msgstr "" -"No produce la ruta más corta desde un vértice de origen a un vértice de " -"destino." +msgid "It does not produce the shortest path from a root vertex to a target vertex." +msgstr "No produce la ruta más corta desde un vértice de origen a un vértice de destino." msgid "The aggregate cost of traversal is not guaranteed to be minimal." msgstr "No se garantiza que el coste agregado del recorrido sea mínimo." @@ -13418,8 +9982,7 @@ msgid "The returned values are ordered in ascending order of `start_vid`." msgstr "Los valores devueltos se ordenan en orden ascendente de `start_vid`." msgid "Depth First Search Running time: :math:`O(E + V)`" -msgstr "" -"Tiempo de ejecución de la Primera Búsqueda de Profundidad: :math:`O(E + V)`" +msgstr "Tiempo de ejecución de la Primera Búsqueda de Profundidad: :math:`O(E + V)`" msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vid**, [**options**])" msgstr "pgr_depthFirstSearch(`SQL de aristas`_, **raíz**, [**opciones**])" @@ -13431,40 +9994,25 @@ msgid "**options:** ``[directed, max_depth]``" msgstr "**opcionales:** ``[directed, max_depth]``" msgid "Same as `Single vertex`_ but with edges in descending order of ``id``." -msgstr "" -"Igual que `Vértice único`_ pero con aristas en orden descendente de ``id``." +msgstr "Igual que `Vértice único`_ pero con aristas en orden descendente de ``id``." -msgid "" -"`Boost: Depth First Search `__" -msgstr "" -"`Boost: Primera Búsqueda de Profundidad `__" +msgid "`Boost: Depth First Search `__" +msgstr "`Boost: Primera Búsqueda de Profundidad `__" -msgid "" -"`Boost: Undirected DFS `__" -msgstr "" -"`Boost: DFS No dirigido `__" +msgid "`Boost: Undirected DFS `__" +msgstr "`Boost: DFS No dirigido `__" -msgid "" -"`Wikipedia: Depth First Search algorithm `__" -msgstr "" -"'Wikipedia: Algoritmo de la Primera Búsqueda de Profundidad `__" +msgid "`Wikipedia: Depth First Search algorithm `__" +msgstr "'Wikipedia: Algoritmo de la Primera Búsqueda de Profundidad `__" msgid "``pgr_dijkstra`` — Shortest path using Dijkstra algorithm." -msgstr "" -"``pgr_dijkstra`` - Camino más corto utilizando el algoritmo de Dijkstra." +msgstr "``pgr_dijkstra`` - Camino más corto utilizando el algoritmo de Dijkstra." msgid "Version 3.5.0" msgstr "Versión 3.5.0" msgid "pgr_dijkstra(One to One) added ``start_vid`` and ``end_vid`` columns." -msgstr "" -"pgr_dijkstra(Uno a Uno) ha añadido las columnas ``start_vid`` y ``end_vid``." +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``." @@ -13494,29 +10042,21 @@ msgid "Signature change on pgr_dijkstra(One to One)" msgstr "Cambio de firma en pgr_dijkstra(Uno a Uno)" msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "" -"pgr_dijkstra(`SQL de aristas`_, **salida**, **destino**, [``directed``])" +msgstr "pgr_dijkstra(`SQL de aristas`_, **salida**, **destino**, [``directed``])" msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "" -"pgr_dijkstra(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" +msgstr "pgr_dijkstra(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "" -"pgr_dijkstra(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" +msgstr "pgr_dijkstra(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" msgid "pgr_dijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "" -"pgr_dijkstra(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" +msgstr "pgr_dijkstra(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" -msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**" -msgstr "" -"Del vértice :math:`6` a los vértices :math:`\\{10, 17\\}` en un grafo **no " -"dirigido**" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**" +msgstr "Del vértice :math:`6` a los vértices :math:`\\{10, 17\\}` en un grafo **no dirigido**" -msgid "" -"The examples of this section are based on the :doc:`sampledata` network." +msgid "The examples of this section are based on the :doc:`sampledata` network." msgstr "Los ejemplos de esta sección se basan en la red :doc:`sampledata`." msgid "For **directed** graphs with ``cost`` and ``reverse_cost`` columns" @@ -13538,34 +10078,28 @@ msgid "4) Path from :math:`12` to :math:`7`" msgstr "4) Ruta de :math:`12` a :math:`7`" msgid "5) Using `One to Many`_ to get the solution of examples 1 and 2" -msgstr "" -"5) Usando `Uno a Muchos`_ para obtener la solución de los ejemplos 1 y 2" +msgstr "5) Usando `Uno a Muchos`_ para obtener la solución de los ejemplos 1 y 2" msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}`" msgstr "Rutas :math:`\\{6\\}\\rightarrow\\{10, 7\\}`" msgid "6) Using `Many to One`_ to get the solution of examples 2 and 4" -msgstr "" -"6) Usando `Muchos a Uno`_ para obtener la solución de los ejemplos 2 y 4" +msgstr "6) Usando `Muchos a Uno`_ para obtener la solución de los ejemplos 2 y 4" msgid "Paths :math:`\\{6, 12\\}\\rightarrow\\{7\\}`" msgstr "Rutas :math:`\\{6, 12\\}\\rightarrow\\{7\\}`" msgid "7) Using `Many to Many`_ to get the solution of examples 1 to 4" -msgstr "" -"7) Usando `Muchos a Muchos`_ para obtener la solución de los ejemplos 1 y 4" +msgstr "7) Usando `Muchos a Muchos`_ para obtener la solución de los ejemplos 1 y 4" msgid "Paths :math:`\\{6, 12\\}\\rightarrow\\{10, 7\\}`" msgstr "Rutas :math:`\\{6, 12\\}\\rightarrow\\{10, 7\\}`" msgid "8) Using `Combinations`_ to get the solution of examples 1 to 3" -msgstr "" -"8) Usando `Combinaciones`_ para obtener la solución de los ejemplos 1 a 3" +msgstr "8) Usando `Combinaciones`_ para obtener la solución de los ejemplos 1 a 3" -msgid "" -"Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" -msgstr "" -"Rutas :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" +msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" +msgstr "Rutas :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" msgid "For **undirected** graphs with ``cost`` and ``reverse_cost`` columns" msgstr "Para grafos **no dirigidos** con columnas ``cost`` y ``reverse_cost``" @@ -13586,20 +10120,16 @@ msgid "12) Path from :math:`12` to :math:`7`" msgstr "12) Ruta de :math:`12` a :math:`7`" msgid "13) Using `One to Many`_ to get the solution of examples 9 and 10" -msgstr "" -"13) Usando `Uno a Muchos`_ para obtener la solución de los ejemplos 9 y 10" +msgstr "13) Usando `Uno a Muchos`_ para obtener la solución de los ejemplos 9 y 10" msgid "14) Using `Many to One`_ to get the solution of examples 10 and 12" -msgstr "" -"14) Usando `Muchos a Uno`_ para obtener la solución de los ejemplos 10 y 12" +msgstr "14) Usando `Muchos a Uno`_ para obtener la solución de los ejemplos 10 y 12" msgid "15) Using `Many to Many`_ to get the solution of examples 9 to 12" -msgstr "" -"15) Usando `Muchos a Muchos`_ para obtener la solución de los ejemplos 9 y 12" +msgstr "15) Usando `Muchos a Muchos`_ para obtener la solución de los ejemplos 9 y 12" msgid "16) Using `Combinations`_ to get the solution of examples 9 to 11" -msgstr "" -"16) Usando `Combinaciones`_ para obtener la solución de los ejemplos 9 a 13" +msgstr "16) Usando `Combinaciones`_ para obtener la solución de los ejemplos 9 a 13" msgid "For **directed** graphs only with ``cost`` column" msgstr "Para grafos **dirigidos** con columna``cost``" @@ -13620,21 +10150,16 @@ msgid "20) Path from :math:`12` to :math:`7`" msgstr "20) Ruta de :math:`12` a :math:`7`" msgid "21) Using `One to Many`_ to get the solution of examples 17 and 18" -msgstr "" -"21) Usando `Uno a Muchos`_ para obtener la solución de los ejemplos 17 y 18" +msgstr "21) Usando `Uno a Muchos`_ para obtener la solución de los ejemplos 17 y 18" msgid "22) Using `Many to One`_ to get the solution of examples 18 and 20" -msgstr "" -"22) Usando `Muchos a Uno`_ para obtener la solución de los ejemplos 18 y 20" +msgstr "22) Usando `Muchos a Uno`_ para obtener la solución de los ejemplos 18 y 20" msgid "23) Using `Many to Many`_ to get the solution of examples 17 to 20" -msgstr "" -"23) Usando `Muchos a Muchos`_ para obtener la solución de los ejemplos 17 y " -"20" +msgstr "23) Usando `Muchos a Muchos`_ para obtener la solución de los ejemplos 17 y 20" msgid "24) Using `Combinations`_ to get the solution of examples 17 to 19" -msgstr "" -"24) Usando `Combinaciones`_ para obtener la solución de los ejemplos 17 a 19" +msgstr "24) Usando `Combinaciones`_ para obtener la solución de los ejemplos 17 a 19" msgid "For **undirected** graphs only with ``cost`` column" msgstr "Para grafos **no dirigidos** con columna``cost``" @@ -13655,29 +10180,22 @@ msgid "28) Path from :math:`12` to :math:`7`" msgstr "28) Ruta de :math:`12` a :math:`7`" msgid "29) Using `One to Many`_ to get the solution of examples 25 and 26" -msgstr "" -"29) Usando `Uno a Muchos`_ para obtener la solución de los ejemplos 25 y 26" +msgstr "29) Usando `Uno a Muchos`_ para obtener la solución de los ejemplos 25 y 26" msgid "30) Using `Many to One`_ to get the solution of examples 26 and 28" -msgstr "" -"30) Usando `Muchos a Uno`_ para obtener la solución de los ejemplos 26 y 28" +msgstr "30) Usando `Muchos a Uno`_ para obtener la solución de los ejemplos 26 y 28" msgid "31) Using `Many to Many`_ to get the solution of examples 25 to 28" -msgstr "" -"31) Usando `Muchos a Muchos`_ para obtener la solución de los ejemplos 25 y " -"28" +msgstr "31) Usando `Muchos a Muchos`_ para obtener la solución de los ejemplos 25 y 28" msgid "32) Using `Combinations`_ to get the solution of examples 25 to 27" -msgstr "" -"32) Usando `Combinaciones`_ para obtener la solución de los ejemplos 25 a 27" +msgstr "32) Usando `Combinaciones`_ para obtener la solución de los ejemplos 25 a 27" msgid "Equvalences between signatures" msgstr "Equivalencias entre firmas" -msgid "" -"The following examples find the path for :math:`\\{6\\}\\rightarrow\\{10\\}`" -msgstr "" -"Los siguientes ejemplos son para la ruta :math:`\\{6\\}\\rightarrow\\{10\\}`" +msgid "The following examples find the path for :math:`\\{6\\}\\rightarrow\\{10\\}`" +msgstr "Los siguientes ejemplos son para la ruta :math:`\\{6\\}\\rightarrow\\{10\\}`" msgid "33) Using `One to One`_" msgstr "33) Usando `Uno a Uno`_" @@ -13694,12 +10212,8 @@ msgstr "36) Usando `Muchos a Muchos`_" msgid "37) Using `Combinations`_" msgstr "37) Usando `Combinaciones`_" -msgid "" -"`Boost: Dijkstra shortest paths `__" -msgstr "" -"`Boost: Camino mas corto Dijkstra `__" +msgid "`Boost: Dijkstra shortest paths `__" +msgstr "`Boost: Camino mas corto Dijkstra `__" msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgstr "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" @@ -13707,62 +10221,39 @@ msgstr "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgid "``pgr_dijkstraCost``" msgstr "``pgr_dijkstraCost``" -msgid "" -"``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra " -"algorithm." -msgstr "" -"``pgr_dijkstraCost`` - Coste total del camino más corto utilizando el " -"algoritmo de Dijkstra." +msgid "``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra algorithm." +msgstr "``pgr_dijkstraCost`` - Coste total del camino más corto utilizando el algoritmo de Dijkstra." msgid "pgr_dijkstraCost(Combinations)" msgstr "pgr_dijkstraCost(Combinaciones)" #, fuzzy -msgid "" -"The ``pgr_dijkstraCost`` function summarizes of the cost of the shortest " -"path using Dijkstra Algorithm." -msgstr "" -"La función ``pgr_dijkstraCost`` suma el coste del camino más corto " -"utilizando el Algoritmo de Dijkstra." +msgid "The ``pgr_dijkstraCost`` function summarizes of the cost of the shortest path using Dijkstra Algorithm." +msgstr "La función ``pgr_dijkstraCost`` suma el coste del camino más corto utilizando el Algoritmo de Dijkstra." -msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "" -"pgr_dijkstraCost(`SQL de aristas`_, **salida**, **destino**, [``directed``])" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_dijkstraCost(`SQL de aristas`_, **salida**, **destino**, [``directed``])" -msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "" -"pgr_dijkstraCost(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_dijkstraCost(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" -msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "" -"pgr_dijkstraCost(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_dijkstraCost(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" -msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "" -"pgr_dijkstraCost(`SQL de aristas`_, **salidas**, **destinos**, " -"[``directed``])" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_dijkstraCost(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" msgid "pgr_dijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "" -"pgr_dijkstraCost(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" +msgstr "pgr_dijkstraCost(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" msgid "``pgr_dijkstraCostMatrix``" msgstr "``pgr_dijkstraCostMatrix``" -msgid "" -"``pgr_dijkstraCostMatrix`` - Calculates a cost matrix using :doc:" -"`pgr_dijkstra`." -msgstr "" -"``pgr_dijkstraCostMatrix`` - Calcula la matriz de costes utilizando :doc:" -"`pgr_dijkstra`." +msgid "``pgr_dijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_dijkstra`." +msgstr "``pgr_dijkstraCostMatrix`` - Calcula la matriz de costes utilizando :doc:`pgr_dijkstra`." msgid "Using Dijkstra algorithm, calculate and return a cost matrix." -msgstr "" -"Utilizando el algoritmo Dijkstra, calcula y devuelve una matriz de costes." +msgstr "Utilizando el algoritmo Dijkstra, calcula y devuelve una matriz de costes." msgid "pgr_dijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" msgstr "pgr_dijkstraCostMatrix(`SQL de aristas`_, **salidas**, [``directed``])" @@ -13771,21 +10262,11 @@ msgstr "pgr_dijkstraCostMatrix(`SQL de aristas`_, **salidas**, [``directed``])" msgid "``pgr_dijkstraNear``" msgstr "pgr_dijkstraNear" -msgid "" -"``pgr_dijkstraNear`` — Using Dijkstra's algorithm, finds the route that " -"leads to the nearest vertex." -msgstr "" -"``pgr_dijkstraNear`` — Utilizando el algoritmo dijkstra, encuentra la ruta " -"que conduce al vértice más cercano." +msgid "``pgr_dijkstraNear`` — Using Dijkstra's algorithm, finds the route that leads to the nearest vertex." +msgstr "``pgr_dijkstraNear`` — Utilizando el algoritmo dijkstra, encuentra la ruta que conduce al vértice más cercano." -msgid "" -"Given a graph, a starting vertex and a set of ending vertices, this function " -"finds the shortest path from the starting vertex to the nearest ending " -"vertex." -msgstr "" -"Dado un grafo, un vértice inicial y un conjunto de vértices finales, esta " -"función encuentra la ruta más corta desde el vértice inicial hasta el " -"vértice final más cercano." +msgid "Given a graph, a starting vertex and a set of ending vertices, this function finds the shortest path from the starting vertex to the nearest ending vertex." +msgstr "Dado un grafo, un vértice inicial y un conjunto de vértices finales, esta función encuentra la ruta más corta desde el vértice inicial hasta el vértice final más cercano." msgid "Uses Dijkstra algorithm." msgstr "Utiliza el algoritmo Dijkstra." @@ -13818,9 +10299,7 @@ msgid "results are sorted by (source, target)" msgstr "los resultados se ordenan por (fuente, destino)" msgid "Running time: Dijkstra running time: :math:`drt = O((|E| + |V|)log|V|)`" -msgstr "" -"Tiempo de ejecución: Dijkstra tiempo de ejecución: :math:`drt = O((|E| + |" -"V|)log|V|)`" +msgstr "Tiempo de ejecución: Dijkstra tiempo de ejecución: :math:`drt = O((|E| + |V|)log|V|)`" msgid "One to Many; :math:`drt`" msgstr "Uno a Muchos; :math:`drt`" @@ -13834,28 +10313,17 @@ msgstr "Muchos a Muchos: :math:`drt * |Starting vids|`" msgid "Combinations: :math:`drt * |Starting vids|`" msgstr "Combinaciones: :math:`drt * |Starting vids|`" -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" -msgstr "" -"pgr_dijkstraNear(`SQL de aristas`_, **salida**, **destinos**, [**opciones " -"A**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" +msgstr "pgr_dijkstraNear(`SQL de aristas`_, **salida**, **destinos**, [**opciones A**])" -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" -msgstr "" -"pgr_dijkstraNear(`SQL de aristas`_, **salidas**, **destino**, [**opciones " -"A**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" +msgstr "pgr_dijkstraNear(`SQL de aristas`_, **salidas**, **destino**, [**opciones A**])" -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" -msgstr "" -"pgr_dijkstraNear(`SQL de aristas`_, **salidas**, **destinos**, [**opciones " -"B**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" +msgstr "pgr_dijkstraNear(`SQL de aristas`_, **salidas**, **destinos**, [**opciones B**])" msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options B**])" -msgstr "" -"pgr_dijkstraNear(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones " -"B**])" +msgstr "pgr_dijkstraNear(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones B**])" msgid "**options A:** ``[directed, cap]``" msgstr "**opciones A:** ``[directed, cap]``" @@ -13863,27 +10331,20 @@ msgstr "**opciones A:** ``[directed, cap]``" msgid "**options B:** ``[directed, cap, global]``" msgstr "**opciones B:** ``[directed, cap, global]``" -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "" -"pgr_dijkstraNear(`SQL de aristas`_, **salida**, **destinos**, [**opciones**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "pgr_dijkstraNear(`SQL de aristas`_, **salida**, **destinos**, [**opciones**])" msgid "**options:** ``[directed, cap]``" msgstr "**opcionales:** ``[directed, cap]``" msgid "Departing on car from vertex :math:`6` find the nearest subway station." -msgstr "" -"Saliendo en coche desde el vértice :math:`6` encontrar la estación de metro " -"más cercana." +msgstr "Saliendo en coche desde el vértice :math:`6` encontrar la estación de metro más cercana." msgid "Using a **directed** graph for car routing." msgstr "Usando un grafo **dirigido** para el ruteo de automóviles." -msgid "" -"The subway stations are on the following vertices :math:`\\{1, 10, 11\\}`" -msgstr "" -"Las estaciones de metro se encuentran en los siguientes vértices :math:" -"`\\{1, 10, 11\\}`" +msgid "The subway stations are on the following vertices :math:`\\{1, 10, 11\\}`" +msgstr "Las estaciones de metro se encuentran en los siguientes vértices :math:`\\{1, 10, 11\\}`" msgid "The defaults used:" msgstr "Los valores predeterminados utilizados:" @@ -13895,42 +10356,25 @@ msgid "`cap => 1`" msgstr "`cap => 1`" msgid "The result shows that station at vertex :math:`11` is the nearest." -msgstr "" -"El resultado muestra que la estación en el vértice :math:`11` es la más " -"cercana." +msgstr "El resultado muestra que la estación en el vértice :math:`11` es la más cercana." -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "" -"pgr_dijkstraNear(`SQL de aristas`_, **salidas**, **destino**, [**opciones**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "pgr_dijkstraNear(`SQL de aristas`_, **salidas**, **destino**, [**opciones**])" -msgid "" -"Departing on a car from a subway station find the nearest **two** stations " -"to vertex :math:`2`" -msgstr "" -"Saliendo en coche desde una estación de metro encontrar las **dos** " -"estaciones más cercanas al vértice :math:`2`" +msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`2`" +msgstr "Saliendo en coche desde una estación de metro encontrar las **dos** estaciones más cercanas al vértice :math:`2`" msgid "On line `4`: using the positional parameter: `directed` set to ``true``" -msgstr "" -"En la línea `4`: utilizando el parámetro posicional: `directed` configurado " -"en ``true``" +msgstr "En la línea `4`: utilizando el parámetro posicional: `directed` configurado en ``true``" msgid "In line `5`: using named parameter `cap => 2`" msgstr "En la línea `5`: usando el parámetro con nombre `cap => 2`" -msgid "" -"The result shows that station at vertex :math:`10` is the nearest and the " -"next best is :math:`11`." -msgstr "" -"El resultado muestra que la estación en el vértice :math:`10` es la más " -"cercana y la siguiente mejor es :math:`11`." +msgid "The result shows that station at vertex :math:`10` is the nearest and the next best is :math:`11`." +msgstr "El resultado muestra que la estación en el vértice :math:`10` es la más cercana y la siguiente mejor es :math:`11`." -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "" -"pgr_dijkstraNear(`SQL de aristas`_, **salidas**, **destinos**, " -"[**opciones**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "pgr_dijkstraNear(`SQL de aristas`_, **salidas**, **destinos**, [**opciones**])" msgid "**options:** ``[directed, cap, global]``" msgstr "**opcionales:** ``[directed, cap, global]``" @@ -13943,68 +10387,43 @@ msgid "Using an **undirected** graph for pedestrian routing" msgstr "Usando un grafo **no dirigido** para el ruteo de peatones" msgid "The first subway line stations are at :math:`\\{15, 16\\}`" -msgstr "" -"Las estaciones de la primera línea de metro están en :math:`\\{15, 16\\}`" +msgstr "Las estaciones de la primera línea de metro están en :math:`\\{15, 16\\}`" msgid "The second subway line stations stops are at :math:`\\{1, 10, 11\\}`" -msgstr "" -"Las estaciones de la segunda línea de metro están en :math:`\\{1, 10, 11\\}`" +msgstr "Las estaciones de la segunda línea de metro están en :math:`\\{1, 10, 11\\}`" msgid "On line `4`: using the named parameter: `directed => false`" -msgstr "" -"En la línea `4`: utilizando el parámetro con nombre: `directed => false`" +msgstr "En la línea `4`: utilizando el parámetro con nombre: `directed => false`" msgid "`global => true`" msgstr "`global => true`" -msgid "" -"For a pedestrian the best connection is to get on/off is at vertex :math:" -"`15` of the first subway line and at vertex :math:`10` of the second subway " -"line." -msgstr "" -"Para un peatón la mejor conexión es subir/bajar en el vértice :math:`15` de " -"la primera línea de metro y en el vértice :math:`10` de la segunda línea de " -"metro." +msgid "For a pedestrian the best connection is to get on/off is at vertex :math:`15` of the first subway line and at vertex :math:`10` of the second subway line." +msgstr "Para un peatón la mejor conexión es subir/bajar en el vértice :math:`15` de la primera línea de metro y en el vértice :math:`10` de la segunda línea de metro." -msgid "" -"Only `one` route is returned because `global` is ``true`` and `cap` is ``1``" -msgstr "" -"Solo se devuelve `una` ruta porque `global` es ``true`` y `cap` es ``1``" +msgid "Only `one` route is returned because `global` is ``true`` and `cap` is ``1``" +msgstr "Solo se devuelve `una` ruta porque `global` es ``true`` y `cap` es ``1``" msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "" -"pgr_dijkstraNear(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])" +msgstr "pgr_dijkstraNear(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])" -msgid "" -"Find the best car connection between all the stations of two subway lines" -msgstr "" -"Encuentra la mejor conexión de coche entre todas las estaciones de dos " -"líneas de metro" +msgid "Find the best car connection between all the stations of two subway lines" +msgstr "Encuentra la mejor conexión de coche entre todas las estaciones de dos líneas de metro" msgid "The first subway line stations stops are at :math:`\\{1, 10, 11\\}`" -msgstr "" -"Las estaciones de la primera línea de metro están en :math:`\\{1, 10, 11\\}`" +msgstr "Las estaciones de la primera línea de metro están en :math:`\\{1, 10, 11\\}`" msgid "The second subway line stations are at :math:`\\{15, 16\\}`" -msgstr "" -"Las estaciones de la segunda línea de metro están en :math:`\\{15, 16\\}`" +msgstr "Las estaciones de la segunda línea de metro están en :math:`\\{15, 16\\}`" msgid "The combinations contents:" msgstr "El contenido de las combinaciones:" -msgid "" -"lines `3~4` sets the start vertices to be from the first subway line and the " -"ending vertices to be from the second subway line" -msgstr "" -"líneas `3~4` establece los vértices de inicio de la primera línea de metro y " -"los vértices finales de la segunda línea de metro" +msgid "lines `3~4` sets the start vertices to be from the first subway line and the ending vertices to be from the second subway line" +msgstr "líneas `3~4` establece los vértices de inicio de la primera línea de metro y los vértices finales de la segunda línea de metro" -msgid "" -"lines `6~7` sets the start vertices to be from the first subway line and the " -"ending vertices to be from the first subway line" -msgstr "" -"la línea `6~7` establecen los vértices de inicio de la primera línea de " -"metro y los vértices finales de la primera línea de metro" +msgid "lines `6~7` sets the start vertices to be from the first subway line and the ending vertices to be from the first subway line" +msgstr "la línea `6~7` establecen los vértices de inicio de la primera línea de metro y los vértices finales de la primera línea de metro" msgid "On line `8`: using the named parameter is `global => false`" msgstr "En la línea `8`: usando el parámetro con nombre `global => false`" @@ -14012,48 +10431,24 @@ msgstr "En la línea `8`: usando el parámetro con nombre `global => false`" msgid "From the results:" msgstr "A partir de los resultados:" -msgid "" -"making a connection from the first subway line :math:`\\{1, 10, 11\\}` to " -"the second :math:`\\{15, 16\\}`:" -msgstr "" -"haciendo una conexión desde la primera línea de metro :math:`\\{1, 10, 11\\}" -"` a la segunda :math:`\\{15, 16\\}`:" +msgid "making a connection from the first subway line :math:`\\{1, 10, 11\\}` to the second :math:`\\{15, 16\\}`:" +msgstr "haciendo una conexión desde la primera línea de metro :math:`\\{1, 10, 11\\}` a la segunda :math:`\\{15, 16\\}`:" -msgid "" -"The best connections from all the stations from the first line are: :math:" -"`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" -msgstr "" -"Las mejores conecciones de todas las estaciones desde la primera línea son: :" -"math:`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" +msgid "The best connections from all the stations from the first line are: :math:`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" +msgstr "Las mejores conecciones de todas las estaciones desde la primera línea son: :math:`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" -msgid "" -"The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` " -"(lines: `11` and `12`)" -msgstr "" -"La mejor es:math:`(11 \\rightarrow 16)` con un costo de :math:`1` (líneas: " -"`11` y `12`)" +msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `11` and `12`)" +msgstr "La mejor es:math:`(11 \\rightarrow 16)` con un costo de :math:`1` (líneas: `11` y `12`)" -msgid "" -"making a connection from the second subway line :math:`\\{15, 16\\}` to the " -"first :math:`\\{1, 10, 11\\}`:" -msgstr "" -"haciendo una conexión desde la segunda línea de metro :math:`\\{15, 16\\}` a " -"la primera :math:`\\{1, 10, 11\\}`:" +msgid "making a connection from the second subway line :math:`\\{15, 16\\}` to the first :math:`\\{1, 10, 11\\}`:" +msgstr "haciendo una conexión desde la segunda línea de metro :math:`\\{15, 16\\}` a la primera :math:`\\{1, 10, 11\\}`:" -msgid "" -"The best connections from all the stations from the second line are: :math:" -"`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" -msgstr "" -"Las mejores conecciones de todas las estaciones desde la segunda línea son: :" -"math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" +msgid "The best connections from all the stations from the second line are: :math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" +msgstr "Las mejores conecciones de todas las estaciones desde la segunda línea son: :math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" #, fuzzy -msgid "" -"Both are equally good as they have the same cost. (lines: `13` and `14` and " -"lines: `15` and `16`)" -msgstr "" -"Ambas son igualmente buenas, como también tienen el mismo costo. (lines: " -"`13` and `14` and lines: `15` and `16`)" +msgid "Both are equally good as they have the same cost. (lines: `13` and `14` and lines: `15` and `16`)" +msgstr "Ambas son igualmente buenas, como también tienen el mismo costo. (lines: `13` and `14` and lines: `15` and `16`)" msgid "Dijkstra optional parameters" msgstr "Parámetros opcionales de Dijkstra" @@ -14065,9 +10460,7 @@ msgid "``cap``" msgstr "``cap``" msgid "Find at most ``cap`` number of nearest shortest paths" -msgstr "" -"Encuentra como máximo el número ``cap`` de los caminos más cortos y más " -"cercanos" +msgstr "Encuentra como máximo el número ``cap`` de los caminos más cortos y más cercanos" msgid "``global``" msgstr "``global``" @@ -14085,86 +10478,42 @@ msgstr "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgid "``pgr_dijkstraNearCost``" msgstr "pgr_dijkstraNearCost" -msgid "" -"``pgr_dijkstraNearCost`` — Using dijkstra algorithm, finds the route that " -"leads to the nearest vertex." -msgstr "" -"``pgr_dijkstraNearCost`` — Usando el algoritmo dijkstra, encuentra la ruta " -"que conduce al vértice más cercano." +msgid "``pgr_dijkstraNearCost`` — Using dijkstra algorithm, finds the route that leads to the nearest vertex." +msgstr "``pgr_dijkstraNearCost`` — Usando el algoritmo dijkstra, encuentra la ruta que conduce al vértice más cercano." -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options " -"A**])" -msgstr "" -"pgr_dijkstraNearCost(`SQL de aristas`_, **salida**, **destinos**, " -"[**opciones A**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" +msgstr "pgr_dijkstraNearCost(`SQL de aristas`_, **salida**, **destinos**, [**opciones A**])" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options " -"A**])" -msgstr "" -"pgr_dijkstraNearCost(`SQL de aristas`_, **salidas**, **destino**, " -"[**opciones A**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" +msgstr "pgr_dijkstraNearCost(`SQL de aristas`_, **salidas**, **destino**, [**opciones A**])" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options " -"B**])" -msgstr "" -"pgr_dijkstraNearCost(`SQL de aristas`_, **salidas**, **destinos**, " -"[**opciones B**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" +msgstr "pgr_dijkstraNearCost(`SQL de aristas`_, **salidas**, **destinos**, [**opciones B**])" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" -msgstr "" -"pgr_dijkstraNearCost(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones " -"B**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" +msgstr "pgr_dijkstraNearCost(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones B**])" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, " -"[**options**])" -msgstr "" -"pgr_dijkstraNearCost(`SQL de aristas`_, **salida**, **destinos**, " -"[**opciones**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "pgr_dijkstraNearCost(`SQL de aristas`_, **salida**, **destinos**, [**opciones**])" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, " -"[**options**])" -msgstr "" -"pgr_dijkstraNearCost(`SQL de aristas`_, **salidas**, **destinos*, " -"[**opciones**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "pgr_dijkstraNearCost(`SQL de aristas`_, **salidas**, **destinos*, [**opciones**])" -msgid "" -"Departing on a car from a subway station find the nearest **two** stations " -"to vertex :math:`6`" -msgstr "" -"Saliendo en coche desde una estación de metro encontrar las **dos** " -"estaciones más cercanas al vértice :math:`6`" +msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`6`" +msgstr "Saliendo en coche desde una estación de metro encontrar las **dos** estaciones más cercanas al vértice :math:`6`" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, " -"[**options**])" -msgstr "" -"pgr_dijkstraNearCost(`SQL de aristas`_, **salidas**, **destinos**, " -"[**opciones**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "pgr_dijkstraNearCost(`SQL de aristas`_, **salidas**, **destinos**, [**opciones**])" msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "" -"pgr_dijkstraNearCost(`SQL de aristas`_, `SQL de combinaciones`_, " -"[**opciones**])" +msgstr "pgr_dijkstraNearCost(`SQL de aristas`_, `SQL de combinaciones`_, [**opciones**])" -msgid "" -"The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` " -"(lines: `1`)" -msgstr "" -"La mejor es :math:`(11 \\rightarrow 16)` con un costo de :math:`1` (line: " -"`1`)" +msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `1`)" +msgstr "La mejor es :math:`(11 \\rightarrow 16)` con un costo de :math:`1` (line: `1`)" #, fuzzy -msgid "" -"Both are equally good as they have the same cost. (lines: `12` and `13`)" -msgstr "" -"Ambos son igualmente buenos ya que tienen el mismo costo. (lines: `12` and " -"`13`)" +msgid "Both are equally good as they have the same cost. (lines: `12` and `13`)" +msgstr "Ambos son igualmente buenos ya que tienen el mismo costo. (lines: `12` and `13`)" #, fuzzy msgid "``pgr_dijkstraVia``" @@ -14173,14 +10522,8 @@ msgstr "``pgr_dijkstra``" msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices." msgstr "``pgr_dijkstraVia`` - Ruta que recorre una lista de vértices." -msgid "" -"Given a list of vertices and a graph, this function is equivalent to finding " -"the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :" -"math:`i < size\\_of(via\\;vertices)`." -msgstr "" -"Dada una lista de vértices y un grafo, esta función equivale a encontrar el " -"camino más corto entre :math:`vértice_i` y :math:`vértice_{i+1}` para todo :" -"math:`i < tamaño\\_de(vía\\;vértices)`." +msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)`." +msgstr "Dada una lista de vértices y un grafo, esta función equivale a encontrar el camino más corto entre :math:`vértice_i` y :math:`vértice_{i+1}` para todo :math:`i < tamaño\\_de(vía\\;vértices)`." msgid "Route" msgstr "Ruta" @@ -14206,29 +10549,20 @@ msgstr "**opcionales:** ``[directed, strict, U_turn_on_edge]``" msgid "Returns set of |via-result|" msgstr "Regresa el conjunto de |via-result|" -msgid "" -"Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order " -"on an directed graph." -msgstr "" -"Encontrar la ruta que visita los vértices :math:`{5, 1, 8\\}` en ese orden " -"en un grafo dirigido." +msgid "Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order on an directed graph." +msgstr "Encontrar la ruta que visita los vértices :math:`{5, 1, 8\\}` en ese orden en un grafo dirigido." msgid "Via optional parameters" msgstr "Parámetros opcionales Vía" msgid "When ``true`` departing from a visited vertex will not try to avoid" -msgstr "" -"Cuando ``true`` saliendo desde un vértice visitado no intentara esquivarlo" +msgstr "Cuando ``true`` saliendo desde un vértice visitado no intentara esquivarlo" msgid "Identifier of a path. Has value **1** for the first path." msgstr "Identificador del camino. Tiene valor **1** para el primer camino." -msgid "" -"Identifier of the edge used to go from ``node`` to the next node in the path " -"sequence." -msgstr "" -"Identificador de la arsita utilizada para ir del ``node`` al siguiente nodo " -"de la secuencia de ruta." +msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence." +msgstr "Identificador de la arsita utilizada para ir del ``node`` al siguiente nodo de la secuencia de ruta." msgid "-1 for the last node of the path." msgstr "-1 para el último nodo de la ruta." @@ -14239,19 +10573,11 @@ msgstr "-2 para el último nodo de la ruta." msgid "``route_agg_cost``" msgstr "``route_agg_cost``" -msgid "" -"Total cost from ``start_vid`` of ``seq = 1`` to ``end_vid`` of the current " -"``seq``." -msgstr "" -"Costo total desde ``start_vid`` en ``seq = 1`` hasta ``end_vid`` del ``seq`` " -"actual." +msgid "Total cost from ``start_vid`` of ``seq = 1`` to ``end_vid`` of the current ``seq``." +msgstr "Costo total desde ``start_vid`` en ``seq = 1`` hasta ``end_vid`` del ``seq`` actual." -msgid "" -"All this examples are about the route that visits the vertices :math:`\\{5, " -"7, 1, 8, 15\\}` in that order on a **directed** graph." -msgstr "" -"Todos estos ejemplos son sobre la ruta que visita los vértices :math:`\\{5, " -"7, 1, 8, 15\\}` en ese orden, en un grafo **dirigido**." +msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a **directed** graph." +msgstr "Todos estos ejemplos son sobre la ruta que visita los vértices :math:`\\{5, 7, 1, 8, 15\\}` en ese orden, en un grafo **dirigido**." msgid "The main query" msgstr "La consulta principal" @@ -14277,11 +10603,8 @@ msgstr ":doc:`via-category`." msgid ":doc:`dijkstra-family`." msgstr ":doc:`dijkstra-family`." -msgid "" -"``pgr_drivingDistance`` - Returns the driving distance from a start node." -msgstr "" -"``pgr_drivingDistance`` - Devuelve la distancia de manejo desde un nodo de " -"inicio." +msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." +msgstr "``pgr_drivingDistance`` - Devuelve la distancia de manejo desde un nodo de inicio." msgid "pgr_drivingDistance(Single vertex)" msgstr "pgr_drivingDistance(Vértice único)" @@ -14293,8 +10616,7 @@ msgid "pgr_drivingDistance(Multiple vertices)" msgstr "pgr_drivingDistance(Múltiples vértices)" msgid "Result column name change: ``from_v`` to ``start_vid``." -msgstr "" -"Cambio de nombre en la columna de resultados: ``from_v`` a ``start_vid``." +msgstr "Cambio de nombre en la columna de resultados: ``from_v`` a ``start_vid``." msgid "Added ``depth`` and ``pred`` result columns." msgstr "Agregado las columnas de resultados``depth`` y ``pred``." @@ -14312,26 +10634,14 @@ msgid "pgr_drivingDistance(multiple vertices)" msgstr "pgr_drivingDistance(múltiples vértices)" #, fuzzy -msgid "" -"Using the Dijkstra algorithm, extracts all the nodes that have costs less " -"than or equal to the value ``distance``. The edges extracted will conform to " -"the corresponding spanning tree." -msgstr "" -"Usando el algoritmo Dijkstra, se extraen todos los nodos que tienen costes " -"menores o iguales al valor ``distance``. Los bordes extraídos se ajustarán " -"al árbol de expansión correspondiente." +msgid "Using the Dijkstra algorithm, extracts all the nodes that have costs less than or equal to the value ``distance``. The edges extracted will conform to the corresponding spanning tree." +msgstr "Usando el algoritmo Dijkstra, se extraen todos los nodos que tienen costes menores o iguales al valor ``distance``. Los bordes extraídos se ajustarán al árbol de expansión correspondiente." -msgid "" -"pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" -msgstr "" -"pgr_drivingDistance(`SQL de aristas`_, **Raíz**, **distancia**, " -"[``directed``])" +msgid "pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" +msgstr "pgr_drivingDistance(`SQL de aristas`_, **Raíz**, **distancia**, [``directed``])" -msgid "" -"pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" -msgstr "" -"pgr_drivingDistance(`SQL de aristas`_, **raices**, **distancia**, " -"[**opciones**])" +msgid "pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" +msgstr "pgr_drivingDistance(`SQL de aristas`_, **raices**, **distancia**, [**opciones**])" msgid "**options:** [directed, equicost]" msgstr "**opcionales:** [directed, equicost]" @@ -14345,12 +10655,8 @@ msgstr "Desde el vértice :math:`11` por una distancia de :math:`3.0`" msgid "Multiple Vertices" msgstr "Múltiples Vértices" -msgid "" -"From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` with equi-" -"cost on a directed graph" -msgstr "" -"Desde los vertices :math:`\\{11, 16\\}` por una distancia de :math:`3.0` con " -"equi-cost en un grafo dirigido" +msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` with equi-cost on a directed graph" +msgstr "Desde los vertices :math:`\\{11, 16\\}` por una distancia de :math:`3.0` con equi-cost en un grafo dirigido" msgid "Driving distance optional parameters" msgstr "Parámetros opcionales de distancia de manejo" @@ -14358,47 +10664,26 @@ msgstr "Parámetros opcionales de distancia de manejo" msgid "``equicost``" msgstr "``equicost``" -msgid "" -"When ``true`` the node will only appear in the closest ``start_vid`` list. " -"Tie brakes are arbitrary." -msgstr "" -"Cuando ``true`` el nodo solo aparece en la lista más cercana a " -"``start_vid``. Empates son rotos arbitrareamente." +msgid "When ``true`` the node will only appear in the closest ``start_vid`` list. Tie brakes are arbitrary." +msgstr "Cuando ``true`` el nodo solo aparece en la lista más cercana a ``start_vid``. Empates son rotos arbitrareamente." -msgid "" -"When ``false`` which resembles several calls using the single vertex " -"signature." -msgstr "" -"Cuando ``false`` se asemeja a varias llamadas usando la firma de vértice " -"único." +msgid "When ``false`` which resembles several calls using the single vertex signature." +msgstr "Cuando ``false`` se asemeja a varias llamadas usando la firma de vértice único." msgid "end-before" msgstr "" -msgid "" -"From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` on an " -"undirected graph" -msgstr "" -"Desde vértices math:`\\{11, 16\\}` con una distancia de :math:`3.0` en un " -"grafo no dirigido" +msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` on an undirected graph" +msgstr "Desde vértices math:`\\{11, 16\\}` con una distancia de :math:`3.0` en un grafo no dirigido" msgid "``pgr_edgeColoring`` - Experimental" msgstr "``pgr_edgeColoring`` - Experimental" -msgid "" -"``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free " -"graphs" -msgstr "" -"``pgr_edgeColoring`` — Coloración de aristas de grafos no dirigidos acíclicos" +msgid "``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free graphs" +msgstr "``pgr_edgeColoring`` — Coloración de aristas de grafos no dirigidos acíclicos" -msgid "" -"Edge Coloring is an algorithm used for coloring of the edges for the " -"vertices in the graph. It is an assignment of colors to the edges of the " -"graph so that no two adjacent edges have the same color." -msgstr "" -"Coloración de arístas es un algoritmo utilizado para colorear aristas para " -"los vértices de un grafo. Es una asignación de colores a las aristas del " -"grafo de tal manera que dos aristas adjacentes no tengan el mismo color." +msgid "Edge Coloring is an algorithm used for coloring of the edges for the vertices in the graph. It is an assignment of colors to the edges of the graph so that no two adjacent edges have the same color." +msgstr "Coloración de arístas es un algoritmo utilizado para colorear aristas para los vértices de un grafo. Es una asignación de colores a las aristas del grafo de tal manera que dos aristas adjacentes no tengan el mismo color." msgid "The implementation is for **undirected** and **loop-free** graphs" msgstr "La implementación es para grafos **no dirigidos** sin **auto-ciclos**" @@ -14409,32 +10694,17 @@ msgstr "Sin auto ciclos" msgid "no self-loops and no parallel edges." msgstr "Sin auto ciclos ni aristas paralelas." -msgid "" -"Provides the color to be assigned to all the edges present in the graph." +msgid "Provides the color to be assigned to all the edges present in the graph." msgstr "Provee el color asignado a todas las aristas existentes en el grafo." -msgid "" -"At most :math:`\\Delta + 1` colors are used, where :math:`\\Delta` is the " -"degree of the graph." -msgstr "" -"A lo más :math:`\\Delta + 1` colores son usados, donde :math:`\\Delta` is el " -"grado del grafo." +msgid "At most :math:`\\Delta + 1` colors are used, where :math:`\\Delta` is the degree of the graph." +msgstr "A lo más :math:`\\Delta + 1` colores son usados, donde :math:`\\Delta` is el grado del grafo." -msgid "" -"This is optimal for some graphs, and by Vizing's theorem it uses at most one " -"color more than the optimal for all others." -msgstr "" -"Esto es óptimo para algunos gráfos. y por el teorema de Vizing, utiliza a lo " -"más un color extra que el óptimo para todos los demás." +msgid "This is optimal for some graphs, and by Vizing's theorem it uses at most one color more than the optimal for all others." +msgstr "Esto es óptimo para algunos gráfos. y por el teorema de Vizing, utiliza a lo más un color extra que el óptimo para todos los demás." -msgid "" -"the chromatic number :math:`x'(G)` (minimum number of colors needed for " -"proper edge coloring of graph) is equal to the degree :math:`\\Delta + 1` of " -"the graph, (:math:`x'(G) = \\Delta`)" -msgstr "" -"el número cromático :math:`x'(G)` (número mínimo de colores necesarios para " -"colorear correctamente las aristas del grafo) es igual al grado :math:" -"`\\Delta + 1` del grafo, (:math:`x'(G) = \\Delta`)" +msgid "the chromatic number :math:`x'(G)` (minimum number of colors needed for proper edge coloring of graph) is equal to the degree :math:`\\Delta + 1` of the graph, (:math:`x'(G) = \\Delta`)" +msgstr "el número cromático :math:`x'(G)` (número mínimo de colores necesarios para colorear correctamente las aristas del grafo) es igual al grado :math:`\\Delta + 1` del grafo, (:math:`x'(G) = \\Delta`)" msgid "The algorithm tries to assign the least possible color to every edge." msgstr "El algoritmo trata de asignar el menor color a cada arista." @@ -14442,11 +10712,8 @@ msgstr "El algoritmo trata de asignar el menor color a cada arista." msgid "Does not always produce optimal coloring." msgstr "No produce siempre produce la coloración ótpima." -msgid "" -"The returned rows are ordered in ascending order of the edge identifier." -msgstr "" -"Las filas de resultados son ordenados ascendentemente respecto al " -"identificador de la arista." +msgid "The returned rows are ordered in ascending order of the edge identifier." +msgstr "Las filas de resultados son ordenados ascendentemente respecto al identificador de la arista." msgid "Efficient graph coloring is an NP-Hard problem, and therefore:" msgstr "Coloración eficiente de un grafo es un problema NP-Duro, por lo que:" @@ -14466,50 +10733,29 @@ msgstr "pgr_edgeColoring(`SQL de aristas`_)" msgid "Graph coloring of pgRouting :doc:`sampledata`" msgstr "Coloración de grafos de pgRouting :doc:`sampledata`" -msgid "" -"`Boost: Edge Coloring `__" -msgstr "" -"`Boost: Coloración de Segmentos `__" +msgid "`Boost: Edge Coloring `__" +msgstr "`Boost: Coloración de Segmentos `__" -msgid "" -"`Wikipedia: Graph coloring `__" -msgstr "" -"`Wikipedia: Coloración de grafos `__" +msgid "`Wikipedia: Graph coloring `__" +msgstr "`Wikipedia: Coloración de grafos `__" -msgid "" -"``pgr_edgeDisjointPaths`` — Calculates edge disjoint paths between two " -"groups of vertices." -msgstr "" -"``pgr_edgeDisjointPaths`` — Calcula las rutas de aristas desarticuladas " -"entre dos grupos de vértices." +msgid "``pgr_edgeDisjointPaths`` — Calculates edge disjoint paths between two groups of vertices." +msgstr "``pgr_edgeDisjointPaths`` — Calcula las rutas de aristas desarticuladas entre dos grupos de vértices." msgid "pgr_edgeDisjointPaths(Combinations)" msgstr "pgr_edgeDisjointPaths(Combinaciones)" -msgid "" -"Calculates the edge disjoint paths between two groups of vertices. Utilizes " -"underlying maximum flow algorithms to calculate the paths." -msgstr "" -"Calcula las rutas de aristas desarticuladas entre dos grupos de vértices. " -"Utiliza algoritmos de flujo máximo subyacentes para calcular las rutas." +msgid "Calculates the edge disjoint paths between two groups of vertices. Utilizes underlying maximum flow algorithms to calculate the paths." +msgstr "Calcula las rutas de aristas desarticuladas entre dos grupos de vértices. Utiliza algoritmos de flujo máximo subyacentes para calcular las rutas." msgid "The main characterics are:" msgstr "Los principales características son:" msgid "Calculates the edge disjoint paths between any two groups of vertices." -msgstr "" -"Calcula las rutas de aristas desarticuladas entre dos grupos de vértices " -"cualquiera." +msgstr "Calcula las rutas de aristas desarticuladas entre dos grupos de vértices cualquiera." -msgid "" -"Returns EMPTY SET when source and destination are the same, or cannot be " -"reached." -msgstr "" -"Devuelve un conjunto vacío EMPTY SET cuando el origen y el destino son los " -"mismos o no se puede llegar." +msgid "Returns EMPTY SET when source and destination are the same, or cannot be reached." +msgstr "Devuelve un conjunto vacío EMPTY SET cuando el origen y el destino son los mismos o no se puede llegar." msgid "The graph can be directed or undirected." msgstr "El gráfico puede dirigido o no." @@ -14517,63 +10763,32 @@ msgstr "El gráfico puede dirigido o no." msgid "Uses :doc:`pgr_boykovKolmogorov` to calculate the paths." msgstr "Utiliza :doc:`pgr_boykovKolmogorov` para calcular las rutas." -msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, " -"[``directed``])" -msgstr "" -"pgr_edgeDisjointPaths(`SQL de aristas`_, **salida**, **destino**, " -"[``directed``])" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_edgeDisjointPaths(`SQL de aristas`_, **salida**, **destino**, [``directed``])" -msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vids**, " -"[``directed``])" -msgstr "" -"pgr_edgeDisjointPaths(`SQL de aristas`_, **salida**, **destinos**, " -"[``directed``])" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_edgeDisjointPaths(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" -msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vid**, " -"[``directed``])" -msgstr "" -"pgr_edgeDisjointPaths(`SQL de aristas`_, **salidas**, **destino**, " -"[``directed``])" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_edgeDisjointPaths(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" -msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" -msgstr "" -"pgr_edgeDisjointPaths(`SQL de aristas`_, **salidas**, **destinos**, " -"[``directed``])" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_edgeDisjointPaths(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" -msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "" -"pgr_edgeDisjointPaths(`SQL de aristas`_, `SQL de combinaciones`_, " -"[``directed``])" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_edgeDisjointPaths(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" -msgid "" -"Using a combinations table, equivalent to calculating result from vertices :" -"math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}` on an undirected " -"graph." -msgstr "" -"Usando una tabla de combinaciones, equivalente a calcular el resultado de " -"los vértices :math:`\\{5, 6\\}` a los vértices :math:`\\{10, 15, 14\\}` en " -"un grafo no dirigido." +msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}` on an undirected graph." +msgstr "Usando una tabla de combinaciones, equivalente a calcular el resultado de los vértices :math:`\\{5, 6\\}` a los vértices :math:`\\{10, 15, 14\\}` en un grafo no dirigido." msgid "Manually assigned vertex combinations on an undirected graph." -msgstr "" -"Asignando manualmente las combinaciones de vértices en un grafo no dirigido." +msgstr "Asignando manualmente las combinaciones de vértices en un grafo no dirigido." msgid "``pgr_edmondsKarp``" msgstr "``pgr_edmondsKarp``" -msgid "" -"``pgr_edmondsKarp`` — Calculates the flow on the graph edges that maximizes " -"the flow from the sources to the targets using Edmonds Karp Algorithm." -msgstr "" -"``pgr_edmondsKarp`` — Calcula el flujo en las aristas del grafo que " -"maximizan el flujo de las fuentes a los destinos usando el algoritmo de " -"Edmonds Karp." +msgid "``pgr_edmondsKarp`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Edmonds Karp Algorithm." +msgstr "``pgr_edmondsKarp`` — Calcula el flujo en las aristas del grafo que maximizan el flujo de las fuentes a los destinos usando el algoritmo de Edmonds Karp." msgid "pgr_edmondsKarp(Combinations)" msgstr "pgr_edmondsKarp(Combinaciones)" @@ -14599,12 +10814,8 @@ msgstr "pgr_edmondsKarp(`SQL de aristas`_, **salidas**, **destinos**)" msgid "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" msgstr "pgr_edmondsKarp(`SQL de aristas`_, `SQL de combinaciones`_)" -msgid "" -"`Boost: Edmonds Karp max flow `__" -msgstr "" -"`Boost: Edmonds Karp max flow `__" +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" @@ -14612,55 +10823,23 @@ msgstr "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" msgid "``pgr_edwardMoore`` - Experimental" msgstr "``pgr_edwardMoore`` - Experimental" -msgid "" -"``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore algorithm." -msgstr "" -"``pgr_edwardMoore`` — Devuelve la ruta más cortas usando el algoritmo Edward-" -"Moore." +msgid "``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore algorithm." +msgstr "``pgr_edwardMoore`` — Devuelve la ruta más cortas usando el algoritmo Edward-Moore." -msgid "" -"Edward Moore’s Algorithm is an improvement of the Bellman-Ford Algorithm. It " -"can compute the shortest paths from a single source vertex to all other " -"vertices in a weighted directed graph. The main difference between Edward " -"Moore's Algorithm and Bellman Ford's Algorithm lies in the run time." -msgstr "" -"Algoritmo de Edward Moore es una mejora del algoritmo Bellman-Ford. Puede " -"calcular las rutas más cortas desde un único vértice de origen a todos los " -"demás vértices de un grafo dirigido ponderado. La principal diferencia entre " -"algoritmo de Edward Moore y algoritmo de Bellman Ford radica en el tiempo de " -"ejecución." +msgid "Edward Moore’s Algorithm is an improvement of the Bellman-Ford Algorithm. It can compute the shortest paths from a single source vertex to all other vertices in a weighted directed graph. The main difference between Edward Moore's Algorithm and Bellman Ford's Algorithm lies in the run time." +msgstr "Algoritmo de Edward Moore es una mejora del algoritmo Bellman-Ford. Puede calcular las rutas más cortas desde un único vértice de origen a todos los demás vértices de un grafo dirigido ponderado. La principal diferencia entre algoritmo de Edward Moore y algoritmo de Bellman Ford radica en el tiempo de ejecución." -msgid "" -"The worst-case running time of the algorithm is :math:`O(| V | * | E |)` " -"similar to the time complexity of Bellman-Ford algorithm. However, " -"experiments suggest that this algorithm has an average running time " -"complexity of :math:`O( | E | )` for random graphs. This is significantly " -"faster in terms of computation speed." -msgstr "" -"El peor de los casos de funcionamiento del algoritmo es :math:`O(| V | * | E " -"|)` similar a la complejidad temporal del algoritmo Bellman-Ford. Sin " -"embargo, los experimentos sugieren que este algoritmo tiene una complejidad " -"de tiempo de ejecución promedio de :math:`O( | E | )` para grafos " -"aleatorios. Esto es significativamente más rápido en términos de velocidad " -"de cálculo." +msgid "The worst-case running time of the algorithm is :math:`O(| V | * | E |)` similar to the time complexity of Bellman-Ford algorithm. However, experiments suggest that this algorithm has an average running time complexity of :math:`O( | E | )` for random graphs. This is significantly faster in terms of computation speed." +msgstr "El peor de los casos de funcionamiento del algoritmo es :math:`O(| V | * | E |)` similar a la complejidad temporal del algoritmo Bellman-Ford. Sin embargo, los experimentos sugieren que este algoritmo tiene una complejidad de tiempo de ejecución promedio de :math:`O( | E | )` para grafos aleatorios. Esto es significativamente más rápido en términos de velocidad de cálculo." -msgid "" -"Thus, the algorithm is at-best, significantly faster than Bellman-Ford " -"algorithm and is at-worst,as good as Bellman-Ford algorithm" -msgstr "" -"Por lo tanto, el algoritmo es, en el mejor de los casos, significativamente " -"más rápido que el algoritmo Bellman-Ford y es en el peor de los casos, tan " -"bueno como el algoritmo Bellman-Ford" +msgid "Thus, the algorithm is at-best, significantly faster than Bellman-Ford algorithm and is at-worst,as good as Bellman-Ford algorithm" +msgstr "Por lo tanto, el algoritmo es, en el mejor de los casos, significativamente más rápido que el algoritmo Bellman-Ford y es en el peor de los casos, tan bueno como el algoritmo Bellman-Ford" msgid "The `agg_cost` the non included values `(v, v)` is :math:`0`" msgstr "El `agg_cost` de los valores no incluídos `(v, v)` es :math:`0`" -msgid "" -"For optimization purposes, any duplicated value in the `start vids` or `end " -"vids` are ignored." -msgstr "" -"Para fines de optimización, se omite cualquier valor duplicado en " -"`start_vids` o `end_vids`." +msgid "For optimization purposes, any duplicated value in the `start vids` or `end vids` are ignored." +msgstr "Para fines de optimización, se omite cualquier valor duplicado en `start_vids` o `end_vids`." msgid "Running time:" msgstr "Tiempo de ejecución:" @@ -14671,29 +10850,20 @@ msgstr "Peor caso: :math:`O(| V | * | E |)`" msgid "Average case: :math:`O( | E | )`" msgstr "Caso promedio: :math:`O( | E | )`" -msgid "" -"pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "" -"pgr_edwardMoore(`SQL de aristas`_, **salida**, **destino**, [``directed``])" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_edwardMoore(`SQL de aristas`_, **salida**, **destino**, [``directed``])" -msgid "" -"pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "" -"pgr_edwardMoore(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_edwardMoore(`SQL de aristas`_, **salida**, **destinos**, [``directed``])" -msgid "" -"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "" -"pgr_edwardMoore(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_edwardMoore(`SQL de aristas`_, **salidas**, **destino**, [``directed``])" -msgid "" -"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "" -"pgr_edwardMoore(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_edwardMoore(`SQL de aristas`_, **salidas**, **destinos**, [``directed``])" msgid "pgr_edwardMoore(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "" -"pgr_edwardMoore(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" +msgstr "pgr_edwardMoore(`SQL de aristas`_, `SQL de combinaciones`_, [``directed``])" msgid "Using a combinations table on an **undirected** graph." msgstr "Uso de una tabla de combinaciones en un grafo **no dirigido**." @@ -14707,19 +10877,11 @@ msgstr "``pgr_extractVertices``" msgid "``pgr_extractVertices`` — Extracts the vertices information" msgstr "``pgr_extractVertices`` — Extrae la información de los vértices" -msgid "" -"This is an auxiliary function for extracting the vertex information of the " -"set of edges of a graph." -msgstr "" -"Esta es una función auxiliar para extraer la información de vértices del " -"conjunto de aristas de un grafo." +msgid "This is an auxiliary function for extracting the vertex information of the set of edges of a graph." +msgstr "Esta es una función auxiliar para extraer la información de vértices del conjunto de aristas de un grafo." -msgid "" -"When the edge identifier is given, then it will also calculate the in and " -"out edges" -msgstr "" -"Cuando se proporciona el identificador de arista, también se calcularán las " -"aristas de entrada y salida" +msgid "When the edge identifier is given, then it will also calculate the in and out edges" +msgstr "Cuando se proporciona el identificador de arista, también se calcularán las aristas de entrada y salida" msgid "pgr_extractVertices(`Edges SQL`_, [``dryrun``])" msgstr "pgr_extractVertices(`SQL de aristas`_, [``dryrun``])" @@ -14742,13 +10904,8 @@ msgstr "``LINESTRING``" msgid "Geometry of the edge." msgstr "Geometría de la arista." -msgid "" -"This inner query takes precedence over the next two inner query, therefore " -"other columns are ignored when ``geom`` column appears." -msgstr "" -"Esta consulta interna tiene prioridad sobre las dos consultas internas " -"siguientes, por lo que se omiten otras columnas cuando aparece la columna " -"''geom''." +msgid "This inner query takes precedence over the next two inner query, therefore other columns are ignored when ``geom`` column appears." +msgstr "Esta consulta interna tiene prioridad sobre las dos consultas internas siguientes, por lo que se omiten otras columnas cuando aparece la columna ''geom''." msgid "Ignored columns:" msgstr "Columnas ignoradas:" @@ -14762,12 +10919,8 @@ msgstr "``endpoint``" msgid "When vertex geometry is known" msgstr "Cuando se conoce la geometría de vértices" -msgid "" -"To use this inner query the column ``geom`` should not be part of the set of " -"columns." -msgstr "" -"Para utilizar esta consulta interna, la columna ``geom`` no debe formar " -"parte del conjunto de columnas." +msgid "To use this inner query the column ``geom`` should not be part of the set of columns." +msgstr "Para utilizar esta consulta interna, la columna ``geom`` no debe formar parte del conjunto de columnas." msgid "``POINT``" msgstr "``POINT``" @@ -14778,23 +10931,14 @@ msgstr "Geometría POINT del vértice inicial." msgid "POINT geometry of the ending vertex." msgstr "Geometría POINT del vértice final." -msgid "" -"This inner query takes precedence over the next inner query, therefore other " -"columns are ignored when ``startpoint`` and ``endpoint`` columns appears." -msgstr "" -"Esta consulta interna tiene prioridad sobre la siguiente consulta interna, " -"por lo que otras columnas son ignoradas cuando aparecen las columnas " -"``startpoint`` y ``endpoint``." +msgid "This inner query takes precedence over the next inner query, therefore other columns are ignored when ``startpoint`` and ``endpoint`` columns appears." +msgstr "Esta consulta interna tiene prioridad sobre la siguiente consulta interna, por lo que otras columnas son ignoradas cuando aparecen las columnas ``startpoint`` y ``endpoint``." msgid "When identifiers of vertices are known" msgstr "Cuando se conocen identificadores de vértices" -msgid "" -"To use this inner query the columns ``geom``, ``startpoint`` and " -"``endpoint`` should not be part of the set of columns." -msgstr "" -"Para utilizar esta consulta interna, las columnas ``geom``, ``startpoint`` y " -"``endpoint`` no deben formar parte del conjunto de columnas." +msgid "To use this inner query the columns ``geom``, ``startpoint`` and ``endpoint`` should not be part of the set of columns." +msgstr "Para utilizar esta consulta interna, las columnas ``geom``, ``startpoint`` y ``endpoint`` no deben formar parte del conjunto de columnas." msgid "``NULL`` When the ``id`` is not part of the inner query" msgstr "``NULL`` When the ``id`` no forma parte de la consulta interna" @@ -14808,12 +10952,8 @@ msgstr "``NULL`` Cuando no se proporciona geometría" msgid "Geometry of the point" msgstr "Geometría del punto" -msgid "" -"To get the query generated used to get the vertex information, use ``dryrun :" -"= true``." -msgstr "" -"Para obtener la consulta generada que se usa para obtener la información de " -"vértices, utilice ``dryrun := true``." +msgid "To get the query generated used to get the vertex information, use ``dryrun := true``." +msgstr "Para obtener la consulta generada que se usa para obtener la información de vértices, utilice ``dryrun := true``." msgid "Create a routing topology" msgstr "Creación de una topología de ruteo" @@ -14824,11 +10964,8 @@ msgstr "Asegurarse de que la base de datos no tiene ``vertices_table``" msgid "Clean up the columns of the routing topology to be created" msgstr "Limpieza de las columnas de la topología de ruteo que se creará" -msgid "" -"When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, )``" -msgstr "" -"Cuando ``LINESTRING`` tiene un SRID entonces usa ``geom::geometry(POINT, " -")``" +msgid "When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, )``" +msgstr "Cuando ``LINESTRING`` tiene un SRID entonces usa ``geom::geometry(POINT, )``" msgid "For big edge tables that are been prepared," msgstr "Para grandes tablas de aristas que han sido preparadas," @@ -14861,45 +10998,28 @@ msgid "``pgr_findCloseEdges``" msgstr "``pgr_findCloseEdges``" msgid "``pgr_findCloseEdges`` - Finds the close edges to a point geometry." -msgstr "" -"``pgr_findCloseEdges`` - Encuentra las aristas cercanas a una geometría " -"puntual." +msgstr "``pgr_findCloseEdges`` - Encuentra las aristas cercanas a una geometría puntual." msgid "``partial`` option is removed." msgstr "Opción ``partial`` se elimina." -msgid "" -"``pgr_findCloseEdges`` - An utility function that finds the closest edge to " -"a point geometry." -msgstr "" -"``pgr_findCloseEdges`` - Función de utilidad que encuentra la arista más " -"cercana a una geometría de puntos." +msgid "``pgr_findCloseEdges`` - An utility function that finds the closest edge to a point geometry." +msgstr "``pgr_findCloseEdges`` - Función de utilidad que encuentra la arista más cercana a una geometría de puntos." -msgid "" -"The geometries must be in the same coordinate system (have the same SRID)." -msgstr "" -"Las geometrías deben estar en el mismo sistema de coordenadas (tener el " -"mismo SRID)." +msgid "The geometries must be in the same coordinate system (have the same SRID)." +msgstr "Las geometrías deben estar en el mismo sistema de coordenadas (tener el mismo SRID)." -msgid "" -"The code to do the calculations can be obtained for further specific " -"adjustments needed by the application." -msgstr "" -"El código para realizar los cálculos puede obtenerse para realizar los " -"ajustes específicos que necesite la aplicación." +msgid "The code to do the calculations can be obtained for further specific adjustments needed by the application." +msgstr "El código para realizar los cálculos puede obtenerse para realizar los ajustes específicos que necesite la aplicación." msgid "``EMPTY SET`` is returned on dryrun executions" msgstr "``EMPTY SET`` se devuelve en ejecuciones en seco" -msgid "" -"pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" -msgstr "" -"pgr_findCloseEdges(`Edges SQL`_, **punto**, **tolerancia**, [**options**])" +msgid "pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" +msgstr "pgr_findCloseEdges(`Edges SQL`_, **punto**, **tolerancia**, [**options**])" -msgid "" -"pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" -msgstr "" -"pgr_findCloseEdges(`Edges SQL`_, **puntos**, **tolerancia**, [**options**])" +msgid "pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" +msgstr "pgr_findCloseEdges(`Edges SQL`_, **puntos**, **tolerancia**, [**options**])" msgid "**options:** ``[cap, dryrun]``" msgstr "**opciones:** ``[cap, dryrun]``" @@ -14949,12 +11069,8 @@ msgstr "Limitar las filas de salida" msgid "When ``false`` calculations are performed." msgstr "Cuando ``false`` se realizan los cálculos." -msgid "" -"When ``true`` calculations are not performed and the query to do the " -"calculations is exposed in a PostgreSQL ``NOTICE``." -msgstr "" -"Cuando ``true`` los cálculos no se realizan y la consulta para hacer los " -"cálculos se expone en un ``NOTICE`` de PostgreSQL." +msgid "When ``true`` calculations are not performed and the query to do the calculations is exposed in a PostgreSQL ``NOTICE``." +msgstr "Cuando ``true`` los cálculos no se realizan y la consulta para hacer los cálculos se expone en un ``NOTICE`` de PostgreSQL." msgid "``geometry``" msgstr "``geometry``" @@ -14965,12 +11081,8 @@ msgstr "La geometría ``LINESTRING`` de la arista." msgid "When :math:`cap = 1`, it is the closest edge." msgstr "Cuando :math:`cap = 1`, es la arista más cercana." -msgid "" -"Value in <0,1> that indicates the relative position from the first end-point " -"of the edge." -msgstr "" -"Valor entre <0,1> indica la posición relativa desde el primer punto de la " -"arista." +msgid "Value in <0,1> that indicates the relative position from the first end-point of the edge." +msgstr "Valor entre <0,1> indica la posición relativa desde el primer punto de la arista." msgid "Value in ``[r, l]`` indicating if the point is:" msgstr "Valor en ``[r, l]`` que indica si el punto es:" @@ -14993,12 +11105,8 @@ msgstr "Distancia del punto a la arista." msgid "Original ``POINT`` geometry." msgstr "Geometría original ``POINT``." -msgid "" -"``LINESTRING`` geometry that connects the original **point** to the closest " -"point of the edge with identifier ``edge_id``" -msgstr "" -"Geometría ``LINESTRING`` desde el **punto** original hasta el punto más " -"cercano de la arista con identificador ``edge_id``" +msgid "``LINESTRING`` geometry that connects the original **point** to the closest point of the edge with identifier ``edge_id``" +msgstr "Geometría ``LINESTRING`` desde el **punto** original hasta el punto más cercano de la arista con identificador ``edge_id``" msgid "One point in an edge" msgstr "Un punto en la arista" @@ -15009,12 +11117,8 @@ msgstr "El nodo verde es el punto original." msgid "``geom`` has the value of the original point." msgstr "``geom`` Tiene el valor del punto original." -msgid "" -"The geometry ``edge`` is a line that connects the original point with the " -"edge :math:`sp \\rightarrow ep` edge." -msgstr "" -"La geometría ``edge``, es una línea que conecta al punto original con el " -"punto más cercano de la arista :math:`sp \\rightarrow ep`." +msgid "The geometry ``edge`` is a line that connects the original point with the edge :math:`sp \\rightarrow ep` edge." +msgstr "La geometría ``edge``, es una línea que conecta al punto original con el punto más cercano de la arista :math:`sp \\rightarrow ep`." msgid "The point is located at the left of the edge." msgstr "El punto original está situado a la izquierda de la arista." @@ -15034,9 +11138,7 @@ msgstr "``dryrun => true``" msgid "Generates a PostgreSQL ``NOTICE`` with the code used." msgstr "Genera un ``NOTICE`` de PostgreSQL con el código utilizado." -msgid "" -"The generated code can be used as a starting base code for additional " -"requirements, like taking into consideration the SRID." +msgid "The generated code can be used as a starting base code for additional requirements, like taking into consideration the SRID." msgstr "" msgid "Many points in an edge" @@ -15045,21 +11147,11 @@ msgstr "Ejemplos de muchos puntos en una arista" msgid "The green nodes are the **original points**" msgstr "Los nodos verdes son los **puntos originales**" -msgid "" -"The geometry ``geom``, marked as **g1** and **g2** are the **original " -"points**" -msgstr "" -"La geometría ``geom``, marcada como **g1** y **g2** son los **puntos " -"originales**" - -msgid "" -"The geometry ``edge``, marked as **edge1** and **edge2** is a line that " -"connects the **original point** with the closest point on the :math:`sp " -"\\rightarrow ep` edge." -msgstr "" -"La geometría ``edge``, marcada como **edge1** y **edge2** es una línea que " -"conecta el **punto original** con el punto más cercano de la arista :math:" -"`sp \\rightarrow ep`." +msgid "The geometry ``geom``, marked as **g1** and **g2** are the **original points**" +msgstr "La geometría ``geom``, marcada como **g1** y **g2** son los **puntos originales**" + +msgid "The geometry ``edge``, marked as **edge1** and **edge2** is a line that connects the **original point** with the closest point on the :math:`sp \\rightarrow ep` edge." +msgstr "La geometría ``edge``, marcada como **edge1** y **edge2** es una línea que conecta el **punto original** con el punto más cercano de la arista :math:`sp \\rightarrow ep`." msgid "Many points dry run execution" msgstr "Ejecución en seco de muchos puntos" @@ -15067,11 +11159,8 @@ msgstr "Ejecución en seco de muchos puntos" msgid "Do not process query" msgstr "No procesar la consulta" -msgid "" -"Generate a PostgreSQL ``NOTICE`` with the code used to calculate all columns" -msgstr "" -"Generar un ``NOTICE`` de PostgreSQL con el código utilizado para calcular " -"todas las columnas" +msgid "Generate a PostgreSQL ``NOTICE`` with the code used to calculate all columns" +msgstr "Generar un ``NOTICE`` de PostgreSQL con el código utilizado para calcular todas las columnas" msgid "Find at most two routes to a given point" msgstr "Encontrar como máximo dos rutas a un punto dado" @@ -15088,28 +11177,14 @@ msgstr "Manejo de puntos fuera del gráfico." msgid "Points of interest" msgstr "Puntos de interés" -msgid "" -"Some times the applications work \"on the fly\" starting from a location " -"that is not a vertex in the graph. Those locations, in pgRrouting are called " -"points of interest." -msgstr "" -"Algunas veces las aplicaciones trabajan \"sobre la marcha\" comenzando desde " -"una localización que no es un vértice en el grafo. Esas localizaciones, en " -"pgRrouting se llaman puntos de interés." +msgid "Some times the applications work \"on the fly\" starting from a location that is not a vertex in the graph. Those locations, in pgRrouting are called points of interest." +msgstr "Algunas veces las aplicaciones trabajan \"sobre la marcha\" comenzando desde una localización que no es un vértice en el grafo. Esas localizaciones, en pgRrouting se llaman puntos de interés." -msgid "" -"The information needed in the points of interest is ``pid``, ``edge_id``, " -"``side``, ``fraction``." -msgstr "" -"La información necesaria en los puntos de interés es ``pid``, ``edge_id``, " -"``side``, ``fraction``." +msgid "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 "On this documentation there will be some 6 fixed points of interest and they will be stored on a table." +msgstr "En esta documentación habrá unos 6 puntos de interés fijos y se almacenarán en una tabla." msgid "A unique identifier." msgstr "Un identificador único." @@ -15118,8 +11193,7 @@ msgid "Identifier of the nearest segment." msgstr "Identificador del segmento mas próximo." msgid "Is it on the left, right or both sides of the segment ``edge_id``." -msgstr "" -"Está a la izquierda, a la derecha o a ambos lados del segmento ``edge_id``." +msgstr "Está a la izquierda, a la derecha o a ambos lados del segmento ``edge_id``." msgid "Where in the segment is the point located." msgstr "En qué parte del segmento se encuentra el punto." @@ -15130,12 +11204,8 @@ 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 "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``" @@ -15152,9 +11222,7 @@ msgstr "Insertando los puntos de interés." msgid "Filling the rest of the table." msgstr "Llenando el resto de la tabla." -msgid "" -"Any other additional modification: In this manual, point :math:`6` can be " -"reached from both sides." +msgid "Any other additional modification: In this manual, point :math:`6` can be reached from both sides." msgstr "" msgid "The points of interest:" @@ -15163,23 +11231,11 @@ msgstr "Los puntos de interés:" msgid "``pgr_floydWarshall``" msgstr "``pgr_floydWarshall``" -msgid "" -"``pgr_floydWarshall`` - Returns the sum of the costs of the shortest path " -"for each pair of nodes in the graph using Floyd-Warshall algorithm." -msgstr "" -"``pgr_floydWarshall`` - Devuelve la suma de los costos de la ruta más corta " -"para cada par de nodos en el grafo mediante el algoritmo Floyd-Warshall." +msgid "``pgr_floydWarshall`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Floyd-Warshall algorithm." +msgstr "``pgr_floydWarshall`` - Devuelve la suma de los costos de la ruta más corta para cada par de nodos en el grafo mediante el algoritmo Floyd-Warshall." -msgid "" -"The Floyd-Warshall algorithm, also known as Floyd's algorithm, is a good " -"choice to calculate the sum of the costs of the shortest path for each pair " -"of nodes in the graph, for *dense graphs*. We use Boost's implementation " -"which runs in :math:`\\Theta(V^3)` time," -msgstr "" -"El algoritmo Floyd-Warshall, también conocido como algoritmo de Floyd, es " -"una buena opción para calcular la suma de los costos de la ruta más corta " -"para cada par de nodos en el grafo, para *grafos densos*. Usamos la " -"implementación de Boost que se ejecuta en :math:`\\Theta(V^3)` tiempo," +msgid "The Floyd-Warshall algorithm, also known as Floyd's algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *dense graphs*. We use Boost's implementation which runs in :math:`\\Theta(V^3)` time," +msgstr "El algoritmo Floyd-Warshall, también conocido como algoritmo de Floyd, es una buena opción para calcular la suma de los costos de la ruta más corta para cada par de nodos en el grafo, para *grafos densos*. Usamos la implementación de Boost que se ejecuta en :math:`\\Theta(V^3)` tiempo," msgid "pgr_floydWarshall(`Edges SQL`_, [``directed``])" msgstr "pgr_floydWarshall(`SQL de aristas`_, [``directed``])" @@ -15188,21 +11244,14 @@ msgid "For a directed subgraph with edges :math:`\\{1, 2, 3, 4\\}`." msgstr "Para sub-grafo con aristas :math:`\\{1, 2, 3, 4\\}`." #, fuzzy -msgid "" -"Boost `Floyd-Warshall `_" -msgstr "" -"Boost `Algoritmo floyd-Warshall `_" +msgid "Boost `Floyd-Warshall `_" +msgstr "Boost `Algoritmo floyd-Warshall `_" msgid "``pgr_full_version``" msgstr "``pgr_full_version``" -msgid "" -"``pgr_full_version`` — Get the details of pgRouting version information." -msgstr "" -"``pgr_full_version`` — Obtener los detalles de la información de la versión " -"de pgRouting." +msgid "``pgr_full_version`` — Get the details of pgRouting version information." +msgstr "``pgr_full_version`` — Obtener los detalles de la información de la versión de pgRouting." msgid "Get complete details of pgRouting version information" msgstr "Obtener los detalles de la información de la versión de pgRouting" @@ -15274,52 +11323,23 @@ msgid "``pgr_hawickCircuits`` - Experimental" msgstr "``pgr_hawickCircuits`` - Experimental" #, fuzzy -msgid "" -"``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits " -"algorithm." -msgstr "" -"``pgr_hawickCircuits`` — Enumeración de circuitos usando el algoritmo de " -"circutos de Hawick." +msgid "``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits algorithm." +msgstr "``pgr_hawickCircuits`` — Enumeración de circuitos usando el algoritmo de circutos de Hawick." -msgid "" -"Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. " -"James. This algorithm solves the problem of detecting and enumerating " -"circuits in graphs. It is capable of circuit enumeration in graphs with " -"directed-arcs, multiple-arcs and self-arcs with a memory efficient and high-" -"performance im-plementation. It is an extension of Johnson's Algorithm of " -"finding all the elementary circuits of a directed graph." -msgstr "" -"El algoritmo Hawick Circuit fue publicado en 2008 por Ken Hawick y Health A. " -"James. Este algoritmo resuelve el problema de detectar y enumerar circuitos " -"en grafos. Es capaz de enumerar circuitos en grafos con arcos dirigidos, " -"arcos múltiples y autoarcos con una implementación eficiente en memoria y de " -"alto rendimiento. Es una extensión del Algoritmo de Johnson para encontrar " -"todos los circuitos elementales de un grafo dirigido." +msgid "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. James. This algorithm solves the problem of detecting and enumerating circuits in graphs. It is capable of circuit enumeration in graphs with directed-arcs, multiple-arcs and self-arcs with a memory efficient and high-performance im-plementation. It is an extension of Johnson's Algorithm of finding all the elementary circuits of a directed graph." +msgstr "El algoritmo Hawick Circuit fue publicado en 2008 por Ken Hawick y Health A. James. Este algoritmo resuelve el problema de detectar y enumerar circuitos en grafos. Es capaz de enumerar circuitos en grafos con arcos dirigidos, arcos múltiples y autoarcos con una implementación eficiente en memoria y de alto rendimiento. Es una extensión del Algoritmo de Johnson para encontrar todos los circuitos elementales de un grafo dirigido." -msgid "" -"There are 2 variations defined in the Boost Graph Library. Here, we have " -"implemented only 2nd as it serves the most suitable and practical usecase. " -"In this variation we get the circuits after filtering out the circuits " -"caused by parallel edges. Parallel edge circuits have more use cases when " -"you want to count the no. of circuits.Maybe in future, we will also " -"implemenent this variation." -msgstr "" -"Hay 2 variaciones definidas en la librería Boost Graph. Aquí hemos " -"implementado sólo la segunda, ya que es la más adecuada y práctica. En esta " -"variación obtenemos los circuitos después de filtrar los circuitos causados " -"por aristas paralelas. Los circuitos de aristas paralelas tienen más casos " -"de uso cuando se quiere contar el número de circuitos." +msgid "There are 2 variations defined in the Boost Graph Library. Here, we have implemented only 2nd as it serves the most suitable and practical usecase. In this variation we get the circuits after filtering out the circuits caused by parallel edges. Parallel edge circuits have more use cases when you want to count the no. of circuits.Maybe in future, we will also implemenent this variation." +msgstr "Hay 2 variaciones definidas en la librería Boost Graph. Aquí hemos implementado sólo la segunda, ya que es la más adecuada y práctica. En esta variación obtenemos los circuitos después de filtrar los circuitos causados por aristas paralelas. Los circuitos de aristas paralelas tienen más casos de uso cuando se quiere contar el número de circuitos." msgid "The algorithm implementation works only for directed graph" msgstr "La implementación del algoritmo sirve solo para grafos dirigidos" msgid "It is a variation of Johnson's algorithm for circuit enumeration." -msgstr "" -"Es una variación del algoritmo de Johnson para la enumeración de circuitos." +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." +msgstr "El algoritmo da como resultado los distintos circuitos presentes en el grafo." msgid "Time Complexity: :math:`O((V + E) (c + 1))`" msgstr "Complejidad temporal: :math:`O((V + E) (c + 1))`" @@ -15337,11 +11357,8 @@ msgid "Id of the circuit starting from ``1``" msgstr "Identificador del circuito comenzando con ``1``" #, fuzzy -msgid "" -"Relative position in the path. Has value ``0`` for beginning of the path" -msgstr "" -"Posición relativa en la camino. Tiene el valor ``0`` para el inicio de la " -"ruta" +msgid "Relative position in the path. Has value ``0`` for beginning of the path" +msgstr "Posición relativa en la camino. Tiene el valor ``0`` para el inicio de la ruta" msgid "Identifier of the starting vertex of the circuit." msgstr "Identificador del vértice inicial del circuito." @@ -15352,42 +11369,22 @@ msgstr "Identificador del vértice final del circuito." msgid "Identifier of the node in the path from a vid to next vid." msgstr "Identificador del nodo en la ruta de un vértice al siguiente vértice." -msgid "" -"`Boost: Hawick Circuit Algorithm `__" -msgstr "" -"`Boost: Algoritmo de Circutios de Hawick `__" +msgid "`Boost: Hawick Circuit Algorithm `__" +msgstr "`Boost: Algoritmo de Circutios de Hawick `__" msgid "``pgr_isPlanar`` - Experimental" msgstr "``pgr_isPlanar`` - Experimental" -msgid "" -"``pgr_isPlanar`` — Returns a boolean depending upon the planarity of the " -"graph." -msgstr "" -"``pgr_isPlanar`` — Devuelve un valor boolean dependiendo de la planaridad " -"del grafo." +msgid "``pgr_isPlanar`` — Returns a boolean depending upon the planarity of the graph." +msgstr "``pgr_isPlanar`` — Devuelve un valor boolean dependiendo de la planaridad del grafo." -msgid "" -"A graph is planar if it can be drawn in two-dimensional space with no two of " -"its edges crossing. Such a drawing of a planar graph is called a plane " -"drawing. Every planar graph also admits a straight-line drawing, which is a " -"plane drawing where each edge is represented by a line segment. When a graph " -"has :math:`K_5` or :math:`K_{3, 3}` as subgraph then the graph is not planar." -msgstr "" -"Un grafo es planar si se puede dibujar en un espacio bidimensional sin que " -"se crucen dos de sus aristas. Este dibujo de un grafo planaro es llamado " -"dibujo de plano. Cada grafo planar también admite un dibujo de línea recta, " -"que es un dibujo de plano donde cada arista está representada por un " -"segmento de línea. Cuando un grafo tiene :math:`K_5` or :math:`K_{3,3}` como " -"subgrafo, entonces el grafo no es planar." +msgid "A graph is planar if it can be drawn in two-dimensional space with no two of its edges crossing. Such a drawing of a planar graph is called a plane drawing. Every planar graph also admits a straight-line drawing, which is a plane drawing where each edge is represented by a line segment. When a graph has :math:`K_5` or :math:`K_{3, 3}` as subgraph then the graph is not planar." +msgstr "Un grafo es planar si se puede dibujar en un espacio bidimensional sin que se crucen dos de sus aristas. Este dibujo de un grafo planaro es llamado dibujo de plano. Cada grafo planar también admite un dibujo de línea recta, que es un dibujo de plano donde cada arista está representada por un segmento de línea. Cuando un grafo tiene :math:`K_5` or :math:`K_{3,3}` como subgrafo, entonces el grafo no es planar." msgid "This implementation use the Boyer-Myrvold Planarity Testing." msgstr "Esta implementación utiliza la Prueba de Planaridad de Boyer-Myrvold." -msgid "" -"It will return a boolean value depending upon the planarity of the graph." +msgid "It will return a boolean value depending upon the planarity of the graph." msgstr "Devolverá un valor boolean dependiendo de la planaridad del grrafo." msgid "Applicable only for **undirected** graphs." @@ -15417,90 +11414,50 @@ msgstr "`true` cuando el grafo es planar." msgid "`false` when the graph is not planar." msgstr "`false` cuando el grafo no es planar." -msgid "" -"The following edges will make the subgraph with vertices {10, 15, 11, 16, " -"13} a :math:`K_1` graph." -msgstr "" -"Las siguientes aristas harán de el subgrafo con los vértices {10, 15, 11, " -"16, 13} un grafo :math:`K_5`." +msgid "The following edges will make the subgraph with vertices {10, 15, 11, 16, 13} a :math:`K_1` graph." +msgstr "Las siguientes aristas harán de el subgrafo con los vértices {10, 15, 11, 16, 13} un grafo :math:`K_5`." -msgid "" -"The new graph is not planar because it has a :math:`K_5` subgraph. Edges in " -"blue represent :math:`K_5` subgraph." -msgstr "" -"El nuevo grafo no es planar porque tiene un subgráfico :math:`K_5`. Las " -"aristas en azul representan el subgrafo :math:`K_5`." +msgid "The new graph is not planar because it has a :math:`K_5` subgraph. Edges in blue represent :math:`K_5` subgraph." +msgstr "El nuevo grafo no es planar porque tiene un subgráfico :math:`K_5`. Las aristas en azul representan el subgrafo :math:`K_5`." -msgid "" -"`Boost: Boyer Myrvold `__" -msgstr "" -"`Boost: Boyer Myrvold `__" +msgid "`Boost: Boyer Myrvold `__" +msgstr "`Boost: Boyer Myrvold `__" msgid "``pgr_johnson``" msgstr "``pgr_johnson``" #, fuzzy -msgid "" -"``pgr_johnson`` - Returns the sum of the costs of the shortest path for each " -"pair of nodes in the graph using Johnson algorithm." -msgstr "" -"``pgr_johnson`` - Devuelve la suma de los costes de la ruta más corta para " -"cada par de nodos del grafo mediante el algoritmo Floyd-Warshall." +msgid "``pgr_johnson`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Johnson algorithm." +msgstr "``pgr_johnson`` - Devuelve la suma de los costes de la ruta más corta para cada par de nodos del grafo mediante el algoritmo Floyd-Warshall." #, fuzzy -msgid "" -"The Johnson algorithm, is a good choice to calculate the sum of the costs of " -"the shortest path for each pair of nodes in the graph, for *sparse graphs*. " -"It uses the Boost's implementation which runs in :math:`O(V E \\log V)` time," -msgstr "" -"El algoritmo Johnson, es una buena opción para calcular la suma de los " -"costos de la ruta más corta para cada par de nodos en el grafo, para *grafos " -"dispersos*. Utiliza la implementación del Boost que se ejecuta en :math:`O(V " -"E \\log V)` tiempo," +msgid "The Johnson algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *sparse graphs*. It uses the Boost's implementation which runs in :math:`O(V E \\log V)` time," +msgstr "El algoritmo Johnson, es una buena opción para calcular la suma de los costos de la ruta más corta para cada par de nodos en el grafo, para *grafos dispersos*. Utiliza la implementación del Boost que se ejecuta en :math:`O(V E \\log V)` tiempo," msgid "pgr johnson(`Edges SQL`_, [``directed``])" msgstr "johnson(`SQL de aristas`_ , [``dryrun``])" -msgid "" -"Boost `Johnson `_" -msgstr "" -"Boost `Algoritmo de Johnson `_" +msgid "Boost `Johnson `_" +msgstr "Boost `Algoritmo de Johnson `_" #, fuzzy msgid "``pgr_kingOrdering`` - Experimental" msgstr "``pgr_edgeColoring`` - Experimental" -msgid "" -"``pgr_kingOrdering`` — Returns the King ordering of an undirected graph." -msgstr "" -"``pgr_kingOrdering`` - Regresa el ordenamiento King de un grafo no dirigido." +msgid "``pgr_kingOrdering`` — Returns the King ordering of an undirected graph." +msgstr "``pgr_kingOrdering`` - Regresa el ordenamiento King de un grafo no dirigido." -msgid "" -"In numerical linear algebra and graph theory, the King ordering algorithm is " -"a heuristic designed to reorder the vertices of a graph so as to reduce its " -"bandwidth." +msgid "In numerical linear algebra and graph theory, the King ordering algorithm is a heuristic designed to reorder the vertices of a graph so as to reduce its bandwidth." msgstr "" -msgid "" -"The method follows a breadth-first search (BFS) traversal, but with a " -"refinement: at each step, the unvisited neighbors of the current vertex are " -"inserted into the queue in ascending order of their pseudo-degree, where the " -"pseudo-degree of a vertex is the number of edges connecting it to yet-" -"unvisited vertices. This prioritization often yields a smaller bandwidth " -"compared to simpler BFS orderings." +msgid "The method follows a breadth-first search (BFS) traversal, but with a refinement: at each step, the unvisited neighbors of the current vertex are inserted into the queue in ascending order of their pseudo-degree, where the pseudo-degree of a vertex is the number of edges connecting it to yet-unvisited vertices. This prioritization often yields a smaller bandwidth compared to simpler BFS orderings." msgstr "" #, fuzzy msgid "The implementation targets undirected graphs." msgstr "La implementación es para grafos **no dirigidos**." -msgid "" -"Bandwidth minimization is an NP-complete problem; King ordering provides a " -"practical local minimization approach." +msgid "Bandwidth minimization is an NP-complete problem; King ordering provides a practical local minimization approach." msgstr "" #, fuzzy @@ -15520,28 +11477,17 @@ msgid "pgr_kingOrdering(`Edges SQL`_)" msgstr "pgr_edgeColoring(`SQL de aristas`_)" #, fuzzy -msgid "" -"`Boost: King Ordering `__" -msgstr "" -"`Boost: Coloración de Segmentos `__" +msgid "`Boost: King Ordering `__" +msgstr "`Boost: Coloración de Segmentos `__" msgid "``pgr_kruskal``" msgstr "``pgr_kruskal``" -msgid "" -"``pgr_kruskal`` — Minimum spanning tree of a graph using Kruskal's algorithm." -msgstr "" -"``pgr_kruskal`` — Devuelve el árbol de expansión mínimo del grafo utilizando " -"el algoritmo Kruskal." +msgid "``pgr_kruskal`` — Minimum spanning tree of a graph using Kruskal's algorithm." +msgstr "``pgr_kruskal`` — Devuelve el árbol de expansión mínimo del grafo utilizando el algoritmo Kruskal." -msgid "" -"This algorithm finds the minimum spanning forest in a possibly disconnected " -"graph using Kruskal's algorithm." -msgstr "" -"Este algoritmo encuentra el bosque de expansión mínimo en un grafo " -"posiblemente desconectado usando el algoritmo de Kruskal." +msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Kruskal's algorithm." +msgstr "Este algoritmo encuentra el bosque de expansión mínimo en un grafo posiblemente desconectado usando el algoritmo de Kruskal." msgid "EMPTY SET is returned when there are no edges in the graph." msgstr "EMPTY SET es regresado cuando no hay aristas en el grafo." @@ -15555,31 +11501,20 @@ msgstr "Regresa el conjunto de |result-mst|" msgid "Minimum spanning forest" msgstr "Bosque de expansión mínimo" -msgid "" -"``pgr_kruskalBFS`` — Kruskal's algorithm for Minimum Spanning Tree with " -"breadth First Search ordering." -msgstr "" -"``pgr_kruskalBFS`` — Algoritmo de Kruskal para el Árbol de Expansión Mínimo " -"con orden de Primera Búsqueda en Anchura." +msgid "``pgr_kruskalBFS`` — Kruskal's algorithm for Minimum Spanning Tree with breadth First Search ordering." +msgstr "``pgr_kruskalBFS`` — Algoritmo de Kruskal para el Árbol de Expansión Mínimo con orden de Primera Búsqueda en Anchura." msgid "Added ``pred`` result columns." msgstr "Agregado columna de resultados ``pred``." -msgid "" -"Visits and extracts the nodes information in Breath First Search ordering of " -"the Minimum Spanning Tree created using Kruskal's algorithm." -msgstr "" -"Visita y extrae la información de los nodos en la orden de Primera Búsqueda " -"en Anchura del Árbol de Expansión Mínimo creado con el algoritmo de Kruskal." +msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." +msgstr "Visita y extrae la información de los nodos en la orden de Primera Búsqueda en Anchura del Árbol de Expansión Mínimo creado con el algoritmo de Kruskal." msgid "Returned tree nodes from a root vertex are on Breath First Search order" -msgstr "" -"Los nodos de árbol devueltos desde un vértice raíz están en orden de la " -"Primera Búsqueda de Anchura" +msgstr "Los nodos de árbol devueltos desde un vértice raíz están en orden de la Primera Búsqueda de Anchura" msgid "Breath First Search Running time: :math:`O(E + V)`" -msgstr "" -"Tiempo de ejecución de la Primera Búsqueda de Anchura: :math:`O(E + V)`" +msgstr "Tiempo de ejecución de la Primera Búsqueda de Anchura: :math:`O(E + V)`" msgid "pgr_kruskalBFS(`Edges SQL`_, **root vid**, [``max_depth``])" msgstr "pgr_kruskalBFS(`SQL de aristas`_, **Raíz**, [``max_depth``])" @@ -15590,30 +11525,17 @@ msgstr "pgr_kruskalBFS(`SQL de aristas`_, **raices**, [``max_depth``])" msgid "The Minimum Spanning Tree having as root vertex :math:`6`" msgstr "El Árbol de Expansión Mínimo que tiene como vértice raíz :math:`6`" -msgid "" -"The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:" -"`depth \\leq 3`" -msgstr "" -"El Árbol de Expansión Mínimo que comienza en los vértices :math:`\\{9, 6\\}` " -"con ::math:`depth \\leq 3`" +msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`depth \\leq 3`" +msgstr "El Árbol de Expansión Mínimo que comienza en los vértices :math:`\\{9, 6\\}` con ::math:`depth \\leq 3`" msgid "``pgr_kruskalDD`` — Catchament nodes using Kruskal's algorithm." -msgstr "" -"``pgr_kruskalDD`` — Nodos de captación utilizando el algoritmo de Kruskal." +msgstr "``pgr_kruskalDD`` — Nodos de captación utilizando el algoritmo de Kruskal." -msgid "" -"Using Kruskal's algorithm, extracts the nodes that have aggregate costs less " -"than or equal to a **distance** from a **root** vertex (or vertices) within " -"the calculated minimum spanning tree." -msgstr "" -"Usando el algoritmo de Kruskal, extraerá los nodos que tienen costos " -"agregados menores o iguales a la **distancia** desde un vértice (o vértices) " -"**raíz** dentro del árbol de expansión mínimo calculado." +msgid "Using Kruskal's algorithm, extracts the nodes that have aggregate costs less than or equal to a **distance** from a **root** vertex (or vertices) within the calculated minimum spanning tree." +msgstr "Usando el algoritmo de Kruskal, extraerá los nodos que tienen costos agregados menores o iguales a la **distancia** desde un vértice (o vértices) **raíz** dentro del árbol de expansión mínimo calculado." msgid "Returned tree nodes from a root vertex are on Depth First Search order." -msgstr "" -"Los nodos de árbol devueltos de un vértice raíz están en el orden de Primera " -"Búsqueda de Profundidad." +msgstr "Los nodos de árbol devueltos de un vértice raíz están en el orden de Primera Búsqueda de Profundidad." msgid "Depth First Search running time: :math:`O(E + V)`" msgstr "Primera Búsqueda de Profundidad, tiempo de ejecución: :math:`O(E + V)`" @@ -15624,39 +11546,20 @@ msgstr "pgr_kruskalDD(`SQL de aristas`_, **raíz**, **distancia**)" msgid "pgr_kruskalDD(`Edges SQL`_, **root vids**, **distance**)" msgstr "pgr_kruskalDD(`SQL de aristas`_, **raices**, **distancia**)" -msgid "" -"The Minimum Spanning Tree starting on vertex :math:`6` with :math:`distance " -"\\leq 3.5`" -msgstr "" -"El mínimo árbol de expansión que comienza en el vértice:math:`6` con :math:" -"`distance \\leq 3.5`" +msgid "The Minimum Spanning Tree starting on vertex :math:`6` with :math:`distance \\leq 3.5`" +msgstr "El mínimo árbol de expansión que comienza en el vértice:math:`6` con :math:`distance \\leq 3.5`" -msgid "" -"The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:" -"`distance \\leq 3.5`" -msgstr "" -"El árbol de expansión mínimo que comienza en los vértices :math:`\\{9, 6\\}` " -"con :math:`distance \\leq 3.5`" +msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`distance \\leq 3.5`" +msgstr "El árbol de expansión mínimo que comienza en los vértices :math:`\\{9, 6\\}` con :math:`distance \\leq 3.5`" -msgid "" -"``pgr_kruskalDFS`` — Kruskal's algorithm for Minimum Spanning Tree with " -"Depth First Search ordering." -msgstr "" -"``pgr_kruskalDFS`` — Algoritmo Kruskal para el Árbol de Expansión Mínima con " -"orden de Búsqueda Primero en Profundidad." +msgid "``pgr_kruskalDFS`` — Kruskal's algorithm for Minimum Spanning Tree with Depth First Search ordering." +msgstr "``pgr_kruskalDFS`` — Algoritmo Kruskal para el Árbol de Expansión Mínima con orden de Búsqueda Primero en Profundidad." -msgid "" -"Visits and extracts the nodes information in Depth First Search ordering of " -"the Minimum Spanning Tree created using Kruskal's algorithm." -msgstr "" -"Visita y extrae la información de los nodos en el orden de Búsqueda en " -"Primera Profundidad del Árbol de Expansión Mínima creado con el algoritmo de " -"Kruskal." +msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." +msgstr "Visita y extrae la información de los nodos en el orden de Búsqueda en Primera Profundidad del Árbol de Expansión Mínima creado con el algoritmo de Kruskal." msgid "Returned tree nodes from a root vertex are on Depth First Search order" -msgstr "" -"Los nodos de árbol devueltos desde un vértice raíz están en el orden de " -"Primera Búsqueda de Profundidad" +msgstr "Los nodos de árbol devueltos desde un vértice raíz están en el orden de Primera Búsqueda de Profundidad" msgid "pgr_kruskalDFS(`Edges SQL`_, **root vid**, [``max_depth``])" msgstr "pgr_kruskalDFS(`SQL de aristas`_, **raíz**, [``max_depth``])" @@ -15667,23 +11570,12 @@ msgstr "pgr_kruskalDFS(`SQL de aristas`_, **raices**, [``max_depth``])" msgid "``pgr_lengauerTarjanDominatorTree`` - Experimental" msgstr "``pgr_lengauerTarjanDominatorTree`` - Experimental" -msgid "" -"``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all " -"vertices." -msgstr "" -"``pgr_lengauerTarjanDominatorTree`` — Devuelve el dominador inmediato de " -"todos los vértices." +msgid "``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all vertices." +msgstr "``pgr_lengauerTarjanDominatorTree`` — Devuelve el dominador inmediato de todos los vértices." #, fuzzy -msgid "" -"The algorithm calculates the *immediate dominator* of each vertex called " -"**idom**, once **idom** of each vertex is calculated then by making every " -"**idom** of each vertex as its parent, the dominator tree can be built." -msgstr "" -"El algoritmo calcula el *dominador inmediato* de cada vértice llamado " -"**idom**, una vez que se calcula la **idom** de cada vértice y, a " -"continuación, haciendo que cada **idom** de cada vértice como su elemento " -"primario, se pueda construir el árbol del dominador." +msgid "The algorithm calculates the *immediate dominator* of each vertex called **idom**, once **idom** of each vertex is calculated then by making every **idom** of each vertex as its parent, the dominator tree can be built." +msgstr "El algoritmo calcula el *dominador inmediato* de cada vértice llamado **idom**, una vez que se calcula la **idom** de cada vértice y, a continuación, haciendo que cada **idom** de cada vértice como su elemento primario, se pueda construir el árbol del dominador." msgid "The algorithm works in directed graph only." msgstr "El algoritmo solo funciona en el grafo dirigido." @@ -15691,11 +11583,8 @@ msgstr "El algoritmo solo funciona en el grafo dirigido." msgid "The algorithm returns *idom* of each vertex." msgstr "El algoritmo devuelve *idom* de cada vértice." -msgid "" -"If the *root vertex* not present in the graph then it returns empty set." -msgstr "" -"Si el *vértice raíz* no está presente en el grafo, devuelve un conjunto " -"vacío." +msgid "If the *root vertex* not present in the graph then it returns empty set." +msgstr "Si el *vértice raíz* no está presente en el grafo, devuelve un conjunto vacío." msgid "Running time: :math:`O((V+E)log(V+E))`" msgstr "Tiempo de ejecución: :math:`O((V+E)log(V+E))`" @@ -15733,64 +11622,38 @@ msgstr "Dominador inmediato del vértice." msgid "Dominator tree of another component." msgstr "Árbnol dominante de otro componente." -msgid "" -"`Boost: Lengauer-Tarjan dominator `__" -msgstr "" -"`Boost: Árbol dominante Lengauer-Tarjan `__" +msgid "`Boost: Lengauer-Tarjan dominator `__" +msgstr "`Boost: Árbol dominante Lengauer-Tarjan `__" -msgid "" -"`Wikipedia: dominator tree `__" -msgstr "" -"'Wikipedia: árbol de dominador' `__" +msgid "`Wikipedia: dominator tree `__" +msgstr "'Wikipedia: árbol de dominador' `__" msgid "``pgr_lineGraph`` - Proposed" msgstr "``pgr_lineGraph`` - Propuesto" -msgid "" -"``pgr_lineGraph`` — Transforms the given graph into its corresponding edge-" -"based graph." -msgstr "" -"``pgr_lineGraph`` — Transforma un grafo dado en su grafo correspondiente " -"basado en aristas." +msgid "``pgr_lineGraph`` — Transforms the given graph into its corresponding edge-based graph." +msgstr "``pgr_lineGraph`` — Transforma un grafo dado en su grafo correspondiente basado en aristas." msgid "Works for directed and undirected graphs." msgstr "Funciona para grafos dirigidos y no dirigidos." -msgid "" -"Given a graph :math:`G`, its line graph :math:`L(G)` is a graph such that:" -msgstr "" -"Dado un grafo :math:`G`, su grafo lineal :math:`L(G)` es un grafo tal que:" +msgid "Given a graph :math:`G`, its line graph :math:`L(G)` is a graph such that:" +msgstr "Dado un grafo :math:`G`, su grafo lineal :math:`L(G)` es un grafo tal que:" msgid "Each vertex of :math:`L(G)` represents an edge of :math:`G`." msgstr "Cada vértice de :math:`L(G)` representa una arista de :math:`G`." -msgid "" -"Two vertices of :math:`L(G)` are adjacent if and only if their corresponding " -"edges share a common endpoint in :math:`G`" -msgstr "" -"Dos vértices de :math:`L(G)` son adyacentes si y sólo si sus aristas " -"correspondientes comparten un punto final común en :math:`G`" +msgid "Two vertices of :math:`L(G)` are adjacent if and only if their corresponding edges share a common endpoint in :math:`G`" +msgstr "Dos vértices de :math:`L(G)` son adyacentes si y sólo si sus aristas correspondientes comparten un punto final común en :math:`G`" -msgid "" -"The ``cost`` and ``reverse_cost`` columns of the result represent existence " -"of the edge." -msgstr "" -"Las columnas ``cost`` y ``reverse_cost`` del resultado representan la " -"existencia de la arista." +msgid "The ``cost`` and ``reverse_cost`` columns of the result represent existence of the edge." +msgstr "Las columnas ``cost`` y ``reverse_cost`` del resultado representan la existencia de la arista." msgid "When the graph is directed the result is directed." msgstr "Cuando el grafo es dirigido el resultado es dirigido." -msgid "" -"To get the complete Line Graph use unique identifiers on the double way " -"edges (See `Additional Examples`_)." -msgstr "" -"Para obtener el Grafo lineal completo utilizar identificadores únicos en las " -"aristas de doble sentido (Ver `Ejemplos Adicionales`_)." +msgid "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." @@ -15811,51 +11674,33 @@ msgid "Gives a local identifier for the edge" msgstr "Da un identificador local de la arista" msgid "When `negative`: the source is the reverse edge in the original graph." -msgstr "" -"Cuando es 'negativo': el origen es la arista inversa en el grafo original." +msgstr "Cuando es 'negativo': el origen es la arista inversa en el grafo original." msgid "When `negative`: the target is the reverse edge in the original graph." -msgstr "" -"Cuando es `negativo`: el destino es la arista inversa en el grafo original." +msgstr "Cuando es `negativo`: el destino es la arista inversa en el grafo original." msgid "Weight of the edge (``source``, ``target``)." msgstr "Peso de la arista (``source``, ``target``)." -msgid "" -"When `negative`: edge (``source``, ``target``) does not exist, therefore " -"it’s not part of the graph." -msgstr "" -"Cuando `negative`: la arista (``source``, ``target``) no existe, por lo " -"tanto no es parte del grafo." +msgid "When `negative`: edge (``source``, ``target``) does not exist, therefore it’s not part of the graph." +msgstr "Cuando `negative`: la arista (``source``, ``target``) no existe, por lo tanto no es parte del grafo." msgid "Weight of the edge (``target``, ``source``)." msgstr "Peso de la arista (``target``, ``source``)." -msgid "" -"When `negative`: edge (``target``, ``source``) does not exist, therefore " -"it’s not part of the graph." -msgstr "" -"Cuando `negative`: la arista (``target``, ``source``) no existe, por lo " -"tanto no es parte del grafo." +msgid "When `negative`: edge (``target``, ``source``) does not exist, therefore it’s not part of the graph." +msgstr "Cuando `negative`: la arista (``target``, ``source``) no existe, por lo tanto no es parte del grafo." msgid "Given the following directed graph" msgstr "Dado el siguente grafo dirigido" -msgid "" -":math:`G(V,E) = G(\\{1,2,3,4\\},\\{ 1 \\rightarrow 2, 1 \\rightarrow 4, 2 " -"\\rightarrow 3, 3 \\rightarrow 1, 3 \\rightarrow 2, 3 \\rightarrow 4, 4 " -"\\rightarrow 3\\})`" -msgstr "" -":math:`G(V,E) = G(\\{1,2,3,4\\},\\{ 1 \\rightarrow 2, 1 \\rightarrow 4, 2 " -"\\rightarrow 3, 3 \\rightarrow 1, 3 \\rightarrow 2, 3 \\rightarrow 4, 4 " -"\\rightarrow 3})`" +msgid ":math:`G(V,E) = G(\\{1,2,3,4\\},\\{ 1 \\rightarrow 2, 1 \\rightarrow 4, 2 \\rightarrow 3, 3 \\rightarrow 1, 3 \\rightarrow 2, 3 \\rightarrow 4, 4 \\rightarrow 3\\})`" +msgstr ":math:`G(V,E) = G(\\{1,2,3,4\\},\\{ 1 \\rightarrow 2, 1 \\rightarrow 4, 2 \\rightarrow 3, 3 \\rightarrow 1, 3 \\rightarrow 2, 3 \\rightarrow 4, 4 \\rightarrow 3})`" msgid "Representation as directed with shared edge identifiers" msgstr "Representación como dirigida con identificadores de arista compartidos" -msgid "" -"For the simplicity, the design of the edges table on the database, has the " -"edge's identifiers are represented with 3 digits:" +msgid "For the simplicity, the design of the edges table on the database, has the edge's identifiers are represented with 3 digits:" msgstr "" msgid "hundreds" @@ -15879,36 +11724,20 @@ msgstr "el vértice de destino" msgid "In this image," msgstr "En esta imagen," -msgid "" -"Single or double head arrows represent one edge (row) on the edges table." -msgstr "" -"Las puntas de flechas simples o dobles representan una arista (fila) en la " -"tabla de aristas." +msgid "Single or double head arrows represent one edge (row) on the edges table." +msgstr "Las puntas de flechas simples o dobles representan una arista (fila) en la tabla de aristas." msgid "The numbers in the yellow shadow are the edge identifiers." -msgstr "" -"Los números en la sombra amarilla son los identificadores de las aristas." +msgstr "Los números en la sombra amarilla son los identificadores de las aristas." -msgid "" -"Two pair of edges share the same identifier when the ``reverse_cost`` column " -"is used." -msgstr "" -"Dos pares de aristas comparten el mismo identificador cuando se utiliza la " -"columna ``reverse_cost``." +msgid "Two pair of edges share the same identifier when the ``reverse_cost`` column is used." +msgstr "Dos pares de aristas comparten el mismo identificador cuando se utiliza la columna ``reverse_cost``." -msgid "" -"Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with one " -"edge row with :math:`id=203`." -msgstr "" -"Las aristas :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` se representan con " -"una fila de aristas con :math:`id=203`." +msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with one edge row with :math:`id=203`." +msgstr "Las aristas :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` se representan con una fila de aristas con :math:`id=203`." -msgid "" -"Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with one " -"edge row with :math:`id=304`." -msgstr "" -"Las aristas :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` se representan con " -"una fila de aristas con :math:`id=304`." +msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with one edge row with :math:`id=304`." +msgstr "Las aristas :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` se representan con una fila de aristas con :math:`id=304`." msgid "The graph can be created as follows:" msgstr "El grafo puede crearse del siguiente modo:" @@ -15919,20 +11748,14 @@ msgstr "Grafo lineal de un grafo dirigido representado con aristas compartidas" msgid "The result is a directed graph." msgstr "El resultado es un grafo dirigido." -msgid "" -"For :math:`seq=4` from :math:`203 \\leftrightarrow 304` represent two edges" -msgstr "" -"Para :math:`seq=4` desde :math:`203 \\leftrightarrow 304` representa dos " -"arsitas" +msgid "For :math:`seq=4` from :math:`203 \\leftrightarrow 304` represent two edges" +msgstr "Para :math:`seq=4` desde :math:`203 \\leftrightarrow 304` representa dos arsitas" msgid "For all the other values of ``seq`` represent one edge." msgstr "Todos los demás valores de ``seq`` representan una arista." -msgid "" -"The ``cost`` and ``reverse_cost`` values represent the existence of the edge." -msgstr "" -"Los valores ``cost`` y ``reverse_cost`` representan la existencia de la " -"arista." +msgid "The ``cost`` and ``reverse_cost`` values represent the existence of the edge." +msgstr "Los valores ``cost`` y ``reverse_cost`` representan la existencia de la arista." msgid "When positive: the edge exists." msgstr "Cuando es positivo: la arista existe." @@ -15944,118 +11767,67 @@ msgid "Representation as directed with unique edge identifiers" msgstr "Representación dirigida con identificadores de arista únicos" msgid "Single head arrows represent one edge (row) on the edges table." -msgstr "" -"Las flechas de una cabeza representan una arista (fila) en la tabla de " -"aristas." +msgstr "Las flechas de una cabeza representan una arista (fila) en la tabla de aristas." msgid "There are no double head arrows" msgstr "No hay flechas de doble punta" -msgid "" -"Two pair of edges share the same ending nodes and the ``reverse_cost`` " -"column is not used." -msgstr "" -"Dos pares de aristas comparten los mismos nodos finales y no se utiliza la " -"columna ``reverse_cost``." +msgid "Two pair of edges share the same ending nodes and the ``reverse_cost`` column is not used." +msgstr "Dos pares de aristas comparten los mismos nodos finales y no se utiliza la columna ``reverse_cost``." -msgid "" -"Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with two " -"edges :math:`id=203` and :math:`id=302` respectively." -msgstr "" -"Las aristas :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` se representan con " -"dos aristas :math:`id=203` y :math:`id=302` respectivamente." +msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with two edges :math:`id=203` and :math:`id=302` respectively." +msgstr "Las aristas :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` se representan con dos aristas :math:`id=203` y :math:`id=302` respectivamente." -msgid "" -"Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with two " -"edges :math:`id=304` and :math:`id=403` respectively." +msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with two edges :math:`id=304` and :math:`id=403` respectively." msgstr "" msgid "Line Graph of a directed graph represented with unique edges" msgstr "Gráfico lineal de un grafo dirigido representado con aristas únicas" -msgid "" -"For :math:`seq=7` from :math:`203 \\leftrightarrow 302` represent two edges." -msgstr "" -"Para :math:`seq=7` desde :math:`203 \\leftrightarrow 302` representan dos " -"aristas." +msgid "For :math:`seq=7` from :math:`203 \\leftrightarrow 302` represent two edges." +msgstr "Para :math:`seq=7` desde :math:`203 \\leftrightarrow 302` representan dos aristas." -msgid "" -"For :math:`seq=8` from :math:`304 \\leftrightarrow 403` represent two edges." -msgstr "" -"Para :math:`seq=8` desde :math:`304 \\leftrightarrow 403` representan dos " -"aristas." +msgid "For :math:`seq=8` from :math:`304 \\leftrightarrow 403` represent two edges." +msgstr "Para :math:`seq=8` desde :math:`304 \\leftrightarrow 403` representan dos aristas." msgid "wikipedia: `Line Graph `__" msgstr "wikipedia: `Grafo lineal `__" -msgid "" -"mathworld: `Line Graph `__" +msgid "mathworld: `Line Graph `__" msgstr "" msgid "``pgr_lineGraphFull`` - Experimental" msgstr "``pgr_lineGraphFull`` - Experimental" -msgid "" -"``pgr_lineGraphFull`` — Transforms a given graph into a new graph where all " -"of the vertices from the original graph are converted to line graphs." -msgstr "" -"``pgr_lineGraphFull`` — Transforma un grafo dado en uno nuevo donde todos " -"los vértices del grafo original se convierten en grafos de líneas." +msgid "``pgr_lineGraphFull`` — Transforms a given graph into a new graph where all of the vertices from the original graph are converted to line graphs." +msgstr "``pgr_lineGraphFull`` — Transforma un grafo dado en uno nuevo donde todos los vértices del grafo original se convierten en grafos de líneas." msgid "Version 2.6.0" msgstr "Versión 2.6.0" -msgid "" -"``pgr_lineGraphFull``, converts original directed graph to a directed line " -"graph by converting each vertex to a complete graph and keeping all the " -"original edges. The new connecting edges have a cost 0 and go between the " -"adjacent original edges, respecting the directionality." -msgstr "" -"``pgr_lineGraphFull``, convierte un grafo dirigido a un grafo dirigido " -"lineal, convirtiendo cada vértice en un grafo completo y manteniendo todas " -"las aristas originales. Las nuevas aristas de conexión tienen un costo de 0 " -"y van entre las aristas originales adyacentes, respetando la direccionalidad." +msgid "``pgr_lineGraphFull``, converts original directed graph to a directed line graph by converting each vertex to a complete graph and keeping all the original edges. The new connecting edges have a cost 0 and go between the adjacent original edges, respecting the directionality." +msgstr "``pgr_lineGraphFull``, convierte un grafo dirigido a un grafo dirigido lineal, convirtiendo cada vértice en un grafo completo y manteniendo todas las aristas originales. Las nuevas aristas de conexión tienen un costo de 0 y van entre las aristas originales adyacentes, respetando la direccionalidad." -msgid "" -"A possible application of the resulting graph is **\"routing with two edge " -"restrictions\"**:" -msgstr "" -"Una posible aplicación del grafo resultante es **\"ruteo con restricciones " -"en dos aristas\"**:" +msgid "A possible application of the resulting graph is **\"routing with two edge restrictions\"**:" +msgstr "Una posible aplicación del grafo resultante es **\"ruteo con restricciones en dos aristas\"**:" -msgid "" -"Setting a cost of using the vertex when routing between edges on the " -"connecting edge" -msgstr "" -"Establecer un coste de uso del vértice al enrutar entre aristas en la arista " -"de conexión" +msgid "Setting a cost of using the vertex when routing between edges on the connecting edge" +msgstr "Establecer un coste de uso del vértice al enrutar entre aristas en la arista de conexión" msgid "Forbid the routing between two edges by removing the connecting edge" msgstr "Prohibir el ruteo entre dos aristas al quitar el arista de conexión" -msgid "" -"This is possible because each of the intersections (vertices) in the " -"original graph are now complete graphs that have a new edge for each " -"possible turn across that intersection." -msgstr "" -"Esto es posible porque cada una de las intersecciones (vértices) en el grafo " -"original ahora son grafos completos que tienen una nueva arista para cada " -"posible giro a través de esa intersección." +msgid "This is possible because each of the intersections (vertices) in the original graph are now complete graphs that have a new edge for each possible turn across that intersection." +msgstr "Esto es posible porque cada una de las intersecciones (vértices) en el grafo original ahora son grafos completos que tienen una nueva arista para cada posible giro a través de esa intersección." msgid "This function is for **directed** graphs." msgstr "Esta función es para grafos **dirigidos**." -msgid "" -"Results are undefined when a negative vertex id is used in the input graph." -msgstr "" -"Los resultados son indefinidos cuando se utiliza un identificador de vértice " -"negativo en el grafo de entrada." +msgid "Results are undefined when a negative vertex id is used in the input graph." +msgstr "Los resultados son indefinidos cuando se utiliza un identificador de vértice negativo en el grafo de entrada." -msgid "" -"Results are undefined when a duplicated edge id is used in the input graph." -msgstr "" -"Los resultados son indefinidos cuando se utiliza un identificador de borde " -"duplicado en el grafo de entrada." +msgid "Results are undefined when a duplicated edge id is used in the input graph." +msgstr "Los resultados son indefinidos cuando se utiliza un identificador de borde duplicado en el grafo de entrada." msgid "Running time: TBD" msgstr "Tiempo de ejecución: TBD" @@ -16067,25 +11839,16 @@ msgid "Returns set of |result-linegf|" msgstr "Regresa el conjunto de |result-linegf|" msgid "Full line graph of subgraph of edges :math:`\\{4, 7, 8, 10\\}`" -msgstr "" -"Grafo de línea completa del subgrafo de las aristas :math:`\\{4, 7, 8, 10\\}`" +msgstr "Grafo de línea completa del subgrafo de las aristas :math:`\\{4, 7, 8, 10\\}`" -msgid "" -"The examples include the subgraph including edges 4, 7, 8, and 10 with " -"``reverse_cost``." -msgstr "" -"Los ejemplos incluyen el sub-grafo que incluye las aristas 4, 7, 8 y 10 con " -"``reverse_cost``." +msgid "The examples include the subgraph including edges 4, 7, 8, and 10 with ``reverse_cost``." +msgstr "Los ejemplos incluyen el sub-grafo que incluye las aristas 4, 7, 8 y 10 con ``reverse_cost``." msgid "The data" msgstr "Los datos" -msgid "" -"This example displays how this graph transformation works to create " -"additional edges for each possible turn in a graph." -msgstr "" -"En este ejemplo se muestra cómo funciona esta transformación de grafo para " -"crear aristas adicionales para cada giro posible en un grafoáfico." +msgid "This example displays how this graph transformation works to create additional edges for each possible turn in a graph." +msgstr "En este ejemplo se muestra cómo funciona esta transformación de grafo para crear aristas adicionales para cada giro posible en un grafoáfico." msgid "|first|" msgstr "|first|" @@ -16102,46 +11865,22 @@ msgstr "|second|" msgid "second" msgstr "segundo" -msgid "" -"In the transformed graph, all of the edges from the original graph are still " -"present (yellow), but we now have additional edges for every turn that could " -"be made across vertex 7 (orange)." -msgstr "" -"En el grafo transformado, todas las aristas del grafo original siguen " -"presentes (amarillos), pero ahora hay aristas adicionales para cada giro que " -"se podría hacer a través del vértice 7 (naranja)." +msgid "In the transformed graph, all of the edges from the original graph are still present (yellow), but we now have additional edges for every turn that could be made across vertex 7 (orange)." +msgstr "En el grafo transformado, todas las aristas del grafo original siguen presentes (amarillos), pero ahora hay aristas adicionales para cada giro que se podría hacer a través del vértice 7 (naranja)." msgid "Creating table that identifies transformed vertices" msgstr "Crear una tabla que identifica los vértices transformados" -msgid "" -"The vertices in the transformed graph are each created by splitting up the " -"vertices in the original graph. Unless a vertex in the original graph is a " -"leaf vertex, it will generate more than one vertex in the transformed graph. " -"One of the newly created vertices in the transformed graph will be given the " -"same vertex identifier as the vertex that it was created from in the " -"original graph, but the rest of the newly created vertices will have " -"negative vertex ids." -msgstr "" -"Los vértices del grafo transformado se crean dividiendo los vértices en el " -"grafo original. A menos que un vértice en el grafo original sea un vértice " -"hoja, generará más de un vértice en el grafo transformado. A uno de los " -"vértices recién creados en el grafo transformado se le dará el mismo " -"identificador del vértice desde el cual se creó en el grafo original, pero " -"el resto de los vértices recién creados tendrán identificadores de vértices " -"negativos." +msgid "The vertices in the transformed graph are each created by splitting up the vertices in the original graph. Unless a vertex in the original graph is a leaf vertex, it will generate more than one vertex in the transformed graph. One of the newly created vertices in the transformed graph will be given the same vertex identifier as the vertex that it was created from in the original graph, but the rest of the newly created vertices will have negative vertex ids." +msgstr "Los vértices del grafo transformado se crean dividiendo los vértices en el grafo original. A menos que un vértice en el grafo original sea un vértice hoja, generará más de un vértice en el grafo transformado. A uno de los vértices recién creados en el grafo transformado se le dará el mismo identificador del vértice desde el cual se creó en el grafo original, pero el resto de los vértices recién creados tendrán identificadores de vértices negativos." -msgid "" -"Following is an example of how to generate a table that maps the ids of the " -"newly created vertices with the original vertex that they were created from" +msgid "Following is an example of how to generate a table that maps the ids of the newly created vertices with the original vertex that they were created from" msgstr "" msgid "Store edge results" msgstr "Almacenar resultados de aristas" -msgid "" -"The first step is to store the results of the ``pgr_lineGraphFull`` call " -"into a table" +msgid "The first step is to store the results of the ``pgr_lineGraphFull`` call into a table" msgstr "" msgid "Create the mapping table" @@ -16162,9 +11901,7 @@ msgstr "" msgid "Inspecting the vertices map" msgstr "" -msgid "" -"The self loops happen when there is no cost traveling to the ``target`` and " -"the source has an original value." +msgid "The self loops happen when there is no cost traveling to the ``target`` and the source has an original value." msgstr "" msgid "Updating values from self loops" @@ -16179,23 +11916,17 @@ msgstr "" msgid "Adding a soft restriction" msgstr "" -msgid "" -"A soft restriction going from vertex 6 to vertex 3 using edges 4 -> 7 is " -"wanted." +msgid "A soft restriction going from vertex 6 to vertex 3 using edges 4 -> 7 is wanted." msgstr "" #, fuzzy msgid "Identifying the restriction" msgstr "Agregando las restricciones" -msgid "" -"Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where the " -"cost will be increased" +msgid "Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where the cost will be increased" msgstr "" -msgid "" -"The edge to be altered is ``WHERE cost = 0 AND seq != 1 AND edge != -1`` " -"from the previous query:" +msgid "The edge to be altered is ``WHERE cost = 0 AND seq != 1 AND edge != -1`` from the previous query:" msgstr "" msgid "Adding a value to the restriction" @@ -16213,8 +11944,7 @@ msgstr "" msgid "Simplifying leaf vertices" msgstr "" -msgid "" -"In this example, there is no additional cost for traversing a leaf vertex." +msgid "In this example, there is no additional cost for traversing a leaf vertex." msgstr "" msgid "Using the vertex map give the leaf verices their original value." @@ -16235,9 +11965,7 @@ msgstr "" msgid "Which can be removed" msgstr "" -msgid "" -"Routing can be done now using the original vertices id using :doc:" -"`pgr_dijkstra`" +msgid "Routing can be done now using the original vertices id using :doc:`pgr_dijkstra`" msgstr "" msgid "Complete routing graph" @@ -16246,9 +11974,7 @@ msgstr "" msgid "Add edges from the original graph" msgstr "" -msgid "" -"Add all the edges that are not involved in the line graph process to the new " -"table" +msgid "Add all the edges that are not involved in the line graph process to the new table" msgstr "" msgid "Some administrative tasks to get new identifiers for the edges" @@ -16260,9 +11986,7 @@ msgstr "" msgid "Using the routing graph" msgstr "" -msgid "" -"When using this method for routing with soft restrictions there will be " -"uturns" +msgid "When using this method for routing with soft restrictions there will be uturns" msgstr "" msgid "Routing from :math:`5` to :math:`1`" @@ -16280,32 +12004,13 @@ msgstr "``pgr_makeConnected`` - Experimental" msgid "``pgr_makeConnected`` — Set of edges that will connect the graph." msgstr "``pgr_makeConnected`` — Conjunto de aristas que conectan el grafo." -msgid "" -"Adds the minimum number of edges needed to make the input graph connected. " -"The algorithm first identifies all of the connected components in the graph, " -"then adds edges to connect those components together in a path. For example, " -"if a graph contains three connected components A, B, and C, make_connected " -"will add two edges. The two edges added might consist of one connecting a " -"vertex in A with a vertex in B and one connecting a vertex in B with a " -"vertex in C." -msgstr "" -"Agrega el número mínimo de bordes necesarios para conectar el gráfico de " -"entrada. El algoritmo primero identifica todos los componentes conectados en " -"el gráfico, luego agrega bordes para conectar esos componentes en una ruta. " -"Por ejemplo, si un gráfico contiene tres componentes conectados A, B y C, " -"make_connected agregará dos bordes. Las dos aristas agregadas podrían " -"consistir en una que conecta un vértice en A con un vértice en B y otra que " -"conecta un vértice en B con un vértice en C." +msgid "Adds the minimum number of edges needed to make the input graph connected. The algorithm first identifies all of the connected components in the graph, then adds edges to connect those components together in a path. For example, if a graph contains three connected components A, B, and C, make_connected will add two edges. The two edges added might consist of one connecting a vertex in A with a vertex in B and one connecting a vertex in B with a vertex in C." +msgstr "Agrega el número mínimo de bordes necesarios para conectar el gráfico de entrada. El algoritmo primero identifica todos los componentes conectados en el gráfico, luego agrega bordes para conectar esos componentes en una ruta. Por ejemplo, si un gráfico contiene tres componentes conectados A, B y C, make_connected agregará dos bordes. Las dos aristas agregadas podrían consistir en una que conecta un vértice en A con un vértice en B y otra que conecta un vértice en B con un vértice en C." -msgid "" -"It will give a minimum list of all edges which are needed in the graph to " -"make connect it." -msgstr "" -"Dará la lista mínima de los bordes que se necesitan en el grafo para " -"conectarlo." +msgid "It will give a minimum list of all edges which are needed in the graph to make connect it." +msgstr "Dará la lista mínima de los bordes que se necesitan en el grafo para conectarlo." -msgid "" -"The algorithm does not considers geometric topology in the calculations." +msgid "The algorithm does not considers geometric topology in the calculations." msgstr "El algoritmo no considera la topología geométrica en los cálculos." msgid "pgr_makeConnected(`Edges SQL`_)" @@ -16317,22 +12022,14 @@ msgstr "Regresa conjunto de |result-component-make|" msgid "List of edges that are needed to connect the graph." msgstr "Lista de aristas que se necesitan para conectar el grafo." -msgid "" -"`Boost: make connected `__" -msgstr "" -"`Boost: conectar `__" +msgid "`Boost: make connected `__" +msgstr "`Boost: conectar `__" msgid "``pgr_maxCardinalityMatch``" msgstr "``pgr_maxCardinalityMatch``" -msgid "" -"``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a " -"graph." -msgstr "" -"``pgr_maxCardinalityMatch`` — Calcula una coincidencia de cardinalidad " -"máxima en un grafo." +msgid "``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a graph." +msgstr "``pgr_maxCardinalityMatch`` — Calcula una coincidencia de cardinalidad máxima en un grafo." msgid "pgr_maxCardinalityMatch(text) returns only ``edge`` column." msgstr "pgr_maxCardinalityMatch(text) regresa solamente la columna ``edge``." @@ -16346,19 +12043,11 @@ msgstr "Con directed => `` false`` cuando se usa." msgid "Renamed from ``pgr_maximumCardinalityMatching``" msgstr "Renombrado de ``pgr_maximumCardinalityMatching``" -msgid "" -"A matching or independent edge set in a graph is a set of edges without " -"common vertices." -msgstr "" -"Un conjunto de aristas coincidente o independiente en un grafo es un " -"conjunto de aristas sin vértices comunes." +msgid "A matching or independent edge set in a graph is a set of edges without common vertices." +msgstr "Un conjunto de aristas coincidente o independiente en un grafo es un conjunto de aristas sin vértices comunes." -msgid "" -"A maximum matching is a matching that contains the largest possible number " -"of edges." -msgstr "" -"Una coincidencia máxima es una coincidencia que contiene el mayor número " -"posible de aristas." +msgid "A maximum matching is a matching that contains the largest possible number of edges." +msgstr "Una coincidencia máxima es una coincidencia que contiene el mayor número posible de aristas." msgid "There may be many maximum matchings." msgstr "Puede haber muchas coincidencias máximas." @@ -16378,35 +12067,20 @@ msgstr "pgr_maxCardinalityMatch(`SQL de aristas`_)" msgid "Using all edges." msgstr "" -msgid "" -"SQL query, which should return a set of rows with the following columns:" -msgstr "" -"Una consulta SQL, que debe regresar un conjunto de filas con las siguientes " -"columnas:" +msgid "SQL query, which should return a set of rows with the following columns:" +msgstr "Una consulta SQL, que debe regresar un conjunto de filas con las siguientes columnas:" -msgid "" -"A positive value represents the existence of the edge (``source``, " -"``target``)." -msgstr "" -"Un valor positivo representa la existencia de la arista (``source``, " -"``target``)." +msgid "A positive value represents the existence of the edge (``source``, ``target``)." +msgstr "Un valor positivo representa la existencia de la arista (``source``, ``target``)." -msgid "" -"A positive value represents the existence of the edge (``target``, " -"``source``)" -msgstr "" -"Un valor positivo representa la existencia de la arista (``target``, " -"``source``)" +msgid "A positive value represents the existence of the edge (``target``, ``source``)" +msgstr "Un valor positivo representa la existencia de la arista (``target``, ``source``)" msgid "Identifier of the edge in the original query." msgstr "Identificador de la arista en la consulta original." -msgid "" -"`Boost: maximum_matching `__" -msgstr "" -"`Boost: Coincidencia máxima `__" +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" @@ -16417,12 +12091,8 @@ msgstr "https://en.wikipedia.org/wiki/Ackermann_function" msgid "``pgr_maxFlow``" msgstr "``pgr_maxFlow``" -msgid "" -"``pgr_maxFlow`` — Calculates the maximum flow in a directed graph from the " -"source(s) to the targets(s) using the Push Relabel algorithm." -msgstr "" -"``pgr_maxFlow`` — Calcula el flujo máximo en un gráfico dirigido desde los " -"orígene(s) a los destino(s) mediante el algoritmo Push Relabel." +msgid "``pgr_maxFlow`` — Calculates the maximum flow in a directed graph from the source(s) to the targets(s) using the Push Relabel algorithm." +msgstr "``pgr_maxFlow`` — Calcula el flujo máximo en un gráfico dirigido desde los orígene(s) a los destino(s) mediante el algoritmo Push Relabel." msgid "pgr_maxFlow(Combinations)" msgstr "pgr_maxFlow(Combinaciones)" @@ -16430,10 +12100,8 @@ msgstr "pgr_maxFlow(Combinaciones)" msgid "Calculates the maximum flow from the sources to the targets." msgstr "Calcula el flujo máximo de las fuentes a los objetivos." -msgid "" -"When the maximum flow is **0** then there is no flow and **0** is returned." -msgstr "" -"Cuando el flujo máximo es **0**, entonces no hay flujo y se devuelve **0**." +msgid "When the maximum flow is **0** then there is no flow and **0** is returned." +msgstr "Cuando el flujo máximo es **0**, entonces no hay flujo y se devuelve **0**." msgid "Uses the :doc:`pgr_pushRelabel ` algorithm." msgstr "Use el algoritmo :doc:`pgr_pushRelabel ` ." @@ -16462,27 +12130,17 @@ msgstr "" msgid "Maximum flow possible from the source(s) to the target(s)" msgstr "Flujo máximo posible desde el/los orígen(es) hacia el/los destino(s)" -msgid "" -"`Boost: push relabel max flow `__" -msgstr "" -"`Boost: Flujo máximo empujar reetiquetar `__" +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" -msgstr "" -"https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" +msgid "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" +msgstr "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" msgid "``pgr_maxFlowMinCost`` - Experimental" msgstr "``pgr_maxFlowMinCost`` - Experimental" -msgid "" -"``pgr_maxFlowMinCost`` — Calculates the edges that minimizes the total cost " -"of the maximum flow on a graph" -msgstr "" -"``pgr_maxFlowMinCost`` — Calcula las aristas que minimiza el costo del flujo " -"maximo en un grafo" +msgid "``pgr_maxFlowMinCost`` — Calculates the edges that minimizes the total cost of the maximum flow on a graph" +msgstr "``pgr_maxFlowMinCost`` — Calcula las aristas que minimiza el costo del flujo maximo en un grafo" msgid "pgr_maxFlowMinCost(Combinations)" msgstr "pgr_maxFlowMinCost(Combinaciones)" @@ -16494,13 +12152,10 @@ msgid "**TODO** check which statement is true:" msgstr "**Por hacer** comprobar qué declaración es verdadera:" msgid "The cost value of all input edges must be nonnegative." -msgstr "" -"El valor de coste de todas las aristas de entrada debe ser no negativo." +msgstr "El valor de coste de todas las aristas de entrada debe ser no negativo." msgid "Process is done when the cost value of all input edges is nonnegative." -msgstr "" -"El proceso se realiza cuando el valor de coste de todas las aristas de " -"entrada no es negativo." +msgstr "El proceso se realiza cuando el valor de coste de todas las aristas de entrada no es negativo." msgid "Process is done on edges with nonnegative cost." msgstr "El proceso se realiza en aristas con coste no negativo." @@ -16511,13 +12166,8 @@ msgstr "Tiempo de ejecución: :math:`O(U * (E + V * log V))`" msgid "where :math:`U` is the value of the max flow." msgstr "donde :math:`U` es el valor de flujo máximo." -msgid "" -":math:`U` is upper bound on number of iterations. In many real world cases " -"number of iterations is much smaller than :math:`U`." -msgstr "" -":math:`U` es el límite superior de la cantidad de iteraciones. En muchos " -"casos de la vida reales, la cantidad de iteraciones es mucho menor que :math:" -"`U`." +msgid ":math:`U` is upper bound on number of iterations. In many real world cases number of iterations is much smaller than :math:`U`." +msgstr ":math:`U` es el límite superior de la cantidad de iteraciones. En muchos casos de la vida reales, la cantidad de iteraciones es mucho menor que :math:`U`." msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vid**)" msgstr "pgr_maxFlowMinCost(`SQL de aristas`_, **salida** , **destino**)" @@ -16540,23 +12190,17 @@ msgstr "Regresa el conjunto de |result-flow-mincost|" msgid "``pgr_maxFlowMinCost_Cost`` - Experimental" msgstr "``pgr_maxFlowMinCost_Cost`` - Experimental" -msgid "" -"``pgr_maxFlowMinCost_Cost`` — Calculates the minimum total cost of the " -"maximum flow on a graph" -msgstr "" -"``pgr_maxFlowMinCost_Cost`` — Calcula el costo mínimo para el máximo flujo " -"en un grafo" +msgid "``pgr_maxFlowMinCost_Cost`` — Calculates the minimum total cost of the maximum flow on a graph" +msgstr "``pgr_maxFlowMinCost_Cost`` — Calcula el costo mínimo para el máximo flujo en un grafo" msgid "pgr_maxFlowMinCost_Cost(Combinations)" msgstr "pgr_maxFlowMinCost_Cost(Combinaciones)" msgid "**The cost value of all input edges must be nonnegative.**" -msgstr "" -"**El valor de coste de todas las aristas de entrada debe ser no negativo.**" +msgstr "**El valor de coste de todas las aristas de entrada debe ser no negativo.**" msgid "When the maximum flow is 0 then there is no flow and **0** is returned." -msgstr "" -"Cuando el flujo máximo es 0 entonces no hay flujo y se devuelve un **0** ." +msgstr "Cuando el flujo máximo es 0 entonces no hay flujo y se devuelve un **0** ." msgid "Uses :doc:`pgr_maxFlowMinCost`." msgstr "Usa :doc:`pgr_maxFlowMinCost`." @@ -16580,24 +12224,16 @@ msgid "RETURNS FLOAT" msgstr "" msgid "Minimum Cost Maximum Flow possible from the source(s) to the target(s)" -msgstr "" -"Coste Mínimo Flujo Máximo posible desde el/los origen(es) hasta el/los " -"objetivo(s)" +msgstr "Coste Mínimo Flujo Máximo posible desde el/los origen(es) hasta el/los objetivo(s)" msgid "``pgr_pickDeliver`` - Experimental" msgstr "``pgr_pickDeliver`` - Experimental" msgid "``pgr_pickDeliver`` - Pickup and delivery Vehicle Routing Problem" -msgstr "" -"``pgr_pickDeliver`` - Problema de enrutamiento del vehículo de recogida y " -"entrega" +msgstr "``pgr_pickDeliver`` - Problema de enrutamiento del vehículo de recogida y entrega" -msgid "" -"Problem: Distribute and optimize the pickup-delivery pairs into a fleet of " -"vehicles." -msgstr "" -"Problema: Distribuya y optimice los pares de recogida-entrega en una flota " -"de vehículos." +msgid "Problem: Distribute and optimize the pickup-delivery pairs into a fleet of vehicles." +msgstr "Problema: Distribuya y optimice los pares de recogida-entrega en una flota de vehículos." msgid "Optimization problem is NP-hard." msgstr "El problema de optimización es NP-hard." @@ -16653,21 +12289,14 @@ msgstr "Si hay un par de recogida-entrega que viola la ventana de tiempo" msgid "The speed, max_cycles, ma_capacity have illegal values" msgstr "La velocidad, max_cycles, max_capacity tienen valores ilegales" -msgid "" -"Six different initial will be optimized - the best solution found will be " -"result" -msgstr "" -"Seoptimizarán seis iniciales diferentes - la mejor solución encontrada será " -"el resultado" +msgid "Six different initial will be optimized - the best solution found will be result" +msgstr "Seoptimizarán seis iniciales diferentes - la mejor solución encontrada será el resultado" msgid "Signature" msgstr "Firma" -msgid "" -"pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" -msgstr "" -"pgr_pickDeliver(`SQL de ordenes`_, `SQL de vehículos`_, `SQL de matriz`_, " -"[**opciones**])" +msgid "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]``" @@ -16711,11 +12340,8 @@ msgstr "" msgid "``pgr_pickDeliverEuclidean`` - Experimental" msgstr "``pgr_pickDeliverEuclidean`` - Experimental" -msgid "" -"``pgr_pickDeliverEuclidean`` - Pickup and delivery Vehicle Routing Problem" -msgstr "" -"``pgr_pickDeliverEuclidean`` - Problema de Ruteo del Vehículo de Recogida y " -"Entrega" +msgid "``pgr_pickDeliverEuclidean`` - Pickup and delivery Vehicle Routing Problem" +msgstr "``pgr_pickDeliverEuclidean`` - Problema de Ruteo del Vehículo de Recogida y Entrega" msgid "Replaces ``pgr_gsoc_vrppdtw``" msgstr "Reemplaza ``pgr_gsoc_vrppdtw``" @@ -16742,8 +12368,7 @@ msgid "has (x, y) pickup and delivery locations." msgstr "tiene (x, y) ubicaciones de recogida y entrega." msgid "has opening and closing times for the pickup and delivery locations." -msgstr "" -"tiene horarios de apertura y cierre para los lugares de recogida y entrega." +msgstr "tiene horarios de apertura y cierre para los lugares de recogida y entrega." msgid "has a pickup and deliver service times." msgstr "tiene una recogida y entrega de tiempos de servicio." @@ -16755,9 +12380,7 @@ msgid "the best solution found will be result" msgstr "la mejor solución encontrada será el resultado" msgid "pgr_pickDeliverEuclidean(`Orders SQL`_, `Vehicles SQL`_, [**options**])" -msgstr "" -"pgr_pickDeliverEuclidean(`SQL de órdenes`_, `SQL de vehículos`_, " -"[**opciones**])" +msgstr "pgr_pickDeliverEuclidean(`SQL de órdenes`_, `SQL de vehículos`_, [**opciones**])" msgid "p_x, p_y, p_open, p_close, [p_service,]" msgstr "" @@ -16771,9 +12394,7 @@ msgstr "" msgid "[ end_x, end_y, end_open, end_close, end_service ]" msgstr "" -msgid "" -"This data example **lc101** is from data published at https://www.sintef.no/" -"projectweb/top/pdptw/li-lim-benchmark/" +msgid "This data example **lc101** is from data published at https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/" msgstr "" msgid "There are 25 vehicles in the problem all with the same characteristics." @@ -16782,9 +12403,7 @@ msgstr "" msgid "The original orders" msgstr "" -msgid "" -"The data comes in different rows for the pickup and the delivery of the same " -"order." +msgid "The data comes in different rows for the pickup and the delivery of the same order." msgstr "" msgid "The original data needs to be converted to an appropriate table:" @@ -16793,10 +12412,7 @@ msgstr "" msgid "The query" msgstr "" -msgid "" -"Showing only the relevant information to compare with the best solution " -"information published on https://www.sintef.no/projectweb/top/pdptw/100-" -"customers/" +msgid "Showing only the relevant information to compare with the best solution information published on https://www.sintef.no/projectweb/top/pdptw/100-customers/" msgstr "" msgid "The best solution found for **lc101** is a travel time: 828.94" @@ -16808,18 +12424,11 @@ msgstr "" msgid "``pgr_prim``" msgstr "``pgr_prim``" -msgid "" -"``pgr_prim`` — Minimum spanning forest of a graph using Prim's algorithm." -msgstr "" -"``pgr_prim`` — Mínimo bosque de expansión de un grafo, utilizando el " -"algoritmo de Prim." +msgid "``pgr_prim`` — Minimum spanning forest of a graph using Prim's algorithm." +msgstr "``pgr_prim`` — Mínimo bosque de expansión de un grafo, utilizando el algoritmo de Prim." -msgid "" -"This algorithm finds the minimum spanning forest in a possibly disconnected " -"graph using Prim's algorithm." -msgstr "" -"Este algoritmo encuentra el bosque de expansión mínimo en un grafo " -"posiblemente desconectado usando el algoritmo de Prim." +msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Prim's algorithm." +msgstr "Este algoritmo encuentra el bosque de expansión mínimo en un grafo posiblemente desconectado usando el algoritmo de Prim." msgid "Prim's running time: :math:`O(E * log V)`" msgstr "Tiempo de ejecución de Prim: :math:`O(E*log V)`" @@ -16830,27 +12439,14 @@ msgstr "pgr_prim(`SQL de aristas`_)" msgid "Minimum spanning forest of a subgraph" msgstr "Bosque de Expansión Mínimo de un subgrafo" -msgid "" -"`Boost: Prim's algorithm documentation `__" -msgstr "" -"`Boost: algoritmo de Prim `__" +msgid "`Boost: Prim's algorithm documentation `__" +msgstr "`Boost: algoritmo de Prim `__" -msgid "" -"``pgr_primBFS`` — Prim's algorithm for Minimum Spanning Tree with Depth " -"First Search ordering." -msgstr "" -"``pgr_primBFS`` — Algoritmo de Prim para el árbol de expansión mínimo con " -"orden de primera búsqueda de profundidad." +msgid "``pgr_primBFS`` — Prim's algorithm for Minimum Spanning Tree with Depth First Search ordering." +msgstr "``pgr_primBFS`` — Algoritmo de Prim para el árbol de expansión mínimo con orden de primera búsqueda de profundidad." -msgid "" -"Visits and extracts the nodes information in Breath First Search ordering of " -"the Minimum Spanning Tree created using Prims's algorithm." -msgstr "" -"Visita y extrae la información de los nodos en el ordenamiento de la primera " -"búsqueda de amplitud del árbol de expansión mínima creado mediante el " -"algoritmo de Prim." +msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." +msgstr "Visita y extrae la información de los nodos en el ordenamiento de la primera búsqueda de amplitud del árbol de expansión mínima creado mediante el algoritmo de Prim." msgid "pgr_primBFS(`Edges SQL`_, **root vid**, [``max_depth``])" msgstr "pgr_primBFS(`SQL de aristas`_, **Raíz**, [``max_depth``])" @@ -16861,14 +12457,8 @@ msgstr "pgr_primBFS(`SQL de aristas`_, **Raíces**, [``max_depth``])" msgid "``pgr_primDD`` — Catchament nodes using Prim's algorithm." msgstr "``pgr_primDD`` — Nodos de captación mediante el algoritmo de Prim." -msgid "" -"Using Prim's algorithm, extracts the nodes that have aggregate costs less " -"than or equal to a distance from a root vertex (or vertices) within the " -"calculated minimum spanning tree." -msgstr "" -"Mediante el algoritmo de Prim, extrae los nodos que tienen costes agregados " -"inferiores o iguales a una distancia desde un vértice raíz (o vértices) " -"dentro del árbol de expansión mínimo calculado." +msgid "Using Prim's algorithm, extracts the nodes that have aggregate costs less than or equal to a distance from a root vertex (or vertices) within the calculated minimum spanning tree." +msgstr "Mediante el algoritmo de Prim, extrae los nodos que tienen costes agregados inferiores o iguales a una distancia desde un vértice raíz (o vértices) dentro del árbol de expansión mínimo calculado." msgid "pgr_primDD(`Edges SQL`_, **root vid**, **distance**)" msgstr "pgr_primDD(`SQL de aristas`_, **raíz**, **distancia**)" @@ -16876,20 +12466,11 @@ msgstr "pgr_primDD(`SQL de aristas`_, **raíz**, **distancia**)" msgid "pgr_primDD(`Edges SQL`_, **root vids**, **distance**)" msgstr "pgr_primDD(`SQL de aristas`_, **raices**, **distancia**)" -msgid "" -"``pgr_primDFS`` — Prim algorithm for Minimum Spanning Tree with Depth First " -"Search ordering." -msgstr "" -"''pgr_primDFS'' — Algoritmo Prim para el Árbol de Expansión Mínima con orden " -"de la Primera Búsqueda de Profundidad." +msgid "``pgr_primDFS`` — Prim algorithm for Minimum Spanning Tree with Depth First Search ordering." +msgstr "''pgr_primDFS'' — Algoritmo Prim para el Árbol de Expansión Mínima con orden de la Primera Búsqueda de Profundidad." -msgid "" -"Visits and extracts the nodes information in Depth First Search ordering of " -"the Minimum Spanning Tree created using Prims's algorithm." -msgstr "" -"Visita y extrae la información de los nodos en el orden de la Primera " -"Búsqueda de Profundidad del Árbol de Expansión Mínima creado utilizando el " -"algoritmo de Prim." +msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." +msgstr "Visita y extrae la información de los nodos en el orden de la Primera Búsqueda de Profundidad del Árbol de Expansión Mínima creado utilizando el algoritmo de Prim." msgid "pgr_primDFS(`Edges SQL`_, **root vid**, [``max_depth``])" msgstr "pgr_primDFS(`SQL de aristas`_, **Raíz**, [``max_depth``])" @@ -16900,12 +12481,8 @@ msgstr "pgr_primDFS(`SQL de aristas`_, **Raíces**, [``max_depth``])" msgid "``pgr_pushRelabel``" msgstr "``pgr_pushRelabel``" -msgid "" -"``pgr_pushRelabel`` — Calculates the flow on the graph edges that maximizes " -"the flow from the sources to the targets using Push Relabel Algorithm." -msgstr "" -"``pgr_pushRelabel`` — Calcula el flujo en los bordes del grafo que maximiza " -"el flujo de los orígenes a los destinos mediante el Algoritmo Push Relabel." +msgid "``pgr_pushRelabel`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Push Relabel Algorithm." +msgstr "``pgr_pushRelabel`` — Calcula el flujo en los bordes del grafo que maximiza el flujo de los orígenes a los destinos mediante el Algoritmo Push Relabel." msgid "pgr_pushRelabel(Combinations)" msgstr "pgr_pushRelabel(Combinaciones)" @@ -16932,9 +12509,7 @@ msgstr "pgr_pushRelabel(`SQL de aristas`_, `SQL de combinaciones`_)" msgid "``pgr_separateCrossing``" msgstr "``pgr_version``" -msgid "" -"``pgr_separateCrossing`` - From crossing geometries generates geometries " -"that do not cross." +msgid "``pgr_separateCrossing`` - From crossing geometries generates geometries that do not cross." msgstr "" msgid "Proposed function." @@ -16942,9 +12517,7 @@ msgstr "Función propuesta." #, fuzzy msgid "This is an auxiliary function for separating crossing edges." -msgstr "" -"Esta es una función auxiliar para extraer la información de vértices del " -"conjunto de aristas de un grafo." +msgstr "Esta es una función auxiliar para extraer la información de vértices del conjunto de aristas de un grafo." #, fuzzy msgid "pgr_separateCrossing(`Edges SQL`_, [``tolerance``, ``dryrun``])" @@ -16972,25 +12545,17 @@ msgstr "" msgid "Get the code for further refinement." msgstr "En cualquier lado del segmento." -msgid "" -"When there are special details that need to be taken care of because of the " -"final application or the quality of the data, the code can be obtained On a " -"PostgreSQL ``NOTICE`` using the ``dryrun`` flag." +msgid "When there are special details that need to be taken care of because of the final application or the quality of the data, the code can be obtained On a PostgreSQL ``NOTICE`` using the ``dryrun`` flag." msgstr "" #, fuzzy msgid "``pgr_separateTouching``" msgstr "``pgr_version``" -msgid "" -"``pgr_separateTouching`` - From touching geometries generates geometries " -"that are properly connected at endpoints" +msgid "``pgr_separateTouching`` - From touching geometries generates geometries that are properly connected at endpoints" msgstr "" -msgid "" -"This is an auxiliary function for processing geometries that touch but don't " -"share exact endpoints, splitting them at their intersection points to " -"improve network connectivity." +msgid "This is an auxiliary function for processing geometries that touch but don't share exact endpoints, splitting them at their intersection points to improve network connectivity." msgstr "" #, fuzzy @@ -17000,61 +12565,32 @@ msgstr "pgr_extractVertices(`SQL de aristas`_, [``dryrun``])" msgid "``pgr_sequentialVertexColoring`` - Proposed" msgstr "``pgr_sequentialVertexColoring`` - Propuesto" -msgid "" -"``pgr_sequentialVertexColoring`` — Returns the vertex coloring of an " -"undirected graph, using greedy approach." -msgstr "" -"``pgr_sequentialVertexColoring`` — Devuelve el color de vértice de un grafo " -"no dirigido, utilizando un enfoque codicioso." +msgid "``pgr_sequentialVertexColoring`` — Returns the vertex coloring of an undirected graph, using greedy approach." +msgstr "``pgr_sequentialVertexColoring`` — Devuelve el color de vértice de un grafo no dirigido, utilizando un enfoque codicioso." -msgid "" -"Sequential vertex coloring algorithm is a graph coloring algorithm in which " -"color identifiers are assigned to the vertices of a graph in a sequential " -"manner, such that no edge connects two identically colored vertices." -msgstr "" -"El algoritmo de Coloración de Vértices Secuenciales es un algoritmo de " -"coloración de grafos en el que se asignan identificadores de color a los " -"vértices de un grafo de forma secuencial, de modo que ninguna arista conecte " -"dos vértices de colores idénticos." +msgid "Sequential vertex coloring algorithm is a graph coloring algorithm in which color identifiers are assigned to the vertices of a graph in a sequential manner, such that no edge connects two identically colored vertices." +msgstr "El algoritmo de Coloración de Vértices Secuenciales es un algoritmo de coloración de grafos en el que se asignan identificadores de color a los vértices de un grafo de forma secuencial, de modo que ninguna arista conecte dos vértices de colores idénticos." msgid "The implementation is applicable only for **undirected** graphs." msgstr "La implementación solo es aplicable a los grafos **no dirigidos**." -msgid "" -"Provides the color to be assigned to all the vertices present in the graph." -msgstr "" -"Proporciona el color que se asignará a todos los vértices presentes en el " -"grafo." +msgid "Provides the color to be assigned to all the vertices present in the graph." +msgstr "Proporciona el color que se asignará a todos los vértices presentes en el grafo." msgid "Color identifiers values are in the Range :math:`[1, |V|]`" -msgstr "" -"Los valores de los identificadores de color se encuentran en el rango :math:" -"`[1, |V|]`" +msgstr "Los valores de los identificadores de color se encuentran en el rango :math:`[1, |V|]`" msgid "The algorithm tries to assign the least possible color to every vertex." msgstr "El algoritmo intenta asignar el menor color posible a cada vértice." -msgid "" -"Efficient graph coloring is an NP-Hard problem, and therefore, this " -"algorithm does not always produce optimal coloring. It follows a greedy " -"strategy by iterating through all the vertices sequentially, and assigning " -"the smallest possible color that is not used by its neighbors, to each " -"vertex." -msgstr "" -"El color de grafos eficientes es un problema NP-Hard, y por lo tanto, este " -"algoritmo no siempre produce un coloración óptima. Sigue una estrategia " -"expansiva recorriendo en iteración todos los vértices secuencialmente y " -"asignando el color más pequeño posible que no sea utilizado por sus vecinos, " -"a cada vértice." +msgid "Efficient graph coloring is an NP-Hard problem, and therefore, this algorithm does not always produce optimal coloring. It follows a greedy strategy by iterating through all the vertices sequentially, and assigning the smallest possible color that is not used by its neighbors, to each vertex." +msgstr "El color de grafos eficientes es un problema NP-Hard, y por lo tanto, este algoritmo no siempre produce un coloración óptima. Sigue una estrategia expansiva recorriendo en iteración todos los vértices secuencialmente y asignando el color más pequeño posible que no sea utilizado por sus vecinos, a cada vértice." msgid "The returned rows are ordered in ascending order of the vertex value." -msgstr "" -"Las filas devueltas se ordenan en orden ascendente del valor de vértice." +msgstr "Las filas devueltas se ordenan en orden ascendente del valor de vértice." msgid "Sequential Vertex Coloring Running Time: :math:`O(|V|*(d + k))`" -msgstr "" -"Tiempo de Ejecución de Coloración de Vértices Secuenciales: :math:`O(|V|*(d " -"+ k))`" +msgstr "Tiempo de Ejecución de Coloración de Vértices Secuenciales: :math:`O(|V|*(d + k))`" msgid ":math:`d` is the maximum degree of the vertices in the graph," msgstr ":math:`d` es el grado máximo de los vértices en el grafo," @@ -17065,50 +12601,33 @@ msgstr ":math:`k` es el número de colores utilizados." msgid "pgr_sequentialVertexColoring(`Edges SQL`_)" msgstr "pgr_sequentialVertexColoring(`SQL de aristas`_)" -msgid "" -"`Boost: Sequential Vertex Coloring `__" -msgstr "" -"`Boost: Coloración Secuencial de Vértices `__" +msgid "`Boost: Sequential Vertex Coloring `__" +msgstr "`Boost: Coloración Secuencial de Vértices `__" #, fuzzy msgid "``pgr_sloanOrdering`` - Experimental" msgstr "``pgr_edgeColoring`` - Experimental" #, fuzzy -msgid "" -"``pgr_sloanOrdering`` — Returns the Sloan ordering of an undirected graph" -msgstr "" -"``pgr_cuthillMckeeOrdering`` —Ordenamiento Cuthill-Mckee de grapos no " -"dirigidos" +msgid "``pgr_sloanOrdering`` — Returns the Sloan ordering of an undirected graph" +msgstr "``pgr_cuthillMckeeOrdering`` —Ordenamiento Cuthill-Mckee de grapos no dirigidos" -msgid "" -"The Sloan ordering algorithm reorders the vertices of a graph to reduce " -"bandwidth, profile, and wavefront properties, which is particularly useful " -"for sparse matrix computations and finite element analysis." +msgid "The Sloan ordering algorithm reorders the vertices of a graph to reduce bandwidth, profile, and wavefront properties, which is particularly useful for sparse matrix computations and finite element analysis." msgstr "" msgid "Finds a pseudoperipheral vertex pair to determine good starting points" msgstr "" -msgid "" -"Uses a priority-based algorithm that balances vertex degree and distance " -"from the start vertex." +msgid "Uses a priority-based algorithm that balances vertex degree and distance from the start vertex." msgstr "" -msgid "" -"Aims to minimize bandwidth (maximum difference between connected vertex " -"indices." +msgid "Aims to minimize bandwidth (maximum difference between connected vertex indices." msgstr "" -msgid "" -"Typically produces better orderings than simple breadth-first approaches." +msgid "Typically produces better orderings than simple breadth-first approaches." msgstr "" -msgid "" -"Time complexity: :math:`O(V² + E)` where V is the number of vertices and E " -"is the number of edges." +msgid "Time complexity: :math:`O(V² + E)` where V is the number of vertices and E is the number of edges." msgstr "" #, fuzzy @@ -17126,61 +12645,26 @@ msgid "Sloan ordering of Original graph from Boost example (vertices 0-9)." msgstr "" #, fuzzy -msgid "" -"`Boost: Sloan Ordering `__" -msgstr "" -"`Boost: Coloración de Segmentos `__" +msgid "`Boost: Sloan Ordering `__" +msgstr "`Boost: Coloración de Segmentos `__" msgid "``pgr_stoerWagner`` - Experimental" msgstr "``pgr_stoerWagner`` - Experimental" msgid "``pgr_stoerWagner`` — The min-cut of graph using stoerWagner algorithm." -msgstr "" -"``pgr_stoerWagner`` — El corte mínimo del grafo usando el algoritmo Stoer-" -"Wagner." +msgstr "``pgr_stoerWagner`` — El corte mínimo del grafo usando el algoritmo Stoer-Wagner." msgid "Version 3.0" msgstr "Versión 3.0" -msgid "" -"In graph theory, the Stoer–Wagner algorithm is a recursive algorithm to " -"solve the minimum cut problem in undirected weighted graphs with non-" -"negative weights. The essential idea of this algorithm is to shrink the " -"graph by merging the most intensive vertices, until the graph only contains " -"two combined vertex sets. At each phase, the algorithm finds the minimum s-t " -"cut for two vertices s and t chosen as its will. Then the algorithm shrinks " -"the edge between s and t to search for non s-t cuts. The minimum cut found " -"in all phases will be the minimum weighted cut of the graph." -msgstr "" -"En teoría de grafos, el algoritmo Stoer-Wagner es un algoritmo recursivo " -"para resolver el problema de corte mínimo en gráficos ponderados no " -"dirigidos con pesos no negativos. La idea esencial de este algoritmo es " -"encoger el grafo mediante la fusión de los vértices más intensivos, hasta " -"que el grafo sólo contiene dos conjuntos de vértices combinados. En cada " -"fase, el algoritmo encuentra el corte s-t mínimo para dos vértices s y t " -"elegidos a su voluntad. A continuación, el algoritmo encoge la arista entre " -"s y t para buscar cortes no s-t. El corte mínimo encontrado en todas las " -"fases será el corte ponderado mínimo del grafo." +msgid "In graph theory, the Stoer–Wagner algorithm is a recursive algorithm to solve the minimum cut problem in undirected weighted graphs with non-negative weights. The essential idea of this algorithm is to shrink the graph by merging the most intensive vertices, until the graph only contains two combined vertex sets. At each phase, the algorithm finds the minimum s-t cut for two vertices s and t chosen as its will. Then the algorithm shrinks the edge between s and t to search for non s-t cuts. The minimum cut found in all phases will be the minimum weighted cut of the graph." +msgstr "En teoría de grafos, el algoritmo Stoer-Wagner es un algoritmo recursivo para resolver el problema de corte mínimo en gráficos ponderados no dirigidos con pesos no negativos. La idea esencial de este algoritmo es encoger el grafo mediante la fusión de los vértices más intensivos, hasta que el grafo sólo contiene dos conjuntos de vértices combinados. En cada fase, el algoritmo encuentra el corte s-t mínimo para dos vértices s y t elegidos a su voluntad. A continuación, el algoritmo encoge la arista entre s y t para buscar cortes no s-t. El corte mínimo encontrado en todas las fases será el corte ponderado mínimo del grafo." -msgid "" -"A cut is a partition of the vertices of a graph into two disjoint subsets. A " -"minimum cut is a cut for which the size or weight of the cut is not larger " -"than the size of any other cut. For an unweighted graph, the minimum cut " -"would simply be the cut with the least edges. For a weighted graph, the sum " -"of all edges' weight on the cut determines whether it is a minimum cut." -msgstr "" -"Un corte es una partición de los vértices de un grafo en dos subconjuntos " -"separados. Un corte mínimo es un corte para el que el tamaño o peso del " -"corte no es mayor que el tamaño de cualquier otro corte. Para un grafo no " -"ponderado, el corte mínimo sería simplemente el corte con menos aristas. " -"Para un grafo ponderado, la suma del peso de todas las aristas en el corte " -"determina si se trata de un corte mínimo." +msgid "A cut is a partition of the vertices of a graph into two disjoint subsets. A minimum cut is a cut for which the size or weight of the cut is not larger than the size of any other cut. For an unweighted graph, the minimum cut would simply be the cut with the least edges. For a weighted graph, the sum of all edges' weight on the cut determines whether it is a minimum cut." +msgstr "Un corte es una partición de los vértices de un grafo en dos subconjuntos separados. Un corte mínimo es un corte para el que el tamaño o peso del corte no es mayor que el tamaño de cualquier otro corte. Para un grafo no ponderado, el corte mínimo sería simplemente el corte con menos aristas. Para un grafo ponderado, la suma del peso de todas las aristas en el corte determina si se trata de un corte mínimo." msgid "Sum of the weights of all edges between the two sets is mincut." -msgstr "" -"La suma de los pesos de todas las aristas entre los dos conjuntos es mincut." +msgstr "La suma de los pesos de todas las aristas entre los dos conjuntos es mincut." msgid "A **mincut** is a cut having the least weight." msgstr "Un **mincut** es un corte que tiene el menor peso." @@ -17192,17 +12676,10 @@ msgid "When there is no edge in graph then EMPTY SET is return." msgstr "Cuando no hay arista en el grafo se devuelve EMPTY SET." msgid "When the graph is unconnected then EMPTY SET is return." -msgstr "" -"Cuando el gráfico está desconectado, se devuelve un conjunto vacío o EMPTY " -"SET." +msgstr "Cuando el gráfico está desconectado, se devuelve un conjunto vacío o EMPTY SET." -msgid "" -"Sometimes a graph has multiple min-cuts, but all have the same weight. The " -"this function determines exactly one of the min-cuts as well as its weight." -msgstr "" -"A veces un grafo tiene varios cortes mínimos, pero todos tienen el mismo " -"peso. Esta función determina exactamente uno de los cortes mínimos, así como " -"su peso." +msgid "Sometimes a graph has multiple min-cuts, but all have the same weight. The this function determines exactly one of the min-cuts as well as its weight." +msgstr "A veces un grafo tiene varios cortes mínimos, pero todos tienen el mismo peso. Esta función determina exactamente uno de los cortes mínimos, así como su peso." msgid "Running time: :math:`O(V*E + V^2*log V)`." msgstr "Tiempo de ejecución: :math:`O(V*E + V^2*log V)`." @@ -17240,12 +12717,8 @@ 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 "`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" @@ -17253,19 +12726,11 @@ msgstr "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" msgid "``pgr_strongComponents``" msgstr "``pgr_strongComponents``" -msgid "" -"``pgr_strongComponents`` — Strongly connected components of a directed graph " -"using Tarjan's algorithm based on DFS." -msgstr "" -"``pgr_strongComponents`` — Componentes fuertemente conectados de un grafo " -"dirigido utilizando el algoritmo de Tarjan basado en DFS." +msgid "``pgr_strongComponents`` — Strongly connected components of a directed graph using Tarjan's algorithm based on DFS." +msgstr "``pgr_strongComponents`` — Componentes fuertemente conectados de un grafo dirigido utilizando el algoritmo de Tarjan basado en DFS." -msgid "" -"A strongly connected component of a directed graph is a set of vertices that " -"are all reachable from each other." -msgstr "" -"Un componente fuertemente conectado de un gráfico dirigido es un conjunto de " -"vértices que son todos accesibles entre sí." +msgid "A strongly connected component of a directed graph is a set of vertices that are all reachable from each other." +msgstr "Un componente fuertemente conectado de un gráfico dirigido es un conjunto de vértices que son todos accesibles entre sí." msgid "Works for **directed** graphs." msgstr "Funciona paragrafos **dirigidos**." @@ -17279,48 +12744,25 @@ msgstr "pgr_strongComponents(`SQL de aristas`_)" msgid "The strong components of the graph" msgstr "Los componentes fuertes del grafo" -msgid "" -"`Boost: Strong components `__" -msgstr "" -"`Boost: Componentes fuertemente conectados `__" +msgid "`Boost: Strong components `__" +msgstr "`Boost: Componentes fuertemente conectados `__" -msgid "" -"wikipedia: `Strongly connected component `__" -msgstr "" -"Wikipedia: `Componentes fuertemente conectados `__" +msgid "wikipedia: `Strongly connected component `__" +msgstr "Wikipedia: `Componentes fuertemente conectados `__" msgid "``pgr_topologicalSort`` - Experimental" msgstr "``pgr_topologicalSort`` - Experimental" -msgid "" -"``pgr_topologicalSort`` — Linear ordering of the vertices for directed " -"acyclic graphs (DAG)." -msgstr "" -"``pgr_topologicalSort`` — Devuelve el orden lineal de los vértices para los " -"grafos acíclicos dirigidos ponderados (DAG)." +msgid "``pgr_topologicalSort`` — Linear ordering of the vertices for directed acyclic graphs (DAG)." +msgstr "``pgr_topologicalSort`` — Devuelve el orden lineal de los vértices para los grafos acíclicos dirigidos ponderados (DAG)." -msgid "" -"The topological sort algorithm creates a linear ordering of the vertices " -"such that if edge :math:`(u,v)` appears in the graph, then :math:`v` comes " -"before :math:`u` in the ordering." -msgstr "" -"El algoritmo de ordenación topológica crea un orden lineal de los vértices " -"de tal manera que si la arista :math:`(u,v)` aparece en el grafo, entonces :" -"math:`v` viene antes de :math:`u` en el orden." +msgid "The topological sort algorithm creates a linear ordering of the vertices such that if edge :math:`(u,v)` appears in the graph, then :math:`v` comes before :math:`u` in the ordering." +msgstr "El algoritmo de ordenación topológica crea un orden lineal de los vértices de tal manera que si la arista :math:`(u,v)` aparece en el grafo, entonces :math:`v` viene antes de :math:`u` en el orden." -msgid "" -"Process is valid for directed acyclic graphs only. otherwise it will throw " -"warnings." -msgstr "" -"El proceso solo es válido para grafos acíclicos dirigidos. de lo contrario " -"lanzará advertencias." +msgid "Process is valid for directed acyclic graphs only. otherwise it will throw warnings." +msgstr "El proceso solo es válido para grafos acíclicos dirigidos. de lo contrario lanzará advertencias." -msgid "" -"For optimization purposes, if there are more than one answer, the function" +msgid "For optimization purposes, if there are more than one answer, the function" msgstr "Para fines de optimización, si hay más de una respuesta, la función" msgid "will return one of them." @@ -17350,22 +12792,16 @@ msgstr "" msgid "Graph is not a DAG" msgstr "" -msgid "" -"`Boost: topological sort `__" -msgstr "" -"`Boost: Ordenamiento topológico `__" +msgid "`Boost: topological sort `__" +msgstr "`Boost: Ordenamiento topológico `__" msgid "``pgr_transitiveClosure`` - Experimental" msgstr "``pgr_transitiveClosure`` - Experimental" -msgid "" -"``pgr_transitiveClosure`` — Transitive closure graph of a directed graph." +msgid "``pgr_transitiveClosure`` — Transitive closure graph of a directed graph." msgstr "" -msgid "" -"Transforms the input directed graph into the transitive closure of the graph." +msgid "Transforms the input directed graph into the transitive closure of the graph." msgstr "Transforma el grafo de entrada en grafo de cierre transitivo." msgid "Process is valid for directed graphs." @@ -17374,9 +12810,7 @@ msgstr "" msgid "The transitive closure of an undirected graph produces a cluster graph" msgstr "" -msgid "" -"Reachability between vertices on an undirected graph happens when they " -"belong to the same connected component. (see :doc:`pgr_connectedComponents`)" +msgid "Reachability between vertices on an undirected graph happens when they belong to the same connected component. (see :doc:`pgr_connectedComponents`)" msgstr "" msgid "The returned values are not ordered" @@ -17411,15 +12845,10 @@ msgid "Identifiers of the targets of the edges" msgstr "Identificador del nodo final de las aristas" msgid "Identifiers of the vertices that are reachable from vertex v." -msgstr "" -"Identificadores de los vértices que son alcanzables desde el vértice v." +msgstr "Identificadores de los vértices que son alcanzables desde el vértice v." -msgid "" -"`Boost: transitive closure `__" -msgstr "" -"`Boost: Cierre transitivo `__" +msgid "`Boost: transitive closure `__" +msgstr "`Boost: Cierre transitivo `__" msgid "https://en.wikipedia.org/wiki/Transitive_closure" msgstr "https://en.wikipedia.org/wiki/Transitive_closure" @@ -17460,14 +12889,10 @@ msgstr "pgr_trspViaVertices" msgid "pgr_trspViaEdges" msgstr "pgr_trspViaEdges" -msgid "" -"Turn restricted shortest path (TRSP) is an algorithm that receives turn " -"restrictions in form of a query like those found in real world navigable " -"road networks." +msgid "Turn restricted shortest path (TRSP) is an algorithm that receives turn restrictions in form of a query like those found in real world navigable road networks." msgstr "" -msgid "" -"It does no guarantee the shortest path as it might contain restriction paths." +msgid "It does no guarantee the shortest path as it might contain restriction paths." msgstr "" msgid "The general algorithm is as follows:" @@ -17482,76 +12907,46 @@ msgstr "" msgid "Execute the **TRSP** algorithm with restrictions." msgstr "" -msgid "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, " -"[``directed``])" -msgstr "" -"pgr_trsp(`SQL de aristas`_, `SQL de restricciones`_, **salida**, " -"**destino**, [``directed``])" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_trsp(`SQL de aristas`_, `SQL de restricciones`_, **salida**, **destino**, [``directed``])" -msgid "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vids**, " -"[``directed``])" -msgstr "" -"pgr_trsp(`SQL de aristas`_, `SQL de restricciones`_, **salida**, " -"**destinos**, [``directed``])" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_trsp(`SQL de aristas`_, `SQL de restricciones`_, **salida**, **destinos**, [``directed``])" -msgid "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vid**, " -"[``directed``])" -msgstr "" -"pgr_trsp(`SQL de aristas`_, `SQL de restricciones`_, **salidas**, " -"**destino**, [``directed``])" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_trsp(`SQL de aristas`_, `SQL de restricciones`_, **salidas**, **destino**, [``directed``])" -msgid "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, " -"[``directed``])" -msgstr "" -"pgr_trsp(`SQL de aristas`_, `SQL de restricciones`_, **salidas**, " -"**destinos**, [``directed``])" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_trsp(`SQL de aristas`_, `SQL de restricciones`_, **salidas**, **destinos**, [``directed``])" -msgid "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, " -"[``directed``])" -msgstr "" -"pgr_trsp(`SQL de aristas`_, `SQL de restricciones`_, `SQL de " -"combinaciones`_, [``directed``])" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_trsp(`SQL de aristas`_, `SQL de restricciones`_, `SQL de combinaciones`_, [``directed``])" msgid "From vertex :math:`6` to vertex :math:`10` on an undirected graph." msgstr "Del vértice :math:`6` al vértice :math:`10` en un grafo no dirigido." -msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 1\\}` on an undirected graph." +msgid "From vertex :math:`6` to vertices :math:`\\{10, 1\\}` on an undirected graph." msgstr "" -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertex :math:`8` on a directed graph." +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`8` on a directed graph." msgstr "" -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 8\\}` on an " -"undirected graph." +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 8\\}` on an undirected graph." msgstr "" msgid "Using a combinations table on an undirected graph." msgstr "Usando una tabla de combinaciones en un grafo no dirigido." -msgid "" -"`Deprecated documentation `_" -msgstr "" -"`Documentación obsoleta `_" +msgid "`Deprecated documentation `_" +msgstr "`Documentación obsoleta `_" msgid "``pgr_trspVia``" msgstr "``pgr_trspVia``" -msgid "" -"``pgr_trspVia`` Route that goes through a list of vertices with restrictions." +msgid "``pgr_trspVia`` Route that goes through a list of vertices with restrictions." msgstr "" -msgid "" -"Given a list of vertices and a graph, this function is equivalent to finding " -"the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :" -"math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." +msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." msgstr "" msgid "The paths represents the sections of the route." @@ -17560,8 +12955,7 @@ msgstr "Las trayectorias representan los tramos de la ruta." msgid "Execute a :doc:`pgr_dijkstraVia`." msgstr "Ejecutar un :doc:`pgr_dijkstraVia`." -msgid "" -"For the set of sub paths of the solution that pass through a restriction then" +msgid "For the set of sub paths of the solution that pass through a restriction then" msgstr "" msgid "Execute the **TRSP** algorithm with restrictions for the paths." @@ -17570,19 +12964,11 @@ msgstr "" msgid "**NOTE** when this is done, ``U_turn_on_edge`` flag is ignored." msgstr "" -msgid "" -"pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, " -"[**options**])" -msgstr "" -"pgr_trsp(`SQL de aristas`_, `SQL de restricciones`_,**vértices**, " -"[``directed``])" +msgid "pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, [**options**])" +msgstr "pgr_trsp(`SQL de aristas`_, `SQL de restricciones`_,**vértices**, [``directed``])" -msgid "" -"All this examples are about the route that visits the vertices :math:`\\{5, " -"7, 1, 8, 15\\}` in that order on a directed graph." -msgstr "" -"Todos estos ejemplos son sobre la ruta que visita los vértices :math:`\\{5, " -"7, 1, 8, 15\\}` en ese orden, en un grafo dirigido." +msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a directed graph." +msgstr "Todos estos ejemplos son sobre la ruta que visita los vértices :math:`\\{5, 7, 1, 8, 15\\}` en ese orden, en un grafo dirigido." msgid "Simulation of how algorithm works." msgstr "Sumulación del functionamiento del algoritmo." @@ -17590,18 +12976,13 @@ msgstr "Sumulación del functionamiento del algoritmo." msgid "The algorithm performs a :doc:`pgr_dijkstraVia`" msgstr "" -msgid "" -"Detects which of the sub paths pass through a restriction in this case is " -"for the ``path_id = 5`` from ``6`` to ``3`` because the path :math:`15 " -"\\rightarrow 1` is restricted." +msgid "Detects which of the sub paths pass through a restriction in this case is for the ``path_id = 5`` from ``6`` to ``3`` because the path :math:`15 \\rightarrow 1` is restricted." msgstr "" msgid "Executes the :doc:`pgr_trsp` algorithm for the conflicting paths." msgstr "" -msgid "" -"From the :doc:`pgr_dijkstraVia` result it removes the conflicting paths and " -"builds the solution with the results of the :doc:`pgr_trsp` algorithm:" +msgid "From the :doc:`pgr_dijkstraVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" msgstr "" msgid "Getting the same result as ``pgr_trspVia``:" @@ -17613,20 +12994,13 @@ msgstr "Ejemplo 8" msgid "Sometimes ``U_turn_on_edge`` flag is ignored when is set to ``false``." msgstr "" -msgid "" -"The first step, doing a :doc:`pgr_dijkstraVia` does consider not making a U " -"turn on the same edge. But the path :math:`16 \\rightarrow 13` (Rows 4 and " -"5) is restricted and the result is using it." +msgid "The first step, doing a :doc:`pgr_dijkstraVia` does consider not making a U turn on the same edge. But the path :math:`16 \\rightarrow 13` (Rows 4 and 5) is restricted and the result is using it." msgstr "" -msgid "" -"When executing the :doc:`pgr_trsp` algorithm for the conflicting path, there " -"is no ``U_turn_on_edge`` flag." +msgid "When executing the :doc:`pgr_trsp` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." msgstr "" -msgid "" -"Therefore the result ignores the ``U_turn_on_edge`` flag when set to " -"``false``." +msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``." msgstr "" msgid ":doc:`via-category`" @@ -17635,17 +13009,10 @@ msgstr ":doc:`via-category`" msgid "``pgr_trspVia_withPoints``" msgstr "``pgr_trspVia_withPoints``" -msgid "" -"``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/" -"or points with restrictions." +msgid "``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/or points with restrictions." msgstr "" -msgid "" -"Given a graph, a set of restriction on the graph edges, a set of points on " -"the graphs edges and a list of vertices, this function is equivalent to " -"finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` " -"(where :math:`vertex` can be a vertex or a point on the graph) for all :math:" -"`i < size\\_of(via\\;vertices)` trying not to use restricted paths." +msgid "Given a graph, a set of restriction on the graph edges, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." msgstr "" msgid "is a sequence of paths" @@ -17663,8 +13030,7 @@ msgstr "" msgid "Execute a :doc:`pgr_withPointsVia`." msgstr "" -msgid "" -"For the set of paths of the solution that pass through a restriction then" +msgid "For the set of paths of the solution that pass through a restriction then" msgstr "" msgid "Execute the **TRSP** algorithm with restrictions for the path." @@ -17674,20 +13040,14 @@ msgid "Do not use negative values on identifiers of the inner queries." msgstr "" #, fuzzy -msgid "" -"pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**via vertices**, [**driving side**,] [**options**])" -msgstr "" -"pgr_trspVia_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de " -"puntos`_, **vertices**, [**opciones**])" +msgid "pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, [**driving side**,] [**options**])" +msgstr "pgr_trspVia_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_, **vertices**, [**opciones**])" #, fuzzy msgid "**options:** ``[directed, strict, U_turn_on_edge, details]``" msgstr "**opcionales:** ``[directed, strict, U_turn_on_edge]``" -msgid "" -"Find the route that visits the vertices :math:`\\{-6, 15, -5\\}` in that " -"order on an directed graph." +msgid "Find the route that visits the vertices :math:`\\{-6, 15, -5\\}` in that order on an directed graph." msgstr "" msgid "When positive it is considered a vertex identifier" @@ -17700,12 +13060,8 @@ msgstr "Cuando sea negativo se considera como un identificador de punto" msgid "[**driving side**]" msgstr "**Lado de manejo**" -msgid "" -"Value in [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] indicating if the " -"driving side is:" -msgstr "" -"Valor en [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] indicando si el lado de " -"manejo es:" +msgid "Value in [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] indicating if the driving side is:" +msgstr "Valor en [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] indicando si el lado de manejo es:" msgid "For directed graph:" msgstr "Para un grafo dirigido:" @@ -17729,8 +13085,7 @@ msgstr "" #, fuzzy msgid "[``r``, ``R``] for directed graph" -msgstr "" -"[``r``, ``R``] para el manejo del lado derecho (solamente grafo dirigido)" +msgstr "[``r``, ``R``] para el manejo del lado derecho (solamente grafo dirigido)" #, fuzzy msgid "[``l``, ``L``] for undirected graph" @@ -17746,21 +13101,13 @@ msgid "For showing points stops." msgstr "" msgid "When ``true`` the results will include the points that are in the path." -msgstr "" -"Cuando ``true`` los resultados incluyen los puntos que están en el camino." +msgstr "Cuando ``true`` los resultados incluyen los puntos que están en el camino." -msgid "" -"When ``false`` the results will not include the points that are in the path." -msgstr "" -"Cuando ``false`` los resultados no incluyen los puntos que están en el " -"camino." +msgid "When ``false`` the results will not include the points that are in the path." +msgstr "Cuando ``false`` los resultados no incluyen los puntos que están en el camino." -msgid "" -"When ``start_vid``, ``end_vid`` and ``node`` columns have negative values, " -"the identifier is for a Point." -msgstr "" -"Cuando las columnas ``start_vid``, ``end_vid`` y``node`` tengan valores " -"negativos, el identificador es para un Punto." +msgid "When ``start_vid``, ``end_vid`` and ``node`` columns have negative values, the identifier is for a Point." +msgstr "Cuando las columnas ``start_vid``, ``end_vid`` y``node`` tengan valores negativos, el identificador es para un Punto." msgid "Use ``pgr_findCloseEdges`` for points on the fly" msgstr "" @@ -17768,33 +13115,22 @@ msgstr "" msgid "Using :doc:`pgr_findCloseEdges`:" msgstr "Usando :doc:`pgr_findCloseEdges`:" -msgid "" -"Visit from vertex :math:`1` to the two locations on the graph of point " -"`(2.9, 1.8)` in order of closeness to the graph." +msgid "Visit from vertex :math:`1` to the two locations on the graph of point `(2.9, 1.8)` in order of closeness to the graph." msgstr "" -msgid "" -"Point :math:`-1` corresponds to the closest edge from point `(2.9, 1.8)`." -msgstr "" -"Punto :math:`-1` corresponde a la arista más cercana al punto `(2.9, 1.8)`." +msgid "Point :math:`-1` corresponds to the closest edge from point `(2.9, 1.8)`." +msgstr "Punto :math:`-1` corresponde a la arista más cercana al punto `(2.9, 1.8)`." -msgid "" -"Point :math:`-2` corresponds to the next close edge from point `(2.9, 1.8)`." -msgstr "" -"Punto :math:`-2` corresponde a la segunda arista más cercana al punto `(2.9, " -"1.8)`." +msgid "Point :math:`-2` corresponds to the next close edge from point `(2.9, 1.8)`." +msgstr "Punto :math:`-2` corresponde a la segunda arista más cercana al punto `(2.9, 1.8)`." -msgid "" -"Point :math:`-2` is visited on the route to from vertex :math:`1` to Point :" -"math:`-1` (See row where :math:`seq = 4`)." +msgid "Point :math:`-2` is visited on the route to from vertex :math:`1` to Point :math:`-1` (See row where :math:`seq = 4`)." msgstr "" msgid "Usage variations" msgstr "Variaciones de uso" -msgid "" -"All this examples are about the route that visits the vertices :math:`\\{-6, " -"7, -4, 8, -2\\}` in that order on a directed graph." +msgid "All this examples are about the route that visits the vertices :math:`\\{-6, 7, -4, 8, -2\\}` in that order on a directed graph." msgstr "" msgid "Status of \"passes in front\" or \"visits\" of the nodes and points." @@ -17803,40 +13139,25 @@ msgstr "" msgid "The algorithm performs a :doc:`pgr_withPointsVia`" msgstr "El algoritmo realiza una :doc:`pgr_withPointsVia`" -msgid "" -"Detects which of the paths pass through a restriction in this case is for " -"the ``path_id = 1`` from ``-6`` to ``15`` because the path :math:`9 " -"\\rightarrow 16` is restricted." +msgid "Detects which of the paths pass through a restriction in this case is for the ``path_id = 1`` from ``-6`` to ``15`` because the path :math:`9 \\rightarrow 16` is restricted." msgstr "" -msgid "" -"Executes the :ref:`TRSP-family:TRSP algorithm` for the conflicting paths." +msgid "Executes the :ref:`TRSP-family:TRSP algorithm` for the conflicting paths." msgstr "" -msgid "" -"From the :doc:`pgr_withPointsVia` result it removes the conflicting paths " -"and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" +msgid "From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" msgstr "" msgid "Getting the same result as ``pgr_trspVia_withPoints``:" msgstr "" -msgid "" -"The first step, doing a :doc:`pgr_withPointsVia` does consider not making a " -"U turn on the same edge. But the path :math:`9 \\rightarrow 16` (Rows 4 and " -"5) is restricted and the result is using it." +msgid "The first step, doing a :doc:`pgr_withPointsVia` does consider not making a U turn on the same edge. But the path :math:`9 \\rightarrow 16` (Rows 4 and 5) is restricted and the result is using it." msgstr "" -msgid "" -"When executing the :doc:`pgr_trsp_withPoints` algorithm for the conflicting " -"path, there is no ``U_turn_on_edge`` flag." +msgid "When executing the :doc:`pgr_trsp_withPoints` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." msgstr "" -msgid "" -"Therefore the result ignores the ``U_turn_on_edge`` flag when set to " -"``false``. From the :doc:`pgr_withPointsVia` result it removes the " -"conflicting paths and builds the solution with the results of the :doc:" -"`pgr_trsp` algorithm. In this case a U turn is been done using the same edge." +msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``. From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm. In this case a U turn is been done using the same edge." msgstr "" msgid "``pgr_trsp_withPoints``" @@ -17845,14 +13166,8 @@ msgstr "``pgr_trsp_withPoints``" msgid "``pgr_trsp_withPoints`` Routing Vertex/Point with restrictions." msgstr "" -msgid "" -"Modify the graph to include points defined by `Points SQL`_. Consider the " -"invalid paths on `Restrictions SQL`_. Using Dijkstra algorithm, find the " -"shortest path." -msgstr "" -"Modificar el grafo para incluir los puntos definidos por `Points SQL`_. " -"Considerar las rutas inválidas en `Restrictions SQL`_. Utilizar el algoritmo " -"de Dijkstra, encontrar el camino más corto." +msgid "Modify the graph to include points defined by `Points SQL`_. Consider the invalid paths on `Restrictions SQL`_. Using Dijkstra algorithm, find the shortest path." +msgstr "Modificar el grafo para incluir los puntos definidos por `Points SQL`_. Considerar las rutas inválidas en `Restrictions SQL`_. Utilizar el algoritmo de Dijkstra, encontrar el camino más corto." msgid "Vertices of the graph are:" msgstr "Los vértices del grafo son:" @@ -17870,55 +13185,31 @@ msgid "The `agg_cost` in the non included values `(u, v)` is :math:`\\infty`" msgstr "El `agg_cost` en los valores no incluidos `(u, v)` es :math:`\\infty`" #, fuzzy -msgid "" -"For optimization purposes, any duplicated value in the input arrays of " -"**start vids** or **end vids** or are ignored." -msgstr "" -"Para fines de optimización, se omite cualquier valor duplicado en " -"`start_vids` o `end_vids`." +msgid "For optimization purposes, any duplicated value in the input arrays of **start vids** or **end vids** or are ignored." +msgstr "Para fines de optimización, se omite cualquier valor duplicado en `start_vids` o `end_vids`." msgid "Running time: :math:`O(|start\\_vids|\\times(V \\log V + E))`" msgstr "Tiempo de ejecución: :math:`O(|start\\_vids|\\times(V \\log V + E))`" #, fuzzy -msgid "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**start vid**, **end vid**, [**driving side**,] [**options**])" -msgstr "" -"pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de " -"puntos`_,**salida**, **destinos**, [**opciones**])" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**,] [**options**])" +msgstr "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_,**salida**, **destinos**, [**opciones**])" #, fuzzy -msgid "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**start vid**, **end vids**, [**driving side**,] [**options**])" -msgstr "" -"pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de " -"puntos`_,**salida**, **destinos**, [**opciones**])" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**,] [**options**])" +msgstr "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_,**salida**, **destinos**, [**opciones**])" #, fuzzy -msgid "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**start vids**, **end vid**, [**driving side**,] [**options**])" -msgstr "" -"pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de " -"puntos`_,**salida**, **destinos**, [**opciones**])" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**,] [**options**])" +msgstr "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_,**salida**, **destinos**, [**opciones**])" #, fuzzy -msgid "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**start vids**, **end vids**, [**driving side**,] [**options**])" -msgstr "" -"pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de " -"puntos`_,**salida**, **destinos**, [**opciones**])" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**,] [**options**])" +msgstr "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_,**salida**, **destinos**, [**opciones**])" #, fuzzy -msgid "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"`Combinations SQL`_, [**driving side**,] [**options**])" -msgstr "" -"pgr_trspVia_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de " -"puntos`_, **vertices**, [**opciones**])" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**,] [**options**])" +msgstr "pgr_trspVia_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_, **vertices**, [**opciones**])" msgid "**options:** ``[directed, details]``" msgstr "**opcionales:** ``[directed, details]``" @@ -17926,67 +13217,38 @@ msgstr "**opcionales:** ``[directed, details]``" # | msgid "" # | "From point :math:`1` to vertex :math:`3` with details on a **left** " # | "driving side configuration on a **directed** graph with **details**." -msgid "" -"From point :math:`1` to vertex :math:`10` with right driving side in " -"directed graph. (with details)" -msgstr "" -"Desde el punto :math:`1` al vértice :math:`10` con detalles en una " -"configuración de manejo por la izquierda en un grafo dirigido. (con detalles)" +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (with details)" +msgstr "Desde el punto :math:`1` al vértice :math:`10` con detalles en una configuración de manejo por la izquierda en un grafo dirigido. (con detalles)" -msgid "" -"From point :math:`1` to point :math:`3` and vertex :math:`7` on an " -"undirected graph" -msgstr "" -"Desde el punto :math:`1` al punto :math:`3` y al vértice :math:`7` en un " -"grafo no dirigido" +msgid "From point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" +msgstr "Desde el punto :math:`1` al punto :math:`3` y al vértice :math:`7` en un grafo no dirigido" # | msgid "" # | "From point :math:`1` to vertex :math:`3` with details on a **left** " # | "driving side configuration on a **directed** graph with **details**." -msgid "" -"From point :math:`1` and vertex :math:`6` to point :math:`3` with right " -"driving side in directed graph. (without details)" -msgstr "" -"Desde el punto :math:`1` y el vértice :math:`6` al punto :math:`3` y el " -"vértice :math:`1` en un grafo no dirigido. (sin detalles)" +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph. (without details)" +msgstr "Desde el punto :math:`1` y el vértice :math:`6` al punto :math:`3` y el vértice :math:`1` en un grafo no dirigido. (sin detalles)" # | msgid "From point :math:`1` to point :math:`3` and vertex :math:`5`." #, fuzzy -msgid "" -"From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :" -"math:`1` with left side driving." -msgstr "" -"Desde el punto :math:`1` y vértice :math:`6` al punto :math:`3` y vértice :" -"math:`1`." +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` with left side driving." +msgstr "Desde el punto :math:`1` y vértice :math:`6` al punto :math:`3` y vértice :math:`1`." msgid "Two combinations" msgstr "Dos combinaciones" -msgid "" -"From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to " -"point :math:`3` with right side driving. (with details)" -msgstr "" -"Desde el punto :math:`1` hasta el vértice :math:`10`, y desde el vértice :" -"math:`6` hasta el punto :math:`3` con najando del lado derecho (con detalles)" +msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving. (with details)" +msgstr "Desde el punto :math:`1` hasta el vértice :math:`10`, y desde el vértice :math:`6` hasta el punto :math:`3` con najando del lado derecho (con detalles)" msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_." msgstr "Usar :doc:`pgr_findCloseEdges` en el `SQL de puntos`_." -msgid "" -"Find the routes from vertex :math:`1` to the two closest locations on the " -"graph of point `(2.9, 1.8)`." -msgstr "" -"Wncontrar las rutas desde el vértice :math:`1` a las dos ubicaciones más " -"cercanas en el grafo al punto`(2.9, 1.8)`." +msgid "Find the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." +msgstr "Wncontrar las rutas desde el vértice :math:`1` a las dos ubicaciones más cercanas en el grafo al punto`(2.9, 1.8)`." #, fuzzy -msgid "" -"All the examples are about traveling from point :math:`1` and vertex :math:" -"`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}` with " -"restrictions" -msgstr "" -"Todos los ejemplos son acerca de viajar desde el punto :math:`1` y vértice :" -"math:`5` al los puntos :math:`\\{2, 3, 6\\}` y vértices :math:`\\{10, 11\\}`" +msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}` with restrictions" +msgstr "Todos los ejemplos son acerca de viajar desde el punto :math:`1` y vértice :math:`5` al los puntos :math:`\\{2, 3, 6\\}` y vértices :math:`\\{10, 11\\}`" msgid "Passes in front or visits with right side driving." msgstr "Pasa enfrente o visita con lado derecho de manejo." @@ -18000,24 +13262,14 @@ msgstr "Pasa enfrente o visita con lado izquierdo de manejo." msgid "``pgr_turnRestrictedPath`` - Experimental" msgstr "``pgr_turnRestrictedPath`` - Experimental" -msgid "" -"``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex - Vertex routing " -"with restrictions" -msgstr "" -"``pgr_turnRestrictedPath`` Usando el algoritmo vértice -vértice de Yen para " -"ruteo con restricciones" +msgid "``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex - Vertex routing with restrictions" +msgstr "``pgr_turnRestrictedPath`` Usando el algoritmo vértice -vértice de Yen para ruteo con restricciones" -msgid "" -"Using Yen's algorithm to obtain K shortest paths and analyze the paths to " -"select the paths that do not use the restrictions" +msgid "Using Yen's algorithm to obtain K shortest paths and analyze the paths to select the paths that do not use the restrictions" msgstr "" -msgid "" -"pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, " -"**end vid**, **K**, [**options**])" -msgstr "" -"pgr_turnRestrictedPath(`SQL de aristas`_, `SQL de restricciones`_, " -"**salida**, **destino**, **K**, [**opciones**])" +msgid "pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, **K**, [**options**])" +msgstr "pgr_turnRestrictedPath(`SQL de aristas`_, `SQL de restricciones`_, **salida**, **destino**, **K**, [**opciones**])" msgid "**options:** ``[directed, heap_paths, stop_on_first, strict]``" msgstr "**opcionales:** ``[directed, heap_paths, stop_on_first, strict]``" @@ -18031,8 +13283,7 @@ msgstr "" msgid "``stop_on_first``" msgstr "" -msgid "" -"When ``true`` stops on first path found that dos not violate restrictions" +msgid "When ``true`` stops on first path found that dos not violate restrictions" msgstr "" msgid "When ``false`` returns at most K paths" @@ -18060,8 +13311,7 @@ msgid "``pgr_version``" msgstr "``pgr_version``" msgid "``pgr_version`` — Query for pgRouting version information." -msgstr "" -"``pgr_version`` — consulta de información sobre la versión de pgRouting." +msgstr "``pgr_version`` — consulta de información sobre la versión de pgRouting." msgid "Breaking change on result columns" msgstr "Cambio estructural en las columnas de resultados" @@ -18093,62 +13343,34 @@ msgstr "**TBD**" msgid "TBD" msgstr "Por Definirse" -msgid "" -"``pgr_withPoints`` - Returns the shortest path in a graph with additional " -"temporary vertices." -msgstr "" -"``pgr_withPoints`` - Devuelve la ruta más corta de un grafo con vértices " -"temporales adicionales." +msgid "``pgr_withPoints`` - Returns the shortest path in a graph with additional temporary vertices." +msgstr "``pgr_withPoints`` - Devuelve la ruta más corta de un grafo con vértices temporales adicionales." msgid "pgr_withPoints(Combinations)" msgstr "pgr_withPoints(Combinaciones)" -msgid "" -"Modify the graph to include points defined by `Points SQL`_. Using Dijkstra " -"algorithm, find the shortest path." -msgstr "" -"Modificar el grafo para incluir los puntos definidos por `Points SQL`_. " -"Utilizar el algoritmo de Dijkstra, encontrar el camino más corto." +msgid "Modify the graph to include points defined by `Points SQL`_. Using Dijkstra algorithm, find the shortest path." +msgstr "Modificar el grafo para incluir los puntos definidos por `Points SQL`_. Utilizar el algoritmo de Dijkstra, encontrar el camino más corto." #, fuzzy -msgid "" -"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, " -"[**driving side**] [**options**])" -msgstr "" -"pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, " -"**destino**, **K**, **lado de manejo**, [**opciones**])" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destino**, **K**, **lado de manejo**, [**opciones**])" #, fuzzy -msgid "" -"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, " -"[**driving side**] [**options**])" -msgstr "" -"pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, " -"**destinos**, **K**, **lado de manejo**, [**opciones**])" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destinos**, **K**, **lado de manejo**, [**opciones**])" #, fuzzy -msgid "" -"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, " -"[**driving side**] [**options**])" -msgstr "" -"pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, " -"**destino**, **K**, **lado de manejo**, [**opciones**])" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destino**, **K**, **lado de manejo**, [**opciones**])" #, fuzzy -msgid "" -"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, " -"[**driving side**] [**options**])" -msgstr "" -"pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, " -"**destinos**, **K**, **lado de manejo**, [**opciones**])" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destinos**, **K**, **lado de manejo**, [**opciones**])" #, fuzzy -msgid "" -"pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving " -"side**] [**options**])" -msgstr "" -"pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, `SQL de " -"combinaciones`_, **K**, **lado de manejo**, [**opciones**])" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, `SQL de combinaciones`_, **K**, **lado de manejo**, [**opciones**])" #, fuzzy msgid "**options:** ``[directed, details])``" @@ -18157,80 +13379,39 @@ msgstr "**opcionales:** ``[directed, details]``" # | msgid "" # | "From point :math:`1` to vertex :math:`3` with details on a **left** " # | "driving side configuration on a **directed** graph with **details**." -msgid "" -"From point :math:`1` to vertex :math:`10` with right driving side in " -"directed graph. (without details)" -msgstr "" -"Desde el punto :math:`1` al vértice :math:`10` manjando del lado derecho en " -"un grafo dirigido, (sin detalles)" +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (without details)" +msgstr "Desde el punto :math:`1` al vértice :math:`10` manjando del lado derecho en un grafo dirigido, (sin detalles)" -msgid "" -"Identifier of the starting vertex of the path. Negative value is for point’s " -"identifier." -msgstr "" -"Identificador del vértice inicial de la ruta. Valor negativo es para " -"identificador de punto." +msgid "Identifier of the starting vertex of the path. Negative value is for point’s identifier." +msgstr "Identificador del vértice inicial de la ruta. Valor negativo es para identificador de punto." -msgid "" -"Array of identifiers of starting vertices. Negative values are for point’s " -"identifiers." -msgstr "" -"Arreglo de identificadores de vértices iniciales. Valores negativos son para " -"identificadores de puntos." +msgid "Array of identifiers of starting vertices. Negative values are for point’s identifiers." +msgstr "Arreglo de identificadores de vértices iniciales. Valores negativos son para identificadores de puntos." -msgid "" -"Identifier of the ending vertex of the path. Negative value is for point’s " -"identifier." -msgstr "" -"Identificador del vértice final de la ruta. Valor negativo es para " -"identificador de punto." +msgid "Identifier of the ending vertex of the path. Negative value is for point’s identifier." +msgstr "Identificador del vértice final de la ruta. Valor negativo es para identificador de punto." -msgid "" -"Array of identifiers of ending vertices. Negative values are for point’s " -"identifiers." -msgstr "" -"Arreglo de identificadores de vértices finales. Valores negativos son para " -"identificadores de puntos." +msgid "Array of identifiers of ending vertices. Negative values are for point’s identifiers." +msgstr "Arreglo de identificadores de vértices finales. Valores negativos son para identificadores de puntos." -msgid "" -"All the examples are about traveling from point :math:`1` and vertex :math:" -"`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" -msgstr "" -"Todos los ejemplos son acerca de viajar desde el punto :math:`1` y vértice :" -"math:`5` al los puntos :math:`\\{2, 3, 6\\}` y vértices :math:`\\{10, 11\\}`" +msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" +msgstr "Todos los ejemplos son acerca de viajar desde el punto :math:`1` y vértice :math:`5` al los puntos :math:`\\{2, 3, 6\\}` y vértices :math:`\\{10, 11\\}`" -msgid "" -"``pgr_withPointsCost`` - Calculates the shortest path and returns only the " -"aggregate cost of the shortest path found, for the combination of points " -"given." -msgstr "" -"``pgr_withPointsCost`` - Calcula el camino más corto y devuelve sólo el " -"coste agregado del camino más corto encontrado, para la combinación de " -"puntos dada." +msgid "``pgr_withPointsCost`` - Calculates the shortest path and returns only the aggregate cost of the shortest path found, for the combination of points given." +msgstr "``pgr_withPointsCost`` - Calcula el camino más corto y devuelve sólo el coste agregado del camino más corto encontrado, para la combinación de puntos dada." msgid "pgr_withPointsCost(Combinations)" msgstr "pgr_withPointsCost(Combinaciones)" -msgid "" -"Modify the graph to include points defined by points_sql. Using Dijkstra " -"algorithm, return only the aggregate cost of the shortest path found." -msgstr "" -"Modificar el grafo para incluir los puntos definidos por points_sql. " -"Utilizando el algoritmo de Dijkstra, devolver sólo el coste agregado del " -"camino más corto encontrado." +msgid "Modify the graph to include points defined by points_sql. Using Dijkstra algorithm, return only the aggregate cost of the shortest path found." +msgstr "Modificar el grafo para incluir los puntos definidos por points_sql. Utilizando el algoritmo de Dijkstra, devolver sólo el coste agregado del camino más corto encontrado." -msgid "" -"Returns the sum of the costs of the shortest path for pair combination of " -"vertices in the modified graph." -msgstr "" -"Devuelve la suma de los costes de la ruta más corta para la combinación de " -"pares de vértices en el grafo modificado." +msgid "Returns the sum of the costs of the shortest path for pair combination of vertices in the modified graph." +msgstr "Devuelve la suma de los costes de la ruta más corta para la combinación de pares de vértices en el grafo modificado." #, fuzzy msgid "The returned values are in the form of a set of |matrix-result|." -msgstr "" -"Los valores devueltos tienen la forma de un conjunto de `(start_vid, " -"end_vid, agg_cost)`." +msgstr "Los valores devueltos tienen la forma de un conjunto de `(start_vid, end_vid, agg_cost)`." msgid "**positive** when it belongs to the edges_sql" msgstr "**positivo** cuando pertenece a edges_sql" @@ -18238,103 +13419,59 @@ msgstr "**positivo** cuando pertenece a edges_sql" msgid "**negative** when it belongs to the points_sql" msgstr "**negativo** cuando pertenece a points_sql" -msgid "" -"If the values returned are stored in a table, the unique index would be the " -"pair: `(start_vid, end_vid)`." -msgstr "" -"Si los valores devueltos se almacenan en una tabla, el índice único sería el " -"par: `(start_vid, end_vid)`." +msgid "If the values returned are stored in a table, the unique index would be the pair: `(start_vid, end_vid)`." +msgstr "Si los valores devueltos se almacenan en una tabla, el índice único sería el par: `(start_vid, end_vid)`." msgid "For **undirected** graphs, the results are **symmetric**." msgstr "Para los grafos **no dirigidos**, los resultados son **simétricos**." #, fuzzy -msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, " -"[**driving side**] [**options**])" -msgstr "" -"pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, " -"**destino**, **K**, **lado de manejo**, [**opciones**])" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destino**, **K**, **lado de manejo**, [**opciones**])" #, fuzzy -msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, " -"[**driving side**] [**options**])" -msgstr "" -"pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, " -"**destinos**, **K**, **lado de manejo**, [**opciones**])" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destinos**, **K**, **lado de manejo**, [**opciones**])" #, fuzzy -msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, " -"[**driving side**] [**options**])" -msgstr "" -"pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, " -"**destino**, **K**, **lado de manejo**, [**opciones**])" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destino**, **K**, **lado de manejo**, [**opciones**])" #, fuzzy -msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end " -"vids**, [**driving side**] [**options**])" -msgstr "" -"pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, " -"**destinos**, **K**, **lado de manejo**, [**opciones**])" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destinos**, **K**, **lado de manejo**, [**opciones**])" #, fuzzy -msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, " -"[**driving side**] [**options**])" -msgstr "" -"pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, `SQL de " -"combinaciones`_, **K**, **lado de manejo**, [**opciones**])" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, `SQL de combinaciones`_, **K**, **lado de manejo**, [**opciones**])" #, fuzzy msgid "**options:** ``[directed]``" msgstr "**opcionales:** ``[directed, cap]``" -msgid "" -"There is no **details** flag, unlike the other members of the withPoints " -"family of functions." -msgstr "" -"No hay identificador de **details**, a diferencia de los otros miembros de " -"la familia de funciones withPoints." +msgid "There is no **details** flag, unlike the other members of the withPoints family of functions." +msgstr "No hay identificador de **details**, a diferencia de los otros miembros de la familia de funciones withPoints." # | msgid "" # | "From point :math:`1` to vertex :math:`3` with details on a **left** " # | "driving side configuration on a **directed** graph with **details**." #, fuzzy -msgid "" -"From point :math:`1` to vertex :math:`10` with right driving side in " -"directed graph." -msgstr "" -"Desde el punto :math:`1` al vértice :math:`10` con detalles en una " -"configuración de manejo por la izquierda en un grafo dirigido con detalles." +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph." +msgstr "Desde el punto :math:`1` al vértice :math:`10` con detalles en una configuración de manejo por la izquierda en un grafo dirigido con detalles." # | msgid "" # | "From point :math:`1` to vertex :math:`3` with details on a **left** " # | "driving side configuration on a **directed** graph with **details**." #, fuzzy -msgid "" -"From point :math:`1` and vertex :math:`6` to point :math:`3` with right " -"driving side in directed graph." -msgstr "" -"Desde el punto :math:`1` y el vértice :math:`6` al punto :math:`3` y el " -"vértice :math:`1` en un grafo no dirigido, con detalles." +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph." +msgstr "Desde el punto :math:`1` y el vértice :math:`6` al punto :math:`3` y el vértice :math:`1` en un grafo no dirigido, con detalles." #, fuzzy -msgid "" -"From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to " -"point :math:`3` with right side driving." -msgstr "" -"Desde el punto :math:`1` hasta el vértice :math:`10`, y desde el vértice :" -"math:`6` hasta el punto :math:`3` con lado de manejo **derecho**." +msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving." +msgstr "Desde el punto :math:`1` hasta el vértice :math:`10`, y desde el vértice :math:`6` hasta el punto :math:`3` con lado de manejo **derecho**." -msgid "" -"Find the cost of the routes from vertex :math:`1` to the two closest " -"locations on the graph of point `(2.9, 1.8)`." -msgstr "" -"Encontrar el costo de las rutas desde el vértice :math:`1` a las dos " -"ubicaciones mpas cercanas en el grafo desde el punto `(2.9, 1.8)`." +msgid "Find the cost of the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." +msgstr "Encontrar el costo de las rutas desde el vértice :math:`1` a las dos ubicaciones mpas cercanas en el grafo desde el punto `(2.9, 1.8)`." msgid "Being close to the graph does not mean have a shorter route." msgstr "Estar cercano al grafo no significa tener la ruta más corta." @@ -18342,12 +13479,8 @@ msgstr "Estar cercano al grafo no significa tener la ruta más corta." msgid "Right side driving topology" msgstr "Topología de manejo del lado derecho" -msgid "" -"Traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, " -"3, 6\\}` and vertices :math:`\\{10, 11\\}`" -msgstr "" -"Desde el punto :math:`1` y vértice :math:`5` al los puntos :math:`\\{2, 3, " -"6\\}`y vértices :math:`\\{10, 11\\}`" +msgid "Traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" +msgstr "Desde el punto :math:`1` y vértice :math:`5` al los puntos :math:`\\{2, 3, 6\\}`y vértices :math:`\\{10, 11\\}`" msgid "Left side driving topology" msgstr "Topología de manejo del lado izquierdo" @@ -18355,27 +13488,15 @@ msgstr "Topología de manejo del lado izquierdo" msgid "Does not matter driving side driving topology" msgstr "No importa el lado de manejo" -msgid "" -"``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:" -"`pgr_withPoints`." -msgstr "" -"``pgr_withPointsCostMatrix`` - Calcula una matriz de costos usando :doc:" -"`pgr_withPoints`." +msgid "``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:`pgr_withPoints`." +msgstr "``pgr_withPointsCostMatrix`` - Calcula una matriz de costos usando :doc:`pgr_withPoints`." #, fuzzy -msgid "" -"pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, " -"[**driving side**] [**options**])" -msgstr "" -"pgr_withPointsCostMatrix(`SQL de aristas`_, `SQL de puntos`_, **salidas**, " -"[**opciones**])" +msgid "pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, [**driving side**] [**options**])" +msgstr "pgr_withPointsCostMatrix(`SQL de aristas`_, `SQL de puntos`_, **salidas**, [**opciones**])" -msgid "" -"Cost matrix for points :math:`\\{1, 6\\}` and vertices :math:`\\{10, 11\\}` " -"on an **undirected** graph" -msgstr "" -"Matriz de costos para puntos :math:`\\{1, 6\\}` y vértices :math:`\\{10, " -"11\\}` en un grafo **no dirigido**" +msgid "Cost matrix for points :math:`\\{1, 6\\}` and vertices :math:`\\{10, 11\\}` on an **undirected** graph" +msgstr "Matriz de costos para puntos :math:`\\{1, 6\\}` y vértices :math:`\\{10, 11\\}` en un grafo **no dirigido**" msgid "Returning a **symmetrical** cost matrix" msgstr "Devolver una matriz de costes **simétrica**" @@ -18387,19 +13508,11 @@ msgstr "Uso del valor predeterminado ``side`` en la consulta **SQL de puntos**" msgid "Using the default ``driving side`` value" msgstr "Usando el valor predeterminado ``driving_side``" -msgid "" -"Find the matrix cost of the routes from vertex :math:`1` and the two closest " -"locations on the graph of point `(2.9, 1.8)`." -msgstr "" -"Encontrar la matriz de costos de las rutas desde el vértice :math:`1` y las " -"dos ubicaciones más cercanas en el grafo al punto `(2.9, 1.8)`." +msgid "Find the matrix cost of the routes from vertex :math:`1` and the two closest locations on the graph of point `(2.9, 1.8)`." +msgstr "Encontrar la matriz de costos de las rutas desde el vértice :math:`1` y las dos ubicaciones más cercanas en el grafo al punto `(2.9, 1.8)`." -msgid "" -"``pgr_withPointsDD`` - Returns the driving **distance** from a starting " -"point." -msgstr "" -"``pgr_withPointsDD`` - Devuelve la **distancia** de conducción desde un " -"punto de partida." +msgid "``pgr_withPointsDD`` - Returns the driving **distance** from a starting point." +msgstr "``pgr_withPointsDD`` - Devuelve la **distancia** de conducción desde un punto de partida." #, fuzzy msgid "Output columns standardized to |result-spantree|" @@ -18414,32 +13527,16 @@ msgstr "" msgid "Deprecated signatures:" msgstr "Firmas obsoletas:" -msgid "" -"Modify the graph to include points and using Dijkstra algorithm, extracts " -"all the nodes and points that have costs less than or equal to the value " -"``**distance**`` from the starting point. The edges extracted will conform " -"the corresponding spanning tree." -msgstr "" -"Modifica el grafo para incluir puntos y utilizando el algoritmo Dijkstra, " -"extrae todos los nodos y puntos que tienen costes menores o iguales que el " -"valor de ``**distance**`` desde el punto inicial. Las aristas extraídas " -"conformarán el árbol de expansión correspondiente." +msgid "Modify the graph to include points and using Dijkstra algorithm, extracts all the nodes and points that have costs less than or equal to the value ``**distance**`` from the starting point. The edges extracted will conform the corresponding spanning tree." +msgstr "Modifica el grafo para incluir puntos y utilizando el algoritmo Dijkstra, extrae todos los nodos y puntos que tienen costes menores o iguales que el valor de ``**distance**`` desde el punto inicial. Las aristas extraídas conformarán el árbol de expansión correspondiente." #, fuzzy -msgid "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, " -"[**driving side**], [**options A**])" -msgstr "" -"pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raíz**, " -"**distancia**, **lado de manejo**, [**opciones A**])" +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options A**])" +msgstr "pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raíz**, **distancia**, **lado de manejo**, [**opciones A**])" #, fuzzy -msgid "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, " -"[**driving side**], [**options B**])" -msgstr "" -"pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raices**, " -"**distancia**, **lado de manejo**, [**opciones B**])" +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options B**])" +msgstr "pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raices**, **distancia**, **lado de manejo**, [**opciones B**])" msgid "**options A:** ``[directed, details]``" msgstr "**opciones A:** ``[directed, details]``" @@ -18448,80 +13545,45 @@ msgid "**options B:** ``[directed, details, equicost]``" msgstr "**opciones B:** ``[directed, details, equicost]``" #, fuzzy -msgid "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, " -"[**driving side**], [**options**])" -msgstr "" -"pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raíz**, " -"**distancia**, **lado de manejo**, [**opciones**])" +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options**])" +msgstr "pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raíz**, **distancia**, **lado de manejo**, [**opciones**])" -msgid "" -"Right side driving topology, from point :math:`1` within a distance of :math:" -"`3.3` with details." -msgstr "" -"Topología de manejo por el lado derecho desde el punto :math:`1` con una " -"distancia :math:`3.3`, detallada." +msgid "Right side driving topology, from point :math:`1` within a distance of :math:`3.3` with details." +msgstr "Topología de manejo por el lado derecho desde el punto :math:`1` con una distancia :math:`3.3`, detallada." #, fuzzy -msgid "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, " -"[**driving side**], [**options**])" -msgstr "" -"pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raices**, " -"**distancia**, **lado de manejo**, [**opciones**])" +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options**])" +msgstr "pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raices**, **distancia**, **lado de manejo**, [**opciones**])" msgid "**options:** ``[directed, details, equicost]``" msgstr "**opcionales:** ``[directed, details, equicost]``" -msgid "" -"From point :math:`1` and vertex :math:`16` within a distance of :math:`3.3` " -"with ``equicost`` on a directed graph" -msgstr "" -"Desde el punto :math:`1` y el vértice :math:`16` dentro de una distancia de :" -"math:`3.3` con ``equicost`` en un grafo dirigido" +msgid "From point :math:`1` and vertex :math:`16` within a distance of :math:`3.3` with ``equicost`` on a directed graph" +msgstr "Desde el punto :math:`1` y el vértice :math:`16` dentro de una distancia de :math:`3.3` con ``equicost`` en un grafo dirigido" msgid "Negative values represent a point" msgstr "Valores negativos representan un punto" -msgid "" -"Find the driving distance from the two closest locations on the graph of " -"point `(2.9, 1.8)`." -msgstr "" -"Encontrar la distancia de manejo de las dos ubicaciones más cercanas al " -"grafo del punto `(2.8, 1.8)`." +msgid "Find the driving distance from the two closest locations on the graph of point `(2.9, 1.8)`." +msgstr "Encontrar la distancia de manejo de las dos ubicaciones más cercanas al grafo del punto `(2.8, 1.8)`." -msgid "" -"Point :math:`-1` corresponds to the closest edge from point :math:`(2.9, " -"1.8)`." -msgstr "" -"El punto :math:`-1` corresponde a la arista más cercana al punto `(2.9, " -"1.8)`." +msgid "Point :math:`-1` corresponds to the closest edge from point :math:`(2.9, 1.8)`." +msgstr "El punto :math:`-1` corresponde a la arista más cercana al punto `(2.9, 1.8)`." -msgid "" -"Point :math:`-2` corresponds to the next close edge from point :math:`(2.9, " -"1.8)`." -msgstr "" -"El punto :math:`-2` corresponde a la segunda arista más cercana al punto " -"`(2.9, 1.8)`." +msgid "Point :math:`-2` corresponds to the next close edge from point :math:`(2.9, 1.8)`." +msgstr "El punto :math:`-2` corresponde a la segunda arista más cercana al punto `(2.9, 1.8)`." msgid "Driving side does not matter" msgstr "Lado de manejo no importa" -msgid "" -"From point :math:`1` within a distance of :math:`3.3`, does not matter " -"driving side, with details." -msgstr "" -"Desde el punto :math:`1` dentro de una distancia de :math:`3.3`, sin " -"importar el lado de manejo, detallada." +msgid "From point :math:`1` within a distance of :math:`3.3`, does not matter driving side, with details." +msgstr "Desde el punto :math:`1` dentro de una distancia de :math:`3.3`, sin importar el lado de manejo, detallada." msgid "``pgr_withPointsKSP``" msgstr "``pgr_withPointsKSP``" -msgid "" -"``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." -msgstr "" -"``pgr_withPointsKSP`` - Encuentra las rutas más cortas de K usando el " -"algoritmo de Yen." +msgid "``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." +msgstr "``pgr_withPointsKSP`` - Encuentra las rutas más cortas de K usando el algoritmo de Yen." msgid "pgr_withPointsKSP(One to Many)" msgstr "pgr_withPointsKSP(Uno a Muchos)" @@ -18535,104 +13597,58 @@ msgstr "pgr_withPointsKSP(Muchos a Muchos)" msgid "pgr_withPointsKSP(Combinations)" msgstr "pgr_withPointsKSP(Combinaciones)" -msgid "" -"Modifies the graph to include the points defined in the `Points SQL`_ and " -"using Yen algorithm, finds the :math:`K` shortest paths." -msgstr "" -"Modifica el grafo para incluir los puntos definidos en el `SQL de puntos`_ y " -"utilizando el algoritmo Yen, encuentra las :math:`K` rutas más cortas." +msgid "Modifies the graph to include the points defined in the `Points SQL`_ and using Yen algorithm, finds the :math:`K` shortest paths." +msgstr "Modifica el grafo para incluir los puntos definidos en el `SQL de puntos`_ y utilizando el algoritmo Yen, encuentra las :math:`K` rutas más cortas." #, fuzzy -msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, " -"**K**, [**driving side**], [**options**])" -msgstr "" -"pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, " -"**destino**, **K**, **lado de manejo**, [**opciones**])" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, [**driving side**], [**options**])" +msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destino**, **K**, **lado de manejo**, [**opciones**])" #, fuzzy -msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, " -"**K**, [**driving side**], [**options**])" -msgstr "" -"pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, " -"**destinos**, **K**, **lado de manejo**, [**opciones**])" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, [**driving side**], [**options**])" +msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destinos**, **K**, **lado de manejo**, [**opciones**])" #, fuzzy -msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, " -"**K**, [**driving side**], [**options**])" -msgstr "" -"pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, " -"**destino**, **K**, **lado de manejo**, [**opciones**])" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, [**driving side**], [**options**])" +msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destino**, **K**, **lado de manejo**, [**opciones**])" #, fuzzy -msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, " -"**K**, [**driving side**], [**options**])" -msgstr "" -"pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, " -"**destinos**, **K**, **lado de manejo**, [**opciones**])" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, [**driving side**], [**options**])" +msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destinos**, **K**, **lado de manejo**, [**opciones**])" #, fuzzy -msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, " -"[**driving side**], [**options**])" -msgstr "" -"pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, `SQL de " -"combinaciones`_, **K**, **lado de manejo**, [**opciones**])" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, [**driving side**], [**options**])" +msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, `SQL de combinaciones`_, **K**, **lado de manejo**, [**opciones**])" msgid "**options:** ``[directed, heap_paths, details]``" msgstr "**opciones:** ``[directed, heap_paths, details]``" -msgid "" -"Get 2 paths from Point :math:`1` to point :math:`2` on a directed graph with " -"**left** side driving." -msgstr "" -"Obtener 2 rutas desde el punto :math:`1` al punto :math:`2` en un grafo " -"dirigido con lado de manejo **izquierdo**." +msgid "Get 2 paths from Point :math:`1` to point :math:`2` on a directed graph with **left** side driving." +msgstr "Obtener 2 rutas desde el punto :math:`1` al punto :math:`2` en un grafo dirigido con lado de manejo **izquierdo**." msgid "For a directed graph." msgstr "Para un grafo dirigido." msgid "No details are given about distance of other points of the query." -msgstr "" -"No se proporcionan detalles sobre la distancia de otros puntos de la " -"consulta." +msgstr "No se proporcionan detalles sobre la distancia de otros puntos de la consulta." msgid "No heap paths are returned." msgstr "No se devuelven rutas pre-calculadas." -msgid "" -"Get 2 paths from point :math:`1` to point :math:`3` and vertex :math:`7` on " -"an undirected graph" -msgstr "" -"Obtener 2 rutas desde el punto :math:`1` al punto :math:`3` y al vértice :" -"math:`7` en un grafo no dirigido" +msgid "Get 2 paths from point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" +msgstr "Obtener 2 rutas desde el punto :math:`1` al punto :math:`3` y al vértice :math:`7` en un grafo no dirigido" # | msgid "" # | "From point :math:`1` to vertex :math:`3` with details on a **left** " # | "driving side configuration on a **directed** graph with **details**." -msgid "" -"Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` on a " -"**directed** graph with **right** side driving and **details** set to " -"**True**" -msgstr "" -"Obtener una ruta desde el punto :math:`1` y del vértice :math:`6` al punto :" -"math:`3` en un grafo **dirigido**, con lado de manejo a la **derecha** y con " -"``details`` puesto en ``true``" +msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` on a **directed** graph with **right** side driving and **details** set to **True**" +msgstr "Obtener una ruta desde el punto :math:`1` y del vértice :math:`6` al punto :math:`3` en un grafo **dirigido**, con lado de manejo a la **derecha** y con ``details`` puesto en ``true``" # | msgid "" # | "From point :math:`1` to vertex :math:`3` with details on a **left** " # | "driving side configuration on a **directed** graph with **details**." -msgid "" -"Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` and " -"vertex :math:`1` on a **directed** graph with **left** side driving and " -"**heap_paths** set to **True**" -msgstr "" -"Obtener una ruta desde el punto :math:`1` y el vértice :math:`6` al punto :" -"math:`3` y al vértice :math:`1` en un grafo **dirigido** con lado de manejo " -"**izquierda**, con ``heap_paths`` puesto en ``true``" +msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` on a **directed** graph with **left** side driving and **heap_paths** set to **True**" +msgstr "Obtener una ruta desde el punto :math:`1` y el vértice :math:`6` al punto :math:`3` y al vértice :math:`1` en un grafo **dirigido** con lado de manejo **izquierda**, con ``heap_paths`` puesto en ``true``" msgid "Using a combinations table on an **directed** graph" msgstr "Usando una tabla de combinaciones en un grafo **dirigido**" @@ -18643,137 +13659,67 @@ msgstr "Cantidad de rutas requeridas" msgid "withPointsKSP optional parameters" msgstr "Parámetros opcionales para withPointsKSP" -msgid "" -"Get :math:`2` paths using left side driving topology, from vertex :math:`1` " -"to the closest location on the graph of point `(2.9, 1.8)`." -msgstr "" -"Obtener :math:`2` caminos usando el lado izquierdo de manejo, desde el " -"vértice :math:`1` a la ubicación mpas cercana en el grafo al punto `(2.9, " -"1.8)`." +msgid "Get :math:`2` paths using left side driving topology, from vertex :math:`1` to the closest location on the graph of point `(2.9, 1.8)`." +msgstr "Obtener :math:`2` caminos usando el lado izquierdo de manejo, desde el vértice :math:`1` a la ubicación mpas cercana en el grafo al punto `(2.9, 1.8)`." msgid "Left driving side" msgstr "Lado de manejo izquierdo" -msgid "" -"Get :math:`2` paths using left side driving topology, from point :math:`1` " -"to point :math:`3` with details." -msgstr "" -"Obtener :math:`2` rutas, usando topología de manejo por la izquierda, desde " -"el punto :math:`1` al punto :math:`3`, detallado." +msgid "Get :math:`2` paths using left side driving topology, from point :math:`1` to point :math:`3` with details." +msgstr "Obtener :math:`2` rutas, usando topología de manejo por la izquierda, desde el punto :math:`1` al punto :math:`3`, detallado." msgid "Right driving side" msgstr "Lado de manejo derecho" -msgid "" -"Get :math:`2` paths using right side driving topology from, point :math:`1` " -"to point :math:`2` with heap paths and details." -msgstr "" -"Obtener :math:`2` rutas, usando topología de manejo por la derecha, desde el " -"punto :math:`1` al punto :math:`2`, detallado y con rutas procesadas." +msgid "Get :math:`2` paths using right side driving topology from, point :math:`1` to point :math:`2` with heap paths and details." +msgstr "Obtener :math:`2` rutas, usando topología de manejo por la derecha, desde el punto :math:`1` al punto :math:`2`, detallado y con rutas procesadas." msgid "``pgr_withPointsVia``" msgstr "``pgr_withPointsVia``" -msgid "" -"``pgr_withPointsVia`` - Route that goes through a list of vertices and/or " -"points." -msgstr "" -"``pgr_withPointsVia`` - Ruta que recorre una lista de vértices y/o puntos." +msgid "``pgr_withPointsVia`` - Route that goes through a list of vertices and/or points." +msgstr "``pgr_withPointsVia`` - Ruta que recorre una lista de vértices y/o puntos." -msgid "" -"Given a graph, a set of points on the graphs edges and a list of vertices, " -"this function is equivalent to finding the shortest path between :math:" -"`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or " -"a point on the graph) for all :math:`i < size\\_of(via\\;vertices)`." +msgid "Given a graph, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)`." msgstr "" #, fuzzy -msgid "" -"pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, [**driving " -"side**] [**options**])" -msgstr "" -"pgr_withPointsVia(`SQL de aristas`_, `SQL de puntos`_, ****vértices****, " -"[**opciones**])" +msgid "pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, [**driving side**] [**options**])" +msgstr "pgr_withPointsVia(`SQL de aristas`_, `SQL de puntos`_, ****vértices****, [**opciones**])" -#, fuzzy -msgid "" -"Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that " -"order with right driving side in directed graph.." -msgstr "" -"Encontrar la ruta que visita los vértices :math:`{5, 1, 8\\}` en ese orden " -"en un grafo dirigido." +#, fuzzy +msgid "Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that order with right driving side in directed graph.." +msgstr "Encontrar la ruta que visita los vértices :math:`{5, 1, 8\\}` en ese orden en un grafo dirigido." msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_" msgstr "" -msgid "" -"All this examples are about the route that visits the vertices :math:`\\{-1, " -"7, -3, 16, 15\\}` in that order on a **directed** graph." +msgid "All this examples are about the route that visits the vertices :math:`\\{-1, 7, -3, 16, 15\\}` in that order on a **directed** graph." msgstr "" msgid "Prim - Family of functions" msgstr "Prim - Familia de funciones" -msgid "" -"The prim algorithm was developed in 1930 by Czech mathematician Vojtěch " -"Jarník. It is a greedy algorithm that finds a minimum spanning tree for a " -"weighted undirected graph. This means it finds a subset of the edges that " -"forms a tree that includes every vertex, where the total weight of all the " -"edges in the tree is minimized. The algorithm operates by building this tree " -"one vertex at a time, from an arbitrary starting vertex, at each step adding " -"the cheapest possible connection from the tree to another vertex." -msgstr "" -"El algoritmo prim fue desarrollado en 1930 por el matemático checo Vojtěch " -"Jarník. Es un algoritmo ambicioso que encuentra un árbol de expansión mínimo " -"para un grafo ponderado no dirigido. Esto significa que encuentra un " -"subconjunto de los bordes que forma un árbol que incluye cada vértice, donde " -"se minimiza el peso total de todos los bordes del árbol. El algoritmo " -"funciona creando este árbol un vértice a la vez, desde un vértice inicial " -"arbitrario, paso a paso agregando la conexión más barata posible desde el " -"árbol a otro vértice." +msgid "The prim algorithm was developed in 1930 by Czech mathematician Vojtěch Jarník. It is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. The algorithm operates by building this tree one vertex at a time, from an arbitrary starting vertex, at each step adding the cheapest possible connection from the tree to another vertex." +msgstr "El algoritmo prim fue desarrollado en 1930 por el matemático checo Vojtěch Jarník. Es un algoritmo ambicioso que encuentra un árbol de expansión mínimo para un grafo ponderado no dirigido. Esto significa que encuentra un subconjunto de los bordes que forma un árbol que incluye cada vértice, donde se minimiza el peso total de todos los bordes del árbol. El algoritmo funciona creando este árbol un vértice a la vez, desde un vértice inicial arbitrario, paso a paso agregando la conexión más barata posible desde el árbol a otro vértice." -msgid "" -"This algorithms find the minimum spanning forest in a possibly disconnected " -"graph; in contrast, the most basic form of Prim's algorithm only finds " -"minimum spanning trees in connected graphs. However, running Prim's " -"algorithm separately for each connected component of the graph, then it is " -"called minimum spanning forest." -msgstr "" -"Estos algoritmos encuentran el bosque de expansión mínimo en un grafo " -"posiblemente desconectado; en cambio, la forma más básica del algoritmo de " -"Prim sólo encuentra árboles de expansión mínimos en los grafos conectados. " -"Sin embargo, al ejecutar el algoritmo de Prim por separado para cada " -"componente conectado del grafo, se denomina bosque de expansión mínimo." +msgid "This algorithms find the minimum spanning forest in a possibly disconnected graph; in contrast, the most basic form of Prim's algorithm only finds minimum spanning trees in connected graphs. However, running Prim's algorithm separately for each connected component of the graph, then it is called minimum spanning forest." +msgstr "Estos algoritmos encuentran el bosque de expansión mínimo en un grafo posiblemente desconectado; en cambio, la forma más básica del algoritmo de Prim sólo encuentra árboles de expansión mínimos en los grafos conectados. Sin embargo, al ejecutar el algoritmo de Prim por separado para cada componente conectado del grafo, se denomina bosque de expansión mínimo." -msgid "" -"From boost Graph: \"The algorithm as implemented in Boost.Graph does not " -"produce correct results on graphs with parallel edges.\"" -msgstr "" -"De boost Graph: \"El algoritmo tal como se aplica en el Boost.Graph no " -"produce resultados correctos en grafos con segmentos paralelos.\"" +msgid "From boost Graph: \"The algorithm as implemented in Boost.Graph does not produce correct results on graphs with parallel edges.\"" +msgstr "De boost Graph: \"El algoritmo tal como se aplica en el Boost.Graph no produce resultados correctos en grafos con segmentos paralelos.\"" -msgid "" -"Boost: `Prim's algorithm `__" -msgstr "" -"Boost: `Algoritmo de Prim `__" +msgid "Boost: `Prim's algorithm `__" +msgstr "Boost: `Algoritmo de Prim `__" -msgid "" -"Wikipedia: `Prim's algorithm `__" -msgstr "" -"Wikipedia: `Algoritmo de Prim `__" +msgid "Wikipedia: `Prim's algorithm `__" +msgstr "Wikipedia: `Algoritmo de Prim `__" msgid "Proposed Functions" msgstr "Funciones propuestas" -msgid "" -":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." -msgstr "" -":doc:`pgr_lineGraph` - Algoritmo de transformación para generar un grafo de " -"líneas." +msgid ":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." +msgstr ":doc:`pgr_lineGraph` - Algoritmo de transformación para generar un grafo de líneas." msgid "Reference" msgstr "Referencia" @@ -18781,12 +13727,8 @@ msgstr "Referencia" msgid "Release Notes" msgstr "Notas de versión" -msgid "" -"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 "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 "" @@ -18797,9 +13739,21 @@ msgstr "pgRouting 4" msgid "Minors 4.x" msgstr "" -msgid "pgRouting 4.0" +#, fuzzy +msgid "pgRouting 4.1" msgstr "pgRouting 4.0" +#, fuzzy +msgid "pgRouting 4.1.0 Release Notes" +msgstr "Notas de la Versión pgRouting 3.1.0" + +#, fuzzy +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.1.0 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `Github milestone for 4.0.0 `__" + +msgid "No changes yet" +msgstr "" + msgid "pgRouting 3" msgstr "pgRouting 3" @@ -18813,14 +13767,8 @@ msgid "pgRouting 3.8.0 Release Notes" msgstr "Notas de la versión de pgRouting 3.8.0" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.8.0 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.8.0 `_" +msgid "To see all issues & pull requests closed by this release see the `Github 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." @@ -18830,44 +13778,27 @@ msgid "Metric" msgstr "Métricas" #, fuzzy -msgid "" -"`#2760 `__: Promoted to " -"official pgr_degree in version 3.8" -msgstr "" -"`#2760 `__: pgr_degree" +msgid "`#2760 `__: Promoted to official pgr_degree in version 3.8" +msgstr "`#2760 `__: pgr_degree" msgid "Utilities" msgstr "Utilidades" #, fuzzy -msgid "" -"`#2772 `__: Promoted to " -"official pgr_extractVertices in version 3.8" -msgstr "" -"`#2772 `__: " -"pgr_extractVertices" +msgid "`#2772 `__: Promoted to official pgr_extractVertices in version 3.8" +msgstr "`#2772 `__: pgr_extractVertices" #, fuzzy -msgid "" -"`#2774 `__: Promoted to " -"official pgr_findCloseEdges in version 3.8" -msgstr "" -"`#2774 `__: " -"pgr_findCloseEdges" +msgid "`#2774 `__: Promoted to official pgr_findCloseEdges in version 3.8" +msgstr "`#2774 `__: pgr_findCloseEdges" #, fuzzy -msgid "" -"`#2873 `__: Promoted to " -"official pgr_separateCrossing in version 3.8" -msgstr "" -"`#2760 `__: pgr_degree" +msgid "`#2873 `__: Promoted to official pgr_separateCrossing in version 3.8" +msgstr "`#2760 `__: pgr_degree" #, fuzzy -msgid "" -"`#2874 `__: Promoted to " -"official pgr_separateTouching in version 3.8" -msgstr "" -"`#2760 `__: pgr_degree" +msgid "`#2874 `__: Promoted to official pgr_separateTouching in version 3.8" +msgstr "`#2760 `__: pgr_degree" #, fuzzy msgid "Proposed functions" @@ -18877,64 +13808,38 @@ msgid "Contraction" msgstr "Contracción" #, fuzzy -msgid "" -"`#2790 `__: " -"pgr_contractionDeadEnd new contraction function" -msgstr "" -"`#2790 `__: " -"pgr_contractionDeadEnd" +msgid "`#2790 `__: pgr_contractionDeadEnd new contraction function" +msgstr "`#2790 `__: pgr_contractionDeadEnd" #, fuzzy -msgid "" -"`#2791 `__: " -"pgr_contractionLinear new contraction function" -msgstr "" -"`#2791 `__: " -"pgr_contractionLinear" +msgid "`#2791 `__: pgr_contractionLinear new contraction function" +msgstr "`#2791 `__: pgr_contractionLinear" #, fuzzy -msgid "" -"`#2536 `__: Support for " -"contraction hierarchies (pgr_contractionHierarchies)" -msgstr "" -"`#2791 `__: " -"pgr_contractionLinear" +msgid "`#2536 `__: Support for contraction hierarchies (pgr_contractionHierarchies)" +msgstr "`#2791 `__: pgr_contractionLinear" #, fuzzy -msgid "" -"`#2848 `__: Create " -"pgr_separateCrossing new utility function" -msgstr "" -"`#2760 `__: pgr_degree" +msgid "`#2848 `__: Create pgr_separateCrossing new utility function" +msgstr "`#2760 `__: pgr_degree" #, fuzzy -msgid "" -"`#2849 `__: Create of " -"pgr_separateTouching new utility function" -msgstr "" -"`#2760 `__: pgr_degree" +msgid "`#2849 `__: Create of pgr_separateTouching new utility function" +msgstr "`#2760 `__: pgr_degree" msgid "Official functions changes" msgstr "Cambios en las funciones oficiales" #, fuzzy -msgid "" -"`#2786 `__: " -"pgr_contraction(edges) new signature" -msgstr "" -"`#2786 `__: " -"pgr_contraction" +msgid "`#2786 `__: pgr_contraction(edges) new signature" +msgstr "`#2786 `__: pgr_contraction" msgid "C/C++ code enhancements" msgstr "Mejora de código C/C++" #, fuzzy -msgid "" -"`#2802 `__: Code " -"reorganization on pgr_contraction" -msgstr "" -"`#2786 `__: " -"pgr_contraction" +msgid "`#2802 `__: Code reorganization on pgr_contraction" +msgstr "`#2786 `__: pgr_contraction" msgid "Other enhancements:" msgstr "Otras mejoras:" @@ -18946,54 +13851,31 @@ msgid "SQL code enhancements" msgstr "Mejora del código SQL" #, fuzzy -msgid "" -"`#2850 `__: Rewrite " -"pgr_nodeNetwork" -msgstr "" -"`#2760 `__: pgr_degree" +msgid "`#2850 `__: Rewrite pgr_nodeNetwork" +msgstr "`#2760 `__: pgr_degree" msgid "Deprecation of SQL functions" msgstr "Funciones obsoletas SQL" #, fuzzy -msgid "" -"`#2749 `__: Deprecate " -"pgr_AlphaShape in 3.8" -msgstr "" -"`#2754 `__: " -"pgr_analyzeOneWay" +msgid "`#2749 `__: Deprecate pgr_AlphaShape in 3.8" +msgstr "`#2754 `__: pgr_analyzeOneWay" #, fuzzy -msgid "" -"`#2750 `__: Deprecate " -"pgr_CreateTopology in 3.8" -msgstr "" -"`#2750 `__: " -"pgr_createTopology" +msgid "`#2750 `__: Deprecate pgr_CreateTopology in 3.8" +msgstr "`#2750 `__: pgr_createTopology" #, fuzzy -msgid "" -"`#2753 `__: Deprecate " -"pgr_analyzeGraph in 3.8" -msgstr "" -"`#2753 `__: " -"pgr_analyzeGraph" +msgid "`#2753 `__: Deprecate pgr_analyzeGraph in 3.8" +msgstr "`#2753 `__: pgr_analyzeGraph" #, fuzzy -msgid "" -"`#2754 `__: Deprecate " -"pgr_analyzeOneWay in 3.8" -msgstr "" -"`#2754 `__: " -"pgr_analyzeOneWay" +msgid "`#2754 `__: Deprecate pgr_analyzeOneWay in 3.8" +msgstr "`#2754 `__: pgr_analyzeOneWay" #, fuzzy -msgid "" -"`#2826 `__: Deprecate " -"pgr_createVerticesTable in 3.8" -msgstr "" -"`#2826 `__: " -"pgr_createVerticesTable" +msgid "`#2826 `__: Deprecate pgr_createVerticesTable in 3.8" +msgstr "`#2826 `__: pgr_createVerticesTable" msgid "In the deprecated functions:" msgstr "En las funciones obsoletas:" @@ -19012,43 +13894,23 @@ msgid "pgRouting 3.7.3 Release Notes" msgstr "Notas de la versión de pgRouting 3.7.3" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.7.3 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.7.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github 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 `__" #, fuzzy -msgid "" -"`#2731 `__: Build " -"Failure on Ubuntu 22" -msgstr "" -"`#2731 `__ Construcción " -"falla en Ubuntu 22" +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" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"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 "To see all issues & pull requests closed by this release see the `Github 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 `__" #, fuzzy -msgid "" -"`#2713 `__: cmake " -"missing some policies and min version" -msgstr "" -"`#2713 `__ cmake le falta " -"algunas políticas y versión minima" +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 "" @@ -19057,49 +13919,27 @@ msgid "Minimum cmake version 3.12" msgstr "" #, fuzzy -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 "`#2707 `__: Build failure in pgRouting 3.7.1 on Alpine" +msgstr "`#2707 `__ Falla de construcción en Alpine para pgRouting 3.7.1" #, fuzzy -msgid "" -"`#2706 `__: winnie " -"crashing on pgr_betweennessCentrality" -msgstr "" -"`#2706 `__ winnie falla en " -"pgr_betweennessCentrality" +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" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"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 "To see all issues & pull requests closed by this release see the `Github 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 `__" #, fuzzy -msgid "" -"`#2680 `__: fails to " -"compile under mingw64 gcc 13.2" -msgstr "" -"`#2680 `__ Compilación " -"falla bajo mingw64 gcc 13.2" +msgid "`#2680 `__: fails to compile under mingw64 gcc 13.2" +msgstr "`#2680 `__ Compilación falla bajo mingw64 gcc 13.2" #, fuzzy -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 "`#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++" @@ -19111,25 +13951,15 @@ msgid "pgRouting 3.7.0 Release Notes" msgstr "Notas de la versión de pgRouting 3.7.0" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.7.0 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.7.0 `_" +msgid "To see all issues & pull requests closed by this release see the `Github 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" #, fuzzy -msgid "" -"`#2656 `__: Stop support " -"of PostgreSQL12 on pgrouting v3.7" -msgstr "" -"`#2656 `__ PostgreSQL 12 " -"no se apya en pgrouting v3.7" +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" @@ -19141,12 +13971,8 @@ msgid "pgr_betweennessCentrality" msgstr "pgr_betweennessCentrality" #, fuzzy -msgid "" -"`#2605 `__: Standardize " -"spanning tree functions output" -msgstr "" -"`#2605 `__ Estandarización " -"de resultados de las funciones de árbol de expansión" +msgid "`#2605 `__: Standardize spanning tree functions output" +msgstr "`#2605 `__ Estandarización de resultados de las funciones de árbol de expansión" msgid "Functions:" msgstr "Funciones:" @@ -19155,12 +13981,8 @@ msgid "Experimental promoted to proposed." msgstr "Experimental promovido a propuesto." #, fuzzy -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 "`#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 "``pgr_lineGraph``" msgstr "``pgr_lineGraph``" @@ -19169,28 +13991,16 @@ msgid "Code enhancement" msgstr "Mejora del código" #, fuzzy -msgid "" -"`#2599 `__: Driving " -"distance cleanup" -msgstr "" -"`#2599 `__ Limpieza de la " -"distancia de conducción" +msgid "`#2599 `__: Driving distance cleanup" +msgstr "`#2599 `__ Limpieza de la distancia de conducción" #, fuzzy -msgid "" -"`#2607 `__: Read " -"postgresql data on C++" -msgstr "" -"`#2607 `__ Leer datos " -"postgresql en C++" +msgid "`#2607 `__: Read postgresql data on C++" +msgstr "`#2607 `__ Leer datos postgresql en C++" #, fuzzy -msgid "" -"`#2614 `__: Clang tidy " -"does not work" -msgstr "" -"`#2614 `__ Clang tidy no " -"funciona" +msgid "`#2614 `__: Clang tidy does not work" +msgstr "`#2614 `__ Clang tidy no funciona" msgid "pgRouting 3.6" msgstr "pgRouting 3.6" @@ -19199,14 +14009,8 @@ msgid "pgRouting 3.6.3 Release Notes" msgstr "Notas de la versión de pgRouting 3.6.3" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.6.3 `__" -msgstr "" -"Para ver todas las incidencias y pull requests cerrados por esta versión, " -"consulte `Git closed milestone for 3.6.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.3 `__" +msgstr "Para ver todas las incidencias y pull requests cerrados por esta versión, consulte `Git closed milestone for 3.6.3 `__" msgid "Explicit minimum requirements:" msgstr "" @@ -19235,9 +14039,7 @@ msgstr "Pruebas CI" msgid "Add a clang tidy test on changed files." msgstr "" -msgid "" -"Update test not done on versions: 3.0.1, 3.0.2, 3.0.3, 3.0.4, 3.1.0, 3.1.1, " -"3.1.2" +msgid "Update test not done on versions: 3.0.1, 3.0.2, 3.0.3, 3.0.4, 3.1.0, 3.1.1, 3.1.2" msgstr "" msgid "Documentation" @@ -19259,14 +14061,8 @@ msgid "pgRouting 3.6.2 Release Notes" msgstr "Notas de la versión de pgRouting 3.6.2" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.6.2 `__" -msgstr "" -"Para ver todas las incidencias y pull requests cerrados por esta versión, " -"consulte `Git closed milestone for 3.6.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.2 `__" +msgstr "Para ver todas las incidencias y pull requests cerrados por esta versión, consulte `Git closed milestone for 3.6.2 `__" msgid "Upgrade fix" msgstr "" @@ -19290,162 +14086,89 @@ msgid "pgRouting 3.6.1 Release Notes" msgstr "Notas de la versión 3.6.1 de pgRouting" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.6.1 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.6.1 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.1 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.6.1 `_" #, fuzzy -msgid "" -"`#2588 `__: pgrouting " -"3.6.0 fails to build on OSX" -msgstr "" -"`#2588 `__ pgrouting 3.6.0 " -"no construye en OSX" +msgid "`#2588 `__: pgrouting 3.6.0 fails to build on OSX" +msgstr "`#2588 `__ pgrouting 3.6.0 no construye en OSX" msgid "pgRouting 3.6.0 Release Notes" msgstr "Notas de la versión 3.6.0 de pgRouting" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.6.0 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.6.0 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.0 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.6.0 `_" #, fuzzy -msgid "" -"`#2516 `__: Standardize " -"output pgr_aStar" -msgstr "" -"`#2516 `__ Estandarización " -"de resultados de pgr_aStar" +msgid "`#2516 `__: Standardize output pgr_aStar" +msgstr "`#2516 `__ Estandarización de resultados de pgr_aStar" msgid "Standardize output columns to |short-generic-result|" msgstr "Estandard de las columnas de salida a |short-generic-result|" #, fuzzy -msgid "" -"`#2523 `__: Standardize " -"output pgr_bdAstar" -msgstr "" -"`#2523 `__ Estandarización " -"de resultados de pgr_bdAstar" +msgid "`#2523 `__: Standardize output pgr_bdAstar" +msgstr "`#2523 `__ Estandarización de resultados de pgr_bdAstar" #, fuzzy -msgid "" -"`#2547 `__: Standardize " -"output and modifying signature pgr_KSP" -msgstr "" -"`#2547 `__ Estandarización " -"de resultados y modificación de firmas de pgr_KSP" +msgid "`#2547 `__: Standardize output and modifying signature pgr_KSP" +msgstr "`#2547 `__ Estandarización de resultados y modificación de firmas de pgr_KSP" #, fuzzy -msgid "" -"`#2548 `__: Standardize " -"output pgr_drivingDistance" -msgstr "" -"`#2548 `__ Estandarización " -"de resultados de pgr_drivingDistance" +msgid "`#2548 `__: Standardize output pgr_drivingDistance" +msgstr "`#2548 `__ Estandarización de resultados de pgr_drivingDistance" msgid "Proposed functions changes" msgstr "Cambios en funciones propuestas" #, fuzzy -msgid "" -"`#2544 `__: Standardize " -"output and modifying signature pgr_withPointsDD" -msgstr "" -"`#2544 `__ Estandarización " -"de resultados y modificación de firmas de pgr_withPointsDD" +msgid "`#2544 `__: Standardize output and modifying signature pgr_withPointsDD" +msgstr "`#2544 `__ Estandarización de resultados y modificación de firmas de pgr_withPointsDD" #, fuzzy -msgid "" -"`#2546 `__: Standardize " -"output and modifying signature pgr_withPointsKSP" -msgstr "" -"`#2546 `__ Estandarización " -"de resultados y modificación de firmas de pgr_withPointsKSP" +msgid "`#2546 `__: Standardize output and modifying signature pgr_withPointsKSP" +msgstr "`#2546 `__ Estandarización de resultados y modificación de firmas de pgr_withPointsKSP" #, fuzzy -msgid "" -"`#2504 `__: To C++ pg " -"data get, fetch and check." -msgstr "" -"`#2504 `__ A C++ pg data " -"obtener, cachar y checar." +msgid "`#2504 `__: To C++ pg data get, fetch and check." +msgstr "`#2504 `__ A C++ pg data obtener, cachar y checar." msgid "Stopping support for compilation with MSVC." msgstr "" #, fuzzy -msgid "" -"`#2505 `__: Using " -"namespace." -msgstr "" -"`#2505 `__ Usando " -"namespace." +msgid "`#2505 `__: Using namespace." +msgstr "`#2505 `__ Usando namespace." #, fuzzy -msgid "" -"`#2512 `__: [Dijkstra] " -"Removing duplicate code on Dijkstra." -msgstr "" -"`#2512 `__ [Dijkstra] " -"Elimiar código duplicado en Dijkstra." +msgid "`#2512 `__: [Dijkstra] Removing duplicate code on Dijkstra." +msgstr "`#2512 `__ [Dijkstra] Elimiar código duplicado en Dijkstra." #, fuzzy -msgid "" -"`#2517 `__: Astar code " -"simplification." -msgstr "" -"`#2517 `__ Simplificación " -"del código de Astar." +msgid "`#2517 `__: Astar code simplification." +msgstr "`#2517 `__ Simplificación del código de Astar." #, fuzzy -msgid "" -"`#2521 `__: Dijkstra " -"code simplification." -msgstr "" -"`#2521 `__ Simplificación " -"del código de Dijkstra." +msgid "`#2521 `__: Dijkstra code simplification." +msgstr "`#2521 `__ Simplificación del código de Dijkstra." #, fuzzy -msgid "" -"`#2522 `__: bdAstar code " -"simplification." -msgstr "" -"`#2522 `__ Simplificación " -"del código de bdAstar." +msgid "`#2522 `__: bdAstar code simplification." +msgstr "`#2522 `__ Simplificación del código de bdAstar." #, fuzzy -msgid "" -"`#2490 `__: Automatic " -"page history links." -msgstr "" -"`#2490 `__ Lígas " -"automáticas historiales." +msgid "`#2490 `__: Automatic page history links." +msgstr "`#2490 `__ Lígas automáticas historiales." msgid "..rubric:: Standardize SQL" msgstr "" #, fuzzy -msgid "" -"`#2555 `__: Standardize " -"deprecated messages" -msgstr "" -"`#2555 `__ Estandarización " -"de mensajes de depreciación" +msgid "`#2555 `__: Standardize deprecated messages" +msgstr "`#2555 `__ Estandarización de mensajes de depreciación" -msgid "" -"On new internal function: do not use named parameters and default parameters." +msgid "On new internal function: do not use named parameters and default parameters." msgstr "" msgid "pgRouting 3.5" @@ -19455,14 +14178,8 @@ msgid "pgRouting 3.5.1 Release Notes" msgstr "Notas de la versión 3.5.1 de pgRouting" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.5.1 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.5.1 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.5.1 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.5.1 `_" msgid "Documentation fixes" msgstr "Arreglos a la documentación" @@ -19486,31 +14203,19 @@ msgid "Issue fixes" msgstr "Corrección de problema" #, fuzzy -msgid "" -"`#2565 `__: " -"pgr_lengauerTarjanDominatorTree triggers an assertion" -msgstr "" -"`#2565 `__ " -"pgr_lengauerTarjanDominatorTree genera un error de afirmación" +msgid "`#2565 `__: pgr_lengauerTarjanDominatorTree triggers an assertion" +msgstr "`#2565 `__ pgr_lengauerTarjanDominatorTree genera un error de afirmación" msgid "SQL enhancements" msgstr "Mejoras SQL" #, fuzzy -msgid "" -"`#2561 `__: Not use " -"wildcards on SQL" -msgstr "" -"`#2561 `__ No usar " -"comodines en SQL" +msgid "`#2561 `__: Not use wildcards on SQL" +msgstr "`#2561 `__ No usar comodines en SQL" #, fuzzy -msgid "" -"`#2559 `__: pgtap test " -"using sampledata" -msgstr "" -"`#2559 `__ pruebas pgtap " -"test usando datos muestra" +msgid "`#2559 `__: pgtap test using sampledata" +msgstr "`#2559 `__ pruebas pgtap test usando datos muestra" msgid "Build fixes" msgstr "Correcciones de construcción" @@ -19528,14 +14233,8 @@ msgid "pgRouting 3.5.0 Release Notes" msgstr "Notas de la versión 3.5.0 de pgRouting" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.5.0 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.5.0 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.5.0 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.5.0 `_" msgid "Dijkstra" msgstr "Dijkstra" @@ -19547,74 +14246,36 @@ msgid "pgRouting 3.4.2 Release Notes" msgstr "Notas de la versión 3.4.2 de pgRouting" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.4.2 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para esta " -"versión, consulte la `meta cerrada 3.4.2 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.4.2 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para esta versión, consulte la `meta cerrada 3.4.2 `_" -msgid "" -"`#2394 `__: pgr_bdAstar " -"accumulates heuristic cost in visited node cost." -msgstr "" -"`#2394 `__: pgr_bdAstar " -"acumulata el costo de la heuristic en el costo del nodo visitado." +msgid "`#2394 `__: pgr_bdAstar accumulates heuristic cost in visited node cost." +msgstr "`#2394 `__: pgr_bdAstar acumulata el costo de la heuristic en el costo del nodo visitado." -msgid "" -"`#2427 `__: " -"pgr_createVerticesTable & pgr_createTopology, variable should be of type " -"Record." -msgstr "" -"`#2427 `__: " -"pgr_createVerticesTable & pgr_createTopology, variable debe ser de tipo " -"Record." +msgid "`#2427 `__: pgr_createVerticesTable & pgr_createTopology, variable should be of type Record." +msgstr "`#2427 `__: pgr_createVerticesTable & pgr_createTopology, variable debe ser de tipo Record." msgid "pgRouting 3.4.1 Release Notes" msgstr "Notas de la versión 3.4.1 de pgRouting" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.4.1 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados pora ésta " -"versión, consulte la `meta cerrada 3.4.1 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.4.1 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados pora ésta versión, consulte la `meta cerrada 3.4.1 `_" -msgid "" -"`#2401 `__: pgRouting " -"3.4.0 do not build docs when sphinx is too low or missing" -msgstr "" -"`#2401 `__: pgRouting " -"3.4.0 no construye la documentación cuando Sphinx es muy bajo o falta" +msgid "`#2401 `__: pgRouting 3.4.0 do not build docs when sphinx is too low or missing" +msgstr "`#2401 `__: pgRouting 3.4.0 no construye la documentación cuando Sphinx es muy bajo o falta" -msgid "" -"`#2398 `__: v3.4.0 does " -"not upgrade from 3.3.3" -msgstr "" -"`#2398 `__: v3.4.0 does " -"no actualiza desde 3.3.3" +msgid "`#2398 `__: v3.4.0 does not upgrade from 3.3.3" +msgstr "`#2398 `__: v3.4.0 does no actualiza desde 3.3.3" msgid "pgRouting 3.4.0 Release Notes" msgstr "Notas de la versión 3.4.0 de pgRouting" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.4.0 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.3.0 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.4.0 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.3.0 `_" -msgid "" -"`#1891 `__: pgr_ksp " -"doesn't give all correct shortest path" +msgid "`#1891 `__: pgr_ksp doesn't give all correct shortest path" msgstr "" msgid "New proposed functions." @@ -19696,67 +14357,35 @@ msgid "pgRouting 3.3.5 Release Notes" msgstr "Notas de la versión 3.3.5 de pgRouting" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.5 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados pora ésta " -"versión, consulte la `meta cerrada de 3.3.4 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.5 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados pora ésta versión, consulte la `meta cerrada de 3.3.4 `_" msgid "pgRouting 3.3.4 Release Notes" msgstr "Notas de la versión 3.3.4 de pgRouting" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.4 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados pora ésta " -"versión, consulte la `meta cerrada de 3.3.4 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.4 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados pora ésta versión, consulte la `meta cerrada de 3.3.4 `_" -msgid "" -"`#2400 `__: pgRouting " -"3.3.3 does not build in focal" -msgstr "" -"`#2400 `__: pgRouting " -"3.3.3 no es construido en focal" +msgid "`#2400 `__: pgRouting 3.3.3 does not build in focal" +msgstr "`#2400 `__: pgRouting 3.3.3 no es construido en focal" msgid "pgRouting 3.3.3 Release Notes" msgstr "Notas de la versión 3.3.3 de pgRouting" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.3 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados pora ésta " -"versión, consulte la `meta cerrada 3.3.3 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.3 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados pora ésta versión, consulte la `meta cerrada 3.3.3 `_" -msgid "" -"Ignoring optional boolean parameter, as the algorithm works only for " -"undirected graphs." -msgstr "" -"Ignorando el parametro opcional boleano, ya que el algortítmo trabaja solo " -"para grafos dirigidos." +msgid "Ignoring optional boolean parameter, as the algorithm works only for undirected graphs." +msgstr "Ignorando el parametro opcional boleano, ya que el algortítmo trabaja solo para grafos dirigidos." msgid "pgRouting 3.3.2 Release Notes" msgstr "Notas de la versión 3.3.2 de pgRouting" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.2 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados pora ésta " -"versión, consulte la `meta cerrada de 3.3.2 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.2 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados pora ésta versión, consulte la `meta cerrada de 3.3.2 `_" msgid "Revised documentation" msgstr "" @@ -19788,93 +14417,49 @@ msgstr "" msgid "Restructure of the pgRouting concepts page." msgstr "" -msgid "" -"`#2276 `__: " -"edgeDisjointPaths issues with start_vid and combinations" +msgid "`#2276 `__: edgeDisjointPaths issues with start_vid and combinations" msgstr "" -msgid "" -"`#2312 `__: " -"pgr_extractVertices error when target is not BIGINT" +msgid "`#2312 `__: pgr_extractVertices error when target is not BIGINT" msgstr "" -msgid "" -"`#2357 `__: Apply clang-" -"tidy performance-*" -msgstr "" -"`#2357 `__: Aplicar " -"clang-tidy performance-*" +msgid "`#2357 `__: Apply clang-tidy performance-*" +msgstr "`#2357 `__: Aplicar clang-tidy performance-*" msgid "pgRouting 3.3.1 Release Notes" msgstr "Notas de la versión 3.3.1 de pgRouting" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.1 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.7.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.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 "" -"`#2216 `__: Warnings " -"when using clang" +msgid "`#2216 `__: Warnings when using clang" msgstr "" -msgid "" -"`#2266 `__: Error " -"processing restrictions" +msgid "`#2266 `__: Error processing restrictions" msgstr "" msgid "pgRouting 3.3.0 Release Notes" msgstr "Notas de la versión 3.3.0 de pgRouting" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.0 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.8.0 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.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 "" -"`#2057 `__: trspViaEdges " -"columns in different order" -msgstr "" -"`#2057 `__: columnas " -"trspViaEdges en orden diferente" +msgid "`#2057 `__: trspViaEdges columns in different order" +msgstr "`#2057 `__: columnas trspViaEdges en orden diferente" -msgid "" -"`#2087 `__: " -"pgr_extractVertices to proposed" -msgstr "" -"`#2087 `__: " -"pgr_extractVertices a propuesto" +msgid "`#2087 `__: pgr_extractVertices to proposed" +msgstr "`#2087 `__: pgr_extractVertices a propuesto" -msgid "" -"`#2201 `__: " -"pgr_depthFirstSearch to proposed" -msgstr "" -"`#2201 `__: " -"pgr_depthFirstSearch a propuesto" +msgid "`#2201 `__: pgr_depthFirstSearch to proposed" +msgstr "`#2201 `__: pgr_depthFirstSearch a propuesto" -msgid "" -"`#2202 `__: " -"pgr_sequentialVertexColoring to proposed" -msgstr "" -"`#2202 `__: " -"pgr_sequentialVertexColoring a propuesto" +msgid "`#2202 `__: pgr_sequentialVertexColoring to proposed" +msgstr "`#2202 `__: pgr_sequentialVertexColoring a propuesto" -msgid "" -"`#2203 `__: " -"pgr_dijkstraNear and pgr_dijkstraNearCost to proposed" -msgstr "" -"`#2203 `__: " -"pgr_dijkstraNear y pgr_dijkstraNearCost a propuesto" +msgid "`#2203 `__: pgr_dijkstraNear and pgr_dijkstraNearCost to proposed" +msgstr "`#2203 `__: pgr_dijkstraNear y pgr_dijkstraNearCost a propuesto" msgid "Coloring" msgstr "Coloreo" @@ -19925,83 +14510,43 @@ msgid "pgRouting 3.2.2 Release Notes" msgstr "Notas de la Versión 3.2.2 de pgRouting" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.2.2 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.7.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.2.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 "" -"`#2093 `__: Compilation " -"on Visual Studio" -msgstr "" -"`#2093 `__: Compilación " -"con Visual Studio" +msgid "`#2093 `__: Compilation on Visual Studio" +msgstr "`#2093 `__: Compilación con Visual Studio" -msgid "" -"`#2189 `__: Build error " -"on RHEL 7" -msgstr "" -"`#2189 `__: Error de " -"compilación en RHEL 7" +msgid "`#2189 `__: Build error on RHEL 7" +msgstr "`#2189 `__: Error de compilación en RHEL 7" msgid "pgRouting 3.2.1 Release Notes" msgstr "Notas de la Versión 3.2.1 de pgRouting" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.2.1 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.7.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.2.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 "" -"`#1883 `__: " -"pgr_TSPEuclidean crashes connection on Windows" -msgstr "" -"`#1883 `__: " -"pgr_TSPEuclidean termina la conexión en Windows" +msgid "`#1883 `__: pgr_TSPEuclidean crashes connection on Windows" +msgstr "`#1883 `__: pgr_TSPEuclidean termina la conexión en Windows" msgid "The solution is to use Boost::graph::metric_tsp_approx" msgstr "La solución es usar Boost::graph::metric_tsp_approx" -msgid "" -"To not break user's code the optional parameters related to the TSP " -"Annaeling are ignored" -msgstr "" -"Para no romper el código del usuario, se ignoran los parámetros opcionales " -"relacionados con el algoritmo de recocido de TSP" +msgid "To not break user's code the optional parameters related to the TSP Annaeling are ignored" +msgstr "Para no romper el código del usuario, se ignoran los parámetros opcionales relacionados con el algoritmo de recocido de TSP" msgid "The function with the annaeling optional parameters is deprecated" -msgstr "" -"La función con los parámetros opcionales del algoritmo de recocido pasan a " -"ser obseltos" +msgstr "La función con los parámetros opcionales del algoritmo de recocido pasan a ser obseltos" msgid "pgRouting 3.2.0 Release Notes" msgstr "Notas del Lanzamiento de pgRouting 3.2.0" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.2.0 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.8.0 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.2.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 "" -"`#1850 `__: Change Boost " -"min version to 1.56" -msgstr "" -"`#1850 `__: Cambie la " -"versión mínima de Boost a 1.56" +msgid "`#1850 `__: Change Boost min version to 1.56" +msgstr "`#1850 `__: Cambie la versión mínima de Boost a 1.56" msgid "Removing support for Boost v1.53, v1.54 & v1.55" msgstr "Eliminación de soporte para Boost v1.53, v1.54 & v1.55" @@ -20034,14 +14579,8 @@ msgid "pgRouting 3.1.4 Release Notes" msgstr "Notas de la Versión 3.1.4 de pgRouting" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.1.4 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados pora ésta " -"versión, consulte la `meta cerrada de 3.3.4 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.4 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados pora ésta versión, consulte la `meta cerrada de 3.3.4 `_" msgid "Issues fixes" msgstr "Corrección de problemas" @@ -20050,146 +14589,68 @@ msgid "pgRouting 3.1.3 Release Notes" msgstr "pgRouting 3.1.3 Notas de la Versión" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.1.3 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.7.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.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 "" -"`#1825 `__: Boost " -"versions are not honored" -msgstr "" -"`#1825 `__: No se " -"respetan las versiones Boost" +msgid "`#1825 `__: Boost versions are not honored" +msgstr "`#1825 `__: No se respetan las versiones Boost" -msgid "" -"`#1849 `__: Boost 1.75.0 " -"geometry \"point_xy.hpp\" build error on macOS environment" -msgstr "" -"`#1849 `__: Aumente el " -"error de compilación \"point_xy.hpp\" de la geometría 1.75.0 en el entorno " -"macOS" +msgid "`#1849 `__: Boost 1.75.0 geometry \"point_xy.hpp\" build error on macOS environment" +msgstr "`#1849 `__: Aumente el error de compilación \"point_xy.hpp\" de la geometría 1.75.0 en el entorno macOS" -msgid "" -"`#1861 `__: vrp " -"functions crash server" -msgstr "" -"`#1861 `__:servidor de " -"fallas de funciones vrp" +msgid "`#1861 `__: vrp functions crash server" +msgstr "`#1861 `__:servidor de fallas de funciones vrp" msgid "pgRouting 3.1.2 Release Notes" msgstr "Notas de la Versión pgRouting 3.1.2" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.1.2 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.7.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.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 "" -"`#1304 `__: FreeBSD 12 " -"64-bit crashes on pgr_vrOneDepot tests Experimental Function" -msgstr "" -"`#1304 `__: FreeBSD 12 " -"de 64 bits falla en pgr_vrOneDepot prueba la función experimental" +msgid "`#1304 `__: FreeBSD 12 64-bit crashes on pgr_vrOneDepot tests Experimental Function" +msgstr "`#1304 `__: FreeBSD 12 de 64 bits falla en pgr_vrOneDepot prueba la función experimental" -msgid "" -"`#1356 `__: tools/" -"testers/pg_prove_tests.sh fails when PostgreSQL port is not passed" -msgstr "" -"`#1356 `__: tools/" -"testers/pg_prove_tests.sh falla cuando no pasa el puerto PostgreSQL" +msgid "`#1356 `__: tools/testers/pg_prove_tests.sh fails when PostgreSQL port is not passed" +msgstr "`#1356 `__: tools/testers/pg_prove_tests.sh falla cuando no pasa el puerto PostgreSQL" -msgid "" -"`#1725 `__: Server crash " -"on pgr_pickDeliver and pgr_vrpOneDepot on openbsd" -msgstr "" -"`#1725 `__: El servidor " -"falla en pgr_pickDeliver y pgr_vrpOneDepot en openbsd" +msgid "`#1725 `__: Server crash on pgr_pickDeliver and pgr_vrpOneDepot on openbsd" +msgstr "`#1725 `__: El servidor falla en pgr_pickDeliver y pgr_vrpOneDepot en openbsd" -msgid "" -"`#1760 `__: TSP server " -"crash on ubuntu 20.04 #1760" -msgstr "" -"`#1760 `__: el servidor " -"TSP cae en ubuntu 20.04 #1760" +msgid "`#1760 `__: TSP server crash on ubuntu 20.04 #1760" +msgstr "`#1760 `__: el servidor TSP cae en ubuntu 20.04 #1760" -msgid "" -"`#1770 `__: Remove " -"warnings when using clang compiler" -msgstr "" -"`#1770 `__: Eliminar " -"advertencias cuando se utiliza el compilador clang" +msgid "`#1770 `__: Remove warnings when using clang compiler" +msgstr "`#1770 `__: Eliminar advertencias cuando se utiliza el compilador clang" msgid "pgRouting 3.1.1 Release Notes" msgstr "pgRouting 3.1.1 Notas de la Versión" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.1.1 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.7.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.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 "" -"`#1733 `__: pgr_bdAstar " -"fails when source or target vertex does not exist in the graph" -msgstr "" -"`#1733 `__: pgr_bdAstar " -"falla cuando el vértice de origen o de destino no existe en el gráfico" +msgid "`#1733 `__: pgr_bdAstar fails when source or target vertex does not exist in the graph" +msgstr "`#1733 `__: pgr_bdAstar falla cuando el vértice de origen o de destino no existe en el gráfico" -msgid "" -"`#1647 `__: Linear " -"Contraction contracts self loops" -msgstr "" -"`#1647 `__: La " -"Contracción Lineal contrae bucles propios" +msgid "`#1647 `__: Linear Contraction contracts self loops" +msgstr "`#1647 `__: La Contracción Lineal contrae bucles propios" -msgid "" -"`#1640 `__: " -"pgr_withPoints fails when points_sql is empty" -msgstr "" -"`#1640 `__: " -"pgr_withPoints falla cuando points_sql está vacía" +msgid "`#1640 `__: pgr_withPoints fails when points_sql is empty" +msgstr "`#1640 `__: pgr_withPoints falla cuando points_sql está vacía" -msgid "" -"`#1616 `__: Path " -"evaluation on C++ not updated before the results go back to C" -msgstr "" -"`#1616 `__: La " -"evaluación de la ruta en C ++ no se actualiza antes de que los resultados " -"vuelvan a C" +msgid "`#1616 `__: Path evaluation on C++ not updated before the results go back to C" +msgstr "`#1616 `__: La evaluación de la ruta en C ++ no se actualiza antes de que los resultados vuelvan a C" -msgid "" -"`#1300 `__: " -"pgr_chinesePostman crash on test data" -msgstr "" -"`#1300 `__: " -"pgr_chinesePostman falla en los datos de prueba" +msgid "`#1300 `__: pgr_chinesePostman crash on test data" +msgstr "`#1300 `__: pgr_chinesePostman falla en los datos de prueba" msgid "pgRouting 3.1.0 Release Notes" msgstr "Notas de la Versión pgRouting 3.1.0" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.1.0 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.8.0 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.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 "pgr_dijkstra(combinations)" msgstr "pgr_dijkstra(combinaciones)" @@ -20210,27 +14671,15 @@ msgid "pgRouting 3.0.6 Release Notes" msgstr "Notas de la Versión 3.0.6 de pgRouting" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.6 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.8.0 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.6 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.8.0 `_" msgid "pgRouting 3.0.5 Release Notes" msgstr "pgRouting 3.0.5 Notas de la Versión" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.5 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.8.0 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.5 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.8.0 `_" msgid "Backport issue fixes" msgstr "Corrección de problemas atrasados" @@ -20239,125 +14688,63 @@ msgid "pgRouting 3.0.4 Release Notes" msgstr "Notas de la Versión pgRouting 3.0.4" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.4 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados pora ésta " -"versión, consulte la `meta cerrada de 3.3.4 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.4 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados pora ésta versión, consulte la `meta cerrada de 3.3.4 `_" msgid "pgRouting 3.0.3 Release Notes" msgstr "Notas de la versión de pgRouting 3.0.3" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.3 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.7.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.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 "pgRouting 3.0.2 Release Notes" msgstr "Notas de la Versión pgRouting 3.0.2" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.2 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.7.2 `__" - -msgid "" -"`#1378 `__: Visual " -"Studio build failing" -msgstr "" -"`#1378 `__: Error de " -"compilación de Visual Studio" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.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 "`#1378 `__: Visual Studio build failing" +msgstr "`#1378 `__: Error de compilación de Visual Studio" msgid "pgRouting 3.0.1 Release Notes" msgstr "Notas de la versión 3.0.1 de pgRouting" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.1 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.7.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.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 "" -"`#232 `__: Honor client " -"cancel requests in C /C++ code" -msgstr "" -"`#232 `__: Honrar " -"cancelación de las solicitudes de código C /C++" +msgid "`#232 `__: Honor client cancel requests in C /C++ code" +msgstr "`#232 `__: Honrar cancelación de las solicitudes de código C /C++" msgid "pgRouting 3.0.0 Release Notes" msgstr "Notas de la versión de pgRouting 3.0.0" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.0 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 4.0.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.0 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 4.0.0 `__" msgid "Fixed Issues" msgstr "Problemas solucionados" -msgid "" -"`#1153 `__: Renamed " -"pgr_eucledianTSP to pgr_TSPeuclidean" -msgstr "" -"`#1153 `__: Renombrado " -"de pgr_eucledianTSP a pgr_TSPeuclidean" +msgid "`#1153 `__: Renamed pgr_eucledianTSP to pgr_TSPeuclidean" +msgstr "`#1153 `__: Renombrado de pgr_eucledianTSP a pgr_TSPeuclidean" -msgid "" -"`#1188 `__: Removed CGAL " -"dependency" -msgstr "" -"`#1188 `__: Se suprimió " -"la dependencia CGAL" +msgid "`#1188 `__: Removed CGAL dependency" +msgstr "`#1188 `__: Se suprimió la dependencia CGAL" -msgid "" -"`#1002 `__: Fixed " -"contraction issues:" -msgstr "" -"`#1002 `__: Problemas de " -"contracción solucionados:" +msgid "`#1002 `__: Fixed contraction issues:" +msgstr "`#1002 `__: Problemas de contracción solucionados:" -msgid "" -"`#1004 `__: Contracts " -"when forbidden vertices do not belong to graph" -msgstr "" -"`#1004 `__: Se contrae " -"cuando los vértices prohibidos no pertenecen al grafo" +msgid "`#1004 `__: Contracts when forbidden vertices do not belong to graph" +msgstr "`#1004 `__: Se contrae cuando los vértices prohibidos no pertenecen al grafo" -msgid "" -"`#1005 `__: Intermideate " -"results eliminated" -msgstr "" -"`#1005 `__: Resultados " -"intermedios eliminados" +msgid "`#1005 `__: Intermideate results eliminated" +msgstr "`#1005 `__: Resultados intermedios eliminados" -msgid "" -"`#1006 `__: No loss of " -"information" -msgstr "" -"`#1006 `__: No hay " -"pérdida de información2" +msgid "`#1006 `__: No loss of information" +msgstr "`#1006 `__: No hay pérdida de información2" msgid "New Functions" msgstr "Nuevas Funciones" @@ -20612,88 +14999,46 @@ msgid "pgRouting 2.6.3 Release Notes" msgstr "pgRouting 2.6.3 Notas de la Versión" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.6.3 `__" -msgstr "" -"Para ver todas las incidencias y pull requests cerrados por esta versión, " -"consulte `Git closed milestone for 3.6.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.3 `__" +msgstr "Para ver todas las incidencias y pull requests cerrados por esta versión, consulte `Git closed milestone for 3.6.3 `__" #, fuzzy -msgid "" -"`#1219 `__: Implicit " -"cast for via_path integer to text" -msgstr "" -"`#1219 `__ Implicit cast " -"for via_path integer to text" +msgid "`#1219 `__: Implicit cast for via_path integer to text" +msgstr "`#1219 `__ Implicit cast for via_path integer to text" #, fuzzy -msgid "" -"`#1193 `__: Fixed " -"pgr_pointsAsPolygon breaking when comparing strings in WHERE clause" -msgstr "" -"`#1640 `__: " -"pgr_withPoints falla cuando points_sql está vacía" +msgid "`#1193 `__: Fixed pgr_pointsAsPolygon breaking when comparing strings in WHERE clause" +msgstr "`#1640 `__: pgr_withPoints falla cuando points_sql está vacía" #, fuzzy -msgid "" -"`#1185 `__: Improve " -"FindPostgreSQL.cmake" -msgstr "" -"`#1188 `__: Se suprimió " -"la dependencia CGAL" +msgid "`#1185 `__: Improve FindPostgreSQL.cmake" +msgstr "`#1188 `__: Se suprimió la dependencia CGAL" msgid "pgRouting 2.6.2 Release Notes" msgstr "pgRouting 2.6.2 Notas de la versión" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.6.2 `__" -msgstr "" -"Para ver todas las incidencias y pull requests cerrados por esta versión, " -"consulte `Git closed milestone for 3.6.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.2 `__" +msgstr "Para ver todas las incidencias y pull requests cerrados por esta versión, consulte `Git closed milestone for 3.6.2 `__" #, fuzzy -msgid "" -"`#1152 `__: Fixes " -"driving distance when vertex is not part of the graph" -msgstr "" -"`#1152 `__ Corrige la " -"distancia de conducción cuando el vértice no forma parte del grafo" +msgid "`#1152 `__: Fixes driving distance when vertex is not part of the graph" +msgstr "`#1152 `__ Corrige la distancia de conducción cuando el vértice no forma parte del grafo" #, fuzzy -msgid "" -"`#1098 `__: Fixes " -"windows test" -msgstr "" -"`#1098 `__ Correcciones " -"de pruebas de ventanas" +msgid "`#1098 `__: Fixes windows test" +msgstr "`#1098 `__ Correcciones de pruebas de ventanas" #, fuzzy -msgid "" -"`#1165 `__: Fixes build " -"for python3 and perl5" -msgstr "" -"`#1165 `__ Correcciones " -"de la compilación de python3 y perl5" +msgid "`#1165 `__: Fixes build for python3 and perl5" +msgstr "`#1165 `__ Correcciones de la compilación de python3 y perl5" msgid "pgRouting 2.6.1 Release Notes" msgstr "Notas de la versión de pgRouting 2.6.1" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.6.1 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.6.1 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.1 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.6.1 `_" msgid "Fixes server crash on several functions." msgstr "Corrige el bloqueo del servidor en varias funciones." @@ -20762,9 +15107,7 @@ msgid "pgr_gsoc_vrppdtw (experimental)" msgstr "pgr_gsoc_vrppdtw (experimental)" msgid "Fixes for deprecated functions where also applied but not tested" -msgstr "" -"Correcciones para funciones en desuso en las que también se aplican pero no " -"se prueban" +msgstr "Correcciones para funciones en desuso en las que también se aplican pero no se prueban" msgid "Removed compilation warning for g++8" msgstr "Se ha eliminado la advertencia de compilación para g++8" @@ -20776,31 +15119,20 @@ msgid "pgRouting 2.6.0 Release Notes" msgstr "Notas de la versión de pgRouting 2.6.0" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.6.0 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.6.0 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.0 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.6.0 `_" msgid "pgr_lineGraphFull" msgstr "pgr_lineGraphFull" -msgid "" -"Fix pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean[,text])" -msgstr "" -"Correción pgr_trsp(text,integer,double precision,integer,double precision," -"boolean,boolean[,text])" +msgid "Fix pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean[,text])" +msgstr "Correción pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean[,text])" msgid "without restrictions" msgstr "sin restricciones" msgid "calls pgr_dijkstra when both end points have a fraction IN (0,1)" -msgstr "" -"llama a pgr_dijkstra cuando ambos puntos finales tienen una fracción IN (0,1)" +msgstr "llama a pgr_dijkstra cuando ambos puntos finales tienen una fracción IN (0,1)" msgid "calls pgr_withPoints when at least one fraction NOT IN (0,1)" msgstr "llama a pgr_withPoints cuando al menos una fracción NO ESTÁ EN (0,1)" @@ -20814,12 +15146,8 @@ msgstr "llama al código original trsp" msgid "Internal code" msgstr "Código interno" -msgid "" -"Cleaned the internal code of trsp(text,integer,integer,boolean,boolean [, " -"text])" -msgstr "" -"Se ha limpiado el código interno de trsp(text,integer,integer,boolean," -"boolean [, text])" +msgid "Cleaned the internal code of trsp(text,integer,integer,boolean,boolean [, text])" +msgstr "Se ha limpiado el código interno de trsp(text,integer,integer,boolean,boolean [, text])" msgid "Removed the use of pointers" msgstr "Se eliminó el uso de punteros" @@ -20837,18 +15165,11 @@ msgid "pgRouting 2.5.5 Release Notes" msgstr "Notas de la versión de PgRouting 2.5.5" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.5 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.5.1 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.5 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.5.1 `_" msgid "Fixes driving distance when vertex is not part of the graph" -msgstr "" -"Corrige la distancia de conducción cuando el vértice no forma parte del grafo" +msgstr "Corrige la distancia de conducción cuando el vértice no forma parte del grafo" msgid "Fixes windows test" msgstr "Corrección de la prueba de ventanas" @@ -20860,64 +15181,35 @@ msgid "pgRouting 2.5.4 Release Notes" msgstr "Notas de la versión de pgRouting 2.5.4" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.4 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados pora ésta " -"versión, consulte la `meta cerrada de 3.3.4 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.4 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados pora ésta versión, consulte la `meta cerrada de 3.3.4 `_" msgid "pgRouting 2.5.3 Release Notes" msgstr "Notas de la versión de pgRouting 2.5.3" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.3 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.7.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.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 "" -"Fix for postgresql 11: Removed a compilation error when compiling with " -"postgreSQL" -msgstr "" -"Arreglo para postgresql 11: Se ha eliminado un error que ocurría al compilar " -"con postgreSQL" +msgid "Fix for postgresql 11: Removed a compilation error when compiling with postgreSQL" +msgstr "Arreglo para postgresql 11: Se ha eliminado un error que ocurría al compilar con postgreSQL" msgid "pgRouting 2.5.2 Release Notes" msgstr "Notas de la versión de pgRouting 2.5.2" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.2 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.7.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.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 "Fix for postgresql 10.1: Removed a compiler condition" -msgstr "" -"Arreglo para postgresql 10.1: Se ha eliminado una condición del compilador" +msgstr "Arreglo para postgresql 10.1: Se ha eliminado una condición del compilador" msgid "pgRouting 2.5.1 Release Notes" msgstr "Notas de la versión de pgRouting 2.5.1" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.1 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.5.1 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.1 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.5.1 `_" msgid "Fixed prerequisite minimum version of: cmake" msgstr "Prerrequisito fijo versión mínima de: cmake" @@ -20926,14 +15218,8 @@ msgid "pgRouting 2.5.0 Release Notes" msgstr "Notas de la versión de pgRouting 2.5.0" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.0 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.5.0 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.0 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.5.0 `_" msgid "enhancement:" msgstr "mejora:" @@ -20954,8 +15240,7 @@ msgid "Parameter names changed" msgstr "Nombres de parámetros cambiados" msgid "The many version results are the union of the One to One version" -msgstr "" -"Los muchos resultados de la versión son la unión de la versión Uno a Uno" +msgstr "Los muchos resultados de la versión son la unión de la versión Uno a Uno" msgid "New Signatures" msgstr "Nuevas Firmas" @@ -20982,8 +15267,7 @@ msgid "pgr_maxFlowBoykovKolmogorov - use pgr_boykovKolmogorov instead" msgstr "pgr_maxFlowBoykovKolmogorov - utilice pgr_boykovKolmogorov en su lugar" msgid "pgr_maximumCardinalityMatching - use pgr_maxCardinalityMatch instead" -msgstr "" -"pgr_maximumCardinalityMatching - utilice pgr_maxCardinalityMatch en su lugar" +msgstr "pgr_maximumCardinalityMatching - utilice pgr_maxCardinalityMatch en su lugar" msgid "Deprecated Function" msgstr "Funcion Obsoleta" @@ -20998,14 +15282,8 @@ msgid "pgRouting 2.4.2 Release Notes" msgstr "Notas de la versión de pgRouting 2.4.2" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.4.2 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para esta " -"versión, consulte la `meta cerrada 3.4.2 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.4.2 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para esta versión, consulte la `meta cerrada 3.4.2 `_" msgid "Improvement" msgstr "Mejora" @@ -21016,24 +15294,15 @@ msgstr "Funciona para postgreSQL 10" msgid "Fixed: Unexpected error column \"cname\"" msgstr "Corregido: Columna de error inesperado \"cname\"" -msgid "" -"Replace __linux__ with __GLIBC__ for glibc-specific headers and functions" -msgstr "" -"Reemplace __linux__ por __GLIBC__ para cabeceras y funciones específicas de " -"glibc" +msgid "Replace __linux__ with __GLIBC__ for glibc-specific headers and functions" +msgstr "Reemplace __linux__ por __GLIBC__ para cabeceras y funciones específicas de glibc" msgid "pgRouting 2.4.1 Release Notes" msgstr "Notas de la versión de pgRouting 2.4.1" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.4.1 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados pora ésta " -"versión, consulte la `meta cerrada 3.4.1 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.4.1 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados pora ésta versión, consulte la `meta cerrada 3.4.1 `_" msgid "Fixed compiling error on macOS" msgstr "Corregido error de compilación en macOS" @@ -21045,14 +15314,8 @@ msgid "pgRouting 2.4.0 Release Notes" msgstr "Notas de la versión de pgRouting 2.4.0" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.4.0 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.3.0 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.4.0 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 3.3.0 `_" msgid "Deprecated signatures." msgstr "Firmas obsoletas." @@ -21070,9 +15333,7 @@ msgid "pgr_withPointsKSP: fixed ordering" msgstr "pgr_withPointsKSP: ordenamiento arreglado" msgid "TRSP original code is used with no changes on the compilation warnings" -msgstr "" -"El código original de TRSP se utiliza sin cambios en las advertencias de " -"compilación" +msgstr "El código original de TRSP se utiliza sin cambios en las advertencias de compilación" msgid "pgRouting 2.3" msgstr "pgRouting 2.3" @@ -21081,26 +15342,17 @@ msgid "pgRouting 2.3.2 Release Notes" msgstr "Notas de la versión de pgRouting 2.3.2" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.3.2 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados pora ésta " -"versión, consulte la `meta cerrada de 3.3.2 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.3.2 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados pora ésta versión, consulte la `meta cerrada de 3.3.2 `_" msgid "Fixed pgr_gsoc_vrppdtw crash when all orders fit on one truck." -msgstr "" -"Se ha corregido el bloqueo pgr_gsoc_vrppdtw cuando todos los pedidos caben " -"en un camión." +msgstr "Se ha corregido el bloqueo pgr_gsoc_vrppdtw cuando todos los pedidos caben en un camión." msgid "Fixed pgr_trsp:" msgstr "Corregido pgr_trsp:" msgid "Alternate code is not executed when the point is in reality a vertex" -msgstr "" -"El código alternativo no se ejecuta cuando el punto es en realidad un vértice" +msgstr "El código alternativo no se ejecuta cuando el punto es en realidad un vértice" msgid "Fixed ambiguity on seq" msgstr "Corregida la ambiguedad en el seq" @@ -21109,14 +15361,8 @@ msgid "pgRouting 2.3.1 Release Notes" msgstr "Notas de la versión de pgRouting 2.3.1" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.3.1 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.7.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.3.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 "Leaks on proposed max_flow functions" msgstr "Fugas en las funciones max_flow propuestas" @@ -21131,14 +15377,8 @@ msgid "pgRouting 2.3.0 Release Notes" msgstr "Notas de la versión de pgRouting 2.3.0" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.3.0 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 4.0.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.3.0 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 4.0.0 `__" msgid "pgr_eucledianTSP" msgstr "pgr_eucledianTSP" @@ -21210,14 +15450,8 @@ msgid "pgRouting 2.2.4 Release Notes" msgstr "Notas de la versión de pgRouting 2.2.4" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.2.4 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados pora ésta " -"versión, consulte la `meta cerrada de 3.3.4 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.4 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados pora ésta versión, consulte la `meta cerrada de 3.3.4 `_" msgid "Bogus uses of extern \"C\"" msgstr "Bogus usos de extern \"C\"" @@ -21232,14 +15466,8 @@ msgid "pgRouting 2.2.3 Release Notes" msgstr "Notas de la versión de pgRouting 2.2.3" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.2.3 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.7.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.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 "Fixed compatibility issues with PostgreSQL 9.6." msgstr "Problemas de compatibilidad con PostgreSQL 9.6 corregidos." @@ -21248,14 +15476,8 @@ msgid "pgRouting 2.2.2 Release Notes" msgstr "Notas de la versión de pgRouting 2.2.2" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.2.2 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.7.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.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 "Fixed regression error on pgr_drivingDistance" msgstr "Corregido error de regresión en pgr_drivingDistance" @@ -21264,14 +15486,8 @@ msgid "pgRouting 2.2.1 Release Notes" msgstr "Notas de la versión de pgRouting 2.2.1" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.2.1 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.7.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.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 "Server crash fix on pgr_alphaShape" msgstr "Corrección de bloqueo del servidor en pgr_alphaShape" @@ -21283,14 +15499,8 @@ msgid "pgRouting 2.2.0 Release Notes" msgstr "Notas de la versión de pgRouting 2.2.0" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.2.0 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 4.0.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.0 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 4.0.0 `__" msgid "Improvements" msgstr "Mejoras" @@ -21380,14 +15590,8 @@ msgid "pgRouting 2.1.0 Release Notes" msgstr "Notas de la versión de pgRouting 2.1.0" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.1.0 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 4.0.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.1.0 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 4.0.0 `__" msgid "Refactored" msgstr "Refactorizado" @@ -21395,57 +15599,29 @@ msgstr "Refactorizado" msgid "pgr_dijkstra(One to One)" msgstr "pgr_dijkstra(Uno a Uno)" -msgid "" -"pgr_alphaShape function now can generate better (multi)polygon with holes " -"and alpha parameter." -msgstr "" -"La función pgr_alphaShape ahora puede generar mejores (multi)polígonos con " -"agujeros y parámetro alfa." +msgid "pgr_alphaShape function now can generate better (multi)polygon with holes and alpha parameter." +msgstr "La función pgr_alphaShape ahora puede generar mejores (multi)polígonos con agujeros y parámetro alfa." -msgid "" -"Proposed functions from Steve Woodbridge, (Classified as Convenience by the " -"author.)" -msgstr "" -"Funciones propuestas de Steve Woodbridge, (Clasificado como Conveniencia por " -"el autor.)" +msgid "Proposed functions from Steve Woodbridge, (Classified as Convenience by the author.)" +msgstr "Funciones propuestas de Steve Woodbridge, (Clasificado como Conveniencia por el autor.)" -msgid "" -"pgr_pointToEdgeNode - convert a point geometry to a vertex_id based on " -"closest edge." -msgstr "" -"pgr_pointToEdgeNode - convierta una geometría de punto en un vertex_id " -"basado en la arista más cercana." +msgid "pgr_pointToEdgeNode - convert a point geometry to a vertex_id based on closest edge." +msgstr "pgr_pointToEdgeNode - convierta una geometría de punto en un vertex_id basado en la arista más cercana." -msgid "" -"pgr_flipEdges - flip the edges in an array of geometries so the connect end " -"to end." -msgstr "" -"pgr_flipEdges - voltear los bordes en un arreglo de geometrías para la " -"conexión de extremo a extremo." +msgid "pgr_flipEdges - flip the edges in an array of geometries so the connect end to end." +msgstr "pgr_flipEdges - voltear los bordes en un arreglo de geometrías para la conexión de extremo a extremo." -msgid "" -"pgr_textToPoints - convert a string of x,y;x,y;... locations into point " -"geometries." -msgstr "" -"pgr_textToPoints - convertir una cadena de x,y;x,y;... ubicaciones en " -"geometrías de puntos." +msgid "pgr_textToPoints - convert a string of x,y;x,y;... locations into point geometries." +msgstr "pgr_textToPoints - convertir una cadena de x,y;x,y;... ubicaciones en geometrías de puntos." -msgid "" -"pgr_pointsToVids - convert an array of point geometries into vertex ids." -msgstr "" -"pgr_pointsToVids - convertir un arreglo de geometrías de puntos en " -"identificadores de vértices." +msgid "pgr_pointsToVids - convert an array of point geometries into vertex ids." +msgstr "pgr_pointsToVids - convertir un arreglo de geometrías de puntos en identificadores de vértices." msgid "pgr_pointsToDMatrix - Create a distance matrix from an array of points." -msgstr "" -"pgr_pointsToDMatrix - Crear una matriz de distancia a partir de un arreglo " -"de puntos." +msgstr "pgr_pointsToDMatrix - Crear una matriz de distancia a partir de un arreglo de puntos." -msgid "" -"pgr_vidsToDMatrix - Create a distance matrix from an array of vertix_id." -msgstr "" -"pgr_vidsToDMatrix - Crear una matriz de distancia a partir de un arreglo de " -"vertex_id." +msgid "pgr_vidsToDMatrix - Create a distance matrix from an array of vertix_id." +msgstr "pgr_vidsToDMatrix - Crear una matriz de distancia a partir de un arreglo de vertex_id." msgid "Added proposed functions from GSoc Projects:" msgstr "Funciones propuestas de GSoc Projects añadidas:" @@ -21514,15 +15690,10 @@ msgid "allow any-integer in the id's" msgstr "permitir any-integer (cualquier entero) en el id" msgid "allow any-numerical on the cost/reverse_cost columns" -msgstr "" -"permitir any-numerical (cualquier numérico) en las columnas cost/reverse_cost" +msgstr "permitir any-numerical (cualquier numérico) en las columnas cost/reverse_cost" -msgid "" -"Instead of generating many libraries: - All functions are encapsulated in " -"one library - The library has the prefix 2-1-0" -msgstr "" -"En lugar de generar muchas bibliotecas: - Todas las funciones están " -"encapsuladas en una biblioteca - La biblioteca tiene el prefijo 2-1-0" +msgid "Instead of generating many libraries: - All functions are encapsulated in one library - The library has the prefix 2-1-0" +msgstr "En lugar de generar muchas bibliotecas: - Todas las funciones están encapsuladas en una biblioteca - La biblioteca tiene el prefijo 2-1-0" msgid "pgRouting 2.0" msgstr "pgRouting 2.0" @@ -21531,14 +15702,8 @@ msgid "pgRouting 2.0.1 Release Notes" msgstr "Notas de la versión de pgRouting 2.0.1" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.0.1 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.7.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.0.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 "Minor bug fixes." msgstr "Corrección de errores menores." @@ -21550,23 +15715,11 @@ msgid "pgRouting 2.0.0 Release Notes" msgstr "Notas de la versión de pgRouting 2.0.0" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.0.0 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 4.0.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.0.0 `__" +msgstr "Para ver todos los problemas y solicitudes de extracción cerrados para ésta versión, consulte la `meta cerrada 4.0.0 `__" -msgid "" -"With the release of pgRouting 2.0.0 the library has abandoned backwards " -"compatibility to `pgRouting 1.0`_ releases. The main Goals for this release " -"are:" -msgstr "" -"Con la versión de pgRouting 2.0.0, la biblioteca ha abandonado la " -"compatibilidad con versiones anteriores a las versiones `pgRouting 1.0`_. " -"Los principales objetivos de esta versión son:" +msgid "With the release of pgRouting 2.0.0 the library has abandoned backwards compatibility to `pgRouting 1.0`_ releases. The main Goals for this release are:" +msgstr "Con la versión de pgRouting 2.0.0, la biblioteca ha abandonado la compatibilidad con versiones anteriores a las versiones `pgRouting 1.0`_. Los principales objetivos de esta versión son:" msgid "Major restructuring of pgRouting." msgstr "Mayor reestructuración de pgRouting." @@ -21598,28 +15751,17 @@ msgstr "Y facilitó que varios desarrolladores hicieran contribuciones." msgid "Important Changes" msgstr "Cambios Importantes" -msgid "" -"Graph Analytics - tools for detecting and fixing connection some problems in " -"a graph" -msgstr "" -"Análisis gráfico - herramientas para detectar y arreglar algunos problemas " -"de conexión en un gráfico de red" +msgid "Graph Analytics - tools for detecting and fixing connection some problems in a graph" +msgstr "Análisis gráfico - herramientas para detectar y arreglar algunos problemas de conexión en un gráfico de red" msgid "A collection of useful utility functions" msgstr "Una colección de funciones útiles" -msgid "" -"Two new All Pairs Short Path algorithms (pgr_apspJohnson, pgr_apspWarshall)" -msgstr "" -"Dos nuevos algoritmos para el camino más corto de todos pares " -"(pgr_apspJohnson, pgr_apspWarshall)" +msgid "Two new All Pairs Short Path algorithms (pgr_apspJohnson, pgr_apspWarshall)" +msgstr "Dos nuevos algoritmos para el camino más corto de todos pares (pgr_apspJohnson, pgr_apspWarshall)" -msgid "" -"Bi-directional Dijkstra and A-star search algorithms (pgr_bdAstar, " -"pgr_bdDijkstra)" -msgstr "" -"Algoritmos bidireccionales para las búsquedas Dijkstra y A*(pgr_bdAstar, " -"pgr_bdDijkstra)" +msgid "Bi-directional Dijkstra and A-star search algorithms (pgr_bdAstar, pgr_bdDijkstra)" +msgstr "Algoritmos bidireccionales para las búsquedas Dijkstra y A*(pgr_bdAstar, pgr_bdDijkstra)" msgid "One to many nodes search (pgr_kDijkstra)" msgstr "Búsqueda de uno a varios nodos (pgr_kDijkstra)" @@ -21627,43 +15769,26 @@ msgstr "Búsqueda de uno a varios nodos (pgr_kDijkstra)" msgid "K alternate paths shortest path (pgr_ksp)" msgstr "K rutas más cortas alternas (pgr_ksp)" -msgid "" -"New TSP solver that simplifies the code and the build process (pgr_tsp), " -"dropped \"Gaul Library\" dependency" -msgstr "" -"Nuevo solucionador TSP que simplifica el código donde el proceso de " -"compilación (pgr_tsp), ya no dependene de la biblioteca Gaul" +msgid "New TSP solver that simplifies the code and the build process (pgr_tsp), dropped \"Gaul Library\" dependency" +msgstr "Nuevo solucionador TSP que simplifica el código donde el proceso de compilación (pgr_tsp), ya no dependene de la biblioteca Gaul" msgid "Turn Restricted shortest path (pgr_trsp) that replaces Shooting Star" -msgstr "" -"Ruta más corta con giros restringidos (pgr_trsp) que reemplaza a la Estrella " -"Fugaz" +msgstr "Ruta más corta con giros restringidos (pgr_trsp) que reemplaza a la Estrella Fugaz" msgid "Dropped support for Shooting Star" msgstr "Se deja de soportar a la Estrella fugaz" -msgid "" -"Built a test infrastructure that is run before major code changes are " -"checked in" -msgstr "" -"Se construye una infraestructura de pruebas que se ejecuta antes de que se " -"incorporen grandes cambios al código principal" +msgid "Built a test infrastructure that is run before major code changes are checked in" +msgstr "Se construye una infraestructura de pruebas que se ejecuta antes de que se incorporen grandes cambios al código principal" -msgid "" -"Tested and fixed most all of the outstanding bugs reported against 1.x that " -"existing in the 2.0-dev code base." -msgstr "" -"Se probó y se arreglaron todos los errores excepcionales registrados en la " -"versión 1.x existente en la base del código 2.0-dev." +msgid "Tested and fixed most all of the outstanding bugs reported against 1.x that existing in the 2.0-dev code base." +msgstr "Se probó y se arreglaron todos los errores excepcionales registrados en la versión 1.x existente en la base del código 2.0-dev." msgid "Improved build process for Windows" msgstr "Proceso de compilación mejorados para Windows" -msgid "" -"Automated testing on Linux and Windows platforms trigger by every commit" -msgstr "" -"Automatizado de pruebas en plataformas Linux y Windows por cada cambio " -"permanente" +msgid "Automated testing on Linux and Windows platforms trigger by every commit" +msgstr "Automatizado de pruebas en plataformas Linux y Windows por cada cambio permanente" msgid "Modular library design" msgstr "Diseño modular de bibliotecas" @@ -21701,17 +15826,8 @@ msgstr "pgRouting 1" msgid "pgRouting 1.0" msgstr "pgRouting 1.0" -msgid "" -"To see the issues closed by this release see the `Git closed issues for 1.x " -"`_ on Github. The following release notes have been copied " -"from the previous ``RELEASE_NOTES`` file and are kept as a reference." -msgstr "" -"Para ver los problemas cerrados por esta versión, consulte los `Git closed " -"issues for 1.x `_ on Github. The following " -"release notes have been copied from the previous ``RELEASE_NOTES`` file and " -"are kept as a reference." +msgid "To see the issues closed by this release see the `Git closed issues for 1.x `_ on Github. The following release notes have been copied from the previous ``RELEASE_NOTES`` file and are kept as a reference." +msgstr "Para ver los problemas cerrados por esta versión, consulte los `Git closed issues for 1.x `_ on Github. The following release notes have been copied from the previous ``RELEASE_NOTES`` file and are kept as a reference." msgid "Changes for release 1.05" msgstr "Cambios para la versión 1.05" @@ -21747,9 +15863,7 @@ msgid "Changes for release 1.0.0b" msgstr "Cambios para la versión 1.0.0b" msgid "Additional SQL file with more simple names for wrapper functions" -msgstr "" -"Archivos SQL adicionales con nombres más simples para las funciones de la " -"envolturas" +msgstr "Archivos SQL adicionales con nombres más simples para las funciones de la envolturas" msgid "Changes for release 1.0.0a" msgstr "Cambios para la versión 1.0.0a" @@ -21766,25 +15880,20 @@ msgstr "Cambios para la versión 0.9.9" msgid "PostgreSQL 8.2 support" msgstr "Soporte PostgreSQL 8.2" -msgid "" -"Shortest path functions return empty result if they could not find any path" -msgstr "" -"Las funciones de ruta más cortas devuelven un resultado vacío si no " -"encuentran ninguna ruta de acceso" +msgid "Shortest path functions return empty result if they could not find any path" +msgstr "Las funciones de ruta más cortas devuelven un resultado vacío si no encuentran ninguna ruta de acceso" msgid "Changes for release 0.9.8" msgstr "Cambios para versión 0.9.8" msgid "Renumbering scheme was added to shortest path functions" -msgstr "" -"Esquema de numeración ha sido añadido a las funciones de ruta más cortos" +msgstr "Esquema de numeración ha sido añadido a las funciones de ruta más cortos" msgid "Directed shortest path functions were added" msgstr "Se agregaron funciones de ruta más cortos dirigidas" msgid "routing_postgis.sql was modified to use dijkstra in TSP search" -msgstr "" -"routing_postgis.SQL fue modificado para utilizar dijkstra en la búsqueda TSP" +msgstr "routing_postgis.SQL fue modificado para utilizar dijkstra en la búsqueda TSP" msgid "Function Families" msgstr "Familias de Funciones" @@ -21792,14 +15901,8 @@ msgstr "Familias de Funciones" msgid "Sample Data" msgstr "Datos Muestra" -msgid "" -"The documentation provides very simple example queries based on a small " -"sample network that resembles a city. To be able to execute the majority of " -"the examples queries, follow the instructions below." -msgstr "" -"La documentación proporciona consultas de ejemplo muy simples basadas en una " -"red muestra pequeña que asemeja una ciudad. Para ser capaz de ejecutar la " -"mayoría de los ejemplos, siga las siguientes instrucciones." +msgid "The documentation provides very simple example queries based on a small sample network that resembles a city. To be able to execute the majority of the examples queries, follow the instructions below." +msgstr "La documentación proporciona consultas de ejemplo muy simples basadas en una red muestra pequeña que asemeja una ciudad. Para ser capaz de ejecutar la mayoría de los ejemplos, siga las siguientes instrucciones." msgid "Main graph" msgstr "" @@ -21810,22 +15913,13 @@ msgstr "" msgid "The following city is to be inserted into the database:" msgstr "" -msgid "" -"Information known at this point is the geometry of the edges, cost values, " -"capacity values, category values and some locations that are not in the " -"graph." +msgid "Information known at this point is the geometry of the edges, cost values, capacity values, category values and some locations that are not in the graph." msgstr "" -msgid "" -"The process to have working topology starts by inserting the edges. After " -"that everything else is calculated." +msgid "The process to have working topology starts by inserting the edges. After that everything else is calculated." msgstr "" -msgid "" -"The database design for the documentation of pgRouting, keeps in the same " -"row 2 segments, one in the direction of the geometry and the second in the " -"opposite direction. Therefore some information has the ``reverse_`` prefix " -"which corresponds to the segment on the opposite direction of the geometry." +msgid "The database design for the documentation of pgRouting, keeps in the same row 2 segments, one in the direction of the geometry and the second in the opposite direction. Therefore some information has the ``reverse_`` prefix which corresponds to the segment on the opposite direction of the geometry." msgstr "" msgid "Identifier of the starting vertex of the geometry ``geom``." @@ -21855,17 +15949,13 @@ msgstr "" msgid ":math:`x` coordinate of the starting vertex of the geometry." msgstr "" -msgid "" -"For convenience it is saved on the table but can be calculated as " -"``ST_X(ST_StartPoint(geom))``." +msgid "For convenience it is saved on the table but can be calculated as ``ST_X(ST_StartPoint(geom))``." msgstr "" msgid ":math:`y` coordinate of the ending vertex of the geometry." msgstr "" -msgid "" -"For convenience it is saved on the table but can be calculated as " -"``ST_Y(ST_EndPoint(geom))``." +msgid "For convenience it is saved on the table but can be calculated as ``ST_Y(ST_EndPoint(geom))``." msgstr "" msgid "The geometry of the segments." @@ -21874,21 +15964,16 @@ msgstr "" msgid "Starting on PostgreSQL 12::" msgstr "A partir de PostgreSQL 12::" -msgid "" -"Optionally indexes on different columns can be created. The recommendation " -"is to have" +msgid "Optionally indexes on different columns can be created. The recommendation is to have" msgstr "" msgid "``id`` indexed." msgstr "" -msgid "" -"``source`` and ``target`` columns indexed to speed up pgRouting queries." +msgid "``source`` and ``target`` columns indexed to speed up pgRouting queries." msgstr "" -msgid "" -"``geom`` indexed to speed up geometry processes that might be needed in the " -"front end." +msgid "``geom`` indexed to speed up geometry processes that might be needed in the front end." msgstr "" msgid "For this small example the indexes are skipped, except for ``id``" @@ -21900,23 +15985,16 @@ msgstr "" msgid "Inserting into the database the information of the edges:" msgstr "" -msgid "" -"Negative values on the cost, capacity and category means that the edge do " -"not exist." +msgid "Negative values on the cost, capacity and category means that the edge do not exist." msgstr "" msgid "Vertices" msgstr "" -msgid "" -"The vertex information is calculated based on the identifier of the edge and " -"the geometry and saved on a table. Saving all the information provided by :" -"doc:`pgr_extractVertices`:" +msgid "The vertex information is calculated based on the identifier of the edge and the geometry and saved on a table. Saving all the information provided by :doc:`pgr_extractVertices`:" msgstr "" -msgid "" -"In this case the because the ``CREATE`` statement was not used, the " -"definition of an index on the table is needed." +msgid "In this case the because the ``CREATE`` statement was not used, the definition of an index on the table is needed." msgstr "" msgid "The structure of the table is:" @@ -21928,17 +16006,13 @@ msgstr "Datos de vértices" msgid "The saved information of the vertices is:" msgstr "" -msgid "" -"Here is where adding more columns to the vertices table can be done. " -"Additional columns names and types will depend on the application." +msgid "Here is where adding more columns to the vertices table can be done. Additional columns names and types will depend on the application." msgstr "" msgid "The topology" msgstr "La topología" -msgid "" -"This queries based on the vertices data create a topology by filling the " -"``source`` and ``target`` columns in the edges table." +msgid "This queries based on the vertices data create a topology by filling the ``source`` and ``target`` columns in the edges table." msgstr "" msgid "Topology data" @@ -21950,17 +16024,11 @@ msgstr "Puntos fuera del grafo" msgid "Support tables" msgstr "Tablas de apoyo" -msgid "" -"Many functions can be used with a combinations of ``(source, target)`` pairs " -"when wanting a route from ``source`` to ``target``." +msgid "Many functions can be used with a combinations of ``(source, target)`` pairs when wanting a route from ``source`` to ``target``." msgstr "" -msgid "" -"For convenience of this documentation, some combinations will be stored on a " -"table:" -msgstr "" -"Por conveniencia de esta documentación, algunas combinaciones se almacenan " -"en una tabla:" +msgid "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:" @@ -21975,13 +16043,10 @@ 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." +msgstr "Las flechas rojas corresponden cuando ``cost`` > 0 en la tabla de aristas." msgid "Blue arrows correspond when ``reverse_cost`` > 0 in the edge table." -msgstr "" -"Las flechas azules corresponden cuando ``reverse_cost`` > 0 en la tabla de " -"aristas." +msgstr "Las flechas azules corresponden cuando ``reverse_cost`` > 0 en la tabla de aristas." msgid "Points are outside the graph." msgstr "Los puntos están fuera del grafo." @@ -21992,12 +16057,8 @@ msgstr "Haga clic en el grafo para ampliarlo." msgid "Directed graph with ``cost`` and ``reverse_cost``" msgstr "Grafo dirigido con ``cost`` y ``reverse_cost``" -msgid "" -"When working with city networks, this is recommended for point of view of " -"vehicles." -msgstr "" -"Cuando se trabaja con redes de ciudades, esto se recomienda para el punto de " -"vista de los vehículos." +msgid "When working with city networks, this is recommended for point of view of vehicles." +msgstr "Cuando se trabaja con redes de ciudades, esto se recomienda para el punto de vista de los vehículos." msgid "Directed, with cost and reverse_cost" msgstr "Dirigido, con costo y costo inverso" @@ -22005,12 +16066,8 @@ msgstr "Dirigido, con costo y costo inverso" msgid "Undirected graph with ``cost`` and ``reverse_cost``" msgstr "Grafo no dirigido con ``cost`` y ``reverse_cost``" -msgid "" -"When working with city networks, this is recommended for point of view of " -"pedestrians." -msgstr "" -"Cuando se trabaja con redes de ciudades, esto se recomienda para el punto de " -"vista de los peatones." +msgid "When working with city networks, this is recommended for point of view of pedestrians." +msgstr "Cuando se trabaja con redes de ciudades, esto se recomienda para el punto de vista de los peatones." msgid "Undirected, with cost and reverse cost" msgstr "No dirigido, con costo y costo inverso" @@ -22033,162 +16090,74 @@ msgstr "Datos de Recogida y Entrega" msgid "Spanning Tree - Category" msgstr "Árbol de expansión - Categoría" -msgid "" -"A spanning tree of an undirected graph is a tree that includes all the " -"vertices of G with the minimum possible number of edges." -msgstr "" -"El árbol de expansión de un grafo no dirigido es un árbol que incluye todos " -"los vértices de G con el número mínimo posible de aristas." +msgid "A spanning tree of an undirected graph is a tree that includes all the vertices of G with the minimum possible number of edges." +msgstr "El árbol de expansión de un grafo no dirigido es un árbol que incluye todos los vértices de G con el número mínimo posible de aristas." -msgid "" -"For a disconnected graph, there there is no single tree, but a spanning " -"forest, consisting of a spanning tree of each connected component." -msgstr "" -"Para un grafo desconectado, no hay un solo árbol, sino un bosque de " -"expansión, que consiste en un árbol de expansión de cada componente " -"conectado." +msgid "For a disconnected graph, there there is no single tree, but a spanning forest, consisting of a spanning tree of each connected component." +msgstr "Para un grafo desconectado, no hay un solo árbol, sino un bosque de expansión, que consiste en un árbol de expansión de cada componente conectado." msgid "Characteristics:" msgstr "Características:" -msgid "" -"pgRouting community support is available through the `pgRouting website " -"`_, `documentation `_, tutorials, mailing lists and others. If you’re looking " -"for :ref:`commercial support `, find below a list of " -"companies providing pgRouting development and consulting services." -msgstr "" -"El soporte comunitario de pgRouting está disponible a través del `Sitio de " -"pgRouting `_, `documentación `_, tutoriales, listas de correos y otros. Si estás " -"buscando :ref:`Soporte Comercial `, a continuación se " -"encuentra una lista de compañias que proporcionan servicios de consultoría y " -"desarrollo de pgRouting." +msgid "pgRouting community support is available through the `pgRouting website `_, `documentation `_, tutorials, mailing lists and others. If you’re looking for :ref:`commercial support `, find below a list of companies providing pgRouting development and consulting services." +msgstr "El soporte comunitario de pgRouting está disponible a través del `Sitio de pgRouting `_, `documentación `_, tutoriales, listas de correos y otros. Si estás buscando :ref:`Soporte Comercial `, a continuación se encuentra una lista de compañias que proporcionan servicios de consultoría y desarrollo de pgRouting." msgid "Reporting Problems" msgstr "Reporte de Problemas" -msgid "" -"Bugs are reported and managed in an `issue tracker `_. Please follow these steps:" -msgstr "" -"Errores son registrados y manejados en un `issue tracker `_. Por favor siga los siguientes pasos:" +msgid "Bugs are reported and managed in an `issue tracker `_. Please follow these steps:" +msgstr "Errores son registrados y manejados en un `issue tracker `_. Por favor siga los siguientes pasos:" -msgid "" -"Search the tickets to see if your problem has already been reported. If so, " -"add any extra context you might have found, or at least indicate that you " -"too are having the problem. This will help us prioritize common issues." -msgstr "" -"Buscar en las entradas para ver si ya se ha informado de su problema. Si es " -"así, añadir cualquier contexto extra que usted haya encontrado, o al menos " -"indicar que también está teniendo el problema. Esto nos ayudará a priorizar " -"los problemas más comunes." +msgid "Search the tickets to see if your problem has already been reported. If so, add any extra context you might have found, or at least indicate that you too are having the problem. This will help us prioritize common issues." +msgstr "Buscar en las entradas para ver si ya se ha informado de su problema. Si es así, añadir cualquier contexto extra que usted haya encontrado, o al menos indicar que también está teniendo el problema. Esto nos ayudará a priorizar los problemas más comunes." -msgid "" -"If your problem is unreported, create a `new issue `__ for it." -msgstr "" -"Si su problema no se ha informado, cree un `nuevo asunto `__ para ello." +msgid "If your problem is unreported, create a `new issue `__ for it." +msgstr "Si su problema no se ha informado, cree un `nuevo asunto `__ para ello." -msgid "" -"In your report include explicit instructions to replicate your issue. The " -"best tickets include the exact SQL necessary to replicate a problem." -msgstr "" -"En su informe incluya instrucciones explícitas para reproducir el problema. " -"Las mejores entradas incluyen consultas SQL exactas que se necesitan para " -"reproducir el problema." +msgid "In your report include explicit instructions to replicate your issue. The best tickets include the exact SQL necessary to replicate a problem." +msgstr "En su informe incluya instrucciones explícitas para reproducir el problema. Las mejores entradas incluyen consultas SQL exactas que se necesitan para reproducir el problema." -msgid "" -"If you can test older versions of PostGIS for your problem, please do. On " -"your ticket, note the earliest version the problem appears." -msgstr "" -"Si usted puede probar las versiones anteriores de PostGIS para su problema, " -"por favor hágalo. En su reporte, tenga en cuenta la versión más antigua en " -"la que aparezca el problema." +msgid "If you can test older versions of PostGIS for your problem, please do. On your ticket, note the earliest version the problem appears." +msgstr "Si usted puede probar las versiones anteriores de PostGIS para su problema, por favor hágalo. En su reporte, tenga en cuenta la versión más antigua en la que aparezca el problema." -msgid "" -"For the versions where you can replicate the problem, note the operating " -"system and version of pgRouting, PostGIS and PostgreSQL." -msgstr "" -"Para las versiones donde se puede reproducir el problema, anote el sistema " -"operativo y la versión de pgRouting, PostGIS y PostgreSQL." +msgid "For the versions where you can replicate the problem, note the operating system and version of pgRouting, PostGIS and PostgreSQL." +msgstr "Para las versiones donde se puede reproducir el problema, anote el sistema operativo y la versión de pgRouting, PostGIS y PostgreSQL." -msgid "" -"It is recommended to use the following wrapper on the problem to pin point " -"the step that is causing the problem." -msgstr "" -"Se recomienda usar siguiente envoltorio en el problema para determinar el " -"paso que está causando el problema." +msgid "It is recommended to use the following wrapper on the problem to pin point the step that is causing the problem." +msgstr "Se recomienda usar siguiente envoltorio en el problema para determinar el paso que está causando el problema." #, fuzzy msgid "Mailing List, Matrix, GIS StackExchange" msgstr "Listas de correo y GIS StackExchange" #, fuzzy -msgid "" -"There are two mailing lists for pgRouting hosted on OSGeo discourse server:" -msgstr "" -"Hay dos listas de correo para pgRouting alojados en las listas de correo del " -"Servidor de OSGeo:" +msgid "There are two mailing lists for pgRouting hosted on OSGeo discourse server:" +msgstr "Hay dos listas de correo para pgRouting alojados en las listas de correo del Servidor de OSGeo:" #, fuzzy -msgid "" -"User mailing list: https://discourse.osgeo.org/c/pgrouting/pgrouting-users/" -msgstr "" -"Lista de correo para desarrolladores: https://discourse.osgeo.org/c/" -"pgrouting/pgrouting-dev/" +msgid "User mailing list: https://discourse.osgeo.org/c/pgrouting/pgrouting-users/" +msgstr "Lista de correo para desarrolladores: https://discourse.osgeo.org/c/pgrouting/pgrouting-dev/" -msgid "" -"Developer mailing list: https://discourse.osgeo.org/c/pgrouting/pgrouting-" -"dev/" -msgstr "" -"Lista de correo para desarrolladores: https://discourse.osgeo.org/c/" -"pgrouting/pgrouting-dev/" +msgid "Developer mailing list: https://discourse.osgeo.org/c/pgrouting/pgrouting-dev/" +msgstr "Lista de correo para desarrolladores: https://discourse.osgeo.org/c/pgrouting/pgrouting-dev/" msgid "Subscribe: https://discourse.osgeo.org/g/pgrouting-dev" msgstr "Suscríbase: https://discourse.osgeo.org/g/pgrouting-dev" -msgid "" -"For general questions and topics about how to use pgRouting, please write to " -"the user mailing list." -msgstr "" -"Para preguntas generales y tópicos sobre el uso pgRouting, escriba a la " -"lista de correo para usuario." +msgid "For general questions and topics about how to use pgRouting, please write to the user mailing list." +msgstr "Para preguntas generales y tópicos sobre el uso pgRouting, escriba a la lista de correo para usuario." -msgid "" -"If you want to chat with fellow pgRouting users and contributors, you can " -"join our matrix channel: `pgRouting matrix channel `_." +msgid "If you want to chat with fellow pgRouting users and contributors, you can join our matrix channel: `pgRouting matrix channel `_." msgstr "" -msgid "" -"You can also ask at `GIS StackExchange `_ " -"and tag the question with ``pgrouting``. Find all questions tagged with " -"``pgrouting`` under https://gis.stackexchange.com/questions/tagged/pgrouting " -"or subscribe to the `pgRouting questions feed `_." -msgstr "" -"También puede preguntar en `GIS StackExchange `_ ay etiquetar la pregunta con ``pgrouting``. Encuentra todas las " -"preguntas etiquetadas con ``pgrouting`` en https://gis.stackexchange.com/" -"questions/tagged/pgrouting o suscríbete en `preguntas de retroalimentación " -"de pgRouting `_." +msgid "You can also ask at `GIS StackExchange `_ and tag the question with ``pgrouting``. Find all questions tagged with ``pgrouting`` under https://gis.stackexchange.com/questions/tagged/pgrouting or subscribe to the `pgRouting questions feed `_." +msgstr "También puede preguntar en `GIS StackExchange `_ ay etiquetar la pregunta con ``pgrouting``. Encuentra todas las preguntas etiquetadas con ``pgrouting`` en https://gis.stackexchange.com/questions/tagged/pgrouting o suscríbete en `preguntas de retroalimentación de pgRouting `_." msgid "Commercial Support" msgstr "Soporte Comercial" -msgid "" -"For users who require professional support, development and consulting " -"services, consider contacting any of the following organizations, which have " -"significantly contributed to the development of pgRouting:" -msgstr "" -"Para usuarios que requieren apoyo profesional, desarrollo y servicios de " -"consultoría, considere ponerse en contacto con cualquiera de las siguientes " -"organizaciones, que han contribuido significativamente al desarrollo de " -"pgRouting:" +msgid "For users who require professional support, development and consulting services, consider contacting any of the following organizations, which have significantly contributed to the development of pgRouting:" +msgstr "Para usuarios que requieren apoyo profesional, desarrollo y servicios de consultoría, considere ponerse en contacto con cualquiera de las siguientes organizaciones, que han contribuido significativamente al desarrollo de pgRouting:" msgid "**Company**" msgstr "**Empresa**" @@ -22223,12 +16192,8 @@ msgstr "https://www.osgeo.org/service-providers/netlab/" msgid "Transformation - Family of functions" msgstr "Transformación - Familia de funciones" -msgid "" -"This family of functions is used for transforming a given input graph :math:" -"`G(V,E)` into a new graph :math:`G'(V',E')`." -msgstr "" -"Esta familia de funciones se utiliza para transformar un grafo de entrada " -"determinado :math:`G(V,E)` en un nuevo grafo :math:`G'(V',E')`." +msgid "This family of functions is used for transforming a given input graph :math:`G(V,E)` into a new graph :math:`G'(V',E')`." +msgstr "Esta familia de funciones se utiliza para transformar un grafo de entrada determinado :math:`G(V,E)` en un nuevo grafo :math:`G'(V',E')`." msgid "Traversal - Family of functions" msgstr "Traversal - Familia de funciones" @@ -22243,19 +16208,11 @@ msgstr "Via- Categoria" msgid "This category intends to solve the general problem:" msgstr "La intención de esta categoría es resolver el problema general:" -msgid "" -"Given a graph and a list of vertices, find the shortest path between :math:" -"`vertex_i` and :math:`vertex_{i+1}` for all vertices" -msgstr "" -"Dado un grafo y una lista de vértices, encuentra el camino mas corto entre :" -"math:`vertex_i` and :math:`vertex_{i+1}` para todos los vértices" +msgid "Given a graph and a list of vertices, find the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all vertices" +msgstr "Dado un grafo y una lista de vértices, encuentra el camino mas corto entre :math:`vertex_i` and :math:`vertex_{i+1}` para todos los vértices" -msgid "" -"In other words, find a continuous route that visits all the vertices in the " -"order given." -msgstr "" -"En otras palabras, encuentre la ruta continua que visite todos los vértices " -"en el orden dado." +msgid "In other words, find a continuous route that visits all the vertices in the order given." +msgstr "En otras palabras, encuentre la ruta continua que visite todos los vértices en el orden dado." msgid "path" msgstr "camino" @@ -22272,19 +16229,14 @@ msgstr "es una secuencia de **caminos**" msgid "**Used in:**" msgstr "**Usado en:**" -msgid "" -"Besides the compulsory parameters each function has, there are optional " -"parameters that exist due to the kind of function." -msgstr "" -"Ademas de los parámetros obligatorios que tiene cada función, hay parámetros " -"opcionales que existen dado el tipo de función." +msgid "Besides the compulsory parameters each function has, there are optional parameters that exist due to the kind of function." +msgstr "Ademas de los parámetros obligatorios que tiene cada función, hay parámetros opcionales que existen dado el tipo de función." msgid "Used in all Via functions" msgstr "Usado en todas las funciones Via" msgid "Depending on the function one or more inner queries are needed." -msgstr "" -"Dependiendo de la función, serán necesarias una o mas consultas internas." +msgstr "Dependiendo de la función, serán necesarias una o mas consultas internas." msgid "withPoints - Category" msgstr "withPoints- Categoría" @@ -22292,46 +16244,20 @@ msgstr "withPoints- Categoría" msgid "When points are added to the graph." msgstr "Cuando los puntos se agregan al grafo." -msgid "" -"The **with points** category modifies the graph on the fly by adding points " -"on edges as required by the `Points SQL`_ query." -msgstr "" -"La categoría **with points** modifica el grafo continuamente al agregar " -"puntos en las aristas, como es requerido por la consulta `SQL de puntos`_ ." +msgid "The **with points** category modifies the graph on the fly by adding points on edges as required by the `Points SQL`_ query." +msgstr "La categoría **with points** modifica el grafo continuamente al agregar puntos en las aristas, como es requerido por la consulta `SQL de puntos`_ ." -msgid "" -"The functions within this category give the ability to process between " -"arbitrary points located outside the original graph." -msgstr "" -"Las funciones en esta categoría otorgan la habilidad de procesar entre " -"puntos arbitrarios ubicados afuera del grafo original." +msgid "The functions within this category give the ability to process between arbitrary points located outside the original graph." +msgstr "Las funciones en esta categoría otorgan la habilidad de procesar entre puntos arbitrarios ubicados afuera del grafo original." -msgid "" -"This category of functions was thought for routing vehicles, but might as " -"well work for some other application not involving vehicles." -msgstr "" -"Esta categoría de funciones se origino para el ruteo de vehículos, pero bien " -"puede funcionar si se aplica en algo que no incluya vehículos." +msgid "This category of functions was thought for routing vehicles, but might as well work for some other application not involving vehicles." +msgstr "Esta categoría de funciones se origino para el ruteo de vehículos, pero bien puede funcionar si se aplica en algo que no incluya vehículos." -msgid "" -"When given a point identifier ``pid`` that its being mapped to an edge with " -"an identifier ``edge_id``, with a fraction from the source to the target " -"along the edge ``fraction`` and some additional information about which side " -"of the edge the point is on ``side``, then processing from arbitrary points " -"can be done on fixed networks." -msgstr "" -"Cuando se da un identificador de punto ``pid`` que esta siendo mapeado a una " -"arista con un identificador``edge_id``, con una fracción de la fuente al " -"objetivo a lo largo de la arista ``fraction`` y existe información adicional " -"sobre de que lado de la arista el punto está ``side``, entonces el procesos " -"desde puntos arbitrarios se puede hacer en redes fijas." +msgid "When given a point identifier ``pid`` that its being mapped to an edge with an identifier ``edge_id``, with a fraction from the source to the target along the edge ``fraction`` and some additional information about which side of the edge the point is on ``side``, then processing from arbitrary points can be done on fixed networks." +msgstr "Cuando se da un identificador de punto ``pid`` que esta siendo mapeado a una arista con un identificador``edge_id``, con una fracción de la fuente al objetivo a lo largo de la arista ``fraction`` y existe información adicional sobre de que lado de la arista el punto está ``side``, entonces el procesos desde puntos arbitrarios se puede hacer en redes fijas." -msgid "" -"All this functions consider as many traits from the \"real world\" as " -"possible:" -msgstr "" -"Todas estas funciones consideran el mayor numero características posibles " -"del \"mundo real\":" +msgid "All this functions consider as many traits from the \"real world\" as possible:" +msgstr "Todas estas funciones consideran el mayor numero características posibles del \"mundo real\":" msgid "Kind of graph:" msgstr "Tipo de grafo:" @@ -22345,8 +16271,7 @@ msgstr "grafo **no dirigido**" msgid "Arriving at the point:" msgstr "Llegando al punto:" -msgid "" -"Compulsory arrival on the side of the segment where the point is located." +msgid "Compulsory arrival on the side of the segment where the point is located." msgstr "Llegada obligatoria en el lado del segmento donde se ubica el punto." msgid "On either side of the segment." @@ -22364,35 +16289,23 @@ msgstr "Manejando del lado **izquierdo**" msgid "Some points are:" msgstr "Algunos puntos son:" -msgid "" -"**Permanent**: for example the set of points of clients stored in a table in " -"the data base." -msgstr "" -"**Permanente**: por ejemplo el grupo de puntos de clientes guardados en una " -"table en la base de datos." +msgid "**Permanent**: for example the set of points of clients stored in a table in the data base." +msgstr "**Permanente**: por ejemplo el grupo de puntos de clientes guardados en una table en la base de datos." -msgid "" -"The graph has been modified to permanently have those points as vertices." -msgstr "" -"El grafo fue modificado para que tenga esos puntos como vértices de manera " -"permanente." +msgid "The graph has been modified to permanently have those points as vertices." +msgstr "El grafo fue modificado para que tenga esos puntos como vértices de manera permanente." msgid "There is a table on the database that describes the points" msgstr "Hay una table en la base de datos que describe los puntos" msgid "**Temporal**: for example points given through a web application" -msgstr "" -"**Temporal**: por ejemplo los puntos dados por una aplicación en la web" +msgstr "**Temporal**: por ejemplo los puntos dados por una aplicación en la web" msgid "The numbering of the points are handled with negative sign." msgstr "La numeración de los puntos se marca con signo negativo." -msgid "" -"This sign change is to avoid confusion when there is a vertex with the same " -"identifier as the point identifier." -msgstr "" -"El cambio de signo es para evitar confusión cuando hay un vértice con el " -"mismo identificador de un identificador de punto." +msgid "This sign change is to avoid confusion when there is a vertex with the same identifier as the point identifier." +msgstr "El cambio de signo es para evitar confusión cuando hay un vértice con el mismo identificador de un identificador de punto." msgid "Original point identifiers are to be positive." msgstr "Identificadores del punto original deben ser positivos." @@ -22413,34 +16326,20 @@ msgid "About points" msgstr "Sobre los puntos" #, fuzzy -msgid "" -"For this section the following city (see :doc:`sampledata`) some interesting " -"points such as restaurant, supermarket, post office, etc. will be used as " -"example." -msgstr "" -"Para esta sección de la siguiente ciudad (ver :doc:`sampledata`) algunos " -"puntos de interés como restaurantes, supermercado, oficina de correo, etc. " -"seran usadas de ejemplo." +msgid "For this section the following city (see :doc:`sampledata`) some interesting points such as restaurant, supermarket, post office, etc. will be used as example." +msgstr "Para esta sección de la siguiente ciudad (ver :doc:`sampledata`) algunos puntos de interés como restaurantes, supermercado, oficina de correo, etc. seran usadas de ejemplo." msgid "The graph is **directed**" msgstr "El grafo es **dirigido**" msgid "Red arrows show the ``(source, target)`` of the edge on the edge table" -msgstr "" -"Las flechas rojas muestran``(source, target)`` de la arista en al tabla de " -"aristas" +msgstr "Las flechas rojas muestran``(source, target)`` de la arista en al tabla de aristas" msgid "Blue arrows show the ``(target, source)`` of the edge on the edge table" -msgstr "" -"La flechas azules muestran ``(target, source)`` la arista en la tabla de " -"aristas" +msgstr "La flechas azules muestran ``(target, source)`` la arista en la tabla de aristas" -msgid "" -"Each point location shows where it is located with relation of the edge " -"``(source, target)``" -msgstr "" -"Cada ubicación de los puntos muestra su ubicación en relación con la arista " -"``(source, target)``" +msgid "Each point location shows where it is located with relation of the edge ``(source, target)``" +msgstr "Cada ubicación de los puntos muestra su ubicación en relación con la arista ``(source, target)``" msgid "On the right for points **2** and **4**." msgstr "A la derecha para los puntos **2** y **4**." @@ -22451,12 +16350,8 @@ msgstr "A la izquierda para los puntos **1**, **3** y**5**." msgid "On both sides for point **6**." msgstr "En ambos lados para el punto **6**." -msgid "" -"The representation on the data base follows the `Points SQL`_ description, " -"and for this example:" -msgstr "" -"La representación de la base de datos sigue la descripción `SQL de " -"puntos`_ , y para este ejemplo:" +msgid "The representation on the data base follows the `Points SQL`_ description, and for this example:" +msgstr "La representación de la base de datos sigue la descripción `SQL de puntos`_ , y para este ejemplo:" msgid "Driving side" msgstr "Lado de manejo" @@ -22471,12 +16366,8 @@ msgstr "Los vértices cuadrados son vértices temporales," msgid "The temporary vertices are added according to the driving side," msgstr "Los vértices temporales se agregan según el lado de conducción," -msgid "" -"visually showing the differences on how depending on the driving side the " -"data is interpreted." -msgstr "" -"visualmente mostrando las diferencias dependiendo de como se interpreta la " -"información de lado de conducción." +msgid "visually showing the differences on how depending on the driving side the data is interpreted." +msgstr "visualmente mostrando las diferencias dependiendo de como se interpreta la información de lado de conducción." msgid "Point **1** located on edge ``(6, 5)``" msgstr "Punto**1** ubicado en la arista ``(6, 5)``" @@ -22506,8 +16397,7 @@ msgid "Point **4** located on edge ``(3, 1)``" msgstr "Punto **4** ubicado en la arista``(3, 1)``" msgid "Like having all points to be considered in both sides ``b``" -msgstr "" -"Como si se tuvieran todos los puntos en ambos lados considerados como ``b``" +msgstr "Como si se tuvieran todos los puntos en ambos lados considerados como ``b``" #, fuzzy msgid "Preferred usage on **undirected** graphs" @@ -22528,9 +16418,7 @@ msgstr "" msgid "Creating temporary vertices" msgstr "Creación de vértices temporales" -msgid "" -"This section will demonstrate how a temporary vertex is created internally " -"on the graph." +msgid "This section will demonstrate how a temporary vertex is created internally on the graph." msgstr "" msgid "Problem" @@ -22558,9 +16446,7 @@ msgstr "Sólo afecta a la arista ``(16, 17)``, por lo que la arista se elimina." msgid "Create two new edges:" msgstr "Crear dos aristas nuevas:" -msgid "" -"Edge ``(16, -2)`` with cost ``0.4`` (original cost * fraction == :math:`1 * " -"0.4`)" +msgid "Edge ``(16, -2)`` with cost ``0.4`` (original cost * fraction == :math:`1 * 0.4`)" msgstr "" msgid "Edge ``(-2, 17)`` with cost ``0.6`` (the remaining cost)" @@ -22569,8 +16455,7 @@ msgstr "" msgid "The total cost of the additional edges is equal to the original cost." msgstr "" -msgid "" -"If more points are on the same edge, the process is repeated recursevly." +msgid "If more points are on the same edge, the process is repeated recursevly." msgstr "" msgid "On a left hand side driving network" @@ -22586,22 +16471,16 @@ msgstr "" msgid "It only affects the edge ``(17, 16)``, therefore the edge is removed." msgstr "Sólo afecta a la arista ``(17, 16)``, por lo que la arista se elimina." -msgid "" -"Work with the original edge ``(16, 17)`` as the fraction is a fraction of " -"the original:" +msgid "Work with the original edge ``(16, 17)`` as the fraction is a fraction of the original:" msgstr "" msgid "Flip the Edges and add them to the graph:" msgstr "" -msgid "" -"Edge ``(17, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the " -"graph." +msgid "Edge ``(17, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the graph." msgstr "" -msgid "" -"Edge ``(-2, 16)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the " -"graph." +msgid "Edge ``(-2, 16)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the graph." msgstr "" msgid "When driving side does not matter" @@ -22611,12 +16490,8 @@ msgstr "Cuando el lado de conducción no importa" msgid "Arrival to point ``-2`` can be achieved via vertices **16** or **17**." msgstr "Llegada al punto ``-2`` se logra solo vía el vértice **17**." -msgid "" -"Affects the edges ``(16, 17)`` and ``(17, 16)``, therefore the edges are " -"removed." -msgstr "" -"Afecta las aristas ``(16, 17)`` y ``(17, 16)`` por lo que esas aristas se " -"eliminan." +msgid "Affects the edges ``(16, 17)`` and ``(17, 16)``, therefore the edges are removed." +msgstr "Afecta las aristas ``(16, 17)`` y ``(17, 16)`` por lo que esas aristas se eliminan." msgid "Create four new edges:" msgstr "Crear cuatro nuevas aristas:" @@ -22630,23 +16505,16 @@ msgstr "" msgid "Edge ``(-2, 17)`` is added to the graph." msgstr "" -msgid "" -"Edge ``(16, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the " -"graph." +msgid "Edge ``(16, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the graph." msgstr "" -msgid "" -"Edge ``(-2, 17)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the " -"graph." +msgid "Edge ``(-2, 17)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the graph." msgstr "" msgid "withPoints - Family of functions" msgstr "withPoints - Familia de funciones" -msgid "" -"This family of functions belongs to the :doc:`withPoints-category` and the " -"functions that compose them are based one way or another on dijkstra " -"algorithm." +msgid "This family of functions belongs to the :doc:`withPoints-category` and the functions that compose them are based one way or another on dijkstra algorithm." msgstr "" msgid "Depending on the name:" @@ -22670,6 +16538,9 @@ 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 "``pgr_bellmanFord - Experimental``" +#~ msgstr "``pgr_bellmanFord`` - Experimental" + #~ msgid "``pgr_dijkstraNear`` - Proposed" #~ msgstr "``pgr_dijkstraNear`` - Propuesto" @@ -22679,12 +16550,8 @@ msgstr "pgr_withPoints es pgr_dijkstraVia **con puntos**" #~ msgid "Additionally there are 2 categories under this family" #~ msgstr "Adicionalmente, hay dos categorías en esta familia" -#~ msgid "" -#~ "`#2913 `__: " -#~ "pgr_DAGshortestPath" -#~ msgstr "" -#~ "`#2913 `__: " -#~ "pgr_DAGshortestPath" +#~ msgid "`#2913 `__: pgr_DAGshortestPath" +#~ msgstr "`#2913 `__: pgr_DAGshortestPath" #~ msgid "_pgr_withpointsksp => _pgr_withpointsksp_v4" #~ msgstr "_pgr_withpointsksp => _pgr_withpointsksp_v4" @@ -22693,12 +16560,8 @@ msgstr "pgr_withPoints es pgr_dijkstraVia **con puntos**" #~ msgid "Validity of **driving side** parameter" #~ msgstr "Lado de manejo derecho" -#~ msgid "" -#~ "**driving side** parameter is unnamed compulsory, and valid values differ " -#~ "for directed and undirected graphs." -#~ msgstr "" -#~ "El parámetro **lado de manjeo** es obligatorio sin nombre, y los valores " -#~ "válidos difieren para grafos dirigidos y no dirigidos." +#~ msgid "**driving side** parameter is unnamed compulsory, and valid values differ for directed and undirected graphs." +#~ msgstr "El parámetro **lado de manjeo** es obligatorio sin nombre, y los valores válidos difieren para grafos dirigidos y no dirigidos." #~ msgid "Does not have a default value." #~ msgstr "No tiene un valor de facto." @@ -22706,14 +16569,8 @@ msgstr "pgr_withPoints es pgr_dijkstraVia **con puntos**" #~ msgid "Using an invalid value throws an ``ERROR``." #~ msgstr "El uso de un valor inválido lanza un ``ERROR``." -#~ msgid "" -#~ "And ``driving side`` parameter changed from named optional to unnamed " -#~ "compulsory **driving side** and its validity differ for directed and " -#~ "undirected graphs." -#~ msgstr "" -#~ "Y el parámetro \"driving side\" ha cambiado de opcional con nombre a " -#~ "obligatorio sin nombre **driving side** y su validez difiere para grafos " -#~ "dirigidos y no dirigidos." +#~ msgid "And ``driving side`` parameter changed from named optional to unnamed compulsory **driving side** and its validity differ for directed and undirected graphs." +#~ msgstr "Y el parámetro \"driving side\" ha cambiado de opcional con nombre a obligatorio sin nombre **driving side** y su validez difiere para grafos dirigidos y no dirigidos." #, fuzzy #~ msgid "if OFF the Spaish documentation will no be built" @@ -22723,34 +16580,8 @@ msgstr "pgr_withPoints es pgr_dijkstraVia **con puntos**" #~ msgstr "Regina Obe, Vicky Vergara" #, fuzzy -#~ msgid "" -#~ "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio " -#~ "Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, " -#~ "Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, " -#~ "Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, " -#~ "Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic " -#~ "Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, " -#~ "Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko " -#~ "Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, " -#~ "Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, " -#~ "Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, " -#~ "Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, " -#~ "Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan " -#~ "Jain, Virginia Vergara, Yige Huang" -#~ msgstr "" -#~ "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio " -#~ "Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, " -#~ "Ashraf Hossain, Ashish Kumar, Cayetano Benavent, Christian Gonzalez, " -#~ "Daniel Kastl, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, " -#~ "Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa " -#~ "Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, " -#~ "Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata " -#~ "Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, " -#~ "Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, " -#~ "Razequl Islam, Regina Obe, Rohith Reddy, Sarthak Agarwal, Shobhit " -#~ "Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain " -#~ "Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, " -#~ "Yige Huang" +#~ msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" +#~ msgstr "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" #, fuzzy #~ msgid "..rubric:: Version 3.0.0" @@ -22763,188 +16594,98 @@ msgstr "pgr_withPoints es pgr_dijkstraVia **con puntos**" #~ msgstr "|boost| graph adentro." #, fuzzy -#~ msgid "" -#~ "pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -#~ "**via vertices**, **driving side** [**options**])" -#~ msgstr "" -#~ "pgr_trspVia_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL " -#~ "de puntos`_, **vertices**, [**opciones**])" +#~ msgid "pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, **driving side** [**options**])" +#~ msgstr "pgr_trspVia_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_, **vertices**, [**opciones**])" #~ msgid "**driving side**" #~ msgstr "**Lado de manejo**" #~ msgid "[``r``, ``R``] for right driving side (for directed graph only)" -#~ msgstr "" -#~ "[``r``, ``R``] para el manejo del lado derecho (solamente grafo dirigido)" +#~ msgstr "[``r``, ``R``] para el manejo del lado derecho (solamente grafo dirigido)" #~ msgid "[``l``, ``L``] for left driving side (for directed graph only)" -#~ msgstr "" -#~ "[``l``, ``L``] para manejo por lad izquierdo (solo gráfos dirigidos)" - -#~ msgid "" -#~ "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -#~ "**start vid**, **end vid**, [**options**])" -#~ msgstr "" -#~ "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de " -#~ "puntos`_,**salida**, **destino**, [**opciones**])" - -#~ msgid "" -#~ "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -#~ "**start vid**, **end vids**, [**options**])" -#~ msgstr "" -#~ "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de " -#~ "puntos`_,**salida**, **destinos**, [**opciones**])" - -#~ msgid "" -#~ "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -#~ "**start vids**, **end vid**, [**options**])" -#~ msgstr "" -#~ "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de " -#~ "puntos`_,**salidas**, **destino**, [**opciones**])" - -#~ msgid "" -#~ "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -#~ "**start vids**, **end vids**, [**options**])" -#~ msgstr "" -#~ "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de " -#~ "puntos`_,**salidas**, **destinos**, [**opciones**])" - -#~ msgid "" -#~ "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Combinations " -#~ "SQL`_, `Points SQL`_, [**options**])" -#~ msgstr "" -#~ "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de " -#~ "combinaciones`_, `SQL de puntos`_, [**opciones**])" +#~ msgstr "[``l``, ``L``] para manejo por lad izquierdo (solo gráfos dirigidos)" + +#~ msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vid**, [**options**])" +#~ msgstr "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_,**salida**, **destino**, [**opciones**])" + +#~ msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**options**])" +#~ msgstr "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_,**salida**, **destinos**, [**opciones**])" + +#~ msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vid**, [**options**])" +#~ msgstr "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_,**salidas**, **destino**, [**opciones**])" + +#~ msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vids**, [**options**])" +#~ msgstr "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_,**salidas**, **destinos**, [**opciones**])" + +#~ msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, `Points SQL`_, [**options**])" +#~ msgstr "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de combinaciones`_, `SQL de puntos`_, [**opciones**])" #~ msgid "**options:** ``[directed, driving_side, details]``" #~ msgstr "**opcionales:** ``[directed, driving_side, details]``" #, fuzzy -#~ msgid "" -#~ "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -#~ "**start vid**, **end vids**, **driving side** [**options**])" -#~ msgstr "" -#~ "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de " -#~ "puntos`_,**salida**, **destinos**, [**opciones**])" +#~ msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, **driving side** [**options**])" +#~ msgstr "pgr_trsp_withPoints(`SQL de aristas`_, `SQL de restricciones`_, `SQL de puntos`_,**salida**, **destinos**, [**opciones**])" #, fuzzy -#~ msgid "" -#~ "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, " -#~ "**driving side** [**options**])" -#~ msgstr "" -#~ "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, " -#~ "**destino**, **K**, **lado de manejo**, [**opciones**])" +#~ msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **driving side** [**options**])" +#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destino**, **K**, **lado de manejo**, [**opciones**])" #, fuzzy -#~ msgid "" -#~ "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, " -#~ "**driving side** [**options**])" -#~ msgstr "" -#~ "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, " -#~ "**destinos**, **K**, **lado de manejo**, [**opciones**])" +#~ msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **driving side** [**options**])" +#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destinos**, **K**, **lado de manejo**, [**opciones**])" #, fuzzy -#~ msgid "" -#~ "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, " -#~ "**driving side** [**options**])" -#~ msgstr "" -#~ "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, " -#~ "**destino**, **K**, **lado de manejo**, [**opciones**])" +#~ msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **driving side** [**options**])" +#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destino**, **K**, **lado de manejo**, [**opciones**])" #, fuzzy -#~ msgid "" -#~ "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, " -#~ "**driving side** [**options**])" -#~ msgstr "" -#~ "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, " -#~ "**destinos**, **K**, **lado de manejo**, [**opciones**])" +#~ msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **driving side** [**options**])" +#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destinos**, **K**, **lado de manejo**, [**opciones**])" #, fuzzy -#~ msgid "" -#~ "pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, " -#~ "**driving side** [**options**])" -#~ msgstr "" -#~ "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, `SQL de " -#~ "combinaciones`_, **K**, **lado de manejo**, [**opciones**])" +#~ msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **driving side** [**options**])" +#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, `SQL de combinaciones`_, **K**, **lado de manejo**, [**opciones**])" #, fuzzy -#~ msgid "" -#~ "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end " -#~ "vid**, **driving side** [**options**])" -#~ msgstr "" -#~ "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, " -#~ "**destino**, **K**, **lado de manejo**, [**opciones**])" +#~ msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **driving side** [**options**])" +#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destino**, **K**, **lado de manejo**, [**opciones**])" #, fuzzy -#~ msgid "" -#~ "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end " -#~ "vids**, **driving side** [**options**])" -#~ msgstr "" -#~ "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, " -#~ "**destinos**, **K**, **lado de manejo**, [**opciones**])" +#~ msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **driving side** [**options**])" +#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destinos**, **K**, **lado de manejo**, [**opciones**])" #, fuzzy -#~ msgid "" -#~ "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end " -#~ "vid**, **driving side** [**options**])" -#~ msgstr "" -#~ "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, " -#~ "**destino**, **K**, **lado de manejo**, [**opciones**])" +#~ msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **driving side** [**options**])" +#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destino**, **K**, **lado de manejo**, [**opciones**])" #, fuzzy -#~ msgid "" -#~ "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end " -#~ "vids**, **driving side** [**options**])" -#~ msgstr "" -#~ "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, " -#~ "**destinos**, **K**, **lado de manejo**, [**opciones**])" +#~ msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **driving side** [**options**])" +#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destinos**, **K**, **lado de manejo**, [**opciones**])" #, fuzzy -#~ msgid "" -#~ "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, " -#~ "**driving side** [**options**])" -#~ msgstr "" -#~ "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, `SQL de " -#~ "combinaciones`_, **K**, **lado de manejo**, [**opciones**])" +#~ msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **driving side** [**options**])" +#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, `SQL de combinaciones`_, **K**, **lado de manejo**, [**opciones**])" #, fuzzy -#~ msgid "" -#~ "pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, " -#~ "**driving side** [**options**])" -#~ msgstr "" -#~ "pgr_withPointsCostMatrix(`SQL de aristas`_, `SQL de puntos`_, " -#~ "**salidas**, [**opciones**])" +#~ msgid "pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, **driving side** [**options**])" +#~ msgstr "pgr_withPointsCostMatrix(`SQL de aristas`_, `SQL de puntos`_, **salidas**, [**opciones**])" #~ msgid "Using the default ``driving_side`` value" #~ msgstr "Usando el valor predeterminado ``driving_side``" -#~ msgid "" -#~ "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, " -#~ "**driving side**, [**options A**])" -#~ msgstr "" -#~ "pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raíz**, " -#~ "**distancia**, **lado de manejo**, [**opciones A**])" - -#~ msgid "" -#~ "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, " -#~ "**distance**, **driving side**, [**options B**])" -#~ msgstr "" -#~ "pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raices**, " -#~ "**distancia**, **lado de manejo**, [**opciones B**])" - -#~ msgid "" -#~ "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, " -#~ "**driving side**, [**options**])" -#~ msgstr "" -#~ "pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raíz**, " -#~ "**distancia**, **lado de manejo**, [**opciones**])" - -#~ msgid "" -#~ "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, " -#~ "**distance**, **driving side**, [**options**])" -#~ msgstr "" -#~ "pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raices**, " -#~ "**distancia**, **lado de manejo**, [**opciones**])" +#~ msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, **driving side**, [**options A**])" +#~ msgstr "pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raíz**, **distancia**, **lado de manejo**, [**opciones A**])" + +#~ msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, **driving side**, [**options B**])" +#~ msgstr "pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raices**, **distancia**, **lado de manejo**, [**opciones B**])" + +#~ msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, **driving side**, [**options**])" +#~ msgstr "pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raíz**, **distancia**, **lado de manejo**, [**opciones**])" + +#~ msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, **driving side**, [**options**])" +#~ msgstr "pgr_withPointsDD(`SQL de aristas`_, `SQL de puntos`_, **raices**, **distancia**, **lado de manejo**, [**opciones**])" #~ msgid "``r``, ``R`` for right driving side," #~ msgstr "``r``, ``R`` para el manejo del lado derecho," @@ -22956,134 +16697,53 @@ msgstr "pgr_withPoints es pgr_dijkstraVia **con puntos**" #~ msgstr "``b``, ``B`` para ambos." #~ msgid "Valid values differ for directed and undirected graphs:" -#~ msgstr "" -#~ "Valores válidos son differentes para grafos dirigidos y no dirigidos:" +#~ msgstr "Valores válidos son differentes para grafos dirigidos y no dirigidos:" #~ msgid "In undirected graphs: [``b``, ``B``]." #~ msgstr "En grafos no dirigidos: [``b``, ``B``]." -#~ msgid "" -#~ "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end " -#~ "vid**, **K**, **driving_side**, [**options**])" -#~ msgstr "" -#~ "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, " -#~ "**destino**, **K**, **lado de manejo**, [**opciones**])" - -#~ msgid "" -#~ "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end " -#~ "vids**, **K**, **driving_side**, [**options**])" -#~ msgstr "" -#~ "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, " -#~ "**destinos**, **K**, **lado de manejo**, [**opciones**])" - -#~ msgid "" -#~ "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end " -#~ "vid**, **K**, **driving_side**, [**options**])" -#~ msgstr "" -#~ "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, " -#~ "**destino**, **K**, **lado de manejo**, [**opciones**])" - -#~ msgid "" -#~ "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end " -#~ "vids**, **K**, **driving_side**, [**options**])" -#~ msgstr "" -#~ "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, " -#~ "**destinos**, **K**, **lado de manejo**, [**opciones**])" - -#~ msgid "" -#~ "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, " -#~ "**K**, **driving_side**, [**options**])" -#~ msgstr "" -#~ "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, `SQL de " -#~ "combinaciones`_, **K**, **lado de manejo**, [**opciones**])" - -#, fuzzy -#~ msgid "" -#~ "pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, " -#~ "**driving side** [**options**])" -#~ msgstr "" -#~ "pgr_withPointsVia(`SQL de aristas`_, `SQL de puntos`_, ****vértices****, " -#~ "[**opciones**])" +#~ msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, **driving_side**, [**options**])" +#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destino**, **K**, **lado de manejo**, [**opciones**])" + +#~ msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, **driving_side**, [**options**])" +#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salida**, **destinos**, **K**, **lado de manejo**, [**opciones**])" + +#~ msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, **driving_side**, [**options**])" +#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destino**, **K**, **lado de manejo**, [**opciones**])" + +#~ msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, **driving_side**, [**options**])" +#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, **salidas**, **destinos**, **K**, **lado de manejo**, [**opciones**])" + +#~ msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, **driving_side**, [**options**])" +#~ msgstr "pgr_withPointsKSP(`SQL de aristas`_, `SQL de puntos`_, `SQL de combinaciones`_, **K**, **lado de manejo**, [**opciones**])" + +#, fuzzy +#~ msgid "pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, **driving side** [**options**])" +#~ msgstr "pgr_withPointsVia(`SQL de aristas`_, `SQL de puntos`_, ****vértices****, [**opciones**])" #, fuzzy #~ msgid "Regina Obe, Saloni kumari, Vicky Vergara" #~ msgstr "Regina Obe, Vicky Vergara" #, fuzzy -#~ msgid "" -#~ "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio " -#~ "Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, " -#~ "Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, " -#~ "Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, " -#~ "Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic " -#~ "Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, " -#~ "Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko " -#~ "Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, " -#~ "Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, " -#~ "Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, " -#~ "Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen " -#~ "Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit " -#~ "Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" -#~ msgstr "" -#~ "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio " -#~ "Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, " -#~ "Ashraf Hossain, Ashish Kumar, Cayetano Benavent, Christian Gonzalez, " -#~ "Daniel Kastl, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, " -#~ "Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa " -#~ "Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, " -#~ "Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata " -#~ "Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, " -#~ "Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, " -#~ "Razequl Islam, Regina Obe, Rohith Reddy, Sarthak Agarwal, Shobhit " -#~ "Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain " -#~ "Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, " -#~ "Yige Huang" +#~ msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" +#~ msgstr "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" #, fuzzy #~ msgid "New experimental function" #~ msgstr "Nueva función experimental." #, fuzzy -#~ msgid "" -#~ ":doc:`pgr_kingOrdering` - Returns the King ordering of an undirected " -#~ "graphs acyclic graph." -#~ msgstr "" -#~ ":doc:`pgr_cuthillMckeeOrdering` - Ordenamiento Cuthill-McKee de grafo sin " -#~ "no dirigido." +#~ msgid ":doc:`pgr_kingOrdering` - Returns the King ordering of an undirected graphs acyclic graph." +#~ msgstr ":doc:`pgr_cuthillMckeeOrdering` - Ordenamiento Cuthill-McKee de grafo sin no dirigido." #, fuzzy #~ msgid "Fan Wu Regina Obe, Saloni kumari, Vicky Vergara" #~ msgstr "Regina Obe, Vicky Vergara" #, fuzzy -#~ msgid "" -#~ "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio " -#~ "Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, " -#~ "Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, " -#~ "Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, " -#~ "Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, " -#~ "Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu " -#~ "Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, " -#~ "Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, " -#~ "Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, " -#~ "Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, " -#~ "Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen " -#~ "Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit " -#~ "Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" -#~ msgstr "" -#~ "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio " -#~ "Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, " -#~ "Ashraf Hossain, Ashish Kumar, Cayetano Benavent, Christian Gonzalez, " -#~ "Daniel Kastl, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, " -#~ "Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa " -#~ "Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, " -#~ "Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata " -#~ "Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, " -#~ "Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, " -#~ "Razequl Islam, Regina Obe, Rohith Reddy, Sarthak Agarwal, Shobhit " -#~ "Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain " -#~ "Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, " -#~ "Yige Huang" +#~ msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" +#~ msgstr "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" #~ msgid "New **experimental** function" #~ msgstr "Nueva función **experimental**" diff --git a/locale/ja/LC_MESSAGES/pgrouting_doc_strings.po b/locale/ja/LC_MESSAGES/pgrouting_doc_strings.po index 856d27b608..46bdb2c0ea 100644 --- a/locale/ja/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/ja/LC_MESSAGES/pgrouting_doc_strings.po @@ -20,11 +20,10 @@ msgid "" msgstr "" "Project-Id-Version: pgRouting v4.1\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2025-10-08 19:15+0000\n" +"POT-Creation-Date: 2025-12-05 23:37+0000\n" "PO-Revision-Date: 2025-09-22 16:27+0000\n" "Last-Translator: Celia Virginia Vergara Castillo \n" -"Language-Team: Japanese \n" +"Language-Team: Japanese \n" "Language: ja\n" "MIME-Version: 1.0\n" "Content-Type: text/plain; charset=UTF-8\n" @@ -96,9 +95,7 @@ msgstr "``BIGINT``" msgid "Identifier of the root vertex of the tree." msgstr "" -msgid "" -"When value is :math:`0` then gets the spanning forest starting in aleatory " -"nodes for each tree in the forest." +msgid "When value is :math:`0` then gets the spanning forest starting in aleatory nodes for each tree in the forest." msgstr "" msgid "**root vids**" @@ -197,9 +194,7 @@ msgstr "" msgid "Weight of the edge (``target``, ``source``)" msgstr "" -msgid "" -"When negative: edge (``target``, ``source``) does not exist, therefore it's " -"not part of the graph." +msgid "When negative: edge (``target``, ``source``) does not exist, therefore it's not part of the graph." msgstr "" msgid "``SMALLINT``, ``INTEGER``, ``BIGINT``" @@ -270,24 +265,16 @@ msgstr "" msgid "See Also" msgstr "参照" -msgid "" -"`Boost: Prim's algorithm `__" +msgid "`Boost: Prim's algorithm `__" msgstr "" -msgid "" -"`Boost: Kruskal's algorithm `__" +msgid "`Boost: Kruskal's algorithm `__" msgstr "" -msgid "" -"`Wikipedia: Prim's algorithm `__" +msgid "`Wikipedia: Prim's algorithm `__" msgstr "" -msgid "" -"`Wikipedia: Kruskal's algorithm `__" +msgid "`Wikipedia: Kruskal's algorithm `__" msgstr "" msgid "Indices and tables" @@ -329,15 +316,12 @@ msgid "Name, signature and functionality might not change." msgstr "機能は変更されない場合があります。(しかし、まだ変更することもできます)" msgid "pgTap tests have being done. But might need more." -msgstr "" -"pgTap テストが行われています。しかし、さらなるテストが必要となるかもしれませ" -"ん。" +msgstr "pgTap テストが行われています。しかし、さらなるテストが必要となるかもしれません。" msgid "Documentation might need refinement." msgstr "ドキュメントには改良が必要な場合があります。" -msgid "" -":doc:`pgr_depthFirstSearch` - Depth first search traversal of the graph." +msgid ":doc:`pgr_depthFirstSearch` - Depth first search traversal of the graph." msgstr "" msgid "In general:" @@ -368,8 +352,7 @@ msgstr "" msgid ":doc:`pgr_trsp_withPoints` - Vertex/Point routing with restrictions." msgstr "" -msgid "" -":doc:`pgr_trspVia_withPoints` - Via Vertex/point routing with restrictions." +msgid ":doc:`pgr_trspVia_withPoints` - Via Vertex/point routing with restrictions." msgstr "" msgid "Experimental" @@ -414,21 +397,13 @@ msgstr "" msgid "Introduction" msgstr "序章" -msgid "" -"Road restrictions are a sequence of road segments that can not be taken in a " -"sequential manner. Some restrictions are implicit on a directed graph, for " -"example, one way roads where the wrong way edge is not even inserted on the " -"graph. But normally on turns like no left turn or no right turn, hence the " -"name turn restrictions, there are sometimes restrictions." +msgid "Road restrictions are a sequence of road segments that can not be taken in a sequential manner. Some restrictions are implicit on a directed graph, for example, one way roads where the wrong way edge is not even inserted on the graph. But normally on turns like no left turn or no right turn, hence the name turn restrictions, there are sometimes restrictions." msgstr "" msgid "TRSP algorithm" msgstr "" -msgid "" -"The internal TRSP algorithm performs a lookahead over the dijkstra algorithm " -"in order to find out if the attempted path has a restriction. This allows " -"the algorithm to pass twice on the same vertex." +msgid "The internal TRSP algorithm performs a lookahead over the dijkstra algorithm in order to find out if the attempted path has a restriction. This allows the algorithm to pass twice on the same vertex." msgstr "" msgid "`Edges SQL`_ query as described." @@ -452,14 +427,10 @@ msgstr "" msgid "Restrictions" msgstr "" -msgid "" -"On road networks, there are restrictions such as left or right turn " -"restrictions, no U turn restrictions." +msgid "On road networks, there are restrictions such as left or right turn restrictions, no U turn restrictions." msgstr "" -msgid "" -"A restriction is a sequence of edges, called path and that path is to be " -"avoided." +msgid "A restriction is a sequence of edges, called path and that path is to be avoided." msgstr "" msgid "**Restrictions on the road network**" @@ -468,10 +439,7 @@ msgstr "" msgid "These restrictions are represented on a table as follows:" msgstr "" -msgid "" -"The table has an identifier, which maybe is needed for the administration of " -"the restrictions, but the algorithms do not need that information. If given " -"it will be ignored." +msgid "The table has an identifier, which maybe is needed for the administration of the restrictions, but the algorithms do not need that information. If given it will be ignored." msgstr "" msgid "Restrictions SQL" @@ -483,10 +451,7 @@ msgstr "" msgid "``ARRAY`` [**ANY-INTEGER**]" msgstr "" -msgid "" -"Sequence of edge identifiers that form a path that is not allowed to be " -"taken. - Empty arrays or ``NULL`` arrays are ignored. - Arrays that have a " -"``NULL`` element will raise an exception." +msgid "Sequence of edge identifiers that form a path that is not allowed to be taken. - Empty arrays or ``NULL`` arrays are ignored. - Arrays that have a ``NULL`` element will raise an exception." msgstr "" msgid "``Cost``" @@ -516,30 +481,18 @@ msgstr "問題の定義" msgid "The travelling salesperson problem (TSP) asks the following question:" msgstr "" -msgid "" -"*Given a list of cities and the distances between each pair of cities, which " -"is the shortest possible route that visits each city exactly once and " -"returns to the origin city?*" -msgstr "" -"*都市の一覧と各都市間の距離を指定し、どの都市も必ず一回訪問し元の都市に戻って" -"くるための最短ルートはどうなるか?*" +msgid "*Given a list of cities and the distances between each pair of cities, which is the shortest possible route that visits each city exactly once and returns to the origin city?*" +msgstr "*都市の一覧と各都市間の距離を指定し、どの都市も必ず一回訪問し元の都市に戻ってくるための最短ルートはどうなるか?*" msgid "Origin" msgstr "発端" -msgid "" -"The traveling sales person problem was studied in the 18th century by " -"mathematicians **Sir William Rowam Hamilton** and **Thomas Penyngton " -"Kirkman**." +msgid "The traveling sales person problem was studied in the 18th century by mathematicians **Sir William Rowam Hamilton** and **Thomas Penyngton Kirkman**." msgstr "" #, fuzzy -msgid "" -"A discussion about the work of Hamilton & Kirkman can be found in the book " -"**Graph Theory (Biggs et al. 1976)**." -msgstr "" -"Hamilton & Kirkman の業績についての議論は **Graph Theory (Biggs et al. " -"1976)** という書籍に見出すことができます。" +msgid "A discussion about the work of Hamilton & Kirkman can be found in the book **Graph Theory (Biggs et al. 1976)**." +msgstr "Hamilton & Kirkman の業績についての議論は **Graph Theory (Biggs et al. 1976)** という書籍に見出すことができます。" msgid "ISBN-13: 978-0198539162" msgstr "ISBN-13: 978-0198539162" @@ -547,13 +500,7 @@ msgstr "ISBN-13: 978-0198539162" msgid "ISBN-10: 0198539169" msgstr "ISBN-10: 0198539169" -msgid "" -"It is believed that the general form of the TSP have been first studied by " -"Kalr Menger in Vienna and Harvard. The problem was later promoted by " -"Hassler, Whitney & Merrill at Princeton. A detailed description about the " -"connection between Menger & Whitney, and the development of the TSP can be " -"found in `On the history of combinatorial optimization (till 1960) `__" +msgid "It is believed that the general form of the TSP have been first studied by Kalr Menger in Vienna and Harvard. The problem was later promoted by Hassler, Whitney & Merrill at Princeton. A detailed description about the connection between Menger & Whitney, and the development of the TSP can be found in `On the history of combinatorial optimization (till 1960) `__" msgstr "" #, fuzzy @@ -572,12 +519,9 @@ msgstr "そして、3番目の都市のための :math:`n-2` の選択肢など #, fuzzy msgid "Multiplying these together we get :math:`(n-1)! = (n-1) (n-2) . . 1`." -msgstr "" -"これらを掛け合わせると、 :math:`(n-1)! = (n-1) (n-2) . . 1` となります。" +msgstr "これらを掛け合わせると、 :math:`(n-1)! = (n-1) (n-2) . . 1` となります。" -msgid "" -"Now since the travel costs do not depend on the direction taken around the " -"tour:" +msgid "Now since the travel costs do not depend on the direction taken around the tour:" msgstr "" msgid "this number by 2" @@ -595,9 +539,7 @@ msgstr "これはNP困難最適化の問題です。" msgid "Metric Algorithm is used" msgstr "" -msgid "" -"Implementation generates solutions that *are twice as long as the optimal " -"tour in the worst case*:" +msgid "Implementation generates solutions that *are twice as long as the optimal tour in the worst case*:" msgstr "" msgid "Graph characteristics for best performance:" @@ -615,9 +557,7 @@ msgstr "" msgid "The traveling costs are symmetric:" msgstr "" -msgid "" -"Traveling costs from ``u`` to ``v`` are just as much as traveling from ``v`` " -"to ``u``" +msgid "Traveling costs from ``u`` to ``v`` are just as much as traveling from ``v`` to ``u``" msgstr "" msgid "TSP optional parameters" @@ -641,32 +581,23 @@ msgstr "" msgid "Last visiting vertex before returning to ``start_vid``." msgstr "" -msgid "" -"When ``0`` any vertex can become the last visiting vertex before returning " -"to ``start_id``." +msgid "When ``0`` any vertex can become the last visiting vertex before returning to ``start_id``." msgstr "" -msgid "" -"When ``NOT 0`` and ``start_id = 0`` then it is the first and last vertex" +msgid "When ``NOT 0`` and ``start_id = 0`` then it is the first and last vertex" msgstr "" msgid "References" msgstr "参照" -msgid "" -"`Boost: metric TSP approx `__" +msgid "`Boost: metric TSP approx `__" msgstr "" msgid "`University of Waterloo TSP `__" msgstr "" -msgid "" -"`Wikipedia: Traveling Salesman Problem `__" -msgstr "" -"`Wikipedia: 巡回セールスマン問題 `__" +msgid "`Wikipedia: Traveling Salesman Problem `__" +msgstr "`Wikipedia: 巡回セールスマン問題 `__" msgid "Vehicle Routing Functions - Category" msgstr "" @@ -677,8 +608,7 @@ msgstr "" msgid ":doc:`pgr_pickDeliver` - Pickup & Delivery using a Cost Matrix" msgstr "" -msgid "" -":doc:`pgr_pickDeliverEuclidean` - Pickup & Delivery with Euclidean distances" +msgid ":doc:`pgr_pickDeliverEuclidean` - Pickup & Delivery with Euclidean distances" msgstr "" msgid "Distribution problem" @@ -690,9 +620,7 @@ msgstr "" msgid "Contents" msgstr "コンテンツ" -msgid "" -"Vehicle Routing Problems `VRP` are **NP-hard** optimization problem, it " -"generalises the travelling salesman problem (TSP)." +msgid "Vehicle Routing Problems `VRP` are **NP-hard** optimization problem, it generalises the travelling salesman problem (TSP)." msgstr "" msgid "The objective of the VRP is to minimize the total route cost." @@ -704,20 +632,13 @@ msgstr "" msgid "**pgRouting does not try to implement all variants.**" msgstr "" -msgid "" -"Capacitated Vehicle Routing Problem `CVRP` where The vehicles have limited " -"carrying capacity of the goods." +msgid "Capacitated Vehicle Routing Problem `CVRP` where The vehicles have limited carrying capacity of the goods." msgstr "" -msgid "" -"Vehicle Routing Problem with Time Windows `VRPTW` where the locations have " -"time windows within which the vehicle's visits must be made." +msgid "Vehicle Routing Problem with Time Windows `VRPTW` where the locations have time windows within which the vehicle's visits must be made." msgstr "" -msgid "" -"Vehicle Routing Problem with Pickup and Delivery `VRPPD` where a number of " -"goods need to be moved from certain pickup locations to other delivery " -"locations." +msgid "Vehicle Routing Problem with Pickup and Delivery `VRPPD` where a number of goods need to be moved from certain pickup locations to other delivery locations." msgstr "" msgid "Limitations" @@ -738,9 +659,7 @@ msgstr "" msgid "Pick & Delivery" msgstr "" -msgid "" -"Problem: `CVRPPDTW` Capacitated Pick and Delivery Vehicle Routing problem " -"with Time Windows" +msgid "Problem: `CVRPPDTW` Capacitated Pick and Delivery Vehicle Routing problem with Time Windows" msgstr "" msgid "Times are relative to `0`" @@ -770,9 +689,7 @@ msgstr "" msgid "Have pickup and delivery duration service times." msgstr "" -msgid "" -"have a demand request for moving goods from the pickup location to the " -"delivery location." +msgid "have a demand request for moving goods from the pickup location to the delivery location." msgstr "" msgid "Time based calculations:" @@ -862,12 +779,10 @@ msgstr "" msgid "``4`` Optimize insert." msgstr "" -msgid "" -"``5`` Push back order that allows more orders to be inserted at the back" +msgid "``5`` Push back order that allows more orders to be inserted at the back" msgstr "" -msgid "" -"``6`` Push front order that allows more orders to be inserted at the front" +msgid "``6`` Push front order that allows more orders to be inserted at the front" msgstr "" msgid "Orders SQL" @@ -930,30 +845,22 @@ msgstr "" msgid "The duration of the unloading at the delivery location." msgstr "" -msgid "" -"For :doc:`pgr_pickDeliver` the pickup and delivery identifiers of the " -"locations are needed:" +msgid "For :doc:`pgr_pickDeliver` the pickup and delivery identifiers of the locations are needed:" msgstr "" msgid "``p_node_id``" msgstr "" -msgid "" -"The node identifier of the pickup, must match a vertex identifier in the " -"`Matrix SQL`_." +msgid "The node identifier of the pickup, must match a vertex identifier in the `Matrix SQL`_." msgstr "" msgid "``d_node_id``" msgstr "" -msgid "" -"The node identifier of the delivery, must match a vertex identifier in the " -"`Matrix SQL`_." +msgid "The node identifier of the delivery, must match a vertex identifier in the `Matrix SQL`_." msgstr "" -msgid "" -"For :doc:`pgr_pickDeliverEuclidean` the :math:`(x, y)` values of the " -"locations are needed:" +msgid "For :doc:`pgr_pickDeliverEuclidean` the :math:`(x, y)` values of the locations are needed:" msgstr "" msgid "``p_x``" @@ -1043,25 +950,19 @@ msgstr "" msgid "When missing: A duration in ``start_service`` is used." msgstr "" -msgid "" -"For :doc:`pgr_pickDeliver` the starting and ending identifiers of the " -"locations are needed:" +msgid "For :doc:`pgr_pickDeliver` the starting and ending identifiers of the locations are needed:" msgstr "" msgid "``start_node_id``" msgstr "" -msgid "" -"The node identifier of the start location, must match a vertex identifier in " -"the `Matrix SQL`_." +msgid "The node identifier of the start location, must match a vertex identifier in the `Matrix SQL`_." msgstr "" msgid "[``end_node_id``]" msgstr "" -msgid "" -"The node identifier of the end location, must match a vertex identifier in " -"the `Matrix SQL`_." +msgid "The node identifier of the end location, must match a vertex identifier in the `Matrix SQL`_." msgstr "" msgid "When missing: ``end_node_id`` is used." @@ -1121,9 +1022,7 @@ msgstr "" msgid "``vehicle_seq``" msgstr "" -msgid "" -"Sequential value starting from **1** for current vehicles. The :math:`n_{th}" -"` vehicle in the solution." +msgid "Sequential value starting from **1** for current vehicles. The :math:`n_{th}` vehicle in the solution." msgstr "" msgid "Value :math:`-2` indicates it is the summary row." @@ -1141,8 +1040,7 @@ msgstr "" msgid "Summary row has the **total capacity violations**." msgstr "" -msgid "" -"A capacity violation happens when overloading or underloading a vehicle." +msgid "A capacity violation happens when overloading or underloading a vehicle." msgstr "" msgid "``stop_seq``" @@ -1151,16 +1049,13 @@ msgstr "" msgid "INTEGER" msgstr "" -msgid "" -"Sequential value starting from **1** for the stops made by the current " -"vehicle. The :math:`m_{th}` stop of the current vehicle." +msgid "Sequential value starting from **1** for the stops made by the current vehicle. The :math:`m_{th}` stop of the current vehicle." msgstr "" msgid "Summary row has the **total time windows violations**." msgstr "" -msgid "" -"A time window violation happens when arriving after the location has closed." +msgid "A time window violation happens when arriving after the location has closed." msgstr "" msgid "``stop_type``" @@ -1190,8 +1085,7 @@ msgstr "" msgid "Pickup-Delivery order pair identifier." msgstr "" -msgid "" -"Value :math:`-1`: When no order is involved on the current stop location." +msgid "Value :math:`-1`: When no order is involved on the current stop location." msgstr "" msgid "``cargo``" @@ -1263,9 +1157,7 @@ msgstr "" msgid "Summary row has the **total solution time**:" msgstr "" -msgid "" -":math:`total\\ traveling\\ time + total\\ waiting\\ time + total\\ service\\ " -"time`." +msgid ":math:`total\\ traveling\\ time + total\\ waiting\\ time + total\\ service\\ time`." msgstr "" msgid "Summary Row" @@ -1295,10 +1187,7 @@ msgstr "" msgid "Handling Parameters" msgstr "" -msgid "" -"To define a problem, several considerations have to be done, to get " -"consistent results. This section gives an insight of how parameters are to " -"be considered." +msgid "To define a problem, several considerations have to be done, to get consistent results. This section gives an insight of how parameters are to be considered." msgstr "" msgid "`Capacity and Demand Units Handling`_" @@ -1334,32 +1223,22 @@ msgstr "" msgid "Number of seats in the vehicle" msgstr "" -msgid "" -"The `demand` request of the pickup-deliver orders must use the same units as " -"the units used in the vehicle's `capacity`." +msgid "The `demand` request of the pickup-deliver orders must use the same units as the units used in the vehicle's `capacity`." msgstr "" -msgid "" -"To handle problems like: 10 (equal dimension) boxes of apples and 5 kg of " -"feathers that are to be transported (not packed in boxes)." +msgid "To handle problems like: 10 (equal dimension) boxes of apples and 5 kg of feathers that are to be transported (not packed in boxes)." msgstr "" -msgid "" -"If the vehicle's **capacity** is measured in `boxes`, a conversion of `kg of " -"feathers` to `number of boxes` is needed." +msgid "If the vehicle's **capacity** is measured in `boxes`, a conversion of `kg of feathers` to `number of boxes` is needed." msgstr "" -msgid "" -"If the vehicle's **capacity** is measured in `kg`, a conversion of `box of " -"apples` to `kg` is needed." +msgid "If the vehicle's **capacity** is measured in `kg`, a conversion of `box of apples` to `kg` is needed." msgstr "" msgid "Showing how the 2 possible conversions can be done" msgstr "" -msgid "" -"Let: - :math:`f\\_boxes`: number of boxes needed for `1` kg of feathers. - :" -"math:`a\\_weight`: weight of `1` box of apples." +msgid "Let: - :math:`f\\_boxes`: number of boxes needed for `1` kg of feathers. - :math:`a\\_weight`: weight of `1` box of apples." msgstr "" msgid "Capacity Units" @@ -1413,14 +1292,10 @@ msgstr "" msgid "Time Handling" msgstr "" -msgid "" -"The times are relative to **0**. All time units have to be converted to a " -"**0** reference and the same time units." +msgid "The times are relative to **0**. All time units have to be converted to a **0** reference and the same time units." msgstr "" -msgid "" -"Suppose that a vehicle's driver starts the shift at 9:00 am and ends the " -"shift at 4:30 pm and the service time duration is 10 minutes with 30 seconds." +msgid "Suppose that a vehicle's driver starts the shift at 9:00 am and ends the shift at 4:30 pm and the service time duration is 10 minutes with 30 seconds." msgstr "" msgid "Meaning of 0" @@ -1477,9 +1352,7 @@ msgstr "" msgid "Factor handling" msgstr "" -msgid "" -"``factor`` acts as a multiplier to convert from distance values to time " -"units the matrix values or the euclidean values." +msgid "``factor`` acts as a multiplier to convert from distance values to time units the matrix values or the euclidean values." msgstr "" msgid "When the values are already in the desired time units" @@ -1497,10 +1370,7 @@ msgstr "" msgid "For the :doc:`pgr_pickDeliverEuclidean`:" msgstr "" -msgid "" -"Working with time units in seconds, and x/y in lat/lon: Factor: would depend " -"on the location of the points and on the average velocity say 25m/s is the " -"velocity." +msgid "Working with time units in seconds, and x/y in lat/lon: Factor: would depend on the location of the points and on the average velocity say 25m/s is the velocity." msgstr "" msgid "Latitude" @@ -1530,9 +1400,7 @@ msgstr "" msgid "For the :doc:`pgr_pickDeliver`:" msgstr "" -msgid "" -"Given :math:`v = d / t` therefore :math:`t = d / v` And the ``factor`` " -"becomes :math:`1 / v`" +msgid "Given :math:`v = d / t` therefore :math:`t = d / v` And the ``factor`` becomes :math:`1 / v`" msgstr "" msgid "v" @@ -1553,14 +1421,10 @@ msgstr "" msgid "Time" msgstr "" -msgid "" -"For the following equivalences :math:`10m/s \\approx 600m/min \\approx 36 km/" -"hr`" +msgid "For the following equivalences :math:`10m/s \\approx 600m/min \\approx 36 km/hr`" msgstr "" -msgid "" -"Working with time units in seconds and the matrix been in meters: For a " -"1000m length value on the matrix:" +msgid "Working with time units in seconds and the matrix been in meters: For a 1000m length value on the matrix:" msgstr "" msgid "Units" @@ -1623,10 +1487,7 @@ msgstr "" msgid "A* - Family of functions" msgstr "" -msgid "" -"The A* (pronounced \"A Star\") algorithm is based on Dijkstra's algorithm " -"with a heuristic that allow it to solve most shortest path problems by " -"evaluation only a sub-set of the overall graph." +msgid "The A* (pronounced \"A Star\") algorithm is based on Dijkstra's algorithm with a heuristic that allow it to solve most shortest path problems by evaluation only a sub-set of the overall graph." msgstr "" msgid ":doc:`pgr_aStar` - A* algorithm for the shortest path." @@ -1723,9 +1584,7 @@ msgstr "" msgid "For less restricted results. :math:`epsilon >= 1`." msgstr "" -msgid "" -"See :ref:`heuristics ` available and :ref:`factor " -"` handling." +msgid "See :ref:`heuristics ` available and :ref:`factor ` handling." msgstr "" msgid "Advanced documentation" @@ -1743,17 +1602,13 @@ msgstr "" msgid "Analysis 1" msgstr "" -msgid "" -"Working with cost/reverse_cost as length in degrees, x/y in lat/lon: Factor " -"= 1 (no need to change units)" +msgid "Working with cost/reverse_cost as length in degrees, x/y in lat/lon: Factor = 1 (no need to change units)" msgstr "" msgid "Analysis 2" msgstr "" -msgid "" -"Working with cost/reverse_cost as length in meters, x/y in lat/lon: Factor = " -"would depend on the location of the points:" +msgid "Working with cost/reverse_cost as length in meters, x/y in lat/lon: Factor = would depend on the location of the points:" msgstr "" msgid "1 longitude degree is 78846.81 m" @@ -1771,17 +1626,13 @@ msgstr "" msgid "Analysis 3" msgstr "" -msgid "" -"Working with cost/reverse_cost as time in seconds, x/y in lat/lon: Factor: " -"would depend on the location of the points and on the average speed say 25m/" -"s is the speed." +msgid "Working with cost/reverse_cost as time in seconds, x/y in lat/lon: Factor: would depend on the location of the points and on the average speed say 25m/s is the speed." msgstr "" msgid ":doc:`bdAstar-family`" msgstr "" -msgid "" -"`Boost: A* search `__" +msgid "`Boost: A* search `__" msgstr "" msgid "https://en.wikipedia.org/wiki/A*_search_algorithm" @@ -1805,24 +1656,16 @@ msgstr "" msgid "It does not return a path." msgstr "" -msgid "" -"Returns the sum of the costs of the shortest path for each pair of nodes in " -"the graph." +msgid "Returns the sum of the costs of the shortest path for each pair of nodes in the graph." 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." +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 "" -msgid "" -"We return only the non infinity values in form of a set of `(start_vid, " -"end_vid, agg_cost)`." +msgid "We return only the non infinity values in form of a set of `(start_vid, end_vid, agg_cost)`." msgstr "" -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)`." +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 "" msgid "For the undirected graph, the results are symmetric." @@ -1894,10 +1737,7 @@ msgstr "" msgid "One" msgstr "" -msgid "" -"This test is not with a bounding box The density of the passed graph is " -"extremely low. For each 30 tests were executed to get the average The " -"tested query is:" +msgid "This test is not with a bounding box The density of the passed graph is extremely low. For each 30 tests were executed to get the average The tested query is:" msgstr "" msgid "The results of this tests are presented as:" @@ -2239,10 +2079,7 @@ msgstr "" msgid "Two" msgstr "" -msgid "" -"This test is with a bounding box The density of the passed graph higher than " -"of the Test One. For each 30 tests were executed to get the average " -"The tested edge query is:" +msgid "This test is with a bounding box The density of the passed graph higher than of the Test One. For each 30 tests were executed to get the average The tested edge query is:" msgstr "" msgid "The tested queries" @@ -2545,44 +2382,28 @@ msgstr "" msgid ":doc:`pgr_floydWarshall`" msgstr "" -msgid "" -"Boost `floyd-Warshall `__" +msgid "Boost `floyd-Warshall `__" msgstr "" msgid "Bidirectional A* - Family of functions" msgstr "" -msgid "" -"The bidirectional A* (pronounced \"A Star\") algorithm is based on the A* " -"algorithm." +msgid "The bidirectional A* (pronounced \"A Star\") algorithm is based on the A* algorithm." msgstr "" msgid ":doc:`pgr_bdAstar` - Bidirectional A* algorithm for obtaining paths." msgstr "" -msgid "" -":doc:`pgr_bdAstarCost` - Bidirectional A* algorithm to calculate the cost of " -"the paths." +msgid ":doc:`pgr_bdAstarCost` - Bidirectional A* algorithm to calculate the cost of the paths." msgstr "" -msgid "" -":doc:`pgr_bdAstarCostMatrix` - Bidirectional A* algorithm to calculate a " -"cost matrix of paths." +msgid ":doc:`pgr_bdAstarCostMatrix` - Bidirectional A* algorithm to calculate a cost matrix of paths." msgstr "" -msgid "" -"Based on A* algorithm, the bidirectional search finds a shortest path from a " -"starting vertex (``start_vid``) to an ending vertex (``end_vid``). It runs " -"two simultaneous searches: one forward from the ``start_vid``, and one " -"backward from the ``end_vid``, stopping when the two meet in the middle. " -"This implementation can be used with a directed graph and an undirected " -"graph." +msgid "Based on A* algorithm, the bidirectional search finds a shortest path from a starting vertex (``start_vid``) to an ending vertex (``end_vid``). It runs two simultaneous searches: one forward from the ``start_vid``, and one backward from the ``end_vid``, stopping when the two meet in the middle. This implementation can be used with a directed graph and an undirected graph." msgstr "" -msgid "" -"For large graphs where there is a path between the starting vertex and " -"ending vertex:" +msgid "For large graphs where there is a path between the starting vertex and ending vertex:" msgstr "" msgid "It is expected to terminate faster than :doc:`pgr_aStar`" @@ -2594,42 +2415,29 @@ msgstr "" msgid "Bidirectional Dijkstra - Family of functions" msgstr "" -msgid "" -":doc:`pgr_bdDijkstra` - Bidirectional Dijkstra algorithm for the shortest " -"paths." +msgid ":doc:`pgr_bdDijkstra` - Bidirectional Dijkstra algorithm for the shortest paths." msgstr "" -msgid "" -":doc:`pgr_bdDijkstraCost` - Bidirectional Dijkstra to calculate the cost of " -"the shortest paths" +msgid ":doc:`pgr_bdDijkstraCost` - Bidirectional Dijkstra to calculate the cost of the shortest paths" msgstr "" #, fuzzy -msgid "" -":doc:`pgr_bdDijkstraCostMatrix` - Bidirectional Dijkstra algorithm to create " -"a matrix of costs of the shortest paths." +msgid ":doc:`pgr_bdDijkstraCostMatrix` - Bidirectional Dijkstra algorithm to create a matrix of costs of the shortest paths." msgstr ":doc:`pgr_dijkstraCost` - 最短経路の総コストを集計します。" msgid "Synopsis" msgstr "概要" -msgid "" -"Based on Dijkstra's algorithm, the bidirectional search finds a shortest " -"path a starting vertex to an ending vertex." +msgid "Based on Dijkstra's algorithm, the bidirectional search finds a shortest path a starting vertex to an ending vertex." msgstr "" -msgid "" -"It runs two simultaneous searches: one forward from the source, and one " -"backward from the target, stopping when the two meet in the middle." +msgid "It runs two simultaneous searches: one forward from the source, and one backward from the target, stopping when the two meet in the middle." msgstr "" -msgid "" -"This implementation can be used with a directed graph and an undirected " -"graph." +msgid "This implementation can be used with a directed graph and an undirected graph." msgstr "" -msgid "" -"A negative value on a cost column is interpreted as the edge does not exist." +msgid "A negative value on a cost column is interpreted as the edge does not exist." msgstr "" msgid "When there is no path:" @@ -2638,31 +2446,22 @@ msgstr "" msgid "When the starting vertex and ending vertex are the same." msgstr "" -msgid "" -"The **aggregate cost** of the non included values :math:`(v, v)` is :math:`0`" +msgid "The **aggregate cost** of the non included values :math:`(v, v)` is :math:`0`" msgstr "" -msgid "" -"When the starting vertex and ending vertex are the different and there is no " -"path:" +msgid "When the starting vertex and ending vertex are the different and there is no path:" msgstr "" -msgid "" -"The **aggregate cost** the non included values :math:`(u, v)` is :math:" -"`\\infty`" +msgid "The **aggregate cost** the non included values :math:`(u, v)` is :math:`\\infty`" msgstr "" -msgid "" -"For optimization purposes, any duplicated value in the starting vertices or " -"on the ending vertices are ignored." +msgid "For optimization purposes, any duplicated value in the starting vertices or on the ending vertices are ignored." msgstr "" msgid "Running time (worse case scenario): :math:`O((V \\log V + E))`" msgstr "" -msgid "" -"For large graphs where there is a path bewtween the starting vertex and " -"ending vertex:" +msgid "For large graphs where there is a path bewtween the starting vertex and ending vertex:" msgstr "" msgid "It is expected to terminate faster than :doc:`pgr_dijkstra`" @@ -2693,25 +2492,19 @@ msgstr "" msgid "Graph must be connected." msgstr "" -msgid "" -"An Edges SQL that represents a **directed** graph with the following columns" +msgid "An Edges SQL that represents a **directed** graph with the following columns" msgstr "" msgid "Coloring - Family of functions" msgstr "" -msgid "" -":doc:`pgr_sequentialVertexColoring` - Vertex coloring algorithm using greedy " -"approach." +msgid ":doc:`pgr_sequentialVertexColoring` - Vertex coloring algorithm using greedy approach." msgstr "" -msgid "" -":doc:`pgr_bipartite` - Bipartite graph algorithm using a DFS-based coloring " -"approach." +msgid ":doc:`pgr_bipartite` - Bipartite graph algorithm using a DFS-based coloring approach." msgstr "" -msgid "" -":doc:`pgr_edgeColoring` - Edge Coloring algorithm using Vizing's theorem." +msgid ":doc:`pgr_edgeColoring` - Edge Coloring algorithm using Vizing's theorem." msgstr "" #, fuzzy @@ -2738,29 +2531,22 @@ msgstr "終了ノードの識別子。" msgid "Color of the node." msgstr "" -msgid "" -"`Boost: `__" +msgid "`Boost: `__" msgstr "" msgid "Components - Family of functions" msgstr "" -msgid "" -":doc:`pgr_connectedComponents` - Connected components of an undirected graph." +msgid ":doc:`pgr_connectedComponents` - Connected components of an undirected graph." msgstr "" -msgid "" -":doc:`pgr_strongComponents` - Strongly connected components of a directed " -"graph." +msgid ":doc:`pgr_strongComponents` - Strongly connected components of a directed graph." msgstr "" -msgid "" -":doc:`pgr_biconnectedComponents` - Biconnected components of an undirected " -"graph." +msgid ":doc:`pgr_biconnectedComponents` - Biconnected components of an undirected graph." msgstr "" -msgid "" -":doc:`pgr_articulationPoints` - Articulation points of an undirected graph." +msgid ":doc:`pgr_articulationPoints` - Articulation points of an undirected graph." msgstr "" msgid ":doc:`pgr_bridges` - Bridges of an undirected graph." @@ -2785,18 +2571,10 @@ msgstr ":doc:`pgr_kruskalBFS`" msgid ":doc:`pgr_contractionHierarchies`" msgstr "" -msgid "" -"In large graphs, like road graphs or electric networks, graph contraction " -"can be used to speed up some graph algorithms. Contraction can reduce the " -"size of the graph by removing some of the vertices and edges and adding " -"edges that represent a sequence of original edges (the original ones can be " -"kept in some methods). In this way, it decreases the total time and space " -"used by graph algorithms, particularly those searching for an optimal path." +msgid "In large graphs, like road graphs or electric networks, graph contraction can be used to speed up some graph algorithms. Contraction can reduce the size of the graph by removing some of the vertices and edges and adding edges that represent a sequence of original edges (the original ones can be kept in some methods). In this way, it decreases the total time and space used by graph algorithms, particularly those searching for an optimal path." msgstr "" -msgid "" -"This implementation gives a flexible framework for adding contraction " -"algorithms in the future. Currently, it supports three algorithms." +msgid "This implementation gives a flexible framework for adding contraction algorithms in the future. Currently, it supports three algorithms." msgstr "" msgid "Dead end contraction" @@ -2809,17 +2587,13 @@ msgstr "" msgid "Contraction hierarchies" msgstr "序章" -msgid "" -"The two first ones can be combined through a iterative procedure, via the " -"``pgr_contraction`` method. The third one is implemented on its own." +msgid "The two first ones can be combined through a iterative procedure, via the ``pgr_contraction`` method. The third one is implemented on its own." msgstr "" msgid "All functions allow the user to forbid contraction on a set of nodes." msgstr "" -msgid "" -"https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/" -"lecture16.pdf" +msgid "https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/lecture16.pdf" msgstr "" msgid "https://ae.iti.kit.edu/download/diploma_thesis_geisberger.pdf" @@ -2852,26 +2626,19 @@ msgstr "" msgid "Each function works as part of the family it belongs to." msgstr "" -msgid "" -"Returns the sum of the costs of the shortest path of each pair combination " -"of nodes requested." +msgid "Returns the sum of the costs of the shortest path of each pair combination of nodes requested." msgstr "" -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)``." +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 "" -msgid "" -"Depending on the function and its parameters, the results can be symmetric." +msgid "Depending on the function and its parameters, the results can be symmetric." msgstr "" -msgid "" -"The **aggregate cost** of :math:`(u, v)` is the same as for :math:`(v, u)`." +msgid "The **aggregate cost** of :math:`(u, v)` is the same as for :math:`(v, u)`." msgstr "" -msgid "" -"Any duplicated value in the start or end vertex identifiers are ignored." +msgid "Any duplicated value in the start or end vertex identifiers are ignored." msgstr "" msgid "The returned values are ordered:" @@ -2901,21 +2668,16 @@ msgstr "" msgid ":doc:`pgr_withPointsCostMatrix`" msgstr "" -msgid "" -":doc:`TSP-family` needs as input a symmetric cost matrix and no edge `(u, " -"v)` must value :math:`\\infty`." +msgid ":doc:`TSP-family` needs as input a symmetric cost matrix and no edge `(u, v)` must value :math:`\\infty`." msgstr "" -msgid "" -"This collection of functions will return a cost matrix in form of a table." +msgid "This collection of functions will return a cost matrix in form of a table." msgstr "" msgid "Can be used as input to :doc:`pgr_TSP`." msgstr "" -msgid "" -"Use directly when the resulting matrix is symmetric and there is no :math:" -"`\\infty` value." +msgid "Use directly when the resulting matrix is symmetric and there is no :math:`\\infty` value." msgstr "" msgid "It will be the users responsibility to make the matrix symmetric." @@ -2927,36 +2689,28 @@ msgstr "" msgid "By using max or min the non symmetric values." msgstr "" -msgid "" -"By setting the upper triangle to be the mirror image of the lower triangle." +msgid "By setting the upper triangle to be the mirror image of the lower triangle." msgstr "" -msgid "" -"By setting the lower triangle to be the mirror image of the upper triangle." +msgid "By setting the lower triangle to be the mirror image of the upper triangle." msgstr "" msgid "It is also the users responsibility to fix an :math:`\\infty` value." msgstr "" -msgid "" -"Returns the sum of the costs of the shortest path for pair combination of " -"nodes in the graph." +msgid "Returns the sum of the costs of the shortest path for pair combination of nodes in the graph." msgstr "" -msgid "" -"When the starting vertex and ending vertex are the same, there is no path." +msgid "When the starting vertex and ending vertex are the same, there is no path." msgstr "" msgid "The aggregate cost in the non included values `(v, v)` is `0`." msgstr "" -msgid "" -"When the starting vertex and ending vertex are the different and there is no " -"path." +msgid "When the starting vertex and ending vertex are the different and there is no path." msgstr "" -msgid "" -"The aggregate cost in the non included values `(u, v)` is :math:`\\infty`." +msgid "The aggregate cost in the non included values `(u, v)` is :math:`\\infty`." msgstr "" msgid "Let be the case the values returned are stored in a table:" @@ -3004,16 +2758,13 @@ msgstr "" msgid "Identifier of the point." msgstr "" -msgid "" -"Use with positive value, as internally will be converted to negative value" +msgid "Use with positive value, as internally will be converted to negative value" msgstr "" msgid "If column is present, it can not be NULL." msgstr "" -msgid "" -"If column is not present, a sequential negative **value** will be given " -"automatically." +msgid "If column is not present, a sequential negative **value** will be given automatically." msgstr "" msgid "``edge_id``" @@ -3026,12 +2777,8 @@ msgid "``fraction``" msgstr "" #, fuzzy -msgid "" -"Value in <0,1> that indicates the relative position from the first end point " -"of the edge." -msgstr "" -":math:`path\\_seq' は、:math:'node' または :math:'edge' の経路内の相対位置を" -"示しています。" +msgid "Value in <0,1> that indicates the relative position from the first end point of the edge." +msgstr ":math:`path\\_seq' は、:math:'node' または :math:'edge' の経路内の相対位置を示しています。" msgid "``side``" msgstr "" @@ -3061,31 +2808,19 @@ msgid "Dijkstra - Family of functions" msgstr "ダイクストラ関連機能" msgid ":doc:`pgr_dijkstra` - Dijkstra's algorithm for the shortest paths." -msgstr "" -":doc:`pgr_dijkstra` - 最短経路を求めるためのダイクストラ・アルゴリズム。" +msgstr ":doc:`pgr_dijkstra` - 最短経路を求めるためのダイクストラ・アルゴリズム。" msgid ":doc:`pgr_dijkstraCost` - Get the aggregate cost of the shortest paths." msgstr ":doc:`pgr_dijkstraCost` - 最短経路の総コストを集計します。" -msgid "" -":doc:`pgr_dijkstraCostMatrix` - Use pgr_dijkstra to create a costs matrix." -msgstr "" -":doc:`pgr_dijkstraCostMatrix` - pgr_dijkstra を使用してコストマトリックスを作" -"成します。" +msgid ":doc:`pgr_dijkstraCostMatrix` - Use pgr_dijkstra to create a costs matrix." +msgstr ":doc:`pgr_dijkstraCostMatrix` - pgr_dijkstra を使用してコストマトリックスを作成します。" -msgid "" -":doc:`pgr_drivingDistance` - Use pgr_dijkstra to calculate catchament " -"information." -msgstr "" -":doc:`pgr_drivingDistance` - pgr_dijkstra を使用して対象エリアの情報を計算し" -"ます。" +msgid ":doc:`pgr_drivingDistance` - Use pgr_dijkstra to calculate catchament information." +msgstr ":doc:`pgr_drivingDistance` - pgr_dijkstra を使用して対象エリアの情報を計算します。" -msgid "" -":doc:`pgr_KSP` - Use Yen algorithm with pgr_dijkstra to get the K shortest " -"paths." -msgstr "" -":doc:`pgr_KSP` - pgr_dijkstraでYenアルゴリズムを使用してK最短経路を取得しま" -"す。" +msgid ":doc:`pgr_KSP` - Use Yen algorithm with pgr_dijkstra to get the K shortest paths." +msgstr ":doc:`pgr_KSP` - pgr_dijkstraでYenアルゴリズムを使用してK最短経路を取得します。" #, fuzzy msgid ":doc:`pgr_dijkstraVia` - Get a route of a sequence of vertices." @@ -3097,12 +2832,7 @@ msgstr "" msgid ":doc:`pgr_dijkstraNearCost` - Get the cost to the nearest vertex." msgstr "" -msgid "" -"Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra " -"in 1956. It is a graph search algorithm that solves the shortest path " -"problem for a graph with non-negative edge path costs, producing a shortest " -"path from a starting vertex to an ending vertex. This implementation can be " -"used with a directed graph and an undirected graph." +msgid "Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956. It is a graph search algorithm that solves the shortest path problem for a graph with non-negative edge path costs, producing a shortest path from a starting vertex to an ending vertex. This implementation can be used with a directed graph and an undirected graph." msgstr "" msgid "Running time: :math:`O(| start\\ vids | * (V \\log V + E))`" @@ -3154,12 +2884,8 @@ msgid "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" #, fuzzy -msgid "" -"where :math:`sql = \\{(id_i, source_i, target_i, cost_i, reverse\\_cost_i)\\}" -"`" -msgstr "" -"where :math:`sql = \\{(id_i, source_i, target_i, cost_i, reverse\\_cost_i)\\}" -"`" +msgid "where :math:`sql = \\{(id_i, source_i, target_i, cost_i, reverse\\_cost_i)\\}`" +msgstr "where :math:`sql = \\{(id_i, source_i, target_i, cost_i, reverse\\_cost_i)\\}`" msgid "and" msgstr "" @@ -3190,22 +2916,8 @@ msgid "the set of edges :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 = " -"\\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 ":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 "導かれないグラフ" @@ -3218,28 +2930,8 @@ 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, " -"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 ":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 "問題点" @@ -3253,22 +2945,14 @@ msgstr "" msgid ":math:`end_{vid} \\in V` an ending vertex" msgstr "" -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 ":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 ":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 "どこに：" @@ -3288,53 +2972,29 @@ 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:`\\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:`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 ":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," +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 "" -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:`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` は、次のノードに移動するために使用するエッジのコストです。" +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 ":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 "経路がない場合、計算結果は空になります。" @@ -3342,8 +3002,7 @@ msgstr "経路がない場合、計算結果は空になります。" msgid "Driving Distance - Category" msgstr "" -msgid "" -":doc:`pgr_drivingDistance` - Driving Distance based on Dijkstra's algorithm" +msgid ":doc:`pgr_drivingDistance` - Driving Distance based on Dijkstra's algorithm" msgstr "" msgid ":doc:`pgr_primDD` - Driving Distance based on Prim's algorithm" @@ -3358,9 +3017,7 @@ msgstr "" 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." +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." @@ -3375,9 +3032,7 @@ msgstr "" msgid "The distance from the **root** to :math:`v` > limit distance." msgstr "" -msgid "" -"No new nodes are created on the graph, so when is within the limit and is " -"not within the limit, the edge is not included." +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." @@ -3444,21 +3099,16 @@ msgstr "" msgid ":doc:`transformation-family`" msgstr "" -msgid "" -":doc:`pgr_lineGraphFull` - Transformation algorithm for generating a Line " -"Graph out of each vertex in the input graph." +msgid ":doc:`pgr_lineGraphFull` - Transformation algorithm for generating a Line Graph out of each vertex in the input graph." msgstr "" msgid ":doc:`traversal-family`" msgstr "" -msgid "" -":doc:`pgr_breadthFirstSearch` - Breath first search traversal of the graph." +msgid ":doc:`pgr_breadthFirstSearch` - Breath first search traversal of the graph." msgstr "" -msgid "" -":doc:`pgr_binaryBreadthFirstSearch` - Breath first search traversal of the " -"graph." +msgid ":doc:`pgr_binaryBreadthFirstSearch` - Breath first search traversal of the graph." msgstr "" msgid ":doc:`components-family`" @@ -3467,31 +3117,23 @@ msgstr "" msgid ":doc:`ordering-family`" msgstr ":doc:`ordering-family`" -msgid "" -":doc:`pgr_cuthillMckeeOrdering` - Return reverse Cuthill-McKee ordering of " -"an undirected graph." +msgid ":doc:`pgr_cuthillMckeeOrdering` - Return reverse Cuthill-McKee ordering of an undirected graph." msgstr "" -msgid "" -":doc:`pgr_topologicalSort` - Linear ordering of the vertices for directed " -"acyclic graph." +msgid ":doc:`pgr_topologicalSort` - Linear ordering of the vertices for directed acyclic graph." msgstr "" -msgid "" -":doc:`pgr_sloanOrdering` - Returns the sloan ordering of an undirected graph." +msgid ":doc:`pgr_sloanOrdering` - Returns the sloan ordering of an undirected graph." msgstr "" -msgid "" -":doc:`pgr_kingOrdering` - Returns the King ordering of an undirected graph." +msgid ":doc:`pgr_kingOrdering` - Returns the King ordering of an undirected graph." msgstr "" #, fuzzy msgid ":doc:`metrics-family`" msgstr ":doc:`ordering-family`" -msgid "" -":doc:`pgr_betweennessCentrality` - Calculates relative betweenness " -"centrality using Brandes Algorithm" +msgid ":doc:`pgr_betweennessCentrality` - Calculates relative betweenness centrality using Brandes Algorithm" msgstr "" msgid ":doc:`pgr_bandwidth` - Computes the bandwidth of a graph." @@ -3543,37 +3185,25 @@ msgstr "" msgid "Flow - Family of functions" msgstr "" -msgid "" -":doc:`pgr_maxFlow` - Only the Max flow calculation using Push and Relabel " -"algorithm." +msgid ":doc:`pgr_maxFlow` - Only the Max flow calculation using Push and Relabel algorithm." msgstr "" -msgid "" -":doc:`pgr_boykovKolmogorov` - Boykov and Kolmogorov with details of flow on " -"edges." +msgid ":doc:`pgr_boykovKolmogorov` - Boykov and Kolmogorov with details of flow on edges." msgstr "" -msgid "" -":doc:`pgr_edmondsKarp` - Edmonds and Karp algorithm with details of flow on " -"edges." +msgid ":doc:`pgr_edmondsKarp` - Edmonds and Karp algorithm with details of flow on edges." msgstr "" -msgid "" -":doc:`pgr_pushRelabel` - Push and relabel algorithm with details of flow on " -"edges." +msgid ":doc:`pgr_pushRelabel` - Push and relabel algorithm with details of flow on edges." msgstr "" msgid "Applications" msgstr "" -msgid "" -":doc:`pgr_edgeDisjointPaths` - Calculates edge disjoint paths between two " -"groups of vertices." +msgid ":doc:`pgr_edgeDisjointPaths` - Calculates edge disjoint paths between two groups of vertices." msgstr "" -msgid "" -":doc:`pgr_maxCardinalityMatch` - Calculates a maximum cardinality matching " -"in a graph." +msgid ":doc:`pgr_maxCardinalityMatch` - Calculates a maximum cardinality matching in a graph." msgstr "" msgid "Flow Functions General Information" @@ -3585,9 +3215,7 @@ 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." +msgid "When the maximum flow is 0 then there is no flow and **EMPTY SET** is returned." msgstr "" msgid "There is no flow when source has the same value as target." @@ -3611,10 +3239,7 @@ 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:" +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 "" msgid "By aggregation of the outgoing flow from the sources" @@ -3623,10 +3248,7 @@ 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." +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 "" msgid "Capacity edges" @@ -3701,8 +3323,7 @@ msgstr "" msgid "**residual_capacity**" msgstr "" -msgid "" -"Residual capacity of the edge in the direction (``start_vid``, ``end_vid``)." +msgid "Residual capacity of the edge in the direction (``start_vid``, ``end_vid``)." msgstr "" msgid "For :doc:`pgr_maxFlowMinCost`" @@ -3723,9 +3344,7 @@ msgstr "" msgid "**cost**" msgstr "" -msgid "" -"The cost of sending this flow through the edge in the direction (source, " -"target)." +msgid "The cost of sending this flow through the edge in the direction (source, target)." msgstr "" msgid "**agg_cost**" @@ -3737,30 +3356,19 @@ msgstr "" msgid "Advanced Documentation" msgstr "" -msgid "" -"A flow network is a directed graph where each edge has a capacity and a " -"flow. The flow through an edge must not exceed the capacity of the edge. " -"Additionally, the incoming and outgoing flow of a node must be equal except " -"for source which only has outgoing flow, and the destination(sink) which " -"only has incoming flow." +msgid "A flow network is a directed graph where each edge has a capacity and a flow. The flow through an edge must not exceed the capacity of the edge. Additionally, the incoming and outgoing flow of a node must be equal except for source which only has outgoing flow, and the destination(sink) which only has incoming flow." msgstr "" -msgid "" -"Maximum flow algorithms calculate the maximum flow through the graph and the " -"flow of each edge." +msgid "Maximum flow algorithms calculate the maximum flow through the graph and the flow of each edge." msgstr "" -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." +msgid "The maximum flow through the graph is guaranteed to be the same with all implementations, but the actual flow through each edge may vary." msgstr "" msgid "pgr_maxFlow :math:`(edges\\_sql, source\\_vertex, sink\\_vertex)`" msgstr "" -msgid "" -"where :math:`edges\\_sql = \\{(id_i, source_i, target_i, capacity_i, " -"reverse\\_capacity_i)\\}`" +msgid "where :math:`edges\\_sql = \\{(id_i, source_i, target_i, capacity_i, reverse\\_capacity_i)\\}`" msgstr "" msgid "Graph definition" @@ -3772,19 +3380,10 @@ msgstr "" msgid "the set of vertices :math:`V`" msgstr "ノードのセット :math:`V`" -msgid "" -":math:`source\\_vertex \\cup sink\\_vertex \\bigcup source_i \\bigcup " -"target_i`" +msgid ":math:`source\\_vertex \\cup sink\\_vertex \\bigcup source_i \\bigcup target_i`" msgstr "" -msgid "" -":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, capacity_i) " -"\\text{ when } capacity > 0 \\} & \\quad \\text{ if } reverse\\_capacity = " -"\\varnothing \\\\ \\text{ } & \\quad \\text{ } \\\\ \\{(source_i, target_i, " -"capacity_i) \\text{ when } capacity > 0 \\} & \\text{ } \\\\ \\cup " -"\\{(target_i, source_i, reverse\\_capacity_i) \\text{ when } " -"reverse\\_capacity_i > 0)\\} & \\quad \\text{ if } reverse\\_capacity \\neq " -"\\varnothing \\\\ \\end{cases}`" +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 "" msgid "Maximum flow problem" @@ -3802,16 +3401,10 @@ msgstr "" msgid ":math:`pgr\\_maxFlow(edges\\_sql, source, sink) = \\boldsymbol{\\Phi}`" msgstr "" -msgid "" -":math:`\\boldsymbol{\\Phi} = {(id_i, edge\\_id_i, source_i, target_i, " -"flow_i, residual\\_capacity_i)}`" +msgid ":math:`\\boldsymbol{\\Phi} = {(id_i, edge\\_id_i, source_i, target_i, flow_i, residual\\_capacity_i)}`" msgstr "" -msgid "" -":math:`\\boldsymbol{\\Phi}` is a subset of the original edges with their " -"residual capacity and flow. The maximum flow through the graph can be " -"obtained by aggregating on the source or sink and summing the flow from/to " -"it. In particular:" +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 "" msgid ":math:`id_i = i`" @@ -3826,10 +3419,7 @@ msgstr "" msgid "https://en.wikipedia.org/wiki/Maximum_flow_problem" msgstr "" -msgid "" -"pgRouting extends the `PostGIS `__/`PostgreSQL `__ geospatial database to provide geospatial routing and " -"other network analysis functionality." +msgid "pgRouting extends the `PostGIS `__/`PostgreSQL `__ geospatial database to provide geospatial routing and other network analysis functionality." msgstr "" msgid "This is the manual for pgRouting |release|." @@ -3838,13 +3428,7 @@ msgstr "このマニュアルは pgRouting |release| のマニュアルです。 msgid "Creative Commons Attribution-Share Alike 3.0 License" msgstr "" -msgid "" -"The pgRouting Manual is licensed under a `Creative Commons Attribution-Share " -"Alike 3.0 License `_. Feel " -"free to use this material any way you like, but we ask that you attribute " -"credit to the pgRouting Project and wherever possible, a link back to " -"https://pgrouting.org. For other licenses used in pgRouting see the :ref:" -"`license` page." +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 "" msgid "General" @@ -3877,9 +3461,7 @@ msgstr "" msgid ":doc:`pgr_kruskalDD`" msgstr "" -msgid "" -":doc:`pgr_degree` - Returns a set of vertices and corresponding count of " -"incident edges to the vertex." +msgid ":doc:`pgr_degree` - Returns a set of vertices and corresponding count of incident edges to the vertex." msgstr "" msgid ":doc:`prim-family`" @@ -3904,9 +3486,7 @@ msgstr "" msgid ":doc:`utilities-family`" msgstr ":doc:`ordering-family`" -msgid "" -":doc:`pgr_extractVertices` - Extracts vertex information based on the edge " -"table information." +msgid ":doc:`pgr_extractVertices` - Extracts vertex information based on the edge table information." msgstr "" msgid ":doc:`pgr_findCloseEdges` - Finds close edges of points on the fly" @@ -3915,9 +3495,7 @@ msgstr "" msgid ":doc:`pgr_separateCrossing` - Breaks geometries that cross each other." msgstr "" -msgid "" -":doc:`pgr_separateTouching` - Breaks geometries that (almost) touch each " -"other." +msgid ":doc:`pgr_separateTouching` - Breaks geometries that (almost) touch each other." msgstr "" msgid ":doc:`withPoints-family`" @@ -3987,13 +3565,13 @@ msgstr "" msgid ":doc:`release_notes`" msgstr "" +msgid "pgRouting 4.0" +msgstr "" + msgid "pgRouting 4.0.0-alpha1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 4.0.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.0 `__" msgstr "" msgid "Build" @@ -4002,8 +3580,7 @@ msgstr "" msgid "C++ standard is std17" msgstr "" -msgid "" -"Using this standard, all supported toolchains across our CI matrix will work." +msgid "Using this standard, all supported toolchains across our CI matrix will work." msgstr "" msgid "The code is not yet modified to use std17:" @@ -4037,9 +3614,7 @@ msgstr "" msgid "The HTML documentation is built by default" msgstr "" -msgid "" -"The translated languages (en, es, sv, zh_Hans) HTML documentation are built " -"by default" +msgid "The translated languages (en, es, sv, zh_Hans) HTML documentation are built by default" msgstr "" msgid "`WITH-DOC` is not used anymore" @@ -4253,9 +3828,7 @@ msgstr "" msgid "pgr_trsp(text,integer,integer,boolean,boolean,text)" msgstr "" -msgid "" -"pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean,text)" +msgid "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" msgstr "" msgid "pgr_trspVia" @@ -4273,13 +3846,10 @@ msgstr "" msgid "Valid values depend on kind of graph" msgstr "" -msgid "" -"pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean," -"character,boolean)" +msgid "pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "" -msgid "" -"pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +msgid "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" msgstr "" msgid "pgr_trsp_withPoints" @@ -4288,21 +3858,16 @@ msgstr "" msgid "**Driving side** parameter is positional unnamed and compulsory." msgstr "" -msgid "" -"pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character," -"boolean)" +msgid "pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" msgstr "" -msgid "" -"pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +msgid "pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" msgstr "" -msgid "" -"pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +msgid "pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" msgstr "" -msgid "" -"pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" +msgid "pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" msgstr "" msgid "pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" @@ -4318,18 +3883,14 @@ msgstr "" msgid "Only for undirected graphs" msgstr "導かれないグラフ" -msgid "" -"pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double " -"precision,double precision,double precision,boolean)" +msgid "pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgstr "" #, fuzzy msgid "pgr_TSPeuclidean" msgstr "pgr_TSP" -msgid "" -"pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, " -"integer,double precision,double precision,double precision,boolean)" +msgid "pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, integer,double precision,double precision,double precision,boolean)" msgstr "" msgid "pgr_turnRestrictedPath" @@ -4391,163 +3952,106 @@ msgstr "" msgid "pgr_withPointsDD" msgstr "" -msgid "" -"pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgid "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" msgstr "" -msgid "" -"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" +msgid "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" msgstr "" msgid "pgr_withPointsKSP" msgstr "" -msgid "" -"pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character," -"boolean)" +msgid "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" msgstr "" msgid "pgr_withPointsVia" msgstr "" -msgid "" -"pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character," -"boolean)" +msgid "pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "" msgid "Functions promoted to official" msgstr "" -msgid "" -"`#2701 `__: pgr_trsp" +msgid "`#2701 `__: pgr_trsp" msgstr "" -msgid "" -"`#2701 `__: pgr_trspVia" +msgid "`#2701 `__: pgr_trspVia" msgstr "" -msgid "" -"`#2701 `__: " -"pgr_trspVia_withPoints" +msgid "`#2701 `__: pgr_trspVia_withPoints" msgstr "" -msgid "" -"`#2701 `__: " -"pgr_trsp_withPoints" +msgid "`#2701 `__: pgr_trsp_withPoints" msgstr "" -msgid "" -"`#2700 `__: " -"pgr_withPoints" +msgid "`#2700 `__: pgr_withPoints" msgstr "" -msgid "" -"`#2700 `__: " -"pgr_withPointsCost" +msgid "`#2700 `__: pgr_withPointsCost" msgstr "" -msgid "" -"`#2700 `__: " -"pgr_withPointsCostMatrix" +msgid "`#2700 `__: pgr_withPointsCostMatrix" msgstr "" -msgid "" -"`#2700 `__: " -"pgr_withPointsDD" +msgid "`#2700 `__: pgr_withPointsDD" msgstr "" -msgid "" -"`#2700 `__: " -"pgr_withPointsKSP" +msgid "`#2700 `__: pgr_withPointsKSP" msgstr "" -msgid "" -"`#2700 `__: " -"pgr_withPointsVia" +msgid "`#2700 `__: pgr_withPointsVia" msgstr "" -msgid "" -"`#2983 `__: " -"pgr_dijkstraNear" +msgid "`#2983 `__: pgr_dijkstraNear" msgstr "" -msgid "" -"`#2983 `__: " -"pgr_dijkstraNearCost" +msgid "`#2983 `__: pgr_dijkstraNearCost" msgstr "" -msgid "" -"`#2983 `__: " -"pgr_dijkstraVia" +msgid "`#2983 `__: pgr_dijkstraVia" msgstr "" msgid "Signatures promoted to official" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_aStar(Combinations)" +msgid "`#2718 `__: pgr_aStar(Combinations)" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_aStarCost(Combinations)" +msgid "`#2718 `__: pgr_aStarCost(Combinations)" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_bdAstar(Combinations)" +msgid "`#2718 `__: pgr_bdAstar(Combinations)" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_bdAstarCost(Combinations)" +msgid "`#2718 `__: pgr_bdAstarCost(Combinations)" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_bdDijkstra(Combinations)" +msgid "`#2718 `__: pgr_bdDijkstra(Combinations)" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_bdDijkstraCost(Combinations)" +msgid "`#2718 `__: pgr_bdDijkstraCost(Combinations)" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_dijkstra(Combinations)" +msgid "`#2718 `__: pgr_dijkstra(Combinations)" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_dijkstraCost(Combinations)" +msgid "`#2718 `__: pgr_dijkstraCost(Combinations)" msgstr "" -msgid "" -"`#2718 `__: pgr_KSP(All " -"signatures)" +msgid "`#2718 `__: pgr_KSP(All signatures)" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_boykovKolmogorov(Combinations)" +msgid "`#2718 `__: pgr_boykovKolmogorov(Combinations)" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_edmondsKarp(Combinations)" +msgid "`#2718 `__: pgr_edmondsKarp(Combinations)" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_maxFlow(Combinations)" +msgid "`#2718 `__: pgr_maxFlow(Combinations)" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_pushRelabel(Combinations)" +msgid "`#2718 `__: pgr_pushRelabel(Combinations)" msgstr "" #, fuzzy @@ -4557,29 +4061,22 @@ msgstr "新しい **公式** 機能" msgid "Metrics" msgstr "" -msgid "" -"`#2951 `__: pgr_bandwidth" +msgid "`#2951 `__: pgr_bandwidth" msgstr "" msgid "Ordering" msgstr "" -msgid "" -"`#2954 `__: " -"pgr_kingOrdering" +msgid "`#2954 `__: pgr_kingOrdering" msgstr "" -msgid "" -"`#2955 `__: " -"pgr_sloanOrdering" +msgid "`#2955 `__: pgr_sloanOrdering" msgstr "" msgid "SQL signatures and output standardization" msgstr "" -msgid "" -"`#2904 `__: Standardize " -"output columns of functions with different output" +msgid "`#2904 `__: Standardize output columns of functions with different output" msgstr "" msgid "columns within overloads" @@ -4589,690 +4086,425 @@ msgstr "" msgid "Standardized to |short-generic-result|" msgstr "ダイクストラ関連機能" -msgid "" -"`#2905 `__: " -"pgr_withPoints" +msgid "`#2905 `__: pgr_withPoints" msgstr "" -msgid "" -"`#2906 `__: " -"pgr_bdDijkstra" +msgid "`#2906 `__: pgr_bdDijkstra" msgstr "" -msgid "" -"`#2907 `__: " -"pgr_bellmanFord" +msgid "`#2907 `__: pgr_bellmanFord" msgstr "" -msgid "" -"`#2908 `__: " -"pgr_binaryBreadthFirstSearch" +msgid "`#2908 `__: pgr_binaryBreadthFirstSearch" msgstr "" -msgid "" -"`#2910 `__: " -"pgr_edwardMoore" +msgid "`#2910 `__: pgr_edwardMoore" msgstr "" -msgid "" -"`#2913 `__: " -"pgr_dagShortestPath" +msgid "`#2913 `__: pgr_dagShortestPath" msgstr "" msgid "Standardized to |matrix-result|" msgstr "" -msgid "" -"`#2905 `__: " -"pgr_withPointsCost" +msgid "`#2905 `__: pgr_withPointsCost" msgstr "" -msgid "" -"`#2905 `__: " -"pgr_withPointsCostMatrix" +msgid "`#2905 `__: pgr_withPointsCostMatrix" msgstr "" #, fuzzy msgid "Standardized to |generic-result|" msgstr "ダイクストラ関連機能" -msgid "" -"`#2909 `__: " -"pgr_edgeDisjointPaths" +msgid "`#2909 `__: pgr_edgeDisjointPaths" msgstr "" -msgid "" -"`#2909 `__: " -"pgr_turnRestrictedPath" +msgid "`#2909 `__: pgr_turnRestrictedPath" msgstr "" msgid "Standardized to |result_edge_color|" msgstr "" -msgid "" -"`#2924 `__: " -"pgr_edgeColoring" +msgid "`#2924 `__: pgr_edgeColoring" msgstr "" msgid "Standardized to |result_node_color|" msgstr "" -msgid "" -"`#2924 `__: pgr_bipartite" +msgid "`#2924 `__: pgr_bipartite" msgstr "" -msgid "" -"`#2927 `__: " -"pgr_sequentialVertexColoring" +msgid "`#2927 `__: pgr_sequentialVertexColoring" msgstr "" msgid "Standardized to |result-spantree|" msgstr "" -msgid "" -"`#2931 `__: " -"pgr_breadthFirstSearch" +msgid "`#2931 `__: pgr_breadthFirstSearch" msgstr "" -msgid "" -"`#2931 `__: " -"pgr_depthFirstSearch" +msgid "`#2931 `__: pgr_depthFirstSearch" msgstr "" #, fuzzy msgid "Standardized to |result_node_order|" msgstr "ダイクストラ関連機能" -msgid "" -"`#2934 `__: " -"pgr_topologicalSort" +msgid "`#2934 `__: pgr_topologicalSort" msgstr "" #, fuzzy msgid "Standardized to |result-closure|" msgstr "ダイクストラ関連機能" -msgid "" -"`#2934 `__: " -"pgr_transitiveClosure" +msgid "`#2934 `__: pgr_transitiveClosure" msgstr "" msgid "Removal of SQL deprecated signatures" msgstr "" -msgid "" -"`#2798 `__: " -"pgr_contraction" +msgid "`#2798 `__: pgr_contraction" msgstr "" -msgid "" -"`#2683 `__: pgr_trsp" +msgid "`#2683 `__: pgr_trsp" msgstr "" -msgid "" -"`#2683 `__: pgr_trspVia" +msgid "`#2683 `__: pgr_trspVia" msgstr "" -msgid "" -"`#2888 `__: " -"pgr_findCloseEdges" +msgid "`#2888 `__: pgr_findCloseEdges" msgstr "" -msgid "" -"pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" +msgid "pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" msgstr "" -msgid "" -"pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" +msgid "pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" msgstr "" -msgid "" -"`#2890 `__: " -"pgr_withPointsDD" +msgid "`#2890 `__: pgr_withPointsDD" msgstr "" -msgid "" -"`#2895 `__: " -"pgr_withPointsKSP" +msgid "`#2895 `__: pgr_withPointsKSP" msgstr "" -msgid "" -"`#2899 `__: " -"pgr_maxCardinalityMatch" +msgid "`#2899 `__: pgr_maxCardinalityMatch" msgstr "" msgid "`#2901 `__: pgr_TSP" msgstr "" -msgid "" -"`#2901 `__: " -"pgr_TSPeuclidean" +msgid "`#2901 `__: pgr_TSPeuclidean" msgstr "" msgid "Removal of SQL deprecated functions" msgstr "" -msgid "" -"`#2681 `__: " -"pgr_trspViaedges" +msgid "`#2681 `__: pgr_trspViaedges" msgstr "" -msgid "" -"`#2682 `__: " -"pgr_trspViaVertices" +msgid "`#2682 `__: pgr_trspViaVertices" msgstr "" -msgid "" -"`#2748 `__: " -"pgr_alphaShape" +msgid "`#2748 `__: pgr_alphaShape" msgstr "" -msgid "" -"`#2751 `__: " -"pgr_createTopology" +msgid "`#2751 `__: pgr_createTopology" msgstr "" -msgid "" -"`#2752 `__: " -"pgr_analyzeGraph" +msgid "`#2752 `__: pgr_analyzeGraph" msgstr "" -msgid "" -"`#2755 `__: " -"pgr_analyzeOneWay" +msgid "`#2755 `__: pgr_analyzeOneWay" msgstr "" -msgid "" -"`#2827 `__: " -"pgr_createVerticesTable" +msgid "`#2827 `__: pgr_createVerticesTable" msgstr "" -msgid "" -"`#2886 `__: " -"pgr_nodeNetwork" +msgid "`#2886 `__: pgr_nodeNetwork" msgstr "" #, fuzzy msgid "Removal of SQL deprecated internal functions" msgstr "新しい **公式** 機能" -msgid "" -"`#2748 `__ " -"_pgr_alphaShape(text,double precision)" +msgid "`#2748 `__ _pgr_alphaShape(text,double precision)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_checkVertTab(text,text[],integer,text)" +msgid "`#2861 `__ _pgr_checkVertTab(text,text[],integer,text)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_createIndex(text,text,text,integer,text)" +msgid "`#2861 `__ _pgr_createIndex(text,text,text,integer,text)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_createIndex(text,text,text,text,integer,text)" +msgid "`#2861 `__ _pgr_createIndex(text,text,text,text,integer,text)" msgstr "" -msgid "" -"`#2913 `__ " -"_pgr_dagShortestPath(text,anyarray,anyarray,boolean,boolean)" +msgid "`#2913 `__ _pgr_dagShortestPath(text,anyarray,anyarray,boolean,boolean)" msgstr "" -msgid "" -"`#2913 `__ " -"_pgr_dagShortestPath(text,text,boolean,boolean)" +msgid "`#2913 `__ _pgr_dagShortestPath(text,text,boolean,boolean)" msgstr "" -msgid "" -"`#2730 `__ " -"_pgr_dijkstraNear(text,anyarray,anyarray,bigint,boolean)" +msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,anyarray,bigint,boolean)" msgstr "" -msgid "" -"`#2730 `__ " -"_pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)" +msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)" msgstr "" -msgid "" -"`#2730 `__ " -"_pgr_dijkstraNear(text,bigint,anyarray,bigint,boolean)" +msgid "`#2730 `__ _pgr_dijkstraNear(text,bigint,anyarray,bigint,boolean)" msgstr "" -msgid "" -"`#2730 `__ " -"_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" +msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" msgstr "" -msgid "" -"`#2730 `__ " -"_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" +msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" msgstr "" -msgid "" -"`#2730 `__ " -"_pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" +msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" msgstr "" -msgid "" -"`#2730 `__ " -"_pgr_dijkstra(text,text,boolean,boolean,boolean)" +msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,boolean)" msgstr "" -msgid "" -"`#2735 `__ " -"_pgr_drivingDistance(text,anyarray,double precision,boolean,boolean)" +msgid "`#2735 `__ _pgr_drivingDistance(text,anyarray,double precision,boolean,boolean)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_endPoint(geometry)" +msgid "`#2861 `__ _pgr_endPoint(geometry)" msgstr "" -msgid "" -"`#2861 `__ " -"__pgr_getColumnName(text,text,integer,text)" +msgid "`#2861 `__ __pgr_getColumnName(text,text,integer,text)" msgstr "" -msgid "" -"`#2861 `__ " -"__pgr_getColumnName(text,text,text,integer,text)" +msgid "`#2861 `__ __pgr_getColumnName(text,text,text,integer,text)" msgstr "" -msgid "" -"`#2861 `__ " -"__pgr_getColumnType(text,text,integer,text)" +msgid "`#2861 `__ __pgr_getColumnType(text,text,integer,text)" msgstr "" -msgid "" -"`#2861 `__ " -"__pgr_getColumnType(text,text,text,integer,text)" +msgid "`#2861 `__ __pgr_getColumnType(text,text,text,integer,text)" msgstr "" -msgid "" -"`#2861 `__ " -"__pgr_getTableName(text,integer,text)" +msgid "`#2861 `__ __pgr_getTableName(text,integer,text)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_isColumnIndexed(text,text,integer,text)" +msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,integer,text)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_isColumnIndexed(text,text,text,integer,text)" +msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,text,integer,text)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_isColumnIntable(text,text)" +msgid "`#2861 `__ _pgr_isColumnIntable(text,text)" msgstr "" -msgid "" -"`#2745 `__ " -"_pgr_kruskal(text,anyarray,text,bigint,double precision)" +msgid "`#2745 `__ _pgr_kruskal(text,anyarray,text,bigint,double precision)" msgstr "" -msgid "" -"`#2897 `__ _pgr_ksp(text," -"anyarray,anyarray,integer,boolean,boolean,boolean)" +msgid "`#2897 `__ _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean)" msgstr "" -msgid "" -"`#2897 `__ _pgr_ksp(text," -"bigint,bigint,integer,boolean,boolean)" +msgid "`#2897 `__ _pgr_ksp(text,bigint,bigint,integer,boolean,boolean)" msgstr "" -msgid "" -"`#2897 `__ _pgr_ksp(text," -"text,integer,boolean,boolean)" +msgid "`#2897 `__ _pgr_ksp(text,text,integer,boolean,boolean)" msgstr "" -msgid "" -"`#2899 `__ " -"_pgr_maxCardinalityMatch(text,boolean)" +msgid "`#2899 `__ _pgr_maxCardinalityMatch(text,boolean)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_msg(integer,text,text)" +msgid "`#2861 `__ _pgr_msg(integer,text,text)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_onerror(boolean,integer,text,text,text,text)" +msgid "`#2861 `__ _pgr_onerror(boolean,integer,text,text,text,text)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_pointtoid(geometry,double precision,text,integer)" +msgid "`#2861 `__ _pgr_pointtoid(geometry,double precision,text,integer)" msgstr "" -msgid "" -"`#2743 `__ " -"_pgr_prim(text,anyarray,text,bigint,double precision)" +msgid "`#2743 `__ _pgr_prim(text,anyarray,text,bigint,double precision)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_quote_ident(text)" +msgid "`#2861 `__ _pgr_quote_ident(text)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_startPoint(geometry)" +msgid "`#2861 `__ _pgr_startPoint(geometry)" msgstr "" -msgid "" -"`#2683 `__ " -"_pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean,text)" +msgid "`#2683 `__ _pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" msgstr "" -msgid "" -"`#2683 `__ " -"_pgr_trsp(text,text,anyarray,anyarray,boolean)" +msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,anyarray,boolean)" msgstr "" -msgid "" -"`#2683 `__ " -"_pgr_trsp(text,text,anyarray,bigint,boolean)" +msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,bigint,boolean)" msgstr "" -msgid "" -"`#2683 `__ " -"_pgr_trsp(text,text,bigint,anyarray,boolean)" +msgid "`#2683 `__ _pgr_trsp(text,text,bigint,anyarray,boolean)" msgstr "" -msgid "" -"`#2683 `__ " -"_pgr_trsp(text,text,bigint,bigint,boolean)" +msgid "`#2683 `__ _pgr_trsp(text,text,bigint,bigint,boolean)" msgstr "" -msgid "" -"`#2682 `__ " -"_pgr_trspViaVertices(text,integer[],boolean,boolean,text)" +msgid "`#2682 `__ _pgr_trspViaVertices(text,integer[],boolean,boolean,text)" msgstr "" -msgid "" -"`#2919 `__ " -"_pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean," -"character,boolean)" +msgid "`#2919 `__ _pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"_pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character," -"boolean)" +msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"_pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" +msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" msgstr "" -msgid "" -"`#2901 `__ " -"_pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer," -"integer,double precision,double precision,double precision,boolean)" +msgid "`#2901 `__ _pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgstr "" -msgid "" -"`#2901 `__ _pgr_tsp(text," -"bigint,bigint,double precision,integer,integer,integer,double precision," -"double precision,double precision,boolean)" +msgid "`#2901 `__ _pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_versionLess(text,text)" +msgid "`#2861 `__ _pgr_versionLess(text,text)" msgstr "" -msgid "" -"`#2890 `__ " -"_pgr_withPointsDD(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" +msgid "`#2890 `__ _pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" msgstr "" -msgid "" -"`#2895 `__ " -"_pgr_withPointsKSP(text,text,anyarray,anyarray,integer,character,boolean," -"boolean,boolean,boolean)" +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean)" msgstr "" -msgid "" -"`#2895 `__ " -"_pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character," -"boolean)" +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" msgstr "" -msgid "" -"`#2895 `__ " -"_pgr_withPointsKSP(text,text,text,integer,character,boolean,boolean,boolean)" +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,text,integer,character,boolean,boolean,boolean)" msgstr "" -msgid "" -"`#2741 `__ " -"_pgr_withPointsVia(text,bigint[],double precision[],boolean)" +msgid "`#2741 `__ _pgr_withPointsVia(text,bigint[],double precision[],boolean)" msgstr "" -msgid "" -"`#2741 `__ " -"_pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character," -"boolean)" +msgid "`#2741 `__ _pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "" -msgid "" -"`#2683 `__ _trsp(text," -"text,anyarray,anyarray,boolean)" +msgid "`#2683 `__ _trsp(text,text,anyarray,anyarray,boolean)" msgstr "" -msgid "" -"`#2683 `__ _v4trsp(text," -"text,anyarray,anyarray,boolean)" +msgid "`#2683 `__ _v4trsp(text,text,anyarray,anyarray,boolean)" msgstr "" -msgid "" -"`#2683 `__ _v4trsp(text," -"text,text,boolean)" +msgid "`#2683 `__ _v4trsp(text,text,text,boolean)" msgstr "" msgid "Summary of functions and signatures no longer on pgrouting" msgstr "" -msgid "" -"`#2748 `__ " -"pgr_alphashape(geometry,double precision)" +msgid "`#2748 `__ pgr_alphashape(geometry,double precision)" msgstr "" -msgid "" -"`#2752 `__ " -"pgr_analyzegraph(text,double precision,text,text,text,text,text)" +msgid "`#2752 `__ pgr_analyzegraph(text,double precision,text,text,text,text,text)" msgstr "" -msgid "" -"`#2755 `__ " -"pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)" +msgid "`#2755 `__ pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)" msgstr "" -msgid "" -"`#2798 `__ " -"pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgid "`#2798 `__ pgr_contraction(text,bigint[],integer,bigint[],boolean)" msgstr "" -msgid "" -"`#2751 `__ " -"pgr_createtopology(text,double precision,text,text,text,text,text,boolean)" +msgid "`#2751 `__ pgr_createtopology(text,double precision,text,text,text,text,text,boolean)" msgstr "" -msgid "" -"`#2827 `__ " -"pgr_createverticestable(text,text,text,text,text)" +msgid "`#2827 `__ pgr_createverticestable(text,text,text,text,text)" msgstr "" -msgid "" -"`#2888 `__ " -"pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" +msgid "`#2888 `__ pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" msgstr "" -msgid "" -"`#2888 `__ " -"pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" +msgid "`#2888 `__ pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" msgstr "" -msgid "" -"`#2899 `__ " -"pgr_maxCardinalityMatch(text,boolean)" +msgid "`#2899 `__ pgr_maxCardinalityMatch(text,boolean)" msgstr "" -msgid "" -"`#2886 `__ " -"pgr_nodenetwork(text,double precision,text,text,text,text,boolean)" +msgid "`#2886 `__ pgr_nodenetwork(text,double precision,text,text,text,text,boolean)" msgstr "" -msgid "" -"`#2683 `__ pgr_trsp(text," -"integer,double precision,integer,double precision,boolean,boolean,text)" +msgid "`#2683 `__ pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" msgstr "" -msgid "" -"`#2683 `__ pgr_trsp(text," -"integer,integer,boolean,boolean,text)" +msgid "`#2683 `__ pgr_trsp(text,integer,integer,boolean,boolean,text)" msgstr "" -msgid "" -"`#2681 `__ " -"pgr_trspViaedges(text,integer[],double precision[],boolean,boolean,text)" +msgid "`#2681 `__ pgr_trspViaedges(text,integer[],double precision[],boolean,boolean,text)" msgstr "" -msgid "" -"`#2682 `__ " -"pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" +msgid "`#2682 `__ pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean," -"character,boolean)" +msgid "`#2919 `__ pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character," -"boolean)" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" msgstr "" -msgid "" -"`#2901 `__ " -"pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer," -"double precision,double precision,double precision,boolean)" +msgid "`#2901 `__ pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgstr "" -msgid "" -"`#2901 `__ pgr_tsp(text," -"bigint,bigint,double precision,integer,integer,integer,double precision," -"double precision,double precision,boolean)" +msgid "`#2901 `__ pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPointsCostMatrix(text,text,anyarray,boolean,character)" +msgid "`#2919 `__ pgr_withPointsCostMatrix(text,text,anyarray,boolean,character)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,anyarray,anyarray,boolean,character)" +msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,anyarray,boolean,character)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,anyarray,bigint,boolean,character)" +msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,bigint,boolean,character)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,bigint,anyarray,boolean,character)" +msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,anyarray,boolean,character)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,bigint,bigint,boolean,character)" +msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,bigint,boolean,character)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,text,boolean,character)" +msgid "`#2919 `__ pgr_withPointsCost(text,text,text,boolean,character)" msgstr "" -msgid "" -"`#2890 `__ " -"pgr_withPointsDD(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" +msgid "`#2890 `__ pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" msgstr "" -msgid "" -"`#2890 `__ " -"pgr_withPointsDD(text,text,bigint,double precision,boolean,character,boolean)" +msgid "`#2890 `__ pgr_withPointsDD(text,text,bigint,double precision,boolean,character,boolean)" msgstr "" -msgid "" -"`#2895 `__ " -"pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character," -"boolean)" +msgid "`#2895 `__ pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPoints(text,text,anyarray,anyarray,boolean,character,boolean)" +msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,anyarray,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPoints(text,text,anyarray,bigint,boolean,character,boolean)" +msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,bigint,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPoints(text,text,bigint,anyarray,boolean,character,boolean)" +msgid "`#2919 `__ pgr_withPoints(text,text,bigint,anyarray,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPoints(text,text,bigint,bigint,boolean,character,boolean)" +msgid "`#2919 `__ pgr_withPoints(text,text,bigint,bigint,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPoints(text,text,text,boolean,character,boolean)" +msgid "`#2919 `__ pgr_withPoints(text,text,text,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character," -"boolean)" +msgid "`#2919 `__ pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "" msgid "Code enhancements" @@ -5335,14 +4567,10 @@ msgstr "" msgid "`#2683 `__ _v4trsp" msgstr "" -msgid "" -"`#2748 `__ " -"_pgr_alphaShape" +msgid "`#2748 `__ _pgr_alphaShape" msgstr "" -msgid "" -"`#2913 `__ " -"_pgr_dagShortestPath" +msgid "`#2913 `__ _pgr_dagShortestPath" msgstr "" msgid "All releases" @@ -5351,10 +4579,7 @@ msgstr "" msgid "Kruskal - Family of functions" 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." +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 "**The main Characteristics are:**" @@ -5373,9 +4598,7 @@ msgstr "ダイクストラ関連機能" msgid "Migration guide" msgstr "" -msgid "" -"Several functions are having changes on the signatures, and/or have been " -"replaced by new functions." +msgid "Several functions are having changes on the signatures, and/or have been replaced by new functions." msgstr "" msgid "Results can be different because of the changes." @@ -5388,9 +4611,7 @@ msgstr "" msgid "Migration to standardized columns" msgstr "ダイクストラ関連機能" -msgid "" -"There has been an effort to standardize function output columns names and " -"types." +msgid "There has been an effort to standardize function output columns names and types." msgstr "" msgid ":ref:`pgRouting-concepts:Result columns for cost functions`" @@ -5492,14 +4713,10 @@ msgstr "ダイクストラ関連機能" msgid "Migration of cost functions" msgstr "ダイクストラ関連機能" -msgid "" -"The standardized :ref:`pgRouting-concepts:Result columns for cost functions` " -"are |matrix-result|" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for cost functions` are |matrix-result|" msgstr "" -msgid "" -"The following functions need to be migrated when they are being used in an " -"application." +msgid "The following functions need to be migrated when they are being used in an application." msgstr "" #, fuzzy @@ -5549,17 +4766,13 @@ msgstr "" msgid "Breaking change" msgstr "" -msgid "" -"If using ``pgr_withPointsCost``: column names must be changed after updating " -"pgRouting" +msgid "If using ``pgr_withPointsCost``: column names must be changed after updating pgRouting" msgstr "" msgid "New output columns are |matrix-result|" msgstr "" -msgid "" -"To get the old version column names: rename ``start_vid`` to ``start_pid`` " -"and ``end_vid`` to ``end_pid``." +msgid "To get the old version column names: rename ``start_vid`` to ``start_pid`` and ``end_vid`` to ``end_pid``." msgstr "" msgid "Examples" @@ -5572,9 +4785,7 @@ msgstr "" msgid "Using ``pgr_withPointsCost``" msgstr "ダイクストラ関連機能" -msgid "" -"Migrating `this v3.8 `__ example." +msgid "Migrating `this v3.8 `__ example." msgstr "" msgid "from" @@ -5586,43 +4797,33 @@ msgstr "" msgid "Examples for One to Many for cost functions" msgstr "" -msgid "" -"Migrating `this v3.8 `__ example." +msgid "Migrating `this v3.8 `__ example." msgstr "" msgid "Examples for Many to One for cost functions" msgstr "" -msgid "" -"Migrating `this v3.8 `__ example." +msgid "Migrating `this v3.8 `__ example." msgstr "" msgid "Examples for Many to Many for cost functions" msgstr "" -msgid "" -"Migrating `this v3.8 `__ example." +msgid "Migrating `this v3.8 `__ example." msgstr "" #, fuzzy msgid "Examples for Combinations for cost functions" msgstr "ダイクストラ関連機能" -msgid "" -"Migrating `this v3.8 `__ example." +msgid "Migrating `this v3.8 `__ example." msgstr "" #, fuzzy msgid "Migration of multiple paths functions" msgstr "ダイクストラ関連機能" -msgid "" -"The standardized :ref:`pgRouting-concepts:Result columns for single path " -"functions` are |nksp-result|" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |nksp-result|" msgstr "" #, fuzzy @@ -5655,9 +4856,7 @@ msgstr "" msgid "One to One example using ``pgr_KSP``" msgstr "" -msgid "" -"Using `this `__ " -"example." +msgid "Using `this `__ example." msgstr "" #, fuzzy @@ -5676,9 +4875,7 @@ msgstr "" msgid "One to One example using ``pgr_edgeDisjointPaths``" msgstr "" -msgid "" -"Migrating `this v3.8 `__ example." +msgid "Migrating `this v3.8 `__ example." msgstr "" msgid "Before updating pgRouting enumerate the columns: |ksp-result|" @@ -5688,9 +4885,7 @@ msgstr "" msgid "Migration of single path functions" msgstr "ダイクストラ関連機能" -msgid "" -"The standardized :ref:`pgRouting-concepts:Result columns for single path " -"functions` are |short-generic-result|" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |short-generic-result|" msgstr "" msgid "``pgr_dijkstra``" @@ -5735,9 +4930,7 @@ msgstr "" msgid "Migration of |old-generic-result|" msgstr "ダイクストラ関連機能" -msgid "" -"Before updating pgRouting, enumerate the corresponding columns of the " -"signature" +msgid "Before updating pgRouting, enumerate the corresponding columns of the signature" msgstr "" msgid "Migration of |old-pid-result|" @@ -5760,9 +4953,7 @@ msgstr "" msgid "``end_vid`` to ``end_pid``" msgstr "" -msgid "" -"If using ``pgr_withPoints``: column names must be changed after updating " -"pgRouting" +msgid "If using ``pgr_withPoints``: column names must be changed after updating pgRouting" msgstr "" #, fuzzy @@ -5783,9 +4974,7 @@ msgstr "" msgid "Using ``pgr_aStar``" msgstr "pgr_TSP" -msgid "" -"Migrating `this v3.5 `__ example." +msgid "Migrating `this v3.5 `__ example." msgstr "" msgid "Before updating pgRouting enumerate the columns: |result-1-1|" @@ -5795,18 +4984,14 @@ msgstr "" msgid "Using ``pgr_bdDijkstra``" msgstr "ダイクストラ関連機能" -msgid "" -"Migrating `this v3.8 `__ example." +msgid "Migrating `this v3.8 `__ example." msgstr "" #, fuzzy msgid "Using ``pgr_DAGshortestPath``" msgstr "ダイクストラ関連機能" -msgid "" -"Migrating `this v3.8 `__ example." +msgid "Migrating `this v3.8 `__ example." msgstr "" msgid "This applies to all signatures of ``pgr_DAGshortestPath``" @@ -5819,9 +5004,7 @@ msgstr "" msgid "Using ``pgr_bdAstar``" msgstr "ダイクストラ関連機能" -msgid "" -"Migrating `this v3.5 `__ example." +msgid "Migrating `this v3.5 `__ example." msgstr "" msgid "Before updating pgRouting enumerate the columns: |result-1-m|" @@ -5831,26 +5014,20 @@ msgstr "" msgid "Using ``pgr_withPoints``" msgstr "pgr_TSP" -msgid "" -"Migrating `this v3.8 `__ example." +msgid "Migrating `this v3.8 `__ example." msgstr "" msgid "|pid-1-m|" msgstr "" #, fuzzy -msgid "" -"To get the old signature column names: filter out the column ``start_vid`` " -"and rename ``end_vid`` to ``end_pid``." +msgid "To get the old signature column names: filter out the column ``start_vid`` and rename ``end_vid`` to ``end_pid``." msgstr "start_vid から end_vid まで行くのにかかるコスト" msgid "Examples for Many to One with one route result" msgstr "" -msgid "" -"Migrating `this v3.8 `__ example." +msgid "Migrating `this v3.8 `__ example." msgstr "" msgid "Before updating pgRouting enumerate the columns: |result-m-1|" @@ -5860,17 +5037,13 @@ msgstr "" msgid "Using ``pgr_dijkstra``" msgstr "ダイクストラ関連機能" -msgid "" -"Migrating `this v3.4 `__ example." +msgid "Migrating `this v3.4 `__ example." msgstr "" msgid "Examples for Many to Many with one route result" msgstr "" -msgid "" -"Migrating `this v3.8 `__ example." +msgid "Migrating `this v3.8 `__ example." msgstr "" msgid "|pid-m-m|" @@ -5879,18 +5052,14 @@ msgstr "" msgid "Examples for combinations with one route result" msgstr "" -msgid "" -"Migrating `this v3.8 `this `__ example." +msgid "Migrating `this v3.8 `this `__ example." msgstr "" #, fuzzy msgid "Migration of spanning tree functions" msgstr "ダイクストラ関連機能" -msgid "" -"The standardized :ref:`pgRouting-concepts:Result columns for spanning tree " -"functions` are |result-spantree|" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for spanning tree functions` are |result-spantree|" msgstr "" msgid "``pgr_drivingDistance``" @@ -5960,9 +5129,7 @@ msgstr "" msgid "Single vertex example using ``pgr_kruskalDD``" msgstr ":doc:`pgr_kruskalBFS`" -msgid "" -"Migrating `this v3.6 `__ example." +msgid "Migrating `this v3.6 `__ example." msgstr "" msgid "Before updating pgRouting enumerate the columns: |result-bfs|." @@ -5972,9 +5139,7 @@ msgstr "" msgid "Multiple vertices example using ``pgr_kruskalDFS``" msgstr ":doc:`pgr_kruskalBFS`" -msgid "" -"Migrating `this v3.6 `__ example." +msgid "Migrating `this v3.6 `__ example." msgstr "" #, fuzzy @@ -6009,9 +5174,7 @@ msgstr "" msgid "Single vertex example using ``pgr_drivingDistance``" msgstr "" -msgid "" -"Migrating `this v3.5 `__ example." +msgid "Migrating `this v3.5 `__ example." msgstr "" msgid "Before updating pgRouting, enumerate |result-1-1-no-seq| columns" @@ -6020,14 +5183,10 @@ msgstr "" msgid "Multiple vertices example using ``pgr_drivingDistance``" msgstr "" -msgid "" -"Migrating `this v3.5 `__ example." +msgid "Migrating `this v3.5 `__ example." msgstr "" -msgid "" -"To get the old version column names |result-dij-dd-m|: filter out the column " -"``pred`` and ``depth`` and rename ``start_vid`` to ``from_v``." +msgid "To get the old version column names |result-dij-dd-m|: filter out the column ``pred`` and ``depth`` and rename ``start_vid`` to ``from_v``." msgstr "" #, fuzzy @@ -6040,9 +5199,7 @@ msgstr "" msgid "Enumerate |result-1-1-no-seq| columns" msgstr "" -msgid "" -"Use an unnamed valid value for **driving side** after the **distance** " -"parameter." +msgid "Use an unnamed valid value for **driving side** after the **distance** parameter." msgstr "" msgid "Enumerate |result-m-1-no-seq| columns" @@ -6051,9 +5208,7 @@ msgstr "" msgid "Default value of **driving side** parameter" msgstr "" -msgid "" -"**driving side** parameter is unnamed, and valid values differ for directed " -"and undirected graphs." +msgid "**driving side** parameter is unnamed, and valid values differ for directed and undirected graphs." msgstr "" msgid "In directed graph: valid values are [``r``, ``R``, ``l``, ``L``]" @@ -6072,18 +5227,14 @@ msgstr "" msgid "Single vertex example using ``pgr_withPointsDD``" msgstr "pgr_TSP" -msgid "" -"Migrating `this v3.5 `__ example." +msgid "Migrating `this v3.5 `__ example." msgstr "" #, fuzzy msgid "Multiple vertices example using ``pgr_withPointsDD``" msgstr "pgr_TSP" -msgid "" -"Migrating `this v3.5 `__ example." +msgid "Migrating `this v3.5 `__ example." msgstr "" #, fuzzy @@ -6229,9 +5380,7 @@ msgstr "" msgid "If you have SFCGAL, which you can install using" msgstr "" -msgid "" -"Since PostGIS 3.5+ use `CG_AlphaShape `__" +msgid "Since PostGIS 3.5+ use `CG_AlphaShape `__" msgstr "" msgid "For PostGIS 3.5+ use the old name ``ST_AlphaShape``" @@ -6250,9 +5399,7 @@ msgstr "" msgid "Migration of ``pgr_nodeNetwork``" msgstr "ダイクストラ関連機能" -msgid "" -"**Before Deprecation:** A table with `_nodded` was created. with " -"split edges." +msgid "**Before Deprecation:** A table with `_nodded` was created. with split edges." msgstr "" #, fuzzy @@ -6269,62 +5416,38 @@ msgstr "ダイクストラ関連機能" msgid "A table with `_vertices_pgr` was created." msgstr "" -msgid "" -"**After Deprecation:** The user is responsible to create the complete " -"topology." +msgid "**After Deprecation:** The user is responsible to create the complete topology." msgstr "" msgid "Build a routing topology" msgstr "" -msgid "" -"The basic information to use the majority of the pgRouting functions ``id, " -"source, target, cost, [reverse_cost]`` is what in pgRouting is called the " -"routing topology." +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 "" -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." +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 "" -msgid "" -"When the data comes with geometries and there is no routing topology, then " -"this step is needed." +msgid "When the data comes with geometries and there is no routing topology, then this step is needed." msgstr "" -msgid "" -"All the start and end vertices of the geometries need an identifier that is " -"to be stored in a ``source`` and ``target`` columns of the table of the " -"data. Likewise, ``cost`` and ``reverse_cost`` need to have the value of " -"traversing the edge in both directions." +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 "" -msgid "" -"If the columns do not exist they need to be added to the table in question. " -"(see `ALTER TABLE `__)" +msgid "If the columns do not exist they need to be added to the table in question. (see `ALTER TABLE `__)" msgstr "" -msgid "" -"The function :doc:`pgr_extractVertices` is used to create a vertices table " -"based on the edge identifier and the geometry of the edge of the graph." +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 "" -msgid "" -"Finally using the data stored on the vertices tables the ``source`` and " -"``target`` are filled up." +msgid "Finally using the data stored on the vertices tables the ``source`` and ``target`` are filled up." msgstr "" #, fuzzy msgid "Migration of ``pgr_createVerticesTable``" msgstr "ダイクストラ関連機能" -msgid "" -"**After Deprecation:** The user is responsible to create the vertices table, " -"indexes, etc. They may use :doc:`pgr_extractVertices` for that purpose." +msgid "**After Deprecation:** The user is responsible to create the vertices table, indexes, etc. They may use :doc:`pgr_extractVertices` for that purpose." msgstr "" msgid "Migration of ``pgr_analyzeOneWay``" @@ -6342,14 +5465,10 @@ msgstr "" msgid "Dead ends." msgstr "" -msgid "" -"A routing problem can arise when from a vertex there is only a way on or a " -"way out but not both:" +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 "" -"Either saving or using directly :doc:`pgr_extractVertices` get the dead ends " -"information and determine if the adjacent edge is one way or not." +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 "In this example :doc:`pgr_extractVertices` has already been applied." @@ -6358,10 +5477,7 @@ msgstr "" msgid "Bridges." msgstr "" -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." +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 "To determine if the bridges are or not one way." @@ -6421,9 +5537,7 @@ msgstr "もっと詳しく知る" msgid "Components." msgstr "コンテンツ" -msgid "" -"Instead of counting only isolated segments, determine all the components of " -"the graph." +msgid "Instead of counting only isolated segments, determine all the components of the graph." msgstr "" msgid "Depending of the final application requirements use:" @@ -6443,32 +5557,22 @@ msgstr "" msgid "For example:" msgstr "例" -msgid "" -"Instead of counting the dead ends, determine all the dead ends of the graph " -"using :doc:`pgr_degree`." +msgid "Instead of counting the dead ends, determine all the dead ends of the graph using :doc:`pgr_degree`." msgstr "" msgid "Potential gaps near dead ends." msgstr "" -msgid "" -"Instead of counting potential gaps between geometries, determine the " -"geometric gaps in the graph using :doc:`pgr_findCloseEdges`." +msgid "Instead of counting potential gaps between geometries, determine the geometric gaps in the graph using :doc:`pgr_findCloseEdges`." msgstr "" msgid "Topological relationships." msgstr "" -msgid "" -"Instead of counting intersections, determine topological relationships " -"between geometries." +msgid "Instead of counting intersections, determine topological relationships between geometries." msgstr "" -msgid "" -"Several PostGIS functions can be used: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." +msgid "Several PostGIS functions can be used: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." msgstr "" msgid "Migration of ``pgr_trsp`` (Vertices)" @@ -6572,9 +5676,7 @@ msgstr "" msgid "Migration of ``pgr_withPointsKSP``" msgstr "" -msgid "" -"Starting from `v3.6.0 `__ :" -"doc:`pgr_withPointsKSP` result columns are being standardized." +msgid "Starting from `v3.6.0 `__ :doc:`pgr_withPointsKSP` result columns are being standardized." msgstr "" msgid "|ksp-result|" @@ -6583,9 +5685,7 @@ msgstr "" msgid "|generic-result|" msgstr "" -msgid "" -"And ``driving side`` parameter changed from named optional to unnamed " -"**driving side** and its validity differ for directed and undirected graphs." +msgid "And ``driving side`` parameter changed from named optional to unnamed **driving side** and its validity differ for directed and undirected graphs." msgstr "" msgid "``pgr_withPointsKSP`` (`One to One`)" @@ -6610,9 +5710,7 @@ msgstr "" msgid "New output columns are |generic-result|" msgstr "" -msgid "" -"Using `this `__ example." +msgid "Using `this `__ example." msgstr "" msgid "``start_vid`` contains the **start vid** parameter value." @@ -6621,9 +5719,7 @@ msgstr "" msgid "``end_vid`` contains the **end vid** parameter value." msgstr "" -msgid "" -"If needed filter out the additional columns, for example, to return the " -"original columns:" +msgid "If needed filter out the additional columns, for example, to return the original columns:" msgstr "" msgid "Use ``pgr_withPoints`` when there are no restrictions." @@ -6641,13 +5737,10 @@ msgstr "" msgid "Migration of ``pgr_maxCardinalityMatch``" msgstr "" -msgid "" -":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, therefore " -"the ``directed`` flag has been removed." +msgid ":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, therefore the ``directed`` flag has been removed." msgstr "" -msgid "" -"Starting from `v3.4.0 `__" +msgid "Starting from `v3.4.0 `__" msgstr "" msgid "Signature to be migrated:" @@ -6678,27 +5771,19 @@ msgstr "" msgid "Before migration" msgstr "もっと詳しく知る" -msgid "" -"Columns used are ``going`` and ``coming`` to represent the existence of an " -"edge." +msgid "Columns used are ``going`` and ``coming`` to represent the existence of an edge." msgstr "" -msgid "" -"Flag ``directed`` was used to indicate if it was for a **directed** or " -"**undirected** graph." +msgid "Flag ``directed`` was used to indicate if it was for a **directed** or **undirected** graph." msgstr "" msgid "The flag ``directed`` is ignored." msgstr "" -msgid "" -"Regardless of it's value it gives the result considering the graph as " -"**undirected**." +msgid "Regardless of it's value it gives the result considering the graph as **undirected**." msgstr "" -msgid "" -"Use the columns ``cost`` and ``reverse_cost`` to represent the existence of " -"an edge." +msgid "Use the columns ``cost`` and ``reverse_cost`` to represent the existence of an edge." msgstr "" msgid "Do not use the flag ``directed``." @@ -6758,9 +5843,7 @@ msgstr "" msgid "Old restrictions contents" msgstr "" -msgid "" -"The restriction with ``rid = 2`` is representing :math:`3 \\rightarrow 5 " -"\\rightarrow9`" +msgid "The restriction with ``rid = 2`` is representing :math:`3 \\rightarrow 5 \\rightarrow9`" msgstr "" msgid ":math:`3\\rightarrow5`" @@ -6814,16 +5897,13 @@ msgstr "" msgid "Restrictions data" msgstr "" -msgid "" -"The restriction with ``rid = 2`` represents the path :math:`3 \\rightarrow5 " -"\\rightarrow9`." +msgid "The restriction with ``rid = 2`` represents the path :math:`3 \\rightarrow5 \\rightarrow9`." msgstr "" msgid "By inspection the path is clear." msgstr "" -msgid "" -"To transform the old restrictions table to the new restrictions structure," +msgid "To transform the old restrictions table to the new restrictions structure," msgstr "" msgid "Create a new table with the new restrictions structure." @@ -6832,9 +5912,7 @@ msgstr "" msgid "In this migration guide ``new_restrictions`` is been used." msgstr "" -msgid "" -"For this migration pgRouting supplies an auxiliary function for reversal of " -"an array ``_pgr_array_reverse`` needed for the migration." +msgid "For this migration pgRouting supplies an auxiliary function for reversal of an array ``_pgr_array_reverse`` needed for the migration." msgstr "" msgid "``_pgr_array_reverse``:" @@ -6863,9 +5941,7 @@ msgstr "ダイクストラ関連機能" msgid "pgRouting Concepts" msgstr "" -msgid "" -"This is a simple guide that go through some of the steps for getting started " -"with pgRouting. This guide covers:" +msgid "This is a simple guide that go through some of the steps for getting started with pgRouting. This guide covers:" msgstr "" msgid "Graphs" @@ -6898,8 +5974,7 @@ msgstr "" msgid "Directed simple graph" msgstr "" -msgid "" -":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" +msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" msgstr "" msgid "Graphs:" @@ -6908,13 +5983,10 @@ msgstr "" msgid "Do not have geometries." msgstr "" -msgid "" -"Some graph theory problems require graphs to have weights, called **cost** " -"in pgRouting." +msgid "Some graph theory problems require graphs to have weights, called **cost** in pgRouting." msgstr "" -msgid "" -"In pgRouting there are several ways to represent a graph on the database:" +msgid "In pgRouting there are several ways to represent a graph on the database:" msgstr "" msgid "With ``cost``" @@ -6929,9 +6001,7 @@ msgstr "" msgid "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)" msgstr "" -msgid "" -"Identifier of the edge. Requirement to use the database in a consistent. " -"manner." +msgid "Identifier of the edge. Requirement to use the database in a consistent. manner." msgstr "" msgid "Identifier of a vertex." @@ -6940,20 +6010,16 @@ msgstr "" msgid "Weight of the edge (``source``, ``target``):" msgstr "" -msgid "" -"When negative the edge (``source``, ``target``) do not exist on the graph." +msgid "When negative the edge (``source``, ``target``) do not exist on the graph." msgstr "" msgid "``cost`` must exist in the query." msgstr "" -msgid "" -"When negative the edge (``target``, ``source``) do not exist on the graph." +msgid "When negative the edge (``target``, ``source``) do not exist on the graph." msgstr "" -msgid "" -"The decision of the graph to be **directed** or **undirected** is done when " -"executing a pgRouting algorithm." +msgid "The decision of the graph to be **directed** or **undirected** is done when executing a pgRouting algorithm." msgstr "" msgid "Graph with ``cost``" @@ -6968,9 +6034,7 @@ msgstr "" msgid "``SELECT id, source, target, cost FROM edges``" msgstr "" -msgid "" -":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} " -"\\ge 0 \\}`" +msgid ":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} \\ge 0 \\}`" msgstr "" msgid "Edges where ``cost`` is non negative are part of the graph." @@ -6982,9 +6046,7 @@ msgstr "" msgid "All vertices in ``source`` and ``target`` are part of the graph." msgstr "" -msgid "" -"In a directed graph the edge :math:`(source_{id}, target_{id}, cost_{id})` " -"has directionality: :math:`source_{id} \\rightarrow target_{id}`" +msgid "In a directed graph the edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`" msgstr "" msgid "For the following data:" @@ -6996,20 +6058,13 @@ msgstr "" msgid "The data is representing the following graph:" msgstr "" -msgid "" -"In an undirected graph the edge :math:`(source_{id}, target_{id}, " -"cost_{id})` does not have directionality: :math:`source_{id} \\frac{\\;\\;\\;" -"\\;\\;}{} target_{id}`" +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 "" -msgid "" -"In terms of a directed graph is like having two edges: :math:`source_{id} " -"\\leftrightarrow target_{id}`" +msgid "In terms of a directed graph is like having two edges: :math:`source_{id} \\leftrightarrow target_{id}`" msgstr "" -msgid "" -"Edge :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) is not part of the " -"graph." +msgid "Edge :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) is not part of the graph." msgstr "" msgid "Graph with ``cost`` and ``reverse_cost``" @@ -7021,21 +6076,13 @@ msgstr "" msgid "The set of edges :math:`E`:" msgstr "" -msgid "" -":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, " -"cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & " -"{\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } " -"reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" +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 "" -msgid "" -"Edges :math:`(source \\rightarrow target)` where ``cost`` is non negative " -"are part of the graph." +msgid "Edges :math:`(source \\rightarrow target)` where ``cost`` is non negative are part of the graph." msgstr "" -msgid "" -"Edges :math:`(target \\rightarrow source)` where ``reverse_cost`` is non " -"negative are part of the graph." +msgid "Edges :math:`(target \\rightarrow source)` where ``reverse_cost`` is non negative are part of the graph." msgstr "" msgid "The set of vertices :math:`V`:" @@ -7044,14 +6091,10 @@ msgstr "ノードのセット :math:`V`:" msgid "In a directed graph both edges have directionality" msgstr "" -msgid "" -"edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:" -"`source_{id} \\rightarrow target_{id}`" +msgid "edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`" msgstr "" -msgid "" -"edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` has " -"directionality: :math:`target_{id} \\rightarrow source_{id}`" +msgid "edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` has directionality: :math:`target_{id} \\rightarrow source_{id}`" msgstr "" msgid "Edges not part of the graph:" @@ -7066,14 +6109,10 @@ msgstr "" msgid "In a directed graph both edges do not have directionality" msgstr "" -msgid "" -"Edge :math:`(source_{id}, target_{id}, cost_{id})` is :math:`source_{id} " -"\\frac{\\;\\;\\;\\;\\;}{} target_{id}`" +msgid "Edge :math:`(source_{id}, target_{id}, cost_{id})` is :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" msgstr "" -msgid "" -"Edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` is :math:" -"`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" +msgid "Edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` is :math:`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" msgstr "" msgid "In terms of a directed graph is like having four edges:" @@ -7094,18 +6133,13 @@ msgstr "" msgid "Graphs without geometries" msgstr "" -msgid "" -"Personal relationships, genealogy, file dependency problems can be solved " -"using pgRouting. Those problems, normally, do not come with geometries " -"associated with the graph." +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 "" msgid "Wiki example" msgstr "" -msgid "" -"Solve the example problem taken from `wikipedia `__):" +msgid "Solve the example problem taken from `wikipedia `__):" msgstr "" msgid "Problem is to find the shortest path from :math:`1` to :math:`5`." @@ -7114,8 +6148,7 @@ msgstr "" msgid "Is an undirected graph." msgstr "" -msgid "" -"Although visually looks like to have geometries, the drawing is not to scale." +msgid "Although visually looks like to have geometries, the drawing is not to scale." msgstr "" msgid "No geometries associated to the vertices or edges" @@ -7127,10 +6160,7 @@ msgstr "" msgid "Has 9 edges:" msgstr "" -msgid "" -":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\" -"\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & " -"(5,6,9) \\} \\end{align} \\end{split}`" +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 "" msgid "The graph can be represented in many ways for example:" @@ -7139,17 +6169,13 @@ msgstr "" msgid "Prepare the database" msgstr "データベースの準備" -msgid "" -"Create a database for the example, access the database and install " -"pgRouting: ::" +msgid "Create a database for the example, access the database and install pgRouting: ::" msgstr "" msgid "Create a table" msgstr "" -msgid "" -"The basic elements needed to perform basic routing on an undirected graph " -"are:" +msgid "The basic elements needed to perform basic routing on an undirected graph are:" msgstr "" msgid "SMALLINT, INTEGER, BIGINT, REAL, FLOAT" @@ -7167,9 +6193,7 @@ msgstr "" msgid "To solve this example :doc:`pgr_dijkstra` is used:" msgstr "" -msgid "" -"To go from :math:`1` to :math:`5` the path goes thru the following " -"vertices: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" +msgid "To go from :math:`1` to :math:`5` the path goes thru the following vertices: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" msgstr "" msgid "Vertex information" @@ -7184,16 +6208,13 @@ msgstr "" msgid "Create a routing Database" msgstr "" -msgid "" -"The first step is to create a database and load pgRouting in the database." +msgid "The first step is to create a database and load pgRouting in the database." msgstr "" msgid "Typically create a database for each project." msgstr "" -msgid "" -"Once having the database to work in, load your data and build the routing " -"application in that database." +msgid "Once having the database to work in, load your data and build the routing application in that database." msgstr "" msgid "Load Data" @@ -7211,9 +6232,7 @@ msgstr "" msgid ":doc:`sampledata`: a small graph used in the documentation examples" msgstr "" -msgid "" -"Using `osm2pgrouting `__" +msgid "Using `osm2pgrouting `__" msgstr "" msgid "There are various open source tools that can help, like:" @@ -7237,18 +6256,13 @@ msgstr "" msgid "load OSM data into postgresql" 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." +msgid "Please note that these tools will **not** import the data in a structure compatible with pgRouting and when this happens the topology needs to be adjusted." msgstr "" msgid "Breakup a segments on each segment-segment intersection" msgstr "" -msgid "" -"When missing, add columns and assign values to ``source``, ``target``, " -"``cost``, ``reverse_cost``." +msgid "When missing, add columns and assign values to ``source``, ``target``, ``cost``, ``reverse_cost``." msgstr "" msgid "Connect a disconnected graph." @@ -7272,22 +6286,13 @@ msgstr "" msgid "Prepare the graph" msgstr "" -msgid "" -"What and how to prepare the graph, will depend on the application and/or on " -"the quality of the data and/or on how close the information is to have a " -"topology usable by pgRouting and/or some other factors not mentioned." +msgid "What and how to prepare the graph, will depend on the application and/or on the quality of the data and/or on how close the information is to have a topology usable by pgRouting and/or some other factors not mentioned." msgstr "" -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." +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." msgstr "" -msgid "" -"The `workshop `__ has a step by step " -"on how to prepare a graph using Open Street Map data, for a small " -"application." +msgid "The `workshop `__ has a step by step on how to prepare a graph using Open Street Map data, for a small application." msgstr "" msgid "The use of indexes on the database design in general:" @@ -7299,32 +6304,22 @@ msgstr "" msgid "Have the identifiers columns indexed." msgstr "" -msgid "" -"Please consult the `PostgreSQL `__ " -"documentation and the `PostGIS `__ documentation." +msgid "Please consult the `PostgreSQL `__ documentation and the `PostGIS `__ documentation." 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 `__." +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 "" msgid "Adjust costs" msgstr "" -msgid "" -"For this example the ``cost`` and ``reverse_cost`` values are going to be " -"the double of the length of the geometry." +msgid "For this example the ``cost`` and ``reverse_cost`` values are going to be the double of the length of the geometry." msgstr "" msgid "Update costs to length of geometry" msgstr "" -msgid "" -"Suppose that ``cost`` and ``reverse_cost`` columns in the sample data " -"represent:" +msgid "Suppose that ``cost`` and ``reverse_cost`` columns in the sample data represent:" msgstr "" msgid ":math:`1` when the edge exists in the graph" @@ -7339,9 +6334,7 @@ msgstr "" msgid "Which gives the following results:" msgstr "" -msgid "" -"Note that to be able to follow the documentation examples, everything is " -"based on the original graph." +msgid "Note that to be able to follow the documentation examples, everything is based on the original graph." msgstr "" msgid "Returning to the original data:" @@ -7392,9 +6385,7 @@ msgstr "" msgid "A sub graph is needed for the application." msgstr "" -msgid "" -"and many other problems that the pgRouting user, that is the application " -"developer might encounter." +msgid "and many other problems that the pgRouting user, that is the application developer might encounter." msgstr "" msgid "Crossing edges" @@ -7403,21 +6394,16 @@ msgstr "" msgid "To get the crossing edges:" msgstr "" -msgid "" -"That information is correct, for example, when in terms of vehicles, is it a " -"tunnel or bridge crossing over another road." +msgid "That information is correct, for example, when in terms of vehicles, is it a tunnel or bridge crossing over another road." msgstr "" msgid "It might be incorrect, for example:" msgstr "" -msgid "" -"When it is actually an intersection of roads, where vehicles can make turns." +msgid "When it is actually an intersection of roads, where vehicles can make turns." msgstr "" -msgid "" -"When in terms of electrical lines, the electrical line is able to switch " -"roads even on a tunnel or bridge." +msgid "When in terms of electrical lines, the electrical line is able to switch roads even on a tunnel or bridge." msgstr "" msgid "When it is incorrect, it needs fixing:" @@ -7426,47 +6412,32 @@ msgstr "" msgid "For vehicles and pedestrians" 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." +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 "" -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" +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 "For very specific applications" msgstr "" -msgid "" -"The data is correct when from the point of view of routing vehicles or " -"pedestrians." +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 `__." +msgid "Once analyzed one by one the crossings, for the ones that need a local fix, the edges need to be `split `__." 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." +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 "" #, fuzzy msgid "Fixing an intersection" msgstr "序章" -msgid "" -"In this example the original edge table will be used to store the additional " -"geometries." +msgid "In this example the original edge table will be used to store the additional geometries." msgstr "" msgid "An example use without results" @@ -7491,18 +6462,13 @@ msgstr "" msgid "Adding new segments." msgstr "" -msgid "" -"Calling :doc:`pgr_separateCrossing` and adding the new segments to the edges " -"table." +msgid "Calling :doc:`pgr_separateCrossing` and adding the new segments to the edges table." msgstr "" msgid "Update other values" msgstr "" -msgid "" -"In this example only ``cost`` and ``reverse_cost`` are updated, where they " -"are based on the length of the geometry and the directionality is kept using " -"the ``sign`` function." +msgid "In this example only ``cost`` and ``reverse_cost`` are updated, where they are based on the length of the geometry and the directionality is kept using the ``sign`` function." msgstr "" msgid "Update the topology" @@ -7532,9 +6498,7 @@ msgstr "" msgid "Maybe there is a small barrier for vehicles but not for pedestrians." msgstr "" -msgid "" -"Once analyzed one by one the touchings, for the ones that need a local fix, " -"the edges need to be `split `__." +msgid "Once analyzed one by one the touchings, for the ones that need a local fix, the edges need to be `split `__." msgstr "" msgid "Fixing a gap" @@ -7549,9 +6513,7 @@ msgstr "" msgid "The analysis tell us that the network has a gap." msgstr "" -msgid "" -"Calling :doc:`pgr_separateTouching` and adding the new segments to the edges " -"table." +msgid "Calling :doc:`pgr_separateTouching` and adding the new segments to the edges table." msgstr "" msgid "Routing from :math:`1` to :math:`2` gives a solution." @@ -7578,25 +6540,19 @@ msgstr "" msgid "This solution requires the edge to be split." msgstr "" -msgid "" -"In this example :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` " -"will be used." +msgid "In this example :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` will be used." msgstr "" msgid "Get the connectivity" msgstr "" -msgid "" -"In this example: the edges table will need an additional column and the " -"vertex table will be rebuilt completely." +msgid "In this example: the edges table will need an additional column and the vertex table will be rebuilt completely." msgstr "" msgid "Insert new edges" msgstr "" -msgid "" -"Using :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` insert the " -"results into the edges table." +msgid "Using :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` insert the results into the edges table." msgstr "" msgid "Create the vertices table" @@ -7611,20 +6567,13 @@ msgstr "" msgid "The graph can be reduced in size using :doc:`contraction-family`" msgstr "" -msgid "" -"When to contract will depend on the size of the graph, processing times, " -"correctness of the data, on the final application, or any other factor not " -"mentioned." +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 "" -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." +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 "" -msgid "" -"A complete method on how to contract and how to use the contracted graph is " -"described on :doc:`contraction-family`" +msgid "A complete method on how to contract and how to use the contracted graph is described on :doc:`contraction-family`" msgstr "" msgid "To get the dead ends:" @@ -7633,8 +6582,7 @@ msgstr "" msgid "A dead end happens when" msgstr "" -msgid "" -"The vertex is the limit of a cul-de-sac, a no-through road or a no-exit road." +msgid "The vertex is the limit of a cul-de-sac, a no-through road or a no-exit road." msgstr "" #, fuzzy @@ -7644,9 +6592,7 @@ msgstr "導かれないグラフ。" msgid "If a larger graph is imported then the vertex might not be a dead end" msgstr "" -msgid "" -"Node :math:`4`, is a dead end on the query, even that it visually looks like " -"an end point of 3 edges." +msgid "Node :math:`4`, is a dead end on the query, even that it visually looks like an end point of 3 edges." msgstr "" msgid "Is node :math:`4` a dead end or not?" @@ -7661,27 +6607,19 @@ msgstr "" msgid "That does not allow a vehicle to use that visual intersection?" msgstr "" -msgid "" -"Is the application for pedestrians and therefore the pedestrian can easily " -"walk on the small curb?" +msgid "Is the application for pedestrians and therefore the pedestrian can easily walk on the small curb?" msgstr "" -msgid "" -"Is the application for the electricity and the electrical lines than can " -"easily be extended on top of the small curb?" +msgid "Is the application for the electricity and the electrical lines than can easily be extended on top of the small curb?" msgstr "" -msgid "" -"Is there a big cliff and from eagles view look like the dead end is close to " -"the segment?" +msgid "Is there a big cliff and from eagles view look like the dead end is close to the segment?" msgstr "" msgid "Depending on the answer, modification of the data might be needed." msgstr "" -msgid "" -"When there are many dead ends, to speed up processing, the :doc:`contraction-" -"family` functions can be used to contract the graph." +msgid "When there are many dead ends, to speed up processing, the :doc:`contraction-family` functions can be used to contract the graph." msgstr "" msgid "Linear edges" @@ -7690,22 +6628,16 @@ msgstr "" msgid "To get the linear edges:" msgstr "" -msgid "" -"These linear vertices are correct, for example, when those the vertices are " -"speed bumps, stop signals and the application is taking them into account." +msgid "These linear vertices are correct, for example, when those the vertices are speed bumps, stop signals and the application is taking them into account." msgstr "" -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." +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 "" msgid "Function's structure" msgstr "" -msgid "" -"Once the graph preparation work has been done above, it is time to use a" +msgid "Once the graph preparation work has been done above, it is time to use a" msgstr "" msgid "The general form of a pgRouting function call is:" @@ -7717,31 +6649,23 @@ msgstr "" msgid "pgr_(`Inner queries`_, **parameters**, [ ``Optional parameters``)" msgstr "" -msgid "" -"`Inner queries`_: Are compulsory parameters that are ``TEXT`` strings " -"containing SQL queries." +msgid "`Inner queries`_: Are compulsory parameters that are ``TEXT`` strings containing SQL queries." msgstr "" -msgid "" -"**parameters**: Additional compulsory parameters needed by the function." +msgid "**parameters**: Additional compulsory parameters needed by the function." msgstr "" -msgid "" -"``Optional parameters``: Are non compulsory **named** parameters that have a " -"default value when omitted." +msgid "``Optional parameters``: Are non compulsory **named** parameters that have a default value when omitted." msgstr "" -msgid "" -"The compulsory parameters are positional parameters, the optional parameters " -"are named parameters." +msgid "The compulsory parameters are positional parameters, the optional parameters are named parameters." msgstr "" msgid "For example, for this :doc:`pgr_dijkstra` signature:" msgstr "" #, fuzzy -msgid "" -"pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "p" msgid "`Edges SQL`_:" @@ -7756,9 +6680,7 @@ msgstr "" msgid "It is an inner query." msgstr "" -msgid "" -"It has no name, so **Edges SQL** gives an idea of what kind of inner query " -"needs to be used" +msgid "It has no name, so **Edges SQL** gives an idea of what kind of inner query needs to be used" msgstr "" msgid "**start vid**:" @@ -7767,17 +6689,13 @@ msgstr "" msgid "Is the second parameter." msgstr "" -msgid "" -"It has no name, so **start vid** gives an idea of what the second " -"parameter's value should contain." +msgid "It has no name, so **start vid** gives an idea of what the second parameter's value should contain." msgstr "" msgid "Is the third parameter." msgstr "" -msgid "" -"It has no name, so **end vid** gives an idea of what the third parameter's " -"value should contain" +msgid "It has no name, so **end vid** gives an idea of what the third parameter's value should contain" msgstr "" msgid "Is the fourth parameter." @@ -7789,9 +6707,7 @@ msgstr "" msgid "It has a name." msgstr "" -msgid "" -"The full description of the parameters are found on the `Parameters`_ " -"section of each function." +msgid "The full description of the parameters are found on the `Parameters`_ section of each function." msgstr "" msgid "Function's overloads" @@ -7824,9 +6740,7 @@ msgstr "" msgid "**Many**: ``ARRAY`` [**ANY-INTEGER**]" msgstr "" -msgid "" -"Depending of the function the overloads may vary. But the concept of " -"parameter type change remains the same." +msgid "Depending of the function the overloads may vary. But the concept of parameter type change remains the same." msgstr "" msgid "When routing from:" @@ -7859,11 +6773,7 @@ msgstr "" msgid "Needs a `Combinations SQL`_" msgstr "" -msgid "" -"There are several kinds of valid inner queries and also the columns returned " -"are depending of the function. Which kind of inner query will depend on the " -"function's requirements. To simplify the variety of types, **ANY-INTEGER** " -"and **ANY-NUMERICAL** is used." +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 "" msgid "Edges SQL for" @@ -7878,9 +6788,7 @@ msgstr "" msgid "General with (X,Y)" msgstr "" -msgid "" -"When negative: edge (``source``, ``target``) does not exist, therefore it's " -"not part of the graph." +msgid "When negative: edge (``source``, ``target``) does not exist, therefore it's not part of the graph." msgstr "" msgid "Weight of the edge (``target``, ``source``)," @@ -7925,20 +6833,13 @@ msgstr "" msgid "Points SQL for" msgstr "" -msgid "" -"The main parameter of the majority of the pgRouting functions is a query " -"that selects the edges of the graph." +msgid "The main parameter of the majority of the pgRouting functions is a query that selects the edges of the graph." msgstr "" -msgid "" -"Depending on the family or category of a function it will have additional " -"parameters, some of them are compulsory and some are optional." +msgid "Depending on the family or category of a function it will have additional parameters, some of them are compulsory and some are optional." msgstr "" -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." +msgid "The compulsory parameters are nameless and must be given in the required order. The optional parameters are named parameters and will have a default value." msgstr "" msgid "Parameters for the Via functions" @@ -7968,16 +6869,10 @@ msgstr "" msgid "``U_turn_on_edge``" msgstr "" -msgid "" -"When ``true`` departing from a visited vertex will not try to avoid using " -"the edge used to reach it. In other words, U turn using the edge with same " -"identifier is allowed." +msgid "When ``true`` departing from a visited vertex will not try to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is allowed." msgstr "" -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." +msgid "When ``false`` when a departing from a visited vertex tries to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is used when no other path is found." msgstr "" msgid "For the TRSP functions" @@ -7986,17 +6881,14 @@ msgstr "" msgid "Array of identifiers of destination vertices." msgstr "" -msgid "" -"There are several kinds of columns returned are depending of the function." +msgid "There are several kinds of columns returned are depending of the function." msgstr "" #, fuzzy msgid "Result columns for single path functions" msgstr "結果として返却されるカラム" -msgid "" -"Used in functions that return one path solution per departure and " -"destination." +msgid "Used in functions that return one path solution per departure and destination." msgstr "" msgid ":doc:`pgr_dijkstraNear`" @@ -8008,8 +6900,7 @@ msgstr "" msgid "``path_seq``" msgstr "" -msgid "" -"Relative position in the path. Has value **1** for the beginning of a path." +msgid "Relative position in the path. Has value **1** for the beginning of a path." msgstr "" msgid "Identifier of the starting vertex of the current path." @@ -8021,28 +6912,20 @@ msgstr "" msgid "Identifier of the node in the path from ``start_vid`` to ``end_vid``." msgstr "" -msgid "" -"Identifier of the edge used to go from ``node`` to the next node in the path " -"sequence. **-1** for the last node of the path." +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 "" -msgid "" -"Cost to traverse from ``node`` using ``edge`` to the next node in the path " -"sequence." +msgid "Cost to traverse from ``node`` using ``edge`` to the next node in the path sequence." msgstr "" -msgid "" -"When ``start_vid`` or ``end_vid`` columns have negative values, the " -"identifier is for a Point." +msgid "When ``start_vid`` or ``end_vid`` columns have negative values, the identifier is for a Point." msgstr "" #, fuzzy msgid "Result columns for multiple paths functions" msgstr "結果として返却されるカラム" -msgid "" -"Used in functions that return many paths solutions per departure and " -"destination." +msgid "Used in functions that return many paths solutions per departure and destination." msgstr "" #, fuzzy @@ -8062,8 +6945,7 @@ msgstr "" msgid "Path identifier." msgstr "" -msgid "" -"Has value **1** for the first of a path from ``start_vid`` to ``end_vid``." +msgid "Has value **1** for the first of a path from ``start_vid`` to ``end_vid``." msgstr "" msgid "Result columns for cost functions" @@ -8072,9 +6954,7 @@ msgstr "" msgid "Used by:" msgstr "" -msgid "" -"When start_vid or end_vid columns have negative values, the identifier is " -"for a Point." +msgid "When start_vid or end_vid columns have negative values, the identifier is for a Point." msgstr "" msgid "Result columns for flow functions" @@ -8103,13 +6983,10 @@ msgstr "" msgid "For the Routing functions" msgstr "" -msgid "" -"To get faster results bound the queries to an area of interest of routing." +msgid "To get faster results bound the queries to an area of interest of routing." msgstr "" -msgid "" -"In this example Use an inner query SQL that does not include some edges in " -"the routing function and is within the area of the results." +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 "" msgid "Given this area:" @@ -8124,33 +7001,25 @@ msgstr "" msgid "Wiki" msgstr "" -msgid "" -"Edit an existing `pgRouting Wiki `__ page." +msgid "Edit an existing `pgRouting Wiki `__ page." msgstr "" msgid "Or create a new Wiki page" msgstr "" -msgid "" -"Create a page on the `pgRouting Wiki `__" +msgid "Create a page on the `pgRouting Wiki `__" msgstr "" msgid "Give the title an appropriate name" msgstr "" -msgid "" -"`Example `__" +msgid "`Example `__" msgstr "" msgid "Adding Functionality to pgRouting" msgstr "" -msgid "" -"Consult the `developer's documentation `__" +msgid "Consult the `developer's documentation `__" msgstr "" #, fuzzy @@ -8160,17 +7029,10 @@ msgstr "参照" msgid "Installation" msgstr "インストール" -msgid "" -"Instructions for downloading and installing binaries for different operating " -"systems, additional notes and corrections not included in this documentation " -"can be found in `Installation wiki `__" +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 "" -"To use pgRouting, PostGIS needs to be installed, please read the information " -"about installation in this `Install Guide `__" +msgid "To use pgRouting, PostGIS needs to be installed, please read the information about installation in this `Install Guide `__" msgstr "" msgid "Short Version" @@ -8182,25 +7044,19 @@ msgstr "" msgid "To compile assuming you have all the dependencies in your search path:" msgstr "" -msgid "" -"Once pgRouting is installed, it needs to be enabled in each individual " -"database you want to use it in." +msgid "Once pgRouting is installed, it needs to be enabled in each individual database you want to use it in." msgstr "" msgid "Get the sources" msgstr "" -msgid "" -"The pgRouting latest release can be found in https://github.com/pgRouting/" -"pgrouting/releases/latest" +msgid "The pgRouting latest release can be found in https://github.com/pgRouting/pgrouting/releases/latest" msgstr "" msgid "To download this release:" msgstr "" -msgid "" -"Go to :ref:`install-short` for more instructions on extracting tar ball and " -"compiling pgRouting." +msgid "Go to :ref:`install-short` for more instructions on extracting tar ball and compiling pgRouting." msgstr "" msgid "git" @@ -8209,10 +7065,7 @@ msgstr "" msgid "To download the repository" msgstr "" -msgid "" -"Go to :ref:`install-short` for more instructions on compiling pgRouting " -"(there is no tar ball involved while downloading pgRouting repository from " -"GitHub)." +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 "" msgid "Enabling and upgrading in the database" @@ -8221,27 +7074,19 @@ msgstr "" msgid "Enabling the database" 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." +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 "" -msgid "" -"Checking PostGIS and pgRouting version after enabling them in the database." +msgid "Checking PostGIS and pgRouting version after enabling them in the database." msgstr "" msgid "Upgrading the database" msgstr "" -msgid "" -"To upgrade pgRouting in the database to version 4.0.0 use the following " -"command:" +msgid "To upgrade pgRouting in the database to version 4.1.0 use the following command:" msgstr "" -msgid "" -"More information can be found in https://www.postgresql.org/docs/current/sql-" -"createextension.html" +msgid "More information can be found in https://www.postgresql.org/docs/current/sql-createextension.html" msgstr "" msgid "Dependencies" @@ -8250,21 +7095,16 @@ msgstr "" msgid "Compilation Dependencies" msgstr "" -msgid "" -"To be able to compile pgRouting, make sure that the following dependencies " -"are met:" +msgid "To be able to compile pgRouting, make sure that the following dependencies are met:" msgstr "" msgid "C and C++0x compilers" msgstr "" -msgid "" -"Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with C++03 " -"or C++11 standard support" +msgid "Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with C++03 or C++11 standard support" msgstr "" -msgid "" -"Compiling with Boost 1.75 requires C++ Compiler with C++14 standard support" +msgid "Compiling with Boost 1.75 requires C++ Compiler with C++14 standard support" msgstr "" msgid "Postgresql version >= 13" @@ -8338,14 +7178,10 @@ msgstr "" msgid "Configuring The Documentation" msgstr "" -msgid "" -"User and developers documentation are not build if prerequisites are not " -"found." +msgid "User and developers documentation are not build if prerequisites are not found." msgstr "" -msgid "" -"Most of the effort of the documentation has been on the HTML files. Some " -"variables for building documentation:" +msgid "Most of the effort of the documentation has been on the HTML files. Some variables for building documentation:" msgstr "" msgid "Variable" @@ -8423,9 +7259,7 @@ msgstr "" msgid "The following instructions start from ``path/to/pgrouting/build``" msgstr "" -msgid "" -"We have tested on several platforms, For installing or reinstalling all the " -"steps are needed." +msgid "We have tested on several platforms, For installing or reinstalling all the steps are needed." msgstr "" msgid "Linux" @@ -8440,21 +7274,10 @@ msgstr "" msgid "Currently there is no :code:`make test` and testing is done as follows" msgstr "" -msgid "" -"pgRouting is an extension of `PostGIS `__ and " -"`PostgreSQL `__ geospatial database and adds " -"routing and other network analysis functionality. A predecessor of pgRouting " -"– pgDijkstra, written by Sylvain Pasche from `Camptocamp `__, was later extended by Orkney and renamed to pgRouting. The project " -"is now supported and maintained by `Georepublic `__, `Paragon Corporation `__ and " -"a broad user community." +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 "" -msgid "" -"pgRouting is part of `OSGeo Community Projects `__ from the `OSGeo Foundation `__ and included on `OSGeoLive `__." +msgid "pgRouting is part of `OSGeo Community Projects `__ from the `OSGeo Foundation `__ and included on `OSGeoLive `__." msgstr "" msgid "Licensing" @@ -8469,36 +7292,26 @@ msgstr "" msgid "GNU General Public License v2.0 or later" msgstr "" -msgid "" -"Most features of pgRouting are available under `GNU General Public License " -"v2.0 or later `_." +msgid "Most features of pgRouting are available under `GNU General Public License v2.0 or later `_." msgstr "" msgid "Boost Software License - Version 1.0" msgstr "" -msgid "" -"Some Boost extensions are available under `Boost Software License - Version " -"1.0 `_." +msgid "Some Boost extensions are available under `Boost Software License - Version 1.0 `_." msgstr "" msgid "MIT-X License" msgstr "" -msgid "" -"Some code contributed by iMaptools.com is available under MIT-X license." +msgid "Some code contributed by iMaptools.com is available under MIT-X license." msgstr "" -msgid "" -"The pgRouting Manual is licensed under a `Creative Commons Attribution-Share " -"Alike 3.0 License `_." +msgid "The pgRouting Manual is licensed under a `Creative Commons Attribution-Share Alike 3.0 License `_." msgstr "" -msgid "" -"In general license information should be included in the header of each " -"source file." -msgstr "" -"一般に、ライセンス情報は、各ソースファイルのヘッダーに含める必要があります。" +msgid "In general license information should be included in the header of each source file." +msgstr "一般に、ライセンス情報は、各ソースファイルのヘッダーに含める必要があります。" msgid "Contributors" msgstr "貢献者" @@ -8513,10 +7326,7 @@ msgstr "個人(アルファベット順)" msgid "Bipasha Gayary, Fan Wu, Regina Obe, Saloni kumari, Vicky Vergara" msgstr "" -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." +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 "" #, fuzzy @@ -8544,12 +7354,8 @@ msgstr "" msgid "Corporate Sponsors in this release (in alphabetical order)" msgstr "" -msgid "" -"These are corporate entities that have contributed developer time, hosting, " -"or direct monetary funding to the pgRouting project:" -msgstr "" -"これらは、デベロッパーが開発に要する時間、ホスティング、また pgRoutingプロ" -"ジェクトへ直接資金を支援してくださっているスポンサー企業です。" +msgid "These are corporate entities that have contributed developer time, hosting, or direct monetary funding to the pgRouting project:" +msgstr "これらは、デベロッパーが開発に要する時間、ホスティング、また pgRoutingプロジェクトへ直接資金を支援してくださっているスポンサー企業です。" msgid "`OSGeo `__" msgstr "" @@ -8572,20 +7378,7 @@ msgstr "これまでの貢献者と現在の貢献者:" msgid "Individuals (in alphabetical order)" msgstr "個人(アルファベット順)" -msgid "" -"Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio " -"Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf " -"Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, " -"Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, " -"Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, " -"Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu " -"Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko " -"Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim " -"Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish " -"Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni " -"Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen " -"Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, " -"Vidhan Jain, Virginia Vergara, Yige Huang" +msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" msgstr "" msgid "Corporate Sponsors (in alphabetical order)" @@ -8630,16 +7423,10 @@ msgstr "" msgid "More Information" 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 "The latest software, documentation and news items are available at the pgRouting web site https://pgrouting.org." +msgstr "最新のソフトウェア、ドキュメント、ニュースは、pgRoutingのウェブサイト https://pgrouting.orgで入手できます。" -msgid "" -"PostgreSQL database server at the PostgreSQL main site https://www." -"postgresql.org." +msgid "PostgreSQL database server at the PostgreSQL main site https://www.postgresql.org." msgstr "" msgid "PostGIS extension at the PostGIS project web site https://postgis.net." @@ -8705,9 +7492,7 @@ msgstr "バージョン 2.0.0" msgid "Official function." msgstr "**公式** 機能" -msgid "" -"The K shortest path routing algorithm based on Yen's algorithm. \"K\" is the " -"number of shortest paths desired." +msgid "The K shortest path routing algorithm based on Yen's algorithm. \"K\" is the number of shortest paths desired." msgstr "" msgid "|Boost| Boost Graph Inside" @@ -8726,18 +7511,15 @@ msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vid**, **K**, [**options**])" msgstr "" #, fuzzy -msgid "" -"pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" +msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" msgstr "p" #, fuzzy -msgid "" -"pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" +msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" msgstr "p" #, fuzzy -msgid "" -"pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" +msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" msgstr "p" #, fuzzy @@ -8759,19 +7541,13 @@ msgstr "例" msgid "Get 2 paths from :math:`6` to :math:`17` on a directed graph." msgstr "" -msgid "" -"Get 2 paths from vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a " -"directed graph." +msgid "Get 2 paths from vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph." msgstr "" -msgid "" -"Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a " -"directed graph." +msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph." msgstr "" -msgid "" -"Get 2 paths vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on " -"a directed graph." +msgid "Get 2 paths vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on a directed graph." msgstr "" #, fuzzy @@ -8805,9 +7581,7 @@ msgstr "" msgid "When ``true`` all the calculated paths while processing are returned." msgstr "" -msgid "" -"Roughly, when the shortest path has ``N`` edges, the heap will contain about " -"than ``N * K`` paths for small value of ``K`` and ``K > 5``." +msgid "Roughly, when the shortest path has ``N`` edges, the heap will contain about than ``N * K`` paths for small value of ``K`` and ``K > 5``." msgstr "" msgid "Additional Examples" @@ -8823,9 +7597,7 @@ msgstr "" msgid "Get 2 paths using combinations table on an undirected graph" msgstr "導かれないグラフ。" -msgid "" -"Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a " -"undirected graph." +msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a undirected graph." msgstr "" msgid "https://en.wikipedia.org/wiki/K_shortest_path_routing" @@ -8843,19 +7615,13 @@ msgstr "" msgid "Version 3.2.1" msgstr "" -msgid "" -"Metric Algorithm from `Boost library `__" +msgid "Metric Algorithm from `Boost library `__" msgstr "" msgid "Simulated Annealing Algorithm no longer supported" msgstr "" -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`" +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 "" msgid "Version 2.3.0" @@ -8867,9 +7633,7 @@ msgstr "" msgid "Negative costs are ignored." msgstr "" -msgid "" -"Can be Used with :doc:`costMatrix-category` functions preferably with " -"`directed => false`." +msgid "Can be Used with :doc:`costMatrix-category` functions preferably with `directed => false`." msgstr "" msgid "With ``directed => false``" @@ -8890,62 +7654,43 @@ msgstr "" msgid "When ``start_vid = 0 OR end_vid = 0``" msgstr "" -msgid "" -"The solutions generated are guaranteed to be *twice as long as the optimal " -"tour in the worst case*" +msgid "The solutions generated are guaranteed to be *twice as long as the optimal tour in the worst case*" msgstr "" msgid "When ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``" msgstr "" -msgid "" -"It is **not guaranteed** that the solution will be, in the worst case, twice " -"as long as the optimal tour, due to the fact that `end_vid` is forced to be " -"in a fixed position." +msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour, due to the fact that `end_vid` is forced to be in a fixed position." msgstr "" msgid "With ``directed => true``" msgstr "" -msgid "" -"It is **not guaranteed** that the solution will be, in the worst case, twice " -"as long as the optimal tour" +msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour" msgstr "" msgid "is directed" msgstr "" -msgid "" -"some (or all) traveling costs on edges might not obey the triangle " -"inequality." +msgid "some (or all) traveling costs on edges might not obey the triangle inequality." msgstr "" -msgid "" -"As an undirected graph is required, the directed graph is transformed as " -"follows:" +msgid "As an undirected graph is required, the directed graph is transformed as follows:" msgstr "" -msgid "" -"edges `(u, v)` and `(v, u)` is considered to be the same edge (denoted `(u, " -"v)`" +msgid "edges `(u, v)` and `(v, u)` is considered to be the same edge (denoted `(u, v)`" msgstr "" msgid "if ``agg_cost`` differs between one or more instances of edge `(u, v)`" 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)`" +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 "" -msgid "" -"Some (or all) traveling costs on edges will still might not obey the " -"triangle inequality." +msgid "Some (or all) traveling costs on edges will still might not obey the triangle inequality." msgstr "" -msgid "" -"When the data does not come from an undirected graph or its not fully " -"connected:" +msgid "When the data does not come from an undirected graph or its not fully connected:" msgstr "" msgid "Missing values will be calculated with dijkstra algorithm." @@ -8954,20 +7699,13 @@ msgstr "" msgid "When the graph has more than one component:" msgstr "" -msgid "" -"``start_vid`` or ``end_vid`` are defined and are on the same component: the " -"TSP tour will happen on that component." +msgid "``start_vid`` or ``end_vid`` are defined and are on the same component: the TSP tour will happen on that component." msgstr "" -msgid "" -"``start_vid`` or ``end_vid`` are defined and are not on the same component: " -"the TSP tour will propose a tour that has both components where connecting " -"costs are estimated." +msgid "``start_vid`` or ``end_vid`` are defined and are not on the same component: the TSP tour will propose a tour that has both components where connecting costs are estimated." msgstr "" -msgid "" -"``start_vid`` or ``end_vid`` are not defined: the starting point could be on " -"any component and will include data only from that component." +msgid "``start_vid`` or ``end_vid`` are not defined: the starting point could be on any component and will include data only from that component." msgstr "" msgid "One cycle attempt to remove crossing edges is done to the TSP results." @@ -8982,9 +7720,7 @@ msgstr "" msgid "Using :doc:`pgr_dijkstraCostMatrix` to generate the matrix information" msgstr "" -msgid "" -"**Line 4** Vertices :math:`\\{2, 4, 13, 14\\}` are not included because they " -"are not connected." +msgid "**Line 4** Vertices :math:`\\{2, 4, 13, 14\\}` are not included because they are not connected." msgstr "" msgid "`Matrix SQL`_ as described below" @@ -9011,11 +7747,8 @@ msgstr "**node**" msgid "Identifier of the node/coordinate/point." msgstr "ノード/座標/ポイントの識別子。" -msgid "" -"Cost to traverse from the current ``node`` to the next ``node`` in the path " -"sequence." -msgstr "" -"現在の ``ノード`` から次の ``ノード`` まで移動する際の経路にかかるコスト。" +msgid "Cost to traverse from the current ``node`` to the next ``node`` in the path sequence." +msgstr "現在の ``ノード`` から次の ``ノード`` まで移動する際の経路にかかるコスト。" msgid "``0`` for the last row in the tour sequence." msgstr "" @@ -9038,22 +7771,16 @@ msgstr "" msgid "To generate an asymmetric matrix:" msgstr "" -msgid "" -"**Line 4** The ``side`` information of ``pointsOfInterset`` is ignored by " -"not including it in the query" +msgid "**Line 4** The ``side`` information of ``pointsOfInterset`` is ignored by not including it in the query" msgstr "" msgid "**Line 6** Generating an asymmetric matrix with ``directed => true``" msgstr "" -msgid "" -":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered as " -"the ``agg_cost``" +msgid ":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered as the ``agg_cost``" msgstr "" -msgid "" -"The solution that can be larger than *twice as long as the optimal tour* " -"because:" +msgid "The solution that can be larger than *twice as long as the optimal tour* because:" msgstr "" msgid "Triangle inequality might not be satisfied." @@ -9065,14 +7792,10 @@ msgstr "" msgid "Connected incomplete data" msgstr "" -msgid "" -"Using selected edges :math:`\\{2, 4, 5, 8, 9, 15\\}` the matrix is not " -"complete." +msgid "Using selected edges :math:`\\{2, 4, 5, 8, 9, 15\\}` the matrix is not complete." msgstr "" -msgid "" -"Cost value for :math:`17 \\rightarrow 10` do not exist on the matrix, but " -"the value used is taken from :math:`10 \\rightarrow 17`." +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 "" msgid "``pgr_TSPeuclidean``" @@ -9081,9 +7804,7 @@ msgstr "" msgid "``pgr_TSPeuclidean`` - Approximation using *metric* algorithm." msgstr "" -msgid "" -"Using `Boost: metric TSP approx `__" +msgid "Using `Boost: metric TSP approx `__" msgstr "" msgid "Name change from pgr_eucledianTSP" @@ -9096,17 +7817,13 @@ msgstr "新しい **公式** 機能" msgid "Results change depending on input order of the `Coordinates SQL`_" msgstr "" -msgid "" -"Any duplicated identifier will be ignored. The coordinates that will be kept " -"is arbitrarily." +msgid "Any duplicated identifier will be ignored. The coordinates that will be kept is arbitrarily." msgstr "" -msgid "" -"The coordinates are quite similar for the same identifier, for example ::" +msgid "The coordinates are quite similar for the same identifier, for example ::" msgstr "" -msgid "" -"The coordinates are quite different for the same identifier, for example ::" +msgid "The coordinates are quite different for the same identifier, for example ::" msgstr "" msgid "pgr_TSPeuclidean(`Coordinates SQL`_, ``[start_id, end_id]``)" @@ -9139,11 +7856,7 @@ msgstr "座標のY値。" msgid "Test 29 cities of Western Sahara" msgstr "" -msgid "" -"This example shows how to make performance tests using University of " -"Waterloo's `example data `__ using the 29 cities of `Western Sahara dataset `__" +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 "" msgid "Creating a table for the data and storing the data" @@ -9155,9 +7868,7 @@ msgstr "" msgid "Total tour cost" msgstr "" -msgid "" -"Getting a total cost of the tour, compare the value with the length of an " -"optimal tour is 27603, given on the dataset" +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 "" msgid "Getting a geometry of the tour" @@ -9166,10 +7877,7 @@ msgstr "" msgid "Visual results" msgstr "" -msgid "" -"Visually, The first image is the `optimal solution `__ and the second image is the solution " -"obtained with ``pgr_TSPeuclidean``." +msgid "Visually, The first image is the `optimal solution `__ and the second image is the solution obtained with ``pgr_TSPeuclidean``." msgstr "" msgid "``pgr_aStar`` — Shortest path using the A* algorithm." @@ -9208,9 +7916,7 @@ msgstr "" msgid "Signature change on pgr_aStar(One to One)" msgstr "" -msgid "" -"The results are equivalent to the union of the results of the `pgr_aStar(` " -"`One to One`_ `)` on the:" +msgid "The results are equivalent to the union of the results of the `pgr_aStar(` `One to One`_ `)` on the:" msgstr "" msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" @@ -9237,28 +7943,19 @@ msgstr "" msgid "Optional parameters are `named parameters` and have a default value." msgstr "" -msgid "" -"From vertex :math:`6` to vertex :math:`12` on a **directed** graph with " -"heuristic :math:`2`" +msgid "From vertex :math:`6` to vertex :math:`12` on a **directed** graph with heuristic :math:`2`" msgstr "" -msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 12\\}` on a **directed** " -"graph with heuristic :math:`3` and factor :math:`3.5`" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 12\\}` on a **directed** graph with heuristic :math:`3` and factor :math:`3.5`" msgstr "" -msgid "" -"From vertices :math:`\\{6, 8\\}` to vertex :math:`10` on an **undirected** " -"graph with heuristic :math:`4`" +msgid "From vertices :math:`\\{6, 8\\}` to vertex :math:`10` on an **undirected** graph with heuristic :math:`4`" msgstr "" -msgid "" -"From vertices :math:`\\{6, 8\\}` to vertices :math:`\\{10, 12\\}` on a " -"**directed** graph with factor :math:`0.5`" +msgid "From vertices :math:`\\{6, 8\\}` to vertices :math:`\\{10, 12\\}` on a **directed** graph with factor :math:`0.5`" msgstr "" -msgid "" -"Using a combinations table on a **directed** graph with factor :math:`0.5`." +msgid "Using a combinations table on a **directed** graph with factor :math:`0.5`." msgstr "" msgid "Example 1" @@ -9283,8 +7980,7 @@ msgid "``pgr_aStarCost``" msgstr "" #, fuzzy -msgid "" -"``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." +msgid "``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." msgstr ":doc:`pgr_dijkstraCost` - 最短経路の総コストを集計します。" msgid "pgr_aStarCost(Combinations)" @@ -9295,14 +7991,10 @@ msgid "New proposed function." msgstr "新しい **公式** 機能" #, fuzzy -msgid "" -"The ``pgr_aStarCost`` function summarizes the cost of the shortest path " -"using the A* algorithm." +msgid "The ``pgr_aStarCost`` function summarizes the cost of the shortest path using the A* algorithm." msgstr ":doc:`pgr_dijkstraCost` - 最短経路の総コストを集計します。" -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)`" +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 "" msgid "For undirected graphs, the results are symmetric." @@ -9326,8 +8018,7 @@ msgstr "" msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -msgid "" -"pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "" msgid "pgr_aStarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" @@ -9342,9 +8033,7 @@ msgstr "" msgid "``pgr_aStarCostMatrix``" msgstr "" -msgid "" -"``pgr_aStarCostMatrix`` - Calculates the a cost matrix using :doc:" -"`pgr_aStar`." +msgid "``pgr_aStarCostMatrix`` - Calculates the a cost matrix using :doc:`pgr_aStar`." msgstr "" msgid "Using internally the :doc:`pgr_aStar` algorithm" @@ -9377,9 +8066,7 @@ msgstr "" msgid "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" msgstr "" -msgid "" -"Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an " -"**undirected** graph using heuristic :math:`2`" +msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph using heuristic :math:`2`" msgstr "" msgid "Use with :doc:`pgr_TSP`" @@ -9388,9 +8075,7 @@ msgstr "" msgid "``pgr_articulationPoints``" msgstr "" -msgid "" -"``pgr_articulationPoints`` - Return the articulation points of an undirected " -"graph." +msgid "``pgr_articulationPoints`` - Return the articulation points of an undirected graph." msgstr "" msgid "Result columns change: ``seq`` is removed" @@ -9399,11 +8084,7 @@ msgstr "" msgid "Version 2.5.0" 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." +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 "Works for **undirected** graphs." @@ -9430,14 +8111,10 @@ msgstr "" msgid "Identifier of the vertex." msgstr "" -msgid "" -"`Boost: Biconnected components & articulation points `__" +msgid "`Boost: Biconnected components & articulation points `__" msgstr "" -msgid "" -"wikipedia: `Biconnected component `__" +msgid "wikipedia: `Biconnected component `__" msgstr "" #, fuzzy @@ -9447,14 +8124,10 @@ msgstr "p" msgid "``pgr_bandwidth`` - Calculates the bandwidth of the graph" msgstr "" -msgid "" -"Bandwidth measures how \"spread out\" the connections are in a graph when " -"vertices are arranged in a linear order (like numbering them 1, 2, 3, etc.)." +msgid "Bandwidth measures how \"spread out\" the connections are in a graph when vertices are arranged in a linear order (like numbering them 1, 2, 3, etc.)." msgstr "" -msgid "" -"For each edge in the graph, calculate the distance between the vertex " -"numbers it connects" +msgid "For each edge in the graph, calculate the distance between the vertex numbers it connects" msgstr "" msgid "The bandwidth is the maximum of all these distances" @@ -9494,8 +8167,7 @@ msgstr "" msgid "Undirected graph with edges after optimization." msgstr "" -msgid "" -"`Boost: bandwidth `_" +msgid "`Boost: bandwidth `_" msgstr "" msgid "``pgr_bdAstar``" @@ -9528,9 +8200,7 @@ msgstr "" msgid "Signature change on pgr_bdAstar(One to One)" msgstr "" -msgid "" -"The results are equivalent to the union of the results of pgr_bdAStar(One to " -"One) on the:" +msgid "The results are equivalent to the union of the results of pgr_bdAStar(One to One) on the:" msgstr "" msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" @@ -9551,34 +8221,26 @@ msgstr "" msgid "``pgr_bdAstarCost``" msgstr "" -msgid "" -"``pgr_bdAstarCost`` - Total cost of the shortest path using the " -"bidirectional A* algorithm." +msgid "``pgr_bdAstarCost`` - Total cost of the shortest path using the bidirectional A* algorithm." msgstr "" msgid "pgr_bdAstarCost(Combinations)" msgstr "" #, fuzzy -msgid "" -"The ``pgr_bdAstarCost`` function summarizes the cost of the shortest path " -"using the bidirectional A* algorithm." +msgid "The ``pgr_bdAstarCost`` function summarizes the cost of the shortest path using the bidirectional A* algorithm." msgstr ":doc:`pgr_dijkstraCost` - 最短経路の総コストを集計します。" -msgid "" -"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" msgstr "" -msgid "" -"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgstr "" -msgid "" -"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -msgid "" -"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "" msgid "pgr_bdAstarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" @@ -9587,9 +8249,7 @@ msgstr "" msgid "``pgr_bdAstarCostMatrix``" msgstr "" -msgid "" -"``pgr_bdAstarCostMatrix`` - Calculates the cost matrix using :doc:" -"`pgr_bdAstar`." +msgid "``pgr_bdAstarCostMatrix`` - Calculates the cost matrix using :doc:`pgr_bdAstar`." msgstr "" msgid "Internally uses the :doc:`pgr_bdAstar` algorithm." @@ -9598,9 +8258,7 @@ msgstr "" msgid "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" msgstr "" -msgid "" -"``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra " -"algorithm." +msgid "``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra algorithm." msgstr "" msgid "pgr_bdDijkstra(Combinations)" @@ -9618,20 +8276,16 @@ msgstr "" msgid "Signature change on pgr_bdDijkstra(One to One)" msgstr "" -msgid "" -"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "" -"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" @@ -9640,18 +8294,13 @@ msgstr "" msgid "From vertex :math:`6` to vertex :math:`10` on a **directed** graph" msgstr "" -msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed** " -"graph" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed** graph" msgstr "" -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** graph" +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** graph" msgstr "" -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an " -"**undirected** graph" +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an **undirected** graph" msgstr "" msgid "Using a combinations table on an **undirected** graph" @@ -9663,36 +8312,26 @@ msgstr "" msgid "``pgr_bdDijkstraCost``" msgstr "" -msgid "" -"``pgr_bdDijkstraCost`` — Returns the shortest path's cost using " -"Bidirectional Dijkstra algorithm." +msgid "``pgr_bdDijkstraCost`` — Returns the shortest path's cost using Bidirectional Dijkstra algorithm." msgstr "" msgid "pgr_bdDijkstraCost(Combinations)" msgstr "" #, fuzzy -msgid "" -"The ``pgr_bdDijkstraCost`` function summarizes the cost of the shortest path " -"using the bidirectional Dijkstra Algorithm." +msgid "The ``pgr_bdDijkstraCost`` function summarizes the cost of the shortest path using the bidirectional Dijkstra Algorithm." msgstr ":doc:`pgr_dijkstraCost` - 最短経路の総コストを集計します。" -msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" msgstr "" -msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , " -"[``directed``])" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , [``directed``])" msgstr "" -msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [ ``directed``])" @@ -9704,28 +8343,24 @@ msgstr "" msgid "``pgr_bdDijkstraCostMatrix``" msgstr "" -msgid "" -"``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using :doc:" -"`pgr_bdDijkstra`." +msgid "``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_bdDijkstra`." msgstr "" -msgid "" -"Using bidirectional Dijkstra algorithm, calculate and return a cost matrix." +msgid "Using bidirectional Dijkstra algorithm, calculate and return a cost matrix." msgstr "" msgid "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" msgstr "" -msgid "" -"Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an " -"**undirected** graph" +msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph" msgstr "" msgid "Use with :doc:`pgr_TSP`." msgstr "" -msgid "``pgr_bellmanFord - Experimental``" -msgstr "" +#, fuzzy +msgid "``pgr_bellmanFord`` - Experimental" +msgstr "p" msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm." msgstr "" @@ -9733,90 +8368,59 @@ msgstr "" msgid "pgr_bellmanFord(Combinations)" msgstr "" -msgid "" -"Bellman-Ford's algorithm, is named after Richard Bellman and Lester Ford, " -"who first published it in 1958 and 1956, respectively.It is a graph search " -"algorithm that computes shortest paths from a starting vertex " -"(``start_vid``) to an ending vertex (``end_vid``) in a graph where some of " -"the edge weights may be negative. Though it is more versatile, it is slower " -"than Dijkstra's algorithm.This implementation can be used with a directed " -"graph and an undirected graph." +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 "" -msgid "" -"Process is valid for edges with both positive and negative edge weights." +msgid "Process is valid for edges with both positive and negative edge weights." msgstr "" -msgid "" -"When the start vertex and the end vertex are the same, there is no path. The " -"agg_cost would be :math:`0`." +msgid "When the start vertex and the end vertex are the same, there is no path. The agg_cost would be :math:`0`." msgstr "" -msgid "" -"When the start vertex and the end vertex are different, and there exists a " -"path between them without having a *negative cycle*. The agg_cost would be " -"some finite value denoting the shortest distance between them." +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 "" -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." +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 "" -msgid "" -"When the start vertex and the end vertex are different, and there is no " -"path. The agg_cost is :math:`\\infty`." +msgid "When the start vertex and the end vertex are different, and there is no path. The agg_cost is :math:`\\infty`." msgstr "" -msgid "" -"For optimization purposes, any duplicated value in the `start_vids` or " -"`end_vids` are ignored." +msgid "For optimization purposes, any duplicated value in the `start_vids` or `end_vids` are ignored." msgstr "" msgid "Running time: :math:`O(| start\\_vids | * ( V * E))`" msgstr "" -msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" msgid "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph" msgstr "" -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph" +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph" msgstr "" -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an " -"undirected graph" +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an undirected graph" msgstr "" #, fuzzy msgid "Using a combinations table on an undirected graph" msgstr "導かれないグラフ。" -msgid "" -"`Boost: Bellman Ford `__" +msgid "`Boost: Bellman Ford `__" msgstr "" msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" @@ -9826,30 +8430,20 @@ msgstr "" msgid "``pgr_betweennessCentrality`` - Experimental" msgstr "p" -msgid "" -"``pgr_betweennessCentrality`` - Calculates the relative betweenness " -"centrality using Brandes Algorithm" +msgid "``pgr_betweennessCentrality`` - Calculates the relative betweenness centrality using Brandes Algorithm" msgstr "" #, fuzzy msgid "Version 3.7.0" msgstr "バージョン 3.0.0" -msgid "" -"The Brandes Algorithm takes advantage of the sparse graphs for evaluating " -"the betweenness centrality score of all vertices." +msgid "The Brandes Algorithm takes advantage of the sparse graphs for evaluating the betweenness centrality score of all vertices." msgstr "" -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." +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 "" -"The removal of these vertices will affect the network by disrupting the it, " -"as most of the shortest paths between vertices pass through them." +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 "" #, fuzzy @@ -9885,9 +8479,7 @@ msgstr "" msgid "The leaf vertices have betweenness centrality :math:`0`." msgstr "" -msgid "" -"Betweenness centrality of vertex :math:`6` is higher than of vertex :math:" -"`10`." +msgid "Betweenness centrality of vertex :math:`6` is higher than of vertex :math:`10`." msgstr "" msgid "Removing vertex :math:`6` will create three graph components." @@ -9902,21 +8494,16 @@ msgstr "" msgid "``centrality``" msgstr "" -msgid "" -"Relative betweenness centrality score of the vertex (will be in range [0,1])" +msgid "Relative betweenness centrality score of the vertex (will be in range [0,1])" msgstr "" -msgid "" -"`Boost: betweenness centrality `_" +msgid "`Boost: betweenness centrality `_" msgstr "" msgid "``pgr_biconnectedComponents``" msgstr "" -msgid "" -"``pgr_biconnectedComponents`` — Biconnected components of an undirected " -"graph." +msgid "``pgr_biconnectedComponents`` — Biconnected components of an undirected graph." msgstr "" #, fuzzy @@ -9929,13 +8516,7 @@ msgstr "" msgid "``seq`` changed type to ``BIGINT``" msgstr "" -msgid "" -"The biconnected components of an undirected graph are the maximal subsets of " -"vertices such that the removal of a vertex from particular component will " -"not disconnect the component. Unlike connected components, vertices may " -"belong to multiple biconnected components. Vertices can be present in " -"multiple biconnected components, but each edge can only be contained in a " -"single biconnected component." +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 "" msgid "Components are described by edges." @@ -9971,103 +8552,61 @@ msgstr "" msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" msgstr "" -msgid "" -"``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary " -"graph." +msgid "``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary graph." msgstr "" -msgid "" -"Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-" -"negative integer, is termed as a 'binary graph'." +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 "" msgid "pgr_binaryBreadthFirstSearch(Combinations)" msgstr "" -msgid "" -"It is well-known that the shortest paths between a single source and all " -"other vertices can be found using Breadth First Search in :math:`O(|E|)` in " -"an unweighted graph, i.e. the distance is the minimal number of edges that " -"you need to traverse from the source to another vertex. We can interpret " -"such a graph also as a weighted graph, where every edge has the weight :math:" -"`1`. If not all edges in graph have the same weight, then we a more general " -"algorithm is needed, like Dijkstra's Algorithm which runs in :math:`O(|E|log|" -"V|)` time." +msgid "It is well-known that the shortest paths between a single source and all other vertices can be found using Breadth First Search in :math:`O(|E|)` in an unweighted graph, i.e. the distance is the minimal number of edges that you need to traverse from the source to another vertex. We can interpret such a graph also as a weighted graph, where every edge has the weight :math:`1`. If not all edges in graph have the same weight, then we a more general algorithm is needed, like Dijkstra's Algorithm which runs in :math:`O(|E|log|V|)` time." msgstr "" -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." +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 "" -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.)" +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 "" msgid "Running time: :math:`O(| start\\_vids | * |E|)`" msgstr "" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, " -"[``directed``])" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, " -"[``directed``])" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, " -"[``directed``])" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, " -"[``directed``])" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid "" -"**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :" -"math:`1``)" +msgid "**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :math:`1``)" msgstr "" -msgid "" -"`Boost: Breadth First Search `__" +msgid "`Boost: Breadth First Search `__" msgstr "" msgid "https://cp-algorithms.com/graph/01_bfs.html" msgstr "" -msgid "" -"https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" +msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" msgstr "" msgid "``pgr_bipartite`` - Experimental" msgstr "" -msgid "" -"``pgr_bipartite`` — Disjoint sets of vertices such that no two vertices " -"within the same set are adjacent." +msgid "``pgr_bipartite`` — Disjoint sets of vertices such that no two vertices within the same set are adjacent." msgstr "" -msgid "" -"A bipartite graph is a graph with two sets of vertices which are connected " -"to each other, but not within themselves. A bipartite graph is possible if " -"the graph coloring is possible using two colors such that vertices in a set " -"are colored with the same color." +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 "The algorithm works in undirected graph only." @@ -10076,10 +8615,7 @@ msgstr "" msgid "The returned values are not ordered." msgstr "" -msgid "" -"The algorithm checks graph is bipartite or not. If it is bipartite then it " -"returns the node along with two colors `0` and `1` which represents two " -"different sets." +msgid "The algorithm checks graph is bipartite or not. If it is bipartite then it returns the node along with two colors `0` and `1` which represents two different sets." msgstr "" msgid "If graph is not bipartite then algorithm returns empty set." @@ -10097,32 +8633,22 @@ msgstr "" msgid "The odd length cyclic graph can not be bipartite." msgstr "" -msgid "" -"The edge :math:`5 \\rightarrow 1` will make subgraph with vertices :math:" -"`\\{1, 3, 7, 6, 5\\}` an odd length cyclic graph, as the cycle has 5 " -"vertices." +msgid "The edge :math:`5 \\rightarrow 1` will make subgraph with vertices :math:`\\{1, 3, 7, 6, 5\\}` an odd length cyclic graph, as the cycle has 5 vertices." msgstr "" msgid "Edges in blue represent odd length cycle subgraph." msgstr "" -msgid "" -"`Boost: is_bipartite `__" +msgid "`Boost: is_bipartite `__" msgstr "" -msgid "" -"`Wikipedia: bipartite graph `__" +msgid "`Wikipedia: bipartite graph `__" msgstr "" msgid "``pgr_boykovKolmogorov``" 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." +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 "" msgid "pgr_boykovKolmogorov(Combinations)" @@ -10164,43 +8690,32 @@ msgstr "" msgid "From vertices :math:`\\{11, 3, 17\\}` to vertex :math:`12`" msgstr "" -msgid "" -"From vertices :math:`\\{11, 3, 17\\}` to vertices :math:`\\{5, 10, 12\\}`" +msgid "From vertices :math:`\\{11, 3, 17\\}` to vertices :math:`\\{5, 10, 12\\}`" msgstr "" -msgid "" -"Using a combinations table, equivalent to calculating result from vertices :" -"math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`." +msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`." msgstr "" -msgid "" -"`Boost: Boykov Kolmogorov max flow `__" +msgid "`Boost: Boykov Kolmogorov max flow `__" msgstr "" msgid "``pgr_breadthFirstSearch`` - Experimental" msgstr "" -msgid "" -"``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth " -"First Search algorithm." +msgid "``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth First Search algorithm." msgstr "" #, fuzzy msgid "Version 4.0.0:" msgstr "バージョン 2.0.0" -msgid "" -"Provides the Breadth First Search traversal order from a root vertex to a " -"particular depth." +msgid "Provides the Breadth First Search traversal order from a root vertex to a particular depth." msgstr "" msgid "The implementation will work on any type of graph." msgstr "" -msgid "" -"Provides the Breadth First Search traversal order from a source node to a " -"target depth level." +msgid "Provides the Breadth First Search traversal order from a source node to a target depth level." msgstr "" msgid "Running time: :math:`O(E + V)`" @@ -10215,14 +8730,10 @@ msgstr "" msgid "**options:** ``[max_depth, directed]``" msgstr "" -msgid "" -"From root vertex :math:`6` on a **directed** graph with edges in ascending " -"order of ``id``" +msgid "From root vertex :math:`6` on a **directed** graph with edges in ascending order of ``id``" msgstr "" -msgid "" -"From root vertices :math:`\\{12, 6\\}` on an **undirected** graph with " -"**depth** :math:`<= 2` and edges in ascending order of ``id``" +msgid "From root vertices :math:`\\{12, 6\\}` on an **undirected** graph with **depth** :math:`<= 2` and edges in ascending order of ``id``" msgstr "" msgid "DFS optional parameters" @@ -10237,9 +8748,7 @@ msgstr "" msgid "The resulting traversal is different." msgstr "" -msgid "" -"The left image shows the result with ascending order of ids and the right " -"image shows with descending order of the edge identifiers." +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 "" msgid "|ascending| |descending|" @@ -10251,9 +8760,7 @@ msgstr "" msgid "descending" msgstr "" -msgid "" -"`Wikipedia: Breadth First Search algorithm `__" +msgid "`Wikipedia: Breadth First Search algorithm `__" msgstr "" msgid "``pgr_bridges``" @@ -10262,10 +8769,7 @@ msgstr "" msgid "``pgr_bridges`` - Return the bridges of an undirected graph." 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." +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 "``edge`` ascending" @@ -10289,17 +8793,13 @@ msgstr "" msgid "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" msgstr "" -msgid "" -"`Boost: Connected components `__" +msgid "`Boost: Connected components `__" msgstr "" msgid "``pgr_chinesePostman`` - Experimental" msgstr "" -msgid "" -"``pgr_chinesePostman`` — Calculates the shortest circuit path which contains " -"every edge in a directed graph and starts and ends on the same vertex." +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 "" msgid "Returns ``EMPTY SET`` on a disconnected graph" @@ -10317,9 +8817,7 @@ msgstr "" msgid "Sequential value starting from ``1``" msgstr "" -msgid "" -"Identifier of the edge used to go from ``node`` to the next node in the path " -"sequence. ``-1`` for the last node of the path." +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 "" msgid "Aggregate cost from ``start_v`` to ``node``." @@ -10328,10 +8826,7 @@ msgstr "" msgid "``pgr_chinesePostmanCost`` - Experimental" msgstr "" -msgid "" -"``pgr_chinesePostmanCost`` — Calculates the minimum costs of a circuit path " -"which contains every edge in a directed graph and starts and ends on the " -"same vertex." +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 "" msgid "Return value when the graph if disconnected" @@ -10352,14 +8847,10 @@ msgstr "" msgid "``pgr_connectedComponents``" msgstr "" -msgid "" -"``pgr_connectedComponents`` — Connected components of an undirected graph " -"using a DFS-based approach." +msgid "``pgr_connectedComponents`` — Connected components of an undirected graph using a DFS-based approach." msgstr "" -msgid "" -"A connected component of an undirected graph is a set of vertices that are " -"all reachable from each other." +msgid "A connected component of an undirected graph is a set of vertices that are all reachable from each other." msgstr "" msgid "Components are described by vertices" @@ -10386,17 +8877,13 @@ msgstr "" msgid "Connecting disconnected components" msgstr "" -msgid "" -"wikipedia: `Connected component `__" +msgid "wikipedia: `Connected component `__" msgstr "" msgid "``pgr_contraction``" msgstr "" -msgid "" -"``pgr_contraction`` — Performs graph contraction and returns the contracted " -"vertices and edges." +msgid "``pgr_contraction`` — Performs graph contraction and returns the contracted vertices and edges." msgstr "" #, fuzzy @@ -10407,17 +8894,14 @@ msgstr "バージョン 3.0.0" msgid "New signature:" msgstr "機能" -msgid "" -"Previously compulsory parameter **Contraction order** is now optional with " -"name ``methods``." +msgid "Previously compulsory parameter **Contraction order** is now optional with name ``methods``." msgstr "" #, fuzzy msgid "New name and order of optional parameters." msgstr "オプションとなるパラメータ" -msgid "" -"Deprecated signature pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgid "Deprecated signature pgr_contraction(text,bigint[],integer,bigint[],boolean)" msgstr "" msgid "Name change from ``pgr_contractGraph``" @@ -10426,10 +8910,7 @@ msgstr "" msgid "Bug fixes" msgstr "" -msgid "" -"Contraction reduces the size of the graph by removing some of the vertices " -"and edges and, for example, might add edges that represent a sequence of " -"original edges decreasing the total time and space used in graph algorithms." +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 @@ -10457,9 +8938,7 @@ msgstr "" msgid "column ``id`` with negative numbers descending when its a new edge." msgstr "" -msgid "" -"Currently there are two types of contraction methods included in this " -"function:" +msgid "Currently there are two types of contraction methods included in this function:" msgstr "" msgid "Dead End Contraction. See :doc:`pgr_contractionDeadEnd`." @@ -10562,9 +9041,7 @@ msgstr "" msgid "Decreasing sequence starting from **-1**." msgstr "" -msgid "" -"Representing a pseudo `id` as is not incorporated in the set of original " -"edges." +msgid "Representing a pseudo `id` as is not incorporated in the set of original edges." msgstr "" msgid "``contracted_vertices``" @@ -10576,18 +9053,13 @@ msgstr "" msgid "When ``type`` = **'v'**: :math:`-1`" msgstr "" -msgid "" -"When ``type`` = **'e'**: Identifier of the source vertex of the current edge " -"(``source``, ``target``)." +msgid "When ``type`` = **'e'**: Identifier of the source vertex of the current edge (``source``, ``target``)." msgstr "" -msgid "" -"When ``type`` = **'e'**: Identifier of the target vertex of the current edge " -"(``source``, ``target``)." +msgid "When ``type`` = **'e'**: Identifier of the target vertex of the current edge (``source``, ``target``)." msgstr "" -msgid "" -"When ``type`` = **'e'**: Weight of the current edge (``source``, ``target``)." +msgid "When ``type`` = **'e'**: Weight of the current edge (``source``, ``target``)." msgstr "" msgid "Only dead end contraction" @@ -10599,11 +9071,7 @@ msgstr "" msgid "The cycle" msgstr "" -msgid "" -"Contracting a graph can be done with more than one operation. The order of " -"the operations affect the resulting contracted graph, after applying one " -"operation, the set of vertices that can be contracted by another operation " -"changes." +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 ``cycles`` times through the ``methods`` ." @@ -10612,9 +9080,7 @@ msgstr "" msgid "Contracting sample data" msgstr "" -msgid "" -"In this section, building and using a contracted graph will be shown by " -"example." +msgid "In this section, building and using a contracted graph will be shown by example." msgstr "" msgid "The :doc:`sampledata` for an undirected graph is used" @@ -10629,15 +9095,10 @@ msgstr "" msgid "The original graph:" msgstr "" -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." +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 "" -"Observe that vertices, for example, :math:`6` do not appear in the results " -"because it was not affected by the contraction algorithm." +msgid "Observe that vertices, for example, :math:`6` do not appear in the results because it was not affected by the contraction algorithm." msgstr "" msgid "After doing the dead end contraction operation:" @@ -10652,9 +9113,7 @@ msgstr "" msgid "Add additional columns" msgstr "" -msgid "" -"Adding extra columns to the edges and vertices tables. In this documentation " -"the following will be used:" +msgid "Adding extra columns to the edges and vertices tables. In this documentation the following will be used:" msgstr "" #, fuzzy @@ -10670,13 +9129,10 @@ msgstr "" msgid "On the vertex table" msgstr "" -msgid "" -"when ``true`` the vertex is contracted, its not part of the contracted graph." +msgid "when ``true`` the vertex is contracted, its not part of the contracted graph." msgstr "" -msgid "" -"when ``false`` the vertex is not contracted, its part of the contracted " -"graph." +msgid "when ``false`` the vertex is not contracted, its part of the contracted graph." msgstr "" msgid "``is_new``" @@ -10685,14 +9141,10 @@ msgstr "" msgid "On the edge table" msgstr "" -msgid "" -"when ``true`` the edge was generated by the contraction algorithm. its part " -"of the contracted graph." +msgid "when ``true`` the edge was generated by the contraction algorithm. its part of the contracted graph." msgstr "" -msgid "" -"when ``false`` the edge is an original edge, might be or not part of the " -"contracted graph." +msgid "when ``false`` the edge is an original edge, might be or not part of the contracted graph." msgstr "" msgid "Store contraction information" @@ -10704,13 +9156,10 @@ msgstr "" msgid "Update the edges and vertices tables" msgstr "" -msgid "" -"Use ``is_contracted`` column to indicate the vertices that are contracted." +msgid "Use ``is_contracted`` column to indicate the vertices that are contracted." msgstr "" -msgid "" -"Fill ``contracted_vertices`` with the information from the results that " -"belong to the vertices." +msgid "Fill ``contracted_vertices`` with the information from the results that belong to the vertices." msgstr "" msgid "Insert the new edges generated by pgr_contraction." @@ -10731,16 +9180,10 @@ msgstr "" msgid "Using the contracted graph" msgstr "" -msgid "" -"Depending on the final application the graph is to be prepared. In this " -"example the final application will be to calculate the cost from two " -"vertices in the original graph by using the contracted graph with " -"``pgr_dijkstraCost``" +msgid "Depending on the final application the graph is to be prepared. In this example the final application will be to calculate the cost from two vertices in the original graph by using the contracted graph with ``pgr_dijkstraCost``" msgstr "" -msgid "" -"There are three cases when calculating the shortest path between a given " -"source and target in a contracted graph:" +msgid "There are three cases when calculating the shortest path between a given source and target in a contracted graph:" msgstr "" msgid "Case 1: Both source and target belong to the contracted graph." @@ -10761,20 +9204,16 @@ msgstr "" msgid "Create the function that will use the contracted graph." msgstr "" -msgid "" -"Case 2: Source and/or target belong to an edge that has contracted vertices." +msgid "Case 2: Source and/or target belong to an edge that has contracted vertices." msgstr "" -msgid "" -"Case 3: Source and/or target belong to a vertex that has been contracted." +msgid "Case 3: Source and/or target belong to a vertex that has been contracted." msgstr "" msgid "``pgr_contractionDeadEnd`` - Proposed" msgstr "" -msgid "" -"``pgr_contractionDeadEnd`` — Performs graph contraction and returns the " -"contracted vertices and edges." +msgid "``pgr_contractionDeadEnd`` — Performs graph contraction and returns the contracted vertices and edges." msgstr "" msgid "A node is considered a dead end node when:" @@ -10792,8 +9231,7 @@ msgstr "" msgid "When there is only one adjacent vertex or" msgstr "" -msgid "" -"When all edges are incoming regardless of the number of adjacent vertices." +msgid "When all edges are incoming regardless of the number of adjacent vertices." msgstr "" msgid "pgr_contractionDeadEnd(`Edges SQL`_, [**options**])" @@ -10845,8 +9283,7 @@ msgstr "" msgid "The green nodes are dead end nodes" msgstr "" -msgid "" -"The blue nodes have an unlimited number of incoming and/or outgoing edges." +msgid "The blue nodes have an unlimited number of incoming and/or outgoing edges." msgstr "" msgid "Node" @@ -10920,37 +9357,25 @@ msgstr ":math:`9`" msgid "Many adjacent nodes." msgstr "" -msgid "" -"Has more than one adjacent node and some edges are incoming and some are " -"outgoing." +msgid "Has more than one adjacent node and some edges are incoming and some are outgoing." msgstr "" -msgid "" -"From above, nodes :math:`\\{6, 7, 9\\}` are dead ends because the total " -"number of adjacent vertices is one." +msgid "From above, nodes :math:`\\{6, 7, 9\\}` are dead ends because the total number of adjacent vertices is one." msgstr "" -msgid "" -"When there are more than one adjacent vertex, all edges need to be all " -"incoming edges otherwise it is not a dead end." +msgid "When there are more than one adjacent vertex, all edges need to be all incoming edges otherwise it is not a dead end." msgstr "" msgid "Step by step dead end contraction" msgstr "" -msgid "" -"The dead end contraction will stop until there are no more dead end nodes. " -"For example, from the following graph where :math:`3` is the dead end node:" +msgid "The dead end contraction will stop until there are no more dead end nodes. For example, from the following graph where :math:`3` is the dead end node:" msgstr "" -msgid "" -"After contracting :math:`3`, node :math:`2` is now a dead end node and is " -"contracted:" +msgid "After contracting :math:`3`, node :math:`2` is now a dead end node and is contracted:" msgstr "" -msgid "" -"After contracting :math:`2`, stop. Node :math:`1` has the information of " -"nodes that were contracted." +msgid "After contracting :math:`2`, stop. Node :math:`1` has the information of nodes that were contracted." msgstr "" #, fuzzy @@ -10983,74 +9408,34 @@ msgstr "" msgid "``pgr_contractionHierarchies`` - Experimental" msgstr "p" -msgid "" -"``pgr_contractionHierarchies`` — Performs graph contraction according to the " -"contraction hierarchies method and returns the contracted vertices and " -"shortcut edges created." +msgid "``pgr_contractionHierarchies`` — Performs graph contraction according to the contraction hierarchies method and returns the contracted vertices and shortcut edges created." msgstr "" -msgid "" -"The contraction hierarchies method builds, from an initial order of the " -"vertices, a hierarchical order, giving priority to some vertices during the " -"processing of label fixing of shortest paths algorithms. Furthermore, the " -"contraction hierarchies algorithm adds shortcut edges in the graph, that " -"helps the shortest paths algorithm to follow the created hierarchical graph " -"structure." +msgid "The contraction hierarchies method builds, from an initial order of the vertices, a hierarchical order, giving priority to some vertices during the processing of label fixing of shortest paths algorithms. Furthermore, the contraction hierarchies algorithm adds shortcut edges in the graph, that helps the shortest paths algorithm to follow the created hierarchical graph structure." msgstr "" -msgid "" -"The idea of the hierarchy is to put at a high priority level vertices that " -"belong to the long distance network (highways for example in a road network) " -"and to a low level of priority nodes that belong to the short distance " -"network (arterials or secondary roads for example in road networks)." +msgid "The idea of the hierarchy is to put at a high priority level vertices that belong to the long distance network (highways for example in a road network) and to a low level of priority nodes that belong to the short distance network (arterials or secondary roads for example in road networks)." msgstr "" -msgid "" -"The contraction hierarchies algorithm makes the assumption that there is " -"already a valuable vertices order that is used to initialize the contraction " -"process. As in most cases there is no valuable initial node ordering, we use " -"the order given by vertices ID. Then, the contraction process is made on the " -"basis of this first order to give the final hierarchy." +msgid "The contraction hierarchies algorithm makes the assumption that there is already a valuable vertices order that is used to initialize the contraction process. As in most cases there is no valuable initial node ordering, we use the order given by vertices ID. Then, the contraction process is made on the basis of this first order to give the final hierarchy." msgstr "" -msgid "" -"The basic idea is to keep the vertices in a priority queue sorted by some " -"estimate of how attractive is their contraction. The implemented case uses " -"the metric called *edge difference*, which corresponds to the difference " -"between the number of shortcuts produced by a vertex contraction and the " -"number of incident edges in the graph before contraction (``#shortcuts - " -"#incident edges``)." +msgid "The basic idea is to keep the vertices in a priority queue sorted by some estimate of how attractive is their contraction. The implemented case uses the metric called *edge difference*, which corresponds to the difference between the number of shortcuts produced by a vertex contraction and the number of incident edges in the graph before contraction (``#shortcuts - #incident edges``)." msgstr "" -msgid "" -"Finally, the aim is to reduce the explored part of the graph, when using a " -"bidirectional Dijkstra-like algorithm. The vertices order is used to feed " -"the oriented search. The search is made without losing optimality." +msgid "Finally, the aim is to reduce the explored part of the graph, when using a bidirectional Dijkstra-like algorithm. The vertices order is used to feed the oriented search. The search is made without losing optimality." msgstr "" -msgid "" -"Finding an optimal vertices ordering for contraction is a difficult problem. " -"Nevertheless, very simple local heuristics work quite well, according to " -"Geisberger et al. [2]. The principle here is to a priori estimate the value " -"of the *edge difference* and to contract the node at the top of the queue " -"only if the new value of the metric keeps it at the top of the queue. " -"Otherwise, it is reinserted in the queue, at its right place corresponding " -"to the new metric value." +msgid "Finding an optimal vertices ordering for contraction is a difficult problem. Nevertheless, very simple local heuristics work quite well, according to Geisberger et al. [2]. The principle here is to a priori estimate the value of the *edge difference* and to contract the node at the top of the queue only if the new value of the metric keeps it at the top of the queue. Otherwise, it is reinserted in the queue, at its right place corresponding to the new metric value." msgstr "" msgid "The process is done on graphs having only edges with positive costs." msgstr "" -msgid "" -"It is necessary to remember that there are no deleted vertices with this " -"function. At the end, the graph keeps every vertex it had, but has some " -"added edges, corresponding to shortcuts. The vertices which have been " -"contracted, to build the shortcut edges, are kept and hierarchically ordered." +msgid "It is necessary to remember that there are no deleted vertices with this function. At the end, the graph keeps every vertex it had, but has some added edges, corresponding to shortcuts. The vertices which have been contracted, to build the shortcut edges, are kept and hierarchically ordered." msgstr "" -msgid "" -"As for the other contraction methods, it does not return the full contracted " -"graph, only the changes. They are here of two types:" +msgid "As for the other contraction methods, it does not return the full contracted graph, only the changes. They are here of two types:" msgstr "" msgid "added shortcut edges, with negative identifiers;" @@ -11059,8 +9444,7 @@ msgstr "" msgid "contracted nodes with an order." msgstr "" -msgid "" -"The ``pgr_contractionHierarchies`` function has the following signature:" +msgid "The ``pgr_contractionHierarchies`` function has the following signature:" msgstr "" #, fuzzy @@ -11077,9 +9461,7 @@ msgstr "オプションとなるパラメータ" msgid "True if the graph is directed, False otherwise." msgstr "" -msgid "" -"The function returns many rows (one per vertex and one per shortcut edge " -"created). The columns of the rows are:" +msgid "The function returns many rows (one per vertex and one per shortcut edge created). The columns of the rows are:" msgstr "" msgid "Type of the ``id``." @@ -11101,41 +9483,26 @@ msgstr "" msgid "On an undirected graph" msgstr "導かれないグラフ" -msgid "" -"The following query shows the original data involved in the contraction " -"operation on an undirected graph." +msgid "The following query shows the original data involved in the contraction operation on an undirected graph." msgstr "" msgid "building contraction hierarchies on the whole graph" msgstr "" -msgid "" -"The results do not represent the contracted graph. They represent the " -"changes done to the graph after applying the contraction algorithm and give " -"the vertex order built by the algorithm, by ordering vertices according to " -"the *edge difference* metric. As a consequence, vertices are all represented " -"in the result (except of course forbidden ones). Only shortcut built by the " -"algorithm are represented in the result." +msgid "The results do not represent the contracted graph. They represent the changes done to the graph after applying the contraction algorithm and give the vertex order built by the algorithm, by ordering vertices according to the *edge difference* metric. As a consequence, vertices are all represented in the result (except of course forbidden ones). Only shortcut built by the algorithm are represented in the result." msgstr "" -msgid "" -"After computing the contraction hierarchies, an order is now given to the " -"vertices," +msgid "After computing the contraction hierarchies, an order is now given to the vertices," msgstr "" -msgid "" -"in order to be used with a specific Dijkstra algorithm (implementation " -"coming in a future version), which speeds up the search." +msgid "in order to be used with a specific Dijkstra algorithm (implementation coming in a future version), which speeds up the search." msgstr "" #, fuzzy msgid "We obtain the contracted graph above:" msgstr "次のクエリを実行します。" -msgid "" -"We can see without surprise that the vertices belonging to the shortcuts " -"have a tendency to have a high priority level in the resulting vertices " -"order." +msgid "We can see without surprise that the vertices belonging to the shortcuts have a tendency to have a high priority level in the resulting vertices order." msgstr "" msgid "On an undirected graph with forbidden vertices" @@ -11150,24 +9517,13 @@ msgstr "" msgid "Shortcut building process" msgstr "" -msgid "" -"A vertex ``v`` is contracted by adding shortcuts replacing former paths of " -"the form ``(u, v, w)`` by an edge ``(u, w)``. The shortcut ``(u, w)`` is " -"only needed when ``(u, v, w)`` is the only shortest path between ``u`` and " -"``w``." +msgid "A vertex ``v`` is contracted by adding shortcuts replacing former paths of the form ``(u, v, w)`` by an edge ``(u, w)``. The shortcut ``(u, w)`` is only needed when ``(u, v, w)`` is the only shortest path between ``u`` and ``w``." msgstr "" -msgid "" -"When all shortcuts have been added for a given vertex ``v``, the incident " -"edges of ``v`` are removed and another vertex is contracted with the " -"remaining graph." +msgid "When all shortcuts have been added for a given vertex ``v``, the incident edges of ``v`` are removed and another vertex is contracted with the remaining graph." msgstr "" -msgid "" -"The procedure is destructive for the graph and a copy is made to be able to " -"manipulate it again as a whole. The contraction process adds all discovered " -"shortcuts to the edge set ``E`` and attributes a metric to each contracted " -"vertex. This metric is giving what is called the *contraction hierarchy*." +msgid "The procedure is destructive for the graph and a copy is made to be able to manipulate it again as a whole. The contraction process adds all discovered shortcuts to the edge set ``E`` and attributes a metric to each contracted vertex. This metric is giving what is called the *contraction hierarchy*." msgstr "" msgid "Initialize the queue with a first vertices order" @@ -11219,51 +9575,28 @@ msgstr ":math:`9`" msgid "Adjacent edges are removed." msgstr "" -msgid "" -"Shortcuts are built from predecessors of ``v`` to successors of ``v`` if and " -"only if the path through ``v`` corresponds to the only shortest path between " -"the predecessor and the successor of ``v`` in the graph. The *edge " -"difference* metric here takes the value of -2." +msgid "Shortcuts are built from predecessors of ``v`` to successors of ``v`` if and only if the path through ``v`` corresponds to the only shortest path between the predecessor and the successor of ``v`` in the graph. The *edge difference* metric here takes the value of -2." msgstr "" -msgid "" -"Then the following vertex is contracted. The process goes on until each node " -"of the graph has been contracted. At the end, there are no more edges in the " -"graph, which has been destroyed by the process." +msgid "Then the following vertex is contracted. The process goes on until each node of the graph has been contracted. At the end, there are no more edges in the graph, which has been destroyed by the process." msgstr "" -msgid "" -"This first contraction will give a vertices order, given by ordering them in " -"ascending order on the metric (edge difference). A total vertices order is " -"built. If ``u < v``, then ``u`` is less important than ``v``. The algorithm " -"keeps the vertices into a queue in this order." +msgid "This first contraction will give a vertices order, given by ordering them in ascending order on the metric (edge difference). A total vertices order is built. If ``u < v``, then ``u`` is less important than ``v``. The algorithm keeps the vertices into a queue in this order." msgstr "" -msgid "" -"A hierarchy will now be constructed by contracting again the vertices in " -"this order." +msgid "A hierarchy will now be constructed by contracting again the vertices in this order." msgstr "" msgid "Build the final vertex order" msgstr "" -msgid "" -"Once the first order built, the algorithm uses it to browse the graph once " -"again. For each vertex taken in the queue, the algorithm simulates " -"contraction and calculates its edge difference. If the computed value is " -"greater than the one of the next vertex to be contracted, then the algorithm " -"puts it back in the queue (heuristic approach). Otherwise it contracts it " -"permanently." +msgid "Once the first order built, the algorithm uses it to browse the graph once again. For each vertex taken in the queue, the algorithm simulates contraction and calculates its edge difference. If the computed value is greater than the one of the next vertex to be contracted, then the algorithm puts it back in the queue (heuristic approach). Otherwise it contracts it permanently." msgstr "" msgid "Add shortcuts to the initial graph" msgstr "" -msgid "" -"At the end, the algorithm takes the initial graph (before edges deletions) " -"and adds the shortcut edges to it. It gives you the contracted graph, ready " -"to use with a specialized Dijkstra algorithm, which takes into account the " -"order of the nodes in the hierarchy." +msgid "At the end, the algorithm takes the initial graph (before edges deletions) and adds the shortcut edges to it. It gives you the contracted graph, ready to use with a specialized Dijkstra algorithm, which takes into account the order of the nodes in the hierarchy." msgstr "" #, fuzzy @@ -11277,8 +9610,7 @@ msgstr "序章" msgid "Add shortcuts and hierarchy in the existing tables" msgstr "" -msgid "" -"Add new columns in the `vertices` and `edges` tables to store the results:" +msgid "Add new columns in the `vertices` and `edges` tables to store the results:" msgstr "" msgid "Update and insert the results in the two tables." @@ -11287,17 +9619,13 @@ msgstr "" msgid "Use a Dijkstra shortest path algorithm on it" msgstr "" -msgid "" -"Then you can use any Dijkstra-like algorithm, waiting for the adapted one " -"which will take into account the built vertices hierarchy. For example:" +msgid "Then you can use any Dijkstra-like algorithm, waiting for the adapted one which will take into account the built vertices hierarchy. For example:" msgstr "" msgid "``pgr_contractionLinear`` - Proposed" msgstr "" -msgid "" -"``pgr_contractionLinear`` — Performs graph contraction and returns the " -"contracted vertices and edges." +msgid "``pgr_contractionLinear`` — Performs graph contraction and returns the contracted vertices and edges." msgstr "" #, fuzzy @@ -11308,9 +9636,7 @@ msgstr "p" msgid "Linear contraction on an undirected graph." msgstr "導かれないグラフ。" -msgid "" -"The green nodes are linear nodes and will not be part of the contracted " -"graph." +msgid "The green nodes are linear nodes and will not be part of the contracted graph." msgstr "" msgid "All edges adjacent will not be part of the contracted graph." @@ -11322,9 +9648,7 @@ msgstr "" msgid "**contraction Order**" msgstr "" -msgid "" -"Number of times the contraction operations on ``contraction_order`` will be " -"performed." +msgid "Number of times the contraction operations on ``contraction_order`` will be performed." msgstr "" msgid "A node connects two (or more) `linear` edges when" @@ -11345,14 +9669,10 @@ msgstr "" msgid "Graph where linearity is not symmetrical." msgstr "" -msgid "" -"When the graph is processed as a directed graph, linearity is not " -"symmetrical, therefore the graph can not be contracted." +msgid "When the graph is processed as a directed graph, linearity is not symmetrical, therefore the graph can not be contracted." msgstr "" -msgid "" -"When the same graph is processed as an undirected graph, linearity is " -"symmetrical, therefore the graph can be contracted." +msgid "When the same graph is processed as an undirected graph, linearity is symmetrical, therefore the graph can be contracted." msgstr "" msgid "The three edges can be replaced by one undirected edge" @@ -11390,9 +9710,7 @@ msgstr "" msgid "Step by step linear contraction" msgstr "" -msgid "" -"The linear contraction will stop when there are no more linear edges. For " -"example from the following graph there are linear edges" +msgid "The linear contraction will stop when there are no more linear edges. For example from the following graph there are linear edges" msgstr "" msgid "Contracting vertex :math:`3`," @@ -11401,13 +9719,10 @@ msgstr "" msgid "The vertex :math:`3` is removed from the graph" msgstr "" -msgid "" -"The edges :math:`2 \\rightarrow 3` and :math:`w \\rightarrow z` are removed " -"from the graph." +msgid "The edges :math:`2 \\rightarrow 3` and :math:`w \\rightarrow z` are removed from the graph." msgstr "" -msgid "" -"A new edge :math:`2 \\rightarrow 4` is inserted represented with red color." +msgid "A new edge :math:`2 \\rightarrow 4` is inserted represented with red color." msgstr "" #, fuzzy @@ -11417,18 +9732,13 @@ msgstr "エッジのセット :math:`5`:" msgid "The vertex :math:`2` is removed from the graph" msgstr "" -msgid "" -"The edges :math:`1 \\rightarrow 2` and :math:`2 \\rightarrow 3` are removed " -"from the graph." +msgid "The edges :math:`1 \\rightarrow 2` and :math:`2 \\rightarrow 3` are removed from the graph." msgstr "" -msgid "" -"A new edge :math:`1 \\rightarrow 3` is inserted represented with red color." +msgid "A new edge :math:`1 \\rightarrow 3` is inserted represented with red color." msgstr "" -msgid "" -"Edge :math:`1 \\rightarrow 3` has the information of cost and the nodes that " -"were contracted." +msgid "Edge :math:`1 \\rightarrow 3` has the information of cost and the nodes that were contracted." msgstr "" #, fuzzy @@ -11438,32 +9748,22 @@ msgstr "次のクエリを実行します。" msgid "``pgr_cuthillMckeeOrdering`` - Experimental" msgstr "" -msgid "" -"``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of " -"an undirected graphs" +msgid "``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of an undirected graphs" msgstr "" msgid "Version 3.4.0" msgstr "" -msgid "" -"In numerical linear algebra, the Cuthill-McKee algorithm (CM), named after " -"Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse " -"matrix that has a symmetric sparsity pattern into a band matrix form with a " -"small bandwidth." +msgid "In numerical linear algebra, the Cuthill-McKee algorithm (CM), named after Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse matrix that has a symmetric sparsity pattern into a band matrix form with a small bandwidth." msgstr "" -msgid "" -"The vertices are basically assigned a breadth-first search order, except " -"that at each step, the adjacent vertices are placed in the queue in order of " -"increasing degree." +msgid "The vertices are basically assigned a breadth-first search order, except that at each step, the adjacent vertices are placed in the queue in order of increasing degree." msgstr "" msgid "The implementation is for **undirected** graphs." msgstr "" -msgid "" -"The bandwidth minimization problems are considered NP-complete problems." +msgid "The bandwidth minimization problems are considered NP-complete problems." msgstr "" msgid "The running time complexity is: :math:`O(m log(m)|V|)`" @@ -11495,49 +9795,31 @@ msgstr "開始ノードの識別子。" msgid "New ordering in reverse order." msgstr "" -msgid "" -"`Boost: Cuthill-McKee Ordering `__" +msgid "`Boost: Cuthill-McKee Ordering `__" msgstr "" -msgid "" -"`Wikipedia: Cuthill-McKee Ordering `__" +msgid "`Wikipedia: Cuthill-McKee Ordering `__" msgstr "" msgid "``pgr_dagShortestPath`` - Experimental" msgstr "" -msgid "" -"``pgr_dagShortestPath`` — Returns the shortest path for weighted directed " -"acyclic graphs(DAG). In particular, the DAG shortest paths algorithm " -"implemented by Boost.Graph." +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 "" msgid "pgr_dagShortestPath(Combinations)" msgstr "" -msgid "" -"Shortest Path for Directed Acyclic Graph(DAG) is a graph search algorithm " -"that solves the shortest path problem for weighted directed acyclic graph, " -"producing a shortest path from a starting vertex (``start_vid``) to an " -"ending vertex (``end_vid``)." +msgid "Shortest Path for Directed Acyclic Graph(DAG) is a graph search algorithm that solves the shortest path problem for weighted directed acyclic graph, producing a shortest path from a starting vertex (``start_vid``) to an ending vertex (``end_vid``)." msgstr "" -msgid "" -"This implementation can only be used with a **directed** graph with no " -"cycles i.e. directed acyclic graph." +msgid "This implementation can only be used with a **directed** graph with no cycles i.e. directed acyclic graph." msgstr "" -msgid "" -"The algorithm relies on topological sorting the dag to impose a linear " -"ordering on the vertices, and thus is more efficient for DAG's than either " -"the Dijkstra or Bellman-Ford algorithm." +msgid "The algorithm relies on topological sorting the dag to impose a linear ordering on the vertices, and thus is more efficient for DAG's than either the Dijkstra or Bellman-Ford algorithm." msgstr "" -msgid "" -"Process is valid for weighted directed acyclic graphs only. otherwise it " -"will throw warnings." +msgid "Process is valid for weighted directed acyclic graphs only. otherwise it will throw warnings." msgstr "" msgid "The `agg_cost` the non included values `(v, v)` is `0`" @@ -11575,9 +9857,7 @@ msgstr "" msgid "From vertices :math:`\\{5, 10\\}` to vertex :math:`11`" msgstr "" -msgid "" -"From vertices :math:`\\{5, 15\\}` to vertices :math:`\\{11, 17\\}` on an " -"**undirected** graph" +msgid "From vertices :math:`\\{5, 15\\}` to vertices :math:`\\{11, 17\\}` on an **undirected** graph" msgstr "" #, fuzzy @@ -11587,9 +9867,7 @@ msgstr "結果として返却されるカラム" msgid "Making **start_vids** the same as **end_vids**" msgstr "" -msgid "" -"`Boost: DAG shortest paths `__" +msgid "`Boost: DAG shortest paths `__" msgstr "" msgid "https://en.wikipedia.org/wiki/Topological_sorting" @@ -11599,9 +9877,7 @@ msgstr "" msgid "``pgr_degree``" msgstr "pgr_TSP" -msgid "" -"``pgr_degree`` — For each vertex in an undirected graph, return the count of " -"edges incident to the vertex." +msgid "``pgr_degree`` — For each vertex in an undirected graph, return the count of edges incident to the vertex." msgstr "" msgid "Error messages adjustment." @@ -11613,9 +9889,7 @@ msgstr "" msgid "Calculates the degree of the vertices of an undirected graph" msgstr "" -msgid "" -"The degree (or valency) of a vertex of a graph is the number of edges that " -"are incident to the vertex." +msgid "The degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex." msgstr "" msgid "A loop contributes 2 to a vertex's degree." @@ -11627,18 +9901,13 @@ msgstr "" msgid "Isolated vertex is not part of the result" msgstr "" -msgid "" -"Vertex not participating on the subgraph is considered and isolated vertex." +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``." +msgid "There can be a ``dryrun`` execution and the code used to get the answer will be shown in a PostgreSQL ``NOTICE``." msgstr "" -msgid "" -"The code can be used as base code for the particular application " -"requirements." +msgid "The code can be used as base code for the particular application requirements." msgstr "" msgid "No ordering is performed." @@ -11674,9 +9943,7 @@ msgstr "" msgid "``pgr_degree`` can use :doc:`pgr_extractVertices` embedded in the call." msgstr "" -msgid "" -"For decent size networks, it is best to prepare your vertices table before " -"hand and use it on ``pgr_degree`` calls. (See `Using a vertex table`_)" +msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls. (See `Using a vertex table`_)" msgstr "" msgid "Calculate the degree of the nodes:" @@ -11706,9 +9973,7 @@ msgstr "" msgid "``in_edges``" msgstr "" -msgid "" -"Array of identifiers of the edges that have the vertex ``id`` as *first end " -"point*." +msgid "Array of identifiers of the edges that have the vertex ``id`` as *first end point*." msgstr "" msgid "When missing, ``out_edges`` must exist." @@ -11717,9 +9982,7 @@ msgstr "" msgid "``out_edges``" msgstr "" -msgid "" -"Array of identifiers of the edges that have the vertex ``id`` as *second end " -"point*." +msgid "Array of identifiers of the edges that have the vertex ``id`` as *second end point*." msgstr "" msgid "When missing, ``in_edges`` must exist." @@ -11767,9 +10030,7 @@ msgstr "" msgid "Using a vertex table" msgstr "" -msgid "" -"For decent size networks, it is best to prepare your vertices table before " -"hand and use it on ``pgr_degree`` calls." +msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls." msgstr "" msgid "Extract the vertex information and save into a table:" @@ -11778,24 +10039,16 @@ msgstr "" msgid "Dry run execution" msgstr "" -msgid "" -"To get the query generated used to get the vertex information, use ``dryrun " -"=> true``." +msgid "To get the query generated used to get the vertex information, use ``dryrun => true``." msgstr "" -msgid "" -"The results can be used as base code to make a refinement based on the " -"backend development needs." +msgid "The results can be used as base code to make a refinement based on the backend development needs." msgstr "" msgid "Finding dead ends" msgstr "" -msgid "" -"If there is a vertices table already built using ``pgr_extractVertices`` and " -"want the degree of the whole graph rather than a subset, it can be forgo " -"using ``pgr_degree`` and work with the ``in_edges`` and ``out_edges`` " -"columns directly." +msgid "If there is a vertices table already built using ``pgr_extractVertices`` and want the degree of the whole graph rather than a subset, it can be forgo using ``pgr_degree`` and work with the ``in_edges`` and ``out_edges`` columns directly." msgstr "" msgid "The degree of a dead end is 1." @@ -11807,8 +10060,7 @@ msgstr "" msgid "The degree of a linear vertex is 2." msgstr "" -msgid "" -"If there is a vertices table already built using the ``pgr_extractVertices``" +msgid "If there is a vertices table already built using the ``pgr_extractVertices``" msgstr "" msgid ":doc:`pgr_extractVertices`" @@ -11817,43 +10069,28 @@ msgstr "" msgid "``pgr_depthFirstSearch`` - Proposed" msgstr "" -msgid "" -"``pgr_depthFirstSearch`` — Returns a depth first search traversal of the " -"graph. The graph can be directed or undirected." +msgid "``pgr_depthFirstSearch`` — Returns a depth first search traversal of the graph. The graph can be directed or undirected." msgstr "" msgid "Version 3.3.0" msgstr "" -msgid "" -"Depth First Search algorithm is a traversal algorithm which starts from a " -"root vertex, goes as deep as possible, and backtracks once a vertex is " -"reached with no adjacent vertices or with all visited adjacent vertices. The " -"traversal continues until all the vertices reachable from the root vertex " -"are visited." +msgid "Depth First Search algorithm is a traversal algorithm which starts from a root vertex, goes as deep as possible, and backtracks once a vertex is reached with no adjacent vertices or with all visited adjacent vertices. The traversal continues until all the vertices reachable from the root vertex are visited." msgstr "" -msgid "" -"The implementation works for both **directed** and **undirected** graphs." +msgid "The implementation works for both **directed** and **undirected** graphs." msgstr "" -msgid "" -"Provides the Depth First Search traversal order from a root vertex or from a " -"set of root vertices." +msgid "Provides the Depth First Search traversal order from a root vertex or from a set of root vertices." msgstr "" -msgid "" -"An optional non-negative maximum depth parameter to limit the results up to " -"a particular depth." +msgid "An optional non-negative maximum depth parameter to limit the results up to a particular depth." msgstr "" -msgid "" -"For optimization purposes, any duplicated values in the `Root vids` are " -"ignored." +msgid "For optimization purposes, any duplicated values in the `Root vids` are ignored." msgstr "" -msgid "" -"It does not produce the shortest path from a root vertex to a target vertex." +msgid "It does not produce the shortest path from a root vertex to a target vertex." msgstr "" msgid "The aggregate cost of traversal is not guaranteed to be minimal." @@ -11877,19 +10114,13 @@ msgstr "" msgid "Same as `Single vertex`_ but with edges in descending order of ``id``." msgstr "" -msgid "" -"`Boost: Depth First Search `__" +msgid "`Boost: Depth First Search `__" msgstr "" -msgid "" -"`Boost: Undirected DFS `__" +msgid "`Boost: Undirected DFS `__" msgstr "" -msgid "" -"`Wikipedia: Depth First Search algorithm `__" +msgid "`Wikipedia: Depth First Search algorithm `__" msgstr "" msgid "``pgr_dijkstra`` — Shortest path using Dijkstra algorithm." @@ -11944,12 +10175,10 @@ msgstr "p" msgid "pgr_dijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**" msgstr "" -msgid "" -"The examples of this section are based on the :doc:`sampledata` network." +msgid "The examples of this section are based on the :doc:`sampledata` network." msgstr "" msgid "For **directed** graphs with ``cost`` and ``reverse_cost`` columns" @@ -11991,8 +10220,7 @@ msgstr "" msgid "8) Using `Combinations`_ to get the solution of examples 1 to 3" msgstr "" -msgid "" -"Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" +msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" msgstr "" msgid "For **undirected** graphs with ``cost`` and ``reverse_cost`` columns" @@ -12088,8 +10316,7 @@ msgstr "" msgid "Equvalences between signatures" msgstr "" -msgid "" -"The following examples find the path for :math:`\\{6\\}\\rightarrow\\{10\\}`" +msgid "The following examples find the path for :math:`\\{6\\}\\rightarrow\\{10\\}`" msgstr "" msgid "33) Using `One to One`_" @@ -12107,9 +10334,7 @@ msgstr "" msgid "37) Using `Combinations`_" msgstr "" -msgid "" -"`Boost: Dijkstra shortest paths `__" +msgid "`Boost: Dijkstra shortest paths `__" msgstr "" msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" @@ -12119,36 +10344,28 @@ msgid "``pgr_dijkstraCost``" msgstr "" #, fuzzy -msgid "" -"``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra " -"algorithm." +msgid "``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra algorithm." msgstr ":doc:`pgr_dijkstraCost` - 最短経路の総コストを集計します。" msgid "pgr_dijkstraCost(Combinations)" msgstr "" #, fuzzy -msgid "" -"The ``pgr_dijkstraCost`` function summarizes of the cost of the shortest " -"path using Dijkstra Algorithm." +msgid "The ``pgr_dijkstraCost`` function summarizes of the cost of the shortest path using Dijkstra Algorithm." msgstr ":doc:`pgr_dijkstraCost` - 最短経路の総コストを集計します。" #, fuzzy -msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "p" -msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" #, fuzzy -msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "p" -msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" msgid "pgr_dijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" @@ -12157,9 +10374,7 @@ msgstr "" msgid "``pgr_dijkstraCostMatrix``" msgstr "" -msgid "" -"``pgr_dijkstraCostMatrix`` - Calculates a cost matrix using :doc:" -"`pgr_dijkstra`." +msgid "``pgr_dijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_dijkstra`." msgstr "" msgid "Using Dijkstra algorithm, calculate and return a cost matrix." @@ -12172,15 +10387,10 @@ msgstr "" msgid "``pgr_dijkstraNear``" msgstr "ダイクストラ関連機能" -msgid "" -"``pgr_dijkstraNear`` — Using Dijkstra's algorithm, finds the route that " -"leads to the nearest vertex." +msgid "``pgr_dijkstraNear`` — Using Dijkstra's algorithm, finds the route that leads to the nearest vertex." msgstr "" -msgid "" -"Given a graph, a starting vertex and a set of ending vertices, this function " -"finds the shortest path from the starting vertex to the nearest ending " -"vertex." +msgid "Given a graph, a starting vertex and a set of ending vertices, this function finds the shortest path from the starting vertex to the nearest ending vertex." msgstr "" msgid "Uses Dijkstra algorithm." @@ -12228,16 +10438,13 @@ msgstr "" msgid "Combinations: :math:`drt * |Starting vids|`" msgstr "" -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" msgstr "" -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" msgstr "" -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" msgstr "" msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options B**])" @@ -12249,8 +10456,7 @@ msgstr "" msgid "**options B:** ``[directed, cap, global]``" msgstr "" -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgstr "" msgid "**options:** ``[directed, cap]``" @@ -12262,8 +10468,7 @@ msgstr "" msgid "Using a **directed** graph for car routing." msgstr "" -msgid "" -"The subway stations are on the following vertices :math:`\\{1, 10, 11\\}`" +msgid "The subway stations are on the following vertices :math:`\\{1, 10, 11\\}`" msgstr "" msgid "The defaults used:" @@ -12278,13 +10483,10 @@ msgstr "" msgid "The result shows that station at vertex :math:`11` is the nearest." msgstr "" -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -msgid "" -"Departing on a car from a subway station find the nearest **two** stations " -"to vertex :math:`2`" +msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`2`" msgstr "" msgid "On line `4`: using the positional parameter: `directed` set to ``true``" @@ -12293,13 +10495,10 @@ msgstr "" msgid "In line `5`: using named parameter `cap => 2`" msgstr "" -msgid "" -"The result shows that station at vertex :math:`10` is the nearest and the " -"next best is :math:`11`." +msgid "The result shows that station at vertex :math:`10` is the nearest and the next best is :math:`11`." msgstr "" -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "" msgid "**options:** ``[directed, cap, global]``" @@ -12323,21 +10522,16 @@ msgstr "" msgid "`global => true`" msgstr "" -msgid "" -"For a pedestrian the best connection is to get on/off is at vertex :math:" -"`15` of the first subway line and at vertex :math:`10` of the second subway " -"line." +msgid "For a pedestrian the best connection is to get on/off is at vertex :math:`15` of the first subway line and at vertex :math:`10` of the second subway line." msgstr "" -msgid "" -"Only `one` route is returned because `global` is ``true`` and `cap` is ``1``" +msgid "Only `one` route is returned because `global` is ``true`` and `cap` is ``1``" msgstr "" msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" -msgid "" -"Find the best car connection between all the stations of two subway lines" +msgid "Find the best car connection between all the stations of two subway lines" msgstr "" msgid "The first subway line stations stops are at :math:`\\{1, 10, 11\\}`" @@ -12349,14 +10543,10 @@ msgstr "" msgid "The combinations contents:" msgstr "" -msgid "" -"lines `3~4` sets the start vertices to be from the first subway line and the " -"ending vertices to be from the second subway line" +msgid "lines `3~4` sets the start vertices to be from the first subway line and the ending vertices to be from the second subway line" msgstr "" -msgid "" -"lines `6~7` sets the start vertices to be from the first subway line and the " -"ending vertices to be from the first subway line" +msgid "lines `6~7` sets the start vertices to be from the first subway line and the ending vertices to be from the first subway line" msgstr "" msgid "On line `8`: using the named parameter is `global => false`" @@ -12365,34 +10555,22 @@ msgstr "" msgid "From the results:" msgstr "" -msgid "" -"making a connection from the first subway line :math:`\\{1, 10, 11\\}` to " -"the second :math:`\\{15, 16\\}`:" +msgid "making a connection from the first subway line :math:`\\{1, 10, 11\\}` to the second :math:`\\{15, 16\\}`:" msgstr "" -msgid "" -"The best connections from all the stations from the first line are: :math:" -"`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" +msgid "The best connections from all the stations from the first line are: :math:`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" msgstr "" -msgid "" -"The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` " -"(lines: `11` and `12`)" +msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `11` and `12`)" msgstr "" -msgid "" -"making a connection from the second subway line :math:`\\{15, 16\\}` to the " -"first :math:`\\{1, 10, 11\\}`:" +msgid "making a connection from the second subway line :math:`\\{15, 16\\}` to the first :math:`\\{1, 10, 11\\}`:" msgstr "" -msgid "" -"The best connections from all the stations from the second line are: :math:" -"`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" +msgid "The best connections from all the stations from the second line are: :math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" msgstr "" -msgid "" -"Both are equally good as they have the same cost. (lines: `13` and `14` and " -"lines: `15` and `16`)" +msgid "Both are equally good as they have the same cost. (lines: `13` and `14` and lines: `15` and `16`)" msgstr "" msgid "Dijkstra optional parameters" @@ -12423,60 +10601,40 @@ msgstr "" msgid "``pgr_dijkstraNearCost``" msgstr "ダイクストラ関連機能" -msgid "" -"``pgr_dijkstraNearCost`` — Using dijkstra algorithm, finds the route that " -"leads to the nearest vertex." +msgid "``pgr_dijkstraNearCost`` — Using dijkstra algorithm, finds the route that leads to the nearest vertex." msgstr "" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options " -"A**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" msgstr "" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options " -"A**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" msgstr "" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options " -"B**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" msgstr "" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" msgstr "" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, " -"[**options**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgstr "" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, " -"[**options**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -msgid "" -"Departing on a car from a subway station find the nearest **two** stations " -"to vertex :math:`6`" +msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`6`" msgstr "" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, " -"[**options**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "" msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" -msgid "" -"The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` " -"(lines: `1`)" +msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `1`)" msgstr "" -msgid "" -"Both are equally good as they have the same cost. (lines: `12` and `13`)" +msgid "Both are equally good as they have the same cost. (lines: `12` and `13`)" msgstr "" #, fuzzy @@ -12486,10 +10644,7 @@ msgstr "ダイクストラ関連機能" msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices." msgstr "" -msgid "" -"Given a list of vertices and a graph, this function is equivalent to finding " -"the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :" -"math:`i < size\\_of(via\\;vertices)`." +msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)`." msgstr "" msgid "Route" @@ -12516,9 +10671,7 @@ msgstr "" msgid "Returns set of |via-result|" msgstr "" -msgid "" -"Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order " -"on an directed graph." +msgid "Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order on an directed graph." msgstr "" msgid "Via optional parameters" @@ -12530,9 +10683,7 @@ msgstr "" msgid "Identifier of a path. Has value **1** for the first path." msgstr "" -msgid "" -"Identifier of the edge used to go from ``node`` to the next node in the path " -"sequence." +msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence." msgstr "" msgid "-1 for the last node of the path." @@ -12544,14 +10695,10 @@ msgstr "" msgid "``route_agg_cost``" msgstr "" -msgid "" -"Total cost from ``start_vid`` of ``seq = 1`` to ``end_vid`` of the current " -"``seq``." +msgid "Total cost from ``start_vid`` of ``seq = 1`` to ``end_vid`` of the current ``seq``." msgstr "" -msgid "" -"All this examples are about the route that visits the vertices :math:`\\{5, " -"7, 1, 8, 15\\}` in that order on a **directed** graph." +msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a **directed** graph." msgstr "" msgid "The main query" @@ -12578,8 +10725,7 @@ msgstr "" msgid ":doc:`dijkstra-family`." msgstr "" -msgid "" -"``pgr_drivingDistance`` - Returns the driving distance from a start node." +msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." msgstr "" msgid "pgr_drivingDistance(Single vertex)" @@ -12610,19 +10756,14 @@ msgstr "" msgid "pgr_drivingDistance(multiple vertices)" msgstr "" -msgid "" -"Using the Dijkstra algorithm, extracts all the nodes that have costs less " -"than or equal to the value ``distance``. The edges extracted will conform to " -"the corresponding spanning tree." +msgid "Using the Dijkstra algorithm, extracts all the nodes that have costs less than or equal to the value ``distance``. The edges extracted will conform to the corresponding spanning tree." msgstr "" #, fuzzy -msgid "" -"pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" +msgid "pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" msgstr "p" -msgid "" -"pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" +msgid "pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" msgstr "" msgid "**options:** [directed, equicost]" @@ -12637,9 +10778,7 @@ msgstr "" msgid "Multiple Vertices" msgstr "" -msgid "" -"From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` with equi-" -"cost on a directed graph" +msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` with equi-cost on a directed graph" msgstr "" msgid "Driving distance optional parameters" @@ -12648,36 +10787,25 @@ msgstr "" msgid "``equicost``" msgstr "" -msgid "" -"When ``true`` the node will only appear in the closest ``start_vid`` list. " -"Tie brakes are arbitrary." +msgid "When ``true`` the node will only appear in the closest ``start_vid`` list. Tie brakes are arbitrary." msgstr "" -msgid "" -"When ``false`` which resembles several calls using the single vertex " -"signature." +msgid "When ``false`` which resembles several calls using the single vertex signature." msgstr "" msgid "end-before" msgstr "" -msgid "" -"From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` on an " -"undirected graph" +msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` on an undirected graph" msgstr "" msgid "``pgr_edgeColoring`` - Experimental" msgstr "" -msgid "" -"``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free " -"graphs" +msgid "``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free graphs" msgstr "" -msgid "" -"Edge Coloring is an algorithm used for coloring of the edges for the " -"vertices in the graph. It is an assignment of colors to the edges of the " -"graph so that no two adjacent edges have the same color." +msgid "Edge Coloring is an algorithm used for coloring of the edges for the vertices in the graph. It is an assignment of colors to the edges of the graph so that no two adjacent edges have the same color." msgstr "" msgid "The implementation is for **undirected** and **loop-free** graphs" @@ -12689,24 +10817,16 @@ msgstr "" msgid "no self-loops and no parallel edges." msgstr "" -msgid "" -"Provides the color to be assigned to all the edges present in the graph." +msgid "Provides the color to be assigned to all the edges present in the graph." msgstr "" -msgid "" -"At most :math:`\\Delta + 1` colors are used, where :math:`\\Delta` is the " -"degree of the graph." +msgid "At most :math:`\\Delta + 1` colors are used, where :math:`\\Delta` is the degree of the graph." msgstr "" -msgid "" -"This is optimal for some graphs, and by Vizing's theorem it uses at most one " -"color more than the optimal for all others." +msgid "This is optimal for some graphs, and by Vizing's theorem it uses at most one color more than the optimal for all others." msgstr "" -msgid "" -"the chromatic number :math:`x'(G)` (minimum number of colors needed for " -"proper edge coloring of graph) is equal to the degree :math:`\\Delta + 1` of " -"the graph, (:math:`x'(G) = \\Delta`)" +msgid "the chromatic number :math:`x'(G)` (minimum number of colors needed for proper edge coloring of graph) is equal to the degree :math:`\\Delta + 1` of the graph, (:math:`x'(G) = \\Delta`)" msgstr "" msgid "The algorithm tries to assign the least possible color to every edge." @@ -12715,8 +10835,7 @@ msgstr "" msgid "Does not always produce optimal coloring." msgstr "" -msgid "" -"The returned rows are ordered in ascending order of the edge identifier." +msgid "The returned rows are ordered in ascending order of the edge identifier." msgstr "" msgid "Efficient graph coloring is an NP-Hard problem, and therefore:" @@ -12737,26 +10856,19 @@ msgstr "" msgid "Graph coloring of pgRouting :doc:`sampledata`" msgstr "" -msgid "" -"`Boost: Edge Coloring `__" +msgid "`Boost: Edge Coloring `__" msgstr "" -msgid "" -"`Wikipedia: Graph coloring `__" +msgid "`Wikipedia: Graph coloring `__" msgstr "" -msgid "" -"``pgr_edgeDisjointPaths`` — Calculates edge disjoint paths between two " -"groups of vertices." +msgid "``pgr_edgeDisjointPaths`` — Calculates edge disjoint paths between two groups of vertices." msgstr "" msgid "pgr_edgeDisjointPaths(Combinations)" msgstr "" -msgid "" -"Calculates the edge disjoint paths between two groups of vertices. Utilizes " -"underlying maximum flow algorithms to calculate the paths." +msgid "Calculates the edge disjoint paths between two groups of vertices. Utilizes underlying maximum flow algorithms to calculate the paths." msgstr "" msgid "The main characterics are:" @@ -12765,9 +10877,7 @@ msgstr "" msgid "Calculates the edge disjoint paths between any two groups of vertices." msgstr "" -msgid "" -"Returns EMPTY SET when source and destination are the same, or cannot be " -"reached." +msgid "Returns EMPTY SET when source and destination are the same, or cannot be reached." msgstr "" msgid "The graph can be directed or undirected." @@ -12776,34 +10886,22 @@ msgstr "" msgid "Uses :doc:`pgr_boykovKolmogorov` to calculate the paths." msgstr "" -msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, " -"[``directed``])" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vids**, " -"[``directed``])" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vid**, " -"[``directed``])" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid "" -"Using a combinations table, equivalent to calculating result from vertices :" -"math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}` on an undirected " -"graph." +msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}` on an undirected graph." msgstr "" msgid "Manually assigned vertex combinations on an undirected graph." @@ -12812,9 +10910,7 @@ msgstr "" msgid "``pgr_edmondsKarp``" msgstr "" -msgid "" -"``pgr_edmondsKarp`` — Calculates the flow on the graph edges that maximizes " -"the flow from the sources to the targets using Edmonds Karp Algorithm." +msgid "``pgr_edmondsKarp`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Edmonds Karp Algorithm." msgstr "" msgid "pgr_edmondsKarp(Combinations)" @@ -12841,9 +10937,7 @@ msgstr "" msgid "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -msgid "" -"`Boost: Edmonds Karp max flow `__" +msgid "`Boost: Edmonds Karp max flow `__" msgstr "" msgid "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" @@ -12852,36 +10946,22 @@ msgstr "" msgid "``pgr_edwardMoore`` - Experimental" msgstr "" -msgid "" -"``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore algorithm." +msgid "``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore algorithm." msgstr "" -msgid "" -"Edward Moore’s Algorithm is an improvement of the Bellman-Ford Algorithm. It " -"can compute the shortest paths from a single source vertex to all other " -"vertices in a weighted directed graph. The main difference between Edward " -"Moore's Algorithm and Bellman Ford's Algorithm lies in the run time." +msgid "Edward Moore’s Algorithm is an improvement of the Bellman-Ford Algorithm. It can compute the shortest paths from a single source vertex to all other vertices in a weighted directed graph. The main difference between Edward Moore's Algorithm and Bellman Ford's Algorithm lies in the run time." msgstr "" -msgid "" -"The worst-case running time of the algorithm is :math:`O(| V | * | E |)` " -"similar to the time complexity of Bellman-Ford algorithm. However, " -"experiments suggest that this algorithm has an average running time " -"complexity of :math:`O( | E | )` for random graphs. This is significantly " -"faster in terms of computation speed." +msgid "The worst-case running time of the algorithm is :math:`O(| V | * | E |)` similar to the time complexity of Bellman-Ford algorithm. However, experiments suggest that this algorithm has an average running time complexity of :math:`O( | E | )` for random graphs. This is significantly faster in terms of computation speed." msgstr "" -msgid "" -"Thus, the algorithm is at-best, significantly faster than Bellman-Ford " -"algorithm and is at-worst,as good as Bellman-Ford algorithm" +msgid "Thus, the algorithm is at-best, significantly faster than Bellman-Ford algorithm and is at-worst,as good as Bellman-Ford algorithm" msgstr "" msgid "The `agg_cost` the non included values `(v, v)` is :math:`0`" msgstr "" -msgid "" -"For optimization purposes, any duplicated value in the `start vids` or `end " -"vids` are ignored." +msgid "For optimization purposes, any duplicated value in the `start vids` or `end vids` are ignored." msgstr "" msgid "Running time:" @@ -12893,20 +10973,16 @@ msgstr "" msgid "Average case: :math:`O( | E | )`" msgstr "" -msgid "" -"pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "" -"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" msgid "pgr_edwardMoore(`Edges SQL`_, `Combinations SQL`_, [``directed``])" @@ -12924,14 +11000,10 @@ msgstr "" msgid "``pgr_extractVertices`` — Extracts the vertices information" msgstr "" -msgid "" -"This is an auxiliary function for extracting the vertex information of the " -"set of edges of a graph." +msgid "This is an auxiliary function for extracting the vertex information of the set of edges of a graph." msgstr "" -msgid "" -"When the edge identifier is given, then it will also calculate the in and " -"out edges" +msgid "When the edge identifier is given, then it will also calculate the in and out edges" msgstr "" msgid "pgr_extractVertices(`Edges SQL`_, [``dryrun``])" @@ -12955,9 +11027,7 @@ msgstr "" msgid "Geometry of the edge." msgstr "" -msgid "" -"This inner query takes precedence over the next two inner query, therefore " -"other columns are ignored when ``geom`` column appears." +msgid "This inner query takes precedence over the next two inner query, therefore other columns are ignored when ``geom`` column appears." msgstr "" msgid "Ignored columns:" @@ -12972,9 +11042,7 @@ msgstr "" msgid "When vertex geometry is known" msgstr "" -msgid "" -"To use this inner query the column ``geom`` should not be part of the set of " -"columns." +msgid "To use this inner query the column ``geom`` should not be part of the set of columns." msgstr "" msgid "``POINT``" @@ -12986,17 +11054,13 @@ msgstr "" msgid "POINT geometry of the ending vertex." msgstr "" -msgid "" -"This inner query takes precedence over the next inner query, therefore other " -"columns are ignored when ``startpoint`` and ``endpoint`` columns appears." +msgid "This inner query takes precedence over the next inner query, therefore other columns are ignored when ``startpoint`` and ``endpoint`` columns appears." msgstr "" msgid "When identifiers of vertices are known" msgstr "" -msgid "" -"To use this inner query the columns ``geom``, ``startpoint`` and " -"``endpoint`` should not be part of the set of columns." +msgid "To use this inner query the columns ``geom``, ``startpoint`` and ``endpoint`` should not be part of the set of columns." msgstr "" msgid "``NULL`` When the ``id`` is not part of the inner query" @@ -13011,9 +11075,7 @@ msgstr "" msgid "Geometry of the point" msgstr "" -msgid "" -"To get the query generated used to get the vertex information, use ``dryrun :" -"= true``." +msgid "To get the query generated used to get the vertex information, use ``dryrun := true``." msgstr "" msgid "Create a routing topology" @@ -13025,8 +11087,7 @@ msgstr "" msgid "Clean up the columns of the routing topology to be created" msgstr "" -msgid "" -"When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, )``" +msgid "When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, )``" msgstr "" msgid "For big edge tables that are been prepared," @@ -13065,29 +11126,22 @@ msgstr "" msgid "``partial`` option is removed." msgstr "" -msgid "" -"``pgr_findCloseEdges`` - An utility function that finds the closest edge to " -"a point geometry." +msgid "``pgr_findCloseEdges`` - An utility function that finds the closest edge to a point geometry." msgstr "" -msgid "" -"The geometries must be in the same coordinate system (have the same SRID)." +msgid "The geometries must be in the same coordinate system (have the same SRID)." msgstr "" -msgid "" -"The code to do the calculations can be obtained for further specific " -"adjustments needed by the application." +msgid "The code to do the calculations can be obtained for further specific adjustments needed by the application." msgstr "" msgid "``EMPTY SET`` is returned on dryrun executions" msgstr "" -msgid "" -"pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" +msgid "pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" msgstr "" -msgid "" -"pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" +msgid "pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" msgstr "" msgid "**options:** ``[cap, dryrun]``" @@ -13138,9 +11192,7 @@ msgstr "" msgid "When ``false`` calculations are performed." msgstr "" -msgid "" -"When ``true`` calculations are not performed and the query to do the " -"calculations is exposed in a PostgreSQL ``NOTICE``." +msgid "When ``true`` calculations are not performed and the query to do the calculations is exposed in a PostgreSQL ``NOTICE``." msgstr "" msgid "``geometry``" @@ -13153,12 +11205,8 @@ msgid "When :math:`cap = 1`, it is the closest edge." msgstr "" #, fuzzy -msgid "" -"Value in <0,1> that indicates the relative position from the first end-point " -"of the edge." -msgstr "" -":math:`path\\_seq' は、:math:'node' または :math:'edge' の経路内の相対位置を" -"示しています。" +msgid "Value in <0,1> that indicates the relative position from the first end-point of the edge." +msgstr ":math:`path\\_seq' は、:math:'node' または :math:'edge' の経路内の相対位置を示しています。" msgid "Value in ``[r, l]`` indicating if the point is:" msgstr "" @@ -13181,9 +11229,7 @@ msgstr "" msgid "Original ``POINT`` geometry." msgstr "" -msgid "" -"``LINESTRING`` geometry that connects the original **point** to the closest " -"point of the edge with identifier ``edge_id``" +msgid "``LINESTRING`` geometry that connects the original **point** to the closest point of the edge with identifier ``edge_id``" msgstr "" msgid "One point in an edge" @@ -13195,9 +11241,7 @@ msgstr "" msgid "``geom`` has the value of the original point." msgstr "" -msgid "" -"The geometry ``edge`` is a line that connects the original point with the " -"edge :math:`sp \\rightarrow ep` edge." +msgid "The geometry ``edge`` is a line that connects the original point with the edge :math:`sp \\rightarrow ep` edge." msgstr "" msgid "The point is located at the left of the edge." @@ -13218,9 +11262,7 @@ msgstr "" msgid "Generates a PostgreSQL ``NOTICE`` with the code used." msgstr "" -msgid "" -"The generated code can be used as a starting base code for additional " -"requirements, like taking into consideration the SRID." +msgid "The generated code can be used as a starting base code for additional requirements, like taking into consideration the SRID." msgstr "" msgid "Many points in an edge" @@ -13229,15 +11271,10 @@ msgstr "" msgid "The green nodes are the **original points**" msgstr "" -msgid "" -"The geometry ``geom``, marked as **g1** and **g2** are the **original " -"points**" +msgid "The geometry ``geom``, marked as **g1** and **g2** are the **original points**" msgstr "" -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." +msgid "The geometry ``edge``, marked as **edge1** and **edge2** is a line that connects the **original point** with the closest point on the :math:`sp \\rightarrow ep` edge." msgstr "" msgid "Many points dry run execution" @@ -13246,8 +11283,7 @@ msgstr "" msgid "Do not process query" msgstr "" -msgid "" -"Generate a PostgreSQL ``NOTICE`` with the code used to calculate all columns" +msgid "Generate a PostgreSQL ``NOTICE`` with the code used to calculate all columns" msgstr "" msgid "Find at most two routes to a given point" @@ -13265,20 +11301,13 @@ msgstr "" msgid "Points of interest" msgstr "" -msgid "" -"Some times the applications work \"on the fly\" starting from a location " -"that is not a vertex in the graph. Those locations, in pgRrouting are called " -"points of interest." +msgid "Some times the applications work \"on the fly\" starting from a location that is not a vertex in the graph. Those locations, in pgRrouting are called points of interest." msgstr "" -msgid "" -"The information needed in the points of interest is ``pid``, ``edge_id``, " -"``side``, ``fraction``." +msgid "The information needed in the points of interest is ``pid``, ``edge_id``, ``side``, ``fraction``." msgstr "" -msgid "" -"On this documentation there will be some 6 fixed points of interest and they " -"will be stored on a table." +msgid "On this documentation there will be some 6 fixed points of interest and they will be stored on a table." msgstr "" msgid "A unique identifier." @@ -13300,9 +11329,7 @@ msgstr "" msgid "The distance between ``geom`` and the segment ``edge_id``." msgstr "" -msgid "" -"A segment that connects the ``geom`` of the point to the closest point on " -"the segment ``edge_id``." +msgid "A segment that connects the ``geom`` of the point to the closest point on the segment ``edge_id``." msgstr "" msgid "``newPoint``" @@ -13320,9 +11347,7 @@ msgstr "" 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." +msgid "Any other additional modification: In this manual, point :math:`6` can be reached from both sides." msgstr "" msgid "The points of interest:" @@ -13331,16 +11356,10 @@ msgstr "" msgid "``pgr_floydWarshall``" msgstr "" -msgid "" -"``pgr_floydWarshall`` - Returns the sum of the costs of the shortest path " -"for each pair of nodes in the graph using Floyd-Warshall algorithm." +msgid "``pgr_floydWarshall`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Floyd-Warshall algorithm." msgstr "" -msgid "" -"The Floyd-Warshall algorithm, also known as Floyd's algorithm, is a good " -"choice to calculate the sum of the costs of the shortest path for each pair " -"of nodes in the graph, for *dense graphs*. We use Boost's implementation " -"which runs in :math:`\\Theta(V^3)` time," +msgid "The Floyd-Warshall algorithm, also known as Floyd's algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *dense graphs*. We use Boost's implementation which runs in :math:`\\Theta(V^3)` time," msgstr "" msgid "pgr_floydWarshall(`Edges SQL`_, [``directed``])" @@ -13349,16 +11368,13 @@ msgstr "" msgid "For a directed subgraph with edges :math:`\\{1, 2, 3, 4\\}`." msgstr "" -msgid "" -"Boost `Floyd-Warshall `_" +msgid "Boost `Floyd-Warshall `_" msgstr "" msgid "``pgr_full_version``" msgstr "" -msgid "" -"``pgr_full_version`` — Get the details of pgRouting version information." +msgid "``pgr_full_version`` — Get the details of pgRouting version information." msgstr "" msgid "Get complete details of pgRouting version information" @@ -13430,27 +11446,13 @@ msgstr "" msgid "``pgr_hawickCircuits`` - Experimental" msgstr "" -msgid "" -"``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits " -"algorithm." +msgid "``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits algorithm." msgstr "" -msgid "" -"Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. " -"James. This algorithm solves the problem of detecting and enumerating " -"circuits in graphs. It is capable of circuit enumeration in graphs with " -"directed-arcs, multiple-arcs and self-arcs with a memory efficient and high-" -"performance im-plementation. It is an extension of Johnson's Algorithm of " -"finding all the elementary circuits of a directed graph." +msgid "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. James. This algorithm solves the problem of detecting and enumerating circuits in graphs. It is capable of circuit enumeration in graphs with directed-arcs, multiple-arcs and self-arcs with a memory efficient and high-performance im-plementation. It is an extension of Johnson's Algorithm of finding all the elementary circuits of a directed graph." msgstr "" -msgid "" -"There are 2 variations defined in the Boost Graph Library. Here, we have " -"implemented only 2nd as it serves the most suitable and practical usecase. " -"In this variation we get the circuits after filtering out the circuits " -"caused by parallel edges. Parallel edge circuits have more use cases when " -"you want to count the no. of circuits.Maybe in future, we will also " -"implemenent this variation." +msgid "There are 2 variations defined in the Boost Graph Library. Here, we have implemented only 2nd as it serves the most suitable and practical usecase. In this variation we get the circuits after filtering out the circuits caused by parallel edges. Parallel edge circuits have more use cases when you want to count the no. of circuits.Maybe in future, we will also implemenent this variation." msgstr "" msgid "The algorithm implementation works only for directed graph" @@ -13477,8 +11479,7 @@ msgstr "" msgid "Id of the circuit starting from ``1``" msgstr "" -msgid "" -"Relative position in the path. Has value ``0`` for beginning of the path" +msgid "Relative position in the path. Has value ``0`` for beginning of the path" msgstr "" #, fuzzy @@ -13492,32 +11493,22 @@ msgstr "終了ノードの識別子。" msgid "Identifier of the node in the path from a vid to next vid." msgstr "" -msgid "" -"`Boost: Hawick Circuit Algorithm `__" +msgid "`Boost: Hawick Circuit Algorithm `__" msgstr "" msgid "``pgr_isPlanar`` - Experimental" msgstr "" -msgid "" -"``pgr_isPlanar`` — Returns a boolean depending upon the planarity of the " -"graph." +msgid "``pgr_isPlanar`` — Returns a boolean depending upon the planarity of the graph." msgstr "" -msgid "" -"A graph is planar if it can be drawn in two-dimensional space with no two of " -"its edges crossing. Such a drawing of a planar graph is called a plane " -"drawing. Every planar graph also admits a straight-line drawing, which is a " -"plane drawing where each edge is represented by a line segment. When a graph " -"has :math:`K_5` or :math:`K_{3, 3}` as subgraph then the graph is not planar." +msgid "A graph is planar if it can be drawn in two-dimensional space with no two of its edges crossing. Such a drawing of a planar graph is called a plane drawing. Every planar graph also admits a straight-line drawing, which is a plane drawing where each edge is represented by a line segment. When a graph has :math:`K_5` or :math:`K_{3, 3}` as subgraph then the graph is not planar." msgstr "" msgid "This implementation use the Boyer-Myrvold Planarity Testing." msgstr "" -msgid "" -"It will return a boolean value depending upon the planarity of the graph." +msgid "It will return a boolean value depending upon the planarity of the graph." msgstr "" msgid "Applicable only for **undirected** graphs." @@ -13547,74 +11538,49 @@ msgstr "" msgid "`false` when the graph is not planar." msgstr "" -msgid "" -"The following edges will make the subgraph with vertices {10, 15, 11, 16, " -"13} a :math:`K_1` graph." +msgid "The following edges will make the subgraph with vertices {10, 15, 11, 16, 13} a :math:`K_1` graph." msgstr "" -msgid "" -"The new graph is not planar because it has a :math:`K_5` subgraph. Edges in " -"blue represent :math:`K_5` subgraph." +msgid "The new graph is not planar because it has a :math:`K_5` subgraph. Edges in blue represent :math:`K_5` subgraph." msgstr "" -msgid "" -"`Boost: Boyer Myrvold `__" +msgid "`Boost: Boyer Myrvold `__" msgstr "" msgid "``pgr_johnson``" msgstr "" #, fuzzy -msgid "" -"``pgr_johnson`` - Returns the sum of the costs of the shortest path for each " -"pair of nodes in the graph using Johnson algorithm." +msgid "``pgr_johnson`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Johnson algorithm." msgstr ":doc:`pgr_dijkstraCost` - 最短経路の総コストを集計します。" -msgid "" -"The Johnson algorithm, is a good choice to calculate the sum of the costs of " -"the shortest path for each pair of nodes in the graph, for *sparse graphs*. " -"It uses the Boost's implementation which runs in :math:`O(V E \\log V)` time," +msgid "The Johnson algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *sparse graphs*. It uses the Boost's implementation which runs in :math:`O(V E \\log V)` time," msgstr "" msgid "pgr johnson(`Edges SQL`_, [``directed``])" msgstr "" -msgid "" -"Boost `Johnson `_" +msgid "Boost `Johnson `_" msgstr "" #, fuzzy msgid "``pgr_kingOrdering`` - Experimental" msgstr "p" -msgid "" -"``pgr_kingOrdering`` — Returns the King ordering of an undirected graph." +msgid "``pgr_kingOrdering`` — Returns the King ordering of an undirected graph." msgstr "" -msgid "" -"In numerical linear algebra and graph theory, the King ordering algorithm is " -"a heuristic designed to reorder the vertices of a graph so as to reduce its " -"bandwidth." +msgid "In numerical linear algebra and graph theory, the King ordering algorithm is a heuristic designed to reorder the vertices of a graph so as to reduce its bandwidth." msgstr "" -msgid "" -"The method follows a breadth-first search (BFS) traversal, but with a " -"refinement: at each step, the unvisited neighbors of the current vertex are " -"inserted into the queue in ascending order of their pseudo-degree, where the " -"pseudo-degree of a vertex is the number of edges connecting it to yet-" -"unvisited vertices. This prioritization often yields a smaller bandwidth " -"compared to simpler BFS orderings." +msgid "The method follows a breadth-first search (BFS) traversal, but with a refinement: at each step, the unvisited neighbors of the current vertex are inserted into the queue in ascending order of their pseudo-degree, where the pseudo-degree of a vertex is the number of edges connecting it to yet-unvisited vertices. This prioritization often yields a smaller bandwidth compared to simpler BFS orderings." msgstr "" #, fuzzy msgid "The implementation targets undirected graphs." msgstr "実装は**undirected**グラフのみです。" -msgid "" -"Bandwidth minimization is an NP-complete problem; King ordering provides a " -"practical local minimization approach." +msgid "Bandwidth minimization is an NP-complete problem; King ordering provides a practical local minimization approach." msgstr "" msgid "The time complexity is: :math:`O(m^2 \\log(m)|E|)`" @@ -13630,21 +11596,16 @@ msgstr "" msgid "pgr_kingOrdering(`Edges SQL`_)" msgstr "p" -msgid "" -"`Boost: King Ordering `__" +msgid "`Boost: King Ordering `__" msgstr "" msgid "``pgr_kruskal``" msgstr "" -msgid "" -"``pgr_kruskal`` — Minimum spanning tree of a graph using Kruskal's algorithm." +msgid "``pgr_kruskal`` — Minimum spanning tree of a graph using Kruskal's algorithm." msgstr "" -msgid "" -"This algorithm finds the minimum spanning forest in a possibly disconnected " -"graph using Kruskal's algorithm." +msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Kruskal's algorithm." msgstr "" msgid "EMPTY SET is returned when there are no edges in the graph." @@ -13659,17 +11620,13 @@ msgstr "" msgid "Minimum spanning forest" msgstr "" -msgid "" -"``pgr_kruskalBFS`` — Kruskal's algorithm for Minimum Spanning Tree with " -"breadth First Search ordering." +msgid "``pgr_kruskalBFS`` — Kruskal's algorithm for Minimum Spanning Tree with breadth First Search ordering." msgstr "" msgid "Added ``pred`` result columns." msgstr "" -msgid "" -"Visits and extracts the nodes information in Breath First Search ordering of " -"the Minimum Spanning Tree created using Kruskal's algorithm." +msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." msgstr "" msgid "Returned tree nodes from a root vertex are on Breath First Search order" @@ -13687,18 +11644,13 @@ msgstr "" msgid "The Minimum Spanning Tree having as root vertex :math:`6`" msgstr "" -msgid "" -"The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:" -"`depth \\leq 3`" +msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`depth \\leq 3`" msgstr "" msgid "``pgr_kruskalDD`` — Catchament nodes using Kruskal's algorithm." msgstr "" -msgid "" -"Using Kruskal's algorithm, extracts the nodes that have aggregate costs less " -"than or equal to a **distance** from a **root** vertex (or vertices) within " -"the calculated minimum spanning tree." +msgid "Using Kruskal's algorithm, extracts the nodes that have aggregate costs less than or equal to a **distance** from a **root** vertex (or vertices) within the calculated minimum spanning tree." msgstr "" msgid "Returned tree nodes from a root vertex are on Depth First Search order." @@ -13713,24 +11665,16 @@ msgstr "" msgid "pgr_kruskalDD(`Edges SQL`_, **root vids**, **distance**)" msgstr "" -msgid "" -"The Minimum Spanning Tree starting on vertex :math:`6` with :math:`distance " -"\\leq 3.5`" +msgid "The Minimum Spanning Tree starting on vertex :math:`6` with :math:`distance \\leq 3.5`" msgstr "" -msgid "" -"The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:" -"`distance \\leq 3.5`" +msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`distance \\leq 3.5`" msgstr "" -msgid "" -"``pgr_kruskalDFS`` — Kruskal's algorithm for Minimum Spanning Tree with " -"Depth First Search ordering." +msgid "``pgr_kruskalDFS`` — Kruskal's algorithm for Minimum Spanning Tree with Depth First Search ordering." msgstr "" -msgid "" -"Visits and extracts the nodes information in Depth First Search ordering of " -"the Minimum Spanning Tree created using Kruskal's algorithm." +msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." msgstr "" msgid "Returned tree nodes from a root vertex are on Depth First Search order" @@ -13745,15 +11689,10 @@ msgstr "" msgid "``pgr_lengauerTarjanDominatorTree`` - Experimental" msgstr "" -msgid "" -"``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all " -"vertices." +msgid "``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all vertices." msgstr "" -msgid "" -"The algorithm calculates the *immediate dominator* of each vertex called " -"**idom**, once **idom** of each vertex is calculated then by making every " -"**idom** of each vertex as its parent, the dominator tree can be built." +msgid "The algorithm calculates the *immediate dominator* of each vertex called **idom**, once **idom** of each vertex is calculated then by making every **idom** of each vertex as its parent, the dominator tree can be built." msgstr "" msgid "The algorithm works in directed graph only." @@ -13762,8 +11701,7 @@ msgstr "" msgid "The algorithm returns *idom* of each vertex." msgstr "" -msgid "" -"If the *root vertex* not present in the graph then it returns empty set." +msgid "If the *root vertex* not present in the graph then it returns empty set." msgstr "" msgid "Running time: :math:`O((V+E)log(V+E))`" @@ -13802,51 +11740,38 @@ msgstr "" msgid "Dominator tree of another component." msgstr "" -msgid "" -"`Boost: Lengauer-Tarjan dominator `__" +msgid "`Boost: Lengauer-Tarjan dominator `__" msgstr "" -msgid "" -"`Wikipedia: dominator tree `__" +msgid "`Wikipedia: dominator tree `__" msgstr "" msgid "``pgr_lineGraph`` - Proposed" msgstr "" -msgid "" -"``pgr_lineGraph`` — Transforms the given graph into its corresponding edge-" -"based graph." +msgid "``pgr_lineGraph`` — Transforms the given graph into its corresponding edge-based graph." msgstr "" #, 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:" +msgid "Given a graph :math:`G`, its line graph :math:`L(G)` is a graph such that:" msgstr "" msgid "Each vertex of :math:`L(G)` represents an edge of :math:`G`." msgstr "" -msgid "" -"Two vertices of :math:`L(G)` are adjacent if and only if their corresponding " -"edges share a common endpoint in :math:`G`" +msgid "Two vertices of :math:`L(G)` are adjacent if and only if their corresponding edges share a common endpoint in :math:`G`" msgstr "" -msgid "" -"The ``cost`` and ``reverse_cost`` columns of the result represent existence " -"of the edge." +msgid "The ``cost`` and ``reverse_cost`` columns of the result represent existence of the edge." msgstr "" msgid "When the graph is directed the result is directed." msgstr "" -msgid "" -"To get the complete Line Graph use unique identifiers on the double way " -"edges (See `Additional Examples`_)." +msgid "To get the complete Line Graph use unique identifiers on the double way edges (See `Additional Examples`_)." msgstr "" msgid "When the graph is undirected the result is undirected." @@ -13876,35 +11801,26 @@ msgstr "" msgid "Weight of the edge (``source``, ``target``)." msgstr "" -msgid "" -"When `negative`: edge (``source``, ``target``) does not exist, therefore " -"it’s not part of the graph." +msgid "When `negative`: edge (``source``, ``target``) does not exist, therefore it’s not part of the graph." msgstr "" msgid "Weight of the edge (``target``, ``source``)." msgstr "" -msgid "" -"When `negative`: edge (``target``, ``source``) does not exist, therefore " -"it’s not part of the graph." +msgid "When `negative`: edge (``target``, ``source``) does not exist, therefore it’s not part of the graph." msgstr "" #, fuzzy msgid "Given the following directed graph" 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\\})`" +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 "" msgid "Representation as directed with shared edge identifiers" msgstr "" -msgid "" -"For the simplicity, the design of the edges table on the database, has the " -"edge's identifiers are represented with 3 digits:" +msgid "For the simplicity, the design of the edges table on the database, has the edge's identifiers are represented with 3 digits:" msgstr "" msgid "hundreds" @@ -13928,26 +11844,19 @@ msgstr "" msgid "In this image," msgstr "" -msgid "" -"Single or double head arrows represent one edge (row) on the edges table." +msgid "Single or double head arrows represent one edge (row) on the edges table." msgstr "" msgid "The numbers in the yellow shadow are the edge identifiers." msgstr "" -msgid "" -"Two pair of edges share the same identifier when the ``reverse_cost`` column " -"is used." +msgid "Two pair of edges share the same identifier when the ``reverse_cost`` column is used." msgstr "" -msgid "" -"Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with one " -"edge row with :math:`id=203`." +msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with one edge row with :math:`id=203`." msgstr "" -msgid "" -"Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with one " -"edge row with :math:`id=304`." +msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with one edge row with :math:`id=304`." msgstr "" #, fuzzy @@ -13961,15 +11870,13 @@ msgstr "" msgid "The result is a directed graph." msgstr "導かれないグラフ。" -msgid "" -"For :math:`seq=4` from :math:`203 \\leftrightarrow 304` represent two edges" +msgid "For :math:`seq=4` from :math:`203 \\leftrightarrow 304` represent two edges" msgstr "" msgid "For all the other values of ``seq`` represent one edge." msgstr "" -msgid "" -"The ``cost`` and ``reverse_cost`` values represent the existence of the edge." +msgid "The ``cost`` and ``reverse_cost`` values represent the existence of the edge." msgstr "" msgid "When positive: the edge exists." @@ -13987,88 +11894,62 @@ msgstr "" msgid "There are no double head arrows" msgstr "" -msgid "" -"Two pair of edges share the same ending nodes and the ``reverse_cost`` " -"column is not used." +msgid "Two pair of edges share the same ending nodes and the ``reverse_cost`` column is not used." msgstr "" -msgid "" -"Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with two " -"edges :math:`id=203` and :math:`id=302` respectively." +msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with two edges :math:`id=203` and :math:`id=302` respectively." msgstr "" -msgid "" -"Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with two " -"edges :math:`id=304` and :math:`id=403` respectively." +msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with two edges :math:`id=304` and :math:`id=403` respectively." msgstr "" msgid "Line Graph of a directed graph represented with unique edges" msgstr "" -msgid "" -"For :math:`seq=7` from :math:`203 \\leftrightarrow 302` represent two edges." +msgid "For :math:`seq=7` from :math:`203 \\leftrightarrow 302` represent two edges." msgstr "" -msgid "" -"For :math:`seq=8` from :math:`304 \\leftrightarrow 403` represent two edges." +msgid "For :math:`seq=8` from :math:`304 \\leftrightarrow 403` represent two edges." msgstr "" #, fuzzy msgid "wikipedia: `Line Graph `__" -msgstr "" -"`Wikipedia: 巡回セールスマン問題 `__" +msgstr "`Wikipedia: 巡回セールスマン問題 `__" -msgid "" -"mathworld: `Line Graph `__" +msgid "mathworld: `Line Graph `__" msgstr "" msgid "``pgr_lineGraphFull`` - Experimental" msgstr "" -msgid "" -"``pgr_lineGraphFull`` — Transforms a given graph into a new graph where all " -"of the vertices from the original graph are converted to line graphs." +msgid "``pgr_lineGraphFull`` — Transforms a given graph into a new graph where all of the vertices from the original graph are converted to line graphs." msgstr "" msgid "Version 2.6.0" msgstr "" -msgid "" -"``pgr_lineGraphFull``, converts original directed graph to a directed line " -"graph by converting each vertex to a complete graph and keeping all the " -"original edges. The new connecting edges have a cost 0 and go between the " -"adjacent original edges, respecting the directionality." +msgid "``pgr_lineGraphFull``, converts original directed graph to a directed line graph by converting each vertex to a complete graph and keeping all the original edges. The new connecting edges have a cost 0 and go between the adjacent original edges, respecting the directionality." msgstr "" -msgid "" -"A possible application of the resulting graph is **\"routing with two edge " -"restrictions\"**:" +msgid "A possible application of the resulting graph is **\"routing with two edge restrictions\"**:" msgstr "" -msgid "" -"Setting a cost of using the vertex when routing between edges on the " -"connecting edge" +msgid "Setting a cost of using the vertex when routing between edges on the connecting edge" msgstr "" msgid "Forbid the routing between two edges by removing the connecting edge" msgstr "" -msgid "" -"This is possible because each of the intersections (vertices) in the " -"original graph are now complete graphs that have a new edge for each " -"possible turn across that intersection." +msgid "This is possible because each of the intersections (vertices) in the original graph are now complete graphs that have a new edge for each possible turn across that intersection." msgstr "" msgid "This function is for **directed** graphs." msgstr "" -msgid "" -"Results are undefined when a negative vertex id is used in the input graph." +msgid "Results are undefined when a negative vertex id is used in the input graph." msgstr "" -msgid "" -"Results are undefined when a duplicated edge id is used in the input graph." +msgid "Results are undefined when a duplicated edge id is used in the input graph." msgstr "" msgid "Running time: TBD" @@ -14083,17 +11964,13 @@ msgstr "" msgid "Full line graph of subgraph of edges :math:`\\{4, 7, 8, 10\\}`" msgstr "" -msgid "" -"The examples include the subgraph including edges 4, 7, 8, and 10 with " -"``reverse_cost``." +msgid "The examples include the subgraph including edges 4, 7, 8, and 10 with ``reverse_cost``." msgstr "" msgid "The data" msgstr "" -msgid "" -"This example displays how this graph transformation works to create " -"additional edges for each possible turn in a graph." +msgid "This example displays how this graph transformation works to create additional edges for each possible turn in a graph." msgstr "" msgid "|first|" @@ -14111,36 +11988,22 @@ msgstr "" msgid "second" msgstr "" -msgid "" -"In the transformed graph, all of the edges from the original graph are still " -"present (yellow), but we now have additional edges for every turn that could " -"be made across vertex 7 (orange)." +msgid "In the transformed graph, all of the edges from the original graph are still present (yellow), but we now have additional edges for every turn that could be made across vertex 7 (orange)." msgstr "" msgid "Creating table that identifies transformed vertices" msgstr "" -msgid "" -"The vertices in the transformed graph are each created by splitting up the " -"vertices in the original graph. Unless a vertex in the original graph is a " -"leaf vertex, it will generate more than one vertex in the transformed graph. " -"One of the newly created vertices in the transformed graph will be given the " -"same vertex identifier as the vertex that it was created from in the " -"original graph, but the rest of the newly created vertices will have " -"negative vertex ids." +msgid "The vertices in the transformed graph are each created by splitting up the vertices in the original graph. Unless a vertex in the original graph is a leaf vertex, it will generate more than one vertex in the transformed graph. One of the newly created vertices in the transformed graph will be given the same vertex identifier as the vertex that it was created from in the original graph, but the rest of the newly created vertices will have negative vertex ids." msgstr "" -msgid "" -"Following is an example of how to generate a table that maps the ids of the " -"newly created vertices with the original vertex that they were created from" +msgid "Following is an example of how to generate a table that maps the ids of the newly created vertices with the original vertex that they were created from" msgstr "" msgid "Store edge results" msgstr "" -msgid "" -"The first step is to store the results of the ``pgr_lineGraphFull`` call " -"into a table" +msgid "The first step is to store the results of the ``pgr_lineGraphFull`` call into a table" msgstr "" msgid "Create the mapping table" @@ -14161,9 +12024,7 @@ msgstr "" msgid "Inspecting the vertices map" msgstr "" -msgid "" -"The self loops happen when there is no cost traveling to the ``target`` and " -"the source has an original value." +msgid "The self loops happen when there is no cost traveling to the ``target`` and the source has an original value." msgstr "" msgid "Updating values from self loops" @@ -14178,23 +12039,17 @@ msgstr "" msgid "Adding a soft restriction" msgstr "" -msgid "" -"A soft restriction going from vertex 6 to vertex 3 using edges 4 -> 7 is " -"wanted." +msgid "A soft restriction going from vertex 6 to vertex 3 using edges 4 -> 7 is wanted." msgstr "" #, fuzzy msgid "Identifying the restriction" msgstr "開始ノードの識別子。" -msgid "" -"Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where the " -"cost will be increased" +msgid "Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where the cost will be increased" msgstr "" -msgid "" -"The edge to be altered is ``WHERE cost = 0 AND seq != 1 AND edge != -1`` " -"from the previous query:" +msgid "The edge to be altered is ``WHERE cost = 0 AND seq != 1 AND edge != -1`` from the previous query:" msgstr "" msgid "Adding a value to the restriction" @@ -14212,8 +12067,7 @@ msgstr "" msgid "Simplifying leaf vertices" msgstr "" -msgid "" -"In this example, there is no additional cost for traversing a leaf vertex." +msgid "In this example, there is no additional cost for traversing a leaf vertex." msgstr "" msgid "Using the vertex map give the leaf verices their original value." @@ -14234,9 +12088,7 @@ msgstr "" msgid "Which can be removed" msgstr "" -msgid "" -"Routing can be done now using the original vertices id using :doc:" -"`pgr_dijkstra`" +msgid "Routing can be done now using the original vertices id using :doc:`pgr_dijkstra`" msgstr "" msgid "Complete routing graph" @@ -14245,9 +12097,7 @@ msgstr "" msgid "Add edges from the original graph" msgstr "" -msgid "" -"Add all the edges that are not involved in the line graph process to the new " -"table" +msgid "Add all the edges that are not involved in the line graph process to the new table" msgstr "" msgid "Some administrative tasks to get new identifiers for the edges" @@ -14259,9 +12109,7 @@ msgstr "" msgid "Using the routing graph" msgstr "" -msgid "" -"When using this method for routing with soft restrictions there will be " -"uturns" +msgid "When using this method for routing with soft restrictions there will be uturns" msgstr "" msgid "Routing from :math:`5` to :math:`1`" @@ -14279,23 +12127,13 @@ msgstr "" msgid "``pgr_makeConnected`` — Set of edges that will connect the graph." msgstr "" -msgid "" -"Adds the minimum number of edges needed to make the input graph connected. " -"The algorithm first identifies all of the connected components in the graph, " -"then adds edges to connect those components together in a path. For example, " -"if a graph contains three connected components A, B, and C, make_connected " -"will add two edges. The two edges added might consist of one connecting a " -"vertex in A with a vertex in B and one connecting a vertex in B with a " -"vertex in C." +msgid "Adds the minimum number of edges needed to make the input graph connected. The algorithm first identifies all of the connected components in the graph, then adds edges to connect those components together in a path. For example, if a graph contains three connected components A, B, and C, make_connected will add two edges. The two edges added might consist of one connecting a vertex in A with a vertex in B and one connecting a vertex in B with a vertex in C." msgstr "" -msgid "" -"It will give a minimum list of all edges which are needed in the graph to " -"make connect it." +msgid "It will give a minimum list of all edges which are needed in the graph to make connect it." msgstr "" -msgid "" -"The algorithm does not considers geometric topology in the calculations." +msgid "The algorithm does not considers geometric topology in the calculations." msgstr "" msgid "pgr_makeConnected(`Edges SQL`_)" @@ -14307,17 +12145,13 @@ msgstr "" msgid "List of edges that are needed to connect the graph." msgstr "" -msgid "" -"`Boost: make connected `__" +msgid "`Boost: make connected `__" msgstr "" msgid "``pgr_maxCardinalityMatch``" msgstr "" -msgid "" -"``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a " -"graph." +msgid "``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a graph." msgstr "" msgid "pgr_maxCardinalityMatch(text) returns only ``edge`` column." @@ -14332,14 +12166,10 @@ msgstr "" msgid "Renamed from ``pgr_maximumCardinalityMatching``" msgstr "" -msgid "" -"A matching or independent edge set in a graph is a set of edges without " -"common vertices." +msgid "A matching or independent edge set in a graph is a set of edges without common vertices." msgstr "" -msgid "" -"A maximum matching is a matching that contains the largest possible number " -"of edges." +msgid "A maximum matching is a matching that contains the largest possible number of edges." msgstr "" msgid "There may be many maximum matchings." @@ -14360,26 +12190,19 @@ msgstr "" msgid "Using all edges." msgstr "" -msgid "" -"SQL query, which should return a set of rows with the following columns:" +msgid "SQL query, which should return a set of rows with the following columns:" msgstr "" -msgid "" -"A positive value represents the existence of the edge (``source``, " -"``target``)." +msgid "A positive value represents the existence of the edge (``source``, ``target``)." msgstr "" -msgid "" -"A positive value represents the existence of the edge (``target``, " -"``source``)" +msgid "A positive value represents the existence of the edge (``target``, ``source``)" msgstr "" msgid "Identifier of the edge in the original query." msgstr "" -msgid "" -"`Boost: maximum_matching `__" +msgid "`Boost: maximum_matching `__" msgstr "" msgid "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" @@ -14391,9 +12214,7 @@ msgstr "" msgid "``pgr_maxFlow``" msgstr "" -msgid "" -"``pgr_maxFlow`` — Calculates the maximum flow in a directed graph from the " -"source(s) to the targets(s) using the Push Relabel algorithm." +msgid "``pgr_maxFlow`` — Calculates the maximum flow in a directed graph from the source(s) to the targets(s) using the Push Relabel algorithm." msgstr "" msgid "pgr_maxFlow(Combinations)" @@ -14402,8 +12223,7 @@ msgstr "" msgid "Calculates the maximum flow from the sources to the targets." msgstr "" -msgid "" -"When the maximum flow is **0** then there is no flow and **0** is returned." +msgid "When the maximum flow is **0** then there is no flow and **0** is returned." msgstr "" msgid "Uses the :doc:`pgr_pushRelabel ` algorithm." @@ -14433,21 +12253,16 @@ msgstr "" msgid "Maximum flow possible from the source(s) to the target(s)" msgstr "" -msgid "" -"`Boost: push relabel max flow `__" +msgid "`Boost: push relabel max flow `__" msgstr "" -msgid "" -"https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" +msgid "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" msgstr "" msgid "``pgr_maxFlowMinCost`` - Experimental" msgstr "" -msgid "" -"``pgr_maxFlowMinCost`` — Calculates the edges that minimizes the total cost " -"of the maximum flow on a graph" +msgid "``pgr_maxFlowMinCost`` — Calculates the edges that minimizes the total cost of the maximum flow on a graph" msgstr "" msgid "pgr_maxFlowMinCost(Combinations)" @@ -14474,9 +12289,7 @@ msgstr "" msgid "where :math:`U` is the value of the max flow." msgstr "" -msgid "" -":math:`U` is upper bound on number of iterations. In many real world cases " -"number of iterations is much smaller than :math:`U`." +msgid ":math:`U` is upper bound on number of iterations. In many real world cases number of iterations is much smaller than :math:`U`." msgstr "" msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vid**)" @@ -14500,9 +12313,7 @@ msgstr "" msgid "``pgr_maxFlowMinCost_Cost`` - Experimental" msgstr "" -msgid "" -"``pgr_maxFlowMinCost_Cost`` — Calculates the minimum total cost of the " -"maximum flow on a graph" +msgid "``pgr_maxFlowMinCost_Cost`` — Calculates the minimum total cost of the maximum flow on a graph" msgstr "" msgid "pgr_maxFlowMinCost_Cost(Combinations)" @@ -14544,9 +12355,7 @@ msgstr "" msgid "``pgr_pickDeliver`` - Pickup and delivery Vehicle Routing Problem" msgstr "" -msgid "" -"Problem: Distribute and optimize the pickup-delivery pairs into a fleet of " -"vehicles." +msgid "Problem: Distribute and optimize the pickup-delivery pairs into a fleet of vehicles." msgstr "" msgid "Optimization problem is NP-hard." @@ -14603,16 +12412,13 @@ msgstr "" msgid "The speed, max_cycles, ma_capacity have illegal values" msgstr "" -msgid "" -"Six different initial will be optimized - the best solution found will be " -"result" +msgid "Six different initial will be optimized - the best solution found will be result" msgstr "" msgid "Signature" msgstr "" -msgid "" -"pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" +msgid "pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" msgstr "" msgid "**options:** ``[factor, max_cycles, initial_sol]``" @@ -14657,8 +12463,7 @@ msgstr "" msgid "``pgr_pickDeliverEuclidean`` - Experimental" msgstr "" -msgid "" -"``pgr_pickDeliverEuclidean`` - Pickup and delivery Vehicle Routing Problem" +msgid "``pgr_pickDeliverEuclidean`` - Pickup and delivery Vehicle Routing Problem" msgstr "" msgid "Replaces ``pgr_gsoc_vrppdtw``" @@ -14712,9 +12517,7 @@ msgstr "" msgid "[ end_x, end_y, end_open, end_close, end_service ]" msgstr "" -msgid "" -"This data example **lc101** is from data published at https://www.sintef.no/" -"projectweb/top/pdptw/li-lim-benchmark/" +msgid "This data example **lc101** is from data published at https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/" msgstr "" msgid "There are 25 vehicles in the problem all with the same characteristics." @@ -14723,9 +12526,7 @@ msgstr "" msgid "The original orders" msgstr "" -msgid "" -"The data comes in different rows for the pickup and the delivery of the same " -"order." +msgid "The data comes in different rows for the pickup and the delivery of the same order." msgstr "" msgid "The original data needs to be converted to an appropriate table:" @@ -14734,10 +12535,7 @@ msgstr "" msgid "The query" msgstr "" -msgid "" -"Showing only the relevant information to compare with the best solution " -"information published on https://www.sintef.no/projectweb/top/pdptw/100-" -"customers/" +msgid "Showing only the relevant information to compare with the best solution information published on https://www.sintef.no/projectweb/top/pdptw/100-customers/" msgstr "" msgid "The best solution found for **lc101** is a travel time: 828.94" @@ -14749,13 +12547,10 @@ msgstr "" msgid "``pgr_prim``" msgstr "" -msgid "" -"``pgr_prim`` — Minimum spanning forest of a graph using Prim's algorithm." +msgid "``pgr_prim`` — Minimum spanning forest of a graph using Prim's algorithm." msgstr "" -msgid "" -"This algorithm finds the minimum spanning forest in a possibly disconnected " -"graph using Prim's algorithm." +msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Prim's algorithm." msgstr "" msgid "Prim's running time: :math:`O(E * log V)`" @@ -14767,19 +12562,13 @@ msgstr "" msgid "Minimum spanning forest of a subgraph" msgstr "" -msgid "" -"`Boost: Prim's algorithm documentation `__" +msgid "`Boost: Prim's algorithm documentation `__" msgstr "" -msgid "" -"``pgr_primBFS`` — Prim's algorithm for Minimum Spanning Tree with Depth " -"First Search ordering." +msgid "``pgr_primBFS`` — Prim's algorithm for Minimum Spanning Tree with Depth First Search ordering." msgstr "" -msgid "" -"Visits and extracts the nodes information in Breath First Search ordering of " -"the Minimum Spanning Tree created using Prims's algorithm." +msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." msgstr "" msgid "pgr_primBFS(`Edges SQL`_, **root vid**, [``max_depth``])" @@ -14791,10 +12580,7 @@ msgstr "" msgid "``pgr_primDD`` — Catchament nodes using Prim's algorithm." msgstr "" -msgid "" -"Using Prim's algorithm, extracts the nodes that have aggregate costs less " -"than or equal to a distance from a root vertex (or vertices) within the " -"calculated minimum spanning tree." +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 "" msgid "pgr_primDD(`Edges SQL`_, **root vid**, **distance**)" @@ -14803,14 +12589,10 @@ msgstr "" msgid "pgr_primDD(`Edges SQL`_, **root vids**, **distance**)" msgstr "" -msgid "" -"``pgr_primDFS`` — Prim algorithm for Minimum Spanning Tree with Depth First " -"Search ordering." +msgid "``pgr_primDFS`` — Prim algorithm for Minimum Spanning Tree with Depth First Search ordering." msgstr "" -msgid "" -"Visits and extracts the nodes information in Depth First Search ordering of " -"the Minimum Spanning Tree created using Prims's algorithm." +msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." msgstr "" msgid "pgr_primDFS(`Edges SQL`_, **root vid**, [``max_depth``])" @@ -14822,9 +12604,7 @@ msgstr "" msgid "``pgr_pushRelabel``" msgstr "" -msgid "" -"``pgr_pushRelabel`` — Calculates the flow on the graph edges that maximizes " -"the flow from the sources to the targets using Push Relabel Algorithm." +msgid "``pgr_pushRelabel`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Push Relabel Algorithm." msgstr "" msgid "pgr_pushRelabel(Combinations)" @@ -14852,9 +12632,7 @@ msgstr "" msgid "``pgr_separateCrossing``" msgstr "pgr_TSP" -msgid "" -"``pgr_separateCrossing`` - From crossing geometries generates geometries " -"that do not cross." +msgid "``pgr_separateCrossing`` - From crossing geometries generates geometries that do not cross." msgstr "" #, fuzzy @@ -14886,25 +12664,17 @@ msgstr "" msgid "Get the code for further refinement." msgstr "" -msgid "" -"When there are special details that need to be taken care of because of the " -"final application or the quality of the data, the code can be obtained On a " -"PostgreSQL ``NOTICE`` using the ``dryrun`` flag." +msgid "When there are special details that need to be taken care of because of the final application or the quality of the data, the code can be obtained On a PostgreSQL ``NOTICE`` using the ``dryrun`` flag." msgstr "" #, fuzzy msgid "``pgr_separateTouching``" msgstr "pgr_TSP" -msgid "" -"``pgr_separateTouching`` - From touching geometries generates geometries " -"that are properly connected at endpoints" +msgid "``pgr_separateTouching`` - From touching geometries generates geometries that are properly connected at endpoints" msgstr "" -msgid "" -"This is an auxiliary function for processing geometries that touch but don't " -"share exact endpoints, splitting them at their intersection points to " -"improve network connectivity." +msgid "This is an auxiliary function for processing geometries that touch but don't share exact endpoints, splitting them at their intersection points to improve network connectivity." msgstr "" #, fuzzy @@ -14914,22 +12684,16 @@ msgstr "p" msgid "``pgr_sequentialVertexColoring`` - Proposed" msgstr "" -msgid "" -"``pgr_sequentialVertexColoring`` — Returns the vertex coloring of an " -"undirected graph, using greedy approach." +msgid "``pgr_sequentialVertexColoring`` — Returns the vertex coloring of an undirected graph, using greedy approach." msgstr "" -msgid "" -"Sequential vertex coloring algorithm is a graph coloring algorithm in which " -"color identifiers are assigned to the vertices of a graph in a sequential " -"manner, such that no edge connects two identically colored vertices." +msgid "Sequential vertex coloring algorithm is a graph coloring algorithm in which color identifiers are assigned to the vertices of a graph in a sequential manner, such that no edge connects two identically colored vertices." msgstr "" msgid "The implementation is applicable only for **undirected** graphs." msgstr "" -msgid "" -"Provides the color to be assigned to all the vertices present in the graph." +msgid "Provides the color to be assigned to all the vertices present in the graph." msgstr "" msgid "Color identifiers values are in the Range :math:`[1, |V|]`" @@ -14938,12 +12702,7 @@ msgstr "" msgid "The algorithm tries to assign the least possible color to every vertex." msgstr "" -msgid "" -"Efficient graph coloring is an NP-Hard problem, and therefore, this " -"algorithm does not always produce optimal coloring. It follows a greedy " -"strategy by iterating through all the vertices sequentially, and assigning " -"the smallest possible color that is not used by its neighbors, to each " -"vertex." +msgid "Efficient graph coloring is an NP-Hard problem, and therefore, this algorithm does not always produce optimal coloring. It follows a greedy strategy by iterating through all the vertices sequentially, and assigning the smallest possible color that is not used by its neighbors, to each vertex." msgstr "" msgid "The returned rows are ordered in ascending order of the vertex value." @@ -14961,45 +12720,32 @@ msgstr "" msgid "pgr_sequentialVertexColoring(`Edges SQL`_)" msgstr "" -msgid "" -"`Boost: Sequential Vertex Coloring `__" +msgid "`Boost: Sequential Vertex Coloring `__" msgstr "" #, fuzzy msgid "``pgr_sloanOrdering`` - Experimental" msgstr "p" -msgid "" -"``pgr_sloanOrdering`` — Returns the Sloan ordering of an undirected graph" +msgid "``pgr_sloanOrdering`` — Returns the Sloan ordering of an undirected graph" msgstr "" -msgid "" -"The Sloan ordering algorithm reorders the vertices of a graph to reduce " -"bandwidth, profile, and wavefront properties, which is particularly useful " -"for sparse matrix computations and finite element analysis." +msgid "The Sloan ordering algorithm reorders the vertices of a graph to reduce bandwidth, profile, and wavefront properties, which is particularly useful for sparse matrix computations and finite element analysis." msgstr "" msgid "Finds a pseudoperipheral vertex pair to determine good starting points" msgstr "" -msgid "" -"Uses a priority-based algorithm that balances vertex degree and distance " -"from the start vertex." +msgid "Uses a priority-based algorithm that balances vertex degree and distance from the start vertex." msgstr "" -msgid "" -"Aims to minimize bandwidth (maximum difference between connected vertex " -"indices." +msgid "Aims to minimize bandwidth (maximum difference between connected vertex indices." msgstr "" -msgid "" -"Typically produces better orderings than simple breadth-first approaches." +msgid "Typically produces better orderings than simple breadth-first approaches." msgstr "" -msgid "" -"Time complexity: :math:`O(V² + E)` where V is the number of vertices and E " -"is the number of edges." +msgid "Time complexity: :math:`O(V² + E)` where V is the number of vertices and E is the number of edges." msgstr "" #, fuzzy @@ -15015,9 +12761,7 @@ msgstr "" msgid "Sloan ordering of Original graph from Boost example (vertices 0-9)." msgstr "" -msgid "" -"`Boost: Sloan Ordering `__" +msgid "`Boost: Sloan Ordering `__" msgstr "" msgid "``pgr_stoerWagner`` - Experimental" @@ -15030,23 +12774,10 @@ msgstr "" msgid "Version 3.0" msgstr "バージョン 3.0.0" -msgid "" -"In graph theory, the Stoer–Wagner algorithm is a recursive algorithm to " -"solve the minimum cut problem in undirected weighted graphs with non-" -"negative weights. The essential idea of this algorithm is to shrink the " -"graph by merging the most intensive vertices, until the graph only contains " -"two combined vertex sets. At each phase, the algorithm finds the minimum s-t " -"cut for two vertices s and t chosen as its will. Then the algorithm shrinks " -"the edge between s and t to search for non s-t cuts. The minimum cut found " -"in all phases will be the minimum weighted cut of the graph." +msgid "In graph theory, the Stoer–Wagner algorithm is a recursive algorithm to solve the minimum cut problem in undirected weighted graphs with non-negative weights. The essential idea of this algorithm is to shrink the graph by merging the most intensive vertices, until the graph only contains two combined vertex sets. At each phase, the algorithm finds the minimum s-t cut for two vertices s and t chosen as its will. Then the algorithm shrinks the edge between s and t to search for non s-t cuts. The minimum cut found in all phases will be the minimum weighted cut of the graph." msgstr "" -msgid "" -"A cut is a partition of the vertices of a graph into two disjoint subsets. A " -"minimum cut is a cut for which the size or weight of the cut is not larger " -"than the size of any other cut. For an unweighted graph, the minimum cut " -"would simply be the cut with the least edges. For a weighted graph, the sum " -"of all edges' weight on the cut determines whether it is a minimum cut." +msgid "A cut is a partition of the vertices of a graph into two disjoint subsets. A minimum cut is a cut for which the size or weight of the cut is not larger than the size of any other cut. For an unweighted graph, the minimum cut would simply be the cut with the least edges. For a weighted graph, the sum of all edges' weight on the cut determines whether it is a minimum cut." msgstr "" msgid "Sum of the weights of all edges between the two sets is mincut." @@ -15064,9 +12795,7 @@ msgstr "" msgid "When the graph is unconnected then EMPTY SET is return." msgstr "" -msgid "" -"Sometimes a graph has multiple min-cuts, but all have the same weight. The " -"this function determines exactly one of the min-cuts as well as its weight." +msgid "Sometimes a graph has multiple min-cuts, but all have the same weight. The this function determines exactly one of the min-cuts as well as its weight." msgstr "" msgid "Running time: :math:`O(V*E + V^2*log V)`." @@ -15105,9 +12834,7 @@ msgstr "" msgid "Using :doc:`pgr_connectedComponents`" msgstr "" -msgid "" -"`Boost: Stoer Wagner min cut `__" +msgid "`Boost: Stoer Wagner min cut `__" msgstr "" msgid "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" @@ -15116,14 +12843,10 @@ msgstr "" msgid "``pgr_strongComponents``" msgstr "" -msgid "" -"``pgr_strongComponents`` — Strongly connected components of a directed graph " -"using Tarjan's algorithm based on DFS." +msgid "``pgr_strongComponents`` — Strongly connected components of a directed graph using Tarjan's algorithm based on DFS." msgstr "" -msgid "" -"A strongly connected component of a directed graph is a set of vertices that " -"are all reachable from each other." +msgid "A strongly connected component of a directed graph is a set of vertices that are all reachable from each other." msgstr "" msgid "Works for **directed** graphs." @@ -15138,37 +12861,25 @@ msgstr "" msgid "The strong components of the graph" msgstr "" -msgid "" -"`Boost: Strong components `__" +msgid "`Boost: Strong components `__" msgstr "" -msgid "" -"wikipedia: `Strongly connected component `__" +msgid "wikipedia: `Strongly connected component `__" msgstr "" msgid "``pgr_topologicalSort`` - Experimental" msgstr "" -msgid "" -"``pgr_topologicalSort`` — Linear ordering of the vertices for directed " -"acyclic graphs (DAG)." +msgid "``pgr_topologicalSort`` — Linear ordering of the vertices for directed acyclic graphs (DAG)." msgstr "" -msgid "" -"The topological sort algorithm creates a linear ordering of the vertices " -"such that if edge :math:`(u,v)` appears in the graph, then :math:`v` comes " -"before :math:`u` in the ordering." +msgid "The topological sort algorithm creates a linear ordering of the vertices such that if edge :math:`(u,v)` appears in the graph, then :math:`v` comes before :math:`u` in the ordering." msgstr "" -msgid "" -"Process is valid for directed acyclic graphs only. otherwise it will throw " -"warnings." +msgid "Process is valid for directed acyclic graphs only. otherwise it will throw warnings." msgstr "" -msgid "" -"For optimization purposes, if there are more than one answer, the function" +msgid "For optimization purposes, if there are more than one answer, the function" msgstr "" msgid "will return one of them." @@ -15198,20 +12909,16 @@ msgstr "" msgid "Graph is not a DAG" msgstr "" -msgid "" -"`Boost: topological sort `__" +msgid "`Boost: topological sort `__" msgstr "" msgid "``pgr_transitiveClosure`` - Experimental" msgstr "" -msgid "" -"``pgr_transitiveClosure`` — Transitive closure graph of a directed graph." +msgid "``pgr_transitiveClosure`` — Transitive closure graph of a directed graph." msgstr "" -msgid "" -"Transforms the input directed graph into the transitive closure of the graph." +msgid "Transforms the input directed graph into the transitive closure of the graph." msgstr "" msgid "Process is valid for directed graphs." @@ -15220,9 +12927,7 @@ msgstr "" msgid "The transitive closure of an undirected graph produces a cluster graph" msgstr "" -msgid "" -"Reachability between vertices on an undirected graph happens when they " -"belong to the same connected component. (see :doc:`pgr_connectedComponents`)" +msgid "Reachability between vertices on an undirected graph happens when they belong to the same connected component. (see :doc:`pgr_connectedComponents`)" msgstr "" msgid "The returned values are not ordered" @@ -15258,9 +12963,7 @@ msgstr "" msgid "Identifiers of the vertices that are reachable from vertex v." msgstr "" -msgid "" -"`Boost: transitive closure `__" +msgid "`Boost: transitive closure `__" msgstr "" msgid "https://en.wikipedia.org/wiki/Transitive_closure" @@ -15303,14 +13006,10 @@ msgstr "" msgid "pgr_trspViaEdges" msgstr "" -msgid "" -"Turn restricted shortest path (TRSP) is an algorithm that receives turn " -"restrictions in form of a query like those found in real world navigable " -"road networks." +msgid "Turn restricted shortest path (TRSP) is an algorithm that receives turn restrictions in form of a query like those found in real world navigable road networks." msgstr "" -msgid "" -"It does no guarantee the shortest path as it might contain restriction paths." +msgid "It does no guarantee the shortest path as it might contain restriction paths." msgstr "" msgid "The general algorithm is as follows:" @@ -15325,66 +13024,47 @@ msgstr "" msgid "Execute the **TRSP** algorithm with restrictions." msgstr "" -msgid "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, " -"[``directed``])" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vids**, " -"[``directed``])" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vid**, " -"[``directed``])" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, " -"[``directed``])" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, " -"[``directed``])" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" msgid "From vertex :math:`6` to vertex :math:`10` on an undirected graph." msgstr "" -msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 1\\}` on an undirected graph." +msgid "From vertex :math:`6` to vertices :math:`\\{10, 1\\}` on an undirected graph." msgstr "" -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertex :math:`8` on a directed graph." +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`8` on a directed graph." msgstr "" -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 8\\}` on an " -"undirected graph." +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 8\\}` on an undirected graph." msgstr "" msgid "Using a combinations table on an undirected graph." msgstr "" -msgid "" -"`Deprecated documentation `_" +msgid "`Deprecated documentation `_" msgstr "" #, fuzzy msgid "``pgr_trspVia``" msgstr "pgr_TSP" -msgid "" -"``pgr_trspVia`` Route that goes through a list of vertices with restrictions." +msgid "``pgr_trspVia`` Route that goes through a list of vertices with restrictions." msgstr "" -msgid "" -"Given a list of vertices and a graph, this function is equivalent to finding " -"the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :" -"math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." +msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." msgstr "" msgid "The paths represents the sections of the route." @@ -15393,8 +13073,7 @@ msgstr "" msgid "Execute a :doc:`pgr_dijkstraVia`." msgstr "" -msgid "" -"For the set of sub paths of the solution that pass through a restriction then" +msgid "For the set of sub paths of the solution that pass through a restriction then" msgstr "" msgid "Execute the **TRSP** algorithm with restrictions for the paths." @@ -15403,14 +13082,10 @@ msgstr "" msgid "**NOTE** when this is done, ``U_turn_on_edge`` flag is ignored." msgstr "" -msgid "" -"pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, " -"[**options**])" +msgid "pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, [**options**])" 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." +msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a directed graph." msgstr "" msgid "Simulation of how algorithm works." @@ -15419,18 +13094,13 @@ msgstr "" msgid "The algorithm performs a :doc:`pgr_dijkstraVia`" msgstr "" -msgid "" -"Detects which of the sub paths pass through a restriction in this case is " -"for the ``path_id = 5`` from ``6`` to ``3`` because the path :math:`15 " -"\\rightarrow 1` is restricted." +msgid "Detects which of the sub paths pass through a restriction in this case is for the ``path_id = 5`` from ``6`` to ``3`` because the path :math:`15 \\rightarrow 1` is restricted." msgstr "" msgid "Executes the :doc:`pgr_trsp` algorithm for the conflicting paths." msgstr "" -msgid "" -"From the :doc:`pgr_dijkstraVia` result it removes the conflicting paths and " -"builds the solution with the results of the :doc:`pgr_trsp` algorithm:" +msgid "From the :doc:`pgr_dijkstraVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" msgstr "" msgid "Getting the same result as ``pgr_trspVia``:" @@ -15442,20 +13112,13 @@ msgstr "" msgid "Sometimes ``U_turn_on_edge`` flag is ignored when is set to ``false``." msgstr "" -msgid "" -"The first step, doing a :doc:`pgr_dijkstraVia` does consider not making a U " -"turn on the same edge. But the path :math:`16 \\rightarrow 13` (Rows 4 and " -"5) is restricted and the result is using it." +msgid "The first step, doing a :doc:`pgr_dijkstraVia` does consider not making a U turn on the same edge. But the path :math:`16 \\rightarrow 13` (Rows 4 and 5) is restricted and the result is using it." msgstr "" -msgid "" -"When executing the :doc:`pgr_trsp` algorithm for the conflicting path, there " -"is no ``U_turn_on_edge`` flag." +msgid "When executing the :doc:`pgr_trsp` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." msgstr "" -msgid "" -"Therefore the result ignores the ``U_turn_on_edge`` flag when set to " -"``false``." +msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``." msgstr "" msgid ":doc:`via-category`" @@ -15464,17 +13127,10 @@ msgstr "" msgid "``pgr_trspVia_withPoints``" msgstr "" -msgid "" -"``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/" -"or points with restrictions." +msgid "``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/or points with restrictions." msgstr "" -msgid "" -"Given a graph, a set of restriction on the graph edges, a set of points on " -"the graphs edges and a list of vertices, this function is equivalent to " -"finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` " -"(where :math:`vertex` can be a vertex or a point on the graph) for all :math:" -"`i < size\\_of(via\\;vertices)` trying not to use restricted paths." +msgid "Given a graph, a set of restriction on the graph edges, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." msgstr "" msgid "is a sequence of paths" @@ -15492,8 +13148,7 @@ msgstr "" msgid "Execute a :doc:`pgr_withPointsVia`." msgstr "" -msgid "" -"For the set of paths of the solution that pass through a restriction then" +msgid "For the set of paths of the solution that pass through a restriction then" msgstr "" msgid "Execute the **TRSP** algorithm with restrictions for the path." @@ -15503,17 +13158,13 @@ msgid "Do not use negative values on identifiers of the inner queries." msgstr "" #, fuzzy -msgid "" -"pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**via vertices**, [**driving side**,] [**options**])" +msgid "pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, [**driving side**,] [**options**])" msgstr "pg" msgid "**options:** ``[directed, strict, U_turn_on_edge, details]``" msgstr "" -msgid "" -"Find the route that visits the vertices :math:`\\{-6, 15, -5\\}` in that " -"order on an directed graph." +msgid "Find the route that visits the vertices :math:`\\{-6, 15, -5\\}` in that order on an directed graph." msgstr "" msgid "When positive it is considered a vertex identifier" @@ -15525,9 +13176,7 @@ msgstr "" msgid "[**driving side**]" msgstr "" -msgid "" -"Value in [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] indicating if the " -"driving side is:" +msgid "Value in [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] indicating if the driving side is:" msgstr "" #, fuzzy @@ -15570,13 +13219,10 @@ msgstr "" msgid "When ``true`` the results will include the points that are in the path." msgstr "" -msgid "" -"When ``false`` the results will not include the points that are in the path." +msgid "When ``false`` the results will not include the points that are in the path." msgstr "" -msgid "" -"When ``start_vid``, ``end_vid`` and ``node`` columns have negative values, " -"the identifier is for a Point." +msgid "When ``start_vid``, ``end_vid`` and ``node`` columns have negative values, the identifier is for a Point." msgstr "" msgid "Use ``pgr_findCloseEdges`` for points on the fly" @@ -15585,30 +13231,22 @@ msgstr "" msgid "Using :doc:`pgr_findCloseEdges`:" msgstr "" -msgid "" -"Visit from vertex :math:`1` to the two locations on the graph of point " -"`(2.9, 1.8)` in order of closeness to the graph." +msgid "Visit from vertex :math:`1` to the two locations on the graph of point `(2.9, 1.8)` in order of closeness to the graph." msgstr "" -msgid "" -"Point :math:`-1` corresponds to the closest edge from point `(2.9, 1.8)`." +msgid "Point :math:`-1` corresponds to the closest edge from point `(2.9, 1.8)`." msgstr "" -msgid "" -"Point :math:`-2` corresponds to the next close edge from point `(2.9, 1.8)`." +msgid "Point :math:`-2` corresponds to the next close edge from point `(2.9, 1.8)`." msgstr "" -msgid "" -"Point :math:`-2` is visited on the route to from vertex :math:`1` to Point :" -"math:`-1` (See row where :math:`seq = 4`)." +msgid "Point :math:`-2` is visited on the route to from vertex :math:`1` to Point :math:`-1` (See row where :math:`seq = 4`)." msgstr "" msgid "Usage variations" msgstr "" -msgid "" -"All this examples are about the route that visits the vertices :math:`\\{-6, " -"7, -4, 8, -2\\}` in that order on a directed graph." +msgid "All this examples are about the route that visits the vertices :math:`\\{-6, 7, -4, 8, -2\\}` in that order on a directed graph." msgstr "" msgid "Status of \"passes in front\" or \"visits\" of the nodes and points." @@ -15617,40 +13255,25 @@ msgstr "" msgid "The algorithm performs a :doc:`pgr_withPointsVia`" msgstr "" -msgid "" -"Detects which of the paths pass through a restriction in this case is for " -"the ``path_id = 1`` from ``-6`` to ``15`` because the path :math:`9 " -"\\rightarrow 16` is restricted." +msgid "Detects which of the paths pass through a restriction in this case is for the ``path_id = 1`` from ``-6`` to ``15`` because the path :math:`9 \\rightarrow 16` is restricted." msgstr "" -msgid "" -"Executes the :ref:`TRSP-family:TRSP algorithm` for the conflicting paths." +msgid "Executes the :ref:`TRSP-family:TRSP algorithm` for the conflicting paths." msgstr "" -msgid "" -"From the :doc:`pgr_withPointsVia` result it removes the conflicting paths " -"and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" +msgid "From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" msgstr "" msgid "Getting the same result as ``pgr_trspVia_withPoints``:" msgstr "" -msgid "" -"The first step, doing a :doc:`pgr_withPointsVia` does consider not making a " -"U turn on the same edge. But the path :math:`9 \\rightarrow 16` (Rows 4 and " -"5) is restricted and the result is using it." +msgid "The first step, doing a :doc:`pgr_withPointsVia` does consider not making a U turn on the same edge. But the path :math:`9 \\rightarrow 16` (Rows 4 and 5) is restricted and the result is using it." msgstr "" -msgid "" -"When executing the :doc:`pgr_trsp_withPoints` algorithm for the conflicting " -"path, there is no ``U_turn_on_edge`` flag." +msgid "When executing the :doc:`pgr_trsp_withPoints` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." msgstr "" -msgid "" -"Therefore the result ignores the ``U_turn_on_edge`` flag when set to " -"``false``. From the :doc:`pgr_withPointsVia` result it removes the " -"conflicting paths and builds the solution with the results of the :doc:" -"`pgr_trsp` algorithm. In this case a U turn is been done using the same edge." +msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``. From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm. In this case a U turn is been done using the same edge." msgstr "" msgid "``pgr_trsp_withPoints``" @@ -15659,10 +13282,7 @@ msgstr "" msgid "``pgr_trsp_withPoints`` Routing Vertex/Point with restrictions." msgstr "" -msgid "" -"Modify the graph to include points defined by `Points SQL`_. Consider the " -"invalid paths on `Restrictions SQL`_. Using Dijkstra algorithm, find the " -"shortest path." +msgid "Modify the graph to include points defined by `Points SQL`_. Consider the invalid paths on `Restrictions SQL`_. Using Dijkstra algorithm, find the shortest path." msgstr "" msgid "Vertices of the graph are:" @@ -15680,87 +13300,60 @@ msgstr "" msgid "The `agg_cost` in the non included values `(u, v)` is :math:`\\infty`" msgstr "" -msgid "" -"For optimization purposes, any duplicated value in the input arrays of " -"**start vids** or **end vids** or are ignored." +msgid "For optimization purposes, any duplicated value in the input arrays of **start vids** or **end vids** or are ignored." msgstr "" msgid "Running time: :math:`O(|start\\_vids|\\times(V \\log V + E))`" msgstr "" #, fuzzy -msgid "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**start vid**, **end vid**, [**driving side**,] [**options**])" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**,] [**options**])" msgstr "pg" #, fuzzy -msgid "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**start vid**, **end vids**, [**driving side**,] [**options**])" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**,] [**options**])" msgstr "pg" #, fuzzy -msgid "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**start vids**, **end vid**, [**driving side**,] [**options**])" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**,] [**options**])" msgstr "pg" #, fuzzy -msgid "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**start vids**, **end vids**, [**driving side**,] [**options**])" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**,] [**options**])" msgstr "pg" #, fuzzy -msgid "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"`Combinations SQL`_, [**driving side**,] [**options**])" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**,] [**options**])" msgstr "pg" msgid "**options:** ``[directed, details]``" msgstr "" -msgid "" -"From point :math:`1` to vertex :math:`10` with right driving side in " -"directed graph. (with details)" +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (with details)" msgstr "" -msgid "" -"From point :math:`1` to point :math:`3` and vertex :math:`7` on an " -"undirected graph" +msgid "From point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" msgstr "" -msgid "" -"From point :math:`1` and vertex :math:`6` to point :math:`3` with right " -"driving side in directed graph. (without details)" +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph. (without details)" msgstr "" -msgid "" -"From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :" -"math:`1` with left side driving." +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` with left side driving." msgstr "" msgid "Two combinations" msgstr "" -msgid "" -"From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to " -"point :math:`3` with right side driving. (with details)" +msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving. (with details)" msgstr "" msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_." msgstr "" -msgid "" -"Find the routes from vertex :math:`1` to the two closest locations on the " -"graph of point `(2.9, 1.8)`." +msgid "Find the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." msgstr "" -msgid "" -"All the examples are about traveling from point :math:`1` and vertex :math:" -"`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}` with " -"restrictions" +msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}` with restrictions" msgstr "" msgid "Passes in front or visits with right side driving." @@ -15775,19 +13368,13 @@ msgstr "" msgid "``pgr_turnRestrictedPath`` - Experimental" msgstr "" -msgid "" -"``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex - Vertex routing " -"with restrictions" +msgid "``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex - Vertex routing with restrictions" 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" +msgid "Using Yen's algorithm to obtain K shortest paths and analyze the paths to select the paths that do not use the restrictions" msgstr "" -msgid "" -"pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, " -"**end vid**, **K**, [**options**])" +msgid "pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, **K**, [**options**])" msgstr "" msgid "**options:** ``[directed, heap_paths, stop_on_first, strict]``" @@ -15802,8 +13389,7 @@ msgstr "" msgid "``stop_on_first``" msgstr "" -msgid "" -"When ``true`` stops on first path found that dos not violate restrictions" +msgid "When ``true`` stops on first path found that dos not violate restrictions" msgstr "" msgid "When ``false`` returns at most K paths" @@ -15863,99 +13449,66 @@ msgstr "" msgid "TBD" msgstr "" -msgid "" -"``pgr_withPoints`` - Returns the shortest path in a graph with additional " -"temporary vertices." +msgid "``pgr_withPoints`` - Returns the shortest path in a graph with additional temporary vertices." msgstr "" msgid "pgr_withPoints(Combinations)" msgstr "" -msgid "" -"Modify the graph to include points defined by `Points SQL`_. Using Dijkstra " -"algorithm, find the shortest path." +msgid "Modify the graph to include points defined by `Points SQL`_. Using Dijkstra algorithm, find the shortest path." msgstr "" #, fuzzy -msgid "" -"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, " -"[**driving side**] [**options**])" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" msgstr "pg" #, fuzzy -msgid "" -"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, " -"[**driving side**] [**options**])" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" msgstr "pg" #, fuzzy -msgid "" -"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, " -"[**driving side**] [**options**])" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" msgstr "pg" #, fuzzy -msgid "" -"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, " -"[**driving side**] [**options**])" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" msgstr "pg" #, fuzzy -msgid "" -"pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving " -"side**] [**options**])" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" msgstr "pg" msgid "**options:** ``[directed, details])``" msgstr "" -msgid "" -"From point :math:`1` to vertex :math:`10` with right driving side in " -"directed graph. (without details)" +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (without details)" msgstr "" -msgid "" -"Identifier of the starting vertex of the path. Negative value is for point’s " -"identifier." +msgid "Identifier of the starting vertex of the path. Negative value is for point’s identifier." msgstr "" -msgid "" -"Array of identifiers of starting vertices. Negative values are for point’s " -"identifiers." +msgid "Array of identifiers of starting vertices. Negative values are for point’s identifiers." msgstr "" -msgid "" -"Identifier of the ending vertex of the path. Negative value is for point’s " -"identifier." +msgid "Identifier of the ending vertex of the path. Negative value is for point’s identifier." msgstr "" -msgid "" -"Array of identifiers of ending vertices. Negative values are for point’s " -"identifiers." +msgid "Array of identifiers of ending vertices. Negative values are for point’s identifiers." msgstr "" -msgid "" -"All the examples are about traveling from point :math:`1` and vertex :math:" -"`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" +msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" msgstr "" -msgid "" -"``pgr_withPointsCost`` - Calculates the shortest path and returns only the " -"aggregate cost of the shortest path found, for the combination of points " -"given." +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 "" msgid "pgr_withPointsCost(Combinations)" msgstr "" -msgid "" -"Modify the graph to include points defined by points_sql. Using Dijkstra " -"algorithm, return only the aggregate cost of the shortest path found." +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 "" -msgid "" -"Returns the sum of the costs of the shortest path for pair combination of " -"vertices in the modified graph." +msgid "Returns the sum of the costs of the shortest path for pair combination of vertices in the modified graph." msgstr "" msgid "The returned values are in the form of a set of |matrix-result|." @@ -15967,70 +13520,48 @@ msgstr "" msgid "**negative** when it belongs to the points_sql" msgstr "" -msgid "" -"If the values returned are stored in a table, the unique index would be the " -"pair: `(start_vid, end_vid)`." +msgid "If the values returned are stored in a table, the unique index would be the pair: `(start_vid, end_vid)`." msgstr "" msgid "For **undirected** graphs, the results are **symmetric**." msgstr "" #, fuzzy -msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, " -"[**driving side**] [**options**])" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" msgstr "pg" #, fuzzy -msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, " -"[**driving side**] [**options**])" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" msgstr "pg" #, fuzzy -msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, " -"[**driving side**] [**options**])" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" msgstr "pg" #, fuzzy -msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end " -"vids**, [**driving side**] [**options**])" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" msgstr "pg" #, fuzzy -msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, " -"[**driving side**] [**options**])" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" msgstr "pg" msgid "**options:** ``[directed]``" msgstr "" -msgid "" -"There is no **details** flag, unlike the other members of the withPoints " -"family of functions." +msgid "There is no **details** flag, unlike the other members of the withPoints family of functions." msgstr "" -msgid "" -"From point :math:`1` to vertex :math:`10` with right driving side in " -"directed graph." +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph." msgstr "" -msgid "" -"From point :math:`1` and vertex :math:`6` to point :math:`3` with right " -"driving side in directed graph." +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph." msgstr "" -msgid "" -"From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to " -"point :math:`3` with right side driving." +msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving." msgstr "" -msgid "" -"Find the cost of the routes from vertex :math:`1` to the two closest " -"locations on the graph of point `(2.9, 1.8)`." +msgid "Find the cost of the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." msgstr "" msgid "Being close to the graph does not mean have a shorter route." @@ -16039,9 +13570,7 @@ msgstr "" msgid "Right side driving topology" msgstr "" -msgid "" -"Traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, " -"3, 6\\}` and vertices :math:`\\{10, 11\\}`" +msgid "Traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" msgstr "" msgid "Left side driving topology" @@ -16050,20 +13579,14 @@ msgstr "" msgid "Does not matter driving side driving topology" msgstr "" -msgid "" -"``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:" -"`pgr_withPoints`." +msgid "``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:`pgr_withPoints`." msgstr "" #, fuzzy -msgid "" -"pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, " -"[**driving side**] [**options**])" +msgid "pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, [**driving side**] [**options**])" msgstr "pg" -msgid "" -"Cost matrix for points :math:`\\{1, 6\\}` and vertices :math:`\\{10, 11\\}` " -"on an **undirected** graph" +msgid "Cost matrix for points :math:`\\{1, 6\\}` and vertices :math:`\\{10, 11\\}` on an **undirected** graph" msgstr "" msgid "Returning a **symmetrical** cost matrix" @@ -16075,14 +13598,10 @@ msgstr "" msgid "Using the default ``driving side`` value" msgstr "" -msgid "" -"Find the matrix cost of the routes from vertex :math:`1` and the two closest " -"locations on the graph of point `(2.9, 1.8)`." +msgid "Find the matrix cost of the routes from vertex :math:`1` and the two closest locations on the graph of point `(2.9, 1.8)`." msgstr "" -msgid "" -"``pgr_withPointsDD`` - Returns the driving **distance** from a starting " -"point." +msgid "``pgr_withPointsDD`` - Returns the driving **distance** from a starting point." msgstr "" msgid "Output columns standardized to |result-spantree|" @@ -16098,23 +13617,15 @@ msgstr "" msgid "Deprecated signatures:" msgstr "機能" -msgid "" -"Modify the graph to include points and using Dijkstra algorithm, extracts " -"all the nodes and points that have costs less than or equal to the value " -"``**distance**`` from the starting point. The edges extracted will conform " -"the corresponding spanning tree." +msgid "Modify the graph to include points and using Dijkstra algorithm, extracts all the nodes and points that have costs less than or equal to the value ``**distance**`` from the starting point. The edges extracted will conform the corresponding spanning tree." msgstr "" #, fuzzy -msgid "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, " -"[**driving side**], [**options A**])" +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options A**])" msgstr "pg" #, fuzzy -msgid "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, " -"[**driving side**], [**options B**])" +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options B**])" msgstr "pg" msgid "**options A:** ``[directed, details]``" @@ -16124,62 +13635,45 @@ msgid "**options B:** ``[directed, details, equicost]``" msgstr "" #, fuzzy -msgid "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, " -"[**driving side**], [**options**])" +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options**])" msgstr "pg" -msgid "" -"Right side driving topology, from point :math:`1` within a distance of :math:" -"`3.3` with details." +msgid "Right side driving topology, from point :math:`1` within a distance of :math:`3.3` with details." msgstr "" #, fuzzy -msgid "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, " -"[**driving side**], [**options**])" +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options**])" msgstr "pg" msgid "**options:** ``[directed, details, equicost]``" msgstr "" -msgid "" -"From point :math:`1` and vertex :math:`16` within a distance of :math:`3.3` " -"with ``equicost`` on a directed graph" +msgid "From point :math:`1` and vertex :math:`16` within a distance of :math:`3.3` with ``equicost`` on a directed graph" msgstr "" msgid "Negative values represent a point" msgstr "" -msgid "" -"Find the driving distance from the two closest locations on the graph of " -"point `(2.9, 1.8)`." +msgid "Find the driving distance from the two closest locations on the graph of point `(2.9, 1.8)`." msgstr "" -msgid "" -"Point :math:`-1` corresponds to the closest edge from point :math:`(2.9, " -"1.8)`." +msgid "Point :math:`-1` corresponds to the closest edge from point :math:`(2.9, 1.8)`." msgstr "" -msgid "" -"Point :math:`-2` corresponds to the next close edge from point :math:`(2.9, " -"1.8)`." +msgid "Point :math:`-2` corresponds to the next close edge from point :math:`(2.9, 1.8)`." msgstr "" msgid "Driving side does not matter" msgstr "" -msgid "" -"From point :math:`1` within a distance of :math:`3.3`, does not matter " -"driving side, with details." +msgid "From point :math:`1` within a distance of :math:`3.3`, does not matter driving side, with details." msgstr "" #, fuzzy msgid "``pgr_withPointsKSP``" msgstr "pgr_TSP" -msgid "" -"``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." +msgid "``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." msgstr "" msgid "pgr_withPointsKSP(One to Many)" @@ -16194,47 +13688,33 @@ msgstr "" msgid "pgr_withPointsKSP(Combinations)" msgstr "" -msgid "" -"Modifies the graph to include the points defined in the `Points SQL`_ and " -"using Yen algorithm, finds the :math:`K` shortest paths." +msgid "Modifies the graph to include the points defined in the `Points SQL`_ and using Yen algorithm, finds the :math:`K` shortest paths." msgstr "" #, fuzzy -msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, " -"**K**, [**driving side**], [**options**])" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, [**driving side**], [**options**])" msgstr "pg" #, fuzzy -msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, " -"**K**, [**driving side**], [**options**])" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, [**driving side**], [**options**])" msgstr "pg" #, fuzzy -msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, " -"**K**, [**driving side**], [**options**])" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, [**driving side**], [**options**])" msgstr "pg" #, fuzzy -msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, " -"**K**, [**driving side**], [**options**])" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, [**driving side**], [**options**])" msgstr "pg" #, fuzzy -msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, " -"[**driving side**], [**options**])" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, [**driving side**], [**options**])" msgstr "pg" msgid "**options:** ``[directed, heap_paths, details]``" msgstr "" -msgid "" -"Get 2 paths from Point :math:`1` to point :math:`2` on a directed graph with " -"**left** side driving." +msgid "Get 2 paths from Point :math:`1` to point :math:`2` on a directed graph with **left** side driving." msgstr "" msgid "For a directed graph." @@ -16246,21 +13726,13 @@ msgstr "" msgid "No heap paths are returned." msgstr "" -msgid "" -"Get 2 paths from point :math:`1` to point :math:`3` and vertex :math:`7` on " -"an undirected graph" +msgid "Get 2 paths from point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" msgstr "" -msgid "" -"Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` on a " -"**directed** graph with **right** side driving and **details** set to " -"**True**" +msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` on a **directed** graph with **right** side driving and **details** set to **True**" msgstr "" -msgid "" -"Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` and " -"vertex :math:`1` on a **directed** graph with **left** side driving and " -"**heap_paths** set to **True**" +msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` on a **directed** graph with **left** side driving and **heap_paths** set to **True**" msgstr "" msgid "Using a combinations table on an **directed** graph" @@ -16273,102 +13745,65 @@ msgstr "" msgid "withPointsKSP optional parameters" msgstr "オプションとなるパラメータ" -msgid "" -"Get :math:`2` paths using left side driving topology, from vertex :math:`1` " -"to the closest location on the graph of point `(2.9, 1.8)`." +msgid "Get :math:`2` paths using left side driving topology, from vertex :math:`1` to the closest location on the graph of point `(2.9, 1.8)`." msgstr "" 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." +msgid "Get :math:`2` paths using left side driving topology, from point :math:`1` to point :math:`3` with details." msgstr "" msgid "Right driving side" msgstr "" -msgid "" -"Get :math:`2` paths using right side driving topology from, point :math:`1` " -"to point :math:`2` with heap paths and details." +msgid "Get :math:`2` paths using right side driving topology from, point :math:`1` to point :math:`2` with heap paths and details." msgstr "" msgid "``pgr_withPointsVia``" msgstr "" -msgid "" -"``pgr_withPointsVia`` - Route that goes through a list of vertices and/or " -"points." +msgid "``pgr_withPointsVia`` - Route that goes through a list of vertices and/or points." msgstr "" -msgid "" -"Given a graph, a set of points on the graphs edges and a list of vertices, " -"this function is equivalent to finding the shortest path between :math:" -"`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or " -"a point on the graph) for all :math:`i < size\\_of(via\\;vertices)`." +msgid "Given a graph, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)`." msgstr "" #, fuzzy -msgid "" -"pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, [**driving " -"side**] [**options**])" +msgid "pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, [**driving side**] [**options**])" msgstr "pg" -msgid "" -"Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that " -"order with right driving side in directed graph.." +msgid "Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that order with right driving side in directed graph.." msgstr "" msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_" msgstr "" -msgid "" -"All this examples are about the route that visits the vertices :math:`\\{-1, " -"7, -3, 16, 15\\}` in that order on a **directed** graph." +msgid "All this examples are about the route that visits the vertices :math:`\\{-1, 7, -3, 16, 15\\}` in that order on a **directed** graph." msgstr "" msgid "Prim - Family of functions" msgstr "" -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." +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 "" -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 "This algorithms find the minimum spanning forest in a possibly disconnected graph; in contrast, the most basic form of Prim's algorithm only finds minimum spanning trees in connected graphs. However, running Prim's algorithm separately for each connected component of the graph, then it is called minimum spanning forest." msgstr "" -msgid "" -"From boost Graph: \"The algorithm as implemented in Boost.Graph does not " -"produce correct results on graphs with parallel edges.\"" +msgid "From boost Graph: \"The algorithm as implemented in Boost.Graph does not produce correct results on graphs with parallel edges.\"" msgstr "" -msgid "" -"Boost: `Prim's algorithm `__" +msgid "Boost: `Prim's algorithm `__" msgstr "" -msgid "" -"Wikipedia: `Prim's algorithm `__" +msgid "Wikipedia: `Prim's algorithm `__" msgstr "" msgid "Proposed Functions" msgstr "" -msgid "" -":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." +msgid ":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." msgstr "" #, fuzzy @@ -16378,9 +13813,7 @@ msgstr "参照" msgid "Release Notes" msgstr "" -msgid "" -"To see the full list of changes check the list of `Git commits `_ on Github." +msgid "To see the full list of changes check the list of `Git commits `_ on Github." msgstr "" msgid "Mayors" @@ -16392,7 +13825,16 @@ msgstr "" msgid "Minors 4.x" msgstr "" -msgid "pgRouting 4.0" +msgid "pgRouting 4.1" +msgstr "" + +msgid "pgRouting 4.1.0 Release Notes" +msgstr "" + +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.1.0 `__" +msgstr "" + +msgid "No changes yet" msgstr "" msgid "pgRouting 3" @@ -16407,10 +13849,7 @@ msgstr "" msgid "pgRouting 3.8.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.8.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.8.0 `__" msgstr "" msgid "Promotion to official function of pgRouting." @@ -16419,32 +13858,22 @@ msgstr "" msgid "Metric" msgstr "" -msgid "" -"`#2760 `__: Promoted to " -"official pgr_degree in version 3.8" +msgid "`#2760 `__: Promoted to official pgr_degree in version 3.8" msgstr "" msgid "Utilities" msgstr "" -msgid "" -"`#2772 `__: Promoted to " -"official pgr_extractVertices in version 3.8" +msgid "`#2772 `__: Promoted to official pgr_extractVertices in version 3.8" msgstr "" -msgid "" -"`#2774 `__: Promoted to " -"official pgr_findCloseEdges in version 3.8" +msgid "`#2774 `__: Promoted to official pgr_findCloseEdges in version 3.8" msgstr "" -msgid "" -"`#2873 `__: Promoted to " -"official pgr_separateCrossing in version 3.8" +msgid "`#2873 `__: Promoted to official pgr_separateCrossing in version 3.8" msgstr "" -msgid "" -"`#2874 `__: Promoted to " -"official pgr_separateTouching in version 3.8" +msgid "`#2874 `__: Promoted to official pgr_separateTouching in version 3.8" msgstr "" #, fuzzy @@ -16455,45 +13884,31 @@ msgstr "新しい **公式** 機能" msgid "Contraction" msgstr "序章" -msgid "" -"`#2790 `__: " -"pgr_contractionDeadEnd new contraction function" +msgid "`#2790 `__: pgr_contractionDeadEnd new contraction function" msgstr "" -msgid "" -"`#2791 `__: " -"pgr_contractionLinear new contraction function" +msgid "`#2791 `__: pgr_contractionLinear new contraction function" msgstr "" -msgid "" -"`#2536 `__: Support for " -"contraction hierarchies (pgr_contractionHierarchies)" +msgid "`#2536 `__: Support for contraction hierarchies (pgr_contractionHierarchies)" msgstr "" -msgid "" -"`#2848 `__: Create " -"pgr_separateCrossing new utility function" +msgid "`#2848 `__: Create pgr_separateCrossing new utility function" msgstr "" -msgid "" -"`#2849 `__: Create of " -"pgr_separateTouching new utility function" +msgid "`#2849 `__: Create of pgr_separateTouching new utility function" msgstr "" msgid "Official functions changes" msgstr "" -msgid "" -"`#2786 `__: " -"pgr_contraction(edges) new signature" +msgid "`#2786 `__: pgr_contraction(edges) new signature" msgstr "" msgid "C/C++ code enhancements" msgstr "" -msgid "" -"`#2802 `__: Code " -"reorganization on pgr_contraction" +msgid "`#2802 `__: Code reorganization on pgr_contraction" msgstr "" msgid "Other enhancements:" @@ -16505,38 +13920,26 @@ msgstr "" msgid "SQL code enhancements" msgstr "" -msgid "" -"`#2850 `__: Rewrite " -"pgr_nodeNetwork" +msgid "`#2850 `__: Rewrite pgr_nodeNetwork" msgstr "" #, fuzzy msgid "Deprecation of SQL functions" msgstr "ダイクストラ関連機能" -msgid "" -"`#2749 `__: Deprecate " -"pgr_AlphaShape in 3.8" +msgid "`#2749 `__: Deprecate pgr_AlphaShape in 3.8" msgstr "" -msgid "" -"`#2750 `__: Deprecate " -"pgr_CreateTopology in 3.8" +msgid "`#2750 `__: Deprecate pgr_CreateTopology in 3.8" msgstr "" -msgid "" -"`#2753 `__: Deprecate " -"pgr_analyzeGraph in 3.8" +msgid "`#2753 `__: Deprecate pgr_analyzeGraph in 3.8" msgstr "" -msgid "" -"`#2754 `__: Deprecate " -"pgr_analyzeOneWay in 3.8" +msgid "`#2754 `__: Deprecate pgr_analyzeOneWay in 3.8" msgstr "" -msgid "" -"`#2826 `__: Deprecate " -"pgr_createVerticesTable in 3.8" +msgid "`#2826 `__: Deprecate pgr_createVerticesTable in 3.8" msgstr "" #, fuzzy @@ -16555,29 +13958,19 @@ msgstr "" msgid "pgRouting 3.7.3 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.7.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.3 `__" msgstr "" -msgid "" -"`#2731 `__: Build " -"Failure on Ubuntu 22" +msgid "`#2731 `__: Build Failure on Ubuntu 22" msgstr "" msgid "pgRouting 3.7.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.7.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.2 `__" msgstr "" -msgid "" -"`#2713 `__: cmake " -"missing some policies and min version" +msgid "`#2713 `__: cmake missing some policies and min version" msgstr "" msgid "Using OLD policies: CMP0148, CMP0144, CMP0167" @@ -16586,33 +13979,22 @@ msgstr "" msgid "Minimum cmake version 3.12" msgstr "" -msgid "" -"`#2707 `__: Build " -"failure in pgRouting 3.7.1 on Alpine" +msgid "`#2707 `__: Build failure in pgRouting 3.7.1 on Alpine" msgstr "" -msgid "" -"`#2706 `__: winnie " -"crashing on pgr_betweennessCentrality" +msgid "`#2706 `__: winnie crashing on pgr_betweennessCentrality" msgstr "" msgid "pgRouting 3.7.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.7.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.1 `__" msgstr "" -msgid "" -"`#2680 `__: fails to " -"compile under mingw64 gcc 13.2" +msgid "`#2680 `__: fails to compile under mingw64 gcc 13.2" msgstr "" -msgid "" -"`#2689 `__: When point " -"is a vertex, the withPoints family do not return results." +msgid "`#2689 `__: When point is a vertex, the withPoints family do not return results." msgstr "" msgid "C/C++ code enhancemet" @@ -16625,18 +14007,13 @@ msgstr ":doc:`TSP-family`" msgid "pgRouting 3.7.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.7.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.0 `__" msgstr "" msgid "Support" msgstr "サポート" -msgid "" -"`#2656 `__: Stop support " -"of PostgreSQL12 on pgrouting v3.7" +msgid "`#2656 `__: Stop support of PostgreSQL12 on pgrouting v3.7" msgstr "" msgid "Stopping support of PostgreSQL 12" @@ -16648,9 +14025,7 @@ msgstr "" msgid "pgr_betweennessCentrality" msgstr "" -msgid "" -"`#2605 `__: Standardize " -"spanning tree functions output" +msgid "`#2605 `__: Standardize spanning tree functions output" msgstr "" msgid "Functions:" @@ -16659,9 +14034,7 @@ msgstr "" msgid "Experimental promoted to proposed." msgstr "" -msgid "" -"`#2635 `__: " -"pgr_LineGraph ignores directed flag and use negative values for identifiers." +msgid "`#2635 `__: pgr_LineGraph ignores directed flag and use negative values for identifiers." msgstr "" msgid "``pgr_lineGraph``" @@ -16670,19 +14043,13 @@ msgstr "" msgid "Code enhancement" msgstr "" -msgid "" -"`#2599 `__: Driving " -"distance cleanup" +msgid "`#2599 `__: Driving distance cleanup" msgstr "" -msgid "" -"`#2607 `__: Read " -"postgresql data on C++" +msgid "`#2607 `__: Read postgresql data on C++" msgstr "" -msgid "" -"`#2614 `__: Clang tidy " -"does not work" +msgid "`#2614 `__: Clang tidy does not work" msgstr "" msgid "pgRouting 3.6" @@ -16691,10 +14058,7 @@ msgstr "" msgid "pgRouting 3.6.3 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.6.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.3 `__" msgstr "" msgid "Explicit minimum requirements:" @@ -16725,9 +14089,7 @@ msgstr "" msgid "Add a clang tidy test on changed files." msgstr "" -msgid "" -"Update test not done on versions: 3.0.1, 3.0.2, 3.0.3, 3.0.4, 3.1.0, 3.1.1, " -"3.1.2" +msgid "Update test not done on versions: 3.0.1, 3.0.2, 3.0.3, 3.0.4, 3.1.0, 3.1.1, 3.1.2" msgstr "" msgid "Documentation" @@ -16748,10 +14110,7 @@ msgstr "" msgid "pgRouting 3.6.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.6.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.2 `__" msgstr "" msgid "Upgrade fix" @@ -16775,111 +14134,74 @@ msgstr "" msgid "pgRouting 3.6.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.6.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.1 `__" msgstr "" -msgid "" -"`#2588 `__: pgrouting " -"3.6.0 fails to build on OSX" +msgid "`#2588 `__: pgrouting 3.6.0 fails to build on OSX" msgstr "" msgid "pgRouting 3.6.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.6.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.0 `__" msgstr "" -msgid "" -"`#2516 `__: Standardize " -"output pgr_aStar" +msgid "`#2516 `__: Standardize output pgr_aStar" msgstr "" msgid "Standardize output columns to |short-generic-result|" msgstr "" -msgid "" -"`#2523 `__: Standardize " -"output pgr_bdAstar" +msgid "`#2523 `__: Standardize output pgr_bdAstar" msgstr "" -msgid "" -"`#2547 `__: Standardize " -"output and modifying signature pgr_KSP" +msgid "`#2547 `__: Standardize output and modifying signature pgr_KSP" msgstr "" -msgid "" -"`#2548 `__: Standardize " -"output pgr_drivingDistance" +msgid "`#2548 `__: Standardize output pgr_drivingDistance" msgstr "" #, fuzzy msgid "Proposed functions changes" msgstr "次期リリース予定の機能。" -msgid "" -"`#2544 `__: Standardize " -"output and modifying signature pgr_withPointsDD" +msgid "`#2544 `__: Standardize output and modifying signature pgr_withPointsDD" msgstr "" -msgid "" -"`#2546 `__: Standardize " -"output and modifying signature pgr_withPointsKSP" +msgid "`#2546 `__: Standardize output and modifying signature pgr_withPointsKSP" msgstr "" -msgid "" -"`#2504 `__: To C++ pg " -"data get, fetch and check." +msgid "`#2504 `__: To C++ pg data get, fetch and check." msgstr "" msgid "Stopping support for compilation with MSVC." msgstr "" -msgid "" -"`#2505 `__: Using " -"namespace." +msgid "`#2505 `__: Using namespace." msgstr "" -msgid "" -"`#2512 `__: [Dijkstra] " -"Removing duplicate code on Dijkstra." +msgid "`#2512 `__: [Dijkstra] Removing duplicate code on Dijkstra." msgstr "" -msgid "" -"`#2517 `__: Astar code " -"simplification." +msgid "`#2517 `__: Astar code simplification." msgstr "" -msgid "" -"`#2521 `__: Dijkstra " -"code simplification." +msgid "`#2521 `__: Dijkstra code simplification." msgstr "" -msgid "" -"`#2522 `__: bdAstar code " -"simplification." +msgid "`#2522 `__: bdAstar code simplification." msgstr "" -msgid "" -"`#2490 `__: Automatic " -"page history links." +msgid "`#2490 `__: Automatic page history links." msgstr "" msgid "..rubric:: Standardize SQL" msgstr "" -msgid "" -"`#2555 `__: Standardize " -"deprecated messages" +msgid "`#2555 `__: Standardize deprecated messages" msgstr "" -msgid "" -"On new internal function: do not use named parameters and default parameters." +msgid "On new internal function: do not use named parameters and default parameters." msgstr "" msgid "pgRouting 3.5" @@ -16888,10 +14210,7 @@ msgstr "" msgid "pgRouting 3.5.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.5.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.5.1 `__" msgstr "" #, fuzzy @@ -16916,22 +14235,16 @@ msgstr "" msgid "Issue fixes" msgstr "" -msgid "" -"`#2565 `__: " -"pgr_lengauerTarjanDominatorTree triggers an assertion" +msgid "`#2565 `__: pgr_lengauerTarjanDominatorTree triggers an assertion" msgstr "" msgid "SQL enhancements" msgstr "" -msgid "" -"`#2561 `__: Not use " -"wildcards on SQL" +msgid "`#2561 `__: Not use wildcards on SQL" msgstr "" -msgid "" -"`#2559 `__: pgtap test " -"using sampledata" +msgid "`#2559 `__: pgtap test using sampledata" msgstr "" msgid "Build fixes" @@ -16949,10 +14262,7 @@ msgstr "" msgid "pgRouting 3.5.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.5.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.5.0 `__" msgstr "" msgid "Dijkstra" @@ -16964,54 +14274,34 @@ msgstr "" msgid "pgRouting 3.4.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.4.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.4.2 `__" msgstr "" -msgid "" -"`#2394 `__: pgr_bdAstar " -"accumulates heuristic cost in visited node cost." +msgid "`#2394 `__: pgr_bdAstar accumulates heuristic cost in visited node cost." msgstr "" -msgid "" -"`#2427 `__: " -"pgr_createVerticesTable & pgr_createTopology, variable should be of type " -"Record." +msgid "`#2427 `__: pgr_createVerticesTable & pgr_createTopology, variable should be of type Record." msgstr "" msgid "pgRouting 3.4.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.4.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.4.1 `__" msgstr "" -msgid "" -"`#2401 `__: pgRouting " -"3.4.0 do not build docs when sphinx is too low or missing" +msgid "`#2401 `__: pgRouting 3.4.0 do not build docs when sphinx is too low or missing" msgstr "" -msgid "" -"`#2398 `__: v3.4.0 does " -"not upgrade from 3.3.3" +msgid "`#2398 `__: v3.4.0 does not upgrade from 3.3.3" msgstr "" msgid "pgRouting 3.4.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.4.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.4.0 `__" msgstr "" -msgid "" -"`#1891 `__: pgr_ksp " -"doesn't give all correct shortest path" +msgid "`#1891 `__: pgr_ksp doesn't give all correct shortest path" msgstr "" #, fuzzy @@ -17093,47 +14383,31 @@ msgstr "" msgid "pgRouting 3.3.5 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.5 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.5 `__" msgstr "" msgid "pgRouting 3.3.4 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.4 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.4 `__" msgstr "" -msgid "" -"`#2400 `__: pgRouting " -"3.3.3 does not build in focal" +msgid "`#2400 `__: pgRouting 3.3.3 does not build in focal" msgstr "" msgid "pgRouting 3.3.3 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.3 `__" msgstr "" -msgid "" -"Ignoring optional boolean parameter, as the algorithm works only for " -"undirected graphs." +msgid "Ignoring optional boolean parameter, as the algorithm works only for undirected graphs." msgstr "" msgid "pgRouting 3.3.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.2 `__" msgstr "" msgid "Revised documentation" @@ -17166,72 +14440,46 @@ msgstr "" msgid "Restructure of the pgRouting concepts page." msgstr "" -msgid "" -"`#2276 `__: " -"edgeDisjointPaths issues with start_vid and combinations" +msgid "`#2276 `__: edgeDisjointPaths issues with start_vid and combinations" msgstr "" -msgid "" -"`#2312 `__: " -"pgr_extractVertices error when target is not BIGINT" +msgid "`#2312 `__: pgr_extractVertices error when target is not BIGINT" msgstr "" -msgid "" -"`#2357 `__: Apply clang-" -"tidy performance-*" +msgid "`#2357 `__: Apply clang-tidy performance-*" msgstr "" msgid "pgRouting 3.3.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.1 `__" msgstr "" -msgid "" -"`#2216 `__: Warnings " -"when using clang" +msgid "`#2216 `__: Warnings when using clang" msgstr "" -msgid "" -"`#2266 `__: Error " -"processing restrictions" +msgid "`#2266 `__: Error processing restrictions" msgstr "" msgid "pgRouting 3.3.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.0 `__" msgstr "" -msgid "" -"`#2057 `__: trspViaEdges " -"columns in different order" +msgid "`#2057 `__: trspViaEdges columns in different order" msgstr "" -msgid "" -"`#2087 `__: " -"pgr_extractVertices to proposed" +msgid "`#2087 `__: pgr_extractVertices to proposed" msgstr "" -msgid "" -"`#2201 `__: " -"pgr_depthFirstSearch to proposed" +msgid "`#2201 `__: pgr_depthFirstSearch to proposed" msgstr "" -msgid "" -"`#2202 `__: " -"pgr_sequentialVertexColoring to proposed" +msgid "`#2202 `__: pgr_sequentialVertexColoring to proposed" msgstr "" -msgid "" -"`#2203 `__: " -"pgr_dijkstraNear and pgr_dijkstraNearCost to proposed" +msgid "`#2203 `__: pgr_dijkstraNear and pgr_dijkstraNearCost to proposed" msgstr "" msgid "Coloring" @@ -17282,42 +14530,28 @@ msgstr "" msgid "pgRouting 3.2.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.2.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.2.2 `__" msgstr "" -msgid "" -"`#2093 `__: Compilation " -"on Visual Studio" +msgid "`#2093 `__: Compilation on Visual Studio" msgstr "" -msgid "" -"`#2189 `__: Build error " -"on RHEL 7" +msgid "`#2189 `__: Build error on RHEL 7" msgstr "" msgid "pgRouting 3.2.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.2.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.2.1 `__" msgstr "" -msgid "" -"`#1883 `__: " -"pgr_TSPEuclidean crashes connection on Windows" +msgid "`#1883 `__: pgr_TSPEuclidean crashes connection on Windows" msgstr "" msgid "The solution is to use Boost::graph::metric_tsp_approx" msgstr "" -msgid "" -"To not break user's code the optional parameters related to the TSP " -"Annaeling are ignored" +msgid "To not break user's code the optional parameters related to the TSP Annaeling are ignored" msgstr "" msgid "The function with the annaeling optional parameters is deprecated" @@ -17326,15 +14560,10 @@ msgstr "" msgid "pgRouting 3.2.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.2.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.2.0 `__" msgstr "" -msgid "" -"`#1850 `__: Change Boost " -"min version to 1.56" +msgid "`#1850 `__: Change Boost min version to 1.56" msgstr "" msgid "Removing support for Boost v1.53, v1.54 & v1.55" @@ -17367,10 +14596,7 @@ msgstr "" msgid "pgRouting 3.1.4 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.1.4 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.4 `__" msgstr "" msgid "Issues fixes" @@ -17379,102 +14605,64 @@ msgstr "" msgid "pgRouting 3.1.3 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.1.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.3 `__" msgstr "" -msgid "" -"`#1825 `__: Boost " -"versions are not honored" +msgid "`#1825 `__: Boost versions are not honored" msgstr "" -msgid "" -"`#1849 `__: Boost 1.75.0 " -"geometry \"point_xy.hpp\" build error on macOS environment" +msgid "`#1849 `__: Boost 1.75.0 geometry \"point_xy.hpp\" build error on macOS environment" msgstr "" -msgid "" -"`#1861 `__: vrp " -"functions crash server" +msgid "`#1861 `__: vrp functions crash server" msgstr "" msgid "pgRouting 3.1.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.1.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.2 `__" msgstr "" -msgid "" -"`#1304 `__: FreeBSD 12 " -"64-bit crashes on pgr_vrOneDepot tests Experimental Function" +msgid "`#1304 `__: FreeBSD 12 64-bit crashes on pgr_vrOneDepot tests Experimental Function" msgstr "" -msgid "" -"`#1356 `__: tools/" -"testers/pg_prove_tests.sh fails when PostgreSQL port is not passed" +msgid "`#1356 `__: tools/testers/pg_prove_tests.sh fails when PostgreSQL port is not passed" msgstr "" -msgid "" -"`#1725 `__: Server crash " -"on pgr_pickDeliver and pgr_vrpOneDepot on openbsd" +msgid "`#1725 `__: Server crash on pgr_pickDeliver and pgr_vrpOneDepot on openbsd" msgstr "" -msgid "" -"`#1760 `__: TSP server " -"crash on ubuntu 20.04 #1760" +msgid "`#1760 `__: TSP server crash on ubuntu 20.04 #1760" msgstr "" -msgid "" -"`#1770 `__: Remove " -"warnings when using clang compiler" +msgid "`#1770 `__: Remove warnings when using clang compiler" msgstr "" msgid "pgRouting 3.1.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.1.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.1 `__" msgstr "" -msgid "" -"`#1733 `__: pgr_bdAstar " -"fails when source or target vertex does not exist in the graph" +msgid "`#1733 `__: pgr_bdAstar fails when source or target vertex does not exist in the graph" msgstr "" -msgid "" -"`#1647 `__: Linear " -"Contraction contracts self loops" +msgid "`#1647 `__: Linear Contraction contracts self loops" msgstr "" -msgid "" -"`#1640 `__: " -"pgr_withPoints fails when points_sql is empty" +msgid "`#1640 `__: pgr_withPoints fails when points_sql is empty" msgstr "" -msgid "" -"`#1616 `__: Path " -"evaluation on C++ not updated before the results go back to C" +msgid "`#1616 `__: Path evaluation on C++ not updated before the results go back to C" msgstr "" -msgid "" -"`#1300 `__: " -"pgr_chinesePostman crash on test data" +msgid "`#1300 `__: pgr_chinesePostman crash on test data" msgstr "" msgid "pgRouting 3.1.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.1.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.0 `__" msgstr "" msgid "pgr_dijkstra(combinations)" @@ -17495,19 +14683,13 @@ msgstr "" msgid "pgRouting 3.0.6 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.6 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.6 `__" msgstr "" msgid "pgRouting 3.0.5 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.5 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.5 `__" msgstr "" msgid "Backport issue fixes" @@ -17516,89 +14698,58 @@ msgstr "" msgid "pgRouting 3.0.4 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.4 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.4 `__" msgstr "" msgid "pgRouting 3.0.3 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.3 `__" msgstr "" msgid "pgRouting 3.0.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.2 `__" msgstr "" -msgid "" -"`#1378 `__: Visual " -"Studio build failing" +msgid "`#1378 `__: Visual Studio build failing" msgstr "" msgid "pgRouting 3.0.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.1 `__" msgstr "" -msgid "" -"`#232 `__: Honor client " -"cancel requests in C /C++ code" +msgid "`#232 `__: Honor client cancel requests in C /C++ code" msgstr "" msgid "pgRouting 3.0.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.0 `__" msgstr "" msgid "Fixed Issues" msgstr "" -msgid "" -"`#1153 `__: Renamed " -"pgr_eucledianTSP to pgr_TSPeuclidean" +msgid "`#1153 `__: Renamed pgr_eucledianTSP to pgr_TSPeuclidean" msgstr "" -msgid "" -"`#1188 `__: Removed CGAL " -"dependency" +msgid "`#1188 `__: Removed CGAL dependency" msgstr "" -msgid "" -"`#1002 `__: Fixed " -"contraction issues:" +msgid "`#1002 `__: Fixed contraction issues:" msgstr "" -msgid "" -"`#1004 `__: Contracts " -"when forbidden vertices do not belong to graph" +msgid "`#1004 `__: Contracts when forbidden vertices do not belong to graph" msgstr "" -msgid "" -"`#1005 `__: Intermideate " -"results eliminated" +msgid "`#1005 `__: Intermideate results eliminated" msgstr "" -msgid "" -"`#1006 `__: No loss of " -"information" +msgid "`#1006 `__: No loss of information" msgstr "" msgid "New Functions" @@ -17853,58 +15004,37 @@ msgstr "" msgid "pgRouting 2.6.3 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.6.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.3 `__" msgstr "" -msgid "" -"`#1219 `__: Implicit " -"cast for via_path integer to text" +msgid "`#1219 `__: Implicit cast for via_path integer to text" msgstr "" -msgid "" -"`#1193 `__: Fixed " -"pgr_pointsAsPolygon breaking when comparing strings in WHERE clause" +msgid "`#1193 `__: Fixed pgr_pointsAsPolygon breaking when comparing strings in WHERE clause" msgstr "" -msgid "" -"`#1185 `__: Improve " -"FindPostgreSQL.cmake" +msgid "`#1185 `__: Improve FindPostgreSQL.cmake" msgstr "" msgid "pgRouting 2.6.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.6.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.2 `__" msgstr "" -msgid "" -"`#1152 `__: Fixes " -"driving distance when vertex is not part of the graph" +msgid "`#1152 `__: Fixes driving distance when vertex is not part of the graph" msgstr "" -msgid "" -"`#1098 `__: Fixes " -"windows test" +msgid "`#1098 `__: Fixes windows test" msgstr "" -msgid "" -"`#1165 `__: Fixes build " -"for python3 and perl5" +msgid "`#1165 `__: Fixes build for python3 and perl5" msgstr "" msgid "pgRouting 2.6.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.6.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.1 `__" msgstr "" msgid "Fixes server crash on several functions." @@ -17985,18 +15115,13 @@ msgstr "" msgid "pgRouting 2.6.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.6.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.0 `__" msgstr "" msgid "pgr_lineGraphFull" msgstr "" -msgid "" -"Fix pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean[,text])" +msgid "Fix pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean[,text])" msgstr "" msgid "without restrictions" @@ -18017,9 +15142,7 @@ msgstr "" msgid "Internal code" msgstr "" -msgid "" -"Cleaned the internal code of trsp(text,integer,integer,boolean,boolean [, " -"text])" +msgid "Cleaned the internal code of trsp(text,integer,integer,boolean,boolean [, text])" msgstr "" msgid "Removed the use of pointers" @@ -18037,10 +15160,7 @@ msgstr "" msgid "pgRouting 2.5.5 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.5 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.5 `__" msgstr "" msgid "Fixes driving distance when vertex is not part of the graph" @@ -18055,33 +15175,22 @@ msgstr "" msgid "pgRouting 2.5.4 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.4 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.4 `__" msgstr "" msgid "pgRouting 2.5.3 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.3 `__" msgstr "" -msgid "" -"Fix for postgresql 11: Removed a compilation error when compiling with " -"postgreSQL" +msgid "Fix for postgresql 11: Removed a compilation error when compiling with postgreSQL" msgstr "" msgid "pgRouting 2.5.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.2 `__" msgstr "" msgid "Fix for postgresql 10.1: Removed a compiler condition" @@ -18090,10 +15199,7 @@ msgstr "" msgid "pgRouting 2.5.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.1 `__" msgstr "" msgid "Fixed prerequisite minimum version of: cmake" @@ -18102,10 +15208,7 @@ msgstr "" msgid "pgRouting 2.5.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.0 `__" msgstr "" msgid "enhancement:" @@ -18169,10 +15272,7 @@ msgstr "" msgid "pgRouting 2.4.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.4.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.4.2 `__" msgstr "" msgid "Improvement" @@ -18184,17 +15284,13 @@ msgstr "" msgid "Fixed: Unexpected error column \"cname\"" msgstr "" -msgid "" -"Replace __linux__ with __GLIBC__ for glibc-specific headers and functions" +msgid "Replace __linux__ with __GLIBC__ for glibc-specific headers and functions" msgstr "" msgid "pgRouting 2.4.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.4.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.4.1 `__" msgstr "" msgid "Fixed compiling error on macOS" @@ -18206,10 +15302,7 @@ msgstr "" msgid "pgRouting 2.4.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.4.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.4.0 `__" msgstr "" msgid "Deprecated signatures." @@ -18236,10 +15329,7 @@ msgstr "" msgid "pgRouting 2.3.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.3.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.3.2 `__" msgstr "" msgid "Fixed pgr_gsoc_vrppdtw crash when all orders fit on one truck." @@ -18257,10 +15347,7 @@ msgstr "" msgid "pgRouting 2.3.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.3.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.3.1 `__" msgstr "" msgid "Leaks on proposed max_flow functions" @@ -18275,10 +15362,7 @@ msgstr "" msgid "pgRouting 2.3.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.3.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.3.0 `__" msgstr "" msgid "pgr_eucledianTSP" @@ -18350,10 +15434,7 @@ msgstr "" msgid "pgRouting 2.2.4 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.2.4 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.4 `__" msgstr "" msgid "Bogus uses of extern \"C\"" @@ -18368,10 +15449,7 @@ msgstr "" msgid "pgRouting 2.2.3 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.2.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.3 `__" msgstr "" msgid "Fixed compatibility issues with PostgreSQL 9.6." @@ -18380,10 +15458,7 @@ msgstr "" msgid "pgRouting 2.2.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.2.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.2 `__" msgstr "" msgid "Fixed regression error on pgr_drivingDistance" @@ -18392,10 +15467,7 @@ msgstr "" msgid "pgRouting 2.2.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.2.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.1 `__" msgstr "" msgid "Server crash fix on pgr_alphaShape" @@ -18407,10 +15479,7 @@ msgstr "" msgid "pgRouting 2.2.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.2.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.0 `__" msgstr "" msgid "Improvements" @@ -18501,10 +15570,7 @@ msgstr "" msgid "pgRouting 2.1.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.1.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.1.0 `__" msgstr "" msgid "Refactored" @@ -18513,40 +15579,28 @@ msgstr "" msgid "pgr_dijkstra(One to One)" msgstr "" -msgid "" -"pgr_alphaShape function now can generate better (multi)polygon with holes " -"and alpha parameter." +msgid "pgr_alphaShape function now can generate better (multi)polygon with holes and alpha parameter." msgstr "" -msgid "" -"Proposed functions from Steve Woodbridge, (Classified as Convenience by the " -"author.)" +msgid "Proposed functions from Steve Woodbridge, (Classified as Convenience by the author.)" msgstr "" -msgid "" -"pgr_pointToEdgeNode - convert a point geometry to a vertex_id based on " -"closest edge." +msgid "pgr_pointToEdgeNode - convert a point geometry to a vertex_id based on closest edge." msgstr "" -msgid "" -"pgr_flipEdges - flip the edges in an array of geometries so the connect end " -"to end." +msgid "pgr_flipEdges - flip the edges in an array of geometries so the connect end to end." msgstr "" -msgid "" -"pgr_textToPoints - convert a string of x,y;x,y;... locations into point " -"geometries." +msgid "pgr_textToPoints - convert a string of x,y;x,y;... locations into point geometries." msgstr "" -msgid "" -"pgr_pointsToVids - convert an array of point geometries into vertex ids." +msgid "pgr_pointsToVids - convert an array of point geometries into vertex ids." msgstr "" msgid "pgr_pointsToDMatrix - Create a distance matrix from an array of points." msgstr "" -msgid "" -"pgr_vidsToDMatrix - Create a distance matrix from an array of vertix_id." +msgid "pgr_vidsToDMatrix - Create a distance matrix from an array of vertix_id." msgstr "" msgid "Added proposed functions from GSoc Projects:" @@ -18618,9 +15672,7 @@ msgstr "" msgid "allow any-numerical on the cost/reverse_cost columns" msgstr "" -msgid "" -"Instead of generating many libraries: - All functions are encapsulated in " -"one library - The library has the prefix 2-1-0" +msgid "Instead of generating many libraries: - All functions are encapsulated in one library - The library has the prefix 2-1-0" msgstr "" msgid "pgRouting 2.0" @@ -18629,10 +15681,7 @@ msgstr "" msgid "pgRouting 2.0.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.0.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.0.1 `__" msgstr "" msgid "Minor bug fixes." @@ -18644,16 +15693,10 @@ msgstr "" msgid "pgRouting 2.0.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.0.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.0.0 `__" msgstr "" -msgid "" -"With the release of pgRouting 2.0.0 the library has abandoned backwards " -"compatibility to `pgRouting 1.0`_ releases. The main Goals for this release " -"are:" +msgid "With the release of pgRouting 2.0.0 the library has abandoned backwards compatibility to `pgRouting 1.0`_ releases. The main Goals for this release are:" msgstr "" msgid "Major restructuring of pgRouting." @@ -18686,21 +15729,16 @@ msgstr "" msgid "Important Changes" msgstr "" -msgid "" -"Graph Analytics - tools for detecting and fixing connection some problems in " -"a graph" +msgid "Graph Analytics - tools for detecting and fixing connection some problems in a graph" msgstr "" msgid "A collection of useful utility functions" msgstr "" -msgid "" -"Two new All Pairs Short Path algorithms (pgr_apspJohnson, pgr_apspWarshall)" +msgid "Two new All Pairs Short Path algorithms (pgr_apspJohnson, pgr_apspWarshall)" msgstr "" -msgid "" -"Bi-directional Dijkstra and A-star search algorithms (pgr_bdAstar, " -"pgr_bdDijkstra)" +msgid "Bi-directional Dijkstra and A-star search algorithms (pgr_bdAstar, pgr_bdDijkstra)" msgstr "" msgid "One to many nodes search (pgr_kDijkstra)" @@ -18709,9 +15747,7 @@ msgstr "" msgid "K alternate paths shortest path (pgr_ksp)" msgstr "" -msgid "" -"New TSP solver that simplifies the code and the build process (pgr_tsp), " -"dropped \"Gaul Library\" dependency" +msgid "New TSP solver that simplifies the code and the build process (pgr_tsp), dropped \"Gaul Library\" dependency" msgstr "" msgid "Turn Restricted shortest path (pgr_trsp) that replaces Shooting Star" @@ -18720,21 +15756,16 @@ msgstr "" msgid "Dropped support for Shooting Star" msgstr "" -msgid "" -"Built a test infrastructure that is run before major code changes are " -"checked in" +msgid "Built a test infrastructure that is run before major code changes are checked in" msgstr "" -msgid "" -"Tested and fixed most all of the outstanding bugs reported against 1.x that " -"existing in the 2.0-dev code base." +msgid "Tested and fixed most all of the outstanding bugs reported against 1.x that existing in the 2.0-dev code base." msgstr "" msgid "Improved build process for Windows" msgstr "" -msgid "" -"Automated testing on Linux and Windows platforms trigger by every commit" +msgid "Automated testing on Linux and Windows platforms trigger by every commit" msgstr "" msgid "Modular library design" @@ -18773,11 +15804,7 @@ msgstr "" msgid "pgRouting 1.0" msgstr "" -msgid "" -"To see the issues closed by this release see the `Git closed issues for 1.x " -"`_ on Github. The following release notes have been copied " -"from the previous ``RELEASE_NOTES`` file and are kept as a reference." +msgid "To see the issues closed by this release see the `Git closed issues for 1.x `_ on Github. The following release notes have been copied from the previous ``RELEASE_NOTES`` file and are kept as a reference." msgstr "" msgid "Changes for release 1.05" @@ -18831,8 +15858,7 @@ msgstr "" msgid "PostgreSQL 8.2 support" msgstr "" -msgid "" -"Shortest path functions return empty result if they could not find any path" +msgid "Shortest path functions return empty result if they could not find any path" msgstr "" msgid "Changes for release 0.9.8" @@ -18853,10 +15879,7 @@ msgstr "" msgid "Sample Data" msgstr "サンプルデータ" -msgid "" -"The documentation provides very simple example queries based on a small " -"sample network that resembles a city. To be able to execute the majority of " -"the examples queries, follow the instructions below." +msgid "The documentation provides very simple example queries based on a small sample network that resembles a city. To be able to execute the majority of the examples queries, follow the instructions below." msgstr "" msgid "Main graph" @@ -18868,22 +15891,13 @@ msgstr "" msgid "The following city is to be inserted into the database:" msgstr "" -msgid "" -"Information known at this point is the geometry of the edges, cost values, " -"capacity values, category values and some locations that are not in the " -"graph." +msgid "Information known at this point is the geometry of the edges, cost values, capacity values, category values and some locations that are not in the graph." msgstr "" -msgid "" -"The process to have working topology starts by inserting the edges. After " -"that everything else is calculated." +msgid "The process to have working topology starts by inserting the edges. After that everything else is calculated." msgstr "" -msgid "" -"The database design for the documentation of pgRouting, keeps in the same " -"row 2 segments, one in the direction of the geometry and the second in the " -"opposite direction. Therefore some information has the ``reverse_`` prefix " -"which corresponds to the segment on the opposite direction of the geometry." +msgid "The database design for the documentation of pgRouting, keeps in the same row 2 segments, one in the direction of the geometry and the second in the opposite direction. Therefore some information has the ``reverse_`` prefix which corresponds to the segment on the opposite direction of the geometry." msgstr "" msgid "Identifier of the starting vertex of the geometry ``geom``." @@ -18913,17 +15927,13 @@ msgstr "" msgid ":math:`x` coordinate of the starting vertex of the geometry." msgstr "" -msgid "" -"For convenience it is saved on the table but can be calculated as " -"``ST_X(ST_StartPoint(geom))``." +msgid "For convenience it is saved on the table but can be calculated as ``ST_X(ST_StartPoint(geom))``." msgstr "" msgid ":math:`y` coordinate of the ending vertex of the geometry." msgstr "" -msgid "" -"For convenience it is saved on the table but can be calculated as " -"``ST_Y(ST_EndPoint(geom))``." +msgid "For convenience it is saved on the table but can be calculated as ``ST_Y(ST_EndPoint(geom))``." msgstr "" msgid "The geometry of the segments." @@ -18932,21 +15942,16 @@ msgstr "" msgid "Starting on PostgreSQL 12::" msgstr "" -msgid "" -"Optionally indexes on different columns can be created. The recommendation " -"is to have" +msgid "Optionally indexes on different columns can be created. The recommendation is to have" msgstr "" msgid "``id`` indexed." msgstr "" -msgid "" -"``source`` and ``target`` columns indexed to speed up pgRouting queries." +msgid "``source`` and ``target`` columns indexed to speed up pgRouting queries." msgstr "" -msgid "" -"``geom`` indexed to speed up geometry processes that might be needed in the " -"front end." +msgid "``geom`` indexed to speed up geometry processes that might be needed in the front end." msgstr "" msgid "For this small example the indexes are skipped, except for ``id``" @@ -18958,23 +15963,16 @@ msgstr "" msgid "Inserting into the database the information of the edges:" msgstr "" -msgid "" -"Negative values on the cost, capacity and category means that the edge do " -"not exist." +msgid "Negative values on the cost, capacity and category means that the edge do not exist." msgstr "" msgid "Vertices" msgstr "" -msgid "" -"The vertex information is calculated based on the identifier of the edge and " -"the geometry and saved on a table. Saving all the information provided by :" -"doc:`pgr_extractVertices`:" +msgid "The vertex information is calculated based on the identifier of the edge and the geometry and saved on a table. Saving all the information provided by :doc:`pgr_extractVertices`:" msgstr "" -msgid "" -"In this case the because the ``CREATE`` statement was not used, the " -"definition of an index on the table is needed." +msgid "In this case the because the ``CREATE`` statement was not used, the definition of an index on the table is needed." msgstr "" msgid "The structure of the table is:" @@ -18986,17 +15984,13 @@ msgstr "" msgid "The saved information of the vertices is:" msgstr "" -msgid "" -"Here is where adding more columns to the vertices table can be done. " -"Additional columns names and types will depend on the application." +msgid "Here is where adding more columns to the vertices table can be done. Additional columns names and types will depend on the application." msgstr "" msgid "The topology" msgstr "" -msgid "" -"This queries based on the vertices data create a topology by filling the " -"``source`` and ``target`` columns in the edges table." +msgid "This queries based on the vertices data create a topology by filling the ``source`` and ``target`` columns in the edges table." msgstr "" msgid "Topology data" @@ -19008,14 +16002,10 @@ msgstr "" msgid "Support tables" msgstr "" -msgid "" -"Many functions can be used with a combinations of ``(source, target)`` pairs " -"when wanting a route from ``source`` to ``target``." +msgid "Many functions can be used with a combinations of ``(source, target)`` pairs when wanting a route from ``source`` to ``target``." msgstr "" -msgid "" -"For convenience of this documentation, some combinations will be stored on a " -"table:" +msgid "For convenience of this documentation, some combinations will be stored on a table:" msgstr "" msgid "Inserting the data:" @@ -19045,9 +16035,7 @@ msgstr "" msgid "Directed graph with ``cost`` and ``reverse_cost``" msgstr "" -msgid "" -"When working with city networks, this is recommended for point of view of " -"vehicles." +msgid "When working with city networks, this is recommended for point of view of vehicles." msgstr "" msgid "Directed, with cost and reverse_cost" @@ -19056,9 +16044,7 @@ msgstr "" msgid "Undirected graph with ``cost`` and ``reverse_cost``" msgstr "" -msgid "" -"When working with city networks, this is recommended for point of view of " -"pedestrians." +msgid "When working with city networks, this is recommended for point of view of pedestrians." msgstr "" msgid "Undirected, with cost and reverse cost" @@ -19082,111 +16068,70 @@ msgstr "" msgid "Spanning Tree - Category" msgstr "" -msgid "" -"A spanning tree of an undirected graph is a tree that includes all the " -"vertices of G with the minimum possible number of edges." +msgid "A spanning tree of an undirected graph is a tree that includes all the vertices of G with the minimum possible number of edges." msgstr "" -msgid "" -"For a disconnected graph, there there is no single tree, but a spanning " -"forest, consisting of a spanning tree of each connected component." +msgid "For a disconnected graph, there there is no single tree, but a spanning forest, consisting of a spanning tree of each connected component." msgstr "" msgid "Characteristics:" msgstr "" -msgid "" -"pgRouting community support is available through the `pgRouting website " -"`_, `documentation `_, tutorials, mailing lists and others. If you’re looking " -"for :ref:`commercial support `, find below a list of " -"companies providing pgRouting development and consulting services." +msgid "pgRouting community support is available through the `pgRouting website `_, `documentation `_, tutorials, mailing lists and others. If you’re looking for :ref:`commercial support `, find below a list of companies providing pgRouting development and consulting services." msgstr "" msgid "Reporting Problems" msgstr "" -msgid "" -"Bugs are reported and managed in an `issue tracker `_. Please follow these steps:" +msgid "Bugs are reported and managed in an `issue tracker `_. Please follow these steps:" msgstr "" -msgid "" -"Search the tickets to see if your problem has already been reported. If so, " -"add any extra context you might have found, or at least indicate that you " -"too are having the problem. This will help us prioritize common issues." +msgid "Search the tickets to see if your problem has already been reported. If so, add any extra context you might have found, or at least indicate that you too are having the problem. This will help us prioritize common issues." msgstr "" -msgid "" -"If your problem is unreported, create a `new issue `__ for it." +msgid "If your problem is unreported, create a `new issue `__ for it." msgstr "" -msgid "" -"In your report include explicit instructions to replicate your issue. The " -"best tickets include the exact SQL necessary to replicate a problem." +msgid "In your report include explicit instructions to replicate your issue. The best tickets include the exact SQL necessary to replicate a problem." msgstr "" -msgid "" -"If you can test older versions of PostGIS for your problem, please do. On " -"your ticket, note the earliest version the problem appears." +msgid "If you can test older versions of PostGIS for your problem, please do. On your ticket, note the earliest version the problem appears." msgstr "" -msgid "" -"For the versions where you can replicate the problem, note the operating " -"system and version of pgRouting, PostGIS and PostgreSQL." +msgid "For the versions where you can replicate the problem, note the operating system and version of pgRouting, PostGIS and PostgreSQL." msgstr "" -msgid "" -"It is recommended to use the following wrapper on the problem to pin point " -"the step that is causing the problem." +msgid "It is recommended to use the following wrapper on the problem to pin point the step that is causing the problem." msgstr "" msgid "Mailing List, Matrix, GIS StackExchange" msgstr "" -msgid "" -"There are two mailing lists for pgRouting hosted on OSGeo discourse server:" +msgid "There are two mailing lists for pgRouting hosted on OSGeo discourse server:" msgstr "" -msgid "" -"User mailing list: https://discourse.osgeo.org/c/pgrouting/pgrouting-users/" +msgid "User mailing list: https://discourse.osgeo.org/c/pgrouting/pgrouting-users/" msgstr "" -msgid "" -"Developer mailing list: https://discourse.osgeo.org/c/pgrouting/pgrouting-" -"dev/" +msgid "Developer mailing list: https://discourse.osgeo.org/c/pgrouting/pgrouting-dev/" msgstr "" msgid "Subscribe: https://discourse.osgeo.org/g/pgrouting-dev" msgstr "" -msgid "" -"For general questions and topics about how to use pgRouting, please write to " -"the user mailing list." +msgid "For general questions and topics about how to use pgRouting, please write to the user mailing list." msgstr "" -msgid "" -"If you want to chat with fellow pgRouting users and contributors, you can " -"join our matrix channel: `pgRouting matrix channel `_." +msgid "If you want to chat with fellow pgRouting users and contributors, you can join our matrix channel: `pgRouting matrix channel `_." msgstr "" -msgid "" -"You can also ask at `GIS StackExchange `_ " -"and tag the question with ``pgrouting``. Find all questions tagged with " -"``pgrouting`` under https://gis.stackexchange.com/questions/tagged/pgrouting " -"or subscribe to the `pgRouting questions feed `_." +msgid "You can also ask at `GIS StackExchange `_ and tag the question with ``pgrouting``. Find all questions tagged with ``pgrouting`` under https://gis.stackexchange.com/questions/tagged/pgrouting or subscribe to the `pgRouting questions feed `_." msgstr "" msgid "Commercial Support" msgstr "" -msgid "" -"For users who require professional support, development and consulting " -"services, consider contacting any of the following organizations, which have " -"significantly contributed to the development of pgRouting:" +msgid "For users who require professional support, development and consulting services, consider contacting any of the following organizations, which have significantly contributed to the development of pgRouting:" msgstr "" msgid "**Company**" @@ -19223,9 +16168,7 @@ msgstr "" msgid "Transformation - Family of functions" msgstr "ダイクストラ関連機能" -msgid "" -"This family of functions is used for transforming a given input graph :math:" -"`G(V,E)` into a new graph :math:`G'(V',E')`." +msgid "This family of functions is used for transforming a given input graph :math:`G(V,E)` into a new graph :math:`G'(V',E')`." msgstr "" msgid "Traversal - Family of functions" @@ -19241,14 +16184,10 @@ msgstr "" msgid "This category intends to solve the general problem:" msgstr "" -msgid "" -"Given a graph and a list of vertices, find the shortest path between :math:" -"`vertex_i` and :math:`vertex_{i+1}` for all vertices" +msgid "Given a graph and a list of vertices, find the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all vertices" msgstr "" -msgid "" -"In other words, find a continuous route that visits all the vertices in the " -"order given." +msgid "In other words, find a continuous route that visits all the vertices in the order given." msgstr "" msgid "path" @@ -19266,9 +16205,7 @@ msgstr "" msgid "**Used in:**" msgstr "" -msgid "" -"Besides the compulsory parameters each function has, there are optional " -"parameters that exist due to the kind of function." +msgid "Besides the compulsory parameters each function has, there are optional parameters that exist due to the kind of function." msgstr "" #, fuzzy @@ -19284,32 +16221,19 @@ msgstr "" msgid "When points are added to the graph." msgstr "" -msgid "" -"The **with points** category modifies the graph on the fly by adding points " -"on edges as required by the `Points SQL`_ query." +msgid "The **with points** category modifies the graph on the fly by adding points on edges as required by the `Points SQL`_ query." msgstr "" -msgid "" -"The functions within this category give the ability to process between " -"arbitrary points located outside the original graph." +msgid "The functions within this category give the ability to process between arbitrary points located outside the original graph." msgstr "" -msgid "" -"This category of functions was thought for routing vehicles, but might as " -"well work for some other application not involving vehicles." +msgid "This category of functions was thought for routing vehicles, but might as well work for some other application not involving vehicles." msgstr "" -msgid "" -"When given a point identifier ``pid`` that its being mapped to an edge with " -"an identifier ``edge_id``, with a fraction from the source to the target " -"along the edge ``fraction`` and some additional information about which side " -"of the edge the point is on ``side``, then processing from arbitrary points " -"can be done on fixed networks." +msgid "When given a point identifier ``pid`` that its being mapped to an edge with an identifier ``edge_id``, with a fraction from the source to the target along the edge ``fraction`` and some additional information about which side of the edge the point is on ``side``, then processing from arbitrary points can be done on fixed networks." msgstr "" -msgid "" -"All this functions consider as many traits from the \"real world\" as " -"possible:" +msgid "All this functions consider as many traits from the \"real world\" as possible:" msgstr "" msgid "Kind of graph:" @@ -19326,8 +16250,7 @@ msgstr "導かれないグラフ" msgid "Arriving at the point:" msgstr "" -msgid "" -"Compulsory arrival on the side of the segment where the point is located." +msgid "Compulsory arrival on the side of the segment where the point is located." msgstr "" msgid "On either side of the segment." @@ -19345,13 +16268,10 @@ msgstr "" msgid "Some points are:" msgstr "" -msgid "" -"**Permanent**: for example the set of points of clients stored in a table in " -"the data base." +msgid "**Permanent**: for example the set of points of clients stored in a table in the data base." msgstr "" -msgid "" -"The graph has been modified to permanently have those points as vertices." +msgid "The graph has been modified to permanently have those points as vertices." msgstr "" msgid "There is a table on the database that describes the points" @@ -19363,9 +16283,7 @@ msgstr "" msgid "The numbering of the points are handled with negative sign." msgstr "" -msgid "" -"This sign change is to avoid confusion when there is a vertex with the same " -"identifier as the point identifier." +msgid "This sign change is to avoid confusion when there is a vertex with the same identifier as the point identifier." msgstr "" msgid "Original point identifiers are to be positive." @@ -19386,10 +16304,7 @@ msgstr "" msgid "About points" msgstr "" -msgid "" -"For this section the following city (see :doc:`sampledata`) some interesting " -"points such as restaurant, supermarket, post office, etc. will be used as " -"example." +msgid "For this section the following city (see :doc:`sampledata`) some interesting points such as restaurant, supermarket, post office, etc. will be used as example." msgstr "" msgid "The graph is **directed**" @@ -19401,9 +16316,7 @@ msgstr "" msgid "Blue arrows show the ``(target, source)`` of the edge on the edge table" msgstr "" -msgid "" -"Each point location shows where it is located with relation of the edge " -"``(source, target)``" +msgid "Each point location shows where it is located with relation of the edge ``(source, target)``" msgstr "" msgid "On the right for points **2** and **4**." @@ -19415,9 +16328,7 @@ msgstr "" msgid "On both sides for point **6**." msgstr "" -msgid "" -"The representation on the data base follows the `Points SQL`_ description, " -"and for this example:" +msgid "The representation on the data base follows the `Points SQL`_ description, and for this example:" msgstr "" msgid "Driving side" @@ -19433,9 +16344,7 @@ msgstr "" msgid "The temporary vertices are added according to the driving side," msgstr "" -msgid "" -"visually showing the differences on how depending on the driving side the " -"data is interpreted." +msgid "visually showing the differences on how depending on the driving side the data is interpreted." msgstr "" msgid "Point **1** located on edge ``(6, 5)``" @@ -19487,9 +16396,7 @@ msgstr "" msgid "Creating temporary vertices" msgstr "" -msgid "" -"This section will demonstrate how a temporary vertex is created internally " -"on the graph." +msgid "This section will demonstrate how a temporary vertex is created internally on the graph." msgstr "" msgid "Problem" @@ -19516,9 +16423,7 @@ msgstr "" msgid "Create two new edges:" msgstr "" -msgid "" -"Edge ``(16, -2)`` with cost ``0.4`` (original cost * fraction == :math:`1 * " -"0.4`)" +msgid "Edge ``(16, -2)`` with cost ``0.4`` (original cost * fraction == :math:`1 * 0.4`)" msgstr "" msgid "Edge ``(-2, 17)`` with cost ``0.6`` (the remaining cost)" @@ -19527,8 +16432,7 @@ msgstr "" msgid "The total cost of the additional edges is equal to the original cost." msgstr "" -msgid "" -"If more points are on the same edge, the process is repeated recursevly." +msgid "If more points are on the same edge, the process is repeated recursevly." msgstr "" msgid "On a left hand side driving network" @@ -19543,22 +16447,16 @@ msgstr "" msgid "It only affects the edge ``(17, 16)``, therefore the edge is removed." msgstr "" -msgid "" -"Work with the original edge ``(16, 17)`` as the fraction is a fraction of " -"the original:" +msgid "Work with the original edge ``(16, 17)`` as the fraction is a fraction of the original:" msgstr "" msgid "Flip the Edges and add them to the graph:" msgstr "" -msgid "" -"Edge ``(17, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the " -"graph." +msgid "Edge ``(17, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the graph." msgstr "" -msgid "" -"Edge ``(-2, 16)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the " -"graph." +msgid "Edge ``(-2, 16)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the graph." msgstr "" msgid "When driving side does not matter" @@ -19567,9 +16465,7 @@ msgstr "" msgid "Arrival to point ``-2`` can be achieved via vertices **16** or **17**." msgstr "" -msgid "" -"Affects the edges ``(16, 17)`` and ``(17, 16)``, therefore the edges are " -"removed." +msgid "Affects the edges ``(16, 17)`` and ``(17, 16)``, therefore the edges are removed." msgstr "" msgid "Create four new edges:" @@ -19584,23 +16480,16 @@ msgstr "" msgid "Edge ``(-2, 17)`` is added to the graph." msgstr "" -msgid "" -"Edge ``(16, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the " -"graph." +msgid "Edge ``(16, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the graph." msgstr "" -msgid "" -"Edge ``(-2, 17)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the " -"graph." +msgid "Edge ``(-2, 17)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the graph." msgstr "" msgid "withPoints - Family of functions" msgstr "" -msgid "" -"This family of functions belongs to the :doc:`withPoints-category` and the " -"functions that compose them are based one way or another on dijkstra " -"algorithm." +msgid "This family of functions belongs to the :doc:`withPoints-category` and the functions that compose them are based one way or another on dijkstra algorithm." msgstr "" msgid "Depending on the name:" diff --git a/locale/ko/LC_MESSAGES/pgrouting_doc_strings.po b/locale/ko/LC_MESSAGES/pgrouting_doc_strings.po index 88a55a26ab..0e503772a1 100644 --- a/locale/ko/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/ko/LC_MESSAGES/pgrouting_doc_strings.po @@ -7,11 +7,10 @@ msgid "" msgstr "" "Project-Id-Version: pgRouting v4.1\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2025-10-08 19:15+0000\n" +"POT-Creation-Date: 2025-12-05 23:37+0000\n" "PO-Revision-Date: 2025-09-22 16:28+0000\n" "Last-Translator: Hyung-Gyu Ryoo \n" -"Language-Team: Korean \n" +"Language-Team: Korean \n" "Language: ko\n" "MIME-Version: 1.0\n" "Content-Type: text/plain; charset=UTF-8\n" @@ -82,9 +81,7 @@ msgstr "" msgid "Identifier of the root vertex of the tree." msgstr "" -msgid "" -"When value is :math:`0` then gets the spanning forest starting in aleatory " -"nodes for each tree in the forest." +msgid "When value is :math:`0` then gets the spanning forest starting in aleatory nodes for each tree in the forest." msgstr "" msgid "**root vids**" @@ -183,9 +180,7 @@ msgstr "" msgid "Weight of the edge (``target``, ``source``)" msgstr "" -msgid "" -"When negative: edge (``target``, ``source``) does not exist, therefore it's " -"not part of the graph." +msgid "When negative: edge (``target``, ``source``) does not exist, therefore it's not part of the graph." msgstr "" msgid "``SMALLINT``, ``INTEGER``, ``BIGINT``" @@ -255,24 +250,16 @@ msgstr "" msgid "See Also" msgstr "" -msgid "" -"`Boost: Prim's algorithm `__" +msgid "`Boost: Prim's algorithm `__" msgstr "" -msgid "" -"`Boost: Kruskal's algorithm `__" +msgid "`Boost: Kruskal's algorithm `__" msgstr "" -msgid "" -"`Wikipedia: Prim's algorithm `__" +msgid "`Wikipedia: Prim's algorithm `__" msgstr "" -msgid "" -"`Wikipedia: Kruskal's algorithm `__" +msgid "`Wikipedia: Kruskal's algorithm `__" msgstr "" msgid "Indices and tables" @@ -318,8 +305,7 @@ msgstr "" msgid "Documentation might need refinement." msgstr "" -msgid "" -":doc:`pgr_depthFirstSearch` - Depth first search traversal of the graph." +msgid ":doc:`pgr_depthFirstSearch` - Depth first search traversal of the graph." msgstr "" msgid "In general:" @@ -350,8 +336,7 @@ msgstr "" msgid ":doc:`pgr_trsp_withPoints` - Vertex/Point routing with restrictions." msgstr "" -msgid "" -":doc:`pgr_trspVia_withPoints` - Via Vertex/point routing with restrictions." +msgid ":doc:`pgr_trspVia_withPoints` - Via Vertex/point routing with restrictions." msgstr "" #, fuzzy @@ -397,21 +382,13 @@ msgstr "" msgid "Introduction" msgstr "소개" -msgid "" -"Road restrictions are a sequence of road segments that can not be taken in a " -"sequential manner. Some restrictions are implicit on a directed graph, for " -"example, one way roads where the wrong way edge is not even inserted on the " -"graph. But normally on turns like no left turn or no right turn, hence the " -"name turn restrictions, there are sometimes restrictions." +msgid "Road restrictions are a sequence of road segments that can not be taken in a sequential manner. Some restrictions are implicit on a directed graph, for example, one way roads where the wrong way edge is not even inserted on the graph. But normally on turns like no left turn or no right turn, hence the name turn restrictions, there are sometimes restrictions." msgstr "" msgid "TRSP algorithm" msgstr "" -msgid "" -"The internal TRSP algorithm performs a lookahead over the dijkstra algorithm " -"in order to find out if the attempted path has a restriction. This allows " -"the algorithm to pass twice on the same vertex." +msgid "The internal TRSP algorithm performs a lookahead over the dijkstra algorithm in order to find out if the attempted path has a restriction. This allows the algorithm to pass twice on the same vertex." msgstr "" msgid "`Edges SQL`_ query as described." @@ -435,14 +412,10 @@ msgstr "" msgid "Restrictions" msgstr "" -msgid "" -"On road networks, there are restrictions such as left or right turn " -"restrictions, no U turn restrictions." +msgid "On road networks, there are restrictions such as left or right turn restrictions, no U turn restrictions." msgstr "" -msgid "" -"A restriction is a sequence of edges, called path and that path is to be " -"avoided." +msgid "A restriction is a sequence of edges, called path and that path is to be avoided." msgstr "" msgid "**Restrictions on the road network**" @@ -451,10 +424,7 @@ msgstr "" msgid "These restrictions are represented on a table as follows:" msgstr "" -msgid "" -"The table has an identifier, which maybe is needed for the administration of " -"the restrictions, but the algorithms do not need that information. If given " -"it will be ignored." +msgid "The table has an identifier, which maybe is needed for the administration of the restrictions, but the algorithms do not need that information. If given it will be ignored." msgstr "" msgid "Restrictions SQL" @@ -466,10 +436,7 @@ msgstr "" msgid "``ARRAY`` [**ANY-INTEGER**]" msgstr "" -msgid "" -"Sequence of edge identifiers that form a path that is not allowed to be " -"taken. - Empty arrays or ``NULL`` arrays are ignored. - Arrays that have a " -"``NULL`` element will raise an exception." +msgid "Sequence of edge identifiers that form a path that is not allowed to be taken. - Empty arrays or ``NULL`` arrays are ignored. - Arrays that have a ``NULL`` element will raise an exception." msgstr "" msgid "``Cost``" @@ -499,24 +466,16 @@ msgstr "" msgid "The travelling salesperson problem (TSP) asks the following question:" msgstr "" -msgid "" -"*Given a list of cities and the distances between each pair of cities, which " -"is the shortest possible route that visits each city exactly once and " -"returns to the origin city?*" +msgid "*Given a list of cities and the distances between each pair of cities, which is the shortest possible route that visits each city exactly once and returns to the origin city?*" msgstr "" msgid "Origin" msgstr "" -msgid "" -"The traveling sales person problem was studied in the 18th century by " -"mathematicians **Sir William Rowam Hamilton** and **Thomas Penyngton " -"Kirkman**." +msgid "The traveling sales person problem was studied in the 18th century by mathematicians **Sir William Rowam Hamilton** and **Thomas Penyngton Kirkman**." msgstr "" -msgid "" -"A discussion about the work of Hamilton & Kirkman can be found in the book " -"**Graph Theory (Biggs et al. 1976)**." +msgid "A discussion about the work of Hamilton & Kirkman can be found in the book **Graph Theory (Biggs et al. 1976)**." msgstr "" msgid "ISBN-13: 978-0198539162" @@ -525,13 +484,7 @@ msgstr "" msgid "ISBN-10: 0198539169" msgstr "" -msgid "" -"It is believed that the general form of the TSP have been first studied by " -"Kalr Menger in Vienna and Harvard. The problem was later promoted by " -"Hassler, Whitney & Merrill at Princeton. A detailed description about the " -"connection between Menger & Whitney, and the development of the TSP can be " -"found in `On the history of combinatorial optimization (till 1960) `__" +msgid "It is believed that the general form of the TSP have been first studied by Kalr Menger in Vienna and Harvard. The problem was later promoted by Hassler, Whitney & Merrill at Princeton. A detailed description about the connection between Menger & Whitney, and the development of the TSP can be found in `On the history of combinatorial optimization (till 1960) `__" msgstr "" msgid "To calculate the number of different tours through :math:`n` cities:" @@ -549,9 +502,7 @@ msgstr "" msgid "Multiplying these together we get :math:`(n-1)! = (n-1) (n-2) . . 1`." msgstr "" -msgid "" -"Now since the travel costs do not depend on the direction taken around the " -"tour:" +msgid "Now since the travel costs do not depend on the direction taken around the tour:" msgstr "" msgid "this number by 2" @@ -569,9 +520,7 @@ msgstr "" msgid "Metric Algorithm is used" msgstr "" -msgid "" -"Implementation generates solutions that *are twice as long as the optimal " -"tour in the worst case*:" +msgid "Implementation generates solutions that *are twice as long as the optimal tour in the worst case*:" msgstr "" msgid "Graph characteristics for best performance:" @@ -589,9 +538,7 @@ msgstr "" msgid "The traveling costs are symmetric:" msgstr "" -msgid "" -"Traveling costs from ``u`` to ``v`` are just as much as traveling from ``v`` " -"to ``u``" +msgid "Traveling costs from ``u`` to ``v`` are just as much as traveling from ``v`` to ``u``" msgstr "" msgid "TSP optional parameters" @@ -615,29 +562,22 @@ msgstr "" msgid "Last visiting vertex before returning to ``start_vid``." msgstr "" -msgid "" -"When ``0`` any vertex can become the last visiting vertex before returning " -"to ``start_id``." +msgid "When ``0`` any vertex can become the last visiting vertex before returning to ``start_id``." msgstr "" -msgid "" -"When ``NOT 0`` and ``start_id = 0`` then it is the first and last vertex" +msgid "When ``NOT 0`` and ``start_id = 0`` then it is the first and last vertex" msgstr "" msgid "References" msgstr "" -msgid "" -"`Boost: metric TSP approx `__" +msgid "`Boost: metric TSP approx `__" msgstr "" msgid "`University of Waterloo TSP `__" msgstr "" -msgid "" -"`Wikipedia: Traveling Salesman Problem `__" +msgid "`Wikipedia: Traveling Salesman Problem `__" msgstr "" msgid "Vehicle Routing Functions - Category" @@ -649,8 +589,7 @@ msgstr "" msgid ":doc:`pgr_pickDeliver` - Pickup & Delivery using a Cost Matrix" msgstr "" -msgid "" -":doc:`pgr_pickDeliverEuclidean` - Pickup & Delivery with Euclidean distances" +msgid ":doc:`pgr_pickDeliverEuclidean` - Pickup & Delivery with Euclidean distances" msgstr "" msgid "Distribution problem" @@ -662,9 +601,7 @@ msgstr "" msgid "Contents" msgstr "" -msgid "" -"Vehicle Routing Problems `VRP` are **NP-hard** optimization problem, it " -"generalises the travelling salesman problem (TSP)." +msgid "Vehicle Routing Problems `VRP` are **NP-hard** optimization problem, it generalises the travelling salesman problem (TSP)." msgstr "" msgid "The objective of the VRP is to minimize the total route cost." @@ -676,20 +613,13 @@ msgstr "" msgid "**pgRouting does not try to implement all variants.**" msgstr "" -msgid "" -"Capacitated Vehicle Routing Problem `CVRP` where The vehicles have limited " -"carrying capacity of the goods." +msgid "Capacitated Vehicle Routing Problem `CVRP` where The vehicles have limited carrying capacity of the goods." msgstr "" -msgid "" -"Vehicle Routing Problem with Time Windows `VRPTW` where the locations have " -"time windows within which the vehicle's visits must be made." +msgid "Vehicle Routing Problem with Time Windows `VRPTW` where the locations have time windows within which the vehicle's visits must be made." msgstr "" -msgid "" -"Vehicle Routing Problem with Pickup and Delivery `VRPPD` where a number of " -"goods need to be moved from certain pickup locations to other delivery " -"locations." +msgid "Vehicle Routing Problem with Pickup and Delivery `VRPPD` where a number of goods need to be moved from certain pickup locations to other delivery locations." msgstr "" msgid "Limitations" @@ -710,9 +640,7 @@ msgstr "" msgid "Pick & Delivery" msgstr "" -msgid "" -"Problem: `CVRPPDTW` Capacitated Pick and Delivery Vehicle Routing problem " -"with Time Windows" +msgid "Problem: `CVRPPDTW` Capacitated Pick and Delivery Vehicle Routing problem with Time Windows" msgstr "" msgid "Times are relative to `0`" @@ -742,9 +670,7 @@ msgstr "" msgid "Have pickup and delivery duration service times." msgstr "" -msgid "" -"have a demand request for moving goods from the pickup location to the " -"delivery location." +msgid "have a demand request for moving goods from the pickup location to the delivery location." msgstr "" msgid "Time based calculations:" @@ -834,12 +760,10 @@ msgstr "" msgid "``4`` Optimize insert." msgstr "" -msgid "" -"``5`` Push back order that allows more orders to be inserted at the back" +msgid "``5`` Push back order that allows more orders to be inserted at the back" msgstr "" -msgid "" -"``6`` Push front order that allows more orders to be inserted at the front" +msgid "``6`` Push front order that allows more orders to be inserted at the front" msgstr "" msgid "Orders SQL" @@ -902,30 +826,22 @@ msgstr "" msgid "The duration of the unloading at the delivery location." msgstr "" -msgid "" -"For :doc:`pgr_pickDeliver` the pickup and delivery identifiers of the " -"locations are needed:" +msgid "For :doc:`pgr_pickDeliver` the pickup and delivery identifiers of the locations are needed:" msgstr "" msgid "``p_node_id``" msgstr "" -msgid "" -"The node identifier of the pickup, must match a vertex identifier in the " -"`Matrix SQL`_." +msgid "The node identifier of the pickup, must match a vertex identifier in the `Matrix SQL`_." msgstr "" msgid "``d_node_id``" msgstr "" -msgid "" -"The node identifier of the delivery, must match a vertex identifier in the " -"`Matrix SQL`_." +msgid "The node identifier of the delivery, must match a vertex identifier in the `Matrix SQL`_." msgstr "" -msgid "" -"For :doc:`pgr_pickDeliverEuclidean` the :math:`(x, y)` values of the " -"locations are needed:" +msgid "For :doc:`pgr_pickDeliverEuclidean` the :math:`(x, y)` values of the locations are needed:" msgstr "" msgid "``p_x``" @@ -1015,25 +931,19 @@ msgstr "" msgid "When missing: A duration in ``start_service`` is used." msgstr "" -msgid "" -"For :doc:`pgr_pickDeliver` the starting and ending identifiers of the " -"locations are needed:" +msgid "For :doc:`pgr_pickDeliver` the starting and ending identifiers of the locations are needed:" msgstr "" msgid "``start_node_id``" msgstr "" -msgid "" -"The node identifier of the start location, must match a vertex identifier in " -"the `Matrix SQL`_." +msgid "The node identifier of the start location, must match a vertex identifier in the `Matrix SQL`_." msgstr "" msgid "[``end_node_id``]" msgstr "" -msgid "" -"The node identifier of the end location, must match a vertex identifier in " -"the `Matrix SQL`_." +msgid "The node identifier of the end location, must match a vertex identifier in the `Matrix SQL`_." msgstr "" msgid "When missing: ``end_node_id`` is used." @@ -1093,9 +1003,7 @@ msgstr "" msgid "``vehicle_seq``" msgstr "" -msgid "" -"Sequential value starting from **1** for current vehicles. The :math:`n_{th}" -"` vehicle in the solution." +msgid "Sequential value starting from **1** for current vehicles. The :math:`n_{th}` vehicle in the solution." msgstr "" msgid "Value :math:`-2` indicates it is the summary row." @@ -1113,8 +1021,7 @@ msgstr "" msgid "Summary row has the **total capacity violations**." msgstr "" -msgid "" -"A capacity violation happens when overloading or underloading a vehicle." +msgid "A capacity violation happens when overloading or underloading a vehicle." msgstr "" msgid "``stop_seq``" @@ -1123,16 +1030,13 @@ msgstr "" msgid "INTEGER" msgstr "" -msgid "" -"Sequential value starting from **1** for the stops made by the current " -"vehicle. The :math:`m_{th}` stop of the current vehicle." +msgid "Sequential value starting from **1** for the stops made by the current vehicle. The :math:`m_{th}` stop of the current vehicle." msgstr "" msgid "Summary row has the **total time windows violations**." msgstr "" -msgid "" -"A time window violation happens when arriving after the location has closed." +msgid "A time window violation happens when arriving after the location has closed." msgstr "" msgid "``stop_type``" @@ -1162,8 +1066,7 @@ msgstr "" msgid "Pickup-Delivery order pair identifier." msgstr "" -msgid "" -"Value :math:`-1`: When no order is involved on the current stop location." +msgid "Value :math:`-1`: When no order is involved on the current stop location." msgstr "" msgid "``cargo``" @@ -1235,9 +1138,7 @@ msgstr "" msgid "Summary row has the **total solution time**:" msgstr "" -msgid "" -":math:`total\\ traveling\\ time + total\\ waiting\\ time + total\\ service\\ " -"time`." +msgid ":math:`total\\ traveling\\ time + total\\ waiting\\ time + total\\ service\\ time`." msgstr "" msgid "Summary Row" @@ -1267,10 +1168,7 @@ msgstr "" msgid "Handling Parameters" msgstr "" -msgid "" -"To define a problem, several considerations have to be done, to get " -"consistent results. This section gives an insight of how parameters are to " -"be considered." +msgid "To define a problem, several considerations have to be done, to get consistent results. This section gives an insight of how parameters are to be considered." msgstr "" msgid "`Capacity and Demand Units Handling`_" @@ -1306,32 +1204,22 @@ msgstr "" msgid "Number of seats in the vehicle" msgstr "" -msgid "" -"The `demand` request of the pickup-deliver orders must use the same units as " -"the units used in the vehicle's `capacity`." +msgid "The `demand` request of the pickup-deliver orders must use the same units as the units used in the vehicle's `capacity`." msgstr "" -msgid "" -"To handle problems like: 10 (equal dimension) boxes of apples and 5 kg of " -"feathers that are to be transported (not packed in boxes)." +msgid "To handle problems like: 10 (equal dimension) boxes of apples and 5 kg of feathers that are to be transported (not packed in boxes)." msgstr "" -msgid "" -"If the vehicle's **capacity** is measured in `boxes`, a conversion of `kg of " -"feathers` to `number of boxes` is needed." +msgid "If the vehicle's **capacity** is measured in `boxes`, a conversion of `kg of feathers` to `number of boxes` is needed." msgstr "" -msgid "" -"If the vehicle's **capacity** is measured in `kg`, a conversion of `box of " -"apples` to `kg` is needed." +msgid "If the vehicle's **capacity** is measured in `kg`, a conversion of `box of apples` to `kg` is needed." msgstr "" msgid "Showing how the 2 possible conversions can be done" msgstr "" -msgid "" -"Let: - :math:`f\\_boxes`: number of boxes needed for `1` kg of feathers. - :" -"math:`a\\_weight`: weight of `1` box of apples." +msgid "Let: - :math:`f\\_boxes`: number of boxes needed for `1` kg of feathers. - :math:`a\\_weight`: weight of `1` box of apples." msgstr "" msgid "Capacity Units" @@ -1385,14 +1273,10 @@ msgstr "" msgid "Time Handling" msgstr "" -msgid "" -"The times are relative to **0**. All time units have to be converted to a " -"**0** reference and the same time units." +msgid "The times are relative to **0**. All time units have to be converted to a **0** reference and the same time units." msgstr "" -msgid "" -"Suppose that a vehicle's driver starts the shift at 9:00 am and ends the " -"shift at 4:30 pm and the service time duration is 10 minutes with 30 seconds." +msgid "Suppose that a vehicle's driver starts the shift at 9:00 am and ends the shift at 4:30 pm and the service time duration is 10 minutes with 30 seconds." msgstr "" msgid "Meaning of 0" @@ -1449,9 +1333,7 @@ msgstr "" msgid "Factor handling" msgstr "" -msgid "" -"``factor`` acts as a multiplier to convert from distance values to time " -"units the matrix values or the euclidean values." +msgid "``factor`` acts as a multiplier to convert from distance values to time units the matrix values or the euclidean values." msgstr "" msgid "When the values are already in the desired time units" @@ -1469,10 +1351,7 @@ msgstr "" msgid "For the :doc:`pgr_pickDeliverEuclidean`:" msgstr "" -msgid "" -"Working with time units in seconds, and x/y in lat/lon: Factor: would depend " -"on the location of the points and on the average velocity say 25m/s is the " -"velocity." +msgid "Working with time units in seconds, and x/y in lat/lon: Factor: would depend on the location of the points and on the average velocity say 25m/s is the velocity." msgstr "" msgid "Latitude" @@ -1502,9 +1381,7 @@ msgstr "" msgid "For the :doc:`pgr_pickDeliver`:" msgstr "" -msgid "" -"Given :math:`v = d / t` therefore :math:`t = d / v` And the ``factor`` " -"becomes :math:`1 / v`" +msgid "Given :math:`v = d / t` therefore :math:`t = d / v` And the ``factor`` becomes :math:`1 / v`" msgstr "" msgid "v" @@ -1525,14 +1402,10 @@ msgstr "" msgid "Time" msgstr "" -msgid "" -"For the following equivalences :math:`10m/s \\approx 600m/min \\approx 36 km/" -"hr`" +msgid "For the following equivalences :math:`10m/s \\approx 600m/min \\approx 36 km/hr`" msgstr "" -msgid "" -"Working with time units in seconds and the matrix been in meters: For a " -"1000m length value on the matrix:" +msgid "Working with time units in seconds and the matrix been in meters: For a 1000m length value on the matrix:" msgstr "" msgid "Units" @@ -1595,10 +1468,7 @@ msgstr ":doc:`sampledata`" msgid "A* - Family of functions" msgstr "" -msgid "" -"The A* (pronounced \"A Star\") algorithm is based on Dijkstra's algorithm " -"with a heuristic that allow it to solve most shortest path problems by " -"evaluation only a sub-set of the overall graph." +msgid "The A* (pronounced \"A Star\") algorithm is based on Dijkstra's algorithm with a heuristic that allow it to solve most shortest path problems by evaluation only a sub-set of the overall graph." msgstr "" msgid ":doc:`pgr_aStar` - A* algorithm for the shortest path." @@ -1694,9 +1564,7 @@ msgstr "" msgid "For less restricted results. :math:`epsilon >= 1`." msgstr "" -msgid "" -"See :ref:`heuristics ` available and :ref:`factor " -"` handling." +msgid "See :ref:`heuristics ` available and :ref:`factor ` handling." msgstr "" msgid "Advanced documentation" @@ -1714,17 +1582,13 @@ msgstr "" msgid "Analysis 1" msgstr "" -msgid "" -"Working with cost/reverse_cost as length in degrees, x/y in lat/lon: Factor " -"= 1 (no need to change units)" +msgid "Working with cost/reverse_cost as length in degrees, x/y in lat/lon: Factor = 1 (no need to change units)" msgstr "" msgid "Analysis 2" msgstr "" -msgid "" -"Working with cost/reverse_cost as length in meters, x/y in lat/lon: Factor = " -"would depend on the location of the points:" +msgid "Working with cost/reverse_cost as length in meters, x/y in lat/lon: Factor = would depend on the location of the points:" msgstr "" msgid "1 longitude degree is 78846.81 m" @@ -1742,17 +1606,13 @@ msgstr "" msgid "Analysis 3" msgstr "" -msgid "" -"Working with cost/reverse_cost as time in seconds, x/y in lat/lon: Factor: " -"would depend on the location of the points and on the average speed say 25m/" -"s is the speed." +msgid "Working with cost/reverse_cost as time in seconds, x/y in lat/lon: Factor: would depend on the location of the points and on the average speed say 25m/s is the speed." msgstr "" msgid ":doc:`bdAstar-family`" msgstr ":doc:`bdAstar-family`" -msgid "" -"`Boost: A* search `__" +msgid "`Boost: A* search `__" msgstr "" msgid "https://en.wikipedia.org/wiki/A*_search_algorithm" @@ -1776,24 +1636,16 @@ msgstr "" msgid "It does not return a path." msgstr "" -msgid "" -"Returns the sum of the costs of the shortest path for each pair of nodes in " -"the graph." +msgid "Returns the sum of the costs of the shortest path for each pair of nodes in the graph." 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." +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 "" -msgid "" -"We return only the non infinity values in form of a set of `(start_vid, " -"end_vid, agg_cost)`." +msgid "We return only the non infinity values in form of a set of `(start_vid, end_vid, agg_cost)`." msgstr "" -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)`." +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 "" msgid "For the undirected graph, the results are symmetric." @@ -1865,10 +1717,7 @@ msgstr "" msgid "One" msgstr "" -msgid "" -"This test is not with a bounding box The density of the passed graph is " -"extremely low. For each 30 tests were executed to get the average The " -"tested query is:" +msgid "This test is not with a bounding box The density of the passed graph is extremely low. For each 30 tests were executed to get the average The tested query is:" msgstr "" msgid "The results of this tests are presented as:" @@ -2210,10 +2059,7 @@ msgstr "" msgid "Two" msgstr "" -msgid "" -"This test is with a bounding box The density of the passed graph higher than " -"of the Test One. For each 30 tests were executed to get the average " -"The tested edge query is:" +msgid "This test is with a bounding box The density of the passed graph higher than of the Test One. For each 30 tests were executed to get the average The tested edge query is:" msgstr "" msgid "The tested queries" @@ -2516,47 +2362,28 @@ msgstr ":doc:`pgr_johnson`" msgid ":doc:`pgr_floydWarshall`" msgstr ":doc:`pgr_floydWarshall`" -msgid "" -"Boost `floyd-Warshall `__" +msgid "Boost `floyd-Warshall `__" msgstr "" msgid "Bidirectional A* - Family of functions" msgstr "" -msgid "" -"The bidirectional A* (pronounced \"A Star\") algorithm is based on the A* " -"algorithm." +msgid "The bidirectional A* (pronounced \"A Star\") algorithm is based on the A* algorithm." msgstr "" msgid ":doc:`pgr_bdAstar` - Bidirectional A* algorithm for obtaining paths." msgstr ":doc:`pgr_bdAstar` - 경로를 얻기 위한 양방향 A* 알고리즘." -msgid "" -":doc:`pgr_bdAstarCost` - Bidirectional A* algorithm to calculate the cost of " -"the paths." -msgstr "" -":doc:`pgr_bdAstarCost` - 경로의 비용을 계산하기 위한 양방향 A* 알고리즘." +msgid ":doc:`pgr_bdAstarCost` - Bidirectional A* algorithm to calculate the cost of the paths." +msgstr ":doc:`pgr_bdAstarCost` - 경로의 비용을 계산하기 위한 양방향 A* 알고리즘." -msgid "" -":doc:`pgr_bdAstarCostMatrix` - Bidirectional A* algorithm to calculate a " -"cost matrix of paths." -msgstr "" -":doc:`pgr_bdAstarCostMatrix` - 경로의 비용 행렬을 계산하기 위한 양방향 A* 알" -"고리즘." +msgid ":doc:`pgr_bdAstarCostMatrix` - Bidirectional A* algorithm to calculate a cost matrix of paths." +msgstr ":doc:`pgr_bdAstarCostMatrix` - 경로의 비용 행렬을 계산하기 위한 양방향 A* 알고리즘." -msgid "" -"Based on A* algorithm, the bidirectional search finds a shortest path from a " -"starting vertex (``start_vid``) to an ending vertex (``end_vid``). It runs " -"two simultaneous searches: one forward from the ``start_vid``, and one " -"backward from the ``end_vid``, stopping when the two meet in the middle. " -"This implementation can be used with a directed graph and an undirected " -"graph." +msgid "Based on A* algorithm, the bidirectional search finds a shortest path from a starting vertex (``start_vid``) to an ending vertex (``end_vid``). It runs two simultaneous searches: one forward from the ``start_vid``, and one backward from the ``end_vid``, stopping when the two meet in the middle. This implementation can be used with a directed graph and an undirected graph." msgstr "" -msgid "" -"For large graphs where there is a path between the starting vertex and " -"ending vertex:" +msgid "For large graphs where there is a path between the starting vertex and ending vertex:" msgstr "" msgid "It is expected to terminate faster than :doc:`pgr_aStar`" @@ -2568,46 +2395,29 @@ msgstr ":doc:`aStar-family`" msgid "Bidirectional Dijkstra - Family of functions" msgstr "" -msgid "" -":doc:`pgr_bdDijkstra` - Bidirectional Dijkstra algorithm for the shortest " -"paths." +msgid ":doc:`pgr_bdDijkstra` - Bidirectional Dijkstra algorithm for the shortest paths." msgstr ":doc:`pgr_bdDijkstra` - 최단 경로를 위한 양방향 다익스트라 알고리즘." -msgid "" -":doc:`pgr_bdDijkstraCost` - Bidirectional Dijkstra to calculate the cost of " -"the shortest paths" -msgstr "" -":doc:`pgr_bdDijkstraCost` - 최단 경로의 비용을 계산하기 위한 양방향 다익스트" -"라 알고리즘" +msgid ":doc:`pgr_bdDijkstraCost` - Bidirectional Dijkstra to calculate the cost of the shortest paths" +msgstr ":doc:`pgr_bdDijkstraCost` - 최단 경로의 비용을 계산하기 위한 양방향 다익스트라 알고리즘" #, fuzzy -msgid "" -":doc:`pgr_bdDijkstraCostMatrix` - Bidirectional Dijkstra algorithm to create " -"a matrix of costs of the shortest paths." -msgstr "" -":doc:`pgr_bdDijkstraCostMatrix` - 최단 경로의 비용 행렬을 생성하기 위한 양방" -"향 다익스트라 알고리즘." +msgid ":doc:`pgr_bdDijkstraCostMatrix` - Bidirectional Dijkstra algorithm to create a matrix of costs of the shortest paths." +msgstr ":doc:`pgr_bdDijkstraCostMatrix` - 최단 경로의 비용 행렬을 생성하기 위한 양방향 다익스트라 알고리즘." msgid "Synopsis" msgstr "" -msgid "" -"Based on Dijkstra's algorithm, the bidirectional search finds a shortest " -"path a starting vertex to an ending vertex." +msgid "Based on Dijkstra's algorithm, the bidirectional search finds a shortest path a starting vertex to an ending vertex." msgstr "" -msgid "" -"It runs two simultaneous searches: one forward from the source, and one " -"backward from the target, stopping when the two meet in the middle." +msgid "It runs two simultaneous searches: one forward from the source, and one backward from the target, stopping when the two meet in the middle." msgstr "" -msgid "" -"This implementation can be used with a directed graph and an undirected " -"graph." +msgid "This implementation can be used with a directed graph and an undirected graph." msgstr "" -msgid "" -"A negative value on a cost column is interpreted as the edge does not exist." +msgid "A negative value on a cost column is interpreted as the edge does not exist." msgstr "" msgid "When there is no path:" @@ -2616,31 +2426,22 @@ msgstr "" msgid "When the starting vertex and ending vertex are the same." msgstr "" -msgid "" -"The **aggregate cost** of the non included values :math:`(v, v)` is :math:`0`" +msgid "The **aggregate cost** of the non included values :math:`(v, v)` is :math:`0`" msgstr "" -msgid "" -"When the starting vertex and ending vertex are the different and there is no " -"path:" +msgid "When the starting vertex and ending vertex are the different and there is no path:" msgstr "" -msgid "" -"The **aggregate cost** the non included values :math:`(u, v)` is :math:" -"`\\infty`" +msgid "The **aggregate cost** the non included values :math:`(u, v)` is :math:`\\infty`" msgstr "" -msgid "" -"For optimization purposes, any duplicated value in the starting vertices or " -"on the ending vertices are ignored." +msgid "For optimization purposes, any duplicated value in the starting vertices or on the ending vertices are ignored." msgstr "" msgid "Running time (worse case scenario): :math:`O((V \\log V + E))`" msgstr "" -msgid "" -"For large graphs where there is a path bewtween the starting vertex and " -"ending vertex:" +msgid "For large graphs where there is a path bewtween the starting vertex and ending vertex:" msgstr "" msgid "It is expected to terminate faster than :doc:`pgr_dijkstra`" @@ -2671,25 +2472,19 @@ msgstr "" msgid "Graph must be connected." msgstr "" -msgid "" -"An Edges SQL that represents a **directed** graph with the following columns" +msgid "An Edges SQL that represents a **directed** graph with the following columns" msgstr "" msgid "Coloring - Family of functions" msgstr "" -msgid "" -":doc:`pgr_sequentialVertexColoring` - Vertex coloring algorithm using greedy " -"approach." +msgid ":doc:`pgr_sequentialVertexColoring` - Vertex coloring algorithm using greedy approach." msgstr "" -msgid "" -":doc:`pgr_bipartite` - Bipartite graph algorithm using a DFS-based coloring " -"approach." +msgid ":doc:`pgr_bipartite` - Bipartite graph algorithm using a DFS-based coloring approach." msgstr "" -msgid "" -":doc:`pgr_edgeColoring` - Edge Coloring algorithm using Vizing's theorem." +msgid ":doc:`pgr_edgeColoring` - Edge Coloring algorithm using Vizing's theorem." msgstr "" msgid "Returns set of |result_edge_color|" @@ -2713,29 +2508,22 @@ msgstr "" msgid "Color of the node." msgstr "" -msgid "" -"`Boost: `__" +msgid "`Boost: `__" msgstr "" msgid "Components - Family of functions" msgstr "" -msgid "" -":doc:`pgr_connectedComponents` - Connected components of an undirected graph." +msgid ":doc:`pgr_connectedComponents` - Connected components of an undirected graph." msgstr ":doc:`pgr_connectedComponents` - 무방향 그래프의 연결 요소." -msgid "" -":doc:`pgr_strongComponents` - Strongly connected components of a directed " -"graph." +msgid ":doc:`pgr_strongComponents` - Strongly connected components of a directed graph." msgstr ":doc:`pgr_strongComponents` - 방향 그래프의 강한 연결 요소." -msgid "" -":doc:`pgr_biconnectedComponents` - Biconnected components of an undirected " -"graph." +msgid ":doc:`pgr_biconnectedComponents` - Biconnected components of an undirected graph." msgstr ":doc:`pgr_biconnectedComponents` - 무방향 그래프의 이중 연결성분." -msgid "" -":doc:`pgr_articulationPoints` - Articulation points of an undirected graph." +msgid ":doc:`pgr_articulationPoints` - Articulation points of an undirected graph." msgstr ":doc:`pgr_articulationPoints` - 무방향 그래프의 단절점." msgid ":doc:`pgr_bridges` - Bridges of an undirected graph." @@ -2762,18 +2550,10 @@ msgstr ":doc:`pgr_contraction`" msgid ":doc:`pgr_contractionHierarchies`" msgstr ":doc:`pgr_contraction`" -msgid "" -"In large graphs, like road graphs or electric networks, graph contraction " -"can be used to speed up some graph algorithms. Contraction can reduce the " -"size of the graph by removing some of the vertices and edges and adding " -"edges that represent a sequence of original edges (the original ones can be " -"kept in some methods). In this way, it decreases the total time and space " -"used by graph algorithms, particularly those searching for an optimal path." +msgid "In large graphs, like road graphs or electric networks, graph contraction can be used to speed up some graph algorithms. Contraction can reduce the size of the graph by removing some of the vertices and edges and adding edges that represent a sequence of original edges (the original ones can be kept in some methods). In this way, it decreases the total time and space used by graph algorithms, particularly those searching for an optimal path." msgstr "" -msgid "" -"This implementation gives a flexible framework for adding contraction " -"algorithms in the future. Currently, it supports three algorithms." +msgid "This implementation gives a flexible framework for adding contraction algorithms in the future. Currently, it supports three algorithms." msgstr "" msgid "Dead end contraction" @@ -2786,17 +2566,13 @@ msgstr "" msgid "Contraction hierarchies" msgstr "소개" -msgid "" -"The two first ones can be combined through a iterative procedure, via the " -"``pgr_contraction`` method. The third one is implemented on its own." +msgid "The two first ones can be combined through a iterative procedure, via the ``pgr_contraction`` method. The third one is implemented on its own." msgstr "" msgid "All functions allow the user to forbid contraction on a set of nodes." msgstr "" -msgid "" -"https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/" -"lecture16.pdf" +msgid "https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/lecture16.pdf" msgstr "" msgid "https://ae.iti.kit.edu/download/diploma_thesis_geisberger.pdf" @@ -2829,26 +2605,19 @@ msgstr ":doc:`pgr_withPointsCost`" msgid "Each function works as part of the family it belongs to." msgstr "" -msgid "" -"Returns the sum of the costs of the shortest path of each pair combination " -"of nodes requested." +msgid "Returns the sum of the costs of the shortest path of each pair combination of nodes requested." msgstr "" -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)``." +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 "" -msgid "" -"Depending on the function and its parameters, the results can be symmetric." +msgid "Depending on the function and its parameters, the results can be symmetric." msgstr "" -msgid "" -"The **aggregate cost** of :math:`(u, v)` is the same as for :math:`(v, u)`." +msgid "The **aggregate cost** of :math:`(u, v)` is the same as for :math:`(v, u)`." msgstr "" -msgid "" -"Any duplicated value in the start or end vertex identifiers are ignored." +msgid "Any duplicated value in the start or end vertex identifiers are ignored." msgstr "" msgid "The returned values are ordered:" @@ -2878,21 +2647,16 @@ msgstr ":doc:`pgr_bdDijkstraCostMatrix`" msgid ":doc:`pgr_withPointsCostMatrix`" msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "" -":doc:`TSP-family` needs as input a symmetric cost matrix and no edge `(u, " -"v)` must value :math:`\\infty`." +msgid ":doc:`TSP-family` needs as input a symmetric cost matrix and no edge `(u, v)` must value :math:`\\infty`." msgstr "" -msgid "" -"This collection of functions will return a cost matrix in form of a table." +msgid "This collection of functions will return a cost matrix in form of a table." msgstr "" msgid "Can be used as input to :doc:`pgr_TSP`." msgstr "" -msgid "" -"Use directly when the resulting matrix is symmetric and there is no :math:" -"`\\infty` value." +msgid "Use directly when the resulting matrix is symmetric and there is no :math:`\\infty` value." msgstr "" msgid "It will be the users responsibility to make the matrix symmetric." @@ -2904,36 +2668,28 @@ msgstr "" msgid "By using max or min the non symmetric values." msgstr "" -msgid "" -"By setting the upper triangle to be the mirror image of the lower triangle." +msgid "By setting the upper triangle to be the mirror image of the lower triangle." msgstr "" -msgid "" -"By setting the lower triangle to be the mirror image of the upper triangle." +msgid "By setting the lower triangle to be the mirror image of the upper triangle." msgstr "" msgid "It is also the users responsibility to fix an :math:`\\infty` value." msgstr "" -msgid "" -"Returns the sum of the costs of the shortest path for pair combination of " -"nodes in the graph." +msgid "Returns the sum of the costs of the shortest path for pair combination of nodes in the graph." msgstr "" -msgid "" -"When the starting vertex and ending vertex are the same, there is no path." +msgid "When the starting vertex and ending vertex are the same, there is no path." msgstr "" msgid "The aggregate cost in the non included values `(v, v)` is `0`." msgstr "" -msgid "" -"When the starting vertex and ending vertex are the different and there is no " -"path." +msgid "When the starting vertex and ending vertex are the different and there is no path." msgstr "" -msgid "" -"The aggregate cost in the non included values `(u, v)` is :math:`\\infty`." +msgid "The aggregate cost in the non included values `(u, v)` is :math:`\\infty`." msgstr "" msgid "Let be the case the values returned are stored in a table:" @@ -2981,16 +2737,13 @@ msgstr "" msgid "Identifier of the point." msgstr "" -msgid "" -"Use with positive value, as internally will be converted to negative value" +msgid "Use with positive value, as internally will be converted to negative value" msgstr "" msgid "If column is present, it can not be NULL." msgstr "" -msgid "" -"If column is not present, a sequential negative **value** will be given " -"automatically." +msgid "If column is not present, a sequential negative **value** will be given automatically." msgstr "" msgid "``edge_id``" @@ -3002,9 +2755,7 @@ msgstr "" msgid "``fraction``" msgstr "" -msgid "" -"Value in <0,1> that indicates the relative position from the first end point " -"of the edge." +msgid "Value in <0,1> that indicates the relative position from the first end point of the edge." msgstr "" msgid "``side``" @@ -3040,20 +2791,14 @@ msgstr ":doc:`pgr_dijkstra` - 최단 경로를 위한 다익스트라 알고리 msgid ":doc:`pgr_dijkstraCost` - Get the aggregate cost of the shortest paths." msgstr "" -msgid "" -":doc:`pgr_dijkstraCostMatrix` - Use pgr_dijkstra to create a costs matrix." +msgid ":doc:`pgr_dijkstraCostMatrix` - Use pgr_dijkstra to create a costs matrix." msgstr "" -msgid "" -":doc:`pgr_drivingDistance` - Use pgr_dijkstra to calculate catchament " -"information." +msgid ":doc:`pgr_drivingDistance` - Use pgr_dijkstra to calculate catchament information." msgstr "" -msgid "" -":doc:`pgr_KSP` - Use Yen algorithm with pgr_dijkstra to get the K shortest " -"paths." -msgstr "" -":doc:`pgr_KSP` - K 최단 경로를 얻기 위해 pgr_dijkstra로 Yen 알고리즘을 사용." +msgid ":doc:`pgr_KSP` - Use Yen algorithm with pgr_dijkstra to get the K shortest paths." +msgstr ":doc:`pgr_KSP` - K 최단 경로를 얻기 위해 pgr_dijkstra로 Yen 알고리즘을 사용." msgid ":doc:`pgr_dijkstraVia` - Get a route of a sequence of vertices." msgstr "" @@ -3064,12 +2809,7 @@ msgstr "" msgid ":doc:`pgr_dijkstraNearCost` - Get the cost to the nearest vertex." msgstr "" -msgid "" -"Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra " -"in 1956. It is a graph search algorithm that solves the shortest path " -"problem for a graph with non-negative edge path costs, producing a shortest " -"path from a starting vertex to an ending vertex. This implementation can be " -"used with a directed graph and an undirected graph." +msgid "Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956. It is a graph search algorithm that solves the shortest path problem for a graph with non-negative edge path costs, producing a shortest path from a starting vertex to an ending vertex. This implementation can be used with a directed graph and an undirected graph." msgstr "" msgid "Running time: :math:`O(| start\\ vids | * (V \\log V + E))`" @@ -3120,9 +2860,7 @@ msgstr "" msgid "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgstr "" -msgid "" -"where :math:`sql = \\{(id_i, source_i, target_i, cost_i, reverse\\_cost_i)\\}" -"`" +msgid "where :math:`sql = \\{(id_i, source_i, target_i, cost_i, reverse\\_cost_i)\\}`" msgstr "" msgid "and" @@ -3152,14 +2890,7 @@ msgstr "" msgid "the set of edges :math:`E`" msgstr "" -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}`" +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 "" msgid "Undirected graph" @@ -3171,17 +2902,7 @@ msgstr "" msgid ":math:`V = source \\cup target \\cup {start_v{vid}} \\cup {end_{vid}}`" msgstr "" -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}`" +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 "" msgid "The problem" @@ -3196,17 +2917,13 @@ msgstr "" msgid ":math:`end_{vid} \\in V` an ending vertex" msgstr "" -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 ":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 "" msgid "Then:" msgstr "" -msgid "" -":math:`\\boldsymbol{\\pi} = \\{(path\\_seq_i, node_i, edge_i, cost_i, " -"agg\\_cost_i)\\}`" +msgid ":math:`\\boldsymbol{\\pi} = \\{(path\\_seq_i, node_i, edge_i, cost_i, agg\\_cost_i)\\}`" msgstr "" msgid "where:" @@ -3227,41 +2944,28 @@ msgstr "" msgid ":math:`node_{| \\pi |} = end_{vid}`" msgstr "" -msgid "" -":math:`\\forall i \\neq | \\pi |, \\quad (node_i, node_{i+1}, cost_i) \\in E`" +msgid ":math:`\\forall i \\neq | \\pi |, \\quad (node_i, node_{i+1}, cost_i) \\in E`" msgstr "" -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}`" +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 "" msgid ":math:`cost_i = cost_{(node_i, node_{i+1})}`" msgstr "" -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}`" +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 "" -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," +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 "" -msgid "" -":math:`path\\_seq` indicates the relative position in the path of the :math:" -"`node` or :math:`edge`." +msgid ":math:`path\\_seq` indicates the relative position in the path of the :math:`node` or :math:`edge`." msgstr "" msgid ":math:`cost` is the cost of the edge to be used to go to the next node." msgstr "" -msgid "" -":math:`agg\\_cost` is the cost from the :math:`start_{vid}` up to the node." +msgid ":math:`agg\\_cost` is the cost from the :math:`start_{vid}` up to the node." msgstr "" msgid "If there is no path, the resulting set is empty." @@ -3270,8 +2974,7 @@ msgstr "" msgid "Driving Distance - Category" msgstr "" -msgid "" -":doc:`pgr_drivingDistance` - Driving Distance based on Dijkstra's algorithm" +msgid ":doc:`pgr_drivingDistance` - Driving Distance based on Dijkstra's algorithm" msgstr "" msgid ":doc:`pgr_primDD` - Driving Distance based on Prim's algorithm" @@ -3286,9 +2989,7 @@ msgstr "" 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." +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." @@ -3303,9 +3004,7 @@ msgstr "" msgid "The distance from the **root** to :math:`v` > limit distance." msgstr "" -msgid "" -"No new nodes are created on the graph, so when is within the limit and is " -"not within the limit, the edge is not included." +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." @@ -3371,21 +3070,16 @@ msgstr ":doc:`contraction-family`" msgid ":doc:`transformation-family`" msgstr ":doc:`transformation-family`" -msgid "" -":doc:`pgr_lineGraphFull` - Transformation algorithm for generating a Line " -"Graph out of each vertex in the input graph." +msgid ":doc:`pgr_lineGraphFull` - Transformation algorithm for generating a Line Graph out of each vertex in the input graph." msgstr "" msgid ":doc:`traversal-family`" msgstr ":doc:`traversal-family`" -msgid "" -":doc:`pgr_breadthFirstSearch` - Breath first search traversal of the graph." +msgid ":doc:`pgr_breadthFirstSearch` - Breath first search traversal of the graph." msgstr "" -msgid "" -":doc:`pgr_binaryBreadthFirstSearch` - Breath first search traversal of the " -"graph." +msgid ":doc:`pgr_binaryBreadthFirstSearch` - Breath first search traversal of the graph." msgstr "" msgid ":doc:`components-family`" @@ -3394,33 +3088,25 @@ 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." +msgid ":doc:`pgr_cuthillMckeeOrdering` - Return reverse Cuthill-McKee ordering of an undirected graph." msgstr "" -msgid "" -":doc:`pgr_topologicalSort` - Linear ordering of the vertices for directed " -"acyclic graph." +msgid ":doc:`pgr_topologicalSort` - Linear ordering of the vertices for directed acyclic graph." msgstr "" #, fuzzy -msgid "" -":doc:`pgr_sloanOrdering` - Returns the sloan ordering of an undirected graph." +msgid ":doc:`pgr_sloanOrdering` - Returns the sloan ordering of an undirected graph." msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." #, fuzzy -msgid "" -":doc:`pgr_kingOrdering` - Returns the King ordering of an undirected graph." +msgid ":doc:`pgr_kingOrdering` - Returns the King ordering of an undirected graph." msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." #, fuzzy msgid ":doc:`metrics-family`" msgstr ":doc:`prim-family`" -msgid "" -":doc:`pgr_betweennessCentrality` - Calculates relative betweenness " -"centrality using Brandes Algorithm" +msgid ":doc:`pgr_betweennessCentrality` - Calculates relative betweenness centrality using Brandes Algorithm" msgstr "" #, fuzzy @@ -3473,37 +3159,25 @@ msgstr ":doc:`pgr_hawickCircuits`" msgid "Flow - Family of functions" msgstr "" -msgid "" -":doc:`pgr_maxFlow` - Only the Max flow calculation using Push and Relabel " -"algorithm." +msgid ":doc:`pgr_maxFlow` - Only the Max flow calculation using Push and Relabel algorithm." msgstr "" -msgid "" -":doc:`pgr_boykovKolmogorov` - Boykov and Kolmogorov with details of flow on " -"edges." +msgid ":doc:`pgr_boykovKolmogorov` - Boykov and Kolmogorov with details of flow on edges." msgstr "" -msgid "" -":doc:`pgr_edmondsKarp` - Edmonds and Karp algorithm with details of flow on " -"edges." +msgid ":doc:`pgr_edmondsKarp` - Edmonds and Karp algorithm with details of flow on edges." msgstr "" -msgid "" -":doc:`pgr_pushRelabel` - Push and relabel algorithm with details of flow on " -"edges." +msgid ":doc:`pgr_pushRelabel` - Push and relabel algorithm with details of flow on edges." msgstr "" msgid "Applications" msgstr "" -msgid "" -":doc:`pgr_edgeDisjointPaths` - Calculates edge disjoint paths between two " -"groups of vertices." +msgid ":doc:`pgr_edgeDisjointPaths` - Calculates edge disjoint paths between two groups of vertices." msgstr "" -msgid "" -":doc:`pgr_maxCardinalityMatch` - Calculates a maximum cardinality matching " -"in a graph." +msgid ":doc:`pgr_maxCardinalityMatch` - Calculates a maximum cardinality matching in a graph." msgstr "" msgid "Flow Functions General Information" @@ -3515,9 +3189,7 @@ 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." +msgid "When the maximum flow is 0 then there is no flow and **EMPTY SET** is returned." msgstr "" msgid "There is no flow when source has the same value as target." @@ -3541,10 +3213,7 @@ 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:" +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 "" msgid "By aggregation of the outgoing flow from the sources" @@ -3553,10 +3222,7 @@ 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." +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 "" msgid "Capacity edges" @@ -3631,8 +3297,7 @@ msgstr "" msgid "**residual_capacity**" msgstr "" -msgid "" -"Residual capacity of the edge in the direction (``start_vid``, ``end_vid``)." +msgid "Residual capacity of the edge in the direction (``start_vid``, ``end_vid``)." msgstr "" msgid "For :doc:`pgr_maxFlowMinCost`" @@ -3653,9 +3318,7 @@ msgstr "" msgid "**cost**" msgstr "" -msgid "" -"The cost of sending this flow through the edge in the direction (source, " -"target)." +msgid "The cost of sending this flow through the edge in the direction (source, target)." msgstr "" msgid "**agg_cost**" @@ -3667,30 +3330,19 @@ msgstr "" msgid "Advanced Documentation" msgstr "" -msgid "" -"A flow network is a directed graph where each edge has a capacity and a " -"flow. The flow through an edge must not exceed the capacity of the edge. " -"Additionally, the incoming and outgoing flow of a node must be equal except " -"for source which only has outgoing flow, and the destination(sink) which " -"only has incoming flow." +msgid "A flow network is a directed graph where each edge has a capacity and a flow. The flow through an edge must not exceed the capacity of the edge. Additionally, the incoming and outgoing flow of a node must be equal except for source which only has outgoing flow, and the destination(sink) which only has incoming flow." msgstr "" -msgid "" -"Maximum flow algorithms calculate the maximum flow through the graph and the " -"flow of each edge." +msgid "Maximum flow algorithms calculate the maximum flow through the graph and the flow of each edge." msgstr "" -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." +msgid "The maximum flow through the graph is guaranteed to be the same with all implementations, but the actual flow through each edge may vary." msgstr "" msgid "pgr_maxFlow :math:`(edges\\_sql, source\\_vertex, sink\\_vertex)`" msgstr "" -msgid "" -"where :math:`edges\\_sql = \\{(id_i, source_i, target_i, capacity_i, " -"reverse\\_capacity_i)\\}`" +msgid "where :math:`edges\\_sql = \\{(id_i, source_i, target_i, capacity_i, reverse\\_capacity_i)\\}`" msgstr "" msgid "Graph definition" @@ -3702,19 +3354,10 @@ msgstr "" msgid "the set of vertices :math:`V`" msgstr "" -msgid "" -":math:`source\\_vertex \\cup sink\\_vertex \\bigcup source_i \\bigcup " -"target_i`" +msgid ":math:`source\\_vertex \\cup sink\\_vertex \\bigcup source_i \\bigcup target_i`" msgstr "" -msgid "" -":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, capacity_i) " -"\\text{ when } capacity > 0 \\} & \\quad \\text{ if } reverse\\_capacity = " -"\\varnothing \\\\ \\text{ } & \\quad \\text{ } \\\\ \\{(source_i, target_i, " -"capacity_i) \\text{ when } capacity > 0 \\} & \\text{ } \\\\ \\cup " -"\\{(target_i, source_i, reverse\\_capacity_i) \\text{ when } " -"reverse\\_capacity_i > 0)\\} & \\quad \\text{ if } reverse\\_capacity \\neq " -"\\varnothing \\\\ \\end{cases}`" +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 "" msgid "Maximum flow problem" @@ -3732,16 +3375,10 @@ msgstr "" msgid ":math:`pgr\\_maxFlow(edges\\_sql, source, sink) = \\boldsymbol{\\Phi}`" msgstr "" -msgid "" -":math:`\\boldsymbol{\\Phi} = {(id_i, edge\\_id_i, source_i, target_i, " -"flow_i, residual\\_capacity_i)}`" +msgid ":math:`\\boldsymbol{\\Phi} = {(id_i, edge\\_id_i, source_i, target_i, flow_i, residual\\_capacity_i)}`" msgstr "" -msgid "" -":math:`\\boldsymbol{\\Phi}` is a subset of the original edges with their " -"residual capacity and flow. The maximum flow through the graph can be " -"obtained by aggregating on the source or sink and summing the flow from/to " -"it. In particular:" +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 "" msgid ":math:`id_i = i`" @@ -3756,14 +3393,8 @@ msgstr "" msgid "https://en.wikipedia.org/wiki/Maximum_flow_problem" msgstr "" -msgid "" -"pgRouting extends the `PostGIS `__/`PostgreSQL `__ geospatial database to provide geospatial routing and " -"other network analysis functionality." -msgstr "" -"pgRouting은 `PostGIS `__/`PostgreSQL `__ 지리공간 데이터베이스를 확장하여 기하공간 라우팅과 기타 네" -"트워크 분석 기능을 제공합니다." +msgid "pgRouting extends the `PostGIS `__/`PostgreSQL `__ geospatial database to provide geospatial routing and other network analysis functionality." +msgstr "pgRouting은 `PostGIS `__/`PostgreSQL `__ 지리공간 데이터베이스를 확장하여 기하공간 라우팅과 기타 네트워크 분석 기능을 제공합니다." msgid "This is the manual for pgRouting |release|." msgstr "이 문서는 pgRouting |release|를 위한 매뉴얼입니다." @@ -3771,13 +3402,7 @@ msgstr "이 문서는 pgRouting |release|를 위한 매뉴얼입니다." msgid "Creative Commons Attribution-Share Alike 3.0 License" msgstr "크리에이티브 커먼즈 저작자표시-동일조건변경허락 3.0 라이선스" -msgid "" -"The pgRouting Manual is licensed under a `Creative Commons Attribution-Share " -"Alike 3.0 License `_. Feel " -"free to use this material any way you like, but we ask that you attribute " -"credit to the pgRouting Project and wherever possible, a link back to " -"https://pgrouting.org. For other licenses used in pgRouting see the :ref:" -"`license` page." +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 "" msgid "General" @@ -3810,9 +3435,7 @@ msgstr ":doc:`pgr_kruskal`" msgid ":doc:`pgr_kruskalDD`" msgstr ":doc:`pgr_kruskalDD`" -msgid "" -":doc:`pgr_degree` - Returns a set of vertices and corresponding count of " -"incident edges to the vertex." +msgid ":doc:`pgr_degree` - Returns a set of vertices and corresponding count of incident edges to the vertex." msgstr "" msgid ":doc:`prim-family`" @@ -3837,9 +3460,7 @@ msgstr ":doc:`pgr_full_version`" msgid ":doc:`utilities-family`" msgstr ":doc:`prim-family`" -msgid "" -":doc:`pgr_extractVertices` - Extracts vertex information based on the edge " -"table information." +msgid ":doc:`pgr_extractVertices` - Extracts vertex information based on the edge table information." msgstr "" msgid ":doc:`pgr_findCloseEdges` - Finds close edges of points on the fly" @@ -3848,9 +3469,7 @@ msgstr "" msgid ":doc:`pgr_separateCrossing` - Breaks geometries that cross each other." msgstr "" -msgid "" -":doc:`pgr_separateTouching` - Breaks geometries that (almost) touch each " -"other." +msgid ":doc:`pgr_separateTouching` - Breaks geometries that (almost) touch each other." msgstr "" msgid ":doc:`withPoints-family`" @@ -3920,13 +3539,13 @@ msgstr ":doc:`experimental`" msgid ":doc:`release_notes`" msgstr ":doc:`release_notes`" +msgid "pgRouting 4.0" +msgstr "" + msgid "pgRouting 4.0.0-alpha1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 4.0.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.0 `__" msgstr "" msgid "Build" @@ -3935,8 +3554,7 @@ msgstr "" msgid "C++ standard is std17" msgstr "" -msgid "" -"Using this standard, all supported toolchains across our CI matrix will work." +msgid "Using this standard, all supported toolchains across our CI matrix will work." msgstr "" msgid "The code is not yet modified to use std17:" @@ -3969,9 +3587,7 @@ msgstr "" msgid "The HTML documentation is built by default" msgstr "" -msgid "" -"The translated languages (en, es, sv, zh_Hans) HTML documentation are built " -"by default" +msgid "The translated languages (en, es, sv, zh_Hans) HTML documentation are built by default" msgstr "" msgid "`WITH-DOC` is not used anymore" @@ -4187,9 +3803,7 @@ msgstr ":doc:`pgr_trsp`" msgid "pgr_trsp(text,integer,integer,boolean,boolean,text)" msgstr "" -msgid "" -"pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean,text)" +msgid "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" msgstr "" #, fuzzy @@ -4209,13 +3823,10 @@ msgstr "" msgid "Valid values depend on kind of graph" msgstr "" -msgid "" -"pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean," -"character,boolean)" +msgid "pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "" -msgid "" -"pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +msgid "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" msgstr "" #, fuzzy @@ -4225,21 +3836,16 @@ msgstr ":doc:`pgr_trspVia_withPoints`" msgid "**Driving side** parameter is positional unnamed and compulsory." msgstr "" -msgid "" -"pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character," -"boolean)" +msgid "pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" msgstr "" -msgid "" -"pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +msgid "pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" msgstr "" -msgid "" -"pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +msgid "pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" msgstr "" -msgid "" -"pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" +msgid "pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" msgstr "" msgid "pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" @@ -4255,17 +3861,13 @@ msgstr "" msgid "Only for undirected graphs" msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." -msgid "" -"pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double " -"precision,double precision,double precision,boolean)" +msgid "pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgstr "" msgid "pgr_TSPeuclidean" msgstr "" -msgid "" -"pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, " -"integer,double precision,double precision,double precision,boolean)" +msgid "pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, integer,double precision,double precision,double precision,boolean)" msgstr "" msgid "pgr_turnRestrictedPath" @@ -4328,164 +3930,107 @@ msgstr "" msgid "pgr_withPointsDD" msgstr ":doc:`pgr_withPoints`" -msgid "" -"pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgid "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" msgstr "" -msgid "" -"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" +msgid "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" msgstr "" msgid "pgr_withPointsKSP" msgstr "" -msgid "" -"pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character," -"boolean)" +msgid "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" msgstr "" #, fuzzy msgid "pgr_withPointsVia" msgstr ":doc:`pgr_withPointsVia`" -msgid "" -"pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character," -"boolean)" +msgid "pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "" msgid "Functions promoted to official" msgstr "" -msgid "" -"`#2701 `__: pgr_trsp" +msgid "`#2701 `__: pgr_trsp" msgstr "" -msgid "" -"`#2701 `__: pgr_trspVia" +msgid "`#2701 `__: pgr_trspVia" msgstr "" -msgid "" -"`#2701 `__: " -"pgr_trspVia_withPoints" +msgid "`#2701 `__: pgr_trspVia_withPoints" msgstr "" -msgid "" -"`#2701 `__: " -"pgr_trsp_withPoints" +msgid "`#2701 `__: pgr_trsp_withPoints" msgstr "" -msgid "" -"`#2700 `__: " -"pgr_withPoints" +msgid "`#2700 `__: pgr_withPoints" msgstr "" -msgid "" -"`#2700 `__: " -"pgr_withPointsCost" +msgid "`#2700 `__: pgr_withPointsCost" msgstr "" -msgid "" -"`#2700 `__: " -"pgr_withPointsCostMatrix" +msgid "`#2700 `__: pgr_withPointsCostMatrix" msgstr "" -msgid "" -"`#2700 `__: " -"pgr_withPointsDD" +msgid "`#2700 `__: pgr_withPointsDD" msgstr "" -msgid "" -"`#2700 `__: " -"pgr_withPointsKSP" +msgid "`#2700 `__: pgr_withPointsKSP" msgstr "" -msgid "" -"`#2700 `__: " -"pgr_withPointsVia" +msgid "`#2700 `__: pgr_withPointsVia" msgstr "" -msgid "" -"`#2983 `__: " -"pgr_dijkstraNear" +msgid "`#2983 `__: pgr_dijkstraNear" msgstr "" -msgid "" -"`#2983 `__: " -"pgr_dijkstraNearCost" +msgid "`#2983 `__: pgr_dijkstraNearCost" msgstr "" -msgid "" -"`#2983 `__: " -"pgr_dijkstraVia" +msgid "`#2983 `__: pgr_dijkstraVia" msgstr "" msgid "Signatures promoted to official" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_aStar(Combinations)" +msgid "`#2718 `__: pgr_aStar(Combinations)" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_aStarCost(Combinations)" +msgid "`#2718 `__: pgr_aStarCost(Combinations)" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_bdAstar(Combinations)" +msgid "`#2718 `__: pgr_bdAstar(Combinations)" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_bdAstarCost(Combinations)" +msgid "`#2718 `__: pgr_bdAstarCost(Combinations)" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_bdDijkstra(Combinations)" +msgid "`#2718 `__: pgr_bdDijkstra(Combinations)" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_bdDijkstraCost(Combinations)" +msgid "`#2718 `__: pgr_bdDijkstraCost(Combinations)" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_dijkstra(Combinations)" +msgid "`#2718 `__: pgr_dijkstra(Combinations)" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_dijkstraCost(Combinations)" +msgid "`#2718 `__: pgr_dijkstraCost(Combinations)" msgstr "" -msgid "" -"`#2718 `__: pgr_KSP(All " -"signatures)" +msgid "`#2718 `__: pgr_KSP(All signatures)" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_boykovKolmogorov(Combinations)" +msgid "`#2718 `__: pgr_boykovKolmogorov(Combinations)" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_edmondsKarp(Combinations)" +msgid "`#2718 `__: pgr_edmondsKarp(Combinations)" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_maxFlow(Combinations)" +msgid "`#2718 `__: pgr_maxFlow(Combinations)" msgstr "" -msgid "" -"`#2718 `__: " -"pgr_pushRelabel(Combinations)" +msgid "`#2718 `__: pgr_pushRelabel(Combinations)" msgstr "" #, fuzzy @@ -4495,29 +4040,22 @@ msgstr ":doc:`routingFunctions`" msgid "Metrics" msgstr "" -msgid "" -"`#2951 `__: pgr_bandwidth" +msgid "`#2951 `__: pgr_bandwidth" msgstr "" msgid "Ordering" msgstr "" -msgid "" -"`#2954 `__: " -"pgr_kingOrdering" +msgid "`#2954 `__: pgr_kingOrdering" msgstr "" -msgid "" -"`#2955 `__: " -"pgr_sloanOrdering" +msgid "`#2955 `__: pgr_sloanOrdering" msgstr "" msgid "SQL signatures and output standardization" msgstr "" -msgid "" -"`#2904 `__: Standardize " -"output columns of functions with different output" +msgid "`#2904 `__: Standardize output columns of functions with different output" msgstr "" msgid "columns within overloads" @@ -4527,690 +4065,425 @@ msgstr "" msgid "Standardized to |short-generic-result|" msgstr ":doc:`pgr_createVerticesTable`" -msgid "" -"`#2905 `__: " -"pgr_withPoints" +msgid "`#2905 `__: pgr_withPoints" msgstr "" -msgid "" -"`#2906 `__: " -"pgr_bdDijkstra" +msgid "`#2906 `__: pgr_bdDijkstra" msgstr "" -msgid "" -"`#2907 `__: " -"pgr_bellmanFord" +msgid "`#2907 `__: pgr_bellmanFord" msgstr "" -msgid "" -"`#2908 `__: " -"pgr_binaryBreadthFirstSearch" +msgid "`#2908 `__: pgr_binaryBreadthFirstSearch" msgstr "" -msgid "" -"`#2910 `__: " -"pgr_edwardMoore" +msgid "`#2910 `__: pgr_edwardMoore" msgstr "" -msgid "" -"`#2913 `__: " -"pgr_dagShortestPath" +msgid "`#2913 `__: pgr_dagShortestPath" msgstr "" msgid "Standardized to |matrix-result|" msgstr "" -msgid "" -"`#2905 `__: " -"pgr_withPointsCost" +msgid "`#2905 `__: pgr_withPointsCost" msgstr "" -msgid "" -"`#2905 `__: " -"pgr_withPointsCostMatrix" +msgid "`#2905 `__: pgr_withPointsCostMatrix" msgstr "" #, fuzzy msgid "Standardized to |generic-result|" msgstr ":doc:`pgr_createVerticesTable`" -msgid "" -"`#2909 `__: " -"pgr_edgeDisjointPaths" +msgid "`#2909 `__: pgr_edgeDisjointPaths" msgstr "" -msgid "" -"`#2909 `__: " -"pgr_turnRestrictedPath" +msgid "`#2909 `__: pgr_turnRestrictedPath" msgstr "" msgid "Standardized to |result_edge_color|" msgstr "" -msgid "" -"`#2924 `__: " -"pgr_edgeColoring" +msgid "`#2924 `__: pgr_edgeColoring" msgstr "" msgid "Standardized to |result_node_color|" msgstr "" -msgid "" -"`#2924 `__: pgr_bipartite" +msgid "`#2924 `__: pgr_bipartite" msgstr "" -msgid "" -"`#2927 `__: " -"pgr_sequentialVertexColoring" +msgid "`#2927 `__: pgr_sequentialVertexColoring" msgstr "" msgid "Standardized to |result-spantree|" msgstr "" -msgid "" -"`#2931 `__: " -"pgr_breadthFirstSearch" +msgid "`#2931 `__: pgr_breadthFirstSearch" msgstr "" -msgid "" -"`#2931 `__: " -"pgr_depthFirstSearch" +msgid "`#2931 `__: pgr_depthFirstSearch" msgstr "" #, fuzzy msgid "Standardized to |result_node_order|" msgstr ":doc:`pgr_createVerticesTable`" -msgid "" -"`#2934 `__: " -"pgr_topologicalSort" +msgid "`#2934 `__: pgr_topologicalSort" msgstr "" #, fuzzy msgid "Standardized to |result-closure|" msgstr ":doc:`pgr_createVerticesTable`" -msgid "" -"`#2934 `__: " -"pgr_transitiveClosure" +msgid "`#2934 `__: pgr_transitiveClosure" msgstr "" msgid "Removal of SQL deprecated signatures" msgstr "" -msgid "" -"`#2798 `__: " -"pgr_contraction" +msgid "`#2798 `__: pgr_contraction" msgstr "" -msgid "" -"`#2683 `__: pgr_trsp" +msgid "`#2683 `__: pgr_trsp" msgstr "" -msgid "" -"`#2683 `__: pgr_trspVia" +msgid "`#2683 `__: pgr_trspVia" msgstr "" -msgid "" -"`#2888 `__: " -"pgr_findCloseEdges" +msgid "`#2888 `__: pgr_findCloseEdges" msgstr "" -msgid "" -"pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" +msgid "pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" msgstr "" -msgid "" -"pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" +msgid "pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" msgstr "" -msgid "" -"`#2890 `__: " -"pgr_withPointsDD" +msgid "`#2890 `__: pgr_withPointsDD" msgstr "" -msgid "" -"`#2895 `__: " -"pgr_withPointsKSP" +msgid "`#2895 `__: pgr_withPointsKSP" msgstr "" -msgid "" -"`#2899 `__: " -"pgr_maxCardinalityMatch" +msgid "`#2899 `__: pgr_maxCardinalityMatch" msgstr "" msgid "`#2901 `__: pgr_TSP" msgstr "" -msgid "" -"`#2901 `__: " -"pgr_TSPeuclidean" +msgid "`#2901 `__: pgr_TSPeuclidean" msgstr "" msgid "Removal of SQL deprecated functions" msgstr "" -msgid "" -"`#2681 `__: " -"pgr_trspViaedges" +msgid "`#2681 `__: pgr_trspViaedges" msgstr "" -msgid "" -"`#2682 `__: " -"pgr_trspViaVertices" +msgid "`#2682 `__: pgr_trspViaVertices" msgstr "" -msgid "" -"`#2748 `__: " -"pgr_alphaShape" +msgid "`#2748 `__: pgr_alphaShape" msgstr "" -msgid "" -"`#2751 `__: " -"pgr_createTopology" +msgid "`#2751 `__: pgr_createTopology" msgstr "" -msgid "" -"`#2752 `__: " -"pgr_analyzeGraph" +msgid "`#2752 `__: pgr_analyzeGraph" msgstr "" -msgid "" -"`#2755 `__: " -"pgr_analyzeOneWay" +msgid "`#2755 `__: pgr_analyzeOneWay" msgstr "" -msgid "" -"`#2827 `__: " -"pgr_createVerticesTable" +msgid "`#2827 `__: pgr_createVerticesTable" msgstr "" -msgid "" -"`#2886 `__: " -"pgr_nodeNetwork" +msgid "`#2886 `__: pgr_nodeNetwork" msgstr "" #, fuzzy msgid "Removal of SQL deprecated internal functions" msgstr ":doc:`routingFunctions`" -msgid "" -"`#2748 `__ " -"_pgr_alphaShape(text,double precision)" +msgid "`#2748 `__ _pgr_alphaShape(text,double precision)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_checkVertTab(text,text[],integer,text)" +msgid "`#2861 `__ _pgr_checkVertTab(text,text[],integer,text)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_createIndex(text,text,text,integer,text)" +msgid "`#2861 `__ _pgr_createIndex(text,text,text,integer,text)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_createIndex(text,text,text,text,integer,text)" +msgid "`#2861 `__ _pgr_createIndex(text,text,text,text,integer,text)" msgstr "" -msgid "" -"`#2913 `__ " -"_pgr_dagShortestPath(text,anyarray,anyarray,boolean,boolean)" +msgid "`#2913 `__ _pgr_dagShortestPath(text,anyarray,anyarray,boolean,boolean)" msgstr "" -msgid "" -"`#2913 `__ " -"_pgr_dagShortestPath(text,text,boolean,boolean)" +msgid "`#2913 `__ _pgr_dagShortestPath(text,text,boolean,boolean)" msgstr "" -msgid "" -"`#2730 `__ " -"_pgr_dijkstraNear(text,anyarray,anyarray,bigint,boolean)" +msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,anyarray,bigint,boolean)" msgstr "" -msgid "" -"`#2730 `__ " -"_pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)" +msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)" msgstr "" -msgid "" -"`#2730 `__ " -"_pgr_dijkstraNear(text,bigint,anyarray,bigint,boolean)" +msgid "`#2730 `__ _pgr_dijkstraNear(text,bigint,anyarray,bigint,boolean)" msgstr "" -msgid "" -"`#2730 `__ " -"_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" +msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" msgstr "" -msgid "" -"`#2730 `__ " -"_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" +msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" msgstr "" -msgid "" -"`#2730 `__ " -"_pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" +msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" msgstr "" -msgid "" -"`#2730 `__ " -"_pgr_dijkstra(text,text,boolean,boolean,boolean)" +msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,boolean)" msgstr "" -msgid "" -"`#2735 `__ " -"_pgr_drivingDistance(text,anyarray,double precision,boolean,boolean)" +msgid "`#2735 `__ _pgr_drivingDistance(text,anyarray,double precision,boolean,boolean)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_endPoint(geometry)" +msgid "`#2861 `__ _pgr_endPoint(geometry)" msgstr "" -msgid "" -"`#2861 `__ " -"__pgr_getColumnName(text,text,integer,text)" +msgid "`#2861 `__ __pgr_getColumnName(text,text,integer,text)" msgstr "" -msgid "" -"`#2861 `__ " -"__pgr_getColumnName(text,text,text,integer,text)" +msgid "`#2861 `__ __pgr_getColumnName(text,text,text,integer,text)" msgstr "" -msgid "" -"`#2861 `__ " -"__pgr_getColumnType(text,text,integer,text)" +msgid "`#2861 `__ __pgr_getColumnType(text,text,integer,text)" msgstr "" -msgid "" -"`#2861 `__ " -"__pgr_getColumnType(text,text,text,integer,text)" +msgid "`#2861 `__ __pgr_getColumnType(text,text,text,integer,text)" msgstr "" -msgid "" -"`#2861 `__ " -"__pgr_getTableName(text,integer,text)" +msgid "`#2861 `__ __pgr_getTableName(text,integer,text)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_isColumnIndexed(text,text,integer,text)" +msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,integer,text)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_isColumnIndexed(text,text,text,integer,text)" +msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,text,integer,text)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_isColumnIntable(text,text)" +msgid "`#2861 `__ _pgr_isColumnIntable(text,text)" msgstr "" -msgid "" -"`#2745 `__ " -"_pgr_kruskal(text,anyarray,text,bigint,double precision)" +msgid "`#2745 `__ _pgr_kruskal(text,anyarray,text,bigint,double precision)" msgstr "" -msgid "" -"`#2897 `__ _pgr_ksp(text," -"anyarray,anyarray,integer,boolean,boolean,boolean)" +msgid "`#2897 `__ _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean)" msgstr "" -msgid "" -"`#2897 `__ _pgr_ksp(text," -"bigint,bigint,integer,boolean,boolean)" +msgid "`#2897 `__ _pgr_ksp(text,bigint,bigint,integer,boolean,boolean)" msgstr "" -msgid "" -"`#2897 `__ _pgr_ksp(text," -"text,integer,boolean,boolean)" +msgid "`#2897 `__ _pgr_ksp(text,text,integer,boolean,boolean)" msgstr "" -msgid "" -"`#2899 `__ " -"_pgr_maxCardinalityMatch(text,boolean)" +msgid "`#2899 `__ _pgr_maxCardinalityMatch(text,boolean)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_msg(integer,text,text)" +msgid "`#2861 `__ _pgr_msg(integer,text,text)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_onerror(boolean,integer,text,text,text,text)" +msgid "`#2861 `__ _pgr_onerror(boolean,integer,text,text,text,text)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_pointtoid(geometry,double precision,text,integer)" +msgid "`#2861 `__ _pgr_pointtoid(geometry,double precision,text,integer)" msgstr "" -msgid "" -"`#2743 `__ " -"_pgr_prim(text,anyarray,text,bigint,double precision)" +msgid "`#2743 `__ _pgr_prim(text,anyarray,text,bigint,double precision)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_quote_ident(text)" +msgid "`#2861 `__ _pgr_quote_ident(text)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_startPoint(geometry)" +msgid "`#2861 `__ _pgr_startPoint(geometry)" msgstr "" -msgid "" -"`#2683 `__ " -"_pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean,text)" +msgid "`#2683 `__ _pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" msgstr "" -msgid "" -"`#2683 `__ " -"_pgr_trsp(text,text,anyarray,anyarray,boolean)" +msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,anyarray,boolean)" msgstr "" -msgid "" -"`#2683 `__ " -"_pgr_trsp(text,text,anyarray,bigint,boolean)" +msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,bigint,boolean)" msgstr "" -msgid "" -"`#2683 `__ " -"_pgr_trsp(text,text,bigint,anyarray,boolean)" +msgid "`#2683 `__ _pgr_trsp(text,text,bigint,anyarray,boolean)" msgstr "" -msgid "" -"`#2683 `__ " -"_pgr_trsp(text,text,bigint,bigint,boolean)" +msgid "`#2683 `__ _pgr_trsp(text,text,bigint,bigint,boolean)" msgstr "" -msgid "" -"`#2682 `__ " -"_pgr_trspViaVertices(text,integer[],boolean,boolean,text)" +msgid "`#2682 `__ _pgr_trspViaVertices(text,integer[],boolean,boolean,text)" msgstr "" -msgid "" -"`#2919 `__ " -"_pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean," -"character,boolean)" +msgid "`#2919 `__ _pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"_pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character," -"boolean)" +msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"_pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" +msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" msgstr "" -msgid "" -"`#2901 `__ " -"_pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer," -"integer,double precision,double precision,double precision,boolean)" +msgid "`#2901 `__ _pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgstr "" -msgid "" -"`#2901 `__ _pgr_tsp(text," -"bigint,bigint,double precision,integer,integer,integer,double precision," -"double precision,double precision,boolean)" +msgid "`#2901 `__ _pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgstr "" -msgid "" -"`#2861 `__ " -"_pgr_versionLess(text,text)" +msgid "`#2861 `__ _pgr_versionLess(text,text)" msgstr "" -msgid "" -"`#2890 `__ " -"_pgr_withPointsDD(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" +msgid "`#2890 `__ _pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" msgstr "" -msgid "" -"`#2895 `__ " -"_pgr_withPointsKSP(text,text,anyarray,anyarray,integer,character,boolean," -"boolean,boolean,boolean)" +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean)" msgstr "" -msgid "" -"`#2895 `__ " -"_pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character," -"boolean)" +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" msgstr "" -msgid "" -"`#2895 `__ " -"_pgr_withPointsKSP(text,text,text,integer,character,boolean,boolean,boolean)" +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,text,integer,character,boolean,boolean,boolean)" msgstr "" -msgid "" -"`#2741 `__ " -"_pgr_withPointsVia(text,bigint[],double precision[],boolean)" +msgid "`#2741 `__ _pgr_withPointsVia(text,bigint[],double precision[],boolean)" msgstr "" -msgid "" -"`#2741 `__ " -"_pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character," -"boolean)" +msgid "`#2741 `__ _pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "" -msgid "" -"`#2683 `__ _trsp(text," -"text,anyarray,anyarray,boolean)" +msgid "`#2683 `__ _trsp(text,text,anyarray,anyarray,boolean)" msgstr "" -msgid "" -"`#2683 `__ _v4trsp(text," -"text,anyarray,anyarray,boolean)" +msgid "`#2683 `__ _v4trsp(text,text,anyarray,anyarray,boolean)" msgstr "" -msgid "" -"`#2683 `__ _v4trsp(text," -"text,text,boolean)" +msgid "`#2683 `__ _v4trsp(text,text,text,boolean)" msgstr "" msgid "Summary of functions and signatures no longer on pgrouting" msgstr "" -msgid "" -"`#2748 `__ " -"pgr_alphashape(geometry,double precision)" +msgid "`#2748 `__ pgr_alphashape(geometry,double precision)" msgstr "" -msgid "" -"`#2752 `__ " -"pgr_analyzegraph(text,double precision,text,text,text,text,text)" +msgid "`#2752 `__ pgr_analyzegraph(text,double precision,text,text,text,text,text)" msgstr "" -msgid "" -"`#2755 `__ " -"pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)" +msgid "`#2755 `__ pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)" msgstr "" -msgid "" -"`#2798 `__ " -"pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgid "`#2798 `__ pgr_contraction(text,bigint[],integer,bigint[],boolean)" msgstr "" -msgid "" -"`#2751 `__ " -"pgr_createtopology(text,double precision,text,text,text,text,text,boolean)" +msgid "`#2751 `__ pgr_createtopology(text,double precision,text,text,text,text,text,boolean)" msgstr "" -msgid "" -"`#2827 `__ " -"pgr_createverticestable(text,text,text,text,text)" +msgid "`#2827 `__ pgr_createverticestable(text,text,text,text,text)" msgstr "" -msgid "" -"`#2888 `__ " -"pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" +msgid "`#2888 `__ pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" msgstr "" -msgid "" -"`#2888 `__ " -"pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" +msgid "`#2888 `__ pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" msgstr "" -msgid "" -"`#2899 `__ " -"pgr_maxCardinalityMatch(text,boolean)" +msgid "`#2899 `__ pgr_maxCardinalityMatch(text,boolean)" msgstr "" -msgid "" -"`#2886 `__ " -"pgr_nodenetwork(text,double precision,text,text,text,text,boolean)" +msgid "`#2886 `__ pgr_nodenetwork(text,double precision,text,text,text,text,boolean)" msgstr "" -msgid "" -"`#2683 `__ pgr_trsp(text," -"integer,double precision,integer,double precision,boolean,boolean,text)" +msgid "`#2683 `__ pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" msgstr "" -msgid "" -"`#2683 `__ pgr_trsp(text," -"integer,integer,boolean,boolean,text)" +msgid "`#2683 `__ pgr_trsp(text,integer,integer,boolean,boolean,text)" msgstr "" -msgid "" -"`#2681 `__ " -"pgr_trspViaedges(text,integer[],double precision[],boolean,boolean,text)" +msgid "`#2681 `__ pgr_trspViaedges(text,integer[],double precision[],boolean,boolean,text)" msgstr "" -msgid "" -"`#2682 `__ " -"pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" +msgid "`#2682 `__ pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean," -"character,boolean)" +msgid "`#2919 `__ pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character," -"boolean)" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" msgstr "" -msgid "" -"`#2901 `__ " -"pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer," -"double precision,double precision,double precision,boolean)" +msgid "`#2901 `__ pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgstr "" -msgid "" -"`#2901 `__ pgr_tsp(text," -"bigint,bigint,double precision,integer,integer,integer,double precision," -"double precision,double precision,boolean)" +msgid "`#2901 `__ pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPointsCostMatrix(text,text,anyarray,boolean,character)" +msgid "`#2919 `__ pgr_withPointsCostMatrix(text,text,anyarray,boolean,character)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,anyarray,anyarray,boolean,character)" +msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,anyarray,boolean,character)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,anyarray,bigint,boolean,character)" +msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,bigint,boolean,character)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,bigint,anyarray,boolean,character)" +msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,anyarray,boolean,character)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,bigint,bigint,boolean,character)" +msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,bigint,boolean,character)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,text,boolean,character)" +msgid "`#2919 `__ pgr_withPointsCost(text,text,text,boolean,character)" msgstr "" -msgid "" -"`#2890 `__ " -"pgr_withPointsDD(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" +msgid "`#2890 `__ pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" msgstr "" -msgid "" -"`#2890 `__ " -"pgr_withPointsDD(text,text,bigint,double precision,boolean,character,boolean)" +msgid "`#2890 `__ pgr_withPointsDD(text,text,bigint,double precision,boolean,character,boolean)" msgstr "" -msgid "" -"`#2895 `__ " -"pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character," -"boolean)" +msgid "`#2895 `__ pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPoints(text,text,anyarray,anyarray,boolean,character,boolean)" +msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,anyarray,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPoints(text,text,anyarray,bigint,boolean,character,boolean)" +msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,bigint,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPoints(text,text,bigint,anyarray,boolean,character,boolean)" +msgid "`#2919 `__ pgr_withPoints(text,text,bigint,anyarray,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPoints(text,text,bigint,bigint,boolean,character,boolean)" +msgid "`#2919 `__ pgr_withPoints(text,text,bigint,bigint,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPoints(text,text,text,boolean,character,boolean)" +msgid "`#2919 `__ pgr_withPoints(text,text,text,boolean,character,boolean)" msgstr "" -msgid "" -"`#2919 `__ " -"pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character," -"boolean)" +msgid "`#2919 `__ pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "" msgid "Code enhancements" @@ -5279,14 +4552,10 @@ msgstr "" msgid "`#2683 `__ _v4trsp" msgstr "" -msgid "" -"`#2748 `__ " -"_pgr_alphaShape" +msgid "`#2748 `__ _pgr_alphaShape" msgstr "" -msgid "" -"`#2913 `__ " -"_pgr_dagShortestPath" +msgid "`#2913 `__ _pgr_dagShortestPath" msgstr "" msgid "All releases" @@ -5295,10 +4564,7 @@ msgstr "" msgid "Kruskal - Family of functions" 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." +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 "**The main Characteristics are:**" @@ -5317,9 +4583,7 @@ msgstr ":doc:`pgr_withPoints`" msgid "Migration guide" msgstr "" -msgid "" -"Several functions are having changes on the signatures, and/or have been " -"replaced by new functions." +msgid "Several functions are having changes on the signatures, and/or have been replaced by new functions." msgstr "" msgid "Results can be different because of the changes." @@ -5332,9 +4596,7 @@ msgstr "" msgid "Migration to standardized columns" msgstr ":doc:`pgr_withPoints`" -msgid "" -"There has been an effort to standardize function output columns names and " -"types." +msgid "There has been an effort to standardize function output columns names and types." msgstr "" msgid ":ref:`pgRouting-concepts:Result columns for cost functions`" @@ -5437,14 +4699,10 @@ msgstr ":doc:`pgr_withPoints`" msgid "Migration of cost functions" msgstr ":doc:`pgr_withPoints`" -msgid "" -"The standardized :ref:`pgRouting-concepts:Result columns for cost functions` " -"are |matrix-result|" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for cost functions` are |matrix-result|" msgstr "" -msgid "" -"The following functions need to be migrated when they are being used in an " -"application." +msgid "The following functions need to be migrated when they are being used in an application." msgstr "" #, fuzzy @@ -5496,17 +4754,13 @@ msgstr "" msgid "Breaking change" msgstr "" -msgid "" -"If using ``pgr_withPointsCost``: column names must be changed after updating " -"pgRouting" +msgid "If using ``pgr_withPointsCost``: column names must be changed after updating pgRouting" msgstr "" msgid "New output columns are |matrix-result|" msgstr "" -msgid "" -"To get the old version column names: rename ``start_vid`` to ``start_pid`` " -"and ``end_vid`` to ``end_pid``." +msgid "To get the old version column names: rename ``start_vid`` to ``start_pid`` and ``end_vid`` to ``end_pid``." msgstr "" msgid "Examples" @@ -5519,9 +4773,7 @@ msgstr "" msgid "Using ``pgr_withPointsCost``" msgstr ":doc:`pgr_withPointsCost`" -msgid "" -"Migrating `this v3.8 `__ example." +msgid "Migrating `this v3.8 `__ example." msgstr "" msgid "from" @@ -5533,43 +4785,33 @@ msgstr "" msgid "Examples for One to Many for cost functions" msgstr "" -msgid "" -"Migrating `this v3.8 `__ example." +msgid "Migrating `this v3.8 `__ example." msgstr "" msgid "Examples for Many to One for cost functions" msgstr "" -msgid "" -"Migrating `this v3.8 `__ example." +msgid "Migrating `this v3.8 `__ example." msgstr "" msgid "Examples for Many to Many for cost functions" msgstr "" -msgid "" -"Migrating `this v3.8 `__ example." +msgid "Migrating `this v3.8 `__ example." msgstr "" #, fuzzy msgid "Examples for Combinations for cost functions" msgstr ":doc:`pgr_withPoints`" -msgid "" -"Migrating `this v3.8 `__ example." +msgid "Migrating `this v3.8 `__ example." msgstr "" #, fuzzy msgid "Migration of multiple paths functions" msgstr ":doc:`pgr_withPoints`" -msgid "" -"The standardized :ref:`pgRouting-concepts:Result columns for single path " -"functions` are |nksp-result|" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |nksp-result|" msgstr "" #, fuzzy @@ -5602,9 +4844,7 @@ msgstr "" msgid "One to One example using ``pgr_KSP``" msgstr "" -msgid "" -"Using `this `__ " -"example." +msgid "Using `this `__ example." msgstr "" #, fuzzy @@ -5624,9 +4864,7 @@ msgstr "" msgid "One to One example using ``pgr_edgeDisjointPaths``" msgstr ":doc:`pgr_edgeDisjointPaths`" -msgid "" -"Migrating `this v3.8 `__ example." +msgid "Migrating `this v3.8 `__ example." msgstr "" msgid "Before updating pgRouting enumerate the columns: |ksp-result|" @@ -5636,9 +4874,7 @@ msgstr "" msgid "Migration of single path functions" msgstr ":doc:`pgr_withPoints`" -msgid "" -"The standardized :ref:`pgRouting-concepts:Result columns for single path " -"functions` are |short-generic-result|" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |short-generic-result|" msgstr "" msgid "``pgr_dijkstra``" @@ -5683,9 +4919,7 @@ msgstr "" msgid "Migration of |old-generic-result|" msgstr ":doc:`pgr_createVerticesTable`" -msgid "" -"Before updating pgRouting, enumerate the corresponding columns of the " -"signature" +msgid "Before updating pgRouting, enumerate the corresponding columns of the signature" msgstr "" msgid "Migration of |old-pid-result|" @@ -5707,9 +4941,7 @@ msgstr "" msgid "``end_vid`` to ``end_pid``" msgstr "" -msgid "" -"If using ``pgr_withPoints``: column names must be changed after updating " -"pgRouting" +msgid "If using ``pgr_withPoints``: column names must be changed after updating pgRouting" msgstr "" #, fuzzy @@ -5729,9 +4961,7 @@ msgstr "" msgid "Using ``pgr_aStar``" msgstr ":doc:`pgr_aStarCost`" -msgid "" -"Migrating `this v3.5 `__ example." +msgid "Migrating `this v3.5 `__ example." msgstr "" msgid "Before updating pgRouting enumerate the columns: |result-1-1|" @@ -5741,18 +4971,14 @@ msgstr "" msgid "Using ``pgr_bdDijkstra``" msgstr ":doc:`pgr_withPoints`" -msgid "" -"Migrating `this v3.8 `__ example." +msgid "Migrating `this v3.8 `__ example." msgstr "" #, fuzzy msgid "Using ``pgr_DAGshortestPath``" msgstr ":doc:`pgr_bdAstarCost`" -msgid "" -"Migrating `this v3.8 `__ example." +msgid "Migrating `this v3.8 `__ example." msgstr "" msgid "This applies to all signatures of ``pgr_DAGshortestPath``" @@ -5765,9 +4991,7 @@ msgstr "" msgid "Using ``pgr_bdAstar``" msgstr ":doc:`pgr_bdAstarCost`" -msgid "" -"Migrating `this v3.5 `__ example." +msgid "Migrating `this v3.5 `__ example." msgstr "" msgid "Before updating pgRouting enumerate the columns: |result-1-m|" @@ -5777,25 +5001,19 @@ msgstr "" msgid "Using ``pgr_withPoints``" msgstr ":doc:`pgr_withPoints`" -msgid "" -"Migrating `this v3.8 `__ example." +msgid "Migrating `this v3.8 `__ example." msgstr "" msgid "|pid-1-m|" msgstr "" -msgid "" -"To get the old signature column names: filter out the column ``start_vid`` " -"and rename ``end_vid`` to ``end_pid``." +msgid "To get the old signature column names: filter out the column ``start_vid`` and rename ``end_vid`` to ``end_pid``." msgstr "" msgid "Examples for Many to One with one route result" msgstr "" -msgid "" -"Migrating `this v3.8 `__ example." +msgid "Migrating `this v3.8 `__ example." msgstr "" msgid "Before updating pgRouting enumerate the columns: |result-m-1|" @@ -5805,17 +5023,13 @@ msgstr "" msgid "Using ``pgr_dijkstra``" msgstr ":doc:`pgr_withPoints`" -msgid "" -"Migrating `this v3.4 `__ example." +msgid "Migrating `this v3.4 `__ example." msgstr "" msgid "Examples for Many to Many with one route result" msgstr "" -msgid "" -"Migrating `this v3.8 `__ example." +msgid "Migrating `this v3.8 `__ example." msgstr "" msgid "|pid-m-m|" @@ -5824,18 +5038,14 @@ msgstr "" msgid "Examples for combinations with one route result" msgstr "" -msgid "" -"Migrating `this v3.8 `this `__ example." +msgid "Migrating `this v3.8 `this `__ example." msgstr "" #, fuzzy msgid "Migration of spanning tree functions" msgstr ":doc:`pgr_withPoints`" -msgid "" -"The standardized :ref:`pgRouting-concepts:Result columns for spanning tree " -"functions` are |result-spantree|" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for spanning tree functions` are |result-spantree|" msgstr "" msgid "``pgr_drivingDistance``" @@ -5906,9 +5116,7 @@ msgstr "" msgid "Single vertex example using ``pgr_kruskalDD``" msgstr ":doc:`pgr_kruskalDD`" -msgid "" -"Migrating `this v3.6 `__ example." +msgid "Migrating `this v3.6 `__ example." msgstr "" msgid "Before updating pgRouting enumerate the columns: |result-bfs|." @@ -5918,9 +5126,7 @@ msgstr "" msgid "Multiple vertices example using ``pgr_kruskalDFS``" msgstr ":doc:`pgr_kruskalDFS`" -msgid "" -"Migrating `this v3.6 `__ example." +msgid "Migrating `this v3.6 `__ example." msgstr "" #, fuzzy @@ -5956,9 +5162,7 @@ msgstr "" msgid "Single vertex example using ``pgr_drivingDistance``" msgstr ":doc:`pgr_withPoints`" -msgid "" -"Migrating `this v3.5 `__ example." +msgid "Migrating `this v3.5 `__ example." msgstr "" msgid "Before updating pgRouting, enumerate |result-1-1-no-seq| columns" @@ -5968,14 +5172,10 @@ msgstr "" msgid "Multiple vertices example using ``pgr_drivingDistance``" msgstr ":doc:`pgr_withPoints`" -msgid "" -"Migrating `this v3.5 `__ example." +msgid "Migrating `this v3.5 `__ example." msgstr "" -msgid "" -"To get the old version column names |result-dij-dd-m|: filter out the column " -"``pred`` and ``depth`` and rename ``start_vid`` to ``from_v``." +msgid "To get the old version column names |result-dij-dd-m|: filter out the column ``pred`` and ``depth`` and rename ``start_vid`` to ``from_v``." msgstr "" #, fuzzy @@ -5988,9 +5188,7 @@ msgstr "" msgid "Enumerate |result-1-1-no-seq| columns" msgstr "" -msgid "" -"Use an unnamed valid value for **driving side** after the **distance** " -"parameter." +msgid "Use an unnamed valid value for **driving side** after the **distance** parameter." msgstr "" msgid "Enumerate |result-m-1-no-seq| columns" @@ -5999,9 +5197,7 @@ msgstr "" msgid "Default value of **driving side** parameter" msgstr "" -msgid "" -"**driving side** parameter is unnamed, and valid values differ for directed " -"and undirected graphs." +msgid "**driving side** parameter is unnamed, and valid values differ for directed and undirected graphs." msgstr "" msgid "In directed graph: valid values are [``r``, ``R``, ``l``, ``L``]" @@ -6020,18 +5216,14 @@ msgstr "" msgid "Single vertex example using ``pgr_withPointsDD``" msgstr ":doc:`pgr_withPoints`" -msgid "" -"Migrating `this v3.5 `__ example." +msgid "Migrating `this v3.5 `__ example." msgstr "" #, fuzzy msgid "Multiple vertices example using ``pgr_withPointsDD``" msgstr ":doc:`pgr_withPoints`" -msgid "" -"Migrating `this v3.5 `__ example." +msgid "Migrating `this v3.5 `__ example." msgstr "" #, fuzzy @@ -6177,9 +5369,7 @@ msgstr "" msgid "If you have SFCGAL, which you can install using" msgstr "" -msgid "" -"Since PostGIS 3.5+ use `CG_AlphaShape `__" +msgid "Since PostGIS 3.5+ use `CG_AlphaShape `__" msgstr "" msgid "For PostGIS 3.5+ use the old name ``ST_AlphaShape``" @@ -6198,9 +5388,7 @@ msgstr "" msgid "Migration of ``pgr_nodeNetwork``" msgstr ":doc:`pgr_analyzeGraph`" -msgid "" -"**Before Deprecation:** A table with `_nodded` was created. with " -"split edges." +msgid "**Before Deprecation:** A table with `_nodded` was created. with split edges." msgstr "" #, fuzzy @@ -6217,62 +5405,38 @@ msgstr ":doc:`pgr_createVerticesTable`" msgid "A table with `_vertices_pgr` was created." msgstr "" -msgid "" -"**After Deprecation:** The user is responsible to create the complete " -"topology." +msgid "**After Deprecation:** The user is responsible to create the complete topology." msgstr "" msgid "Build a routing topology" msgstr "" -msgid "" -"The basic information to use the majority of the pgRouting functions ``id, " -"source, target, cost, [reverse_cost]`` is what in pgRouting is called the " -"routing topology." +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 "" -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." +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 "" -msgid "" -"When the data comes with geometries and there is no routing topology, then " -"this step is needed." +msgid "When the data comes with geometries and there is no routing topology, then this step is needed." msgstr "" -msgid "" -"All the start and end vertices of the geometries need an identifier that is " -"to be stored in a ``source`` and ``target`` columns of the table of the " -"data. Likewise, ``cost`` and ``reverse_cost`` need to have the value of " -"traversing the edge in both directions." +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 "" -msgid "" -"If the columns do not exist they need to be added to the table in question. " -"(see `ALTER TABLE `__)" +msgid "If the columns do not exist they need to be added to the table in question. (see `ALTER TABLE `__)" msgstr "" -msgid "" -"The function :doc:`pgr_extractVertices` is used to create a vertices table " -"based on the edge identifier and the geometry of the edge of the graph." +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 "" -msgid "" -"Finally using the data stored on the vertices tables the ``source`` and " -"``target`` are filled up." +msgid "Finally using the data stored on the vertices tables the ``source`` and ``target`` are filled up." msgstr "" #, fuzzy msgid "Migration of ``pgr_createVerticesTable``" msgstr ":doc:`pgr_createVerticesTable`" -msgid "" -"**After Deprecation:** The user is responsible to create the vertices table, " -"indexes, etc. They may use :doc:`pgr_extractVertices` for that purpose." +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 @@ -6291,14 +5455,10 @@ msgstr "" msgid "Dead ends." msgstr "" -msgid "" -"A routing problem can arise when from a vertex there is only a way on or a " -"way out but not both:" +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 "" -"Either saving or using directly :doc:`pgr_extractVertices` get the dead ends " -"information and determine if the adjacent edge is one way or not." +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 "In this example :doc:`pgr_extractVertices` has already been applied." @@ -6307,10 +5467,7 @@ msgstr "" msgid "Bridges." msgstr "" -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." +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 "To determine if the bridges are or not one way." @@ -6370,9 +5527,7 @@ msgstr ":doc:`migration`" msgid "Components." msgstr "" -msgid "" -"Instead of counting only isolated segments, determine all the components of " -"the graph." +msgid "Instead of counting only isolated segments, determine all the components of the graph." msgstr "" msgid "Depending of the final application requirements use:" @@ -6393,32 +5548,22 @@ msgstr ":doc:`pgr_contraction`" msgid "For example:" msgstr "" -msgid "" -"Instead of counting the dead ends, determine all the dead ends of the graph " -"using :doc:`pgr_degree`." +msgid "Instead of counting the dead ends, determine all the dead ends of the graph using :doc:`pgr_degree`." msgstr "" msgid "Potential gaps near dead ends." msgstr "" -msgid "" -"Instead of counting potential gaps between geometries, determine the " -"geometric gaps in the graph using :doc:`pgr_findCloseEdges`." +msgid "Instead of counting potential gaps between geometries, determine the geometric gaps in the graph using :doc:`pgr_findCloseEdges`." msgstr "" msgid "Topological relationships." msgstr "" -msgid "" -"Instead of counting intersections, determine topological relationships " -"between geometries." +msgid "Instead of counting intersections, determine topological relationships between geometries." msgstr "" -msgid "" -"Several PostGIS functions can be used: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." +msgid "Several PostGIS functions can be used: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." msgstr "" msgid "Migration of ``pgr_trsp`` (Vertices)" @@ -6523,9 +5668,7 @@ msgstr "" msgid "Migration of ``pgr_withPointsKSP``" msgstr ":doc:`pgr_withPoints`" -msgid "" -"Starting from `v3.6.0 `__ :" -"doc:`pgr_withPointsKSP` result columns are being standardized." +msgid "Starting from `v3.6.0 `__ :doc:`pgr_withPointsKSP` result columns are being standardized." msgstr "" msgid "|ksp-result|" @@ -6534,9 +5677,7 @@ msgstr "" msgid "|generic-result|" msgstr "" -msgid "" -"And ``driving side`` parameter changed from named optional to unnamed " -"**driving side** and its validity differ for directed and undirected graphs." +msgid "And ``driving side`` parameter changed from named optional to unnamed **driving side** and its validity differ for directed and undirected graphs." msgstr "" msgid "``pgr_withPointsKSP`` (`One to One`)" @@ -6560,9 +5701,7 @@ msgstr "" msgid "New output columns are |generic-result|" msgstr "" -msgid "" -"Using `this `__ example." +msgid "Using `this `__ example." msgstr "" msgid "``start_vid`` contains the **start vid** parameter value." @@ -6571,9 +5710,7 @@ msgstr "" msgid "``end_vid`` contains the **end vid** parameter value." msgstr "" -msgid "" -"If needed filter out the additional columns, for example, to return the " -"original columns:" +msgid "If needed filter out the additional columns, for example, to return the original columns:" msgstr "" msgid "Use ``pgr_withPoints`` when there are no restrictions." @@ -6592,13 +5729,10 @@ msgstr "" msgid "Migration of ``pgr_maxCardinalityMatch``" msgstr "" -msgid "" -":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, therefore " -"the ``directed`` flag has been removed." +msgid ":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, therefore the ``directed`` flag has been removed." msgstr "" -msgid "" -"Starting from `v3.4.0 `__" +msgid "Starting from `v3.4.0 `__" msgstr "" msgid "Signature to be migrated:" @@ -6628,27 +5762,19 @@ msgstr "" msgid "Before migration" msgstr "" -msgid "" -"Columns used are ``going`` and ``coming`` to represent the existence of an " -"edge." +msgid "Columns used are ``going`` and ``coming`` to represent the existence of an edge." msgstr "" -msgid "" -"Flag ``directed`` was used to indicate if it was for a **directed** or " -"**undirected** graph." +msgid "Flag ``directed`` was used to indicate if it was for a **directed** or **undirected** graph." msgstr "" msgid "The flag ``directed`` is ignored." msgstr "" -msgid "" -"Regardless of it's value it gives the result considering the graph as " -"**undirected**." +msgid "Regardless of it's value it gives the result considering the graph as **undirected**." msgstr "" -msgid "" -"Use the columns ``cost`` and ``reverse_cost`` to represent the existence of " -"an edge." +msgid "Use the columns ``cost`` and ``reverse_cost`` to represent the existence of an edge." msgstr "" msgid "Do not use the flag ``directed``." @@ -6708,9 +5834,7 @@ msgstr "" msgid "Old restrictions contents" msgstr "" -msgid "" -"The restriction with ``rid = 2`` is representing :math:`3 \\rightarrow 5 " -"\\rightarrow9`" +msgid "The restriction with ``rid = 2`` is representing :math:`3 \\rightarrow 5 \\rightarrow9`" msgstr "" msgid ":math:`3\\rightarrow5`" @@ -6764,16 +5888,13 @@ msgstr "" msgid "Restrictions data" msgstr "" -msgid "" -"The restriction with ``rid = 2`` represents the path :math:`3 \\rightarrow5 " -"\\rightarrow9`." +msgid "The restriction with ``rid = 2`` represents the path :math:`3 \\rightarrow5 \\rightarrow9`." msgstr "" msgid "By inspection the path is clear." msgstr "" -msgid "" -"To transform the old restrictions table to the new restrictions structure," +msgid "To transform the old restrictions table to the new restrictions structure," msgstr "" msgid "Create a new table with the new restrictions structure." @@ -6782,9 +5903,7 @@ msgstr "" msgid "In this migration guide ``new_restrictions`` is been used." msgstr "" -msgid "" -"For this migration pgRouting supplies an auxiliary function for reversal of " -"an array ``_pgr_array_reverse`` needed for the migration." +msgid "For this migration pgRouting supplies an auxiliary function for reversal of an array ``_pgr_array_reverse`` needed for the migration." msgstr "" msgid "``_pgr_array_reverse``:" @@ -6812,9 +5931,7 @@ msgstr "" msgid "pgRouting Concepts" msgstr "" -msgid "" -"This is a simple guide that go through some of the steps for getting started " -"with pgRouting. This guide covers:" +msgid "This is a simple guide that go through some of the steps for getting started with pgRouting. This guide covers:" msgstr "" msgid "Graphs" @@ -6847,8 +5964,7 @@ msgstr "" msgid "Directed simple graph" msgstr "" -msgid "" -":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" +msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" msgstr "" msgid "Graphs:" @@ -6857,13 +5973,10 @@ msgstr "" msgid "Do not have geometries." msgstr "" -msgid "" -"Some graph theory problems require graphs to have weights, called **cost** " -"in pgRouting." +msgid "Some graph theory problems require graphs to have weights, called **cost** in pgRouting." msgstr "" -msgid "" -"In pgRouting there are several ways to represent a graph on the database:" +msgid "In pgRouting there are several ways to represent a graph on the database:" msgstr "" msgid "With ``cost``" @@ -6878,9 +5991,7 @@ msgstr "" msgid "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)" msgstr "" -msgid "" -"Identifier of the edge. Requirement to use the database in a consistent. " -"manner." +msgid "Identifier of the edge. Requirement to use the database in a consistent. manner." msgstr "" msgid "Identifier of a vertex." @@ -6889,20 +6000,16 @@ msgstr "" msgid "Weight of the edge (``source``, ``target``):" msgstr "" -msgid "" -"When negative the edge (``source``, ``target``) do not exist on the graph." +msgid "When negative the edge (``source``, ``target``) do not exist on the graph." msgstr "" msgid "``cost`` must exist in the query." msgstr "" -msgid "" -"When negative the edge (``target``, ``source``) do not exist on the graph." +msgid "When negative the edge (``target``, ``source``) do not exist on the graph." msgstr "" -msgid "" -"The decision of the graph to be **directed** or **undirected** is done when " -"executing a pgRouting algorithm." +msgid "The decision of the graph to be **directed** or **undirected** is done when executing a pgRouting algorithm." msgstr "" msgid "Graph with ``cost``" @@ -6917,9 +6024,7 @@ msgstr "" msgid "``SELECT id, source, target, cost FROM edges``" msgstr "" -msgid "" -":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} " -"\\ge 0 \\}`" +msgid ":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} \\ge 0 \\}`" msgstr "" msgid "Edges where ``cost`` is non negative are part of the graph." @@ -6931,9 +6036,7 @@ msgstr "" msgid "All vertices in ``source`` and ``target`` are part of the graph." msgstr "" -msgid "" -"In a directed graph the edge :math:`(source_{id}, target_{id}, cost_{id})` " -"has directionality: :math:`source_{id} \\rightarrow target_{id}`" +msgid "In a directed graph the edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`" msgstr "" msgid "For the following data:" @@ -6945,20 +6048,13 @@ msgstr "" msgid "The data is representing the following graph:" msgstr "" -msgid "" -"In an undirected graph the edge :math:`(source_{id}, target_{id}, " -"cost_{id})` does not have directionality: :math:`source_{id} \\frac{\\;\\;\\;" -"\\;\\;}{} target_{id}`" +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 "" -msgid "" -"In terms of a directed graph is like having two edges: :math:`source_{id} " -"\\leftrightarrow target_{id}`" +msgid "In terms of a directed graph is like having two edges: :math:`source_{id} \\leftrightarrow target_{id}`" msgstr "" -msgid "" -"Edge :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) is not part of the " -"graph." +msgid "Edge :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) is not part of the graph." msgstr "" msgid "Graph with ``cost`` and ``reverse_cost``" @@ -6970,21 +6066,13 @@ msgstr "" msgid "The set of edges :math:`E`:" msgstr "" -msgid "" -":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, " -"cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & " -"{\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } " -"reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" +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 "" -msgid "" -"Edges :math:`(source \\rightarrow target)` where ``cost`` is non negative " -"are part of the graph." +msgid "Edges :math:`(source \\rightarrow target)` where ``cost`` is non negative are part of the graph." msgstr "" -msgid "" -"Edges :math:`(target \\rightarrow source)` where ``reverse_cost`` is non " -"negative are part of the graph." +msgid "Edges :math:`(target \\rightarrow source)` where ``reverse_cost`` is non negative are part of the graph." msgstr "" msgid "The set of vertices :math:`V`:" @@ -6993,14 +6081,10 @@ msgstr "" msgid "In a directed graph both edges have directionality" msgstr "" -msgid "" -"edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:" -"`source_{id} \\rightarrow target_{id}`" +msgid "edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`" msgstr "" -msgid "" -"edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` has " -"directionality: :math:`target_{id} \\rightarrow source_{id}`" +msgid "edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` has directionality: :math:`target_{id} \\rightarrow source_{id}`" msgstr "" msgid "Edges not part of the graph:" @@ -7015,14 +6099,10 @@ msgstr "" msgid "In a directed graph both edges do not have directionality" msgstr "" -msgid "" -"Edge :math:`(source_{id}, target_{id}, cost_{id})` is :math:`source_{id} " -"\\frac{\\;\\;\\;\\;\\;}{} target_{id}`" +msgid "Edge :math:`(source_{id}, target_{id}, cost_{id})` is :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" msgstr "" -msgid "" -"Edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` is :math:" -"`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" +msgid "Edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` is :math:`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" msgstr "" msgid "In terms of a directed graph is like having four edges:" @@ -7043,18 +6123,13 @@ msgstr "" msgid "Graphs without geometries" msgstr "" -msgid "" -"Personal relationships, genealogy, file dependency problems can be solved " -"using pgRouting. Those problems, normally, do not come with geometries " -"associated with the graph." +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 "" msgid "Wiki example" msgstr "" -msgid "" -"Solve the example problem taken from `wikipedia `__):" +msgid "Solve the example problem taken from `wikipedia `__):" msgstr "" msgid "Problem is to find the shortest path from :math:`1` to :math:`5`." @@ -7063,8 +6138,7 @@ msgstr "" msgid "Is an undirected graph." msgstr "" -msgid "" -"Although visually looks like to have geometries, the drawing is not to scale." +msgid "Although visually looks like to have geometries, the drawing is not to scale." msgstr "" msgid "No geometries associated to the vertices or edges" @@ -7076,10 +6150,7 @@ msgstr "" msgid "Has 9 edges:" msgstr "" -msgid "" -":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\" -"\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & " -"(5,6,9) \\} \\end{align} \\end{split}`" +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 "" msgid "The graph can be represented in many ways for example:" @@ -7088,17 +6159,13 @@ msgstr "" msgid "Prepare the database" msgstr "" -msgid "" -"Create a database for the example, access the database and install " -"pgRouting: ::" +msgid "Create a database for the example, access the database and install pgRouting: ::" msgstr "" msgid "Create a table" msgstr "" -msgid "" -"The basic elements needed to perform basic routing on an undirected graph " -"are:" +msgid "The basic elements needed to perform basic routing on an undirected graph are:" msgstr "" msgid "SMALLINT, INTEGER, BIGINT, REAL, FLOAT" @@ -7116,9 +6183,7 @@ msgstr "" msgid "To solve this example :doc:`pgr_dijkstra` is used:" msgstr "" -msgid "" -"To go from :math:`1` to :math:`5` the path goes thru the following " -"vertices: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" +msgid "To go from :math:`1` to :math:`5` the path goes thru the following vertices: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" msgstr "" msgid "Vertex information" @@ -7133,16 +6198,13 @@ msgstr "" msgid "Create a routing Database" msgstr "" -msgid "" -"The first step is to create a database and load pgRouting in the database." +msgid "The first step is to create a database and load pgRouting in the database." msgstr "" msgid "Typically create a database for each project." msgstr "" -msgid "" -"Once having the database to work in, load your data and build the routing " -"application in that database." +msgid "Once having the database to work in, load your data and build the routing application in that database." msgstr "" msgid "Load Data" @@ -7161,9 +6223,7 @@ msgstr "" msgid ":doc:`sampledata`: a small graph used in the documentation examples" msgstr ":doc:`sampledata` 는 이 매뉴얼의 예제로 사용됩니다." -msgid "" -"Using `osm2pgrouting `__" +msgid "Using `osm2pgrouting `__" msgstr "" msgid "There are various open source tools that can help, like:" @@ -7187,18 +6247,13 @@ msgstr "" msgid "load OSM data into postgresql" 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." +msgid "Please note that these tools will **not** import the data in a structure compatible with pgRouting and when this happens the topology needs to be adjusted." msgstr "" msgid "Breakup a segments on each segment-segment intersection" msgstr "" -msgid "" -"When missing, add columns and assign values to ``source``, ``target``, " -"``cost``, ``reverse_cost``." +msgid "When missing, add columns and assign values to ``source``, ``target``, ``cost``, ``reverse_cost``." msgstr "" msgid "Connect a disconnected graph." @@ -7222,22 +6277,13 @@ msgstr "" msgid "Prepare the graph" msgstr "" -msgid "" -"What and how to prepare the graph, will depend on the application and/or on " -"the quality of the data and/or on how close the information is to have a " -"topology usable by pgRouting and/or some other factors not mentioned." +msgid "What and how to prepare the graph, will depend on the application and/or on the quality of the data and/or on how close the information is to have a topology usable by pgRouting and/or some other factors not mentioned." msgstr "" -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." +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." msgstr "" -msgid "" -"The `workshop `__ has a step by step " -"on how to prepare a graph using Open Street Map data, for a small " -"application." +msgid "The `workshop `__ has a step by step on how to prepare a graph using Open Street Map data, for a small application." msgstr "" msgid "The use of indexes on the database design in general:" @@ -7249,32 +6295,22 @@ msgstr "" msgid "Have the identifiers columns indexed." msgstr "" -msgid "" -"Please consult the `PostgreSQL `__ " -"documentation and the `PostGIS `__ documentation." +msgid "Please consult the `PostgreSQL `__ documentation and the `PostGIS `__ documentation." 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 `__." +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 "" msgid "Adjust costs" msgstr "" -msgid "" -"For this example the ``cost`` and ``reverse_cost`` values are going to be " -"the double of the length of the geometry." +msgid "For this example the ``cost`` and ``reverse_cost`` values are going to be the double of the length of the geometry." msgstr "" msgid "Update costs to length of geometry" msgstr "" -msgid "" -"Suppose that ``cost`` and ``reverse_cost`` columns in the sample data " -"represent:" +msgid "Suppose that ``cost`` and ``reverse_cost`` columns in the sample data represent:" msgstr "" msgid ":math:`1` when the edge exists in the graph" @@ -7289,9 +6325,7 @@ msgstr "" msgid "Which gives the following results:" msgstr "" -msgid "" -"Note that to be able to follow the documentation examples, everything is " -"based on the original graph." +msgid "Note that to be able to follow the documentation examples, everything is based on the original graph." msgstr "" msgid "Returning to the original data:" @@ -7342,9 +6376,7 @@ msgstr "" msgid "A sub graph is needed for the application." msgstr "" -msgid "" -"and many other problems that the pgRouting user, that is the application " -"developer might encounter." +msgid "and many other problems that the pgRouting user, that is the application developer might encounter." msgstr "" msgid "Crossing edges" @@ -7353,21 +6385,16 @@ msgstr "" msgid "To get the crossing edges:" msgstr "" -msgid "" -"That information is correct, for example, when in terms of vehicles, is it a " -"tunnel or bridge crossing over another road." +msgid "That information is correct, for example, when in terms of vehicles, is it a tunnel or bridge crossing over another road." msgstr "" msgid "It might be incorrect, for example:" msgstr "" -msgid "" -"When it is actually an intersection of roads, where vehicles can make turns." +msgid "When it is actually an intersection of roads, where vehicles can make turns." msgstr "" -msgid "" -"When in terms of electrical lines, the electrical line is able to switch " -"roads even on a tunnel or bridge." +msgid "When in terms of electrical lines, the electrical line is able to switch roads even on a tunnel or bridge." msgstr "" msgid "When it is incorrect, it needs fixing:" @@ -7376,47 +6403,32 @@ msgstr "" msgid "For vehicles and pedestrians" 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." +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 "" -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" +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 "For very specific applications" msgstr "" -msgid "" -"The data is correct when from the point of view of routing vehicles or " -"pedestrians." +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 `__." +msgid "Once analyzed one by one the crossings, for the ones that need a local fix, the edges need to be `split `__." 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." +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 "" #, fuzzy msgid "Fixing an intersection" msgstr "소개" -msgid "" -"In this example the original edge table will be used to store the additional " -"geometries." +msgid "In this example the original edge table will be used to store the additional geometries." msgstr "" msgid "An example use without results" @@ -7440,18 +6452,13 @@ msgstr "" msgid "Adding new segments." msgstr "" -msgid "" -"Calling :doc:`pgr_separateCrossing` and adding the new segments to the edges " -"table." +msgid "Calling :doc:`pgr_separateCrossing` and adding the new segments to the edges table." msgstr "" msgid "Update other values" msgstr "" -msgid "" -"In this example only ``cost`` and ``reverse_cost`` are updated, where they " -"are based on the length of the geometry and the directionality is kept using " -"the ``sign`` function." +msgid "In this example only ``cost`` and ``reverse_cost`` are updated, where they are based on the length of the geometry and the directionality is kept using the ``sign`` function." msgstr "" msgid "Update the topology" @@ -7481,9 +6488,7 @@ msgstr "" msgid "Maybe there is a small barrier for vehicles but not for pedestrians." msgstr "" -msgid "" -"Once analyzed one by one the touchings, for the ones that need a local fix, " -"the edges need to be `split `__." +msgid "Once analyzed one by one the touchings, for the ones that need a local fix, the edges need to be `split `__." msgstr "" msgid "Fixing a gap" @@ -7498,9 +6503,7 @@ msgstr "" msgid "The analysis tell us that the network has a gap." msgstr "" -msgid "" -"Calling :doc:`pgr_separateTouching` and adding the new segments to the edges " -"table." +msgid "Calling :doc:`pgr_separateTouching` and adding the new segments to the edges table." msgstr "" msgid "Routing from :math:`1` to :math:`2` gives a solution." @@ -7527,25 +6530,19 @@ msgstr "" msgid "This solution requires the edge to be split." msgstr "" -msgid "" -"In this example :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` " -"will be used." +msgid "In this example :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` will be used." msgstr "" msgid "Get the connectivity" msgstr "" -msgid "" -"In this example: the edges table will need an additional column and the " -"vertex table will be rebuilt completely." +msgid "In this example: the edges table will need an additional column and the vertex table will be rebuilt completely." msgstr "" msgid "Insert new edges" msgstr "" -msgid "" -"Using :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` insert the " -"results into the edges table." +msgid "Using :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` insert the results into the edges table." msgstr "" msgid "Create the vertices table" @@ -7561,20 +6558,13 @@ msgstr "" msgid "The graph can be reduced in size using :doc:`contraction-family`" msgstr "" -msgid "" -"When to contract will depend on the size of the graph, processing times, " -"correctness of the data, on the final application, or any other factor not " -"mentioned." +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 "" -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." +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 "" -msgid "" -"A complete method on how to contract and how to use the contracted graph is " -"described on :doc:`contraction-family`" +msgid "A complete method on how to contract and how to use the contracted graph is described on :doc:`contraction-family`" msgstr "" msgid "To get the dead ends:" @@ -7583,8 +6573,7 @@ msgstr "" msgid "A dead end happens when" msgstr "" -msgid "" -"The vertex is the limit of a cul-de-sac, a no-through road or a no-exit road." +msgid "The vertex is the limit of a cul-de-sac, a no-through road or a no-exit road." msgstr "" msgid "The vertex is on the limit of the imported graph." @@ -7593,9 +6582,7 @@ msgstr "" msgid "If a larger graph is imported then the vertex might not be a dead end" msgstr "" -msgid "" -"Node :math:`4`, is a dead end on the query, even that it visually looks like " -"an end point of 3 edges." +msgid "Node :math:`4`, is a dead end on the query, even that it visually looks like an end point of 3 edges." msgstr "" msgid "Is node :math:`4` a dead end or not?" @@ -7610,27 +6597,19 @@ msgstr "" msgid "That does not allow a vehicle to use that visual intersection?" msgstr "" -msgid "" -"Is the application for pedestrians and therefore the pedestrian can easily " -"walk on the small curb?" +msgid "Is the application for pedestrians and therefore the pedestrian can easily walk on the small curb?" msgstr "" -msgid "" -"Is the application for the electricity and the electrical lines than can " -"easily be extended on top of the small curb?" +msgid "Is the application for the electricity and the electrical lines than can easily be extended on top of the small curb?" msgstr "" -msgid "" -"Is there a big cliff and from eagles view look like the dead end is close to " -"the segment?" +msgid "Is there a big cliff and from eagles view look like the dead end is close to the segment?" msgstr "" msgid "Depending on the answer, modification of the data might be needed." msgstr "" -msgid "" -"When there are many dead ends, to speed up processing, the :doc:`contraction-" -"family` functions can be used to contract the graph." +msgid "When there are many dead ends, to speed up processing, the :doc:`contraction-family` functions can be used to contract the graph." msgstr "" msgid "Linear edges" @@ -7639,22 +6618,16 @@ msgstr "" msgid "To get the linear edges:" msgstr "" -msgid "" -"These linear vertices are correct, for example, when those the vertices are " -"speed bumps, stop signals and the application is taking them into account." +msgid "These linear vertices are correct, for example, when those the vertices are speed bumps, stop signals and the application is taking them into account." msgstr "" -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." +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 "" msgid "Function's structure" msgstr "" -msgid "" -"Once the graph preparation work has been done above, it is time to use a" +msgid "Once the graph preparation work has been done above, it is time to use a" msgstr "" msgid "The general form of a pgRouting function call is:" @@ -7666,30 +6639,22 @@ msgstr "" msgid "pgr_(`Inner queries`_, **parameters**, [ ``Optional parameters``)" msgstr "" -msgid "" -"`Inner queries`_: Are compulsory parameters that are ``TEXT`` strings " -"containing SQL queries." +msgid "`Inner queries`_: Are compulsory parameters that are ``TEXT`` strings containing SQL queries." msgstr "" -msgid "" -"**parameters**: Additional compulsory parameters needed by the function." +msgid "**parameters**: Additional compulsory parameters needed by the function." msgstr "" -msgid "" -"``Optional parameters``: Are non compulsory **named** parameters that have a " -"default value when omitted." +msgid "``Optional parameters``: Are non compulsory **named** parameters that have a default value when omitted." msgstr "" -msgid "" -"The compulsory parameters are positional parameters, the optional parameters " -"are named parameters." +msgid "The compulsory parameters are positional parameters, the optional parameters are named parameters." msgstr "" msgid "For example, for this :doc:`pgr_dijkstra` signature:" msgstr "" -msgid "" -"pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" msgid "`Edges SQL`_:" @@ -7704,9 +6669,7 @@ msgstr "" msgid "It is an inner query." msgstr "" -msgid "" -"It has no name, so **Edges SQL** gives an idea of what kind of inner query " -"needs to be used" +msgid "It has no name, so **Edges SQL** gives an idea of what kind of inner query needs to be used" msgstr "" msgid "**start vid**:" @@ -7715,17 +6678,13 @@ msgstr "" msgid "Is the second parameter." msgstr "" -msgid "" -"It has no name, so **start vid** gives an idea of what the second " -"parameter's value should contain." +msgid "It has no name, so **start vid** gives an idea of what the second parameter's value should contain." msgstr "" msgid "Is the third parameter." msgstr "" -msgid "" -"It has no name, so **end vid** gives an idea of what the third parameter's " -"value should contain" +msgid "It has no name, so **end vid** gives an idea of what the third parameter's value should contain" msgstr "" msgid "Is the fourth parameter." @@ -7737,9 +6696,7 @@ msgstr "" msgid "It has a name." msgstr "" -msgid "" -"The full description of the parameters are found on the `Parameters`_ " -"section of each function." +msgid "The full description of the parameters are found on the `Parameters`_ section of each function." msgstr "" msgid "Function's overloads" @@ -7772,9 +6729,7 @@ msgstr "" msgid "**Many**: ``ARRAY`` [**ANY-INTEGER**]" msgstr "" -msgid "" -"Depending of the function the overloads may vary. But the concept of " -"parameter type change remains the same." +msgid "Depending of the function the overloads may vary. But the concept of parameter type change remains the same." msgstr "" msgid "When routing from:" @@ -7807,11 +6762,7 @@ msgstr "" msgid "Needs a `Combinations SQL`_" msgstr "" -msgid "" -"There are several kinds of valid inner queries and also the columns returned " -"are depending of the function. Which kind of inner query will depend on the " -"function's requirements. To simplify the variety of types, **ANY-INTEGER** " -"and **ANY-NUMERICAL** is used." +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 "" msgid "Edges SQL for" @@ -7826,9 +6777,7 @@ msgstr "" msgid "General with (X,Y)" msgstr "" -msgid "" -"When negative: edge (``source``, ``target``) does not exist, therefore it's " -"not part of the graph." +msgid "When negative: edge (``source``, ``target``) does not exist, therefore it's not part of the graph." msgstr "" msgid "Weight of the edge (``target``, ``source``)," @@ -7873,20 +6822,13 @@ msgstr "" msgid "Points SQL for" msgstr "" -msgid "" -"The main parameter of the majority of the pgRouting functions is a query " -"that selects the edges of the graph." +msgid "The main parameter of the majority of the pgRouting functions is a query that selects the edges of the graph." msgstr "" -msgid "" -"Depending on the family or category of a function it will have additional " -"parameters, some of them are compulsory and some are optional." +msgid "Depending on the family or category of a function it will have additional parameters, some of them are compulsory and some are optional." msgstr "" -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." +msgid "The compulsory parameters are nameless and must be given in the required order. The optional parameters are named parameters and will have a default value." msgstr "" msgid "Parameters for the Via functions" @@ -7916,16 +6858,10 @@ msgstr "" msgid "``U_turn_on_edge``" msgstr "" -msgid "" -"When ``true`` departing from a visited vertex will not try to avoid using " -"the edge used to reach it. In other words, U turn using the edge with same " -"identifier is allowed." +msgid "When ``true`` departing from a visited vertex will not try to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is allowed." msgstr "" -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." +msgid "When ``false`` when a departing from a visited vertex tries to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is used when no other path is found." msgstr "" msgid "For the TRSP functions" @@ -7934,17 +6870,14 @@ msgstr "" msgid "Array of identifiers of destination vertices." msgstr "" -msgid "" -"There are several kinds of columns returned are depending of the function." +msgid "There are several kinds of columns returned are depending of the function." msgstr "" #, fuzzy msgid "Result columns for single path functions" msgstr "결과 컬럼" -msgid "" -"Used in functions that return one path solution per departure and " -"destination." +msgid "Used in functions that return one path solution per departure and destination." msgstr "" msgid ":doc:`pgr_dijkstraNear`" @@ -7956,8 +6889,7 @@ msgstr "" msgid "``path_seq``" msgstr "" -msgid "" -"Relative position in the path. Has value **1** for the beginning of a path." +msgid "Relative position in the path. Has value **1** for the beginning of a path." msgstr "" msgid "Identifier of the starting vertex of the current path." @@ -7969,28 +6901,20 @@ msgstr "" msgid "Identifier of the node in the path from ``start_vid`` to ``end_vid``." msgstr "" -msgid "" -"Identifier of the edge used to go from ``node`` to the next node in the path " -"sequence. **-1** for the last node of the path." +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 "" -msgid "" -"Cost to traverse from ``node`` using ``edge`` to the next node in the path " -"sequence." +msgid "Cost to traverse from ``node`` using ``edge`` to the next node in the path sequence." msgstr "" -msgid "" -"When ``start_vid`` or ``end_vid`` columns have negative values, the " -"identifier is for a Point." +msgid "When ``start_vid`` or ``end_vid`` columns have negative values, the identifier is for a Point." msgstr "" #, fuzzy msgid "Result columns for multiple paths functions" msgstr "결과 컬럼" -msgid "" -"Used in functions that return many paths solutions per departure and " -"destination." +msgid "Used in functions that return many paths solutions per departure and destination." msgstr "" #, fuzzy @@ -8010,8 +6934,7 @@ msgstr "" msgid "Path identifier." msgstr "" -msgid "" -"Has value **1** for the first of a path from ``start_vid`` to ``end_vid``." +msgid "Has value **1** for the first of a path from ``start_vid`` to ``end_vid``." msgstr "" msgid "Result columns for cost functions" @@ -8020,9 +6943,7 @@ msgstr "" msgid "Used by:" msgstr "" -msgid "" -"When start_vid or end_vid columns have negative values, the identifier is " -"for a Point." +msgid "When start_vid or end_vid columns have negative values, the identifier is for a Point." msgstr "" msgid "Result columns for flow functions" @@ -8050,13 +6971,10 @@ msgstr "" msgid "For the Routing functions" msgstr "" -msgid "" -"To get faster results bound the queries to an area of interest of routing." +msgid "To get faster results bound the queries to an area of interest of routing." msgstr "" -msgid "" -"In this example Use an inner query SQL that does not include some edges in " -"the routing function and is within the area of the results." +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 "" msgid "Given this area:" @@ -8071,33 +6989,25 @@ msgstr "" msgid "Wiki" msgstr "" -msgid "" -"Edit an existing `pgRouting Wiki `__ page." +msgid "Edit an existing `pgRouting Wiki `__ page." msgstr "" msgid "Or create a new Wiki page" msgstr "" -msgid "" -"Create a page on the `pgRouting Wiki `__" +msgid "Create a page on the `pgRouting Wiki `__" msgstr "" msgid "Give the title an appropriate name" msgstr "" -msgid "" -"`Example `__" +msgid "`Example `__" msgstr "" msgid "Adding Functionality to pgRouting" msgstr "" -msgid "" -"Consult the `developer's documentation `__" +msgid "Consult the `developer's documentation `__" msgstr "" msgid "See also" @@ -8106,17 +7016,10 @@ msgstr "" msgid "Installation" msgstr "설치" -msgid "" -"Instructions for downloading and installing binaries for different operating " -"systems, additional notes and corrections not included in this documentation " -"can be found in `Installation wiki `__" +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 "" -"To use pgRouting, PostGIS needs to be installed, please read the information " -"about installation in this `Install Guide `__" +msgid "To use pgRouting, PostGIS needs to be installed, please read the information about installation in this `Install Guide `__" msgstr "" msgid "Short Version" @@ -8128,25 +7031,19 @@ msgstr "tar ball 압축 해제" msgid "To compile assuming you have all the dependencies in your search path:" msgstr "" -msgid "" -"Once pgRouting is installed, it needs to be enabled in each individual " -"database you want to use it in." +msgid "Once pgRouting is installed, it needs to be enabled in each individual database you want to use it in." msgstr "" msgid "Get the sources" msgstr "소스 가져오기" -msgid "" -"The pgRouting latest release can be found in https://github.com/pgRouting/" -"pgrouting/releases/latest" +msgid "The pgRouting latest release can be found in https://github.com/pgRouting/pgrouting/releases/latest" msgstr "" msgid "To download this release:" msgstr "" -msgid "" -"Go to :ref:`install-short` for more instructions on extracting tar ball and " -"compiling pgRouting." +msgid "Go to :ref:`install-short` for more instructions on extracting tar ball and compiling pgRouting." msgstr "" msgid "git" @@ -8155,10 +7052,7 @@ msgstr "git" msgid "To download the repository" msgstr "" -msgid "" -"Go to :ref:`install-short` for more instructions on compiling pgRouting " -"(there is no tar ball involved while downloading pgRouting repository from " -"GitHub)." +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 "" msgid "Enabling and upgrading in the database" @@ -8167,27 +7061,19 @@ msgstr "데이터베이스에서 활성화 및 업그레이드 하기" msgid "Enabling the database" 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." +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 "" -msgid "" -"Checking PostGIS and pgRouting version after enabling them in the database." +msgid "Checking PostGIS and pgRouting version after enabling them in the database." msgstr "" msgid "Upgrading the database" msgstr "데이터베이스 업그레이드" -msgid "" -"To upgrade pgRouting in the database to version 4.0.0 use the following " -"command:" +msgid "To upgrade pgRouting in the database to version 4.1.0 use the following command:" msgstr "" -msgid "" -"More information can be found in https://www.postgresql.org/docs/current/sql-" -"createextension.html" +msgid "More information can be found in https://www.postgresql.org/docs/current/sql-createextension.html" msgstr "" msgid "Dependencies" @@ -8196,21 +7082,16 @@ msgstr "종속성" msgid "Compilation Dependencies" msgstr "컴파일 종속성" -msgid "" -"To be able to compile pgRouting, make sure that the following dependencies " -"are met:" +msgid "To be able to compile pgRouting, make sure that the following dependencies are met:" msgstr "pgRouting을 컴파일 하기 위해, 다음 종속성이 충족되는지 확인하세요:" msgid "C and C++0x compilers" msgstr "C 와 C++0x 컴파일러" -msgid "" -"Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with C++03 " -"or C++11 standard support" +msgid "Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with C++03 or C++11 standard support" msgstr "" -msgid "" -"Compiling with Boost 1.75 requires C++ Compiler with C++14 standard support" +msgid "Compiling with Boost 1.75 requires C++ Compiler with C++14 standard support" msgstr "" msgid "Postgresql version >= 13" @@ -8285,14 +7166,10 @@ msgstr "" msgid "Configuring The Documentation" msgstr "" -msgid "" -"User and developers documentation are not build if prerequisites are not " -"found." +msgid "User and developers documentation are not build if prerequisites are not found." msgstr "" -msgid "" -"Most of the effort of the documentation has been on the HTML files. Some " -"variables for building documentation:" +msgid "Most of the effort of the documentation has been on the HTML files. Some variables for building documentation:" msgstr "" msgid "Variable" @@ -8370,9 +7247,7 @@ msgstr "" msgid "The following instructions start from ``path/to/pgrouting/build``" msgstr "" -msgid "" -"We have tested on several platforms, For installing or reinstalling all the " -"steps are needed." +msgid "We have tested on several platforms, For installing or reinstalling all the steps are needed." msgstr "" msgid "Linux" @@ -8387,21 +7262,10 @@ msgstr "테스트" msgid "Currently there is no :code:`make test` and testing is done as follows" msgstr "" -msgid "" -"pgRouting is an extension of `PostGIS `__ and " -"`PostgreSQL `__ geospatial database and adds " -"routing and other network analysis functionality. A predecessor of pgRouting " -"– pgDijkstra, written by Sylvain Pasche from `Camptocamp `__, was later extended by Orkney and renamed to pgRouting. The project " -"is now supported and maintained by `Georepublic `__, `Paragon Corporation `__ and " -"a broad user community." +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 "" -msgid "" -"pgRouting is part of `OSGeo Community Projects `__ from the `OSGeo Foundation `__ and included on `OSGeoLive `__." +msgid "pgRouting is part of `OSGeo Community Projects `__ from the `OSGeo Foundation `__ and included on `OSGeoLive `__." msgstr "" msgid "Licensing" @@ -8416,34 +7280,25 @@ msgstr "**라이선스**" msgid "GNU General Public License v2.0 or later" msgstr "" -msgid "" -"Most features of pgRouting are available under `GNU General Public License " -"v2.0 or later `_." +msgid "Most features of pgRouting are available under `GNU General Public License v2.0 or later `_." msgstr "" msgid "Boost Software License - Version 1.0" msgstr "" -msgid "" -"Some Boost extensions are available under `Boost Software License - Version " -"1.0 `_." +msgid "Some Boost extensions are available under `Boost Software License - Version 1.0 `_." msgstr "" msgid "MIT-X License" msgstr "" -msgid "" -"Some code contributed by iMaptools.com is available under MIT-X license." +msgid "Some code contributed by iMaptools.com is available under MIT-X license." msgstr "" -msgid "" -"The pgRouting Manual is licensed under a `Creative Commons Attribution-Share " -"Alike 3.0 License `_." +msgid "The pgRouting Manual is licensed under a `Creative Commons Attribution-Share Alike 3.0 License `_." msgstr "" -msgid "" -"In general license information should be included in the header of each " -"source file." +msgid "In general license information should be included in the header of each source file." msgstr "" msgid "Contributors" @@ -8458,10 +7313,7 @@ msgstr "" msgid "Bipasha Gayary, Fan Wu, Regina Obe, Saloni kumari, Vicky Vergara" msgstr "" -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." +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 "" msgid "Translators (in alphabetical order)" @@ -8488,9 +7340,7 @@ msgstr "" msgid "Corporate Sponsors in this release (in alphabetical order)" msgstr "" -msgid "" -"These are corporate entities that have contributed developer time, hosting, " -"or direct monetary funding to the pgRouting project:" +msgid "These are corporate entities that have contributed developer time, hosting, or direct monetary funding to the pgRouting project:" msgstr "" msgid "`OSGeo `__" @@ -8514,20 +7364,7 @@ msgstr "" msgid "Individuals (in alphabetical order)" msgstr "" -msgid "" -"Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio " -"Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf " -"Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, " -"Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, " -"Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, " -"Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu " -"Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko " -"Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim " -"Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish " -"Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni " -"Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen " -"Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, " -"Vidhan Jain, Virginia Vergara, Yige Huang" +msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" msgstr "" msgid "Corporate Sponsors (in alphabetical order)" @@ -8572,14 +7409,10 @@ msgstr "" msgid "More Information" msgstr "" -msgid "" -"The latest software, documentation and news items are available at the " -"pgRouting web site https://pgrouting.org." +msgid "The latest software, documentation and news items are available at the pgRouting web site https://pgrouting.org." msgstr "" -msgid "" -"PostgreSQL database server at the PostgreSQL main site https://www." -"postgresql.org." +msgid "PostgreSQL database server at the PostgreSQL main site https://www.postgresql.org." msgstr "" msgid "PostGIS extension at the PostGIS project web site https://postgis.net." @@ -8647,9 +7480,7 @@ msgstr "" msgid "Official function." msgstr "" -msgid "" -"The K shortest path routing algorithm based on Yen's algorithm. \"K\" is the " -"number of shortest paths desired." +msgid "The K shortest path routing algorithm based on Yen's algorithm. \"K\" is the number of shortest paths desired." msgstr "" msgid "|Boost| Boost Graph Inside" @@ -8667,16 +7498,13 @@ msgstr "" msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vid**, **K**, [**options**])" msgstr "" -msgid "" -"pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" +msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" msgstr "" -msgid "" -"pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" +msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" msgstr "" -msgid "" -"pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" +msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" msgstr "" msgid "pgr_KSP(`Edges SQL`_, `Combinations SQL`_, **K**, [**options**])" @@ -8697,19 +7525,13 @@ msgstr "" msgid "Get 2 paths from :math:`6` to :math:`17` on a directed graph." msgstr "" -msgid "" -"Get 2 paths from vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a " -"directed graph." +msgid "Get 2 paths from vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph." msgstr "" -msgid "" -"Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a " -"directed graph." +msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph." msgstr "" -msgid "" -"Get 2 paths vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on " -"a directed graph." +msgid "Get 2 paths vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on a directed graph." msgstr "" msgid "Using a combinations table on an directed graph" @@ -8742,9 +7564,7 @@ msgstr "" msgid "When ``true`` all the calculated paths while processing are returned." msgstr "" -msgid "" -"Roughly, when the shortest path has ``N`` edges, the heap will contain about " -"than ``N * K`` paths for small value of ``K`` and ``K > 5``." +msgid "Roughly, when the shortest path has ``N`` edges, the heap will contain about than ``N * K`` paths for small value of ``K`` and ``K > 5``." msgstr "" msgid "Additional Examples" @@ -8759,9 +7579,7 @@ msgstr "" msgid "Get 2 paths using combinations table on an undirected graph" msgstr "" -msgid "" -"Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a " -"undirected graph." +msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a undirected graph." msgstr "" msgid "https://en.wikipedia.org/wiki/K_shortest_path_routing" @@ -8779,19 +7597,13 @@ msgstr "" msgid "Version 3.2.1" msgstr "" -msgid "" -"Metric Algorithm from `Boost library `__" +msgid "Metric Algorithm from `Boost library `__" msgstr "" msgid "Simulated Annealing Algorithm no longer supported" msgstr "" -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`" +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 "" msgid "Version 2.3.0" @@ -8804,9 +7616,7 @@ msgstr "" msgid "Negative costs are ignored." msgstr ":math:`0` 값은 무시됩니다" -msgid "" -"Can be Used with :doc:`costMatrix-category` functions preferably with " -"`directed => false`." +msgid "Can be Used with :doc:`costMatrix-category` functions preferably with `directed => false`." msgstr "" msgid "With ``directed => false``" @@ -8827,62 +7637,43 @@ msgstr "" msgid "When ``start_vid = 0 OR end_vid = 0``" msgstr "" -msgid "" -"The solutions generated are guaranteed to be *twice as long as the optimal " -"tour in the worst case*" +msgid "The solutions generated are guaranteed to be *twice as long as the optimal tour in the worst case*" msgstr "" msgid "When ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``" msgstr "" -msgid "" -"It is **not guaranteed** that the solution will be, in the worst case, twice " -"as long as the optimal tour, due to the fact that `end_vid` is forced to be " -"in a fixed position." +msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour, due to the fact that `end_vid` is forced to be in a fixed position." msgstr "" msgid "With ``directed => true``" msgstr "" -msgid "" -"It is **not guaranteed** that the solution will be, in the worst case, twice " -"as long as the optimal tour" +msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour" msgstr "" msgid "is directed" msgstr "" -msgid "" -"some (or all) traveling costs on edges might not obey the triangle " -"inequality." +msgid "some (or all) traveling costs on edges might not obey the triangle inequality." msgstr "" -msgid "" -"As an undirected graph is required, the directed graph is transformed as " -"follows:" +msgid "As an undirected graph is required, the directed graph is transformed as follows:" msgstr "" -msgid "" -"edges `(u, v)` and `(v, u)` is considered to be the same edge (denoted `(u, " -"v)`" +msgid "edges `(u, v)` and `(v, u)` is considered to be the same edge (denoted `(u, v)`" msgstr "" msgid "if ``agg_cost`` differs between one or more instances of edge `(u, v)`" 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)`" +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 "" -msgid "" -"Some (or all) traveling costs on edges will still might not obey the " -"triangle inequality." +msgid "Some (or all) traveling costs on edges will still might not obey the triangle inequality." msgstr "" -msgid "" -"When the data does not come from an undirected graph or its not fully " -"connected:" +msgid "When the data does not come from an undirected graph or its not fully connected:" msgstr "" msgid "Missing values will be calculated with dijkstra algorithm." @@ -8891,20 +7682,13 @@ msgstr "" msgid "When the graph has more than one component:" msgstr "" -msgid "" -"``start_vid`` or ``end_vid`` are defined and are on the same component: the " -"TSP tour will happen on that component." +msgid "``start_vid`` or ``end_vid`` are defined and are on the same component: the TSP tour will happen on that component." msgstr "" -msgid "" -"``start_vid`` or ``end_vid`` are defined and are not on the same component: " -"the TSP tour will propose a tour that has both components where connecting " -"costs are estimated." +msgid "``start_vid`` or ``end_vid`` are defined and are not on the same component: the TSP tour will propose a tour that has both components where connecting costs are estimated." msgstr "" -msgid "" -"``start_vid`` or ``end_vid`` are not defined: the starting point could be on " -"any component and will include data only from that component." +msgid "``start_vid`` or ``end_vid`` are not defined: the starting point could be on any component and will include data only from that component." msgstr "" msgid "One cycle attempt to remove crossing edges is done to the TSP results." @@ -8919,9 +7703,7 @@ msgstr "" msgid "Using :doc:`pgr_dijkstraCostMatrix` to generate the matrix information" msgstr "" -msgid "" -"**Line 4** Vertices :math:`\\{2, 4, 13, 14\\}` are not included because they " -"are not connected." +msgid "**Line 4** Vertices :math:`\\{2, 4, 13, 14\\}` are not included because they are not connected." msgstr "" msgid "`Matrix SQL`_ as described below" @@ -8948,9 +7730,7 @@ msgstr "" msgid "Identifier of the node/coordinate/point." msgstr "" -msgid "" -"Cost to traverse from the current ``node`` to the next ``node`` in the path " -"sequence." +msgid "Cost to traverse from the current ``node`` to the next ``node`` in the path sequence." msgstr "" msgid "``0`` for the last row in the tour sequence." @@ -8974,22 +7754,16 @@ msgstr "" msgid "To generate an asymmetric matrix:" msgstr "" -msgid "" -"**Line 4** The ``side`` information of ``pointsOfInterset`` is ignored by " -"not including it in the query" +msgid "**Line 4** The ``side`` information of ``pointsOfInterset`` is ignored by not including it in the query" msgstr "" msgid "**Line 6** Generating an asymmetric matrix with ``directed => true``" msgstr "" -msgid "" -":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered as " -"the ``agg_cost``" +msgid ":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered as the ``agg_cost``" msgstr "" -msgid "" -"The solution that can be larger than *twice as long as the optimal tour* " -"because:" +msgid "The solution that can be larger than *twice as long as the optimal tour* because:" msgstr "" msgid "Triangle inequality might not be satisfied." @@ -9001,14 +7775,10 @@ msgstr "" msgid "Connected incomplete data" msgstr "" -msgid "" -"Using selected edges :math:`\\{2, 4, 5, 8, 9, 15\\}` the matrix is not " -"complete." +msgid "Using selected edges :math:`\\{2, 4, 5, 8, 9, 15\\}` the matrix is not complete." msgstr "" -msgid "" -"Cost value for :math:`17 \\rightarrow 10` do not exist on the matrix, but " -"the value used is taken from :math:`10 \\rightarrow 17`." +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 "" msgid "``pgr_TSPeuclidean``" @@ -9017,9 +7787,7 @@ msgstr "" msgid "``pgr_TSPeuclidean`` - Approximation using *metric* algorithm." msgstr "" -msgid "" -"Using `Boost: metric TSP approx `__" +msgid "Using `Boost: metric TSP approx `__" msgstr "" msgid "Name change from pgr_eucledianTSP" @@ -9031,17 +7799,13 @@ msgstr "" msgid "Results change depending on input order of the `Coordinates SQL`_" msgstr "" -msgid "" -"Any duplicated identifier will be ignored. The coordinates that will be kept " -"is arbitrarily." +msgid "Any duplicated identifier will be ignored. The coordinates that will be kept is arbitrarily." msgstr "" -msgid "" -"The coordinates are quite similar for the same identifier, for example ::" +msgid "The coordinates are quite similar for the same identifier, for example ::" msgstr "" -msgid "" -"The coordinates are quite different for the same identifier, for example ::" +msgid "The coordinates are quite different for the same identifier, for example ::" msgstr "" msgid "pgr_TSPeuclidean(`Coordinates SQL`_, ``[start_id, end_id]``)" @@ -9074,11 +7838,7 @@ msgstr "" msgid "Test 29 cities of Western Sahara" msgstr "" -msgid "" -"This example shows how to make performance tests using University of " -"Waterloo's `example data `__ using the 29 cities of `Western Sahara dataset `__" +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 "" msgid "Creating a table for the data and storing the data" @@ -9090,9 +7850,7 @@ msgstr "" msgid "Total tour cost" msgstr "" -msgid "" -"Getting a total cost of the tour, compare the value with the length of an " -"optimal tour is 27603, given on the dataset" +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 "" msgid "Getting a geometry of the tour" @@ -9101,10 +7859,7 @@ msgstr "" msgid "Visual results" msgstr "" -msgid "" -"Visually, The first image is the `optimal solution `__ and the second image is the solution " -"obtained with ``pgr_TSPeuclidean``." +msgid "Visually, The first image is the `optimal solution `__ and the second image is the solution obtained with ``pgr_TSPeuclidean``." msgstr "" msgid "``pgr_aStar`` — Shortest path using the A* algorithm." @@ -9146,9 +7901,7 @@ msgstr ":doc:`pgr_withPointsCostMatrix`" msgid "Signature change on pgr_aStar(One to One)" msgstr "" -msgid "" -"The results are equivalent to the union of the results of the `pgr_aStar(` " -"`One to One`_ `)` on the:" +msgid "The results are equivalent to the union of the results of the `pgr_aStar(` `One to One`_ `)` on the:" msgstr "" msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" @@ -9175,28 +7928,19 @@ msgstr "" msgid "Optional parameters are `named parameters` and have a default value." msgstr "" -msgid "" -"From vertex :math:`6` to vertex :math:`12` on a **directed** graph with " -"heuristic :math:`2`" +msgid "From vertex :math:`6` to vertex :math:`12` on a **directed** graph with heuristic :math:`2`" msgstr "" -msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 12\\}` on a **directed** " -"graph with heuristic :math:`3` and factor :math:`3.5`" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 12\\}` on a **directed** graph with heuristic :math:`3` and factor :math:`3.5`" msgstr "" -msgid "" -"From vertices :math:`\\{6, 8\\}` to vertex :math:`10` on an **undirected** " -"graph with heuristic :math:`4`" +msgid "From vertices :math:`\\{6, 8\\}` to vertex :math:`10` on an **undirected** graph with heuristic :math:`4`" msgstr "" -msgid "" -"From vertices :math:`\\{6, 8\\}` to vertices :math:`\\{10, 12\\}` on a " -"**directed** graph with factor :math:`0.5`" +msgid "From vertices :math:`\\{6, 8\\}` to vertices :math:`\\{10, 12\\}` on a **directed** graph with factor :math:`0.5`" msgstr "" -msgid "" -"Using a combinations table on a **directed** graph with factor :math:`0.5`." +msgid "Using a combinations table on a **directed** graph with factor :math:`0.5`." msgstr "" msgid "Example 1" @@ -9222,8 +7966,7 @@ msgid "``pgr_aStarCost``" msgstr ":doc:`pgr_aStarCost`" #, fuzzy -msgid "" -"``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." +msgid "``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." msgstr ":doc:`pgr_aStarCost` - 최단 경로의 집계 비용 반환." msgid "pgr_aStarCost(Combinations)" @@ -9234,14 +7977,10 @@ msgid "New proposed function." msgstr ":doc:`routingFunctions`" #, fuzzy -msgid "" -"The ``pgr_aStarCost`` function summarizes the cost of the shortest path " -"using the A* algorithm." +msgid "The ``pgr_aStarCost`` function summarizes the cost of the shortest path using the A* algorithm." msgstr ":doc:`pgr_aStarCost` - 최단 경로의 집계 비용 반환." -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)`" +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 "" msgid "For undirected graphs, the results are symmetric." @@ -9265,8 +8004,7 @@ msgstr "" msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -msgid "" -"pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "" msgid "pgr_aStarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" @@ -9281,9 +8019,7 @@ msgstr "" msgid "``pgr_aStarCostMatrix``" msgstr "" -msgid "" -"``pgr_aStarCostMatrix`` - Calculates the a cost matrix using :doc:" -"`pgr_aStar`." +msgid "``pgr_aStarCostMatrix`` - Calculates the a cost matrix using :doc:`pgr_aStar`." msgstr "" msgid "Using internally the :doc:`pgr_aStar` algorithm" @@ -9316,9 +8052,7 @@ msgstr "" msgid "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" msgstr "" -msgid "" -"Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an " -"**undirected** graph using heuristic :math:`2`" +msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph using heuristic :math:`2`" msgstr "" msgid "Use with :doc:`pgr_TSP`" @@ -9327,9 +8061,7 @@ msgstr "" msgid "``pgr_articulationPoints``" msgstr "" -msgid "" -"``pgr_articulationPoints`` - Return the articulation points of an undirected " -"graph." +msgid "``pgr_articulationPoints`` - Return the articulation points of an undirected graph." msgstr "" msgid "Result columns change: ``seq`` is removed" @@ -9338,11 +8070,7 @@ msgstr "" msgid "Version 2.5.0" 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." +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 "Works for **undirected** graphs." @@ -9369,14 +8097,10 @@ msgstr "" msgid "Identifier of the vertex." msgstr "" -msgid "" -"`Boost: Biconnected components & articulation points `__" +msgid "`Boost: Biconnected components & articulation points `__" msgstr "" -msgid "" -"wikipedia: `Biconnected component `__" +msgid "wikipedia: `Biconnected component `__" msgstr "" #, fuzzy @@ -9386,14 +8110,10 @@ msgstr ":doc:`pgr_edwardMoore`" msgid "``pgr_bandwidth`` - Calculates the bandwidth of the graph" msgstr "" -msgid "" -"Bandwidth measures how \"spread out\" the connections are in a graph when " -"vertices are arranged in a linear order (like numbering them 1, 2, 3, etc.)." +msgid "Bandwidth measures how \"spread out\" the connections are in a graph when vertices are arranged in a linear order (like numbering them 1, 2, 3, etc.)." msgstr "" -msgid "" -"For each edge in the graph, calculate the distance between the vertex " -"numbers it connects" +msgid "For each edge in the graph, calculate the distance between the vertex numbers it connects" msgstr "" msgid "The bandwidth is the maximum of all these distances" @@ -9432,8 +8152,7 @@ msgstr "" msgid "Undirected graph with edges after optimization." msgstr "" -msgid "" -"`Boost: bandwidth `_" +msgid "`Boost: bandwidth `_" msgstr "" msgid "``pgr_bdAstar``" @@ -9469,9 +8188,7 @@ msgstr ":doc:`pgr_withPointsCostMatrix`" msgid "Signature change on pgr_bdAstar(One to One)" msgstr "" -msgid "" -"The results are equivalent to the union of the results of pgr_bdAStar(One to " -"One) on the:" +msgid "The results are equivalent to the union of the results of pgr_bdAStar(One to One) on the:" msgstr "" msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" @@ -9493,34 +8210,26 @@ msgstr "" msgid "``pgr_bdAstarCost``" msgstr ":doc:`pgr_bdAstarCost`" -msgid "" -"``pgr_bdAstarCost`` - Total cost of the shortest path using the " -"bidirectional A* algorithm." +msgid "``pgr_bdAstarCost`` - Total cost of the shortest path using the bidirectional A* algorithm." msgstr "" msgid "pgr_bdAstarCost(Combinations)" msgstr "" #, fuzzy -msgid "" -"The ``pgr_bdAstarCost`` function summarizes the cost of the shortest path " -"using the bidirectional A* algorithm." +msgid "The ``pgr_bdAstarCost`` function summarizes the cost of the shortest path using the bidirectional A* algorithm." msgstr ":doc:`pgr_aStarCost` - 최단 경로의 집계 비용 반환." -msgid "" -"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" msgstr "" -msgid "" -"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgstr "" -msgid "" -"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -msgid "" -"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "" msgid "pgr_bdAstarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" @@ -9530,9 +8239,7 @@ msgid "``pgr_bdAstarCostMatrix``" msgstr "" #, fuzzy -msgid "" -"``pgr_bdAstarCostMatrix`` - Calculates the cost matrix using :doc:" -"`pgr_bdAstar`." +msgid "``pgr_bdAstarCostMatrix`` - Calculates the cost matrix using :doc:`pgr_bdAstar`." msgstr ":doc:`pgr_aStarCostMatrix` - 최단 경로의 비용 행렬 반환." msgid "Internally uses the :doc:`pgr_bdAstar` algorithm." @@ -9542,9 +8249,7 @@ msgid "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" msgstr "" #, fuzzy -msgid "" -"``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra " -"algorithm." +msgid "``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra algorithm." msgstr ":doc:`pgr_bdDijkstra` - 최단 경로를 위한 양방향 다익스트라 알고리즘." msgid "pgr_bdDijkstra(Combinations)" @@ -9566,20 +8271,16 @@ msgstr ":doc:`pgr_withPointsCostMatrix`" msgid "Signature change on pgr_bdDijkstra(One to One)" msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "" -"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "" -"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" @@ -9588,18 +8289,13 @@ msgstr "" msgid "From vertex :math:`6` to vertex :math:`10` on a **directed** graph" msgstr "" -msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed** " -"graph" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed** graph" msgstr "" -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** graph" +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** graph" msgstr "" -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an " -"**undirected** graph" +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an **undirected** graph" msgstr "" msgid "Using a combinations table on an **undirected** graph" @@ -9611,38 +8307,26 @@ msgstr "" msgid "``pgr_bdDijkstraCost``" msgstr "" -msgid "" -"``pgr_bdDijkstraCost`` — Returns the shortest path's cost using " -"Bidirectional Dijkstra algorithm." +msgid "``pgr_bdDijkstraCost`` — Returns the shortest path's cost using Bidirectional Dijkstra algorithm." msgstr "" msgid "pgr_bdDijkstraCost(Combinations)" msgstr "" #, fuzzy -msgid "" -"The ``pgr_bdDijkstraCost`` function summarizes the cost of the shortest path " -"using the bidirectional Dijkstra Algorithm." -msgstr "" -":doc:`pgr_bdDijkstraCost` - 최단 경로의 비용을 계산하기 위한 양방향 다익스트" -"라 알고리즘" +msgid "The ``pgr_bdDijkstraCost`` function summarizes the cost of the shortest path using the bidirectional Dijkstra Algorithm." +msgstr ":doc:`pgr_bdDijkstraCost` - 최단 경로의 비용을 계산하기 위한 양방향 다익스트라 알고리즘" -msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" msgstr "" -msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , " -"[``directed``])" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , [``directed``])" msgstr "" -msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [ ``directed``])" @@ -9654,28 +8338,24 @@ msgstr "" msgid "``pgr_bdDijkstraCostMatrix``" msgstr "" -msgid "" -"``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using :doc:" -"`pgr_bdDijkstra`." +msgid "``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_bdDijkstra`." msgstr "" -msgid "" -"Using bidirectional Dijkstra algorithm, calculate and return a cost matrix." +msgid "Using bidirectional Dijkstra algorithm, calculate and return a cost matrix." msgstr "" msgid "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" msgstr "" -msgid "" -"Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an " -"**undirected** graph" +msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph" msgstr "" msgid "Use with :doc:`pgr_TSP`." msgstr "" -msgid "``pgr_bellmanFord - Experimental``" -msgstr "" +#, fuzzy +msgid "``pgr_bellmanFord`` - Experimental" +msgstr ":doc:`pgr_edwardMoore`" msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm." msgstr "" @@ -9683,90 +8363,59 @@ msgstr "" msgid "pgr_bellmanFord(Combinations)" msgstr "" -msgid "" -"Bellman-Ford's algorithm, is named after Richard Bellman and Lester Ford, " -"who first published it in 1958 and 1956, respectively.It is a graph search " -"algorithm that computes shortest paths from a starting vertex " -"(``start_vid``) to an ending vertex (``end_vid``) in a graph where some of " -"the edge weights may be negative. Though it is more versatile, it is slower " -"than Dijkstra's algorithm.This implementation can be used with a directed " -"graph and an undirected graph." +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 "" -msgid "" -"Process is valid for edges with both positive and negative edge weights." +msgid "Process is valid for edges with both positive and negative edge weights." msgstr "" -msgid "" -"When the start vertex and the end vertex are the same, there is no path. The " -"agg_cost would be :math:`0`." +msgid "When the start vertex and the end vertex are the same, there is no path. The agg_cost would be :math:`0`." msgstr "" -msgid "" -"When the start vertex and the end vertex are different, and there exists a " -"path between them without having a *negative cycle*. The agg_cost would be " -"some finite value denoting the shortest distance between them." +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 "" -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." +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 "" -msgid "" -"When the start vertex and the end vertex are different, and there is no " -"path. The agg_cost is :math:`\\infty`." +msgid "When the start vertex and the end vertex are different, and there is no path. The agg_cost is :math:`\\infty`." msgstr "" -msgid "" -"For optimization purposes, any duplicated value in the `start_vids` or " -"`end_vids` are ignored." +msgid "For optimization purposes, any duplicated value in the `start_vids` or `end_vids` are ignored." msgstr "" msgid "Running time: :math:`O(| start\\_vids | * ( V * E))`" msgstr "" -msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" msgid "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph" msgstr "" -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph" +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph" msgstr "" -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an " -"undirected graph" +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an undirected graph" msgstr "" #, fuzzy msgid "Using a combinations table on an undirected graph" msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." -msgid "" -"`Boost: Bellman Ford `__" +msgid "`Boost: Bellman Ford `__" msgstr "" msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" @@ -9775,29 +8424,19 @@ msgstr "" msgid "``pgr_betweennessCentrality`` - Experimental" msgstr "" -msgid "" -"``pgr_betweennessCentrality`` - Calculates the relative betweenness " -"centrality using Brandes Algorithm" +msgid "``pgr_betweennessCentrality`` - Calculates the relative betweenness centrality using Brandes Algorithm" msgstr "" msgid "Version 3.7.0" msgstr "" -msgid "" -"The Brandes Algorithm takes advantage of the sparse graphs for evaluating " -"the betweenness centrality score of all vertices." +msgid "The Brandes Algorithm takes advantage of the sparse graphs for evaluating the betweenness centrality score of all vertices." msgstr "" -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." +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 "" -"The removal of these vertices will affect the network by disrupting the it, " -"as most of the shortest paths between vertices pass through them." +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 "" #, fuzzy @@ -9831,9 +8470,7 @@ msgstr "" msgid "The leaf vertices have betweenness centrality :math:`0`." msgstr "" -msgid "" -"Betweenness centrality of vertex :math:`6` is higher than of vertex :math:" -"`10`." +msgid "Betweenness centrality of vertex :math:`6` is higher than of vertex :math:`10`." msgstr "" msgid "Removing vertex :math:`6` will create three graph components." @@ -9848,21 +8485,16 @@ msgstr "" msgid "``centrality``" msgstr "" -msgid "" -"Relative betweenness centrality score of the vertex (will be in range [0,1])" +msgid "Relative betweenness centrality score of the vertex (will be in range [0,1])" msgstr "" -msgid "" -"`Boost: betweenness centrality `_" +msgid "`Boost: betweenness centrality `_" msgstr "" msgid "``pgr_biconnectedComponents``" msgstr "" -msgid "" -"``pgr_biconnectedComponents`` — Biconnected components of an undirected " -"graph." +msgid "``pgr_biconnectedComponents`` — Biconnected components of an undirected graph." msgstr "" #, fuzzy @@ -9875,13 +8507,7 @@ msgstr "" msgid "``seq`` changed type to ``BIGINT``" msgstr "" -msgid "" -"The biconnected components of an undirected graph are the maximal subsets of " -"vertices such that the removal of a vertex from particular component will " -"not disconnect the component. Unlike connected components, vertices may " -"belong to multiple biconnected components. Vertices can be present in " -"multiple biconnected components, but each edge can only be contained in a " -"single biconnected component." +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 "" msgid "Components are described by edges." @@ -9917,103 +8543,61 @@ msgstr "" msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" msgstr "" -msgid "" -"``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary " -"graph." +msgid "``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary graph." msgstr "" -msgid "" -"Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-" -"negative integer, is termed as a 'binary graph'." +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 "" msgid "pgr_binaryBreadthFirstSearch(Combinations)" msgstr "" -msgid "" -"It is well-known that the shortest paths between a single source and all " -"other vertices can be found using Breadth First Search in :math:`O(|E|)` in " -"an unweighted graph, i.e. the distance is the minimal number of edges that " -"you need to traverse from the source to another vertex. We can interpret " -"such a graph also as a weighted graph, where every edge has the weight :math:" -"`1`. If not all edges in graph have the same weight, then we a more general " -"algorithm is needed, like Dijkstra's Algorithm which runs in :math:`O(|E|log|" -"V|)` time." +msgid "It is well-known that the shortest paths between a single source and all other vertices can be found using Breadth First Search in :math:`O(|E|)` in an unweighted graph, i.e. the distance is the minimal number of edges that you need to traverse from the source to another vertex. We can interpret such a graph also as a weighted graph, where every edge has the weight :math:`1`. If not all edges in graph have the same weight, then we a more general algorithm is needed, like Dijkstra's Algorithm which runs in :math:`O(|E|log|V|)` time." msgstr "" -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." +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 "" -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.)" +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 "" msgid "Running time: :math:`O(| start\\_vids | * |E|)`" msgstr "" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, " -"[``directed``])" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, " -"[``directed``])" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, " -"[``directed``])" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, " -"[``directed``])" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid "" -"**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :" -"math:`1``)" +msgid "**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :math:`1``)" msgstr "" -msgid "" -"`Boost: Breadth First Search `__" +msgid "`Boost: Breadth First Search `__" msgstr "" msgid "https://cp-algorithms.com/graph/01_bfs.html" msgstr "" -msgid "" -"https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" +msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" msgstr "" msgid "``pgr_bipartite`` - Experimental" msgstr "" -msgid "" -"``pgr_bipartite`` — Disjoint sets of vertices such that no two vertices " -"within the same set are adjacent." +msgid "``pgr_bipartite`` — Disjoint sets of vertices such that no two vertices within the same set are adjacent." msgstr "" -msgid "" -"A bipartite graph is a graph with two sets of vertices which are connected " -"to each other, but not within themselves. A bipartite graph is possible if " -"the graph coloring is possible using two colors such that vertices in a set " -"are colored with the same color." +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 "The algorithm works in undirected graph only." @@ -10022,10 +8606,7 @@ msgstr "" msgid "The returned values are not ordered." msgstr "" -msgid "" -"The algorithm checks graph is bipartite or not. If it is bipartite then it " -"returns the node along with two colors `0` and `1` which represents two " -"different sets." +msgid "The algorithm checks graph is bipartite or not. If it is bipartite then it returns the node along with two colors `0` and `1` which represents two different sets." msgstr "" msgid "If graph is not bipartite then algorithm returns empty set." @@ -10043,32 +8624,22 @@ msgstr "" msgid "The odd length cyclic graph can not be bipartite." msgstr "" -msgid "" -"The edge :math:`5 \\rightarrow 1` will make subgraph with vertices :math:" -"`\\{1, 3, 7, 6, 5\\}` an odd length cyclic graph, as the cycle has 5 " -"vertices." +msgid "The edge :math:`5 \\rightarrow 1` will make subgraph with vertices :math:`\\{1, 3, 7, 6, 5\\}` an odd length cyclic graph, as the cycle has 5 vertices." msgstr "" msgid "Edges in blue represent odd length cycle subgraph." msgstr "" -msgid "" -"`Boost: is_bipartite `__" +msgid "`Boost: is_bipartite `__" msgstr "" -msgid "" -"`Wikipedia: bipartite graph `__" +msgid "`Wikipedia: bipartite graph `__" msgstr "" msgid "``pgr_boykovKolmogorov``" 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." +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 "" msgid "pgr_boykovKolmogorov(Combinations)" @@ -10110,43 +8681,32 @@ msgstr "" msgid "From vertices :math:`\\{11, 3, 17\\}` to vertex :math:`12`" msgstr "" -msgid "" -"From vertices :math:`\\{11, 3, 17\\}` to vertices :math:`\\{5, 10, 12\\}`" +msgid "From vertices :math:`\\{11, 3, 17\\}` to vertices :math:`\\{5, 10, 12\\}`" msgstr "" -msgid "" -"Using a combinations table, equivalent to calculating result from vertices :" -"math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`." +msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`." msgstr "" -msgid "" -"`Boost: Boykov Kolmogorov max flow `__" +msgid "`Boost: Boykov Kolmogorov max flow `__" msgstr "" msgid "``pgr_breadthFirstSearch`` - Experimental" msgstr "" -msgid "" -"``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth " -"First Search algorithm." +msgid "``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth First Search algorithm." msgstr "" #, fuzzy msgid "Version 4.0.0:" msgstr "짧은 버전" -msgid "" -"Provides the Breadth First Search traversal order from a root vertex to a " -"particular depth." +msgid "Provides the Breadth First Search traversal order from a root vertex to a particular depth." msgstr "" msgid "The implementation will work on any type of graph." msgstr "" -msgid "" -"Provides the Breadth First Search traversal order from a source node to a " -"target depth level." +msgid "Provides the Breadth First Search traversal order from a source node to a target depth level." msgstr "" msgid "Running time: :math:`O(E + V)`" @@ -10161,14 +8721,10 @@ msgstr "" msgid "**options:** ``[max_depth, directed]``" msgstr "" -msgid "" -"From root vertex :math:`6` on a **directed** graph with edges in ascending " -"order of ``id``" +msgid "From root vertex :math:`6` on a **directed** graph with edges in ascending order of ``id``" msgstr "" -msgid "" -"From root vertices :math:`\\{12, 6\\}` on an **undirected** graph with " -"**depth** :math:`<= 2` and edges in ascending order of ``id``" +msgid "From root vertices :math:`\\{12, 6\\}` on an **undirected** graph with **depth** :math:`<= 2` and edges in ascending order of ``id``" msgstr "" msgid "DFS optional parameters" @@ -10183,9 +8739,7 @@ msgstr "" msgid "The resulting traversal is different." msgstr "" -msgid "" -"The left image shows the result with ascending order of ids and the right " -"image shows with descending order of the edge identifiers." +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 "" msgid "|ascending| |descending|" @@ -10197,9 +8751,7 @@ msgstr "" msgid "descending" msgstr "" -msgid "" -"`Wikipedia: Breadth First Search algorithm `__" +msgid "`Wikipedia: Breadth First Search algorithm `__" msgstr "" msgid "``pgr_bridges``" @@ -10208,10 +8760,7 @@ msgstr "" msgid "``pgr_bridges`` - Return the bridges of an undirected graph." 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." +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 "``edge`` ascending" @@ -10235,17 +8784,13 @@ msgstr "" msgid "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" msgstr "" -msgid "" -"`Boost: Connected components `__" +msgid "`Boost: Connected components `__" msgstr "" msgid "``pgr_chinesePostman`` - Experimental" msgstr "" -msgid "" -"``pgr_chinesePostman`` — Calculates the shortest circuit path which contains " -"every edge in a directed graph and starts and ends on the same vertex." +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 "" msgid "Returns ``EMPTY SET`` on a disconnected graph" @@ -10263,9 +8808,7 @@ msgstr "" msgid "Sequential value starting from ``1``" msgstr "" -msgid "" -"Identifier of the edge used to go from ``node`` to the next node in the path " -"sequence. ``-1`` for the last node of the path." +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 "" msgid "Aggregate cost from ``start_v`` to ``node``." @@ -10274,10 +8817,7 @@ msgstr "" msgid "``pgr_chinesePostmanCost`` - Experimental" msgstr "" -msgid "" -"``pgr_chinesePostmanCost`` — Calculates the minimum costs of a circuit path " -"which contains every edge in a directed graph and starts and ends on the " -"same vertex." +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 "" msgid "Return value when the graph if disconnected" @@ -10298,14 +8838,10 @@ msgstr "" msgid "``pgr_connectedComponents``" msgstr "" -msgid "" -"``pgr_connectedComponents`` — Connected components of an undirected graph " -"using a DFS-based approach." +msgid "``pgr_connectedComponents`` — Connected components of an undirected graph using a DFS-based approach." msgstr "" -msgid "" -"A connected component of an undirected graph is a set of vertices that are " -"all reachable from each other." +msgid "A connected component of an undirected graph is a set of vertices that are all reachable from each other." msgstr "" msgid "Components are described by vertices" @@ -10332,17 +8868,13 @@ msgstr "" msgid "Connecting disconnected components" msgstr "" -msgid "" -"wikipedia: `Connected component `__" +msgid "wikipedia: `Connected component `__" msgstr "" msgid "``pgr_contraction``" msgstr "" -msgid "" -"``pgr_contraction`` — Performs graph contraction and returns the contracted " -"vertices and edges." +msgid "``pgr_contraction`` — Performs graph contraction and returns the contracted vertices and edges." msgstr "" msgid "Version 3.8.0" @@ -10351,16 +8883,13 @@ msgstr "" msgid "New signature:" msgstr "" -msgid "" -"Previously compulsory parameter **Contraction order** is now optional with " -"name ``methods``." +msgid "Previously compulsory parameter **Contraction order** is now optional with name ``methods``." msgstr "" msgid "New name and order of optional parameters." msgstr "" -msgid "" -"Deprecated signature pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgid "Deprecated signature pgr_contraction(text,bigint[],integer,bigint[],boolean)" msgstr "" msgid "Name change from ``pgr_contractGraph``" @@ -10369,10 +8898,7 @@ msgstr "" msgid "Bug fixes" msgstr "" -msgid "" -"Contraction reduces the size of the graph by removing some of the vertices " -"and edges and, for example, might add edges that represent a sequence of " -"original edges decreasing the total time and space used in graph algorithms." +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 "" msgid "Does not return the full contracted graph." @@ -10399,9 +8925,7 @@ msgstr "" msgid "column ``id`` with negative numbers descending when its a new edge." msgstr "" -msgid "" -"Currently there are two types of contraction methods included in this " -"function:" +msgid "Currently there are two types of contraction methods included in this function:" msgstr "" msgid "Dead End Contraction. See :doc:`pgr_contractionDeadEnd`." @@ -10500,9 +9024,7 @@ msgstr "" msgid "Decreasing sequence starting from **-1**." msgstr "" -msgid "" -"Representing a pseudo `id` as is not incorporated in the set of original " -"edges." +msgid "Representing a pseudo `id` as is not incorporated in the set of original edges." msgstr "" msgid "``contracted_vertices``" @@ -10514,18 +9036,13 @@ msgstr "" msgid "When ``type`` = **'v'**: :math:`-1`" msgstr "" -msgid "" -"When ``type`` = **'e'**: Identifier of the source vertex of the current edge " -"(``source``, ``target``)." +msgid "When ``type`` = **'e'**: Identifier of the source vertex of the current edge (``source``, ``target``)." msgstr "" -msgid "" -"When ``type`` = **'e'**: Identifier of the target vertex of the current edge " -"(``source``, ``target``)." +msgid "When ``type`` = **'e'**: Identifier of the target vertex of the current edge (``source``, ``target``)." msgstr "" -msgid "" -"When ``type`` = **'e'**: Weight of the current edge (``source``, ``target``)." +msgid "When ``type`` = **'e'**: Weight of the current edge (``source``, ``target``)." msgstr "" msgid "Only dead end contraction" @@ -10537,11 +9054,7 @@ msgstr "" msgid "The cycle" msgstr "" -msgid "" -"Contracting a graph can be done with more than one operation. The order of " -"the operations affect the resulting contracted graph, after applying one " -"operation, the set of vertices that can be contracted by another operation " -"changes." +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 ``cycles`` times through the ``methods`` ." @@ -10550,9 +9063,7 @@ msgstr "" msgid "Contracting sample data" msgstr "" -msgid "" -"In this section, building and using a contracted graph will be shown by " -"example." +msgid "In this section, building and using a contracted graph will be shown by example." msgstr "" msgid "The :doc:`sampledata` for an undirected graph is used" @@ -10567,15 +9078,10 @@ msgstr "" msgid "The original graph:" msgstr "" -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." +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 "" -"Observe that vertices, for example, :math:`6` do not appear in the results " -"because it was not affected by the contraction algorithm." +msgid "Observe that vertices, for example, :math:`6` do not appear in the results because it was not affected by the contraction algorithm." msgstr "" msgid "After doing the dead end contraction operation:" @@ -10590,9 +9096,7 @@ msgstr "" msgid "Add additional columns" msgstr "" -msgid "" -"Adding extra columns to the edges and vertices tables. In this documentation " -"the following will be used:" +msgid "Adding extra columns to the edges and vertices tables. In this documentation the following will be used:" msgstr "" msgid "Column." @@ -10607,13 +9111,10 @@ msgstr "" msgid "On the vertex table" msgstr "" -msgid "" -"when ``true`` the vertex is contracted, its not part of the contracted graph." +msgid "when ``true`` the vertex is contracted, its not part of the contracted graph." msgstr "" -msgid "" -"when ``false`` the vertex is not contracted, its part of the contracted " -"graph." +msgid "when ``false`` the vertex is not contracted, its part of the contracted graph." msgstr "" msgid "``is_new``" @@ -10622,14 +9123,10 @@ msgstr "" msgid "On the edge table" msgstr "" -msgid "" -"when ``true`` the edge was generated by the contraction algorithm. its part " -"of the contracted graph." +msgid "when ``true`` the edge was generated by the contraction algorithm. its part of the contracted graph." msgstr "" -msgid "" -"when ``false`` the edge is an original edge, might be or not part of the " -"contracted graph." +msgid "when ``false`` the edge is an original edge, might be or not part of the contracted graph." msgstr "" msgid "Store contraction information" @@ -10641,13 +9138,10 @@ msgstr "" msgid "Update the edges and vertices tables" msgstr "" -msgid "" -"Use ``is_contracted`` column to indicate the vertices that are contracted." +msgid "Use ``is_contracted`` column to indicate the vertices that are contracted." msgstr "" -msgid "" -"Fill ``contracted_vertices`` with the information from the results that " -"belong to the vertices." +msgid "Fill ``contracted_vertices`` with the information from the results that belong to the vertices." msgstr "" msgid "Insert the new edges generated by pgr_contraction." @@ -10668,16 +9162,10 @@ msgstr "" msgid "Using the contracted graph" msgstr "" -msgid "" -"Depending on the final application the graph is to be prepared. In this " -"example the final application will be to calculate the cost from two " -"vertices in the original graph by using the contracted graph with " -"``pgr_dijkstraCost``" +msgid "Depending on the final application the graph is to be prepared. In this example the final application will be to calculate the cost from two vertices in the original graph by using the contracted graph with ``pgr_dijkstraCost``" msgstr "" -msgid "" -"There are three cases when calculating the shortest path between a given " -"source and target in a contracted graph:" +msgid "There are three cases when calculating the shortest path between a given source and target in a contracted graph:" msgstr "" msgid "Case 1: Both source and target belong to the contracted graph." @@ -10698,21 +9186,17 @@ msgstr "" msgid "Create the function that will use the contracted graph." msgstr "" -msgid "" -"Case 2: Source and/or target belong to an edge that has contracted vertices." +msgid "Case 2: Source and/or target belong to an edge that has contracted vertices." msgstr "" -msgid "" -"Case 3: Source and/or target belong to a vertex that has been contracted." +msgid "Case 3: Source and/or target belong to a vertex that has been contracted." msgstr "" #, fuzzy msgid "``pgr_contractionDeadEnd`` - Proposed" msgstr ":doc:`pgr_extractVertices`" -msgid "" -"``pgr_contractionDeadEnd`` — Performs graph contraction and returns the " -"contracted vertices and edges." +msgid "``pgr_contractionDeadEnd`` — Performs graph contraction and returns the contracted vertices and edges." msgstr "" msgid "A node is considered a dead end node when:" @@ -10730,8 +9214,7 @@ msgstr "" msgid "When there is only one adjacent vertex or" msgstr "" -msgid "" -"When all edges are incoming regardless of the number of adjacent vertices." +msgid "When all edges are incoming regardless of the number of adjacent vertices." msgstr "" msgid "pgr_contractionDeadEnd(`Edges SQL`_, [**options**])" @@ -10783,8 +9266,7 @@ msgstr "" msgid "The green nodes are dead end nodes" msgstr "" -msgid "" -"The blue nodes have an unlimited number of incoming and/or outgoing edges." +msgid "The blue nodes have an unlimited number of incoming and/or outgoing edges." msgstr "" msgid "Node" @@ -10853,37 +9335,25 @@ msgstr "" msgid "Many adjacent nodes." msgstr "" -msgid "" -"Has more than one adjacent node and some edges are incoming and some are " -"outgoing." +msgid "Has more than one adjacent node and some edges are incoming and some are outgoing." msgstr "" -msgid "" -"From above, nodes :math:`\\{6, 7, 9\\}` are dead ends because the total " -"number of adjacent vertices is one." +msgid "From above, nodes :math:`\\{6, 7, 9\\}` are dead ends because the total number of adjacent vertices is one." msgstr "" -msgid "" -"When there are more than one adjacent vertex, all edges need to be all " -"incoming edges otherwise it is not a dead end." +msgid "When there are more than one adjacent vertex, all edges need to be all incoming edges otherwise it is not a dead end." msgstr "" msgid "Step by step dead end contraction" msgstr "" -msgid "" -"The dead end contraction will stop until there are no more dead end nodes. " -"For example, from the following graph where :math:`3` is the dead end node:" +msgid "The dead end contraction will stop until there are no more dead end nodes. For example, from the following graph where :math:`3` is the dead end node:" msgstr "" -msgid "" -"After contracting :math:`3`, node :math:`2` is now a dead end node and is " -"contracted:" +msgid "After contracting :math:`3`, node :math:`2` is now a dead end node and is contracted:" msgstr "" -msgid "" -"After contracting :math:`2`, stop. Node :math:`1` has the information of " -"nodes that were contracted." +msgid "After contracting :math:`2`, stop. Node :math:`1` has the information of nodes that were contracted." msgstr "" msgid "Creating the contracted graph" @@ -10914,74 +9384,34 @@ msgstr "" msgid "``pgr_contractionHierarchies`` - Experimental" msgstr ":doc:`pgr_stoerWagner`" -msgid "" -"``pgr_contractionHierarchies`` — Performs graph contraction according to the " -"contraction hierarchies method and returns the contracted vertices and " -"shortcut edges created." +msgid "``pgr_contractionHierarchies`` — Performs graph contraction according to the contraction hierarchies method and returns the contracted vertices and shortcut edges created." msgstr "" -msgid "" -"The contraction hierarchies method builds, from an initial order of the " -"vertices, a hierarchical order, giving priority to some vertices during the " -"processing of label fixing of shortest paths algorithms. Furthermore, the " -"contraction hierarchies algorithm adds shortcut edges in the graph, that " -"helps the shortest paths algorithm to follow the created hierarchical graph " -"structure." +msgid "The contraction hierarchies method builds, from an initial order of the vertices, a hierarchical order, giving priority to some vertices during the processing of label fixing of shortest paths algorithms. Furthermore, the contraction hierarchies algorithm adds shortcut edges in the graph, that helps the shortest paths algorithm to follow the created hierarchical graph structure." msgstr "" -msgid "" -"The idea of the hierarchy is to put at a high priority level vertices that " -"belong to the long distance network (highways for example in a road network) " -"and to a low level of priority nodes that belong to the short distance " -"network (arterials or secondary roads for example in road networks)." +msgid "The idea of the hierarchy is to put at a high priority level vertices that belong to the long distance network (highways for example in a road network) and to a low level of priority nodes that belong to the short distance network (arterials or secondary roads for example in road networks)." msgstr "" -msgid "" -"The contraction hierarchies algorithm makes the assumption that there is " -"already a valuable vertices order that is used to initialize the contraction " -"process. As in most cases there is no valuable initial node ordering, we use " -"the order given by vertices ID. Then, the contraction process is made on the " -"basis of this first order to give the final hierarchy." +msgid "The contraction hierarchies algorithm makes the assumption that there is already a valuable vertices order that is used to initialize the contraction process. As in most cases there is no valuable initial node ordering, we use the order given by vertices ID. Then, the contraction process is made on the basis of this first order to give the final hierarchy." msgstr "" -msgid "" -"The basic idea is to keep the vertices in a priority queue sorted by some " -"estimate of how attractive is their contraction. The implemented case uses " -"the metric called *edge difference*, which corresponds to the difference " -"between the number of shortcuts produced by a vertex contraction and the " -"number of incident edges in the graph before contraction (``#shortcuts - " -"#incident edges``)." +msgid "The basic idea is to keep the vertices in a priority queue sorted by some estimate of how attractive is their contraction. The implemented case uses the metric called *edge difference*, which corresponds to the difference between the number of shortcuts produced by a vertex contraction and the number of incident edges in the graph before contraction (``#shortcuts - #incident edges``)." msgstr "" -msgid "" -"Finally, the aim is to reduce the explored part of the graph, when using a " -"bidirectional Dijkstra-like algorithm. The vertices order is used to feed " -"the oriented search. The search is made without losing optimality." +msgid "Finally, the aim is to reduce the explored part of the graph, when using a bidirectional Dijkstra-like algorithm. The vertices order is used to feed the oriented search. The search is made without losing optimality." msgstr "" -msgid "" -"Finding an optimal vertices ordering for contraction is a difficult problem. " -"Nevertheless, very simple local heuristics work quite well, according to " -"Geisberger et al. [2]. The principle here is to a priori estimate the value " -"of the *edge difference* and to contract the node at the top of the queue " -"only if the new value of the metric keeps it at the top of the queue. " -"Otherwise, it is reinserted in the queue, at its right place corresponding " -"to the new metric value." +msgid "Finding an optimal vertices ordering for contraction is a difficult problem. Nevertheless, very simple local heuristics work quite well, according to Geisberger et al. [2]. The principle here is to a priori estimate the value of the *edge difference* and to contract the node at the top of the queue only if the new value of the metric keeps it at the top of the queue. Otherwise, it is reinserted in the queue, at its right place corresponding to the new metric value." msgstr "" msgid "The process is done on graphs having only edges with positive costs." msgstr "" -msgid "" -"It is necessary to remember that there are no deleted vertices with this " -"function. At the end, the graph keeps every vertex it had, but has some " -"added edges, corresponding to shortcuts. The vertices which have been " -"contracted, to build the shortcut edges, are kept and hierarchically ordered." +msgid "It is necessary to remember that there are no deleted vertices with this function. At the end, the graph keeps every vertex it had, but has some added edges, corresponding to shortcuts. The vertices which have been contracted, to build the shortcut edges, are kept and hierarchically ordered." msgstr "" -msgid "" -"As for the other contraction methods, it does not return the full contracted " -"graph, only the changes. They are here of two types:" +msgid "As for the other contraction methods, it does not return the full contracted graph, only the changes. They are here of two types:" msgstr "" msgid "added shortcut edges, with negative identifiers;" @@ -10990,8 +9420,7 @@ msgstr "" msgid "contracted nodes with an order." msgstr "" -msgid "" -"The ``pgr_contractionHierarchies`` function has the following signature:" +msgid "The ``pgr_contractionHierarchies`` function has the following signature:" msgstr "" msgid "pgr_contractionHierarchies(`Edges SQL`_, [**options**])" @@ -11006,9 +9435,7 @@ msgstr "" msgid "True if the graph is directed, False otherwise." msgstr "" -msgid "" -"The function returns many rows (one per vertex and one per shortcut edge " -"created). The columns of the rows are:" +msgid "The function returns many rows (one per vertex and one per shortcut edge created). The columns of the rows are:" msgstr "" msgid "Type of the ``id``." @@ -11030,40 +9457,25 @@ msgstr "" msgid "On an undirected graph" msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." -msgid "" -"The following query shows the original data involved in the contraction " -"operation on an undirected graph." +msgid "The following query shows the original data involved in the contraction operation on an undirected graph." msgstr "" msgid "building contraction hierarchies on the whole graph" msgstr "" -msgid "" -"The results do not represent the contracted graph. They represent the " -"changes done to the graph after applying the contraction algorithm and give " -"the vertex order built by the algorithm, by ordering vertices according to " -"the *edge difference* metric. As a consequence, vertices are all represented " -"in the result (except of course forbidden ones). Only shortcut built by the " -"algorithm are represented in the result." +msgid "The results do not represent the contracted graph. They represent the changes done to the graph after applying the contraction algorithm and give the vertex order built by the algorithm, by ordering vertices according to the *edge difference* metric. As a consequence, vertices are all represented in the result (except of course forbidden ones). Only shortcut built by the algorithm are represented in the result." msgstr "" -msgid "" -"After computing the contraction hierarchies, an order is now given to the " -"vertices," +msgid "After computing the contraction hierarchies, an order is now given to the vertices," msgstr "" -msgid "" -"in order to be used with a specific Dijkstra algorithm (implementation " -"coming in a future version), which speeds up the search." +msgid "in order to be used with a specific Dijkstra algorithm (implementation coming in a future version), which speeds up the search." msgstr "" msgid "We obtain the contracted graph above:" msgstr "" -msgid "" -"We can see without surprise that the vertices belonging to the shortcuts " -"have a tendency to have a high priority level in the resulting vertices " -"order." +msgid "We can see without surprise that the vertices belonging to the shortcuts have a tendency to have a high priority level in the resulting vertices order." msgstr "" msgid "On an undirected graph with forbidden vertices" @@ -11078,24 +9490,13 @@ msgstr "" msgid "Shortcut building process" msgstr "" -msgid "" -"A vertex ``v`` is contracted by adding shortcuts replacing former paths of " -"the form ``(u, v, w)`` by an edge ``(u, w)``. The shortcut ``(u, w)`` is " -"only needed when ``(u, v, w)`` is the only shortest path between ``u`` and " -"``w``." +msgid "A vertex ``v`` is contracted by adding shortcuts replacing former paths of the form ``(u, v, w)`` by an edge ``(u, w)``. The shortcut ``(u, w)`` is only needed when ``(u, v, w)`` is the only shortest path between ``u`` and ``w``." msgstr "" -msgid "" -"When all shortcuts have been added for a given vertex ``v``, the incident " -"edges of ``v`` are removed and another vertex is contracted with the " -"remaining graph." +msgid "When all shortcuts have been added for a given vertex ``v``, the incident edges of ``v`` are removed and another vertex is contracted with the remaining graph." msgstr "" -msgid "" -"The procedure is destructive for the graph and a copy is made to be able to " -"manipulate it again as a whole. The contraction process adds all discovered " -"shortcuts to the edge set ``E`` and attributes a metric to each contracted " -"vertex. This metric is giving what is called the *contraction hierarchy*." +msgid "The procedure is destructive for the graph and a copy is made to be able to manipulate it again as a whole. The contraction process adds all discovered shortcuts to the edge set ``E`` and attributes a metric to each contracted vertex. This metric is giving what is called the *contraction hierarchy*." msgstr "" msgid "Initialize the queue with a first vertices order" @@ -11147,51 +9548,28 @@ msgstr ":math:`G(V,E)`" msgid "Adjacent edges are removed." msgstr "" -msgid "" -"Shortcuts are built from predecessors of ``v`` to successors of ``v`` if and " -"only if the path through ``v`` corresponds to the only shortest path between " -"the predecessor and the successor of ``v`` in the graph. The *edge " -"difference* metric here takes the value of -2." +msgid "Shortcuts are built from predecessors of ``v`` to successors of ``v`` if and only if the path through ``v`` corresponds to the only shortest path between the predecessor and the successor of ``v`` in the graph. The *edge difference* metric here takes the value of -2." msgstr "" -msgid "" -"Then the following vertex is contracted. The process goes on until each node " -"of the graph has been contracted. At the end, there are no more edges in the " -"graph, which has been destroyed by the process." +msgid "Then the following vertex is contracted. The process goes on until each node of the graph has been contracted. At the end, there are no more edges in the graph, which has been destroyed by the process." msgstr "" -msgid "" -"This first contraction will give a vertices order, given by ordering them in " -"ascending order on the metric (edge difference). A total vertices order is " -"built. If ``u < v``, then ``u`` is less important than ``v``. The algorithm " -"keeps the vertices into a queue in this order." +msgid "This first contraction will give a vertices order, given by ordering them in ascending order on the metric (edge difference). A total vertices order is built. If ``u < v``, then ``u`` is less important than ``v``. The algorithm keeps the vertices into a queue in this order." msgstr "" -msgid "" -"A hierarchy will now be constructed by contracting again the vertices in " -"this order." +msgid "A hierarchy will now be constructed by contracting again the vertices in this order." msgstr "" msgid "Build the final vertex order" msgstr "" -msgid "" -"Once the first order built, the algorithm uses it to browse the graph once " -"again. For each vertex taken in the queue, the algorithm simulates " -"contraction and calculates its edge difference. If the computed value is " -"greater than the one of the next vertex to be contracted, then the algorithm " -"puts it back in the queue (heuristic approach). Otherwise it contracts it " -"permanently." +msgid "Once the first order built, the algorithm uses it to browse the graph once again. For each vertex taken in the queue, the algorithm simulates contraction and calculates its edge difference. If the computed value is greater than the one of the next vertex to be contracted, then the algorithm puts it back in the queue (heuristic approach). Otherwise it contracts it permanently." msgstr "" msgid "Add shortcuts to the initial graph" msgstr "" -msgid "" -"At the end, the algorithm takes the initial graph (before edges deletions) " -"and adds the shortcut edges to it. It gives you the contracted graph, ready " -"to use with a specialized Dijkstra algorithm, which takes into account the " -"order of the nodes in the hierarchy." +msgid "At the end, the algorithm takes the initial graph (before edges deletions) and adds the shortcut edges to it. It gives you the contracted graph, ready to use with a specialized Dijkstra algorithm, which takes into account the order of the nodes in the hierarchy." msgstr "" #, fuzzy @@ -11205,8 +9583,7 @@ msgstr "소개" msgid "Add shortcuts and hierarchy in the existing tables" msgstr "" -msgid "" -"Add new columns in the `vertices` and `edges` tables to store the results:" +msgid "Add new columns in the `vertices` and `edges` tables to store the results:" msgstr "" msgid "Update and insert the results in the two tables." @@ -11215,18 +9592,14 @@ msgstr "" msgid "Use a Dijkstra shortest path algorithm on it" msgstr "" -msgid "" -"Then you can use any Dijkstra-like algorithm, waiting for the adapted one " -"which will take into account the built vertices hierarchy. For example:" +msgid "Then you can use any Dijkstra-like algorithm, waiting for the adapted one which will take into account the built vertices hierarchy. For example:" msgstr "" #, fuzzy msgid "``pgr_contractionLinear`` - Proposed" msgstr ":doc:`pgr_extractVertices`" -msgid "" -"``pgr_contractionLinear`` — Performs graph contraction and returns the " -"contracted vertices and edges." +msgid "``pgr_contractionLinear`` — Performs graph contraction and returns the contracted vertices and edges." msgstr "" msgid "pgr_contractionLinear(`Edges SQL`_, [**options**])" @@ -11236,9 +9609,7 @@ msgstr "" msgid "Linear contraction on an undirected graph." msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." -msgid "" -"The green nodes are linear nodes and will not be part of the contracted " -"graph." +msgid "The green nodes are linear nodes and will not be part of the contracted graph." msgstr "" msgid "All edges adjacent will not be part of the contracted graph." @@ -11250,9 +9621,7 @@ msgstr "" msgid "**contraction Order**" msgstr "" -msgid "" -"Number of times the contraction operations on ``contraction_order`` will be " -"performed." +msgid "Number of times the contraction operations on ``contraction_order`` will be performed." msgstr "" msgid "A node connects two (or more) `linear` edges when" @@ -11273,14 +9642,10 @@ msgstr "" msgid "Graph where linearity is not symmetrical." msgstr "" -msgid "" -"When the graph is processed as a directed graph, linearity is not " -"symmetrical, therefore the graph can not be contracted." +msgid "When the graph is processed as a directed graph, linearity is not symmetrical, therefore the graph can not be contracted." msgstr "" -msgid "" -"When the same graph is processed as an undirected graph, linearity is " -"symmetrical, therefore the graph can be contracted." +msgid "When the same graph is processed as an undirected graph, linearity is symmetrical, therefore the graph can be contracted." msgstr "" msgid "The three edges can be replaced by one undirected edge" @@ -11316,9 +9681,7 @@ msgstr "" msgid "Step by step linear contraction" msgstr "" -msgid "" -"The linear contraction will stop when there are no more linear edges. For " -"example from the following graph there are linear edges" +msgid "The linear contraction will stop when there are no more linear edges. For example from the following graph there are linear edges" msgstr "" msgid "Contracting vertex :math:`3`," @@ -11327,13 +9690,10 @@ msgstr "" msgid "The vertex :math:`3` is removed from the graph" msgstr "" -msgid "" -"The edges :math:`2 \\rightarrow 3` and :math:`w \\rightarrow z` are removed " -"from the graph." +msgid "The edges :math:`2 \\rightarrow 3` and :math:`w \\rightarrow z` are removed from the graph." msgstr "" -msgid "" -"A new edge :math:`2 \\rightarrow 4` is inserted represented with red color." +msgid "A new edge :math:`2 \\rightarrow 4` is inserted represented with red color." msgstr "" msgid "Contracting vertex :math:`2`:" @@ -11342,18 +9702,13 @@ msgstr "" msgid "The vertex :math:`2` is removed from the graph" msgstr "" -msgid "" -"The edges :math:`1 \\rightarrow 2` and :math:`2 \\rightarrow 3` are removed " -"from the graph." +msgid "The edges :math:`1 \\rightarrow 2` and :math:`2 \\rightarrow 3` are removed from the graph." msgstr "" -msgid "" -"A new edge :math:`1 \\rightarrow 3` is inserted represented with red color." +msgid "A new edge :math:`1 \\rightarrow 3` is inserted represented with red color." msgstr "" -msgid "" -"Edge :math:`1 \\rightarrow 3` has the information of cost and the nodes that " -"were contracted." +msgid "Edge :math:`1 \\rightarrow 3` has the information of cost and the nodes that were contracted." msgstr "" msgid "Create the contracted graph." @@ -11362,32 +9717,22 @@ msgstr "" msgid "``pgr_cuthillMckeeOrdering`` - Experimental" msgstr "" -msgid "" -"``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of " -"an undirected graphs" +msgid "``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of an undirected graphs" msgstr "" msgid "Version 3.4.0" msgstr "" -msgid "" -"In numerical linear algebra, the Cuthill-McKee algorithm (CM), named after " -"Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse " -"matrix that has a symmetric sparsity pattern into a band matrix form with a " -"small bandwidth." +msgid "In numerical linear algebra, the Cuthill-McKee algorithm (CM), named after Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse matrix that has a symmetric sparsity pattern into a band matrix form with a small bandwidth." msgstr "" -msgid "" -"The vertices are basically assigned a breadth-first search order, except " -"that at each step, the adjacent vertices are placed in the queue in order of " -"increasing degree." +msgid "The vertices are basically assigned a breadth-first search order, except that at each step, the adjacent vertices are placed in the queue in order of increasing degree." msgstr "" msgid "The implementation is for **undirected** graphs." msgstr "" -msgid "" -"The bandwidth minimization problems are considered NP-complete problems." +msgid "The bandwidth minimization problems are considered NP-complete problems." msgstr "" msgid "The running time complexity is: :math:`O(m log(m)|V|)`" @@ -11417,50 +9762,32 @@ msgstr "" msgid "New ordering in reverse order." msgstr "" -msgid "" -"`Boost: Cuthill-McKee Ordering `__" +msgid "`Boost: Cuthill-McKee Ordering `__" msgstr "" -msgid "" -"`Wikipedia: Cuthill-McKee Ordering `__" +msgid "`Wikipedia: Cuthill-McKee Ordering `__" msgstr "" #, fuzzy msgid "``pgr_dagShortestPath`` - Experimental" msgstr ":doc:`pgr_dagShortestPath`" -msgid "" -"``pgr_dagShortestPath`` — Returns the shortest path for weighted directed " -"acyclic graphs(DAG). In particular, the DAG shortest paths algorithm " -"implemented by Boost.Graph." +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 "" msgid "pgr_dagShortestPath(Combinations)" msgstr "" -msgid "" -"Shortest Path for Directed Acyclic Graph(DAG) is a graph search algorithm " -"that solves the shortest path problem for weighted directed acyclic graph, " -"producing a shortest path from a starting vertex (``start_vid``) to an " -"ending vertex (``end_vid``)." +msgid "Shortest Path for Directed Acyclic Graph(DAG) is a graph search algorithm that solves the shortest path problem for weighted directed acyclic graph, producing a shortest path from a starting vertex (``start_vid``) to an ending vertex (``end_vid``)." msgstr "" -msgid "" -"This implementation can only be used with a **directed** graph with no " -"cycles i.e. directed acyclic graph." +msgid "This implementation can only be used with a **directed** graph with no cycles i.e. directed acyclic graph." msgstr "" -msgid "" -"The algorithm relies on topological sorting the dag to impose a linear " -"ordering on the vertices, and thus is more efficient for DAG's than either " -"the Dijkstra or Bellman-Ford algorithm." +msgid "The algorithm relies on topological sorting the dag to impose a linear ordering on the vertices, and thus is more efficient for DAG's than either the Dijkstra or Bellman-Ford algorithm." msgstr "" -msgid "" -"Process is valid for weighted directed acyclic graphs only. otherwise it " -"will throw warnings." +msgid "Process is valid for weighted directed acyclic graphs only. otherwise it will throw warnings." msgstr "" msgid "The `agg_cost` the non included values `(v, v)` is `0`" @@ -11496,9 +9823,7 @@ msgstr "" msgid "From vertices :math:`\\{5, 10\\}` to vertex :math:`11`" msgstr "" -msgid "" -"From vertices :math:`\\{5, 15\\}` to vertices :math:`\\{11, 17\\}` on an " -"**undirected** graph" +msgid "From vertices :math:`\\{5, 15\\}` to vertices :math:`\\{11, 17\\}` on an **undirected** graph" msgstr "" #, fuzzy @@ -11508,9 +9833,7 @@ msgstr "결과 컬럼" msgid "Making **start_vids** the same as **end_vids**" msgstr "" -msgid "" -"`Boost: DAG shortest paths `__" +msgid "`Boost: DAG shortest paths `__" msgstr "" msgid "https://en.wikipedia.org/wiki/Topological_sorting" @@ -11520,9 +9843,7 @@ msgstr "" msgid "``pgr_degree``" msgstr ":doc:`pgr_analyzeGraph`" -msgid "" -"``pgr_degree`` — For each vertex in an undirected graph, return the count of " -"edges incident to the vertex." +msgid "``pgr_degree`` — For each vertex in an undirected graph, return the count of edges incident to the vertex." msgstr "" msgid "Error messages adjustment." @@ -11534,9 +9855,7 @@ msgstr "" msgid "Calculates the degree of the vertices of an undirected graph" msgstr "" -msgid "" -"The degree (or valency) of a vertex of a graph is the number of edges that " -"are incident to the vertex." +msgid "The degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex." msgstr "" msgid "A loop contributes 2 to a vertex's degree." @@ -11548,18 +9867,13 @@ msgstr "" msgid "Isolated vertex is not part of the result" msgstr "" -msgid "" -"Vertex not participating on the subgraph is considered and isolated vertex." +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``." +msgid "There can be a ``dryrun`` execution and the code used to get the answer will be shown in a PostgreSQL ``NOTICE``." msgstr "" -msgid "" -"The code can be used as base code for the particular application " -"requirements." +msgid "The code can be used as base code for the particular application requirements." msgstr "" msgid "No ordering is performed." @@ -11593,9 +9907,7 @@ msgstr "" msgid "``pgr_degree`` can use :doc:`pgr_extractVertices` embedded in the call." msgstr "" -msgid "" -"For decent size networks, it is best to prepare your vertices table before " -"hand and use it on ``pgr_degree`` calls. (See `Using a vertex table`_)" +msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls. (See `Using a vertex table`_)" msgstr "" msgid "Calculate the degree of the nodes:" @@ -11625,9 +9937,7 @@ msgstr "" msgid "``in_edges``" msgstr "" -msgid "" -"Array of identifiers of the edges that have the vertex ``id`` as *first end " -"point*." +msgid "Array of identifiers of the edges that have the vertex ``id`` as *first end point*." msgstr "" msgid "When missing, ``out_edges`` must exist." @@ -11636,9 +9946,7 @@ msgstr "" msgid "``out_edges``" msgstr "" -msgid "" -"Array of identifiers of the edges that have the vertex ``id`` as *second end " -"point*." +msgid "Array of identifiers of the edges that have the vertex ``id`` as *second end point*." msgstr "" msgid "When missing, ``in_edges`` must exist." @@ -11686,9 +9994,7 @@ msgstr "" msgid "Using a vertex table" msgstr "" -msgid "" -"For decent size networks, it is best to prepare your vertices table before " -"hand and use it on ``pgr_degree`` calls." +msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls." msgstr "" msgid "Extract the vertex information and save into a table:" @@ -11697,24 +10003,16 @@ msgstr "" msgid "Dry run execution" msgstr "" -msgid "" -"To get the query generated used to get the vertex information, use ``dryrun " -"=> true``." +msgid "To get the query generated used to get the vertex information, use ``dryrun => true``." msgstr "" -msgid "" -"The results can be used as base code to make a refinement based on the " -"backend development needs." +msgid "The results can be used as base code to make a refinement based on the backend development needs." msgstr "" msgid "Finding dead ends" msgstr "" -msgid "" -"If there is a vertices table already built using ``pgr_extractVertices`` and " -"want the degree of the whole graph rather than a subset, it can be forgo " -"using ``pgr_degree`` and work with the ``in_edges`` and ``out_edges`` " -"columns directly." +msgid "If there is a vertices table already built using ``pgr_extractVertices`` and want the degree of the whole graph rather than a subset, it can be forgo using ``pgr_degree`` and work with the ``in_edges`` and ``out_edges`` columns directly." msgstr "" msgid "The degree of a dead end is 1." @@ -11727,8 +10025,7 @@ msgstr ":doc:`pgr_withPointsCostMatrix`" msgid "The degree of a linear vertex is 2." msgstr "" -msgid "" -"If there is a vertices table already built using the ``pgr_extractVertices``" +msgid "If there is a vertices table already built using the ``pgr_extractVertices``" msgstr "" msgid ":doc:`pgr_extractVertices`" @@ -11737,43 +10034,28 @@ msgstr ":doc:`pgr_extractVertices`" msgid "``pgr_depthFirstSearch`` - Proposed" msgstr "" -msgid "" -"``pgr_depthFirstSearch`` — Returns a depth first search traversal of the " -"graph. The graph can be directed or undirected." +msgid "``pgr_depthFirstSearch`` — Returns a depth first search traversal of the graph. The graph can be directed or undirected." msgstr "" msgid "Version 3.3.0" msgstr "" -msgid "" -"Depth First Search algorithm is a traversal algorithm which starts from a " -"root vertex, goes as deep as possible, and backtracks once a vertex is " -"reached with no adjacent vertices or with all visited adjacent vertices. The " -"traversal continues until all the vertices reachable from the root vertex " -"are visited." +msgid "Depth First Search algorithm is a traversal algorithm which starts from a root vertex, goes as deep as possible, and backtracks once a vertex is reached with no adjacent vertices or with all visited adjacent vertices. The traversal continues until all the vertices reachable from the root vertex are visited." msgstr "" -msgid "" -"The implementation works for both **directed** and **undirected** graphs." +msgid "The implementation works for both **directed** and **undirected** graphs." msgstr "" -msgid "" -"Provides the Depth First Search traversal order from a root vertex or from a " -"set of root vertices." +msgid "Provides the Depth First Search traversal order from a root vertex or from a set of root vertices." msgstr "" -msgid "" -"An optional non-negative maximum depth parameter to limit the results up to " -"a particular depth." +msgid "An optional non-negative maximum depth parameter to limit the results up to a particular depth." msgstr "" -msgid "" -"For optimization purposes, any duplicated values in the `Root vids` are " -"ignored." +msgid "For optimization purposes, any duplicated values in the `Root vids` are ignored." msgstr "" -msgid "" -"It does not produce the shortest path from a root vertex to a target vertex." +msgid "It does not produce the shortest path from a root vertex to a target vertex." msgstr "" msgid "The aggregate cost of traversal is not guaranteed to be minimal." @@ -11797,19 +10079,13 @@ msgstr "" msgid "Same as `Single vertex`_ but with edges in descending order of ``id``." msgstr "" -msgid "" -"`Boost: Depth First Search `__" +msgid "`Boost: Depth First Search `__" msgstr "" -msgid "" -"`Boost: Undirected DFS `__" +msgid "`Boost: Undirected DFS `__" msgstr "" -msgid "" -"`Wikipedia: Depth First Search algorithm `__" +msgid "`Wikipedia: Depth First Search algorithm `__" msgstr "" msgid "``pgr_dijkstra`` — Shortest path using Dijkstra algorithm." @@ -11864,12 +10140,10 @@ msgstr "" msgid "pgr_dijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**" msgstr "" -msgid "" -"The examples of this section are based on the :doc:`sampledata` network." +msgid "The examples of this section are based on the :doc:`sampledata` network." msgstr "" msgid "For **directed** graphs with ``cost`` and ``reverse_cost`` columns" @@ -11911,8 +10185,7 @@ msgstr "" msgid "8) Using `Combinations`_ to get the solution of examples 1 to 3" msgstr "" -msgid "" -"Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" +msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" msgstr "" msgid "For **undirected** graphs with ``cost`` and ``reverse_cost`` columns" @@ -12008,8 +10281,7 @@ msgstr "" msgid "Equvalences between signatures" msgstr "" -msgid "" -"The following examples find the path for :math:`\\{6\\}\\rightarrow\\{10\\}`" +msgid "The following examples find the path for :math:`\\{6\\}\\rightarrow\\{10\\}`" msgstr "" msgid "33) Using `One to One`_" @@ -12027,9 +10299,7 @@ msgstr "" msgid "37) Using `Combinations`_" msgstr "" -msgid "" -"`Boost: Dijkstra shortest paths `__" +msgid "`Boost: Dijkstra shortest paths `__" msgstr "" msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" @@ -12039,9 +10309,7 @@ msgid "``pgr_dijkstraCost``" msgstr "" #, fuzzy -msgid "" -"``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra " -"algorithm." +msgid "``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra algorithm." msgstr ":doc:`pgr_aStarCost` - 최단 경로의 집계 비용 반환." #, fuzzy @@ -12049,27 +10317,19 @@ msgid "pgr_dijkstraCost(Combinations)" msgstr ":doc:`pgr_withPointsCostMatrix`" #, fuzzy -msgid "" -"The ``pgr_dijkstraCost`` function summarizes of the cost of the shortest " -"path using Dijkstra Algorithm." -msgstr "" -":doc:`pgr_bdDijkstraCost` - 최단 경로의 비용을 계산하기 위한 양방향 다익스트" -"라 알고리즘" +msgid "The ``pgr_dijkstraCost`` function summarizes of the cost of the shortest path using Dijkstra Algorithm." +msgstr ":doc:`pgr_bdDijkstraCost` - 최단 경로의 비용을 계산하기 위한 양방향 다익스트라 알고리즘" -msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" msgid "pgr_dijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" @@ -12078,9 +10338,7 @@ msgstr "" msgid "``pgr_dijkstraCostMatrix``" msgstr "" -msgid "" -"``pgr_dijkstraCostMatrix`` - Calculates a cost matrix using :doc:" -"`pgr_dijkstra`." +msgid "``pgr_dijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_dijkstra`." msgstr "" msgid "Using Dijkstra algorithm, calculate and return a cost matrix." @@ -12093,15 +10351,10 @@ msgstr "" msgid "``pgr_dijkstraNear``" msgstr ":doc:`pgr_dijkstraVia`" -msgid "" -"``pgr_dijkstraNear`` — Using Dijkstra's algorithm, finds the route that " -"leads to the nearest vertex." +msgid "``pgr_dijkstraNear`` — Using Dijkstra's algorithm, finds the route that leads to the nearest vertex." msgstr "" -msgid "" -"Given a graph, a starting vertex and a set of ending vertices, this function " -"finds the shortest path from the starting vertex to the nearest ending " -"vertex." +msgid "Given a graph, a starting vertex and a set of ending vertices, this function finds the shortest path from the starting vertex to the nearest ending vertex." msgstr "" msgid "Uses Dijkstra algorithm." @@ -12149,16 +10402,13 @@ msgstr "" msgid "Combinations: :math:`drt * |Starting vids|`" msgstr "" -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" msgstr "" -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" msgstr "" -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" msgstr "" msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options B**])" @@ -12170,8 +10420,7 @@ msgstr "" msgid "**options B:** ``[directed, cap, global]``" msgstr "" -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgstr "" msgid "**options:** ``[directed, cap]``" @@ -12183,8 +10432,7 @@ msgstr "" msgid "Using a **directed** graph for car routing." msgstr "" -msgid "" -"The subway stations are on the following vertices :math:`\\{1, 10, 11\\}`" +msgid "The subway stations are on the following vertices :math:`\\{1, 10, 11\\}`" msgstr "" msgid "The defaults used:" @@ -12199,13 +10447,10 @@ msgstr "" msgid "The result shows that station at vertex :math:`11` is the nearest." msgstr "" -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -msgid "" -"Departing on a car from a subway station find the nearest **two** stations " -"to vertex :math:`2`" +msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`2`" msgstr "" msgid "On line `4`: using the positional parameter: `directed` set to ``true``" @@ -12214,13 +10459,10 @@ msgstr "" msgid "In line `5`: using named parameter `cap => 2`" msgstr "" -msgid "" -"The result shows that station at vertex :math:`10` is the nearest and the " -"next best is :math:`11`." +msgid "The result shows that station at vertex :math:`10` is the nearest and the next best is :math:`11`." msgstr "" -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "" msgid "**options:** ``[directed, cap, global]``" @@ -12244,21 +10486,16 @@ msgstr "" msgid "`global => true`" msgstr "" -msgid "" -"For a pedestrian the best connection is to get on/off is at vertex :math:" -"`15` of the first subway line and at vertex :math:`10` of the second subway " -"line." +msgid "For a pedestrian the best connection is to get on/off is at vertex :math:`15` of the first subway line and at vertex :math:`10` of the second subway line." msgstr "" -msgid "" -"Only `one` route is returned because `global` is ``true`` and `cap` is ``1``" +msgid "Only `one` route is returned because `global` is ``true`` and `cap` is ``1``" msgstr "" msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" -msgid "" -"Find the best car connection between all the stations of two subway lines" +msgid "Find the best car connection between all the stations of two subway lines" msgstr "" msgid "The first subway line stations stops are at :math:`\\{1, 10, 11\\}`" @@ -12270,14 +10507,10 @@ msgstr "" msgid "The combinations contents:" msgstr "" -msgid "" -"lines `3~4` sets the start vertices to be from the first subway line and the " -"ending vertices to be from the second subway line" +msgid "lines `3~4` sets the start vertices to be from the first subway line and the ending vertices to be from the second subway line" msgstr "" -msgid "" -"lines `6~7` sets the start vertices to be from the first subway line and the " -"ending vertices to be from the first subway line" +msgid "lines `6~7` sets the start vertices to be from the first subway line and the ending vertices to be from the first subway line" msgstr "" msgid "On line `8`: using the named parameter is `global => false`" @@ -12286,34 +10519,22 @@ msgstr "" msgid "From the results:" msgstr "" -msgid "" -"making a connection from the first subway line :math:`\\{1, 10, 11\\}` to " -"the second :math:`\\{15, 16\\}`:" +msgid "making a connection from the first subway line :math:`\\{1, 10, 11\\}` to the second :math:`\\{15, 16\\}`:" msgstr "" -msgid "" -"The best connections from all the stations from the first line are: :math:" -"`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" +msgid "The best connections from all the stations from the first line are: :math:`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" msgstr "" -msgid "" -"The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` " -"(lines: `11` and `12`)" +msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `11` and `12`)" msgstr "" -msgid "" -"making a connection from the second subway line :math:`\\{15, 16\\}` to the " -"first :math:`\\{1, 10, 11\\}`:" +msgid "making a connection from the second subway line :math:`\\{15, 16\\}` to the first :math:`\\{1, 10, 11\\}`:" msgstr "" -msgid "" -"The best connections from all the stations from the second line are: :math:" -"`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" +msgid "The best connections from all the stations from the second line are: :math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" msgstr "" -msgid "" -"Both are equally good as they have the same cost. (lines: `13` and `14` and " -"lines: `15` and `16`)" +msgid "Both are equally good as they have the same cost. (lines: `13` and `14` and lines: `15` and `16`)" msgstr "" msgid "Dijkstra optional parameters" @@ -12344,60 +10565,40 @@ msgstr "" msgid "``pgr_dijkstraNearCost``" msgstr ":doc:`pgr_dijkstraNearCost`" -msgid "" -"``pgr_dijkstraNearCost`` — Using dijkstra algorithm, finds the route that " -"leads to the nearest vertex." +msgid "``pgr_dijkstraNearCost`` — Using dijkstra algorithm, finds the route that leads to the nearest vertex." msgstr "" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options " -"A**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" msgstr "" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options " -"A**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" msgstr "" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options " -"B**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" msgstr "" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" msgstr "" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, " -"[**options**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgstr "" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, " -"[**options**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -msgid "" -"Departing on a car from a subway station find the nearest **two** stations " -"to vertex :math:`6`" +msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`6`" msgstr "" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, " -"[**options**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "" msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" -msgid "" -"The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` " -"(lines: `1`)" +msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `1`)" msgstr "" -msgid "" -"Both are equally good as they have the same cost. (lines: `12` and `13`)" +msgid "Both are equally good as they have the same cost. (lines: `12` and `13`)" msgstr "" #, fuzzy @@ -12407,10 +10608,7 @@ msgstr ":doc:`pgr_dijkstraVia`" msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices." msgstr "" -msgid "" -"Given a list of vertices and a graph, this function is equivalent to finding " -"the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :" -"math:`i < size\\_of(via\\;vertices)`." +msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)`." msgstr "" msgid "Route" @@ -12437,9 +10635,7 @@ msgstr "" msgid "Returns set of |via-result|" msgstr "" -msgid "" -"Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order " -"on an directed graph." +msgid "Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order on an directed graph." msgstr "" msgid "Via optional parameters" @@ -12451,9 +10647,7 @@ msgstr "" msgid "Identifier of a path. Has value **1** for the first path." msgstr "" -msgid "" -"Identifier of the edge used to go from ``node`` to the next node in the path " -"sequence." +msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence." msgstr "" msgid "-1 for the last node of the path." @@ -12465,14 +10659,10 @@ msgstr "" msgid "``route_agg_cost``" msgstr "" -msgid "" -"Total cost from ``start_vid`` of ``seq = 1`` to ``end_vid`` of the current " -"``seq``." +msgid "Total cost from ``start_vid`` of ``seq = 1`` to ``end_vid`` of the current ``seq``." msgstr "" -msgid "" -"All this examples are about the route that visits the vertices :math:`\\{5, " -"7, 1, 8, 15\\}` in that order on a **directed** graph." +msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a **directed** graph." msgstr "" msgid "The main query" @@ -12499,8 +10689,7 @@ msgstr "" msgid ":doc:`dijkstra-family`." msgstr "" -msgid "" -"``pgr_drivingDistance`` - Returns the driving distance from a start node." +msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." msgstr "" #, fuzzy @@ -12532,18 +10721,13 @@ msgstr "" msgid "pgr_drivingDistance(multiple vertices)" msgstr "" -msgid "" -"Using the Dijkstra algorithm, extracts all the nodes that have costs less " -"than or equal to the value ``distance``. The edges extracted will conform to " -"the corresponding spanning tree." +msgid "Using the Dijkstra algorithm, extracts all the nodes that have costs less than or equal to the value ``distance``. The edges extracted will conform to the corresponding spanning tree." msgstr "" -msgid "" -"pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" +msgid "pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" msgstr "" -msgid "" -"pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" +msgid "pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" msgstr "" msgid "**options:** [directed, equicost]" @@ -12558,9 +10742,7 @@ msgstr "" msgid "Multiple Vertices" msgstr "" -msgid "" -"From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` with equi-" -"cost on a directed graph" +msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` with equi-cost on a directed graph" msgstr "" msgid "Driving distance optional parameters" @@ -12569,36 +10751,25 @@ msgstr "" msgid "``equicost``" msgstr "" -msgid "" -"When ``true`` the node will only appear in the closest ``start_vid`` list. " -"Tie brakes are arbitrary." +msgid "When ``true`` the node will only appear in the closest ``start_vid`` list. Tie brakes are arbitrary." msgstr "" -msgid "" -"When ``false`` which resembles several calls using the single vertex " -"signature." +msgid "When ``false`` which resembles several calls using the single vertex signature." msgstr "" msgid "end-before" msgstr "" -msgid "" -"From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` on an " -"undirected graph" +msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` on an undirected graph" msgstr "" msgid "``pgr_edgeColoring`` - Experimental" msgstr "" -msgid "" -"``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free " -"graphs" +msgid "``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free graphs" msgstr "" -msgid "" -"Edge Coloring is an algorithm used for coloring of the edges for the " -"vertices in the graph. It is an assignment of colors to the edges of the " -"graph so that no two adjacent edges have the same color." +msgid "Edge Coloring is an algorithm used for coloring of the edges for the vertices in the graph. It is an assignment of colors to the edges of the graph so that no two adjacent edges have the same color." msgstr "" msgid "The implementation is for **undirected** and **loop-free** graphs" @@ -12610,24 +10781,16 @@ msgstr "" msgid "no self-loops and no parallel edges." msgstr "" -msgid "" -"Provides the color to be assigned to all the edges present in the graph." +msgid "Provides the color to be assigned to all the edges present in the graph." msgstr "" -msgid "" -"At most :math:`\\Delta + 1` colors are used, where :math:`\\Delta` is the " -"degree of the graph." +msgid "At most :math:`\\Delta + 1` colors are used, where :math:`\\Delta` is the degree of the graph." msgstr "" -msgid "" -"This is optimal for some graphs, and by Vizing's theorem it uses at most one " -"color more than the optimal for all others." +msgid "This is optimal for some graphs, and by Vizing's theorem it uses at most one color more than the optimal for all others." msgstr "" -msgid "" -"the chromatic number :math:`x'(G)` (minimum number of colors needed for " -"proper edge coloring of graph) is equal to the degree :math:`\\Delta + 1` of " -"the graph, (:math:`x'(G) = \\Delta`)" +msgid "the chromatic number :math:`x'(G)` (minimum number of colors needed for proper edge coloring of graph) is equal to the degree :math:`\\Delta + 1` of the graph, (:math:`x'(G) = \\Delta`)" msgstr "" msgid "The algorithm tries to assign the least possible color to every edge." @@ -12636,8 +10799,7 @@ msgstr "" msgid "Does not always produce optimal coloring." msgstr "" -msgid "" -"The returned rows are ordered in ascending order of the edge identifier." +msgid "The returned rows are ordered in ascending order of the edge identifier." msgstr "" msgid "Efficient graph coloring is an NP-Hard problem, and therefore:" @@ -12658,26 +10820,19 @@ msgstr "" msgid "Graph coloring of pgRouting :doc:`sampledata`" msgstr "" -msgid "" -"`Boost: Edge Coloring `__" +msgid "`Boost: Edge Coloring `__" msgstr "" -msgid "" -"`Wikipedia: Graph coloring `__" +msgid "`Wikipedia: Graph coloring `__" msgstr "" -msgid "" -"``pgr_edgeDisjointPaths`` — Calculates edge disjoint paths between two " -"groups of vertices." +msgid "``pgr_edgeDisjointPaths`` — Calculates edge disjoint paths between two groups of vertices." msgstr "" msgid "pgr_edgeDisjointPaths(Combinations)" msgstr "" -msgid "" -"Calculates the edge disjoint paths between two groups of vertices. Utilizes " -"underlying maximum flow algorithms to calculate the paths." +msgid "Calculates the edge disjoint paths between two groups of vertices. Utilizes underlying maximum flow algorithms to calculate the paths." msgstr "" msgid "The main characterics are:" @@ -12686,9 +10841,7 @@ msgstr "" msgid "Calculates the edge disjoint paths between any two groups of vertices." msgstr "" -msgid "" -"Returns EMPTY SET when source and destination are the same, or cannot be " -"reached." +msgid "Returns EMPTY SET when source and destination are the same, or cannot be reached." msgstr "" msgid "The graph can be directed or undirected." @@ -12697,34 +10850,22 @@ msgstr "" msgid "Uses :doc:`pgr_boykovKolmogorov` to calculate the paths." msgstr "" -msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, " -"[``directed``])" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vids**, " -"[``directed``])" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vid**, " -"[``directed``])" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -msgid "" -"Using a combinations table, equivalent to calculating result from vertices :" -"math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}` on an undirected " -"graph." +msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}` on an undirected graph." msgstr "" msgid "Manually assigned vertex combinations on an undirected graph." @@ -12733,9 +10874,7 @@ msgstr "" msgid "``pgr_edmondsKarp``" msgstr "" -msgid "" -"``pgr_edmondsKarp`` — Calculates the flow on the graph edges that maximizes " -"the flow from the sources to the targets using Edmonds Karp Algorithm." +msgid "``pgr_edmondsKarp`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Edmonds Karp Algorithm." msgstr "" msgid "pgr_edmondsKarp(Combinations)" @@ -12762,9 +10901,7 @@ msgstr "" msgid "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -msgid "" -"`Boost: Edmonds Karp max flow `__" +msgid "`Boost: Edmonds Karp max flow `__" msgstr "" msgid "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" @@ -12774,36 +10911,22 @@ msgstr "" msgid "``pgr_edwardMoore`` - Experimental" msgstr ":doc:`pgr_edwardMoore`" -msgid "" -"``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore algorithm." +msgid "``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore algorithm." msgstr "" -msgid "" -"Edward Moore’s Algorithm is an improvement of the Bellman-Ford Algorithm. It " -"can compute the shortest paths from a single source vertex to all other " -"vertices in a weighted directed graph. The main difference between Edward " -"Moore's Algorithm and Bellman Ford's Algorithm lies in the run time." +msgid "Edward Moore’s Algorithm is an improvement of the Bellman-Ford Algorithm. It can compute the shortest paths from a single source vertex to all other vertices in a weighted directed graph. The main difference between Edward Moore's Algorithm and Bellman Ford's Algorithm lies in the run time." msgstr "" -msgid "" -"The worst-case running time of the algorithm is :math:`O(| V | * | E |)` " -"similar to the time complexity of Bellman-Ford algorithm. However, " -"experiments suggest that this algorithm has an average running time " -"complexity of :math:`O( | E | )` for random graphs. This is significantly " -"faster in terms of computation speed." +msgid "The worst-case running time of the algorithm is :math:`O(| V | * | E |)` similar to the time complexity of Bellman-Ford algorithm. However, experiments suggest that this algorithm has an average running time complexity of :math:`O( | E | )` for random graphs. This is significantly faster in terms of computation speed." msgstr "" -msgid "" -"Thus, the algorithm is at-best, significantly faster than Bellman-Ford " -"algorithm and is at-worst,as good as Bellman-Ford algorithm" +msgid "Thus, the algorithm is at-best, significantly faster than Bellman-Ford algorithm and is at-worst,as good as Bellman-Ford algorithm" msgstr "" msgid "The `agg_cost` the non included values `(v, v)` is :math:`0`" msgstr "" -msgid "" -"For optimization purposes, any duplicated value in the `start vids` or `end " -"vids` are ignored." +msgid "For optimization purposes, any duplicated value in the `start vids` or `end vids` are ignored." msgstr "" msgid "Running time:" @@ -12815,20 +10938,16 @@ msgstr "" msgid "Average case: :math:`O( | E | )`" msgstr "" -msgid "" -"pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "" -"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" msgid "pgr_edwardMoore(`Edges SQL`_, `Combinations SQL`_, [``directed``])" @@ -12847,14 +10966,10 @@ msgstr ":doc:`pgr_extractVertices`" msgid "``pgr_extractVertices`` — Extracts the vertices information" msgstr "" -msgid "" -"This is an auxiliary function for extracting the vertex information of the " -"set of edges of a graph." +msgid "This is an auxiliary function for extracting the vertex information of the set of edges of a graph." msgstr "" -msgid "" -"When the edge identifier is given, then it will also calculate the in and " -"out edges" +msgid "When the edge identifier is given, then it will also calculate the in and out edges" msgstr "" msgid "pgr_extractVertices(`Edges SQL`_, [``dryrun``])" @@ -12878,9 +10993,7 @@ msgstr "" msgid "Geometry of the edge." msgstr "" -msgid "" -"This inner query takes precedence over the next two inner query, therefore " -"other columns are ignored when ``geom`` column appears." +msgid "This inner query takes precedence over the next two inner query, therefore other columns are ignored when ``geom`` column appears." msgstr "" msgid "Ignored columns:" @@ -12895,9 +11008,7 @@ msgstr "" msgid "When vertex geometry is known" msgstr "" -msgid "" -"To use this inner query the column ``geom`` should not be part of the set of " -"columns." +msgid "To use this inner query the column ``geom`` should not be part of the set of columns." msgstr "" msgid "``POINT``" @@ -12909,17 +11020,13 @@ msgstr "" msgid "POINT geometry of the ending vertex." msgstr "" -msgid "" -"This inner query takes precedence over the next inner query, therefore other " -"columns are ignored when ``startpoint`` and ``endpoint`` columns appears." +msgid "This inner query takes precedence over the next inner query, therefore other columns are ignored when ``startpoint`` and ``endpoint`` columns appears." msgstr "" msgid "When identifiers of vertices are known" msgstr "" -msgid "" -"To use this inner query the columns ``geom``, ``startpoint`` and " -"``endpoint`` should not be part of the set of columns." +msgid "To use this inner query the columns ``geom``, ``startpoint`` and ``endpoint`` should not be part of the set of columns." msgstr "" msgid "``NULL`` When the ``id`` is not part of the inner query" @@ -12934,9 +11041,7 @@ msgstr "" msgid "Geometry of the point" msgstr "" -msgid "" -"To get the query generated used to get the vertex information, use ``dryrun :" -"= true``." +msgid "To get the query generated used to get the vertex information, use ``dryrun := true``." msgstr "" msgid "Create a routing topology" @@ -12948,8 +11053,7 @@ msgstr "" msgid "Clean up the columns of the routing topology to be created" msgstr "" -msgid "" -"When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, )``" +msgid "When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, )``" msgstr "" msgid "For big edge tables that are been prepared," @@ -12989,29 +11093,22 @@ msgstr "" msgid "``partial`` option is removed." msgstr "" -msgid "" -"``pgr_findCloseEdges`` - An utility function that finds the closest edge to " -"a point geometry." +msgid "``pgr_findCloseEdges`` - An utility function that finds the closest edge to a point geometry." msgstr "" -msgid "" -"The geometries must be in the same coordinate system (have the same SRID)." +msgid "The geometries must be in the same coordinate system (have the same SRID)." msgstr "" -msgid "" -"The code to do the calculations can be obtained for further specific " -"adjustments needed by the application." +msgid "The code to do the calculations can be obtained for further specific adjustments needed by the application." msgstr "" msgid "``EMPTY SET`` is returned on dryrun executions" msgstr "" -msgid "" -"pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" +msgid "pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" msgstr "" -msgid "" -"pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" +msgid "pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" msgstr "" msgid "**options:** ``[cap, dryrun]``" @@ -13062,9 +11159,7 @@ msgstr "" msgid "When ``false`` calculations are performed." msgstr "" -msgid "" -"When ``true`` calculations are not performed and the query to do the " -"calculations is exposed in a PostgreSQL ``NOTICE``." +msgid "When ``true`` calculations are not performed and the query to do the calculations is exposed in a PostgreSQL ``NOTICE``." msgstr "" msgid "``geometry``" @@ -13076,9 +11171,7 @@ msgstr "" msgid "When :math:`cap = 1`, it is the closest edge." msgstr "" -msgid "" -"Value in <0,1> that indicates the relative position from the first end-point " -"of the edge." +msgid "Value in <0,1> that indicates the relative position from the first end-point of the edge." msgstr "" msgid "Value in ``[r, l]`` indicating if the point is:" @@ -13102,9 +11195,7 @@ msgstr "" msgid "Original ``POINT`` geometry." msgstr "" -msgid "" -"``LINESTRING`` geometry that connects the original **point** to the closest " -"point of the edge with identifier ``edge_id``" +msgid "``LINESTRING`` geometry that connects the original **point** to the closest point of the edge with identifier ``edge_id``" msgstr "" msgid "One point in an edge" @@ -13116,9 +11207,7 @@ msgstr "" msgid "``geom`` has the value of the original point." msgstr "" -msgid "" -"The geometry ``edge`` is a line that connects the original point with the " -"edge :math:`sp \\rightarrow ep` edge." +msgid "The geometry ``edge`` is a line that connects the original point with the edge :math:`sp \\rightarrow ep` edge." msgstr "" msgid "The point is located at the left of the edge." @@ -13139,9 +11228,7 @@ msgstr "" msgid "Generates a PostgreSQL ``NOTICE`` with the code used." msgstr "" -msgid "" -"The generated code can be used as a starting base code for additional " -"requirements, like taking into consideration the SRID." +msgid "The generated code can be used as a starting base code for additional requirements, like taking into consideration the SRID." msgstr "" msgid "Many points in an edge" @@ -13150,15 +11237,10 @@ msgstr "" msgid "The green nodes are the **original points**" msgstr "" -msgid "" -"The geometry ``geom``, marked as **g1** and **g2** are the **original " -"points**" +msgid "The geometry ``geom``, marked as **g1** and **g2** are the **original points**" msgstr "" -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." +msgid "The geometry ``edge``, marked as **edge1** and **edge2** is a line that connects the **original point** with the closest point on the :math:`sp \\rightarrow ep` edge." msgstr "" msgid "Many points dry run execution" @@ -13167,8 +11249,7 @@ msgstr "" msgid "Do not process query" msgstr "" -msgid "" -"Generate a PostgreSQL ``NOTICE`` with the code used to calculate all columns" +msgid "Generate a PostgreSQL ``NOTICE`` with the code used to calculate all columns" msgstr "" msgid "Find at most two routes to a given point" @@ -13186,20 +11267,13 @@ msgstr "" msgid "Points of interest" msgstr "" -msgid "" -"Some times the applications work \"on the fly\" starting from a location " -"that is not a vertex in the graph. Those locations, in pgRrouting are called " -"points of interest." +msgid "Some times the applications work \"on the fly\" starting from a location that is not a vertex in the graph. Those locations, in pgRrouting are called points of interest." msgstr "" -msgid "" -"The information needed in the points of interest is ``pid``, ``edge_id``, " -"``side``, ``fraction``." +msgid "The information needed in the points of interest is ``pid``, ``edge_id``, ``side``, ``fraction``." msgstr "" -msgid "" -"On this documentation there will be some 6 fixed points of interest and they " -"will be stored on a table." +msgid "On this documentation there will be some 6 fixed points of interest and they will be stored on a table." msgstr "" msgid "A unique identifier." @@ -13220,9 +11294,7 @@ msgstr "" msgid "The distance between ``geom`` and the segment ``edge_id``." msgstr "" -msgid "" -"A segment that connects the ``geom`` of the point to the closest point on " -"the segment ``edge_id``." +msgid "A segment that connects the ``geom`` of the point to the closest point on the segment ``edge_id``." msgstr "" msgid "``newPoint``" @@ -13240,9 +11312,7 @@ msgstr "" 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." +msgid "Any other additional modification: In this manual, point :math:`6` can be reached from both sides." msgstr "" msgid "The points of interest:" @@ -13251,16 +11321,10 @@ msgstr "" msgid "``pgr_floydWarshall``" msgstr "" -msgid "" -"``pgr_floydWarshall`` - Returns the sum of the costs of the shortest path " -"for each pair of nodes in the graph using Floyd-Warshall algorithm." +msgid "``pgr_floydWarshall`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Floyd-Warshall algorithm." msgstr "" -msgid "" -"The Floyd-Warshall algorithm, also known as Floyd's algorithm, is a good " -"choice to calculate the sum of the costs of the shortest path for each pair " -"of nodes in the graph, for *dense graphs*. We use Boost's implementation " -"which runs in :math:`\\Theta(V^3)` time," +msgid "The Floyd-Warshall algorithm, also known as Floyd's algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *dense graphs*. We use Boost's implementation which runs in :math:`\\Theta(V^3)` time," msgstr "" msgid "pgr_floydWarshall(`Edges SQL`_, [``directed``])" @@ -13269,16 +11333,13 @@ msgstr "" msgid "For a directed subgraph with edges :math:`\\{1, 2, 3, 4\\}`." msgstr "" -msgid "" -"Boost `Floyd-Warshall `_" +msgid "Boost `Floyd-Warshall `_" msgstr "" msgid "``pgr_full_version``" msgstr "" -msgid "" -"``pgr_full_version`` — Get the details of pgRouting version information." +msgid "``pgr_full_version`` — Get the details of pgRouting version information." msgstr "" msgid "Get complete details of pgRouting version information" @@ -13352,27 +11413,13 @@ msgid "``pgr_hawickCircuits`` - Experimental" msgstr ":doc:`pgr_hawickCircuits`" #, fuzzy -msgid "" -"``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits " -"algorithm." +msgid "``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits algorithm." msgstr ":doc:`pgr_bdDijkstra` - 최단 경로를 위한 양방향 다익스트라 알고리즘." -msgid "" -"Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. " -"James. This algorithm solves the problem of detecting and enumerating " -"circuits in graphs. It is capable of circuit enumeration in graphs with " -"directed-arcs, multiple-arcs and self-arcs with a memory efficient and high-" -"performance im-plementation. It is an extension of Johnson's Algorithm of " -"finding all the elementary circuits of a directed graph." +msgid "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. James. This algorithm solves the problem of detecting and enumerating circuits in graphs. It is capable of circuit enumeration in graphs with directed-arcs, multiple-arcs and self-arcs with a memory efficient and high-performance im-plementation. It is an extension of Johnson's Algorithm of finding all the elementary circuits of a directed graph." msgstr "" -msgid "" -"There are 2 variations defined in the Boost Graph Library. Here, we have " -"implemented only 2nd as it serves the most suitable and practical usecase. " -"In this variation we get the circuits after filtering out the circuits " -"caused by parallel edges. Parallel edge circuits have more use cases when " -"you want to count the no. of circuits.Maybe in future, we will also " -"implemenent this variation." +msgid "There are 2 variations defined in the Boost Graph Library. Here, we have implemented only 2nd as it serves the most suitable and practical usecase. In this variation we get the circuits after filtering out the circuits caused by parallel edges. Parallel edge circuits have more use cases when you want to count the no. of circuits.Maybe in future, we will also implemenent this variation." msgstr "" msgid "The algorithm implementation works only for directed graph" @@ -13399,8 +11446,7 @@ msgstr "" msgid "Id of the circuit starting from ``1``" msgstr "" -msgid "" -"Relative position in the path. Has value ``0`` for beginning of the path" +msgid "Relative position in the path. Has value ``0`` for beginning of the path" msgstr "" msgid "Identifier of the starting vertex of the circuit." @@ -13412,32 +11458,22 @@ msgstr "" msgid "Identifier of the node in the path from a vid to next vid." msgstr "" -msgid "" -"`Boost: Hawick Circuit Algorithm `__" +msgid "`Boost: Hawick Circuit Algorithm `__" msgstr "" msgid "``pgr_isPlanar`` - Experimental" msgstr "" -msgid "" -"``pgr_isPlanar`` — Returns a boolean depending upon the planarity of the " -"graph." +msgid "``pgr_isPlanar`` — Returns a boolean depending upon the planarity of the graph." msgstr "" -msgid "" -"A graph is planar if it can be drawn in two-dimensional space with no two of " -"its edges crossing. Such a drawing of a planar graph is called a plane " -"drawing. Every planar graph also admits a straight-line drawing, which is a " -"plane drawing where each edge is represented by a line segment. When a graph " -"has :math:`K_5` or :math:`K_{3, 3}` as subgraph then the graph is not planar." +msgid "A graph is planar if it can be drawn in two-dimensional space with no two of its edges crossing. Such a drawing of a planar graph is called a plane drawing. Every planar graph also admits a straight-line drawing, which is a plane drawing where each edge is represented by a line segment. When a graph has :math:`K_5` or :math:`K_{3, 3}` as subgraph then the graph is not planar." msgstr "" msgid "This implementation use the Boyer-Myrvold Planarity Testing." msgstr "" -msgid "" -"It will return a boolean value depending upon the planarity of the graph." +msgid "It will return a boolean value depending upon the planarity of the graph." msgstr "" msgid "Applicable only for **undirected** graphs." @@ -13467,42 +11503,29 @@ msgstr "" msgid "`false` when the graph is not planar." msgstr "" -msgid "" -"The following edges will make the subgraph with vertices {10, 15, 11, 16, " -"13} a :math:`K_1` graph." +msgid "The following edges will make the subgraph with vertices {10, 15, 11, 16, 13} a :math:`K_1` graph." msgstr "" -msgid "" -"The new graph is not planar because it has a :math:`K_5` subgraph. Edges in " -"blue represent :math:`K_5` subgraph." +msgid "The new graph is not planar because it has a :math:`K_5` subgraph. Edges in blue represent :math:`K_5` subgraph." msgstr "" -msgid "" -"`Boost: Boyer Myrvold `__" +msgid "`Boost: Boyer Myrvold `__" msgstr "" msgid "``pgr_johnson``" msgstr "" #, fuzzy -msgid "" -"``pgr_johnson`` - Returns the sum of the costs of the shortest path for each " -"pair of nodes in the graph using Johnson algorithm." +msgid "``pgr_johnson`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Johnson algorithm." msgstr ":doc:`pgr_aStarCost` - 최단 경로의 집계 비용 반환." -msgid "" -"The Johnson algorithm, is a good choice to calculate the sum of the costs of " -"the shortest path for each pair of nodes in the graph, for *sparse graphs*. " -"It uses the Boost's implementation which runs in :math:`O(V E \\log V)` time," +msgid "The Johnson algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *sparse graphs*. It uses the Boost's implementation which runs in :math:`O(V E \\log V)` time," msgstr "" msgid "pgr johnson(`Edges SQL`_, [``directed``])" msgstr "" -msgid "" -"Boost `Johnson `_" +msgid "Boost `Johnson `_" msgstr "" #, fuzzy @@ -13510,32 +11533,20 @@ msgid "``pgr_kingOrdering`` - Experimental" msgstr ":doc:`pgr_edwardMoore`" #, fuzzy -msgid "" -"``pgr_kingOrdering`` — Returns the King ordering of an undirected graph." +msgid "``pgr_kingOrdering`` — Returns the King ordering of an undirected graph." msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." -msgid "" -"In numerical linear algebra and graph theory, the King ordering algorithm is " -"a heuristic designed to reorder the vertices of a graph so as to reduce its " -"bandwidth." +msgid "In numerical linear algebra and graph theory, the King ordering algorithm is a heuristic designed to reorder the vertices of a graph so as to reduce its bandwidth." msgstr "" -msgid "" -"The method follows a breadth-first search (BFS) traversal, but with a " -"refinement: at each step, the unvisited neighbors of the current vertex are " -"inserted into the queue in ascending order of their pseudo-degree, where the " -"pseudo-degree of a vertex is the number of edges connecting it to yet-" -"unvisited vertices. This prioritization often yields a smaller bandwidth " -"compared to simpler BFS orderings." +msgid "The method follows a breadth-first search (BFS) traversal, but with a refinement: at each step, the unvisited neighbors of the current vertex are inserted into the queue in ascending order of their pseudo-degree, where the pseudo-degree of a vertex is the number of edges connecting it to yet-unvisited vertices. This prioritization often yields a smaller bandwidth compared to simpler BFS orderings." msgstr "" #, fuzzy msgid "The implementation targets undirected graphs." msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." -msgid "" -"Bandwidth minimization is an NP-complete problem; King ordering provides a " -"practical local minimization approach." +msgid "Bandwidth minimization is an NP-complete problem; King ordering provides a practical local minimization approach." msgstr "" msgid "The time complexity is: :math:`O(m^2 \\log(m)|E|)`" @@ -13550,21 +11561,16 @@ msgstr "" msgid "pgr_kingOrdering(`Edges SQL`_)" msgstr "" -msgid "" -"`Boost: King Ordering `__" +msgid "`Boost: King Ordering `__" msgstr "" msgid "``pgr_kruskal``" msgstr "" -msgid "" -"``pgr_kruskal`` — Minimum spanning tree of a graph using Kruskal's algorithm." +msgid "``pgr_kruskal`` — Minimum spanning tree of a graph using Kruskal's algorithm." msgstr "" -msgid "" -"This algorithm finds the minimum spanning forest in a possibly disconnected " -"graph using Kruskal's algorithm." +msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Kruskal's algorithm." msgstr "" msgid "EMPTY SET is returned when there are no edges in the graph." @@ -13579,17 +11585,13 @@ msgstr "" msgid "Minimum spanning forest" msgstr "" -msgid "" -"``pgr_kruskalBFS`` — Kruskal's algorithm for Minimum Spanning Tree with " -"breadth First Search ordering." +msgid "``pgr_kruskalBFS`` — Kruskal's algorithm for Minimum Spanning Tree with breadth First Search ordering." msgstr "" msgid "Added ``pred`` result columns." msgstr "" -msgid "" -"Visits and extracts the nodes information in Breath First Search ordering of " -"the Minimum Spanning Tree created using Kruskal's algorithm." +msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." msgstr "" msgid "Returned tree nodes from a root vertex are on Breath First Search order" @@ -13607,18 +11609,13 @@ msgstr "" msgid "The Minimum Spanning Tree having as root vertex :math:`6`" msgstr "" -msgid "" -"The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:" -"`depth \\leq 3`" +msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`depth \\leq 3`" msgstr "" msgid "``pgr_kruskalDD`` — Catchament nodes using Kruskal's algorithm." msgstr "" -msgid "" -"Using Kruskal's algorithm, extracts the nodes that have aggregate costs less " -"than or equal to a **distance** from a **root** vertex (or vertices) within " -"the calculated minimum spanning tree." +msgid "Using Kruskal's algorithm, extracts the nodes that have aggregate costs less than or equal to a **distance** from a **root** vertex (or vertices) within the calculated minimum spanning tree." msgstr "" msgid "Returned tree nodes from a root vertex are on Depth First Search order." @@ -13633,24 +11630,16 @@ msgstr "" msgid "pgr_kruskalDD(`Edges SQL`_, **root vids**, **distance**)" msgstr "" -msgid "" -"The Minimum Spanning Tree starting on vertex :math:`6` with :math:`distance " -"\\leq 3.5`" +msgid "The Minimum Spanning Tree starting on vertex :math:`6` with :math:`distance \\leq 3.5`" msgstr "" -msgid "" -"The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:" -"`distance \\leq 3.5`" +msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`distance \\leq 3.5`" msgstr "" -msgid "" -"``pgr_kruskalDFS`` — Kruskal's algorithm for Minimum Spanning Tree with " -"Depth First Search ordering." +msgid "``pgr_kruskalDFS`` — Kruskal's algorithm for Minimum Spanning Tree with Depth First Search ordering." msgstr "" -msgid "" -"Visits and extracts the nodes information in Depth First Search ordering of " -"the Minimum Spanning Tree created using Kruskal's algorithm." +msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." msgstr "" msgid "Returned tree nodes from a root vertex are on Depth First Search order" @@ -13666,15 +11655,10 @@ msgstr "" msgid "``pgr_lengauerTarjanDominatorTree`` - Experimental" msgstr ":doc:`pgr_lengauerTarjanDominatorTree`" -msgid "" -"``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all " -"vertices." +msgid "``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all vertices." msgstr "" -msgid "" -"The algorithm calculates the *immediate dominator* of each vertex called " -"**idom**, once **idom** of each vertex is calculated then by making every " -"**idom** of each vertex as its parent, the dominator tree can be built." +msgid "The algorithm calculates the *immediate dominator* of each vertex called **idom**, once **idom** of each vertex is calculated then by making every **idom** of each vertex as its parent, the dominator tree can be built." msgstr "" msgid "The algorithm works in directed graph only." @@ -13683,8 +11667,7 @@ msgstr "" msgid "The algorithm returns *idom* of each vertex." msgstr "" -msgid "" -"If the *root vertex* not present in the graph then it returns empty set." +msgid "If the *root vertex* not present in the graph then it returns empty set." msgstr "" msgid "Running time: :math:`O((V+E)log(V+E))`" @@ -13723,52 +11706,39 @@ msgstr "" msgid "Dominator tree of another component." msgstr "" -msgid "" -"`Boost: Lengauer-Tarjan dominator `__" +msgid "`Boost: Lengauer-Tarjan dominator `__" msgstr "" -msgid "" -"`Wikipedia: dominator tree `__" +msgid "`Wikipedia: dominator tree `__" msgstr "" #, fuzzy msgid "``pgr_lineGraph`` - Proposed" msgstr ":doc:`pgr_analyzeGraph`" -msgid "" -"``pgr_lineGraph`` — Transforms the given graph into its corresponding edge-" -"based graph." +msgid "``pgr_lineGraph`` — Transforms the given graph into its corresponding edge-based graph." msgstr "" #, fuzzy msgid "Works for directed and undirected graphs." msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." -msgid "" -"Given a graph :math:`G`, its line graph :math:`L(G)` is a graph such that:" +msgid "Given a graph :math:`G`, its line graph :math:`L(G)` is a graph such that:" msgstr "" msgid "Each vertex of :math:`L(G)` represents an edge of :math:`G`." msgstr "" -msgid "" -"Two vertices of :math:`L(G)` are adjacent if and only if their corresponding " -"edges share a common endpoint in :math:`G`" +msgid "Two vertices of :math:`L(G)` are adjacent if and only if their corresponding edges share a common endpoint in :math:`G`" msgstr "" -msgid "" -"The ``cost`` and ``reverse_cost`` columns of the result represent existence " -"of the edge." +msgid "The ``cost`` and ``reverse_cost`` columns of the result represent existence of the edge." msgstr "" msgid "When the graph is directed the result is directed." msgstr "" -msgid "" -"To get the complete Line Graph use unique identifiers on the double way " -"edges (See `Additional Examples`_)." +msgid "To get the complete Line Graph use unique identifiers on the double way edges (See `Additional Examples`_)." msgstr "" msgid "When the graph is undirected the result is undirected." @@ -13798,34 +11768,25 @@ msgstr "" msgid "Weight of the edge (``source``, ``target``)." msgstr "" -msgid "" -"When `negative`: edge (``source``, ``target``) does not exist, therefore " -"it’s not part of the graph." +msgid "When `negative`: edge (``source``, ``target``) does not exist, therefore it’s not part of the graph." msgstr "" msgid "Weight of the edge (``target``, ``source``)." msgstr "" -msgid "" -"When `negative`: edge (``target``, ``source``) does not exist, therefore " -"it’s not part of the graph." +msgid "When `negative`: edge (``target``, ``source``) does not exist, therefore it’s not part of the graph." msgstr "" msgid "Given the following directed graph" 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\\})`" +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 "" msgid "Representation as directed with shared edge identifiers" msgstr "" -msgid "" -"For the simplicity, the design of the edges table on the database, has the " -"edge's identifiers are represented with 3 digits:" +msgid "For the simplicity, the design of the edges table on the database, has the edge's identifiers are represented with 3 digits:" msgstr "" msgid "hundreds" @@ -13850,26 +11811,19 @@ msgstr "" msgid "In this image," msgstr "" -msgid "" -"Single or double head arrows represent one edge (row) on the edges table." +msgid "Single or double head arrows represent one edge (row) on the edges table." msgstr "" msgid "The numbers in the yellow shadow are the edge identifiers." msgstr "" -msgid "" -"Two pair of edges share the same identifier when the ``reverse_cost`` column " -"is used." +msgid "Two pair of edges share the same identifier when the ``reverse_cost`` column is used." msgstr "" -msgid "" -"Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with one " -"edge row with :math:`id=203`." +msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with one edge row with :math:`id=203`." msgstr "" -msgid "" -"Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with one " -"edge row with :math:`id=304`." +msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with one edge row with :math:`id=304`." msgstr "" msgid "The graph can be created as follows:" @@ -13881,15 +11835,13 @@ msgstr "" msgid "The result is a directed graph." msgstr "" -msgid "" -"For :math:`seq=4` from :math:`203 \\leftrightarrow 304` represent two edges" +msgid "For :math:`seq=4` from :math:`203 \\leftrightarrow 304` represent two edges" msgstr "" msgid "For all the other values of ``seq`` represent one edge." msgstr "" -msgid "" -"The ``cost`` and ``reverse_cost`` values represent the existence of the edge." +msgid "The ``cost`` and ``reverse_cost`` values represent the existence of the edge." msgstr "" msgid "When positive: the edge exists." @@ -13907,85 +11859,61 @@ msgstr "" msgid "There are no double head arrows" msgstr "" -msgid "" -"Two pair of edges share the same ending nodes and the ``reverse_cost`` " -"column is not used." +msgid "Two pair of edges share the same ending nodes and the ``reverse_cost`` column is not used." msgstr "" -msgid "" -"Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with two " -"edges :math:`id=203` and :math:`id=302` respectively." +msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with two edges :math:`id=203` and :math:`id=302` respectively." msgstr "" -msgid "" -"Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with two " -"edges :math:`id=304` and :math:`id=403` respectively." +msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with two edges :math:`id=304` and :math:`id=403` respectively." msgstr "" msgid "Line Graph of a directed graph represented with unique edges" msgstr "" -msgid "" -"For :math:`seq=7` from :math:`203 \\leftrightarrow 302` represent two edges." +msgid "For :math:`seq=7` from :math:`203 \\leftrightarrow 302` represent two edges." msgstr "" -msgid "" -"For :math:`seq=8` from :math:`304 \\leftrightarrow 403` represent two edges." +msgid "For :math:`seq=8` from :math:`304 \\leftrightarrow 403` represent two edges." msgstr "" msgid "wikipedia: `Line Graph `__" msgstr "" -msgid "" -"mathworld: `Line Graph `__" +msgid "mathworld: `Line Graph `__" msgstr "" msgid "``pgr_lineGraphFull`` - Experimental" msgstr "" -msgid "" -"``pgr_lineGraphFull`` — Transforms a given graph into a new graph where all " -"of the vertices from the original graph are converted to line graphs." +msgid "``pgr_lineGraphFull`` — Transforms a given graph into a new graph where all of the vertices from the original graph are converted to line graphs." msgstr "" msgid "Version 2.6.0" msgstr "" -msgid "" -"``pgr_lineGraphFull``, converts original directed graph to a directed line " -"graph by converting each vertex to a complete graph and keeping all the " -"original edges. The new connecting edges have a cost 0 and go between the " -"adjacent original edges, respecting the directionality." +msgid "``pgr_lineGraphFull``, converts original directed graph to a directed line graph by converting each vertex to a complete graph and keeping all the original edges. The new connecting edges have a cost 0 and go between the adjacent original edges, respecting the directionality." msgstr "" -msgid "" -"A possible application of the resulting graph is **\"routing with two edge " -"restrictions\"**:" +msgid "A possible application of the resulting graph is **\"routing with two edge restrictions\"**:" msgstr "" -msgid "" -"Setting a cost of using the vertex when routing between edges on the " -"connecting edge" +msgid "Setting a cost of using the vertex when routing between edges on the connecting edge" msgstr "" msgid "Forbid the routing between two edges by removing the connecting edge" msgstr "" -msgid "" -"This is possible because each of the intersections (vertices) in the " -"original graph are now complete graphs that have a new edge for each " -"possible turn across that intersection." +msgid "This is possible because each of the intersections (vertices) in the original graph are now complete graphs that have a new edge for each possible turn across that intersection." msgstr "" msgid "This function is for **directed** graphs." msgstr "" -msgid "" -"Results are undefined when a negative vertex id is used in the input graph." +msgid "Results are undefined when a negative vertex id is used in the input graph." msgstr "" -msgid "" -"Results are undefined when a duplicated edge id is used in the input graph." +msgid "Results are undefined when a duplicated edge id is used in the input graph." msgstr "" msgid "Running time: TBD" @@ -14000,17 +11928,13 @@ msgstr "" msgid "Full line graph of subgraph of edges :math:`\\{4, 7, 8, 10\\}`" msgstr "" -msgid "" -"The examples include the subgraph including edges 4, 7, 8, and 10 with " -"``reverse_cost``." +msgid "The examples include the subgraph including edges 4, 7, 8, and 10 with ``reverse_cost``." msgstr "" msgid "The data" msgstr "" -msgid "" -"This example displays how this graph transformation works to create " -"additional edges for each possible turn in a graph." +msgid "This example displays how this graph transformation works to create additional edges for each possible turn in a graph." msgstr "" msgid "|first|" @@ -14028,36 +11952,22 @@ msgstr "" msgid "second" msgstr "" -msgid "" -"In the transformed graph, all of the edges from the original graph are still " -"present (yellow), but we now have additional edges for every turn that could " -"be made across vertex 7 (orange)." +msgid "In the transformed graph, all of the edges from the original graph are still present (yellow), but we now have additional edges for every turn that could be made across vertex 7 (orange)." msgstr "" msgid "Creating table that identifies transformed vertices" msgstr "" -msgid "" -"The vertices in the transformed graph are each created by splitting up the " -"vertices in the original graph. Unless a vertex in the original graph is a " -"leaf vertex, it will generate more than one vertex in the transformed graph. " -"One of the newly created vertices in the transformed graph will be given the " -"same vertex identifier as the vertex that it was created from in the " -"original graph, but the rest of the newly created vertices will have " -"negative vertex ids." +msgid "The vertices in the transformed graph are each created by splitting up the vertices in the original graph. Unless a vertex in the original graph is a leaf vertex, it will generate more than one vertex in the transformed graph. One of the newly created vertices in the transformed graph will be given the same vertex identifier as the vertex that it was created from in the original graph, but the rest of the newly created vertices will have negative vertex ids." msgstr "" -msgid "" -"Following is an example of how to generate a table that maps the ids of the " -"newly created vertices with the original vertex that they were created from" +msgid "Following is an example of how to generate a table that maps the ids of the newly created vertices with the original vertex that they were created from" msgstr "" msgid "Store edge results" msgstr "" -msgid "" -"The first step is to store the results of the ``pgr_lineGraphFull`` call " -"into a table" +msgid "The first step is to store the results of the ``pgr_lineGraphFull`` call into a table" msgstr "" msgid "Create the mapping table" @@ -14078,9 +11988,7 @@ msgstr "" msgid "Inspecting the vertices map" msgstr "" -msgid "" -"The self loops happen when there is no cost traveling to the ``target`` and " -"the source has an original value." +msgid "The self loops happen when there is no cost traveling to the ``target`` and the source has an original value." msgstr "" msgid "Updating values from self loops" @@ -14095,22 +12003,16 @@ msgstr "" msgid "Adding a soft restriction" msgstr "" -msgid "" -"A soft restriction going from vertex 6 to vertex 3 using edges 4 -> 7 is " -"wanted." +msgid "A soft restriction going from vertex 6 to vertex 3 using edges 4 -> 7 is wanted." msgstr "" msgid "Identifying the restriction" msgstr "" -msgid "" -"Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where the " -"cost will be increased" +msgid "Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where the cost will be increased" msgstr "" -msgid "" -"The edge to be altered is ``WHERE cost = 0 AND seq != 1 AND edge != -1`` " -"from the previous query:" +msgid "The edge to be altered is ``WHERE cost = 0 AND seq != 1 AND edge != -1`` from the previous query:" msgstr "" msgid "Adding a value to the restriction" @@ -14128,8 +12030,7 @@ msgstr "" msgid "Simplifying leaf vertices" msgstr "" -msgid "" -"In this example, there is no additional cost for traversing a leaf vertex." +msgid "In this example, there is no additional cost for traversing a leaf vertex." msgstr "" msgid "Using the vertex map give the leaf verices their original value." @@ -14150,9 +12051,7 @@ msgstr "" msgid "Which can be removed" msgstr "" -msgid "" -"Routing can be done now using the original vertices id using :doc:" -"`pgr_dijkstra`" +msgid "Routing can be done now using the original vertices id using :doc:`pgr_dijkstra`" msgstr "" msgid "Complete routing graph" @@ -14161,9 +12060,7 @@ msgstr "" msgid "Add edges from the original graph" msgstr "" -msgid "" -"Add all the edges that are not involved in the line graph process to the new " -"table" +msgid "Add all the edges that are not involved in the line graph process to the new table" msgstr "" msgid "Some administrative tasks to get new identifiers for the edges" @@ -14175,9 +12072,7 @@ msgstr "" msgid "Using the routing graph" msgstr "" -msgid "" -"When using this method for routing with soft restrictions there will be " -"uturns" +msgid "When using this method for routing with soft restrictions there will be uturns" msgstr "" msgid "Routing from :math:`5` to :math:`1`" @@ -14195,23 +12090,13 @@ msgstr "" msgid "``pgr_makeConnected`` — Set of edges that will connect the graph." msgstr "" -msgid "" -"Adds the minimum number of edges needed to make the input graph connected. " -"The algorithm first identifies all of the connected components in the graph, " -"then adds edges to connect those components together in a path. For example, " -"if a graph contains three connected components A, B, and C, make_connected " -"will add two edges. The two edges added might consist of one connecting a " -"vertex in A with a vertex in B and one connecting a vertex in B with a " -"vertex in C." +msgid "Adds the minimum number of edges needed to make the input graph connected. The algorithm first identifies all of the connected components in the graph, then adds edges to connect those components together in a path. For example, if a graph contains three connected components A, B, and C, make_connected will add two edges. The two edges added might consist of one connecting a vertex in A with a vertex in B and one connecting a vertex in B with a vertex in C." msgstr "" -msgid "" -"It will give a minimum list of all edges which are needed in the graph to " -"make connect it." +msgid "It will give a minimum list of all edges which are needed in the graph to make connect it." msgstr "" -msgid "" -"The algorithm does not considers geometric topology in the calculations." +msgid "The algorithm does not considers geometric topology in the calculations." msgstr "" msgid "pgr_makeConnected(`Edges SQL`_)" @@ -14223,17 +12108,13 @@ msgstr "" msgid "List of edges that are needed to connect the graph." msgstr "" -msgid "" -"`Boost: make connected `__" +msgid "`Boost: make connected `__" msgstr "" msgid "``pgr_maxCardinalityMatch``" msgstr "" -msgid "" -"``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a " -"graph." +msgid "``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a graph." msgstr "" msgid "pgr_maxCardinalityMatch(text) returns only ``edge`` column." @@ -14248,14 +12129,10 @@ msgstr "" msgid "Renamed from ``pgr_maximumCardinalityMatching``" msgstr "" -msgid "" -"A matching or independent edge set in a graph is a set of edges without " -"common vertices." +msgid "A matching or independent edge set in a graph is a set of edges without common vertices." msgstr "" -msgid "" -"A maximum matching is a matching that contains the largest possible number " -"of edges." +msgid "A maximum matching is a matching that contains the largest possible number of edges." msgstr "" msgid "There may be many maximum matchings." @@ -14276,26 +12153,19 @@ msgstr "" msgid "Using all edges." msgstr "" -msgid "" -"SQL query, which should return a set of rows with the following columns:" +msgid "SQL query, which should return a set of rows with the following columns:" msgstr "" -msgid "" -"A positive value represents the existence of the edge (``source``, " -"``target``)." +msgid "A positive value represents the existence of the edge (``source``, ``target``)." msgstr "" -msgid "" -"A positive value represents the existence of the edge (``target``, " -"``source``)" +msgid "A positive value represents the existence of the edge (``target``, ``source``)" msgstr "" msgid "Identifier of the edge in the original query." msgstr "" -msgid "" -"`Boost: maximum_matching `__" +msgid "`Boost: maximum_matching `__" msgstr "" msgid "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" @@ -14307,9 +12177,7 @@ msgstr "" msgid "``pgr_maxFlow``" msgstr "" -msgid "" -"``pgr_maxFlow`` — Calculates the maximum flow in a directed graph from the " -"source(s) to the targets(s) using the Push Relabel algorithm." +msgid "``pgr_maxFlow`` — Calculates the maximum flow in a directed graph from the source(s) to the targets(s) using the Push Relabel algorithm." msgstr "" msgid "pgr_maxFlow(Combinations)" @@ -14318,8 +12186,7 @@ msgstr "" msgid "Calculates the maximum flow from the sources to the targets." msgstr "" -msgid "" -"When the maximum flow is **0** then there is no flow and **0** is returned." +msgid "When the maximum flow is **0** then there is no flow and **0** is returned." msgstr "" msgid "Uses the :doc:`pgr_pushRelabel ` algorithm." @@ -14349,21 +12216,16 @@ msgstr "" msgid "Maximum flow possible from the source(s) to the target(s)" msgstr "" -msgid "" -"`Boost: push relabel max flow `__" +msgid "`Boost: push relabel max flow `__" msgstr "" -msgid "" -"https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" +msgid "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" msgstr "" msgid "``pgr_maxFlowMinCost`` - Experimental" msgstr "" -msgid "" -"``pgr_maxFlowMinCost`` — Calculates the edges that minimizes the total cost " -"of the maximum flow on a graph" +msgid "``pgr_maxFlowMinCost`` — Calculates the edges that minimizes the total cost of the maximum flow on a graph" msgstr "" msgid "pgr_maxFlowMinCost(Combinations)" @@ -14390,9 +12252,7 @@ msgstr "" msgid "where :math:`U` is the value of the max flow." msgstr "" -msgid "" -":math:`U` is upper bound on number of iterations. In many real world cases " -"number of iterations is much smaller than :math:`U`." +msgid ":math:`U` is upper bound on number of iterations. In many real world cases number of iterations is much smaller than :math:`U`." msgstr "" msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vid**)" @@ -14416,9 +12276,7 @@ msgstr "" msgid "``pgr_maxFlowMinCost_Cost`` - Experimental" msgstr "" -msgid "" -"``pgr_maxFlowMinCost_Cost`` — Calculates the minimum total cost of the " -"maximum flow on a graph" +msgid "``pgr_maxFlowMinCost_Cost`` — Calculates the minimum total cost of the maximum flow on a graph" msgstr "" msgid "pgr_maxFlowMinCost_Cost(Combinations)" @@ -14460,9 +12318,7 @@ msgstr "" msgid "``pgr_pickDeliver`` - Pickup and delivery Vehicle Routing Problem" msgstr "" -msgid "" -"Problem: Distribute and optimize the pickup-delivery pairs into a fleet of " -"vehicles." +msgid "Problem: Distribute and optimize the pickup-delivery pairs into a fleet of vehicles." msgstr "" msgid "Optimization problem is NP-hard." @@ -14519,16 +12375,13 @@ msgstr "" msgid "The speed, max_cycles, ma_capacity have illegal values" msgstr "" -msgid "" -"Six different initial will be optimized - the best solution found will be " -"result" +msgid "Six different initial will be optimized - the best solution found will be result" msgstr "" msgid "Signature" msgstr "" -msgid "" -"pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" +msgid "pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" msgstr "" msgid "**options:** ``[factor, max_cycles, initial_sol]``" @@ -14573,8 +12426,7 @@ msgstr "" msgid "``pgr_pickDeliverEuclidean`` - Experimental" msgstr "" -msgid "" -"``pgr_pickDeliverEuclidean`` - Pickup and delivery Vehicle Routing Problem" +msgid "``pgr_pickDeliverEuclidean`` - Pickup and delivery Vehicle Routing Problem" msgstr "" msgid "Replaces ``pgr_gsoc_vrppdtw``" @@ -14628,9 +12480,7 @@ msgstr "" msgid "[ end_x, end_y, end_open, end_close, end_service ]" msgstr "" -msgid "" -"This data example **lc101** is from data published at https://www.sintef.no/" -"projectweb/top/pdptw/li-lim-benchmark/" +msgid "This data example **lc101** is from data published at https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/" msgstr "" msgid "There are 25 vehicles in the problem all with the same characteristics." @@ -14639,9 +12489,7 @@ msgstr "" msgid "The original orders" msgstr "" -msgid "" -"The data comes in different rows for the pickup and the delivery of the same " -"order." +msgid "The data comes in different rows for the pickup and the delivery of the same order." msgstr "" msgid "The original data needs to be converted to an appropriate table:" @@ -14650,10 +12498,7 @@ msgstr "" msgid "The query" msgstr "" -msgid "" -"Showing only the relevant information to compare with the best solution " -"information published on https://www.sintef.no/projectweb/top/pdptw/100-" -"customers/" +msgid "Showing only the relevant information to compare with the best solution information published on https://www.sintef.no/projectweb/top/pdptw/100-customers/" msgstr "" msgid "The best solution found for **lc101** is a travel time: 828.94" @@ -14665,13 +12510,10 @@ msgstr "" msgid "``pgr_prim``" msgstr "" -msgid "" -"``pgr_prim`` — Minimum spanning forest of a graph using Prim's algorithm." +msgid "``pgr_prim`` — Minimum spanning forest of a graph using Prim's algorithm." msgstr "" -msgid "" -"This algorithm finds the minimum spanning forest in a possibly disconnected " -"graph using Prim's algorithm." +msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Prim's algorithm." msgstr "" msgid "Prim's running time: :math:`O(E * log V)`" @@ -14683,19 +12525,13 @@ msgstr "" msgid "Minimum spanning forest of a subgraph" msgstr "" -msgid "" -"`Boost: Prim's algorithm documentation `__" +msgid "`Boost: Prim's algorithm documentation `__" msgstr "" -msgid "" -"``pgr_primBFS`` — Prim's algorithm for Minimum Spanning Tree with Depth " -"First Search ordering." +msgid "``pgr_primBFS`` — Prim's algorithm for Minimum Spanning Tree with Depth First Search ordering." msgstr "" -msgid "" -"Visits and extracts the nodes information in Breath First Search ordering of " -"the Minimum Spanning Tree created using Prims's algorithm." +msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." msgstr "" msgid "pgr_primBFS(`Edges SQL`_, **root vid**, [``max_depth``])" @@ -14707,10 +12543,7 @@ msgstr "" msgid "``pgr_primDD`` — Catchament nodes using Prim's algorithm." msgstr "" -msgid "" -"Using Prim's algorithm, extracts the nodes that have aggregate costs less " -"than or equal to a distance from a root vertex (or vertices) within the " -"calculated minimum spanning tree." +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 "" msgid "pgr_primDD(`Edges SQL`_, **root vid**, **distance**)" @@ -14719,14 +12552,10 @@ msgstr "" msgid "pgr_primDD(`Edges SQL`_, **root vids**, **distance**)" msgstr "" -msgid "" -"``pgr_primDFS`` — Prim algorithm for Minimum Spanning Tree with Depth First " -"Search ordering." +msgid "``pgr_primDFS`` — Prim algorithm for Minimum Spanning Tree with Depth First Search ordering." msgstr "" -msgid "" -"Visits and extracts the nodes information in Depth First Search ordering of " -"the Minimum Spanning Tree created using Prims's algorithm." +msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." msgstr "" msgid "pgr_primDFS(`Edges SQL`_, **root vid**, [``max_depth``])" @@ -14738,9 +12567,7 @@ msgstr "" msgid "``pgr_pushRelabel``" msgstr "" -msgid "" -"``pgr_pushRelabel`` — Calculates the flow on the graph edges that maximizes " -"the flow from the sources to the targets using Push Relabel Algorithm." +msgid "``pgr_pushRelabel`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Push Relabel Algorithm." msgstr "" msgid "pgr_pushRelabel(Combinations)" @@ -14768,9 +12595,7 @@ msgstr "" msgid "``pgr_separateCrossing``" msgstr ":doc:`pgr_bdAstarCost`" -msgid "" -"``pgr_separateCrossing`` - From crossing geometries generates geometries " -"that do not cross." +msgid "``pgr_separateCrossing`` - From crossing geometries generates geometries that do not cross." msgstr "" #, fuzzy @@ -14801,25 +12626,17 @@ msgstr "" msgid "Get the code for further refinement." msgstr "" -msgid "" -"When there are special details that need to be taken care of because of the " -"final application or the quality of the data, the code can be obtained On a " -"PostgreSQL ``NOTICE`` using the ``dryrun`` flag." +msgid "When there are special details that need to be taken care of because of the final application or the quality of the data, the code can be obtained On a PostgreSQL ``NOTICE`` using the ``dryrun`` flag." msgstr "" #, fuzzy msgid "``pgr_separateTouching``" msgstr ":doc:`pgr_bdAstarCost`" -msgid "" -"``pgr_separateTouching`` - From touching geometries generates geometries " -"that are properly connected at endpoints" +msgid "``pgr_separateTouching`` - From touching geometries generates geometries that are properly connected at endpoints" msgstr "" -msgid "" -"This is an auxiliary function for processing geometries that touch but don't " -"share exact endpoints, splitting them at their intersection points to " -"improve network connectivity." +msgid "This is an auxiliary function for processing geometries that touch but don't share exact endpoints, splitting them at their intersection points to improve network connectivity." msgstr "" msgid "pgr_separateTouching(`Edges SQL`_, [``tolerance``, ``dryrun``])" @@ -14828,22 +12645,16 @@ msgstr "" msgid "``pgr_sequentialVertexColoring`` - Proposed" msgstr "" -msgid "" -"``pgr_sequentialVertexColoring`` — Returns the vertex coloring of an " -"undirected graph, using greedy approach." +msgid "``pgr_sequentialVertexColoring`` — Returns the vertex coloring of an undirected graph, using greedy approach." msgstr "" -msgid "" -"Sequential vertex coloring algorithm is a graph coloring algorithm in which " -"color identifiers are assigned to the vertices of a graph in a sequential " -"manner, such that no edge connects two identically colored vertices." +msgid "Sequential vertex coloring algorithm is a graph coloring algorithm in which color identifiers are assigned to the vertices of a graph in a sequential manner, such that no edge connects two identically colored vertices." msgstr "" msgid "The implementation is applicable only for **undirected** graphs." msgstr "" -msgid "" -"Provides the color to be assigned to all the vertices present in the graph." +msgid "Provides the color to be assigned to all the vertices present in the graph." msgstr "" msgid "Color identifiers values are in the Range :math:`[1, |V|]`" @@ -14852,12 +12663,7 @@ msgstr "" msgid "The algorithm tries to assign the least possible color to every vertex." msgstr "" -msgid "" -"Efficient graph coloring is an NP-Hard problem, and therefore, this " -"algorithm does not always produce optimal coloring. It follows a greedy " -"strategy by iterating through all the vertices sequentially, and assigning " -"the smallest possible color that is not used by its neighbors, to each " -"vertex." +msgid "Efficient graph coloring is an NP-Hard problem, and therefore, this algorithm does not always produce optimal coloring. It follows a greedy strategy by iterating through all the vertices sequentially, and assigning the smallest possible color that is not used by its neighbors, to each vertex." msgstr "" msgid "The returned rows are ordered in ascending order of the vertex value." @@ -14875,9 +12681,7 @@ msgstr "" msgid "pgr_sequentialVertexColoring(`Edges SQL`_)" msgstr "" -msgid "" -"`Boost: Sequential Vertex Coloring `__" +msgid "`Boost: Sequential Vertex Coloring `__" msgstr "" #, fuzzy @@ -14885,36 +12689,25 @@ msgid "``pgr_sloanOrdering`` - Experimental" msgstr ":doc:`pgr_edwardMoore`" #, fuzzy -msgid "" -"``pgr_sloanOrdering`` — Returns the Sloan ordering of an undirected graph" +msgid "``pgr_sloanOrdering`` — Returns the Sloan ordering of an undirected graph" msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." -msgid "" -"The Sloan ordering algorithm reorders the vertices of a graph to reduce " -"bandwidth, profile, and wavefront properties, which is particularly useful " -"for sparse matrix computations and finite element analysis." +msgid "The Sloan ordering algorithm reorders the vertices of a graph to reduce bandwidth, profile, and wavefront properties, which is particularly useful for sparse matrix computations and finite element analysis." msgstr "" msgid "Finds a pseudoperipheral vertex pair to determine good starting points" msgstr "" -msgid "" -"Uses a priority-based algorithm that balances vertex degree and distance " -"from the start vertex." +msgid "Uses a priority-based algorithm that balances vertex degree and distance from the start vertex." msgstr "" -msgid "" -"Aims to minimize bandwidth (maximum difference between connected vertex " -"indices." +msgid "Aims to minimize bandwidth (maximum difference between connected vertex indices." msgstr "" -msgid "" -"Typically produces better orderings than simple breadth-first approaches." +msgid "Typically produces better orderings than simple breadth-first approaches." msgstr "" -msgid "" -"Time complexity: :math:`O(V² + E)` where V is the number of vertices and E " -"is the number of edges." +msgid "Time complexity: :math:`O(V² + E)` where V is the number of vertices and E is the number of edges." msgstr "" msgid "pgr_sloanOrdering(`Edges SQL`_)" @@ -14929,9 +12722,7 @@ msgstr "" msgid "Sloan ordering of Original graph from Boost example (vertices 0-9)." msgstr "" -msgid "" -"`Boost: Sloan Ordering `__" +msgid "`Boost: Sloan Ordering `__" msgstr "" #, fuzzy @@ -14944,23 +12735,10 @@ msgstr "" msgid "Version 3.0" msgstr "" -msgid "" -"In graph theory, the Stoer–Wagner algorithm is a recursive algorithm to " -"solve the minimum cut problem in undirected weighted graphs with non-" -"negative weights. The essential idea of this algorithm is to shrink the " -"graph by merging the most intensive vertices, until the graph only contains " -"two combined vertex sets. At each phase, the algorithm finds the minimum s-t " -"cut for two vertices s and t chosen as its will. Then the algorithm shrinks " -"the edge between s and t to search for non s-t cuts. The minimum cut found " -"in all phases will be the minimum weighted cut of the graph." +msgid "In graph theory, the Stoer–Wagner algorithm is a recursive algorithm to solve the minimum cut problem in undirected weighted graphs with non-negative weights. The essential idea of this algorithm is to shrink the graph by merging the most intensive vertices, until the graph only contains two combined vertex sets. At each phase, the algorithm finds the minimum s-t cut for two vertices s and t chosen as its will. Then the algorithm shrinks the edge between s and t to search for non s-t cuts. The minimum cut found in all phases will be the minimum weighted cut of the graph." msgstr "" -msgid "" -"A cut is a partition of the vertices of a graph into two disjoint subsets. A " -"minimum cut is a cut for which the size or weight of the cut is not larger " -"than the size of any other cut. For an unweighted graph, the minimum cut " -"would simply be the cut with the least edges. For a weighted graph, the sum " -"of all edges' weight on the cut determines whether it is a minimum cut." +msgid "A cut is a partition of the vertices of a graph into two disjoint subsets. A minimum cut is a cut for which the size or weight of the cut is not larger than the size of any other cut. For an unweighted graph, the minimum cut would simply be the cut with the least edges. For a weighted graph, the sum of all edges' weight on the cut determines whether it is a minimum cut." msgstr "" msgid "Sum of the weights of all edges between the two sets is mincut." @@ -14978,9 +12756,7 @@ msgstr "" msgid "When the graph is unconnected then EMPTY SET is return." msgstr "" -msgid "" -"Sometimes a graph has multiple min-cuts, but all have the same weight. The " -"this function determines exactly one of the min-cuts as well as its weight." +msgid "Sometimes a graph has multiple min-cuts, but all have the same weight. The this function determines exactly one of the min-cuts as well as its weight." msgstr "" msgid "Running time: :math:`O(V*E + V^2*log V)`." @@ -15019,9 +12795,7 @@ msgstr "" msgid "Using :doc:`pgr_connectedComponents`" msgstr "" -msgid "" -"`Boost: Stoer Wagner min cut `__" +msgid "`Boost: Stoer Wagner min cut `__" msgstr "" msgid "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" @@ -15030,14 +12804,10 @@ msgstr "" msgid "``pgr_strongComponents``" msgstr "" -msgid "" -"``pgr_strongComponents`` — Strongly connected components of a directed graph " -"using Tarjan's algorithm based on DFS." +msgid "``pgr_strongComponents`` — Strongly connected components of a directed graph using Tarjan's algorithm based on DFS." msgstr "" -msgid "" -"A strongly connected component of a directed graph is a set of vertices that " -"are all reachable from each other." +msgid "A strongly connected component of a directed graph is a set of vertices that are all reachable from each other." msgstr "" msgid "Works for **directed** graphs." @@ -15052,37 +12822,25 @@ msgstr "" msgid "The strong components of the graph" msgstr "" -msgid "" -"`Boost: Strong components `__" +msgid "`Boost: Strong components `__" msgstr "" -msgid "" -"wikipedia: `Strongly connected component `__" +msgid "wikipedia: `Strongly connected component `__" msgstr "" msgid "``pgr_topologicalSort`` - Experimental" msgstr "" -msgid "" -"``pgr_topologicalSort`` — Linear ordering of the vertices for directed " -"acyclic graphs (DAG)." +msgid "``pgr_topologicalSort`` — Linear ordering of the vertices for directed acyclic graphs (DAG)." msgstr "" -msgid "" -"The topological sort algorithm creates a linear ordering of the vertices " -"such that if edge :math:`(u,v)` appears in the graph, then :math:`v` comes " -"before :math:`u` in the ordering." +msgid "The topological sort algorithm creates a linear ordering of the vertices such that if edge :math:`(u,v)` appears in the graph, then :math:`v` comes before :math:`u` in the ordering." msgstr "" -msgid "" -"Process is valid for directed acyclic graphs only. otherwise it will throw " -"warnings." +msgid "Process is valid for directed acyclic graphs only. otherwise it will throw warnings." msgstr "" -msgid "" -"For optimization purposes, if there are more than one answer, the function" +msgid "For optimization purposes, if there are more than one answer, the function" msgstr "" msgid "will return one of them." @@ -15112,20 +12870,16 @@ msgstr "" msgid "Graph is not a DAG" msgstr "" -msgid "" -"`Boost: topological sort `__" +msgid "`Boost: topological sort `__" msgstr "" msgid "``pgr_transitiveClosure`` - Experimental" msgstr "" -msgid "" -"``pgr_transitiveClosure`` — Transitive closure graph of a directed graph." +msgid "``pgr_transitiveClosure`` — Transitive closure graph of a directed graph." msgstr "" -msgid "" -"Transforms the input directed graph into the transitive closure of the graph." +msgid "Transforms the input directed graph into the transitive closure of the graph." msgstr "" msgid "Process is valid for directed graphs." @@ -15134,9 +12888,7 @@ msgstr "" msgid "The transitive closure of an undirected graph produces a cluster graph" msgstr "" -msgid "" -"Reachability between vertices on an undirected graph happens when they " -"belong to the same connected component. (see :doc:`pgr_connectedComponents`)" +msgid "Reachability between vertices on an undirected graph happens when they belong to the same connected component. (see :doc:`pgr_connectedComponents`)" msgstr "" msgid "The returned values are not ordered" @@ -15172,9 +12924,7 @@ msgstr "" msgid "Identifiers of the vertices that are reachable from vertex v." msgstr "" -msgid "" -"`Boost: transitive closure `__" +msgid "`Boost: transitive closure `__" msgstr "" msgid "https://en.wikipedia.org/wiki/Transitive_closure" @@ -15224,14 +12974,10 @@ msgstr ":doc:`pgr_extractVertices`" msgid "pgr_trspViaEdges" msgstr ":doc:`pgr_trspVia`" -msgid "" -"Turn restricted shortest path (TRSP) is an algorithm that receives turn " -"restrictions in form of a query like those found in real world navigable " -"road networks." +msgid "Turn restricted shortest path (TRSP) is an algorithm that receives turn restrictions in form of a query like those found in real world navigable road networks." msgstr "" -msgid "" -"It does no guarantee the shortest path as it might contain restriction paths." +msgid "It does no guarantee the shortest path as it might contain restriction paths." msgstr "" msgid "The general algorithm is as follows:" @@ -15246,66 +12992,47 @@ msgstr "" msgid "Execute the **TRSP** algorithm with restrictions." msgstr "" -msgid "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, " -"[``directed``])" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vids**, " -"[``directed``])" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vid**, " -"[``directed``])" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, " -"[``directed``])" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" -msgid "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, " -"[``directed``])" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" msgid "From vertex :math:`6` to vertex :math:`10` on an undirected graph." msgstr "" -msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 1\\}` on an undirected graph." +msgid "From vertex :math:`6` to vertices :math:`\\{10, 1\\}` on an undirected graph." msgstr "" -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertex :math:`8` on a directed graph." +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`8` on a directed graph." msgstr "" -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 8\\}` on an " -"undirected graph." +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 8\\}` on an undirected graph." msgstr "" msgid "Using a combinations table on an undirected graph." msgstr "" -msgid "" -"`Deprecated documentation `_" +msgid "`Deprecated documentation `_" msgstr "" #, fuzzy msgid "``pgr_trspVia``" msgstr ":doc:`pgr_trspVia`" -msgid "" -"``pgr_trspVia`` Route that goes through a list of vertices with restrictions." +msgid "``pgr_trspVia`` Route that goes through a list of vertices with restrictions." msgstr "" -msgid "" -"Given a list of vertices and a graph, this function is equivalent to finding " -"the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :" -"math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." +msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." msgstr "" msgid "The paths represents the sections of the route." @@ -15314,8 +13041,7 @@ msgstr "" msgid "Execute a :doc:`pgr_dijkstraVia`." msgstr "" -msgid "" -"For the set of sub paths of the solution that pass through a restriction then" +msgid "For the set of sub paths of the solution that pass through a restriction then" msgstr "" msgid "Execute the **TRSP** algorithm with restrictions for the paths." @@ -15324,14 +13050,10 @@ msgstr "" msgid "**NOTE** when this is done, ``U_turn_on_edge`` flag is ignored." msgstr "" -msgid "" -"pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, " -"[**options**])" +msgid "pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, [**options**])" 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." +msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a directed graph." msgstr "" msgid "Simulation of how algorithm works." @@ -15340,18 +13062,13 @@ msgstr "" msgid "The algorithm performs a :doc:`pgr_dijkstraVia`" msgstr "" -msgid "" -"Detects which of the sub paths pass through a restriction in this case is " -"for the ``path_id = 5`` from ``6`` to ``3`` because the path :math:`15 " -"\\rightarrow 1` is restricted." +msgid "Detects which of the sub paths pass through a restriction in this case is for the ``path_id = 5`` from ``6`` to ``3`` because the path :math:`15 \\rightarrow 1` is restricted." msgstr "" msgid "Executes the :doc:`pgr_trsp` algorithm for the conflicting paths." msgstr "" -msgid "" -"From the :doc:`pgr_dijkstraVia` result it removes the conflicting paths and " -"builds the solution with the results of the :doc:`pgr_trsp` algorithm:" +msgid "From the :doc:`pgr_dijkstraVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" msgstr "" msgid "Getting the same result as ``pgr_trspVia``:" @@ -15363,20 +13080,13 @@ msgstr "" msgid "Sometimes ``U_turn_on_edge`` flag is ignored when is set to ``false``." msgstr "" -msgid "" -"The first step, doing a :doc:`pgr_dijkstraVia` does consider not making a U " -"turn on the same edge. But the path :math:`16 \\rightarrow 13` (Rows 4 and " -"5) is restricted and the result is using it." +msgid "The first step, doing a :doc:`pgr_dijkstraVia` does consider not making a U turn on the same edge. But the path :math:`16 \\rightarrow 13` (Rows 4 and 5) is restricted and the result is using it." msgstr "" -msgid "" -"When executing the :doc:`pgr_trsp` algorithm for the conflicting path, there " -"is no ``U_turn_on_edge`` flag." +msgid "When executing the :doc:`pgr_trsp` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." msgstr "" -msgid "" -"Therefore the result ignores the ``U_turn_on_edge`` flag when set to " -"``false``." +msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``." msgstr "" msgid ":doc:`via-category`" @@ -15386,17 +13096,10 @@ msgstr ":doc:`via-category`" msgid "``pgr_trspVia_withPoints``" msgstr ":doc:`pgr_trspVia_withPoints`" -msgid "" -"``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/" -"or points with restrictions." +msgid "``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/or points with restrictions." msgstr "" -msgid "" -"Given a graph, a set of restriction on the graph edges, a set of points on " -"the graphs edges and a list of vertices, this function is equivalent to " -"finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` " -"(where :math:`vertex` can be a vertex or a point on the graph) for all :math:" -"`i < size\\_of(via\\;vertices)` trying not to use restricted paths." +msgid "Given a graph, a set of restriction on the graph edges, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." msgstr "" msgid "is a sequence of paths" @@ -15414,8 +13117,7 @@ msgstr "" msgid "Execute a :doc:`pgr_withPointsVia`." msgstr "" -msgid "" -"For the set of paths of the solution that pass through a restriction then" +msgid "For the set of paths of the solution that pass through a restriction then" msgstr "" msgid "Execute the **TRSP** algorithm with restrictions for the path." @@ -15424,17 +13126,13 @@ msgstr "" msgid "Do not use negative values on identifiers of the inner queries." msgstr "" -msgid "" -"pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**via vertices**, [**driving side**,] [**options**])" +msgid "pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, [**driving side**,] [**options**])" msgstr "" msgid "**options:** ``[directed, strict, U_turn_on_edge, details]``" msgstr "" -msgid "" -"Find the route that visits the vertices :math:`\\{-6, 15, -5\\}` in that " -"order on an directed graph." +msgid "Find the route that visits the vertices :math:`\\{-6, 15, -5\\}` in that order on an directed graph." msgstr "" msgid "When positive it is considered a vertex identifier" @@ -15446,9 +13144,7 @@ msgstr "" msgid "[**driving side**]" msgstr "" -msgid "" -"Value in [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] indicating if the " -"driving side is:" +msgid "Value in [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] indicating if the driving side is:" msgstr "" #, fuzzy @@ -15491,13 +13187,10 @@ msgstr "" msgid "When ``true`` the results will include the points that are in the path." msgstr "" -msgid "" -"When ``false`` the results will not include the points that are in the path." +msgid "When ``false`` the results will not include the points that are in the path." msgstr "" -msgid "" -"When ``start_vid``, ``end_vid`` and ``node`` columns have negative values, " -"the identifier is for a Point." +msgid "When ``start_vid``, ``end_vid`` and ``node`` columns have negative values, the identifier is for a Point." msgstr "" msgid "Use ``pgr_findCloseEdges`` for points on the fly" @@ -15506,30 +13199,22 @@ msgstr "" msgid "Using :doc:`pgr_findCloseEdges`:" msgstr "" -msgid "" -"Visit from vertex :math:`1` to the two locations on the graph of point " -"`(2.9, 1.8)` in order of closeness to the graph." +msgid "Visit from vertex :math:`1` to the two locations on the graph of point `(2.9, 1.8)` in order of closeness to the graph." msgstr "" -msgid "" -"Point :math:`-1` corresponds to the closest edge from point `(2.9, 1.8)`." +msgid "Point :math:`-1` corresponds to the closest edge from point `(2.9, 1.8)`." msgstr "" -msgid "" -"Point :math:`-2` corresponds to the next close edge from point `(2.9, 1.8)`." +msgid "Point :math:`-2` corresponds to the next close edge from point `(2.9, 1.8)`." msgstr "" -msgid "" -"Point :math:`-2` is visited on the route to from vertex :math:`1` to Point :" -"math:`-1` (See row where :math:`seq = 4`)." +msgid "Point :math:`-2` is visited on the route to from vertex :math:`1` to Point :math:`-1` (See row where :math:`seq = 4`)." msgstr "" msgid "Usage variations" msgstr "" -msgid "" -"All this examples are about the route that visits the vertices :math:`\\{-6, " -"7, -4, 8, -2\\}` in that order on a directed graph." +msgid "All this examples are about the route that visits the vertices :math:`\\{-6, 7, -4, 8, -2\\}` in that order on a directed graph." msgstr "" msgid "Status of \"passes in front\" or \"visits\" of the nodes and points." @@ -15538,40 +13223,25 @@ msgstr "" msgid "The algorithm performs a :doc:`pgr_withPointsVia`" msgstr "" -msgid "" -"Detects which of the paths pass through a restriction in this case is for " -"the ``path_id = 1`` from ``-6`` to ``15`` because the path :math:`9 " -"\\rightarrow 16` is restricted." +msgid "Detects which of the paths pass through a restriction in this case is for the ``path_id = 1`` from ``-6`` to ``15`` because the path :math:`9 \\rightarrow 16` is restricted." msgstr "" -msgid "" -"Executes the :ref:`TRSP-family:TRSP algorithm` for the conflicting paths." +msgid "Executes the :ref:`TRSP-family:TRSP algorithm` for the conflicting paths." msgstr "" -msgid "" -"From the :doc:`pgr_withPointsVia` result it removes the conflicting paths " -"and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" +msgid "From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" msgstr "" msgid "Getting the same result as ``pgr_trspVia_withPoints``:" msgstr "" -msgid "" -"The first step, doing a :doc:`pgr_withPointsVia` does consider not making a " -"U turn on the same edge. But the path :math:`9 \\rightarrow 16` (Rows 4 and " -"5) is restricted and the result is using it." +msgid "The first step, doing a :doc:`pgr_withPointsVia` does consider not making a U turn on the same edge. But the path :math:`9 \\rightarrow 16` (Rows 4 and 5) is restricted and the result is using it." msgstr "" -msgid "" -"When executing the :doc:`pgr_trsp_withPoints` algorithm for the conflicting " -"path, there is no ``U_turn_on_edge`` flag." +msgid "When executing the :doc:`pgr_trsp_withPoints` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." msgstr "" -msgid "" -"Therefore the result ignores the ``U_turn_on_edge`` flag when set to " -"``false``. From the :doc:`pgr_withPointsVia` result it removes the " -"conflicting paths and builds the solution with the results of the :doc:" -"`pgr_trsp` algorithm. In this case a U turn is been done using the same edge." +msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``. From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm. In this case a U turn is been done using the same edge." msgstr "" msgid "``pgr_trsp_withPoints``" @@ -15580,10 +13250,7 @@ msgstr "" msgid "``pgr_trsp_withPoints`` Routing Vertex/Point with restrictions." msgstr "" -msgid "" -"Modify the graph to include points defined by `Points SQL`_. Consider the " -"invalid paths on `Restrictions SQL`_. Using Dijkstra algorithm, find the " -"shortest path." +msgid "Modify the graph to include points defined by `Points SQL`_. Consider the invalid paths on `Restrictions SQL`_. Using Dijkstra algorithm, find the shortest path." msgstr "" msgid "Vertices of the graph are:" @@ -15602,82 +13269,55 @@ msgid "The `agg_cost` in the non included values `(u, v)` is :math:`\\infty`" msgstr "" #, fuzzy -msgid "" -"For optimization purposes, any duplicated value in the input arrays of " -"**start vids** or **end vids** or are ignored." +msgid "For optimization purposes, any duplicated value in the input arrays of **start vids** or **end vids** or are ignored." msgstr "최적화를 위해 중복값은 무시됩니다." msgid "Running time: :math:`O(|start\\_vids|\\times(V \\log V + E))`" msgstr "" -msgid "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**start vid**, **end vid**, [**driving side**,] [**options**])" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**,] [**options**])" msgstr "" -msgid "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**start vid**, **end vids**, [**driving side**,] [**options**])" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**,] [**options**])" msgstr "" -msgid "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**start vids**, **end vid**, [**driving side**,] [**options**])" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**,] [**options**])" msgstr "" -msgid "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**start vids**, **end vids**, [**driving side**,] [**options**])" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**,] [**options**])" msgstr "" -msgid "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"`Combinations SQL`_, [**driving side**,] [**options**])" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**,] [**options**])" msgstr "" msgid "**options:** ``[directed, details]``" msgstr "" -msgid "" -"From point :math:`1` to vertex :math:`10` with right driving side in " -"directed graph. (with details)" +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (with details)" msgstr "" -msgid "" -"From point :math:`1` to point :math:`3` and vertex :math:`7` on an " -"undirected graph" +msgid "From point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" msgstr "" -msgid "" -"From point :math:`1` and vertex :math:`6` to point :math:`3` with right " -"driving side in directed graph. (without details)" +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph. (without details)" msgstr "" -msgid "" -"From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :" -"math:`1` with left side driving." +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` with left side driving." msgstr "" msgid "Two combinations" msgstr "" -msgid "" -"From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to " -"point :math:`3` with right side driving. (with details)" +msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving. (with details)" msgstr "" msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_." msgstr "" -msgid "" -"Find the routes from vertex :math:`1` to the two closest locations on the " -"graph of point `(2.9, 1.8)`." +msgid "Find the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." msgstr "" -msgid "" -"All the examples are about traveling from point :math:`1` and vertex :math:" -"`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}` with " -"restrictions" +msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}` with restrictions" msgstr "" msgid "Passes in front or visits with right side driving." @@ -15692,19 +13332,13 @@ msgstr "" msgid "``pgr_turnRestrictedPath`` - Experimental" msgstr "" -msgid "" -"``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex - Vertex routing " -"with restrictions" +msgid "``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex - Vertex routing with restrictions" 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" +msgid "Using Yen's algorithm to obtain K shortest paths and analyze the paths to select the paths that do not use the restrictions" msgstr "" -msgid "" -"pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, " -"**end vid**, **K**, [**options**])" +msgid "pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, **K**, [**options**])" msgstr "" msgid "**options:** ``[directed, heap_paths, stop_on_first, strict]``" @@ -15719,8 +13353,7 @@ msgstr "" msgid "``stop_on_first``" msgstr "" -msgid "" -"When ``true`` stops on first path found that dos not violate restrictions" +msgid "When ``true`` stops on first path found that dos not violate restrictions" msgstr "" msgid "When ``false`` returns at most K paths" @@ -15780,94 +13413,61 @@ msgstr "" msgid "TBD" msgstr "" -msgid "" -"``pgr_withPoints`` - Returns the shortest path in a graph with additional " -"temporary vertices." +msgid "``pgr_withPoints`` - Returns the shortest path in a graph with additional temporary vertices." msgstr "" msgid "pgr_withPoints(Combinations)" msgstr "" -msgid "" -"Modify the graph to include points defined by `Points SQL`_. Using Dijkstra " -"algorithm, find the shortest path." +msgid "Modify the graph to include points defined by `Points SQL`_. Using Dijkstra algorithm, find the shortest path." msgstr "" -msgid "" -"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, " -"[**driving side**] [**options**])" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" msgstr "" -msgid "" -"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, " -"[**driving side**] [**options**])" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" msgstr "" -msgid "" -"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, " -"[**driving side**] [**options**])" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" msgstr "" -msgid "" -"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, " -"[**driving side**] [**options**])" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" msgstr "" -msgid "" -"pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving " -"side**] [**options**])" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" msgstr "" msgid "**options:** ``[directed, details])``" msgstr "" -msgid "" -"From point :math:`1` to vertex :math:`10` with right driving side in " -"directed graph. (without details)" +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (without details)" msgstr "" -msgid "" -"Identifier of the starting vertex of the path. Negative value is for point’s " -"identifier." +msgid "Identifier of the starting vertex of the path. Negative value is for point’s identifier." msgstr "" -msgid "" -"Array of identifiers of starting vertices. Negative values are for point’s " -"identifiers." +msgid "Array of identifiers of starting vertices. Negative values are for point’s identifiers." msgstr "" -msgid "" -"Identifier of the ending vertex of the path. Negative value is for point’s " -"identifier." +msgid "Identifier of the ending vertex of the path. Negative value is for point’s identifier." msgstr "" -msgid "" -"Array of identifiers of ending vertices. Negative values are for point’s " -"identifiers." +msgid "Array of identifiers of ending vertices. Negative values are for point’s identifiers." msgstr "" -msgid "" -"All the examples are about traveling from point :math:`1` and vertex :math:" -"`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" +msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" msgstr "" -msgid "" -"``pgr_withPointsCost`` - Calculates the shortest path and returns only the " -"aggregate cost of the shortest path found, for the combination of points " -"given." +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 "" msgid "pgr_withPointsCost(Combinations)" msgstr "" -msgid "" -"Modify the graph to include points defined by points_sql. Using Dijkstra " -"algorithm, return only the aggregate cost of the shortest path found." +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 "" -msgid "" -"Returns the sum of the costs of the shortest path for pair combination of " -"vertices in the modified graph." +msgid "Returns the sum of the costs of the shortest path for pair combination of vertices in the modified graph." msgstr "" msgid "The returned values are in the form of a set of |matrix-result|." @@ -15879,65 +13479,43 @@ msgstr "" msgid "**negative** when it belongs to the points_sql" msgstr "" -msgid "" -"If the values returned are stored in a table, the unique index would be the " -"pair: `(start_vid, end_vid)`." +msgid "If the values returned are stored in a table, the unique index would be the pair: `(start_vid, end_vid)`." msgstr "" msgid "For **undirected** graphs, the results are **symmetric**." msgstr "" -msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, " -"[**driving side**] [**options**])" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" msgstr "" -msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, " -"[**driving side**] [**options**])" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" msgstr "" -msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, " -"[**driving side**] [**options**])" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" msgstr "" -msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end " -"vids**, [**driving side**] [**options**])" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" msgstr "" -msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, " -"[**driving side**] [**options**])" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" msgstr "" msgid "**options:** ``[directed]``" msgstr "" -msgid "" -"There is no **details** flag, unlike the other members of the withPoints " -"family of functions." +msgid "There is no **details** flag, unlike the other members of the withPoints family of functions." msgstr "" -msgid "" -"From point :math:`1` to vertex :math:`10` with right driving side in " -"directed graph." +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph." msgstr "" -msgid "" -"From point :math:`1` and vertex :math:`6` to point :math:`3` with right " -"driving side in directed graph." +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph." msgstr "" -msgid "" -"From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to " -"point :math:`3` with right side driving." +msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving." msgstr "" -msgid "" -"Find the cost of the routes from vertex :math:`1` to the two closest " -"locations on the graph of point `(2.9, 1.8)`." +msgid "Find the cost of the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." msgstr "" msgid "Being close to the graph does not mean have a shorter route." @@ -15946,9 +13524,7 @@ msgstr "" msgid "Right side driving topology" msgstr "" -msgid "" -"Traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, " -"3, 6\\}` and vertices :math:`\\{10, 11\\}`" +msgid "Traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" msgstr "" msgid "Left side driving topology" @@ -15957,19 +13533,13 @@ msgstr "" msgid "Does not matter driving side driving topology" msgstr "" -msgid "" -"``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:" -"`pgr_withPoints`." +msgid "``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:`pgr_withPoints`." msgstr "" -msgid "" -"pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, " -"[**driving side**] [**options**])" +msgid "pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, [**driving side**] [**options**])" msgstr "" -msgid "" -"Cost matrix for points :math:`\\{1, 6\\}` and vertices :math:`\\{10, 11\\}` " -"on an **undirected** graph" +msgid "Cost matrix for points :math:`\\{1, 6\\}` and vertices :math:`\\{10, 11\\}` on an **undirected** graph" msgstr "" msgid "Returning a **symmetrical** cost matrix" @@ -15981,14 +13551,10 @@ msgstr "" msgid "Using the default ``driving side`` value" msgstr "" -msgid "" -"Find the matrix cost of the routes from vertex :math:`1` and the two closest " -"locations on the graph of point `(2.9, 1.8)`." +msgid "Find the matrix cost of the routes from vertex :math:`1` and the two closest locations on the graph of point `(2.9, 1.8)`." msgstr "" -msgid "" -"``pgr_withPointsDD`` - Returns the driving **distance** from a starting " -"point." +msgid "``pgr_withPointsDD`` - Returns the driving **distance** from a starting point." msgstr "" msgid "Output columns standardized to |result-spantree|" @@ -16003,21 +13569,13 @@ msgstr "" msgid "Deprecated signatures:" msgstr "" -msgid "" -"Modify the graph to include points and using Dijkstra algorithm, extracts " -"all the nodes and points that have costs less than or equal to the value " -"``**distance**`` from the starting point. The edges extracted will conform " -"the corresponding spanning tree." +msgid "Modify the graph to include points and using Dijkstra algorithm, extracts all the nodes and points that have costs less than or equal to the value ``**distance**`` from the starting point. The edges extracted will conform the corresponding spanning tree." msgstr "" -msgid "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, " -"[**driving side**], [**options A**])" +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options A**])" msgstr "" -msgid "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, " -"[**driving side**], [**options B**])" +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options B**])" msgstr "" msgid "**options A:** ``[directed, details]``" @@ -16026,61 +13584,44 @@ msgstr "" msgid "**options B:** ``[directed, details, equicost]``" msgstr "" -msgid "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, " -"[**driving side**], [**options**])" +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options**])" msgstr "" -msgid "" -"Right side driving topology, from point :math:`1` within a distance of :math:" -"`3.3` with details." +msgid "Right side driving topology, from point :math:`1` within a distance of :math:`3.3` with details." msgstr "" -msgid "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, " -"[**driving side**], [**options**])" +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options**])" msgstr "" msgid "**options:** ``[directed, details, equicost]``" msgstr "" -msgid "" -"From point :math:`1` and vertex :math:`16` within a distance of :math:`3.3` " -"with ``equicost`` on a directed graph" +msgid "From point :math:`1` and vertex :math:`16` within a distance of :math:`3.3` with ``equicost`` on a directed graph" msgstr "" msgid "Negative values represent a point" msgstr "" -msgid "" -"Find the driving distance from the two closest locations on the graph of " -"point `(2.9, 1.8)`." +msgid "Find the driving distance from the two closest locations on the graph of point `(2.9, 1.8)`." msgstr "" -msgid "" -"Point :math:`-1` corresponds to the closest edge from point :math:`(2.9, " -"1.8)`." +msgid "Point :math:`-1` corresponds to the closest edge from point :math:`(2.9, 1.8)`." msgstr "" -msgid "" -"Point :math:`-2` corresponds to the next close edge from point :math:`(2.9, " -"1.8)`." +msgid "Point :math:`-2` corresponds to the next close edge from point :math:`(2.9, 1.8)`." msgstr "" msgid "Driving side does not matter" msgstr "" -msgid "" -"From point :math:`1` within a distance of :math:`3.3`, does not matter " -"driving side, with details." +msgid "From point :math:`1` within a distance of :math:`3.3`, does not matter driving side, with details." msgstr "" #, fuzzy msgid "``pgr_withPointsKSP``" msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "" -"``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." +msgid "``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." msgstr "" #, fuzzy @@ -16099,42 +13640,28 @@ msgstr ":doc:`pgr_withPointsCostMatrix`" msgid "pgr_withPointsKSP(Combinations)" msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "" -"Modifies the graph to include the points defined in the `Points SQL`_ and " -"using Yen algorithm, finds the :math:`K` shortest paths." +msgid "Modifies the graph to include the points defined in the `Points SQL`_ and using Yen algorithm, finds the :math:`K` shortest paths." msgstr "" -msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, " -"**K**, [**driving side**], [**options**])" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, [**driving side**], [**options**])" msgstr "" -msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, " -"**K**, [**driving side**], [**options**])" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, [**driving side**], [**options**])" msgstr "" -msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, " -"**K**, [**driving side**], [**options**])" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, [**driving side**], [**options**])" msgstr "" -msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, " -"**K**, [**driving side**], [**options**])" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, [**driving side**], [**options**])" msgstr "" -msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, " -"[**driving side**], [**options**])" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, [**driving side**], [**options**])" msgstr "" msgid "**options:** ``[directed, heap_paths, details]``" msgstr "" -msgid "" -"Get 2 paths from Point :math:`1` to point :math:`2` on a directed graph with " -"**left** side driving." +msgid "Get 2 paths from Point :math:`1` to point :math:`2` on a directed graph with **left** side driving." msgstr "" msgid "For a directed graph." @@ -16146,21 +13673,13 @@ msgstr "" msgid "No heap paths are returned." msgstr "" -msgid "" -"Get 2 paths from point :math:`1` to point :math:`3` and vertex :math:`7` on " -"an undirected graph" +msgid "Get 2 paths from point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" msgstr "" -msgid "" -"Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` on a " -"**directed** graph with **right** side driving and **details** set to " -"**True**" +msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` on a **directed** graph with **right** side driving and **details** set to **True**" msgstr "" -msgid "" -"Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` and " -"vertex :math:`1` on a **directed** graph with **left** side driving and " -"**heap_paths** set to **True**" +msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` on a **directed** graph with **left** side driving and **heap_paths** set to **True**" msgstr "" msgid "Using a combinations table on an **directed** graph" @@ -16172,102 +13691,65 @@ msgstr "" msgid "withPointsKSP optional parameters" msgstr "" -msgid "" -"Get :math:`2` paths using left side driving topology, from vertex :math:`1` " -"to the closest location on the graph of point `(2.9, 1.8)`." +msgid "Get :math:`2` paths using left side driving topology, from vertex :math:`1` to the closest location on the graph of point `(2.9, 1.8)`." msgstr "" 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." +msgid "Get :math:`2` paths using left side driving topology, from point :math:`1` to point :math:`3` with details." msgstr "" msgid "Right driving side" msgstr "" -msgid "" -"Get :math:`2` paths using right side driving topology from, point :math:`1` " -"to point :math:`2` with heap paths and details." +msgid "Get :math:`2` paths using right side driving topology from, point :math:`1` to point :math:`2` with heap paths and details." msgstr "" #, fuzzy msgid "``pgr_withPointsVia``" msgstr ":doc:`pgr_withPointsVia`" -msgid "" -"``pgr_withPointsVia`` - Route that goes through a list of vertices and/or " -"points." +msgid "``pgr_withPointsVia`` - Route that goes through a list of vertices and/or points." msgstr "" -msgid "" -"Given a graph, a set of points on the graphs edges and a list of vertices, " -"this function is equivalent to finding the shortest path between :math:" -"`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or " -"a point on the graph) for all :math:`i < size\\_of(via\\;vertices)`." +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 "" -msgid "" -"pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, [**driving " -"side**] [**options**])" +msgid "pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, [**driving side**] [**options**])" msgstr "" -msgid "" -"Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that " -"order with right driving side in directed graph.." +msgid "Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that order with right driving side in directed graph.." msgstr "" msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_" msgstr "" -msgid "" -"All this examples are about the route that visits the vertices :math:`\\{-1, " -"7, -3, 16, 15\\}` in that order on a **directed** graph." +msgid "All this examples are about the route that visits the vertices :math:`\\{-1, 7, -3, 16, 15\\}` in that order on a **directed** graph." msgstr "" msgid "Prim - Family of functions" msgstr "" -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." +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 "" -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 "This algorithms find the minimum spanning forest in a possibly disconnected graph; in contrast, the most basic form of Prim's algorithm only finds minimum spanning trees in connected graphs. However, running Prim's algorithm separately for each connected component of the graph, then it is called minimum spanning forest." msgstr "" -msgid "" -"From boost Graph: \"The algorithm as implemented in Boost.Graph does not " -"produce correct results on graphs with parallel edges.\"" +msgid "From boost Graph: \"The algorithm as implemented in Boost.Graph does not produce correct results on graphs with parallel edges.\"" msgstr "" -msgid "" -"Boost: `Prim's algorithm `__" +msgid "Boost: `Prim's algorithm `__" msgstr "" -msgid "" -"Wikipedia: `Prim's algorithm `__" +msgid "Wikipedia: `Prim's algorithm `__" msgstr "" msgid "Proposed Functions" msgstr "" -msgid "" -":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." +msgid ":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." msgstr "" msgid "Reference" @@ -16276,9 +13758,7 @@ msgstr "" msgid "Release Notes" msgstr "" -msgid "" -"To see the full list of changes check the list of `Git commits `_ on Github." +msgid "To see the full list of changes check the list of `Git commits `_ on Github." msgstr "" msgid "Mayors" @@ -16290,7 +13770,16 @@ msgstr "" msgid "Minors 4.x" msgstr "" -msgid "pgRouting 4.0" +msgid "pgRouting 4.1" +msgstr "" + +msgid "pgRouting 4.1.0 Release Notes" +msgstr "" + +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.1.0 `__" +msgstr "" + +msgid "No changes yet" msgstr "" msgid "pgRouting 3" @@ -16305,10 +13794,7 @@ msgstr "" msgid "pgRouting 3.8.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.8.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.8.0 `__" msgstr "" msgid "Promotion to official function of pgRouting." @@ -16317,32 +13803,22 @@ msgstr "" msgid "Metric" msgstr "" -msgid "" -"`#2760 `__: Promoted to " -"official pgr_degree in version 3.8" +msgid "`#2760 `__: Promoted to official pgr_degree in version 3.8" msgstr "" msgid "Utilities" msgstr "" -msgid "" -"`#2772 `__: Promoted to " -"official pgr_extractVertices in version 3.8" +msgid "`#2772 `__: Promoted to official pgr_extractVertices in version 3.8" msgstr "" -msgid "" -"`#2774 `__: Promoted to " -"official pgr_findCloseEdges in version 3.8" +msgid "`#2774 `__: Promoted to official pgr_findCloseEdges in version 3.8" msgstr "" -msgid "" -"`#2873 `__: Promoted to " -"official pgr_separateCrossing in version 3.8" +msgid "`#2873 `__: Promoted to official pgr_separateCrossing in version 3.8" msgstr "" -msgid "" -"`#2874 `__: Promoted to " -"official pgr_separateTouching in version 3.8" +msgid "`#2874 `__: Promoted to official pgr_separateTouching in version 3.8" msgstr "" #, fuzzy @@ -16353,45 +13829,31 @@ msgstr ":doc:`routingFunctions`" msgid "Contraction" msgstr "소개" -msgid "" -"`#2790 `__: " -"pgr_contractionDeadEnd new contraction function" +msgid "`#2790 `__: pgr_contractionDeadEnd new contraction function" msgstr "" -msgid "" -"`#2791 `__: " -"pgr_contractionLinear new contraction function" +msgid "`#2791 `__: pgr_contractionLinear new contraction function" msgstr "" -msgid "" -"`#2536 `__: Support for " -"contraction hierarchies (pgr_contractionHierarchies)" +msgid "`#2536 `__: Support for contraction hierarchies (pgr_contractionHierarchies)" msgstr "" -msgid "" -"`#2848 `__: Create " -"pgr_separateCrossing new utility function" +msgid "`#2848 `__: Create pgr_separateCrossing new utility function" msgstr "" -msgid "" -"`#2849 `__: Create of " -"pgr_separateTouching new utility function" +msgid "`#2849 `__: Create of pgr_separateTouching new utility function" msgstr "" msgid "Official functions changes" msgstr "" -msgid "" -"`#2786 `__: " -"pgr_contraction(edges) new signature" +msgid "`#2786 `__: pgr_contraction(edges) new signature" msgstr "" msgid "C/C++ code enhancements" msgstr "" -msgid "" -"`#2802 `__: Code " -"reorganization on pgr_contraction" +msgid "`#2802 `__: Code reorganization on pgr_contraction" msgstr "" msgid "Other enhancements:" @@ -16403,38 +13865,26 @@ msgstr "" msgid "SQL code enhancements" msgstr "" -msgid "" -"`#2850 `__: Rewrite " -"pgr_nodeNetwork" +msgid "`#2850 `__: Rewrite pgr_nodeNetwork" msgstr "" #, fuzzy msgid "Deprecation of SQL functions" msgstr ":doc:`pgr_withPoints`" -msgid "" -"`#2749 `__: Deprecate " -"pgr_AlphaShape in 3.8" +msgid "`#2749 `__: Deprecate pgr_AlphaShape in 3.8" msgstr "" -msgid "" -"`#2750 `__: Deprecate " -"pgr_CreateTopology in 3.8" +msgid "`#2750 `__: Deprecate pgr_CreateTopology in 3.8" msgstr "" -msgid "" -"`#2753 `__: Deprecate " -"pgr_analyzeGraph in 3.8" +msgid "`#2753 `__: Deprecate pgr_analyzeGraph in 3.8" msgstr "" -msgid "" -"`#2754 `__: Deprecate " -"pgr_analyzeOneWay in 3.8" +msgid "`#2754 `__: Deprecate pgr_analyzeOneWay in 3.8" msgstr "" -msgid "" -"`#2826 `__: Deprecate " -"pgr_createVerticesTable in 3.8" +msgid "`#2826 `__: Deprecate pgr_createVerticesTable in 3.8" msgstr "" #, fuzzy @@ -16453,29 +13903,19 @@ msgstr "" msgid "pgRouting 3.7.3 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.7.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.3 `__" msgstr "" -msgid "" -"`#2731 `__: Build " -"Failure on Ubuntu 22" +msgid "`#2731 `__: Build Failure on Ubuntu 22" msgstr "" msgid "pgRouting 3.7.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.7.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.2 `__" msgstr "" -msgid "" -"`#2713 `__: cmake " -"missing some policies and min version" +msgid "`#2713 `__: cmake missing some policies and min version" msgstr "" msgid "Using OLD policies: CMP0148, CMP0144, CMP0167" @@ -16484,33 +13924,22 @@ msgstr "" msgid "Minimum cmake version 3.12" msgstr "" -msgid "" -"`#2707 `__: Build " -"failure in pgRouting 3.7.1 on Alpine" +msgid "`#2707 `__: Build failure in pgRouting 3.7.1 on Alpine" msgstr "" -msgid "" -"`#2706 `__: winnie " -"crashing on pgr_betweennessCentrality" +msgid "`#2706 `__: winnie crashing on pgr_betweennessCentrality" msgstr "" msgid "pgRouting 3.7.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.7.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.1 `__" msgstr "" -msgid "" -"`#2680 `__: fails to " -"compile under mingw64 gcc 13.2" +msgid "`#2680 `__: fails to compile under mingw64 gcc 13.2" msgstr "" -msgid "" -"`#2689 `__: When point " -"is a vertex, the withPoints family do not return results." +msgid "`#2689 `__: When point is a vertex, the withPoints family do not return results." msgstr "" msgid "C/C++ code enhancemet" @@ -16523,18 +13952,13 @@ msgstr ":doc:`TRSP-family`" msgid "pgRouting 3.7.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.7.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.0 `__" msgstr "" msgid "Support" msgstr "" -msgid "" -"`#2656 `__: Stop support " -"of PostgreSQL12 on pgrouting v3.7" +msgid "`#2656 `__: Stop support of PostgreSQL12 on pgrouting v3.7" msgstr "" #, fuzzy @@ -16547,9 +13971,7 @@ msgstr "" msgid "pgr_betweennessCentrality" msgstr "" -msgid "" -"`#2605 `__: Standardize " -"spanning tree functions output" +msgid "`#2605 `__: Standardize spanning tree functions output" msgstr "" msgid "Functions:" @@ -16558,9 +13980,7 @@ msgstr "" msgid "Experimental promoted to proposed." msgstr "" -msgid "" -"`#2635 `__: " -"pgr_LineGraph ignores directed flag and use negative values for identifiers." +msgid "`#2635 `__: pgr_LineGraph ignores directed flag and use negative values for identifiers." msgstr "" #, fuzzy @@ -16570,19 +13990,13 @@ msgstr ":doc:`pgr_analyzeGraph`" msgid "Code enhancement" msgstr "" -msgid "" -"`#2599 `__: Driving " -"distance cleanup" +msgid "`#2599 `__: Driving distance cleanup" msgstr "" -msgid "" -"`#2607 `__: Read " -"postgresql data on C++" +msgid "`#2607 `__: Read postgresql data on C++" msgstr "" -msgid "" -"`#2614 `__: Clang tidy " -"does not work" +msgid "`#2614 `__: Clang tidy does not work" msgstr "" msgid "pgRouting 3.6" @@ -16591,10 +14005,7 @@ msgstr "" msgid "pgRouting 3.6.3 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.6.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.3 `__" msgstr "" msgid "Explicit minimum requirements:" @@ -16624,9 +14035,7 @@ msgstr "" msgid "Add a clang tidy test on changed files." msgstr "" -msgid "" -"Update test not done on versions: 3.0.1, 3.0.2, 3.0.3, 3.0.4, 3.1.0, 3.1.1, " -"3.1.2" +msgid "Update test not done on versions: 3.0.1, 3.0.2, 3.0.3, 3.0.4, 3.1.0, 3.1.1, 3.1.2" msgstr "" msgid "Documentation" @@ -16648,10 +14057,7 @@ msgstr "빌드" msgid "pgRouting 3.6.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.6.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.2 `__" msgstr "" msgid "Upgrade fix" @@ -16675,110 +14081,73 @@ msgstr "" msgid "pgRouting 3.6.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.6.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.1 `__" msgstr "" -msgid "" -"`#2588 `__: pgrouting " -"3.6.0 fails to build on OSX" +msgid "`#2588 `__: pgrouting 3.6.0 fails to build on OSX" msgstr "" msgid "pgRouting 3.6.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.6.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.0 `__" msgstr "" -msgid "" -"`#2516 `__: Standardize " -"output pgr_aStar" +msgid "`#2516 `__: Standardize output pgr_aStar" msgstr "" msgid "Standardize output columns to |short-generic-result|" msgstr "" -msgid "" -"`#2523 `__: Standardize " -"output pgr_bdAstar" +msgid "`#2523 `__: Standardize output pgr_bdAstar" msgstr "" -msgid "" -"`#2547 `__: Standardize " -"output and modifying signature pgr_KSP" +msgid "`#2547 `__: Standardize output and modifying signature pgr_KSP" msgstr "" -msgid "" -"`#2548 `__: Standardize " -"output pgr_drivingDistance" +msgid "`#2548 `__: Standardize output pgr_drivingDistance" msgstr "" msgid "Proposed functions changes" msgstr "" -msgid "" -"`#2544 `__: Standardize " -"output and modifying signature pgr_withPointsDD" +msgid "`#2544 `__: Standardize output and modifying signature pgr_withPointsDD" msgstr "" -msgid "" -"`#2546 `__: Standardize " -"output and modifying signature pgr_withPointsKSP" +msgid "`#2546 `__: Standardize output and modifying signature pgr_withPointsKSP" msgstr "" -msgid "" -"`#2504 `__: To C++ pg " -"data get, fetch and check." +msgid "`#2504 `__: To C++ pg data get, fetch and check." msgstr "" msgid "Stopping support for compilation with MSVC." msgstr "" -msgid "" -"`#2505 `__: Using " -"namespace." +msgid "`#2505 `__: Using namespace." msgstr "" -msgid "" -"`#2512 `__: [Dijkstra] " -"Removing duplicate code on Dijkstra." +msgid "`#2512 `__: [Dijkstra] Removing duplicate code on Dijkstra." msgstr "" -msgid "" -"`#2517 `__: Astar code " -"simplification." +msgid "`#2517 `__: Astar code simplification." msgstr "" -msgid "" -"`#2521 `__: Dijkstra " -"code simplification." +msgid "`#2521 `__: Dijkstra code simplification." msgstr "" -msgid "" -"`#2522 `__: bdAstar code " -"simplification." +msgid "`#2522 `__: bdAstar code simplification." msgstr "" -msgid "" -"`#2490 `__: Automatic " -"page history links." +msgid "`#2490 `__: Automatic page history links." msgstr "" msgid "..rubric:: Standardize SQL" msgstr "" -msgid "" -"`#2555 `__: Standardize " -"deprecated messages" +msgid "`#2555 `__: Standardize deprecated messages" msgstr "" -msgid "" -"On new internal function: do not use named parameters and default parameters." +msgid "On new internal function: do not use named parameters and default parameters." msgstr "" msgid "pgRouting 3.5" @@ -16787,10 +14156,7 @@ msgstr "" msgid "pgRouting 3.5.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.5.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.5.1 `__" msgstr "" msgid "Documentation fixes" @@ -16814,22 +14180,16 @@ msgstr "" msgid "Issue fixes" msgstr "" -msgid "" -"`#2565 `__: " -"pgr_lengauerTarjanDominatorTree triggers an assertion" +msgid "`#2565 `__: pgr_lengauerTarjanDominatorTree triggers an assertion" msgstr "" msgid "SQL enhancements" msgstr "" -msgid "" -"`#2561 `__: Not use " -"wildcards on SQL" +msgid "`#2561 `__: Not use wildcards on SQL" msgstr "" -msgid "" -"`#2559 `__: pgtap test " -"using sampledata" +msgid "`#2559 `__: pgtap test using sampledata" msgstr "" #, fuzzy @@ -16848,10 +14208,7 @@ msgstr "" msgid "pgRouting 3.5.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.5.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.5.0 `__" msgstr "" msgid "Dijkstra" @@ -16863,54 +14220,34 @@ msgstr "" msgid "pgRouting 3.4.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.4.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.4.2 `__" msgstr "" -msgid "" -"`#2394 `__: pgr_bdAstar " -"accumulates heuristic cost in visited node cost." +msgid "`#2394 `__: pgr_bdAstar accumulates heuristic cost in visited node cost." msgstr "" -msgid "" -"`#2427 `__: " -"pgr_createVerticesTable & pgr_createTopology, variable should be of type " -"Record." +msgid "`#2427 `__: pgr_createVerticesTable & pgr_createTopology, variable should be of type Record." msgstr "" msgid "pgRouting 3.4.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.4.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.4.1 `__" msgstr "" -msgid "" -"`#2401 `__: pgRouting " -"3.4.0 do not build docs when sphinx is too low or missing" +msgid "`#2401 `__: pgRouting 3.4.0 do not build docs when sphinx is too low or missing" msgstr "" -msgid "" -"`#2398 `__: v3.4.0 does " -"not upgrade from 3.3.3" +msgid "`#2398 `__: v3.4.0 does not upgrade from 3.3.3" msgstr "" msgid "pgRouting 3.4.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.4.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.4.0 `__" msgstr "" -msgid "" -"`#1891 `__: pgr_ksp " -"doesn't give all correct shortest path" +msgid "`#1891 `__: pgr_ksp doesn't give all correct shortest path" msgstr "" #, fuzzy @@ -17002,47 +14339,31 @@ msgstr "" msgid "pgRouting 3.3.5 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.5 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.5 `__" msgstr "" msgid "pgRouting 3.3.4 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.4 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.4 `__" msgstr "" -msgid "" -"`#2400 `__: pgRouting " -"3.3.3 does not build in focal" +msgid "`#2400 `__: pgRouting 3.3.3 does not build in focal" msgstr "" msgid "pgRouting 3.3.3 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.3 `__" msgstr "" -msgid "" -"Ignoring optional boolean parameter, as the algorithm works only for " -"undirected graphs." +msgid "Ignoring optional boolean parameter, as the algorithm works only for undirected graphs." msgstr "" msgid "pgRouting 3.3.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.2 `__" msgstr "" msgid "Revised documentation" @@ -17075,72 +14396,46 @@ msgstr "" msgid "Restructure of the pgRouting concepts page." msgstr "" -msgid "" -"`#2276 `__: " -"edgeDisjointPaths issues with start_vid and combinations" +msgid "`#2276 `__: edgeDisjointPaths issues with start_vid and combinations" msgstr "" -msgid "" -"`#2312 `__: " -"pgr_extractVertices error when target is not BIGINT" +msgid "`#2312 `__: pgr_extractVertices error when target is not BIGINT" msgstr "" -msgid "" -"`#2357 `__: Apply clang-" -"tidy performance-*" +msgid "`#2357 `__: Apply clang-tidy performance-*" msgstr "" msgid "pgRouting 3.3.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.1 `__" msgstr "" -msgid "" -"`#2216 `__: Warnings " -"when using clang" +msgid "`#2216 `__: Warnings when using clang" msgstr "" -msgid "" -"`#2266 `__: Error " -"processing restrictions" +msgid "`#2266 `__: Error processing restrictions" msgstr "" msgid "pgRouting 3.3.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.0 `__" msgstr "" -msgid "" -"`#2057 `__: trspViaEdges " -"columns in different order" +msgid "`#2057 `__: trspViaEdges columns in different order" msgstr "" -msgid "" -"`#2087 `__: " -"pgr_extractVertices to proposed" +msgid "`#2087 `__: pgr_extractVertices to proposed" msgstr "" -msgid "" -"`#2201 `__: " -"pgr_depthFirstSearch to proposed" +msgid "`#2201 `__: pgr_depthFirstSearch to proposed" msgstr "" -msgid "" -"`#2202 `__: " -"pgr_sequentialVertexColoring to proposed" +msgid "`#2202 `__: pgr_sequentialVertexColoring to proposed" msgstr "" -msgid "" -"`#2203 `__: " -"pgr_dijkstraNear and pgr_dijkstraNearCost to proposed" +msgid "`#2203 `__: pgr_dijkstraNear and pgr_dijkstraNearCost to proposed" msgstr "" msgid "Coloring" @@ -17191,42 +14486,28 @@ msgstr "" msgid "pgRouting 3.2.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.2.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.2.2 `__" msgstr "" -msgid "" -"`#2093 `__: Compilation " -"on Visual Studio" +msgid "`#2093 `__: Compilation on Visual Studio" msgstr "" -msgid "" -"`#2189 `__: Build error " -"on RHEL 7" +msgid "`#2189 `__: Build error on RHEL 7" msgstr "" msgid "pgRouting 3.2.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.2.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.2.1 `__" msgstr "" -msgid "" -"`#1883 `__: " -"pgr_TSPEuclidean crashes connection on Windows" +msgid "`#1883 `__: pgr_TSPEuclidean crashes connection on Windows" msgstr "" msgid "The solution is to use Boost::graph::metric_tsp_approx" msgstr "" -msgid "" -"To not break user's code the optional parameters related to the TSP " -"Annaeling are ignored" +msgid "To not break user's code the optional parameters related to the TSP Annaeling are ignored" msgstr "" msgid "The function with the annaeling optional parameters is deprecated" @@ -17235,15 +14516,10 @@ msgstr "" msgid "pgRouting 3.2.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.2.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.2.0 `__" msgstr "" -msgid "" -"`#1850 `__: Change Boost " -"min version to 1.56" +msgid "`#1850 `__: Change Boost min version to 1.56" msgstr "" msgid "Removing support for Boost v1.53, v1.54 & v1.55" @@ -17276,10 +14552,7 @@ msgstr "" msgid "pgRouting 3.1.4 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.1.4 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.4 `__" msgstr "" msgid "Issues fixes" @@ -17288,102 +14561,64 @@ msgstr "" msgid "pgRouting 3.1.3 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.1.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.3 `__" msgstr "" -msgid "" -"`#1825 `__: Boost " -"versions are not honored" +msgid "`#1825 `__: Boost versions are not honored" msgstr "" -msgid "" -"`#1849 `__: Boost 1.75.0 " -"geometry \"point_xy.hpp\" build error on macOS environment" +msgid "`#1849 `__: Boost 1.75.0 geometry \"point_xy.hpp\" build error on macOS environment" msgstr "" -msgid "" -"`#1861 `__: vrp " -"functions crash server" +msgid "`#1861 `__: vrp functions crash server" msgstr "" msgid "pgRouting 3.1.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.1.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.2 `__" msgstr "" -msgid "" -"`#1304 `__: FreeBSD 12 " -"64-bit crashes on pgr_vrOneDepot tests Experimental Function" +msgid "`#1304 `__: FreeBSD 12 64-bit crashes on pgr_vrOneDepot tests Experimental Function" msgstr "" -msgid "" -"`#1356 `__: tools/" -"testers/pg_prove_tests.sh fails when PostgreSQL port is not passed" +msgid "`#1356 `__: tools/testers/pg_prove_tests.sh fails when PostgreSQL port is not passed" msgstr "" -msgid "" -"`#1725 `__: Server crash " -"on pgr_pickDeliver and pgr_vrpOneDepot on openbsd" +msgid "`#1725 `__: Server crash on pgr_pickDeliver and pgr_vrpOneDepot on openbsd" msgstr "" -msgid "" -"`#1760 `__: TSP server " -"crash on ubuntu 20.04 #1760" +msgid "`#1760 `__: TSP server crash on ubuntu 20.04 #1760" msgstr "" -msgid "" -"`#1770 `__: Remove " -"warnings when using clang compiler" +msgid "`#1770 `__: Remove warnings when using clang compiler" msgstr "" msgid "pgRouting 3.1.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.1.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.1 `__" msgstr "" -msgid "" -"`#1733 `__: pgr_bdAstar " -"fails when source or target vertex does not exist in the graph" +msgid "`#1733 `__: pgr_bdAstar fails when source or target vertex does not exist in the graph" msgstr "" -msgid "" -"`#1647 `__: Linear " -"Contraction contracts self loops" +msgid "`#1647 `__: Linear Contraction contracts self loops" msgstr "" -msgid "" -"`#1640 `__: " -"pgr_withPoints fails when points_sql is empty" +msgid "`#1640 `__: pgr_withPoints fails when points_sql is empty" msgstr "" -msgid "" -"`#1616 `__: Path " -"evaluation on C++ not updated before the results go back to C" +msgid "`#1616 `__: Path evaluation on C++ not updated before the results go back to C" msgstr "" -msgid "" -"`#1300 `__: " -"pgr_chinesePostman crash on test data" +msgid "`#1300 `__: pgr_chinesePostman crash on test data" msgstr "" msgid "pgRouting 3.1.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.1.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.0 `__" msgstr "" msgid "pgr_dijkstra(combinations)" @@ -17404,19 +14639,13 @@ msgstr "" msgid "pgRouting 3.0.6 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.6 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.6 `__" msgstr "" msgid "pgRouting 3.0.5 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.5 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.5 `__" msgstr "" msgid "Backport issue fixes" @@ -17425,89 +14654,58 @@ msgstr "" msgid "pgRouting 3.0.4 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.4 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.4 `__" msgstr "" msgid "pgRouting 3.0.3 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.3 `__" msgstr "" msgid "pgRouting 3.0.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.2 `__" msgstr "" -msgid "" -"`#1378 `__: Visual " -"Studio build failing" +msgid "`#1378 `__: Visual Studio build failing" msgstr "" msgid "pgRouting 3.0.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.1 `__" msgstr "" -msgid "" -"`#232 `__: Honor client " -"cancel requests in C /C++ code" +msgid "`#232 `__: Honor client cancel requests in C /C++ code" msgstr "" msgid "pgRouting 3.0.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.0 `__" msgstr "" msgid "Fixed Issues" msgstr "" -msgid "" -"`#1153 `__: Renamed " -"pgr_eucledianTSP to pgr_TSPeuclidean" +msgid "`#1153 `__: Renamed pgr_eucledianTSP to pgr_TSPeuclidean" msgstr "" -msgid "" -"`#1188 `__: Removed CGAL " -"dependency" +msgid "`#1188 `__: Removed CGAL dependency" msgstr "" -msgid "" -"`#1002 `__: Fixed " -"contraction issues:" +msgid "`#1002 `__: Fixed contraction issues:" msgstr "" -msgid "" -"`#1004 `__: Contracts " -"when forbidden vertices do not belong to graph" +msgid "`#1004 `__: Contracts when forbidden vertices do not belong to graph" msgstr "" -msgid "" -"`#1005 `__: Intermideate " -"results eliminated" +msgid "`#1005 `__: Intermideate results eliminated" msgstr "" -msgid "" -"`#1006 `__: No loss of " -"information" +msgid "`#1006 `__: No loss of information" msgstr "" msgid "New Functions" @@ -17791,58 +14989,37 @@ msgstr "" msgid "pgRouting 2.6.3 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.6.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.3 `__" msgstr "" -msgid "" -"`#1219 `__: Implicit " -"cast for via_path integer to text" +msgid "`#1219 `__: Implicit cast for via_path integer to text" msgstr "" -msgid "" -"`#1193 `__: Fixed " -"pgr_pointsAsPolygon breaking when comparing strings in WHERE clause" +msgid "`#1193 `__: Fixed pgr_pointsAsPolygon breaking when comparing strings in WHERE clause" msgstr "" -msgid "" -"`#1185 `__: Improve " -"FindPostgreSQL.cmake" +msgid "`#1185 `__: Improve FindPostgreSQL.cmake" msgstr "" msgid "pgRouting 2.6.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.6.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.2 `__" msgstr "" -msgid "" -"`#1152 `__: Fixes " -"driving distance when vertex is not part of the graph" +msgid "`#1152 `__: Fixes driving distance when vertex is not part of the graph" msgstr "" -msgid "" -"`#1098 `__: Fixes " -"windows test" +msgid "`#1098 `__: Fixes windows test" msgstr "" -msgid "" -"`#1165 `__: Fixes build " -"for python3 and perl5" +msgid "`#1165 `__: Fixes build for python3 and perl5" msgstr "" msgid "pgRouting 2.6.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.6.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.1 `__" msgstr "" msgid "Fixes server crash on several functions." @@ -17923,18 +15100,13 @@ msgstr "" msgid "pgRouting 2.6.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.6.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.0 `__" msgstr "" msgid "pgr_lineGraphFull" msgstr "" -msgid "" -"Fix pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean[,text])" +msgid "Fix pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean[,text])" msgstr "" msgid "without restrictions" @@ -17955,9 +15127,7 @@ msgstr "" msgid "Internal code" msgstr "" -msgid "" -"Cleaned the internal code of trsp(text,integer,integer,boolean,boolean [, " -"text])" +msgid "Cleaned the internal code of trsp(text,integer,integer,boolean,boolean [, text])" msgstr "" msgid "Removed the use of pointers" @@ -17975,10 +15145,7 @@ msgstr "" msgid "pgRouting 2.5.5 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.5 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.5 `__" msgstr "" msgid "Fixes driving distance when vertex is not part of the graph" @@ -17993,33 +15160,22 @@ msgstr "" msgid "pgRouting 2.5.4 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.4 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.4 `__" msgstr "" msgid "pgRouting 2.5.3 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.3 `__" msgstr "" -msgid "" -"Fix for postgresql 11: Removed a compilation error when compiling with " -"postgreSQL" +msgid "Fix for postgresql 11: Removed a compilation error when compiling with postgreSQL" msgstr "" msgid "pgRouting 2.5.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.2 `__" msgstr "" msgid "Fix for postgresql 10.1: Removed a compiler condition" @@ -18028,10 +15184,7 @@ msgstr "" msgid "pgRouting 2.5.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.1 `__" msgstr "" msgid "Fixed prerequisite minimum version of: cmake" @@ -18040,10 +15193,7 @@ msgstr "" msgid "pgRouting 2.5.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.0 `__" msgstr "" msgid "enhancement:" @@ -18108,10 +15258,7 @@ msgstr "" msgid "pgRouting 2.4.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.4.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.4.2 `__" msgstr "" msgid "Improvement" @@ -18123,17 +15270,13 @@ msgstr "" msgid "Fixed: Unexpected error column \"cname\"" msgstr "" -msgid "" -"Replace __linux__ with __GLIBC__ for glibc-specific headers and functions" +msgid "Replace __linux__ with __GLIBC__ for glibc-specific headers and functions" msgstr "" msgid "pgRouting 2.4.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.4.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.4.1 `__" msgstr "" msgid "Fixed compiling error on macOS" @@ -18145,10 +15288,7 @@ msgstr "" msgid "pgRouting 2.4.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.4.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.4.0 `__" msgstr "" msgid "Deprecated signatures." @@ -18175,10 +15315,7 @@ msgstr "" msgid "pgRouting 2.3.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.3.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.3.2 `__" msgstr "" msgid "Fixed pgr_gsoc_vrppdtw crash when all orders fit on one truck." @@ -18196,10 +15333,7 @@ msgstr "" msgid "pgRouting 2.3.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.3.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.3.1 `__" msgstr "" msgid "Leaks on proposed max_flow functions" @@ -18214,10 +15348,7 @@ msgstr "" msgid "pgRouting 2.3.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.3.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.3.0 `__" msgstr "" msgid "pgr_eucledianTSP" @@ -18296,10 +15427,7 @@ msgstr "" msgid "pgRouting 2.2.4 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.2.4 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.4 `__" msgstr "" msgid "Bogus uses of extern \"C\"" @@ -18314,10 +15442,7 @@ msgstr "" msgid "pgRouting 2.2.3 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.2.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.3 `__" msgstr "" msgid "Fixed compatibility issues with PostgreSQL 9.6." @@ -18326,10 +15451,7 @@ msgstr "" msgid "pgRouting 2.2.2 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.2.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.2 `__" msgstr "" msgid "Fixed regression error on pgr_drivingDistance" @@ -18338,10 +15460,7 @@ msgstr "" msgid "pgRouting 2.2.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.2.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.1 `__" msgstr "" msgid "Server crash fix on pgr_alphaShape" @@ -18353,10 +15472,7 @@ msgstr "" msgid "pgRouting 2.2.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.2.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.0 `__" msgstr "" msgid "Improvements" @@ -18458,10 +15574,7 @@ msgstr "" msgid "pgRouting 2.1.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.1.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.1.0 `__" msgstr "" msgid "Refactored" @@ -18471,40 +15584,28 @@ msgstr "" msgid "pgr_dijkstra(One to One)" msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "" -"pgr_alphaShape function now can generate better (multi)polygon with holes " -"and alpha parameter." +msgid "pgr_alphaShape function now can generate better (multi)polygon with holes and alpha parameter." msgstr "" -msgid "" -"Proposed functions from Steve Woodbridge, (Classified as Convenience by the " -"author.)" +msgid "Proposed functions from Steve Woodbridge, (Classified as Convenience by the author.)" msgstr "" -msgid "" -"pgr_pointToEdgeNode - convert a point geometry to a vertex_id based on " -"closest edge." +msgid "pgr_pointToEdgeNode - convert a point geometry to a vertex_id based on closest edge." msgstr "" -msgid "" -"pgr_flipEdges - flip the edges in an array of geometries so the connect end " -"to end." +msgid "pgr_flipEdges - flip the edges in an array of geometries so the connect end to end." msgstr "" -msgid "" -"pgr_textToPoints - convert a string of x,y;x,y;... locations into point " -"geometries." +msgid "pgr_textToPoints - convert a string of x,y;x,y;... locations into point geometries." msgstr "" -msgid "" -"pgr_pointsToVids - convert an array of point geometries into vertex ids." +msgid "pgr_pointsToVids - convert an array of point geometries into vertex ids." msgstr "" msgid "pgr_pointsToDMatrix - Create a distance matrix from an array of points." msgstr "" -msgid "" -"pgr_vidsToDMatrix - Create a distance matrix from an array of vertix_id." +msgid "pgr_vidsToDMatrix - Create a distance matrix from an array of vertix_id." msgstr "" msgid "Added proposed functions from GSoc Projects:" @@ -18576,9 +15677,7 @@ msgstr "" msgid "allow any-numerical on the cost/reverse_cost columns" msgstr "" -msgid "" -"Instead of generating many libraries: - All functions are encapsulated in " -"one library - The library has the prefix 2-1-0" +msgid "Instead of generating many libraries: - All functions are encapsulated in one library - The library has the prefix 2-1-0" msgstr "" msgid "pgRouting 2.0" @@ -18587,10 +15686,7 @@ msgstr "" msgid "pgRouting 2.0.1 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.0.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.0.1 `__" msgstr "" msgid "Minor bug fixes." @@ -18602,16 +15698,10 @@ msgstr "" msgid "pgRouting 2.0.0 Release Notes" msgstr "" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.0.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.0.0 `__" msgstr "" -msgid "" -"With the release of pgRouting 2.0.0 the library has abandoned backwards " -"compatibility to `pgRouting 1.0`_ releases. The main Goals for this release " -"are:" +msgid "With the release of pgRouting 2.0.0 the library has abandoned backwards compatibility to `pgRouting 1.0`_ releases. The main Goals for this release are:" msgstr "" msgid "Major restructuring of pgRouting." @@ -18644,21 +15734,16 @@ msgstr "" msgid "Important Changes" msgstr "" -msgid "" -"Graph Analytics - tools for detecting and fixing connection some problems in " -"a graph" +msgid "Graph Analytics - tools for detecting and fixing connection some problems in a graph" msgstr "" msgid "A collection of useful utility functions" msgstr "" -msgid "" -"Two new All Pairs Short Path algorithms (pgr_apspJohnson, pgr_apspWarshall)" +msgid "Two new All Pairs Short Path algorithms (pgr_apspJohnson, pgr_apspWarshall)" msgstr "" -msgid "" -"Bi-directional Dijkstra and A-star search algorithms (pgr_bdAstar, " -"pgr_bdDijkstra)" +msgid "Bi-directional Dijkstra and A-star search algorithms (pgr_bdAstar, pgr_bdDijkstra)" msgstr "" msgid "One to many nodes search (pgr_kDijkstra)" @@ -18667,9 +15752,7 @@ msgstr "" msgid "K alternate paths shortest path (pgr_ksp)" msgstr "" -msgid "" -"New TSP solver that simplifies the code and the build process (pgr_tsp), " -"dropped \"Gaul Library\" dependency" +msgid "New TSP solver that simplifies the code and the build process (pgr_tsp), dropped \"Gaul Library\" dependency" msgstr "" msgid "Turn Restricted shortest path (pgr_trsp) that replaces Shooting Star" @@ -18678,21 +15761,16 @@ msgstr "" msgid "Dropped support for Shooting Star" msgstr "" -msgid "" -"Built a test infrastructure that is run before major code changes are " -"checked in" +msgid "Built a test infrastructure that is run before major code changes are checked in" msgstr "" -msgid "" -"Tested and fixed most all of the outstanding bugs reported against 1.x that " -"existing in the 2.0-dev code base." +msgid "Tested and fixed most all of the outstanding bugs reported against 1.x that existing in the 2.0-dev code base." msgstr "" msgid "Improved build process for Windows" msgstr "" -msgid "" -"Automated testing on Linux and Windows platforms trigger by every commit" +msgid "Automated testing on Linux and Windows platforms trigger by every commit" msgstr "" msgid "Modular library design" @@ -18731,11 +15809,7 @@ msgstr "" msgid "pgRouting 1.0" msgstr "" -msgid "" -"To see the issues closed by this release see the `Git closed issues for 1.x " -"`_ on Github. The following release notes have been copied " -"from the previous ``RELEASE_NOTES`` file and are kept as a reference." +msgid "To see the issues closed by this release see the `Git closed issues for 1.x `_ on Github. The following release notes have been copied from the previous ``RELEASE_NOTES`` file and are kept as a reference." msgstr "" msgid "Changes for release 1.05" @@ -18789,8 +15863,7 @@ msgstr "" msgid "PostgreSQL 8.2 support" msgstr "" -msgid "" -"Shortest path functions return empty result if they could not find any path" +msgid "Shortest path functions return empty result if they could not find any path" msgstr "" msgid "Changes for release 0.9.8" @@ -18811,10 +15884,7 @@ msgstr "" msgid "Sample Data" msgstr "" -msgid "" -"The documentation provides very simple example queries based on a small " -"sample network that resembles a city. To be able to execute the majority of " -"the examples queries, follow the instructions below." +msgid "The documentation provides very simple example queries based on a small sample network that resembles a city. To be able to execute the majority of the examples queries, follow the instructions below." msgstr "" msgid "Main graph" @@ -18826,22 +15896,13 @@ msgstr "" msgid "The following city is to be inserted into the database:" msgstr "" -msgid "" -"Information known at this point is the geometry of the edges, cost values, " -"capacity values, category values and some locations that are not in the " -"graph." +msgid "Information known at this point is the geometry of the edges, cost values, capacity values, category values and some locations that are not in the graph." msgstr "" -msgid "" -"The process to have working topology starts by inserting the edges. After " -"that everything else is calculated." +msgid "The process to have working topology starts by inserting the edges. After that everything else is calculated." msgstr "" -msgid "" -"The database design for the documentation of pgRouting, keeps in the same " -"row 2 segments, one in the direction of the geometry and the second in the " -"opposite direction. Therefore some information has the ``reverse_`` prefix " -"which corresponds to the segment on the opposite direction of the geometry." +msgid "The database design for the documentation of pgRouting, keeps in the same row 2 segments, one in the direction of the geometry and the second in the opposite direction. Therefore some information has the ``reverse_`` prefix which corresponds to the segment on the opposite direction of the geometry." msgstr "" msgid "Identifier of the starting vertex of the geometry ``geom``." @@ -18871,17 +15932,13 @@ msgstr "" msgid ":math:`x` coordinate of the starting vertex of the geometry." msgstr "" -msgid "" -"For convenience it is saved on the table but can be calculated as " -"``ST_X(ST_StartPoint(geom))``." +msgid "For convenience it is saved on the table but can be calculated as ``ST_X(ST_StartPoint(geom))``." msgstr "" msgid ":math:`y` coordinate of the ending vertex of the geometry." msgstr "" -msgid "" -"For convenience it is saved on the table but can be calculated as " -"``ST_Y(ST_EndPoint(geom))``." +msgid "For convenience it is saved on the table but can be calculated as ``ST_Y(ST_EndPoint(geom))``." msgstr "" msgid "The geometry of the segments." @@ -18891,21 +15948,16 @@ msgstr "" msgid "Starting on PostgreSQL 12::" msgstr "PostgreSQL 설정" -msgid "" -"Optionally indexes on different columns can be created. The recommendation " -"is to have" +msgid "Optionally indexes on different columns can be created. The recommendation is to have" msgstr "" msgid "``id`` indexed." msgstr "" -msgid "" -"``source`` and ``target`` columns indexed to speed up pgRouting queries." +msgid "``source`` and ``target`` columns indexed to speed up pgRouting queries." msgstr "" -msgid "" -"``geom`` indexed to speed up geometry processes that might be needed in the " -"front end." +msgid "``geom`` indexed to speed up geometry processes that might be needed in the front end." msgstr "" msgid "For this small example the indexes are skipped, except for ``id``" @@ -18917,23 +15969,16 @@ msgstr "" msgid "Inserting into the database the information of the edges:" msgstr "" -msgid "" -"Negative values on the cost, capacity and category means that the edge do " -"not exist." +msgid "Negative values on the cost, capacity and category means that the edge do not exist." msgstr "" msgid "Vertices" msgstr "" -msgid "" -"The vertex information is calculated based on the identifier of the edge and " -"the geometry and saved on a table. Saving all the information provided by :" -"doc:`pgr_extractVertices`:" +msgid "The vertex information is calculated based on the identifier of the edge and the geometry and saved on a table. Saving all the information provided by :doc:`pgr_extractVertices`:" msgstr "" -msgid "" -"In this case the because the ``CREATE`` statement was not used, the " -"definition of an index on the table is needed." +msgid "In this case the because the ``CREATE`` statement was not used, the definition of an index on the table is needed." msgstr "" msgid "The structure of the table is:" @@ -18945,17 +15990,13 @@ msgstr "" msgid "The saved information of the vertices is:" msgstr "" -msgid "" -"Here is where adding more columns to the vertices table can be done. " -"Additional columns names and types will depend on the application." +msgid "Here is where adding more columns to the vertices table can be done. Additional columns names and types will depend on the application." msgstr "" msgid "The topology" msgstr "" -msgid "" -"This queries based on the vertices data create a topology by filling the " -"``source`` and ``target`` columns in the edges table." +msgid "This queries based on the vertices data create a topology by filling the ``source`` and ``target`` columns in the edges table." msgstr "" msgid "Topology data" @@ -18967,14 +16008,10 @@ msgstr "" msgid "Support tables" msgstr "" -msgid "" -"Many functions can be used with a combinations of ``(source, target)`` pairs " -"when wanting a route from ``source`` to ``target``." +msgid "Many functions can be used with a combinations of ``(source, target)`` pairs when wanting a route from ``source`` to ``target``." msgstr "" -msgid "" -"For convenience of this documentation, some combinations will be stored on a " -"table:" +msgid "For convenience of this documentation, some combinations will be stored on a table:" msgstr "" msgid "Inserting the data:" @@ -19004,9 +16041,7 @@ msgstr "" msgid "Directed graph with ``cost`` and ``reverse_cost``" msgstr "" -msgid "" -"When working with city networks, this is recommended for point of view of " -"vehicles." +msgid "When working with city networks, this is recommended for point of view of vehicles." msgstr "" msgid "Directed, with cost and reverse_cost" @@ -19015,9 +16050,7 @@ msgstr "" msgid "Undirected graph with ``cost`` and ``reverse_cost``" msgstr "" -msgid "" -"When working with city networks, this is recommended for point of view of " -"pedestrians." +msgid "When working with city networks, this is recommended for point of view of pedestrians." msgstr "" msgid "Undirected, with cost and reverse cost" @@ -19041,111 +16074,70 @@ msgstr "" msgid "Spanning Tree - Category" msgstr "" -msgid "" -"A spanning tree of an undirected graph is a tree that includes all the " -"vertices of G with the minimum possible number of edges." +msgid "A spanning tree of an undirected graph is a tree that includes all the vertices of G with the minimum possible number of edges." msgstr "" -msgid "" -"For a disconnected graph, there there is no single tree, but a spanning " -"forest, consisting of a spanning tree of each connected component." +msgid "For a disconnected graph, there there is no single tree, but a spanning forest, consisting of a spanning tree of each connected component." msgstr "" msgid "Characteristics:" msgstr "" -msgid "" -"pgRouting community support is available through the `pgRouting website " -"`_, `documentation `_, tutorials, mailing lists and others. If you’re looking " -"for :ref:`commercial support `, find below a list of " -"companies providing pgRouting development and consulting services." +msgid "pgRouting community support is available through the `pgRouting website `_, `documentation `_, tutorials, mailing lists and others. If you’re looking for :ref:`commercial support `, find below a list of companies providing pgRouting development and consulting services." msgstr "" msgid "Reporting Problems" msgstr "" -msgid "" -"Bugs are reported and managed in an `issue tracker `_. Please follow these steps:" +msgid "Bugs are reported and managed in an `issue tracker `_. Please follow these steps:" msgstr "" -msgid "" -"Search the tickets to see if your problem has already been reported. If so, " -"add any extra context you might have found, or at least indicate that you " -"too are having the problem. This will help us prioritize common issues." +msgid "Search the tickets to see if your problem has already been reported. If so, add any extra context you might have found, or at least indicate that you too are having the problem. This will help us prioritize common issues." msgstr "" -msgid "" -"If your problem is unreported, create a `new issue `__ for it." +msgid "If your problem is unreported, create a `new issue `__ for it." msgstr "" -msgid "" -"In your report include explicit instructions to replicate your issue. The " -"best tickets include the exact SQL necessary to replicate a problem." +msgid "In your report include explicit instructions to replicate your issue. The best tickets include the exact SQL necessary to replicate a problem." msgstr "" -msgid "" -"If you can test older versions of PostGIS for your problem, please do. On " -"your ticket, note the earliest version the problem appears." +msgid "If you can test older versions of PostGIS for your problem, please do. On your ticket, note the earliest version the problem appears." msgstr "" -msgid "" -"For the versions where you can replicate the problem, note the operating " -"system and version of pgRouting, PostGIS and PostgreSQL." +msgid "For the versions where you can replicate the problem, note the operating system and version of pgRouting, PostGIS and PostgreSQL." msgstr "" -msgid "" -"It is recommended to use the following wrapper on the problem to pin point " -"the step that is causing the problem." +msgid "It is recommended to use the following wrapper on the problem to pin point the step that is causing the problem." msgstr "" msgid "Mailing List, Matrix, GIS StackExchange" msgstr "" -msgid "" -"There are two mailing lists for pgRouting hosted on OSGeo discourse server:" +msgid "There are two mailing lists for pgRouting hosted on OSGeo discourse server:" msgstr "" -msgid "" -"User mailing list: https://discourse.osgeo.org/c/pgrouting/pgrouting-users/" +msgid "User mailing list: https://discourse.osgeo.org/c/pgrouting/pgrouting-users/" msgstr "" -msgid "" -"Developer mailing list: https://discourse.osgeo.org/c/pgrouting/pgrouting-" -"dev/" +msgid "Developer mailing list: https://discourse.osgeo.org/c/pgrouting/pgrouting-dev/" msgstr "" msgid "Subscribe: https://discourse.osgeo.org/g/pgrouting-dev" msgstr "" -msgid "" -"For general questions and topics about how to use pgRouting, please write to " -"the user mailing list." +msgid "For general questions and topics about how to use pgRouting, please write to the user mailing list." msgstr "" -msgid "" -"If you want to chat with fellow pgRouting users and contributors, you can " -"join our matrix channel: `pgRouting matrix channel `_." +msgid "If you want to chat with fellow pgRouting users and contributors, you can join our matrix channel: `pgRouting matrix channel `_." msgstr "" -msgid "" -"You can also ask at `GIS StackExchange `_ " -"and tag the question with ``pgrouting``. Find all questions tagged with " -"``pgrouting`` under https://gis.stackexchange.com/questions/tagged/pgrouting " -"or subscribe to the `pgRouting questions feed `_." +msgid "You can also ask at `GIS StackExchange `_ and tag the question with ``pgrouting``. Find all questions tagged with ``pgrouting`` under https://gis.stackexchange.com/questions/tagged/pgrouting or subscribe to the `pgRouting questions feed `_." msgstr "" msgid "Commercial Support" msgstr "" -msgid "" -"For users who require professional support, development and consulting " -"services, consider contacting any of the following organizations, which have " -"significantly contributed to the development of pgRouting:" +msgid "For users who require professional support, development and consulting services, consider contacting any of the following organizations, which have significantly contributed to the development of pgRouting:" msgstr "" msgid "**Company**" @@ -19182,9 +16174,7 @@ msgstr "" msgid "Transformation - Family of functions" msgstr ":doc:`pgr_withPoints`" -msgid "" -"This family of functions is used for transforming a given input graph :math:" -"`G(V,E)` into a new graph :math:`G'(V',E')`." +msgid "This family of functions is used for transforming a given input graph :math:`G(V,E)` into a new graph :math:`G'(V',E')`." msgstr "" msgid "Traversal - Family of functions" @@ -19200,14 +16190,10 @@ msgstr "" msgid "This category intends to solve the general problem:" msgstr "" -msgid "" -"Given a graph and a list of vertices, find the shortest path between :math:" -"`vertex_i` and :math:`vertex_{i+1}` for all vertices" +msgid "Given a graph and a list of vertices, find the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all vertices" msgstr "" -msgid "" -"In other words, find a continuous route that visits all the vertices in the " -"order given." +msgid "In other words, find a continuous route that visits all the vertices in the order given." msgstr "" msgid "path" @@ -19225,9 +16211,7 @@ msgstr "" msgid "**Used in:**" msgstr "" -msgid "" -"Besides the compulsory parameters each function has, there are optional " -"parameters that exist due to the kind of function." +msgid "Besides the compulsory parameters each function has, there are optional parameters that exist due to the kind of function." msgstr "" msgid "Used in all Via functions" @@ -19242,32 +16226,19 @@ msgstr "" msgid "When points are added to the graph." msgstr "" -msgid "" -"The **with points** category modifies the graph on the fly by adding points " -"on edges as required by the `Points SQL`_ query." +msgid "The **with points** category modifies the graph on the fly by adding points on edges as required by the `Points SQL`_ query." msgstr "" -msgid "" -"The functions within this category give the ability to process between " -"arbitrary points located outside the original graph." +msgid "The functions within this category give the ability to process between arbitrary points located outside the original graph." msgstr "" -msgid "" -"This category of functions was thought for routing vehicles, but might as " -"well work for some other application not involving vehicles." +msgid "This category of functions was thought for routing vehicles, but might as well work for some other application not involving vehicles." msgstr "" -msgid "" -"When given a point identifier ``pid`` that its being mapped to an edge with " -"an identifier ``edge_id``, with a fraction from the source to the target " -"along the edge ``fraction`` and some additional information about which side " -"of the edge the point is on ``side``, then processing from arbitrary points " -"can be done on fixed networks." +msgid "When given a point identifier ``pid`` that its being mapped to an edge with an identifier ``edge_id``, with a fraction from the source to the target along the edge ``fraction`` and some additional information about which side of the edge the point is on ``side``, then processing from arbitrary points can be done on fixed networks." msgstr "" -msgid "" -"All this functions consider as many traits from the \"real world\" as " -"possible:" +msgid "All this functions consider as many traits from the \"real world\" as possible:" msgstr "" msgid "Kind of graph:" @@ -19282,8 +16253,7 @@ msgstr "" msgid "Arriving at the point:" msgstr "" -msgid "" -"Compulsory arrival on the side of the segment where the point is located." +msgid "Compulsory arrival on the side of the segment where the point is located." msgstr "" msgid "On either side of the segment." @@ -19301,13 +16271,10 @@ msgstr "" msgid "Some points are:" msgstr "" -msgid "" -"**Permanent**: for example the set of points of clients stored in a table in " -"the data base." +msgid "**Permanent**: for example the set of points of clients stored in a table in the data base." msgstr "" -msgid "" -"The graph has been modified to permanently have those points as vertices." +msgid "The graph has been modified to permanently have those points as vertices." msgstr "" msgid "There is a table on the database that describes the points" @@ -19319,9 +16286,7 @@ msgstr "" msgid "The numbering of the points are handled with negative sign." msgstr "" -msgid "" -"This sign change is to avoid confusion when there is a vertex with the same " -"identifier as the point identifier." +msgid "This sign change is to avoid confusion when there is a vertex with the same identifier as the point identifier." msgstr "" msgid "Original point identifiers are to be positive." @@ -19342,10 +16307,7 @@ msgstr "" msgid "About points" msgstr "" -msgid "" -"For this section the following city (see :doc:`sampledata`) some interesting " -"points such as restaurant, supermarket, post office, etc. will be used as " -"example." +msgid "For this section the following city (see :doc:`sampledata`) some interesting points such as restaurant, supermarket, post office, etc. will be used as example." msgstr "" msgid "The graph is **directed**" @@ -19357,9 +16319,7 @@ msgstr "" msgid "Blue arrows show the ``(target, source)`` of the edge on the edge table" msgstr "" -msgid "" -"Each point location shows where it is located with relation of the edge " -"``(source, target)``" +msgid "Each point location shows where it is located with relation of the edge ``(source, target)``" msgstr "" msgid "On the right for points **2** and **4**." @@ -19371,9 +16331,7 @@ msgstr "" msgid "On both sides for point **6**." msgstr "" -msgid "" -"The representation on the data base follows the `Points SQL`_ description, " -"and for this example:" +msgid "The representation on the data base follows the `Points SQL`_ description, and for this example:" msgstr "" msgid "Driving side" @@ -19388,9 +16346,7 @@ msgstr "" msgid "The temporary vertices are added according to the driving side," msgstr "" -msgid "" -"visually showing the differences on how depending on the driving side the " -"data is interpreted." +msgid "visually showing the differences on how depending on the driving side the data is interpreted." msgstr "" msgid "Point **1** located on edge ``(6, 5)``" @@ -19442,9 +16398,7 @@ msgstr "" msgid "Creating temporary vertices" msgstr "" -msgid "" -"This section will demonstrate how a temporary vertex is created internally " -"on the graph." +msgid "This section will demonstrate how a temporary vertex is created internally on the graph." msgstr "" msgid "Problem" @@ -19471,9 +16425,7 @@ msgstr "" msgid "Create two new edges:" msgstr "" -msgid "" -"Edge ``(16, -2)`` with cost ``0.4`` (original cost * fraction == :math:`1 * " -"0.4`)" +msgid "Edge ``(16, -2)`` with cost ``0.4`` (original cost * fraction == :math:`1 * 0.4`)" msgstr "" msgid "Edge ``(-2, 17)`` with cost ``0.6`` (the remaining cost)" @@ -19482,8 +16434,7 @@ msgstr "" msgid "The total cost of the additional edges is equal to the original cost." msgstr "" -msgid "" -"If more points are on the same edge, the process is repeated recursevly." +msgid "If more points are on the same edge, the process is repeated recursevly." msgstr "" msgid "On a left hand side driving network" @@ -19498,22 +16449,16 @@ msgstr "" msgid "It only affects the edge ``(17, 16)``, therefore the edge is removed." msgstr "" -msgid "" -"Work with the original edge ``(16, 17)`` as the fraction is a fraction of " -"the original:" +msgid "Work with the original edge ``(16, 17)`` as the fraction is a fraction of the original:" msgstr "" msgid "Flip the Edges and add them to the graph:" msgstr "" -msgid "" -"Edge ``(17, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the " -"graph." +msgid "Edge ``(17, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the graph." msgstr "" -msgid "" -"Edge ``(-2, 16)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the " -"graph." +msgid "Edge ``(-2, 16)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the graph." msgstr "" msgid "When driving side does not matter" @@ -19522,9 +16467,7 @@ msgstr "" msgid "Arrival to point ``-2`` can be achieved via vertices **16** or **17**." msgstr "" -msgid "" -"Affects the edges ``(16, 17)`` and ``(17, 16)``, therefore the edges are " -"removed." +msgid "Affects the edges ``(16, 17)`` and ``(17, 16)``, therefore the edges are removed." msgstr "" msgid "Create four new edges:" @@ -19539,23 +16482,16 @@ msgstr "" msgid "Edge ``(-2, 17)`` is added to the graph." msgstr "" -msgid "" -"Edge ``(16, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the " -"graph." +msgid "Edge ``(16, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the graph." msgstr "" -msgid "" -"Edge ``(-2, 17)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the " -"graph." +msgid "Edge ``(-2, 17)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the graph." msgstr "" msgid "withPoints - Family of functions" msgstr "" -msgid "" -"This family of functions belongs to the :doc:`withPoints-category` and the " -"functions that compose them are based one way or another on dijkstra " -"algorithm." +msgid "This family of functions belongs to the :doc:`withPoints-category` and the functions that compose them are based one way or another on dijkstra algorithm." msgstr "" msgid "Depending on the name:" diff --git a/locale/sv/LC_MESSAGES/pgrouting_doc_strings.po b/locale/sv/LC_MESSAGES/pgrouting_doc_strings.po index 3e7bd2d451..90780287d6 100644 --- a/locale/sv/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/sv/LC_MESSAGES/pgrouting_doc_strings.po @@ -4,7 +4,19 @@ # Celia Virginia Vergara Castillo , 2025. # Daniel Nylander , 2025. msgid "" -msgstr "Project-Id-Version: pgRouting v4.1\nReport-Msgid-Bugs-To: \nPOT-Creation-Date: 2025-10-08 19:15+0000\nPO-Revision-Date: 2025-10-28 19:52+0000\nLast-Translator: Celia Virginia Vergara Castillo \nLanguage-Team: Swedish \nLanguage: sv\nMIME-Version: 1.0\nContent-Type: text/plain; charset=UTF-8\nContent-Transfer-Encoding: 8bit\nPlural-Forms: nplurals=2; plural=n != 1;\nX-Generator: Weblate 5.4.3\n" +msgstr "" +"Project-Id-Version: pgRouting v4.1\n" +"Report-Msgid-Bugs-To: \n" +"POT-Creation-Date: 2025-12-05 23:37+0000\n" +"PO-Revision-Date: 2025-10-28 19:52+0000\n" +"Last-Translator: Celia Virginia Vergara Castillo \n" +"Language-Team: Swedish \n" +"Language: sv\n" +"MIME-Version: 1.0\n" +"Content-Type: text/plain; charset=UTF-8\n" +"Content-Transfer-Encoding: 8bit\n" +"Plural-Forms: nplurals=2; plural=n != 1;\n" +"X-Generator: Weblate 5.4.3\n" msgid "BFS - Category" msgstr "BFS - Kategori" @@ -69,12 +81,8 @@ msgstr "``BIGINT``" msgid "Identifier of the root vertex of the tree." msgstr "Identifierare för trädets rotvertex." -msgid "" -"When value is :math:`0` then gets the spanning forest starting in aleatory " -"nodes for each tree in the forest." -msgstr "" -"När värdet är :math:`0` får du den spännvidd som börjar i aleatoriska noder " -"för varje träd i skogen." +msgid "When value is :math:`0` then gets the spanning forest starting in aleatory nodes for each tree in the forest." +msgstr "När värdet är :math:`0` får du den spännvidd som börjar i aleatoriska noder för varje träd i skogen." msgid "**root vids**" msgstr "**root vids**" @@ -172,12 +180,8 @@ msgstr "-1" msgid "Weight of the edge (``target``, ``source``)" msgstr "Kantvikt (``mål``, ``källa``)" -msgid "" -"When negative: edge (``target``, ``source``) does not exist, therefore it's " -"not part of the graph." -msgstr "" -"När negativ: kanten (``mål``, ``källa``) existerar inte, därför är den inte " -"en del av grafen." +msgid "When negative: edge (``target``, ``source``) does not exist, therefore it's not part of the graph." +msgstr "När negativ: kanten (``mål``, ``källa``) existerar inte, därför är den inte en del av grafen." msgid "``SMALLINT``, ``INTEGER``, ``BIGINT``" msgstr "``SMALLINT``, ``INTEGER``, ``BIGINT``" @@ -192,9 +196,7 @@ msgid "Result columns" msgstr "Resultat kolumner" msgid "Returns set of ``(seq, depth, start_vid, node, edge, cost, agg_cost)``" -msgstr "" -"Returnerar uppsättning av ``(seq, depth, start_vid, node, edge, cost, " -"agg_cost)``" +msgstr "Returnerar uppsättning av ``(seq, depth, start_vid, node, edge, cost, agg_cost)``" msgid "``seq``" msgstr "``seq``" @@ -247,33 +249,17 @@ msgstr "Sammanlagd kostnad från ``start_vid`` till ``node``." msgid "See Also" msgstr "Se även" -msgid "" -"`Boost: Prim's algorithm `__" -msgstr "" -"`Boost: Prims algoritm `__" +msgid "`Boost: Prim's algorithm `__" +msgstr "`Boost: Prims algoritm `__" -msgid "" -"`Boost: Kruskal's algorithm `__" -msgstr "" -"`Boost: Kruskals algoritm `__" +msgid "`Boost: Kruskal's algorithm `__" +msgstr "`Boost: Kruskals algoritm `__" -msgid "" -"`Wikipedia: Prim's algorithm `__" -msgstr "" -"`Wikipedia: Prims algoritm `__" +msgid "`Wikipedia: Prim's algorithm `__" +msgstr "`Wikipedia: Prims algoritm `__" -msgid "" -"`Wikipedia: Kruskal's algorithm `__" -msgstr "" -"`Wikipedia: Kruskals algoritm `__" +msgid "`Wikipedia: Kruskal's algorithm `__" +msgstr "`Wikipedia: Kruskals algoritm `__" msgid "Indices and tables" msgstr "Index och tabeller" @@ -317,10 +303,8 @@ msgstr "pgTap-tester har gjorts. Men det kan behövas fler." msgid "Documentation might need refinement." msgstr "Dokumentationen kan behöva förbättras." -msgid "" -":doc:`pgr_depthFirstSearch` - Depth first search traversal of the graph." -msgstr "" -":doc:`pgr_depthFirstSearch` - Depth first search traversal of the graph." +msgid ":doc:`pgr_depthFirstSearch` - Depth first search traversal of the graph." +msgstr ":doc:`pgr_depthFirstSearch` - Depth first search traversal of the graph." msgid "In general:" msgstr "I allmänhet:" @@ -349,10 +333,8 @@ msgstr ":doc:`pgr_trspVia` - Via Vertices routing with restrictions." msgid ":doc:`pgr_trsp_withPoints` - Vertex/Point routing with restrictions." msgstr ":doc:`pgr_trsp_withPoints` - Vertex/Point routing with restrictions." -msgid "" -":doc:`pgr_trspVia_withPoints` - Via Vertex/point routing with restrictions." -msgstr "" -":doc:`pgr_trspVia_withPoints` - Via Vertex/point routing with restrictions." +msgid ":doc:`pgr_trspVia_withPoints` - Via Vertex/point routing with restrictions." +msgstr ":doc:`pgr_trspVia_withPoints` - Via Vertex/point routing with restrictions." msgid "Experimental" msgstr "Experiment" @@ -396,30 +378,14 @@ msgstr ":doc:`pgr_turnRestrictedPath` - Routing with restrictions." msgid "Introduction" msgstr "Introduktion" -msgid "" -"Road restrictions are a sequence of road segments that can not be taken in a " -"sequential manner. Some restrictions are implicit on a directed graph, for " -"example, one way roads where the wrong way edge is not even inserted on the " -"graph. But normally on turns like no left turn or no right turn, hence the " -"name turn restrictions, there are sometimes restrictions." -msgstr "" -"Vägrestriktioner är en sekvens av vägsegment som inte kan tas i en följd. " -"Vissa restriktioner är implicita i en riktad graf, t.ex. enkelriktade vägar " -"där kanten för fel väg inte ens är inlagd i grafen. Men normalt finns det " -"ibland restriktioner vid svängar, t.ex. ingen vänstersväng eller högersväng, " -"därav namnet svängrestriktioner." +msgid "Road restrictions are a sequence of road segments that can not be taken in a sequential manner. Some restrictions are implicit on a directed graph, for example, one way roads where the wrong way edge is not even inserted on the graph. But normally on turns like no left turn or no right turn, hence the name turn restrictions, there are sometimes restrictions." +msgstr "Vägrestriktioner är en sekvens av vägsegment som inte kan tas i en följd. Vissa restriktioner är implicita i en riktad graf, t.ex. enkelriktade vägar där kanten för fel väg inte ens är inlagd i grafen. Men normalt finns det ibland restriktioner vid svängar, t.ex. ingen vänstersväng eller högersväng, därav namnet svängrestriktioner." msgid "TRSP algorithm" msgstr "TRSP-algoritm" -msgid "" -"The internal TRSP algorithm performs a lookahead over the dijkstra algorithm " -"in order to find out if the attempted path has a restriction. This allows " -"the algorithm to pass twice on the same vertex." -msgstr "" -"Den interna TRSP-algoritmen utför en lookahead över dijkstra-algoritmen för " -"att ta reda på om den sökta sökvägen har en restriktion. Detta gör att " -"algoritmen kan passera två gånger på samma vertex." +msgid "The internal TRSP algorithm performs a lookahead over the dijkstra algorithm in order to find out if the attempted path has a restriction. This allows the algorithm to pass twice on the same vertex." +msgstr "Den interna TRSP-algoritmen utför en lookahead över dijkstra-algoritmen för att ta reda på om den sökta sökvägen har en restriktion. Detta gör att algoritmen kan passera två gånger på samma vertex." msgid "`Edges SQL`_ query as described." msgstr "`Kanter SQL`_-fråga enligt beskrivningen." @@ -442,19 +408,11 @@ msgstr "Array av ordnade toppunktsidentifierare som kommer att besökas." msgid "Restrictions" msgstr "Begränsningar" -msgid "" -"On road networks, there are restrictions such as left or right turn " -"restrictions, no U turn restrictions." -msgstr "" -"På vägnätet finns det begränsningar, till exempel begränsningar för vänster- " -"eller högersväng, inga begränsningar för U-sväng." +msgid "On road networks, there are restrictions such as left or right turn restrictions, no U turn restrictions." +msgstr "På vägnätet finns det begränsningar, till exempel begränsningar för vänster- eller högersväng, inga begränsningar för U-sväng." -msgid "" -"A restriction is a sequence of edges, called path and that path is to be " -"avoided." -msgstr "" -"En restriktion är en sekvens av kanter, som kallas väg, och den vägen ska " -"undvikas." +msgid "A restriction is a sequence of edges, called path and that path is to be avoided." +msgstr "En restriktion är en sekvens av kanter, som kallas väg, och den vägen ska undvikas." msgid "**Restrictions on the road network**" msgstr "**Begränsningar av vägnätet**" @@ -462,14 +420,8 @@ msgstr "**Begränsningar av vägnätet**" msgid "These restrictions are represented on a table as follows:" msgstr "Dessa begränsningar visas i en tabell enligt följande:" -msgid "" -"The table has an identifier, which maybe is needed for the administration of " -"the restrictions, but the algorithms do not need that information. If given " -"it will be ignored." -msgstr "" -"Tabellen har en identifierare, som kanske behövs för administrationen av " -"restriktionerna, men algoritmerna behöver inte den informationen. Om den ges " -"kommer den att ignoreras." +msgid "The table has an identifier, which maybe is needed for the administration of the restrictions, but the algorithms do not need that information. If given it will be ignored." +msgstr "Tabellen har en identifierare, som kanske behövs för administrationen av restriktionerna, men algoritmerna behöver inte den informationen. Om den ges kommer den att ignoreras." msgid "Restrictions SQL" msgstr "Begränsningar SQL" @@ -480,14 +432,8 @@ msgstr "``path``" msgid "``ARRAY`` [**ANY-INTEGER**]" msgstr "``ARRAY`` [**ANY-INTEGER**]" -msgid "" -"Sequence of edge identifiers that form a path that is not allowed to be " -"taken. - Empty arrays or ``NULL`` arrays are ignored. - Arrays that have a " -"``NULL`` element will raise an exception." -msgstr "" -"Sekvens av kantidentifierare som bildar en väg som inte är tillåten att ta. " -"- Tomma arrayer eller ``NULL`` arrayer ignoreras. - Arrayer som har ett " -"``NULL``-element kommer att ge upphov till ett undantag." +msgid "Sequence of edge identifiers that form a path that is not allowed to be taken. - Empty arrays or ``NULL`` arrays are ignored. - Arrays that have a ``NULL`` element will raise an exception." +msgstr "Sekvens av kantidentifierare som bildar en väg som inte är tillåten att ta. - Tomma arrayer eller ``NULL`` arrayer ignoreras. - Arrayer som har ett ``NULL``-element kommer att ge upphov till ett undantag." msgid "``Cost``" msgstr "``Cost``" @@ -516,33 +462,17 @@ msgstr "Definition av problem" msgid "The travelling salesperson problem (TSP) asks the following question:" msgstr "Problemet med den resande försäljaren (TSP) ställer följande fråga:" -msgid "" -"*Given a list of cities and the distances between each pair of cities, which " -"is the shortest possible route that visits each city exactly once and " -"returns to the origin city?*" -msgstr "" -"*Givet en lista över städer och avstånden mellan varje par av städer, vilken " -"är den kortaste möjliga rutten som besöker varje stad exakt en gång och " -"återvänder till ursprungsstaden?*" +msgid "*Given a list of cities and the distances between each pair of cities, which is the shortest possible route that visits each city exactly once and returns to the origin city?*" +msgstr "*Givet en lista över städer och avstånden mellan varje par av städer, vilken är den kortaste möjliga rutten som besöker varje stad exakt en gång och återvänder till ursprungsstaden?*" msgid "Origin" msgstr "Ursprung" -msgid "" -"The traveling sales person problem was studied in the 18th century by " -"mathematicians **Sir William Rowam Hamilton** and **Thomas Penyngton " -"Kirkman**." -msgstr "" -"Problemet med den resande försäljaren studerades på 1700-talet av " -"matematikerna **Sir William Rowam Hamilton** och **Thomas Penyngton " -"Kirkman**." +msgid "The traveling sales person problem was studied in the 18th century by mathematicians **Sir William Rowam Hamilton** and **Thomas Penyngton Kirkman**." +msgstr "Problemet med den resande försäljaren studerades på 1700-talet av matematikerna **Sir William Rowam Hamilton** och **Thomas Penyngton Kirkman**." -msgid "" -"A discussion about the work of Hamilton & Kirkman can be found in the book " -"**Graph Theory (Biggs et al. 1976)**." -msgstr "" -"En diskussion om Hamilton & Kirkmans arbete finns i boken **Graph Theory " -"(Biggs et al. 1976)**." +msgid "A discussion about the work of Hamilton & Kirkman can be found in the book **Graph Theory (Biggs et al. 1976)**." +msgstr "En diskussion om Hamilton & Kirkmans arbete finns i boken **Graph Theory (Biggs et al. 1976)**." msgid "ISBN-13: 978-0198539162" msgstr "ISBN-13: 978-0198539162" @@ -550,19 +480,8 @@ msgstr "ISBN-13: 978-0198539162" msgid "ISBN-10: 0198539169" msgstr "ISBN-10: 0198539169" -msgid "" -"It is believed that the general form of the TSP have been first studied by " -"Kalr Menger in Vienna and Harvard. The problem was later promoted by " -"Hassler, Whitney & Merrill at Princeton. A detailed description about the " -"connection between Menger & Whitney, and the development of the TSP can be " -"found in `On the history of combinatorial optimization (till 1960) `__" -msgstr "" -"Man tror att den allmänna formen av TSP först studerades av Kalr Menger i " -"Wien och Harvard. Problemet togs senare vidare av Hassler, Whitney & Merrill " -"vid Princeton. En detaljerad beskrivning av sambandet mellan Menger & " -"Whitney och utvecklingen av TSP finns i `On the history of combinatorial " -"optimization (till 1960) `__" +msgid "It is believed that the general form of the TSP have been first studied by Kalr Menger in Vienna and Harvard. The problem was later promoted by Hassler, Whitney & Merrill at Princeton. A detailed description about the connection between Menger & Whitney, and the development of the TSP can be found in `On the history of combinatorial optimization (till 1960) `__" +msgstr "Man tror att den allmänna formen av TSP först studerades av Kalr Menger i Wien och Harvard. Problemet togs senare vidare av Hassler, Whitney & Merrill vid Princeton. En detaljerad beskrivning av sambandet mellan Menger & Whitney och utvecklingen av TSP finns i `On the history of combinatorial optimization (till 1960) `__" msgid "To calculate the number of different tours through :math:`n` cities:" msgstr "För att beräkna antalet olika turer genom :math:`n` städer:" @@ -577,14 +496,10 @@ msgid "And :math:`n-2` choices for the third city, etc." msgstr "Och :math:`n-2` val för den tredje staden, etc." msgid "Multiplying these together we get :math:`(n-1)! = (n-1) (n-2) . . 1`." -msgstr "" -"Multiplicerar vi dessa tillsammans får vi :math:`(n-1)! = (n-1) (n-2) . . 1`." +msgstr "Multiplicerar vi dessa tillsammans får vi :math:`(n-1)! = (n-1) (n-2) . . 1`." -msgid "" -"Now since the travel costs do not depend on the direction taken around the " -"tour:" -msgstr "" -"Nu när resekostnaderna inte beror på vilken riktning som tas runt turen:" +msgid "Now since the travel costs do not depend on the direction taken around the tour:" +msgstr "Nu när resekostnaderna inte beror på vilken riktning som tas runt turen:" msgid "this number by 2" msgstr "detta tal med 2" @@ -601,12 +516,8 @@ msgstr "Detta problem är ett NP-svårt optimeringsproblem." msgid "Metric Algorithm is used" msgstr "Metrisk algoritm används" -msgid "" -"Implementation generates solutions that *are twice as long as the optimal " -"tour in the worst case*:" -msgstr "" -"Implementeringen genererar lösningar som *är dubbelt så långa som den " -"optimala turen i värsta fall*:" +msgid "Implementation generates solutions that *are twice as long as the optimal tour in the worst case*:" +msgstr "Implementeringen genererar lösningar som *är dubbelt så långa som den optimala turen i värsta fall*:" msgid "Graph characteristics for best performance:" msgstr "Grafiska egenskaper för bästa prestanda:" @@ -623,12 +534,8 @@ msgstr "Graf där resekostnader på kanter följer triangelolikheten." msgid "The traveling costs are symmetric:" msgstr "Resekostnaderna är symmetriska:" -msgid "" -"Traveling costs from ``u`` to ``v`` are just as much as traveling from ``v`` " -"to ``u``" -msgstr "" -"Resekostnaderna från ``u`` till ``v`` är lika mycket som att resa från ``v`` " -"till ``u``" +msgid "Traveling costs from ``u`` to ``v`` are just as much as traveling from ``v`` to ``u``" +msgstr "Resekostnaderna från ``u`` till ``v`` är lika mycket som att resa från ``v`` till ``u``" msgid "TSP optional parameters" msgstr "TSP valfria parametrar" @@ -643,8 +550,7 @@ msgid "The first visiting vertex" msgstr "Det första besökande toppunktet" msgid "When `0` any vertex can become the first visiting vertex." -msgstr "" -"När `0` kan vilken toppunkt som helst bli den första besökande toppunkten." +msgstr "När `0` kan vilken toppunkt som helst bli den första besökande toppunkten." msgid "``end_id``" msgstr "``end_id``" @@ -652,37 +558,23 @@ msgstr "``end_id``" msgid "Last visiting vertex before returning to ``start_vid``." msgstr "Sista besökande toppunkt innan återgång till ``start_vid``." -msgid "" -"When ``0`` any vertex can become the last visiting vertex before returning " -"to ``start_id``." -msgstr "" -"När ``0`` kan vilken topp som helst bli den sista besökande toppen innan den " -"återvänder till ``start_id``." +msgid "When ``0`` any vertex can become the last visiting vertex before returning to ``start_id``." +msgstr "När ``0`` kan vilken topp som helst bli den sista besökande toppen innan den återvänder till ``start_id``." -msgid "" -"When ``NOT 0`` and ``start_id = 0`` then it is the first and last vertex" -msgstr "" -"När ``NOT 0`` och ``start_id = 0`` är det den första och sista toppunkten" +msgid "When ``NOT 0`` and ``start_id = 0`` then it is the first and last vertex" +msgstr "När ``NOT 0`` och ``start_id = 0`` är det den första och sista toppunkten" msgid "References" msgstr "Referenser" -msgid "" -"`Boost: metric TSP approx `__" -msgstr "" -"`Boost: metrisk TSP ca `__" +msgid "`Boost: metric TSP approx `__" +msgstr "`Boost: metrisk TSP ca `__" msgid "`University of Waterloo TSP `__" msgstr "universitetet i Waterloo TSP `__" -msgid "" -"`Wikipedia: Traveling Salesman Problem `__" -msgstr "" -"`Wikipedia: Problemet med den resande försäljaren `__" +msgid "`Wikipedia: Traveling Salesman Problem `__" +msgstr "`Wikipedia: Problemet med den resande försäljaren `__" msgid "Vehicle Routing Functions - Category" msgstr "Funktioner för fordonsdirigering - Kategori" @@ -693,10 +585,8 @@ msgstr "Problem med upphämtning och leverans" msgid ":doc:`pgr_pickDeliver` - Pickup & Delivery using a Cost Matrix" msgstr ":doc:`pgr_pickDeliver` - Pickup & Delivery using a Cost Matrix" -msgid "" -":doc:`pgr_pickDeliverEuclidean` - Pickup & Delivery with Euclidean distances" -msgstr "" -":doc:`pgr_pickDeliverEuclidean` - Pickup & Delivery with Euclidean distances" +msgid ":doc:`pgr_pickDeliverEuclidean` - Pickup & Delivery with Euclidean distances" +msgstr ":doc:`pgr_pickDeliverEuclidean` - Pickup & Delivery with Euclidean distances" msgid "Distribution problem" msgstr "Distributionsproblem" @@ -707,12 +597,8 @@ msgstr ":doc:`pgr_vrpOneDepot` - From a single depot, distributes orders" msgid "Contents" msgstr "Innehåll" -msgid "" -"Vehicle Routing Problems `VRP` are **NP-hard** optimization problem, it " -"generalises the travelling salesman problem (TSP)." -msgstr "" -"Vehicle Routing Problems `VRP` är **NP-hårda** optimeringsproblem och är en " -"generalisering av Travelling Salesman Problem (TSP)." +msgid "Vehicle Routing Problems `VRP` are **NP-hard** optimization problem, it generalises the travelling salesman problem (TSP)." +msgstr "Vehicle Routing Problems `VRP` är **NP-hårda** optimeringsproblem och är en generalisering av Travelling Salesman Problem (TSP)." msgid "The objective of the VRP is to minimize the total route cost." msgstr "VRP:s mål är att minimera den totala ruttkostnaden." @@ -723,27 +609,14 @@ msgstr "Det finns flera varianter av VRP-problemet," msgid "**pgRouting does not try to implement all variants.**" msgstr "**pgRouting försöker inte implementera alla varianter.**" -msgid "" -"Capacitated Vehicle Routing Problem `CVRP` where The vehicles have limited " -"carrying capacity of the goods." -msgstr "" -"Capacitated Vehicle Routing Problem `CVRP` där fordonen har begränsad " -"lastkapacitet för godset." +msgid "Capacitated Vehicle Routing Problem `CVRP` where The vehicles have limited carrying capacity of the goods." +msgstr "Capacitated Vehicle Routing Problem `CVRP` där fordonen har begränsad lastkapacitet för godset." -msgid "" -"Vehicle Routing Problem with Time Windows `VRPTW` where the locations have " -"time windows within which the vehicle's visits must be made." -msgstr "" -"Vehicle Routing Problem with Time Windows `VRPTW` där platserna har " -"tidsfönster inom vilka fordonets besök måste göras." +msgid "Vehicle Routing Problem with Time Windows `VRPTW` where the locations have time windows within which the vehicle's visits must be made." +msgstr "Vehicle Routing Problem with Time Windows `VRPTW` där platserna har tidsfönster inom vilka fordonets besök måste göras." -msgid "" -"Vehicle Routing Problem with Pickup and Delivery `VRPPD` where a number of " -"goods need to be moved from certain pickup locations to other delivery " -"locations." -msgstr "" -"Vehicle Routing Problem with Pickup and Delivery `VRPPD` där ett antal varor " -"måste flyttas från vissa upphämtningsplatser till andra leveransplatser." +msgid "Vehicle Routing Problem with Pickup and Delivery `VRPPD` where a number of goods need to be moved from certain pickup locations to other delivery locations." +msgstr "Vehicle Routing Problem with Pickup and Delivery `VRPPD` där ett antal varor måste flyttas från vissa upphämtningsplatser till andra leveransplatser." msgid "Limitations" msgstr "Begränsningar" @@ -763,12 +636,8 @@ msgstr "Kortare väntetid är bättre." msgid "Pick & Delivery" msgstr "Pick & Delivery" -msgid "" -"Problem: `CVRPPDTW` Capacitated Pick and Delivery Vehicle Routing problem " -"with Time Windows" -msgstr "" -"Problem: `CVRPPDTW` Kapaciterade plock- och leveransfordons ruttproblem med " -"tidsfönster" +msgid "Problem: `CVRPPDTW` Capacitated Pick and Delivery Vehicle Routing problem with Time Windows" +msgstr "Problem: `CVRPPDTW` Kapaciterade plock- och leveransfordons ruttproblem med tidsfönster" msgid "Times are relative to `0`" msgstr "Tiden är relativ till `0`" @@ -797,12 +666,8 @@ msgstr "Ha öppet- och stängningstider för upphämtnings- och leveransplatsern msgid "Have pickup and delivery duration service times." msgstr "Har servicetider för upphämtning och leveranstid." -msgid "" -"have a demand request for moving goods from the pickup location to the " -"delivery location." -msgstr "" -"har en begäran om att få flytta varor från upphämtningsplatsen till " -"leveransplatsen." +msgid "have a demand request for moving goods from the pickup location to the delivery location." +msgstr "har en begäran om att få flytta varor från upphämtningsplatsen till leveransplatsen." msgid "Time based calculations:" msgstr "Tidsbaserade beräkningar:" @@ -891,16 +756,11 @@ msgstr "``3`` Tryck tillbaka order." msgid "``4`` Optimize insert." msgstr "``4`` Optimera insättning." -msgid "" -"``5`` Push back order that allows more orders to be inserted at the back" -msgstr "" -"``5`` Push back-order som gör det möjligt att lägga in fler order på baksidan" +msgid "``5`` Push back order that allows more orders to be inserted at the back" +msgstr "``5`` Push back-order som gör det möjligt att lägga in fler order på baksidan" -msgid "" -"``6`` Push front order that allows more orders to be inserted at the front" -msgstr "" -"``6`` Push front order som gör det möjligt att lägga in fler order längst " -"fram" +msgid "``6`` Push front order that allows more orders to be inserted at the front" +msgstr "``6`` Push front order som gör det möjligt att lägga in fler order längst fram" msgid "Orders SQL" msgstr "`beställningar SQL`_" @@ -962,39 +822,23 @@ msgstr "[``d_service``]" msgid "The duration of the unloading at the delivery location." msgstr "Varaktigheten av lossningen på leveransplatsen." -msgid "" -"For :doc:`pgr_pickDeliver` the pickup and delivery identifiers of the " -"locations are needed:" -msgstr "" -"För :doc:`pgr_pickDeliver` behövs identifierarna för upphämtning och " -"leverans av platserna:" +msgid "For :doc:`pgr_pickDeliver` the pickup and delivery identifiers of the locations are needed:" +msgstr "För :doc:`pgr_pickDeliver` behövs identifierarna för upphämtning och leverans av platserna:" msgid "``p_node_id``" msgstr "``p_node_id``" -msgid "" -"The node identifier of the pickup, must match a vertex identifier in the " -"`Matrix SQL`_." -msgstr "" -"Pickupens nodidentifierare måste matcha en vertexidentifierare i `Matrix " -"SQL`_." +msgid "The node identifier of the pickup, must match a vertex identifier in the `Matrix SQL`_." +msgstr "Pickupens nodidentifierare måste matcha en vertexidentifierare i `Matrix SQL`_." msgid "``d_node_id``" msgstr "``d_node_id``" -msgid "" -"The node identifier of the delivery, must match a vertex identifier in the " -"`Matrix SQL`_." -msgstr "" -"Leveransens nodidentifierare måste matcha en vertexidentifierare i `Matrix " -"SQL`_." +msgid "The node identifier of the delivery, must match a vertex identifier in the `Matrix SQL`_." +msgstr "Leveransens nodidentifierare måste matcha en vertexidentifierare i `Matrix SQL`_." -msgid "" -"For :doc:`pgr_pickDeliverEuclidean` the :math:`(x, y)` values of the " -"locations are needed:" -msgstr "" -"För :doc:`pgr_pickDeliverEuclidean` behövs :math:`(x, y)`-värdena för " -"platserna:" +msgid "For :doc:`pgr_pickDeliverEuclidean` the :math:`(x, y)` values of the locations are needed:" +msgstr "För :doc:`pgr_pickDeliverEuclidean` behövs :math:`(x, y)`-värdena för platserna:" msgid "``p_x``" msgstr "``p_x``" @@ -1083,31 +927,20 @@ msgstr "Längden på lastningen vid slutplatsen." msgid "When missing: A duration in ``start_service`` is used." msgstr "När den saknas: En varaktighet i ``start_service`` används." -msgid "" -"For :doc:`pgr_pickDeliver` the starting and ending identifiers of the " -"locations are needed:" -msgstr "" -"För :doc:`pgr_pickDeliver` behövs start- och slutidentifierare för platserna:" +msgid "For :doc:`pgr_pickDeliver` the starting and ending identifiers of the locations are needed:" +msgstr "För :doc:`pgr_pickDeliver` behövs start- och slutidentifierare för platserna:" msgid "``start_node_id``" msgstr "``start_node_id``" -msgid "" -"The node identifier of the start location, must match a vertex identifier in " -"the `Matrix SQL`_." -msgstr "" -"Startplatsens nodidentifierare måste matcha en vertexidentifierare i `Matrix " -"SQL`_." +msgid "The node identifier of the start location, must match a vertex identifier in the `Matrix SQL`_." +msgstr "Startplatsens nodidentifierare måste matcha en vertexidentifierare i `Matrix SQL`_." msgid "[``end_node_id``]" msgstr "[``end_node_id``]" -msgid "" -"The node identifier of the end location, must match a vertex identifier in " -"the `Matrix SQL`_." -msgstr "" -"Nodeidentifieraren för slutpositionen måste matcha en vertexidentifierare i " -"`Matrix SQL`_." +msgid "The node identifier of the end location, must match a vertex identifier in the `Matrix SQL`_." +msgstr "Nodeidentifieraren för slutpositionen måste matcha en vertexidentifierare i `Matrix SQL`_." msgid "When missing: ``end_node_id`` is used." msgstr "När den saknas: ``end_node_id`` används." @@ -1166,12 +999,8 @@ msgstr "Sekventiellt värde med början från **1**." msgid "``vehicle_seq``" msgstr "``fordon_seq``" -msgid "" -"Sequential value starting from **1** for current vehicles. The :math:`n_{th}" -"` vehicle in the solution." -msgstr "" -"Sekventiellt värde med början från **1** för aktuella fordon. Fordonet :math:" -"`n_{th}` i lösningen." +msgid "Sequential value starting from **1** for current vehicles. The :math:`n_{th}` vehicle in the solution." +msgstr "Sekventiellt värde med början från **1** för aktuella fordon. Fordonet :math:`n_{th}` i lösningen." msgid "Value :math:`-2` indicates it is the summary row." msgstr "Värdet :math:`-2` anger att det är den sammanfattande raden." @@ -1188,11 +1017,8 @@ msgstr "Aktuell fordonsidentifiering." msgid "Summary row has the **total capacity violations**." msgstr "Sammanfattningsraden har **totala kapacitetsöverträdelser**." -msgid "" -"A capacity violation happens when overloading or underloading a vehicle." -msgstr "" -"En kapacitetsöverträdelse inträffar när ett fordon överlastas eller " -"underlastas." +msgid "A capacity violation happens when overloading or underloading a vehicle." +msgstr "En kapacitetsöverträdelse inträffar när ett fordon överlastas eller underlastas." msgid "``stop_seq``" msgstr "``stopp_seq``" @@ -1200,21 +1026,14 @@ msgstr "``stopp_seq``" msgid "INTEGER" msgstr "INTEGER" -msgid "" -"Sequential value starting from **1** for the stops made by the current " -"vehicle. The :math:`m_{th}` stop of the current vehicle." -msgstr "" -"Sekventiellt värde med början från **1** för de stopp som görs av det " -"aktuella fordonet. Stoppet :math:`m_{th}` för det aktuella fordonet." +msgid "Sequential value starting from **1** for the stops made by the current vehicle. The :math:`m_{th}` stop of the current vehicle." +msgstr "Sekventiellt värde med början från **1** för de stopp som görs av det aktuella fordonet. Stoppet :math:`m_{th}` för det aktuella fordonet." msgid "Summary row has the **total time windows violations**." msgstr "Sammanfattning rad har **total tid fönster överträdelser**." -msgid "" -"A time window violation happens when arriving after the location has closed." -msgstr "" -"En överträdelse av tidsfönstret inträffar när man anländer efter att platsen " -"har stängt." +msgid "A time window violation happens when arriving after the location has closed." +msgstr "En överträdelse av tidsfönstret inträffar när man anländer efter att platsen har stängt." msgid "``stop_type``" msgstr "``stopp_typ``" @@ -1243,11 +1062,8 @@ msgstr "``order_id``" msgid "Pickup-Delivery order pair identifier." msgstr "Identifierare för orderparet hämtning-leverans." -msgid "" -"Value :math:`-1`: When no order is involved on the current stop location." -msgstr "" -"Värde :math:`-1`: När ingen order är involverad på den aktuella " -"stoppositionen." +msgid "Value :math:`-1`: When no order is involved on the current stop location." +msgstr "Värde :math:`-1`: När ingen order är involverad på den aktuella stoppositionen." msgid "``cargo``" msgstr "``cargo``" @@ -1313,18 +1129,13 @@ msgid ":math:`arrival\\_time + wait\\_time + service\\_time`." msgstr ":math:`arrival\\_time + wait\\_time + service\\_time`." msgid "The ending location has the **total time** used by the current vehicle." -msgstr "" -"Slutplatsen har den **totala tid** som använts av det aktuella fordonet." +msgstr "Slutplatsen har den **totala tid** som använts av det aktuella fordonet." msgid "Summary row has the **total solution time**:" msgstr "Sammanfattningsraden har den **totala lösningstiden**:" -msgid "" -":math:`total\\ traveling\\ time + total\\ waiting\\ time + total\\ service\\ " -"time`." -msgstr "" -":math:`total\\ traveling\\ time + total\\ waiting\\ time + total\\ service\\ " -"time`." +msgid ":math:`total\\ traveling\\ time + total\\ waiting\\ time + total\\ service\\ time`." +msgstr ":math:`total\\ traveling\\ time + total\\ waiting\\ time + total\\ service\\ time`." msgid "Summary Row" msgstr "Sammanfattande rad" @@ -1353,14 +1164,8 @@ msgstr "**total servicetid**:" msgid "Handling Parameters" msgstr "Parametrar för hantering" -msgid "" -"To define a problem, several considerations have to be done, to get " -"consistent results. This section gives an insight of how parameters are to " -"be considered." -msgstr "" -"För att definiera ett problem måste flera överväganden göras för att få " -"konsekventa resultat. Detta avsnitt ger en inblick i hur parametrar ska " -"beaktas." +msgid "To define a problem, several considerations have to be done, to get consistent results. This section gives an insight of how parameters are to be considered." +msgstr "För att definiera ett problem måste flera överväganden göras för att få konsekventa resultat. Detta avsnitt ger en inblick i hur parametrar ska beaktas." msgid "`Capacity and Demand Units Handling`_" msgstr "`Hantering av kapacitets- och efterfrågeenheter`_" @@ -1395,43 +1200,23 @@ msgstr "Antal lådor som får plats i fordonet." msgid "Number of seats in the vehicle" msgstr "Antal sittplatser i fordonet" -msgid "" -"The `demand` request of the pickup-deliver orders must use the same units as " -"the units used in the vehicle's `capacity`." -msgstr "" -"Begäran om hämtnings- och leveransorder måste använda samma enheter som de " -"enheter som används i fordonets \"kapacitet\"." +msgid "The `demand` request of the pickup-deliver orders must use the same units as the units used in the vehicle's `capacity`." +msgstr "Begäran om hämtnings- och leveransorder måste använda samma enheter som de enheter som används i fordonets \"kapacitet\"." -msgid "" -"To handle problems like: 10 (equal dimension) boxes of apples and 5 kg of " -"feathers that are to be transported (not packed in boxes)." -msgstr "" -"För att hantera problem som t.ex: 10 (lika stora) lådor med äpplen och 5 kg " -"fjädrar som ska transporteras (inte packas i lådor)." +msgid "To handle problems like: 10 (equal dimension) boxes of apples and 5 kg of feathers that are to be transported (not packed in boxes)." +msgstr "För att hantera problem som t.ex: 10 (lika stora) lådor med äpplen och 5 kg fjädrar som ska transporteras (inte packas i lådor)." -msgid "" -"If the vehicle's **capacity** is measured in `boxes`, a conversion of `kg of " -"feathers` to `number of boxes` is needed." -msgstr "" -"Om fordonets **kapacitet** mäts i `lådor`, behövs en omvandling av `kg " -"fjädrar` till `antal lådor`." +msgid "If the vehicle's **capacity** is measured in `boxes`, a conversion of `kg of feathers` to `number of boxes` is needed." +msgstr "Om fordonets **kapacitet** mäts i `lådor`, behövs en omvandling av `kg fjädrar` till `antal lådor`." -msgid "" -"If the vehicle's **capacity** is measured in `kg`, a conversion of `box of " -"apples` to `kg` is needed." -msgstr "" -"Om fordonets **kapacitet** mäts i `kg`, krävs en omvandling av `låda äpplen` " -"till `kg`." +msgid "If the vehicle's **capacity** is measured in `kg`, a conversion of `box of apples` to `kg` is needed." +msgstr "Om fordonets **kapacitet** mäts i `kg`, krävs en omvandling av `låda äpplen` till `kg`." msgid "Showing how the 2 possible conversions can be done" msgstr "Visar hur de 2 möjliga konverteringarna kan göras" -msgid "" -"Let: - :math:`f\\_boxes`: number of boxes needed for `1` kg of feathers. - :" -"math:`a\\_weight`: weight of `1` box of apples." -msgstr "" -"Låt: - :math:`f\\_boxes`: antal boxar som behövs för `1` kg fjädrar. - :math:" -"`a\\_weight`: vikten på `1` låda med äpplen." +msgid "Let: - :math:`f\\_boxes`: number of boxes needed for `1` kg of feathers. - :math:`a\\_weight`: weight of `1` box of apples." +msgstr "Låt: - :math:`f\\_boxes`: antal boxar som behövs för `1` kg fjädrar. - :math:`a\\_weight`: vikten på `1` låda med äpplen." msgid "Capacity Units" msgstr "Kapacitetsenheter" @@ -1467,8 +1252,7 @@ msgid "The vehicles have :math:`(x, y)` pairs for start and ending locations." msgstr "Fordonen har :math:`(x, y)`-par för start- och slutplatser." msgid "The orders Have :math:`(x, y)` pairs for pickup and delivery locations." -msgstr "" -"Beställningarna har :math:`(x, y)`-par för upphämtnings- och leveransplatser." +msgstr "Beställningarna har :math:`(x, y)`-par för upphämtnings- och leveransplatser." msgid "When using :doc:`pgr_pickDeliver`:" msgstr "När du använder :doc:`pgr_pickDeliver`:" @@ -1477,8 +1261,7 @@ msgid "The vehicles have identifiers for the start and ending locations." msgstr "Fordonen har identifierare för start- och slutplatserna." msgid "The orders have identifiers for the pickup and delivery locations." -msgstr "" -"Beställningarna har identifierare för upphämtnings- och leveransplatserna." +msgstr "Beställningarna har identifierare för upphämtnings- och leveransplatserna." msgid "All the identifiers are indices to the given matrix." msgstr "Alla identifierare är index till den givna matrisen." @@ -1486,19 +1269,11 @@ msgstr "Alla identifierare är index till den givna matrisen." msgid "Time Handling" msgstr "Tidshantering" -msgid "" -"The times are relative to **0**. All time units have to be converted to a " -"**0** reference and the same time units." -msgstr "" -"Tiderna är relativa till **0**. Alla tidsenheter måste konverteras till en " -"referens på **0** och samma tidsenheter." +msgid "The times are relative to **0**. All time units have to be converted to a **0** reference and the same time units." +msgstr "Tiderna är relativa till **0**. Alla tidsenheter måste konverteras till en referens på **0** och samma tidsenheter." -msgid "" -"Suppose that a vehicle's driver starts the shift at 9:00 am and ends the " -"shift at 4:30 pm and the service time duration is 10 minutes with 30 seconds." -msgstr "" -"Anta att en fordonsförare börjar sitt skift kl. 9.00 och slutar kl. 16.30 " -"och att servicetiden är 10 minuter och 30 sekunder." +msgid "Suppose that a vehicle's driver starts the shift at 9:00 am and ends the shift at 4:30 pm and the service time duration is 10 minutes with 30 seconds." +msgstr "Anta att en fordonsförare börjar sitt skift kl. 9.00 och slutar kl. 16.30 och att servicetiden är 10 minuter och 30 sekunder." msgid "Meaning of 0" msgstr "Betydelsen av 0" @@ -1554,12 +1329,8 @@ msgstr ":math:`7.5*60 = 540`" msgid "Factor handling" msgstr "Faktorhantering" -msgid "" -"``factor`` acts as a multiplier to convert from distance values to time " -"units the matrix values or the euclidean values." -msgstr "" -"``factor`` fungerar som en multiplikator för att konvertera matrisvärden " -"eller euklidiska värden från avståndsvärden till tidsenheter." +msgid "``factor`` acts as a multiplier to convert from distance values to time units the matrix values or the euclidean values." +msgstr "``factor`` fungerar som en multiplikator för att konvertera matrisvärden eller euklidiska värden från avståndsvärden till tidsenheter." msgid "When the values are already in the desired time units" msgstr "När värdena redan är i önskad tidsenhet" @@ -1576,13 +1347,8 @@ msgstr "När ``faktor`` < 1 är restiderna långsammare" msgid "For the :doc:`pgr_pickDeliverEuclidean`:" msgstr "För :doc:`pgr_pickDeliverEuclidean`:" -msgid "" -"Working with time units in seconds, and x/y in lat/lon: Factor: would depend " -"on the location of the points and on the average velocity say 25m/s is the " -"velocity." -msgstr "" -"Arbeta med tidsenheter i sekunder och x/y i lat/lon: Faktor: skulle bero på " -"punkternas läge och på medelhastigheten, säg att 25 m/s är hastigheten." +msgid "Working with time units in seconds, and x/y in lat/lon: Factor: would depend on the location of the points and on the average velocity say 25m/s is the velocity." +msgstr "Arbeta med tidsenheter i sekunder och x/y i lat/lon: Faktor: skulle bero på punkternas läge och på medelhastigheten, säg att 25 m/s är hastigheten." msgid "Latitude" msgstr "Latitud" @@ -1611,12 +1377,8 @@ msgstr "4452 s" msgid "For the :doc:`pgr_pickDeliver`:" msgstr "För :doc:`pgr_pickDeliver`:" -msgid "" -"Given :math:`v = d / t` therefore :math:`t = d / v` And the ``factor`` " -"becomes :math:`1 / v`" -msgstr "" -"Med tanke på :math:`v = d / t` därför :math:`t = d / v` Och ``faktorn`` " -"blir :math:`1 / v`" +msgid "Given :math:`v = d / t` therefore :math:`t = d / v` And the ``factor`` becomes :math:`1 / v`" +msgstr "Med tanke på :math:`v = d / t` därför :math:`t = d / v` Och ``faktorn`` blir :math:`1 / v`" msgid "v" msgstr "v" @@ -1636,18 +1398,11 @@ msgstr "t" msgid "Time" msgstr "Tid" -msgid "" -"For the following equivalences :math:`10m/s \\approx 600m/min \\approx 36 km/" -"hr`" -msgstr "" -"För följande ekvivalenser :math:`10m/s \\approx 600m/min \\approx 36 km/tim`" +msgid "For the following equivalences :math:`10m/s \\approx 600m/min \\approx 36 km/hr`" +msgstr "För följande ekvivalenser :math:`10m/s \\approx 600m/min \\approx 36 km/tim`" -msgid "" -"Working with time units in seconds and the matrix been in meters: For a " -"1000m length value on the matrix:" -msgstr "" -"Arbeta med tidsenheter i sekunder och matrisen i meter: För ett 1000m " -"längdvärde på matrisen:" +msgid "Working with time units in seconds and the matrix been in meters: For a 1000m length value on the matrix:" +msgstr "Arbeta med tidsenheter i sekunder och matrisen i meter: För ett 1000m längdvärde på matrisen:" msgid "Units" msgstr "Enheter" @@ -1709,14 +1464,8 @@ msgstr ":doc:`sampledata`" msgid "A* - Family of functions" msgstr "A* - Familj av funktioner" -msgid "" -"The A* (pronounced \"A Star\") algorithm is based on Dijkstra's algorithm " -"with a heuristic that allow it to solve most shortest path problems by " -"evaluation only a sub-set of the overall graph." -msgstr "" -"Algoritmen A* (uttalas \"A Star\") är baserad på Dijkstras algoritm med en " -"heuristik som gör att den kan lösa de flesta problem med kortaste vägen " -"genom att endast utvärdera en delmängd av den totala grafen." +msgid "The A* (pronounced \"A Star\") algorithm is based on Dijkstra's algorithm with a heuristic that allow it to solve most shortest path problems by evaluation only a sub-set of the overall graph." +msgstr "Algoritmen A* (uttalas \"A Star\") är baserad på Dijkstras algoritm med en heuristik som gör att den kan lösa de flesta problem med kortaste vägen genom att endast utvärdera en delmängd av den totala grafen." msgid ":doc:`pgr_aStar` - A* algorithm for the shortest path." msgstr ":doc:`pgr_aStar` - A* algorithm for the shortest path." @@ -1725,8 +1474,7 @@ msgid ":doc:`pgr_aStarCost` - Get the aggregate cost of the shortest paths." msgstr ":doc:`pgr_aStarCost` - Get the aggregate cost of the shortest paths." msgid ":doc:`pgr_aStarCostMatrix` - Get the cost matrix of the shortest paths." -msgstr "" -":doc:`pgr_aStarCostMatrix` - Get the cost matrix of the shortest paths." +msgstr ":doc:`pgr_aStarCostMatrix` - Get the cost matrix of the shortest paths." msgid "The main Characteristics are:" msgstr "De viktigaste egenskaperna är:" @@ -1765,13 +1513,10 @@ msgid "``agg_cost`` from `v` to `u` is :math:`0`" msgstr "``agg_cost`` från `v` till `u`` är :math:`0``" msgid "When :math:`(x,y)` coordinates for the same vertex identifier differ:" -msgstr "" -"När :math:`(x,y)`-koordinaterna för samma toppunktsidentifierare skiljer sig " -"åt:" +msgstr "När :math:`(x,y)`-koordinaterna för samma toppunktsidentifierare skiljer sig åt:" msgid "A random selection of the vertex's :math:`(x,y)` coordinates is used." -msgstr "" -"Ett slumpmässigt urval av toppunktens :math:`(x,y)`-koordinater används." +msgstr "Ett slumpmässigt urval av toppunktens :math:`(x,y)`-koordinater används." msgid "Running time: :math:`O((E + V) * \\log V)`" msgstr "Drifttid: :math:`O((E + V) * \\log V)`" @@ -1786,8 +1531,7 @@ msgid "Heuristic number. Current valid values 0~5." msgstr "Heuristiskt nummer. Aktuella giltiga värden 0~5." msgid "0: :math:`h(v) = 0` (Use this value to compare with pgr_dijkstra)" -msgstr "" -"0: :math:`h(v) = 0` (Använd detta värde för att jämföra med pgr_dijkstra)" +msgstr "0: :math:`h(v) = 0` (Använd detta värde för att jämföra med pgr_dijkstra)" msgid "1: :math:`h(v) = abs(max(\\Delta x, \\Delta y))`" msgstr "1: :math:`h(v) = abs(max(\\Delta x, \\Delta y))`" @@ -1816,12 +1560,8 @@ msgstr "``epsilon``" msgid "For less restricted results. :math:`epsilon >= 1`." msgstr "För mindre begränsade resultat. :math:`epsilon >= 1`." -msgid "" -"See :ref:`heuristics ` available and :ref:`factor " -"` handling." -msgstr "" -"Se :ref:`heuristics ` tillgänglig och :ref:`factor " -"` hantering." +msgid "See :ref:`heuristics ` available and :ref:`factor ` handling." +msgstr "Se :ref:`heuristics ` tillgänglig och :ref:`factor ` hantering." msgid "Advanced documentation" msgstr "Avancerad dokumentation" @@ -1838,22 +1578,14 @@ msgstr "där :math:`\\Delta x = x_1 - x_0` och :math:`\\Delta y = y_1 - y_0`" msgid "Analysis 1" msgstr "Analys 1" -msgid "" -"Working with cost/reverse_cost as length in degrees, x/y in lat/lon: Factor " -"= 1 (no need to change units)" -msgstr "" -"Arbetar med kostnad/omvänd_kostnad som längd i grader, x/y i lat/lon: Faktor " -"= 1 (inget behov av att ändra enheter)" +msgid "Working with cost/reverse_cost as length in degrees, x/y in lat/lon: Factor = 1 (no need to change units)" +msgstr "Arbetar med kostnad/omvänd_kostnad som längd i grader, x/y i lat/lon: Faktor = 1 (inget behov av att ändra enheter)" msgid "Analysis 2" msgstr "Analys 2" -msgid "" -"Working with cost/reverse_cost as length in meters, x/y in lat/lon: Factor = " -"would depend on the location of the points:" -msgstr "" -"Arbetar med kostnad/omvänd_kostnad som längd i meter, x/y i lat/lon: Faktor " -"= skulle bero på punkternas läge:" +msgid "Working with cost/reverse_cost as length in meters, x/y in lat/lon: Factor = would depend on the location of the points:" +msgstr "Arbetar med kostnad/omvänd_kostnad som längd i meter, x/y i lat/lon: Faktor = skulle bero på punkternas läge:" msgid "1 longitude degree is 78846.81 m" msgstr "1 longitudgrad är 78846,81 m" @@ -1870,23 +1602,14 @@ msgstr "111319" msgid "Analysis 3" msgstr "Analys 3" -msgid "" -"Working with cost/reverse_cost as time in seconds, x/y in lat/lon: Factor: " -"would depend on the location of the points and on the average speed say 25m/" -"s is the speed." -msgstr "" -"Arbetar med kostnad/omvänd_kostnad som tid i sekunder, x/y i lat/lon: " -"Faktor: skulle bero på punkternas läge och på medelhastigheten, säg att 25 m/" -"s är hastigheten." +msgid "Working with cost/reverse_cost as time in seconds, x/y in lat/lon: Factor: would depend on the location of the points and on the average speed say 25m/s is the speed." +msgstr "Arbetar med kostnad/omvänd_kostnad som tid i sekunder, x/y i lat/lon: Faktor: skulle bero på punkternas läge och på medelhastigheten, säg att 25 m/s är hastigheten." msgid ":doc:`bdAstar-family`" msgstr ":doc:`bdAstar-family`" -msgid "" -"`Boost: A* search `__" -msgstr "" -"`Boost: A*-sökning `__" +msgid "`Boost: A* search `__" +msgstr "`Boost: A*-sökning `__" msgid "https://en.wikipedia.org/wiki/A*_search_algorithm" msgstr "https://en.wikipedia.org/wiki/A*_search_algorithm" @@ -1909,34 +1632,17 @@ msgstr "De viktigaste egenskaperna är:" msgid "It does not return a path." msgstr "Den returnerar inte någon sökväg." -msgid "" -"Returns the sum of the costs of the shortest path for each pair of nodes in " -"the graph." -msgstr "" -"Returnerar summan av kostnaderna för den kortaste vägen för varje par av " -"noder i grafen." +msgid "Returns the sum of the costs of the shortest path for each pair of nodes in the graph." +msgstr "Returnerar summan av kostnaderna för den kortaste vägen för varje par av noder i grafen." -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 returnerar en :math:`V \\times V`-matris, där oändlighetsvärdena. " -"Representerar avståndet mellan hörnpunkter för vilka det inte finns någon " -"väg." +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 returnerar en :math:`V \\times V`-matris, där oändlighetsvärdena. Representerar avståndet mellan hörnpunkter för vilka det inte finns någon väg." -msgid "" -"We return only the non infinity values in form of a set of `(start_vid, " -"end_vid, agg_cost)`." -msgstr "" -"Vi returnerar endast de värden som inte är oändliga i form av en uppsättning " -"`(start_vid, end_vid, agg_cost)`." +msgid "We return only the non infinity values in form of a set of `(start_vid, end_vid, agg_cost)`." +msgstr "Vi returnerar endast de värden som inte är oändliga i form av en uppsättning `(start_vid, end_vid, agg_cost)`." -msgid "" -"Let be the case the values returned are stored in a table, so the unique " -"index would be the pair: `(start_vid, end_vid)`." -msgstr "" -"Låt oss anta att de värden som returneras lagras i en tabell, så det unika " -"indexet skulle vara paret: `(start_vid, end_vid)`." +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 "Låt oss anta att de värden som returneras lagras i en tabell, så det unika indexet skulle vara paret: `(start_vid, end_vid)`." msgid "For the undirected graph, the results are symmetric." msgstr "För den oriktade grafen är resultaten symmetriska." @@ -2007,14 +1713,8 @@ msgstr "Test" msgid "One" msgstr "En" -msgid "" -"This test is not with a bounding box The density of the passed graph is " -"extremely low. For each 30 tests were executed to get the average The " -"tested query is:" -msgstr "" -"Detta test är inte med en bounding box Densiteten i den godkända grafen är " -"extremt låg. För varje utfördes 30 tester för att få fram " -"genomsnittet Den testade frågan är:" +msgid "This test is not with a bounding box The density of the passed graph is extremely low. For each 30 tests were executed to get the average The tested query is:" +msgstr "Detta test är inte med en bounding box Densiteten i den godkända grafen är extremt låg. För varje utfördes 30 tester för att få fram genomsnittet Den testade frågan är:" msgid "The results of this tests are presented as:" msgstr "Resultaten av dessa tester presenteras enligt följande:" @@ -2047,8 +1747,7 @@ msgid "Floyd-Warshall" msgstr "Floyd-Warshall" msgid "is the average execution time in seconds of pgr_floydWarshall." -msgstr "" -"är den genomsnittliga exekveringstiden i sekunder för pgr_floydWarshall." +msgstr "är den genomsnittliga exekveringstiden i sekunder för pgr_floydWarshall." msgid "Johnson" msgstr "Johnson" @@ -2356,14 +2055,8 @@ msgstr "6.51" msgid "Two" msgstr "Två" -msgid "" -"This test is with a bounding box The density of the passed graph higher than " -"of the Test One. For each 30 tests were executed to get the average " -"The tested edge query is:" -msgstr "" -"Detta test är med en avgränsande box Densiteten i den godkända grafen högre " -"än i test ett. För varje utfördes 30 tester för att få fram " -"genomsnittet Den testade kantfrågan är:" +msgid "This test is with a bounding box The density of the passed graph higher than of the Test One. For each 30 tests were executed to get the average The tested edge query is:" +msgstr "Detta test är med en avgränsande box Densiteten i den godkända grafen högre än i test ett. För varje utfördes 30 tester för att få fram genomsnittet Den testade kantfrågan är:" msgid "The tested queries" msgstr "De testade frågorna" @@ -2665,57 +2358,28 @@ msgstr ":doc:`pgr_johnson`" msgid ":doc:`pgr_floydWarshall`" msgstr ":doc:`pgr_floydWarshall`" -msgid "" -"Boost `floyd-Warshall `__" -msgstr "" -"Boost `floyd-Warshall `__" +msgid "Boost `floyd-Warshall `__" +msgstr "Boost `floyd-Warshall `__" msgid "Bidirectional A* - Family of functions" msgstr "Dubbelriktad A* - Familj av funktioner" -msgid "" -"The bidirectional A* (pronounced \"A Star\") algorithm is based on the A* " -"algorithm." -msgstr "" -"Den dubbelriktade algoritmen A* (uttalas \"A Star\") är baserad på A*-" -"algoritmen." +msgid "The bidirectional A* (pronounced \"A Star\") algorithm is based on the A* algorithm." +msgstr "Den dubbelriktade algoritmen A* (uttalas \"A Star\") är baserad på A*-algoritmen." msgid ":doc:`pgr_bdAstar` - Bidirectional A* algorithm for obtaining paths." msgstr ":doc:`pgr_bdAstar` - Bidirectional A* algorithm for obtaining paths." -msgid "" -":doc:`pgr_bdAstarCost` - Bidirectional A* algorithm to calculate the cost of " -"the paths." -msgstr "" -":doc:`pgr_bdAstarCost` - Bidirectional A* algorithm to calculate the cost of " -"the paths." +msgid ":doc:`pgr_bdAstarCost` - Bidirectional A* algorithm to calculate the cost of the paths." +msgstr ":doc:`pgr_bdAstarCost` - Bidirectional A* algorithm to calculate the cost of the paths." -msgid "" -":doc:`pgr_bdAstarCostMatrix` - Bidirectional A* algorithm to calculate a " -"cost matrix of paths." -msgstr "" -":doc:`pgr_bdAstarCostMatrix` - Bidirectional A* algorithm to calculate a " -"cost matrix of paths." +msgid ":doc:`pgr_bdAstarCostMatrix` - Bidirectional A* algorithm to calculate a cost matrix of paths." +msgstr ":doc:`pgr_bdAstarCostMatrix` - Bidirectional A* algorithm to calculate a cost matrix of paths." -msgid "" -"Based on A* algorithm, the bidirectional search finds a shortest path from a " -"starting vertex (``start_vid``) to an ending vertex (``end_vid``). It runs " -"two simultaneous searches: one forward from the ``start_vid``, and one " -"backward from the ``end_vid``, stopping when the two meet in the middle. " -"This implementation can be used with a directed graph and an undirected " -"graph." -msgstr "" -"Baserat på A*-algoritmen hittar den dubbelriktade sökningen den kortaste " -"vägen från ett startvertex (``start_vid``) till ett slutvertex " -"(``end_vid``). Den kör två samtidiga sökningar: en framåt från ``start_vid`` " -"och en bakåt från ``slut_vid``, och stannar när de två möts i mitten. Den " -"här implementationen kan användas med en riktad graf och en oriktad graf." +msgid "Based on A* algorithm, the bidirectional search finds a shortest path from a starting vertex (``start_vid``) to an ending vertex (``end_vid``). It runs two simultaneous searches: one forward from the ``start_vid``, and one backward from the ``end_vid``, stopping when the two meet in the middle. This implementation can be used with a directed graph and an undirected graph." +msgstr "Baserat på A*-algoritmen hittar den dubbelriktade sökningen den kortaste vägen från ett startvertex (``start_vid``) till ett slutvertex (``end_vid``). Den kör två samtidiga sökningar: en framåt från ``start_vid`` och en bakåt från ``slut_vid``, och stannar när de två möts i mitten. Den här implementationen kan användas med en riktad graf och en oriktad graf." -msgid "" -"For large graphs where there is a path between the starting vertex and " -"ending vertex:" +msgid "For large graphs where there is a path between the starting vertex and ending vertex:" msgstr "För stora grafer där det finns en väg mellan start- och slutvertexen:" msgid "It is expected to terminate faster than :doc:`pgr_aStar`" @@ -2727,54 +2391,29 @@ msgstr ":doc:`aStar-family`" msgid "Bidirectional Dijkstra - Family of functions" msgstr "Dubbelriktad Dijkstra - Familj av funktioner" -msgid "" -":doc:`pgr_bdDijkstra` - Bidirectional Dijkstra algorithm for the shortest " -"paths." -msgstr "" -":doc:`pgr_bdDijkstra` - Bidirectional Dijkstra algorithm for the shortest " -"paths." +msgid ":doc:`pgr_bdDijkstra` - Bidirectional Dijkstra algorithm for the shortest paths." +msgstr ":doc:`pgr_bdDijkstra` - Bidirectional Dijkstra algorithm for the shortest paths." -msgid "" -":doc:`pgr_bdDijkstraCost` - Bidirectional Dijkstra to calculate the cost of " -"the shortest paths" -msgstr "" -":doc:`pgr_bdDijkstraCost` - Bidirectional Dijkstra to calculate the cost of " -"the shortest paths" +msgid ":doc:`pgr_bdDijkstraCost` - Bidirectional Dijkstra to calculate the cost of the shortest paths" +msgstr ":doc:`pgr_bdDijkstraCost` - Bidirectional Dijkstra to calculate the cost of the shortest paths" -msgid "" -":doc:`pgr_bdDijkstraCostMatrix` - Bidirectional Dijkstra algorithm to create " -"a matrix of costs of the shortest paths." -msgstr "" -":doc:`pgr_bdDijkstraCostMatrix` - Bidirectional Dijkstra algorithm to create " -"a matrix of costs of the shortest paths." +msgid ":doc:`pgr_bdDijkstraCostMatrix` - Bidirectional Dijkstra algorithm to create a matrix of costs of the shortest paths." +msgstr ":doc:`pgr_bdDijkstraCostMatrix` - Bidirectional Dijkstra algorithm to create a matrix of costs of the shortest paths." msgid "Synopsis" msgstr "Sammanfattning" -msgid "" -"Based on Dijkstra's algorithm, the bidirectional search finds a shortest " -"path a starting vertex to an ending vertex." -msgstr "" -"Baserat på Dijkstras algoritm hittar den dubbelriktade sökningen den " -"kortaste vägen från en startpunkt till en slutpunkt." +msgid "Based on Dijkstra's algorithm, the bidirectional search finds a shortest path a starting vertex to an ending vertex." +msgstr "Baserat på Dijkstras algoritm hittar den dubbelriktade sökningen den kortaste vägen från en startpunkt till en slutpunkt." -msgid "" -"It runs two simultaneous searches: one forward from the source, and one " -"backward from the target, stopping when the two meet in the middle." -msgstr "" -"Den kör två samtidiga sökningar: en framåt från källan och en bakåt från " -"målet, och stannar när de två möts i mitten." +msgid "It runs two simultaneous searches: one forward from the source, and one backward from the target, stopping when the two meet in the middle." +msgstr "Den kör två samtidiga sökningar: en framåt från källan och en bakåt från målet, och stannar när de två möts i mitten." -msgid "" -"This implementation can be used with a directed graph and an undirected " -"graph." -msgstr "" -"Denna implementation kan användas med en riktad graf och en oriktad graf." +msgid "This implementation can be used with a directed graph and an undirected graph." +msgstr "Denna implementation kan användas med en riktad graf och en oriktad graf." -msgid "" -"A negative value on a cost column is interpreted as the edge does not exist." -msgstr "" -"Ett negativt värde i en kostnadskolumn tolkas som att kanten inte existerar." +msgid "A negative value on a cost column is interpreted as the edge does not exist." +msgstr "Ett negativt värde i en kostnadskolumn tolkas som att kanten inte existerar." msgid "When there is no path:" msgstr "När det inte finns någon väg:" @@ -2782,37 +2421,22 @@ msgstr "När det inte finns någon väg:" msgid "When the starting vertex and ending vertex are the same." msgstr "När startvertex och slutvertex är desamma." -msgid "" -"The **aggregate cost** of the non included values :math:`(v, v)` is :math:`0`" -msgstr "" -"Den **samlade kostnaden** för de icke inkluderade värdena :math:`(v, v)` är :" -"math:`0`" +msgid "The **aggregate cost** of the non included values :math:`(v, v)` is :math:`0`" +msgstr "Den **samlade kostnaden** för de icke inkluderade värdena :math:`(v, v)` är :math:`0`" -msgid "" -"When the starting vertex and ending vertex are the different and there is no " -"path:" +msgid "When the starting vertex and ending vertex are the different and there is no path:" msgstr "När startvertex och slutvertex är olika och det inte finns någon väg:" -msgid "" -"The **aggregate cost** the non included values :math:`(u, v)` is :math:" -"`\\infty`" -msgstr "" -"Den **samlade kostnaden** för de icke inkluderade värdena :math:`(u, v)` är :" -"math:`\\infty`" +msgid "The **aggregate cost** the non included values :math:`(u, v)` is :math:`\\infty`" +msgstr "Den **samlade kostnaden** för de icke inkluderade värdena :math:`(u, v)` är :math:`\\infty`" -msgid "" -"For optimization purposes, any duplicated value in the starting vertices or " -"on the ending vertices are ignored." -msgstr "" -"För optimeringsändamål ignoreras alla duplicerade värden i startpunkterna " -"eller på slutpunkterna." +msgid "For optimization purposes, any duplicated value in the starting vertices or on the ending vertices are ignored." +msgstr "För optimeringsändamål ignoreras alla duplicerade värden i startpunkterna eller på slutpunkterna." msgid "Running time (worse case scenario): :math:`O((V \\log V + E))`" msgstr "Körtid (värsta tänkbara scenario): :math:`O((V \\log V + E))`" -msgid "" -"For large graphs where there is a path bewtween the starting vertex and " -"ending vertex:" +msgid "For large graphs where there is a path bewtween the starting vertex and ending vertex:" msgstr "För stora grafer där det finns en väg mellan start- och slutvertexen:" msgid "It is expected to terminate faster than :doc:`pgr_dijkstra`" @@ -2842,32 +2466,20 @@ msgstr "Drifttid: :math:`O(E * (E + V * logV))`" msgid "Graph must be connected." msgstr "Grafen måste vara ansluten." -msgid "" -"An Edges SQL that represents a **directed** graph with the following columns" -msgstr "" -"En Edges SQL som representerar en **riktad** graf med följande kolumner" +msgid "An Edges SQL that represents a **directed** graph with the following columns" +msgstr "En Edges SQL som representerar en **riktad** graf med följande kolumner" msgid "Coloring - Family of functions" msgstr "Färgläggning - Familj av funktioner" -msgid "" -":doc:`pgr_sequentialVertexColoring` - Vertex coloring algorithm using greedy " -"approach." -msgstr "" -":doc:`pgr_sequentialVertexColoring` - Vertex coloring algorithm using greedy " -"approach." +msgid ":doc:`pgr_sequentialVertexColoring` - Vertex coloring algorithm using greedy approach." +msgstr ":doc:`pgr_sequentialVertexColoring` - Vertex coloring algorithm using greedy approach." -msgid "" -":doc:`pgr_bipartite` - Bipartite graph algorithm using a DFS-based coloring " -"approach." -msgstr "" -":doc:`pgr_bipartite` - Bipartite graph algorithm using a DFS-based coloring " -"approach." +msgid ":doc:`pgr_bipartite` - Bipartite graph algorithm using a DFS-based coloring approach." +msgstr ":doc:`pgr_bipartite` - Bipartite graph algorithm using a DFS-based coloring approach." -msgid "" -":doc:`pgr_edgeColoring` - Edge Coloring algorithm using Vizing's theorem." -msgstr "" -":doc:`pgr_edgeColoring` - Edge Coloring algorithm using Vizing's theorem." +msgid ":doc:`pgr_edgeColoring` - Edge Coloring algorithm using Vizing's theorem." +msgstr ":doc:`pgr_edgeColoring` - Edge Coloring algorithm using Vizing's theorem." msgid "Returns set of |result_edge_color|" msgstr "Returnerar uppsättning av |result_edge_color|" @@ -2890,37 +2502,23 @@ msgstr "Identifierare för noden." msgid "Color of the node." msgstr "Färg på noden." -msgid "" -"`Boost: `__" -msgstr "" -"`Boost: `__" +msgid "`Boost: `__" +msgstr "`Boost: `__" msgid "Components - Family of functions" msgstr "Komponenter - Familj av funktioner" -msgid "" -":doc:`pgr_connectedComponents` - Connected components of an undirected graph." -msgstr "" -":doc:`pgr_connectedComponents` - Connected components of an undirected graph." +msgid ":doc:`pgr_connectedComponents` - Connected components of an undirected graph." +msgstr ":doc:`pgr_connectedComponents` - Connected components of an undirected graph." -msgid "" -":doc:`pgr_strongComponents` - Strongly connected components of a directed " -"graph." -msgstr "" -":doc:`pgr_strongComponents` - Strongly connected components of a directed " -"graph." +msgid ":doc:`pgr_strongComponents` - Strongly connected components of a directed graph." +msgstr ":doc:`pgr_strongComponents` - Strongly connected components of a directed graph." -msgid "" -":doc:`pgr_biconnectedComponents` - Biconnected components of an undirected " -"graph." -msgstr "" -":doc:`pgr_biconnectedComponents` - Biconnected components of an undirected " -"graph." +msgid ":doc:`pgr_biconnectedComponents` - Biconnected components of an undirected graph." +msgstr ":doc:`pgr_biconnectedComponents` - Biconnected components of an undirected graph." -msgid "" -":doc:`pgr_articulationPoints` - Articulation points of an undirected graph." -msgstr "" -":doc:`pgr_articulationPoints` - Articulation points of an undirected graph." +msgid ":doc:`pgr_articulationPoints` - Articulation points of an undirected graph." +msgstr ":doc:`pgr_articulationPoints` - Articulation points of an undirected graph." msgid ":doc:`pgr_bridges` - Bridges of an undirected graph." msgstr ":doc:`pgr_bridges` - Bridges of an undirected graph." @@ -2943,29 +2541,11 @@ msgstr ":doc:`pgr_contractionLinear`" msgid ":doc:`pgr_contractionHierarchies`" msgstr ":doc:`pgr_contractionHierarchies`" -msgid "" -"In large graphs, like road graphs or electric networks, graph contraction " -"can be used to speed up some graph algorithms. Contraction can reduce the " -"size of the graph by removing some of the vertices and edges and adding " -"edges that represent a sequence of original edges (the original ones can be " -"kept in some methods). In this way, it decreases the total time and space " -"used by graph algorithms, particularly those searching for an optimal path." -msgstr "" -"I stora grafer, t.ex. väggrafer eller elnät, kan grafkontraktion användas " -"för att snabba upp vissa grafalgoritmer. Kontraktion kan minska storleken på " -"grafen genom att ta bort några av topparna och kanterna och lägga till " -"kanter som representerar en sekvens av ursprungliga kanter (de ursprungliga " -"kanterna kan behållas i vissa metoder). På så sätt minskar den totala tiden " -"och utrymmet som används av grafalgoritmer, särskilt de som söker efter en " -"optimal väg." +msgid "In large graphs, like road graphs or electric networks, graph contraction can be used to speed up some graph algorithms. Contraction can reduce the size of the graph by removing some of the vertices and edges and adding edges that represent a sequence of original edges (the original ones can be kept in some methods). In this way, it decreases the total time and space used by graph algorithms, particularly those searching for an optimal path." +msgstr "I stora grafer, t.ex. väggrafer eller elnät, kan grafkontraktion användas för att snabba upp vissa grafalgoritmer. Kontraktion kan minska storleken på grafen genom att ta bort några av topparna och kanterna och lägga till kanter som representerar en sekvens av ursprungliga kanter (de ursprungliga kanterna kan behållas i vissa metoder). På så sätt minskar den totala tiden och utrymmet som används av grafalgoritmer, särskilt de som söker efter en optimal väg." -msgid "" -"This implementation gives a flexible framework for adding contraction " -"algorithms in the future. Currently, it supports three algorithms." -msgstr "" -"Denna implementering ger ett flexibelt ramverk för att lägga till " -"sammandragningsalgoritmer i framtiden. För närvarande stöder den tre " -"algoritmer." +msgid "This implementation gives a flexible framework for adding contraction algorithms in the future. Currently, it supports three algorithms." +msgstr "Denna implementering ger ett flexibelt ramverk för att lägga till sammandragningsalgoritmer i framtiden. För närvarande stöder den tre algoritmer." msgid "Dead end contraction" msgstr "Kontraktion i återvändsgränd" @@ -2976,24 +2556,14 @@ msgstr "Linjär sammandragning" msgid "Contraction hierarchies" msgstr "Sammandragningshierarkier" -msgid "" -"The two first ones can be combined through a iterative procedure, via the " -"``pgr_contraction`` method. The third one is implemented on its own." -msgstr "" -"De två första kan kombineras genom ett iterativt förfarande, via metoden " -"``pgr_contraction``. Den tredje är implementerad på egen hand." +msgid "The two first ones can be combined through a iterative procedure, via the ``pgr_contraction`` method. The third one is implemented on its own." +msgstr "De två första kan kombineras genom ett iterativt förfarande, via metoden ``pgr_contraction``. Den tredje är implementerad på egen hand." msgid "All functions allow the user to forbid contraction on a set of nodes." -msgstr "" -"Alla funktioner gör det möjligt för användaren att förbjuda sammandragning " -"på en uppsättning noder." +msgstr "Alla funktioner gör det möjligt för användaren att förbjuda sammandragning på en uppsättning noder." -msgid "" -"https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/" -"lecture16.pdf" -msgstr "" -"https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/" -"lecture16.pdf" +msgid "https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/lecture16.pdf" +msgstr "https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/lecture16.pdf" msgid "https://ae.iti.kit.edu/download/diploma_thesis_geisberger.pdf" msgstr "https://ae.iti.kit.edu/download/diploma_thesis_geisberger.pdf" @@ -3025,36 +2595,20 @@ msgstr ":doc:`pgr_withPointsCost`" msgid "Each function works as part of the family it belongs to." msgstr "Varje funktion fungerar som en del av den familj den tillhör." -msgid "" -"Returns the sum of the costs of the shortest path of each pair combination " -"of nodes requested." -msgstr "" -"Returnerar summan av kostnaderna för den kortaste vägen för varje begärd " -"parkombination av noder." +msgid "Returns the sum of the costs of the shortest path of each pair combination of nodes requested." +msgstr "Returnerar summan av kostnaderna för den kortaste vägen för varje begärd parkombination av noder." -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 "" -"Låt oss anta att de värden som returneras lagras i en tabell, så det unika " -"indexet skulle vara paret: ``(start_vid, end_vid)``." +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 "Låt oss anta att de värden som returneras lagras i en tabell, så det unika indexet skulle vara paret: ``(start_vid, end_vid)``." -msgid "" -"Depending on the function and its parameters, the results can be symmetric." -msgstr "" -"Beroende på funktionen och dess parametrar kan resultaten vara symmetriska." +msgid "Depending on the function and its parameters, the results can be symmetric." +msgstr "Beroende på funktionen och dess parametrar kan resultaten vara symmetriska." -msgid "" -"The **aggregate cost** of :math:`(u, v)` is the same as for :math:`(v, u)`." -msgstr "" -"Den **samlade kostnaden** för :math:`(u, v)` är densamma som för :math:`(v, " -"u)`." +msgid "The **aggregate cost** of :math:`(u, v)` is the same as for :math:`(v, u)`." +msgstr "Den **samlade kostnaden** för :math:`(u, v)` är densamma som för :math:`(v, u)`." -msgid "" -"Any duplicated value in the start or end vertex identifiers are ignored." -msgstr "" -"Eventuella duplicerade värden i start- eller slutvertexidentifierarna " -"ignoreras." +msgid "Any duplicated value in the start or end vertex identifiers are ignored." +msgstr "Eventuella duplicerade värden i start- eller slutvertexidentifierarna ignoreras." msgid "The returned values are ordered:" msgstr "De returnerade värdena är ordnade:" @@ -3083,79 +2637,50 @@ msgstr ":doc:`pgr_bdDijkstraCostMatrix`" msgid ":doc:`pgr_withPointsCostMatrix`" msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "" -":doc:`TSP-family` needs as input a symmetric cost matrix and no edge `(u, " -"v)` must value :math:`\\infty`." -msgstr "" -":doc:`TSP-family` needs as input a symmetric cost matrix and no edge `(u, " -"v)` must value :math:`\\infty`." +msgid ":doc:`TSP-family` needs as input a symmetric cost matrix and no edge `(u, v)` must value :math:`\\infty`." +msgstr ":doc:`TSP-family` needs as input a symmetric cost matrix and no edge `(u, v)` must value :math:`\\infty`." -msgid "" -"This collection of functions will return a cost matrix in form of a table." -msgstr "" -"Denna samling funktioner returnerar en kostnadsmatris i form av en tabell." +msgid "This collection of functions will return a cost matrix in form of a table." +msgstr "Denna samling funktioner returnerar en kostnadsmatris i form av en tabell." msgid "Can be used as input to :doc:`pgr_TSP`." msgstr "Kan användas som indata till :doc:`pgr_TSP`." -msgid "" -"Use directly when the resulting matrix is symmetric and there is no :math:" -"`\\infty` value." -msgstr "" -"Används direkt när den resulterande matrisen är symmetrisk och det inte " -"finns något :math:`\\infty`-värde." +msgid "Use directly when the resulting matrix is symmetric and there is no :math:`\\infty` value." +msgstr "Används direkt när den resulterande matrisen är symmetrisk och det inte finns något :math:`\\infty`-värde." msgid "It will be the users responsibility to make the matrix symmetric." msgstr "Det är användarens ansvar att göra matrisen symmetrisk." msgid "By using geometric or harmonic average of the non symmetric values." -msgstr "" -"Genom att använda geometriskt eller harmoniskt medelvärde av de icke " -"symmetriska värdena." +msgstr "Genom att använda geometriskt eller harmoniskt medelvärde av de icke symmetriska värdena." msgid "By using max or min the non symmetric values." msgstr "Genom att använda max eller min används de icke symmetriska värdena." -msgid "" -"By setting the upper triangle to be the mirror image of the lower triangle." -msgstr "" -"Genom att ställa in den övre triangeln så att den blir en spegelbild av den " -"nedre triangeln." +msgid "By setting the upper triangle to be the mirror image of the lower triangle." +msgstr "Genom att ställa in den övre triangeln så att den blir en spegelbild av den nedre triangeln." -msgid "" -"By setting the lower triangle to be the mirror image of the upper triangle." -msgstr "" -"Genom att ställa in den nedre triangeln så att den blir en spegelbild av den " -"övre triangeln." +msgid "By setting the lower triangle to be the mirror image of the upper triangle." +msgstr "Genom att ställa in den nedre triangeln så att den blir en spegelbild av den övre triangeln." msgid "It is also the users responsibility to fix an :math:`\\infty` value." msgstr "Det är också användarens ansvar att åtgärda ett :math:`\\infty`-värde." -msgid "" -"Returns the sum of the costs of the shortest path for pair combination of " -"nodes in the graph." -msgstr "" -"Returnerar summan av kostnaderna för den kortaste vägen för parkombinationer " -"av noder i grafen." +msgid "Returns the sum of the costs of the shortest path for pair combination of nodes in the graph." +msgstr "Returnerar summan av kostnaderna för den kortaste vägen för parkombinationer av noder i grafen." -msgid "" -"When the starting vertex and ending vertex are the same, there is no path." +msgid "When the starting vertex and ending vertex are the same, there is no path." msgstr "När startvertex och slutvertex är desamma finns det ingen väg." msgid "The aggregate cost in the non included values `(v, v)` is `0`." -msgstr "" -"Den sammanlagda kostnaden för de icke inkluderade värdena `(v, v)` är `0`." +msgstr "Den sammanlagda kostnaden för de icke inkluderade värdena `(v, v)` är `0`." -msgid "" -"When the starting vertex and ending vertex are the different and there is no " -"path." +msgid "When the starting vertex and ending vertex are the different and there is no path." msgstr "När startvertex och slutvertex är olika och det inte finns någon väg." -msgid "" -"The aggregate cost in the non included values `(u, v)` is :math:`\\infty`." -msgstr "" -"Den sammanlagda kostnaden för de icke inkluderade värdena `(u, v)` är :math:" -"`\\infty`." +msgid "The aggregate cost in the non included values `(u, v)` is :math:`\\infty`." +msgstr "Den sammanlagda kostnaden för de icke inkluderade värdena `(u, v)` är :math:`\\infty`." msgid "Let be the case the values returned are stored in a table:" msgstr "Om så är fallet lagras de värden som returneras i en tabell:" @@ -3202,21 +2727,14 @@ msgstr "**värde**" msgid "Identifier of the point." msgstr "Identifierare av punkten." -msgid "" -"Use with positive value, as internally will be converted to negative value" -msgstr "" -"Använd med positivt värde, eftersom det internt kommer att omvandlas till " -"negativt värde" +msgid "Use with positive value, as internally will be converted to negative value" +msgstr "Använd med positivt värde, eftersom det internt kommer att omvandlas till negativt värde" msgid "If column is present, it can not be NULL." msgstr "Om kolumnen finns med kan den inte vara NULL." -msgid "" -"If column is not present, a sequential negative **value** will be given " -"automatically." -msgstr "" -"Om kolumnen inte finns med kommer ett negativt **värde** att anges " -"automatiskt i ordningsföljd." +msgid "If column is not present, a sequential negative **value** will be given automatically." +msgstr "Om kolumnen inte finns med kommer ett negativt **värde** att anges automatiskt i ordningsföljd." msgid "``edge_id``" msgstr "``edge_id``" @@ -3227,11 +2745,8 @@ msgstr "Identifierar den kant som ligger \"närmast\" punkten." msgid "``fraction``" msgstr "``fraction``" -msgid "" -"Value in <0,1> that indicates the relative position from the first end point " -"of the edge." -msgstr "" -"Värde i <0,1> som anger den relativa positionen från kantens första ändpunkt." +msgid "Value in <0,1> that indicates the relative position from the first end point of the edge." +msgstr "Värde i <0,1> som anger den relativa positionen från kantens första ändpunkt." msgid "``side``" msgstr "``sida``" @@ -3264,27 +2779,16 @@ msgid ":doc:`pgr_dijkstra` - Dijkstra's algorithm for the shortest paths." msgstr ":doc:`pgr_dijkstra` - Dijkstra's algorithm for the shortest paths." msgid ":doc:`pgr_dijkstraCost` - Get the aggregate cost of the shortest paths." -msgstr "" -":doc:`pgr_dijkstraCost` - Get the aggregate cost of the shortest paths." +msgstr ":doc:`pgr_dijkstraCost` - Get the aggregate cost of the shortest paths." -msgid "" -":doc:`pgr_dijkstraCostMatrix` - Use pgr_dijkstra to create a costs matrix." -msgstr "" -":doc:`pgr_dijkstraCostMatrix` - Use pgr_dijkstra to create a costs matrix." +msgid ":doc:`pgr_dijkstraCostMatrix` - Use pgr_dijkstra to create a costs matrix." +msgstr ":doc:`pgr_dijkstraCostMatrix` - Use pgr_dijkstra to create a costs matrix." -msgid "" -":doc:`pgr_drivingDistance` - Use pgr_dijkstra to calculate catchament " -"information." -msgstr "" -":doc:`pgr_drivingDistance` - Use pgr_dijkstra to calculate catchament " -"information." +msgid ":doc:`pgr_drivingDistance` - Use pgr_dijkstra to calculate catchament information." +msgstr ":doc:`pgr_drivingDistance` - Use pgr_dijkstra to calculate catchament information." -msgid "" -":doc:`pgr_KSP` - Use Yen algorithm with pgr_dijkstra to get the K shortest " -"paths." -msgstr "" -":doc:`pgr_KSP` - Use Yen algorithm with pgr_dijkstra to get the K shortest " -"paths." +msgid ":doc:`pgr_KSP` - Use Yen algorithm with pgr_dijkstra to get the K shortest paths." +msgstr ":doc:`pgr_KSP` - Use Yen algorithm with pgr_dijkstra to get the K shortest paths." msgid ":doc:`pgr_dijkstraVia` - Get a route of a sequence of vertices." msgstr ":doc:`pgr_dijkstraVia` - Get a route of a sequence of vertices." @@ -3295,18 +2799,8 @@ msgstr ":doc:`pgr_dijkstraNear` - Get the route to the nearest vertex." msgid ":doc:`pgr_dijkstraNearCost` - Get the cost to the nearest vertex." msgstr ":doc:`pgr_dijkstraNearCost` - Get the cost to the nearest vertex." -msgid "" -"Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra " -"in 1956. It is a graph search algorithm that solves the shortest path " -"problem for a graph with non-negative edge path costs, producing a shortest " -"path from a starting vertex to an ending vertex. This implementation can be " -"used with a directed graph and an undirected graph." -msgstr "" -"Dijkstras algoritm, skapad av den holländske datavetaren Edsger Dijkstra " -"1956. Det är en algoritm för grafsökning som löser problemet med kortaste " -"vägen för en graf med icke-negativa kantvägskostnader, vilket ger en " -"kortaste väg från ett startvertex till ett slutvertex. Den här " -"implementationen kan användas med en riktad graf och en oriktad graf." +msgid "Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956. It is a graph search algorithm that solves the shortest path problem for a graph with non-negative edge path costs, producing a shortest path from a starting vertex to an ending vertex. This implementation can be used with a directed graph and an undirected graph." +msgstr "Dijkstras algoritm, skapad av den holländske datavetaren Edsger Dijkstra 1956. Det är en algoritm för grafsökning som löser problemet med kortaste vägen för en graf med icke-negativa kantvägskostnader, vilket ger en kortaste väg från ett startvertex till ett slutvertex. Den här implementationen kan användas med en riktad graf och en oriktad graf." msgid "Running time: :math:`O(| start\\ vids | * (V \\log V + E))`" msgstr "Drifttid: :math:`O(| start\\ vids | * (V \\log V + E))`" @@ -3356,11 +2850,8 @@ msgstr "Givet följande frågeställning:" msgid "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" -msgid "" -"where :math:`sql = \\{(id_i, source_i, target_i, cost_i, reverse\\_cost_i)\\}" -"`" -msgstr "" -"där :math:`sql = \\{(id_i, source_i, target_i, cost_i, reverse\\_cost_i)\\}``" +msgid "where :math:`sql = \\{(id_i, source_i, target_i, cost_i, reverse\\_cost_i)\\}`" +msgstr "där :math:`sql = \\{(id_i, source_i, target_i, cost_i, reverse\\_cost_i)\\}``" msgid "and" msgstr "och" @@ -3389,22 +2880,8 @@ msgstr ":math:`V = source \\cup target \\cup {start_{vid}} \\cup {end_{vid}}`" msgid "the set of edges :math:`E`" msgstr "uppsättningen kanter :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 ":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 "Oriktad graf" @@ -3413,31 +2890,10 @@ msgid "The weighted undirected graph, :math:`G_u(V,E)`, is defined by:" msgstr "Den viktade oavledda grafen, :math:`G_u(V,E)`, definieras av:" 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}}`" +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 ":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 "Problemet" @@ -3451,22 +2907,14 @@ 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 ":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 "Då så:" -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 ":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 "var:" @@ -3486,56 +2934,29 @@ 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:`\\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:`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 ":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 "" -"Eller med andra ord Algoritmen returnerar den kortaste vägen mellan :math:" -"`start_{vid}` och :math:`slut_{vid}`, om den finns, i form av en sekvens av " -"noder och kanter," +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 "Eller med andra ord Algoritmen returnerar den kortaste vägen mellan :math:`start_{vid}` och :math:`slut_{vid}`, om den finns, i form av en sekvens av noder och kanter," -msgid "" -":math:`path\\_seq` indicates the relative position in the path of the :math:" -"`node` or :math:`edge`." -msgstr "" -":math:`path\\_seq` indicates the relative position in the path of the :math:" -"`node` or :math:`edge`." +msgid ":math:`path\\_seq` indicates the relative position in the path of the :math:`node` or :math:`edge`." +msgstr ":math:`path\\_seq` indicates the relative position in the path of the :math:`node` or :math:`edge`." msgid ":math:`cost` is the cost of the edge to be used to go to the next node." -msgstr "" -":math:`cost` is the cost of the edge to be used to go to the next node." +msgstr ":math:`cost` is the cost of the edge to be used to go to the next node." -msgid "" -":math:`agg\\_cost` is the cost from the :math:`start_{vid}` up to the node." -msgstr "" -":math:`agg\\_cost` is the cost from the :math:`start_{vid}` up to the node." +msgid ":math:`agg\\_cost` is the cost from the :math:`start_{vid}` up to the node." +msgstr ":math:`agg\\_cost` is the cost from the :math:`start_{vid}` up to the node." msgid "If there is no path, the resulting set is empty." msgstr "Om det inte finns någon väg är den resulterande uppsättningen tom." @@ -3543,10 +2964,8 @@ msgstr "Om det inte finns någon väg är den resulterande uppsättningen tom." msgid "Driving Distance - Category" msgstr "Köravstånd - Kategori" -msgid "" -":doc:`pgr_drivingDistance` - Driving Distance based on Dijkstra's algorithm" -msgstr "" -":doc:`pgr_drivingDistance` - Driving Distance based on Dijkstra's algorithm" +msgid ":doc:`pgr_drivingDistance` - Driving Distance based on Dijkstra's algorithm" +msgstr ":doc:`pgr_drivingDistance` - Driving Distance based on Dijkstra's algorithm" msgid ":doc:`pgr_primDD` - Driving Distance based on Prim's algorithm" msgstr ":doc:`pgr_primDD` - Driving Distance based on Prim's algorithm" @@ -3560,16 +2979,11 @@ msgstr ":doc:`pgr_withPointsDD` - Driving Distance based on pgr_withPoints" msgid "Calculate nodes that are within a distance." msgstr "Beräkna noder som ligger inom ett visst avstånd." -msgid "" -"Extracts all the nodes that have costs less than or equal to the value " -"distance." -msgstr "" -"Extraherar alla noder som har kostnader som är mindre än eller lika med " -"värdeavståndet." +msgid "Extracts all the nodes that have costs less than or equal to the value distance." +msgstr "Extraherar alla noder som har kostnader som är mindre än eller lika med värdeavståndet." msgid "The edges extracted will conform to the corresponding spanning tree." -msgstr "" -"De kanter som extraheras kommer att överensstämma med motsvarande spännträd." +msgstr "De kanter som extraheras kommer att överensstämma med motsvarande spännträd." msgid "Edge :math:`(u, v)` will not be included when:" msgstr "Edge :math:`(u, v)` kommer inte att inkluderas när:" @@ -3580,12 +2994,8 @@ msgstr "Avståndet från **roten** till :math:`u` > gränsavstånd." msgid "The distance from the **root** to :math:`v` > limit distance." msgstr "Avståndet från **roten** till :math:`v` > gränsavstånd." -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 "" -"Inga nya noder skapas i grafen, så när är inom gränsen och är inte inom " -"gränsen, är kanten inte inkluderad." +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 "Inga nya noder skapas i grafen, så när är inom gränsen och är inte inom gränsen, är kanten inte inkluderad." msgid "Edges SQL as described below." msgstr "Kanter SQL enligt beskrivningen nedan." @@ -3621,9 +3031,7 @@ msgid "When ``node`` = ``start_vid`` then has the value ``node``." msgstr "När ``node`` = ``start_vid`` så har värdet ``node``." msgid "Identifier of the ``edge`` used to arrive from ``pred`` to ``node``." -msgstr "" -"Identifierare av den ``edge`` som används för att komma från ``pred`` till " -"``node``." +msgstr "Identifierare av den ``edge`` som används för att komma från ``pred`` till ``node``." msgid "Experimental Functions" msgstr "Experimentella funktioner" @@ -3652,27 +3060,17 @@ msgstr ":doc:`contraction-family`" msgid ":doc:`transformation-family`" msgstr ":doc:`transformation-family`" -msgid "" -":doc:`pgr_lineGraphFull` - Transformation algorithm for generating a Line " -"Graph out of each vertex in the input graph." -msgstr "" -":doc:`pgr_lineGraphFull` - Transformation algorithm for generating a Line " -"Graph out of each vertex in the input graph." +msgid ":doc:`pgr_lineGraphFull` - Transformation algorithm for generating a Line Graph out of each vertex in the input graph." +msgstr ":doc:`pgr_lineGraphFull` - Transformation algorithm for generating a Line Graph out of each vertex in the input graph." msgid ":doc:`traversal-family`" msgstr ":doc:`traversal-family`" -msgid "" -":doc:`pgr_breadthFirstSearch` - Breath first search traversal of the graph." -msgstr "" -":doc:`pgr_breadthFirstSearch` - Breath first search traversal of the graph." +msgid ":doc:`pgr_breadthFirstSearch` - Breath first search traversal of the graph." +msgstr ":doc:`pgr_breadthFirstSearch` - Breath first search traversal of the graph." -msgid "" -":doc:`pgr_binaryBreadthFirstSearch` - Breath first search traversal of the " -"graph." -msgstr "" -":doc:`pgr_binaryBreadthFirstSearch` - Breath first search traversal of the " -"graph." +msgid ":doc:`pgr_binaryBreadthFirstSearch` - Breath first search traversal of the graph." +msgstr ":doc:`pgr_binaryBreadthFirstSearch` - Breath first search traversal of the graph." msgid ":doc:`components-family`" msgstr ":doc:`components-family`" @@ -3680,37 +3078,23 @@ 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` - Return reverse Cuthill-McKee ordering of " -"an undirected graph." +msgid ":doc:`pgr_cuthillMckeeOrdering` - Return reverse Cuthill-McKee ordering of an undirected graph." +msgstr ":doc:`pgr_cuthillMckeeOrdering` - Return reverse Cuthill-McKee ordering of an undirected graph." -msgid "" -":doc:`pgr_topologicalSort` - Linear ordering of the vertices for directed " -"acyclic graph." -msgstr "" -":doc:`pgr_topologicalSort` - Linear ordering of the vertices for directed " -"acyclic graph." +msgid ":doc:`pgr_topologicalSort` - Linear ordering of the vertices for directed acyclic graph." +msgstr ":doc:`pgr_topologicalSort` - Linear ordering of the vertices for directed acyclic graph." -msgid "" -":doc:`pgr_sloanOrdering` - Returns the sloan ordering of an undirected graph." +msgid ":doc:`pgr_sloanOrdering` - Returns the sloan ordering of an undirected graph." msgstr ":doc:`pgr_sloanOrdering` - Returnerar sloan-ordningen för en odränerad graf." -msgid "" -":doc:`pgr_kingOrdering` - Returns the King ordering of an undirected graph." +msgid ":doc:`pgr_kingOrdering` - Returns the King ordering of an undirected graph." msgstr ":doc:`pgr_kingOrdering` - Returnerar King-ordningen för en odelad graf." msgid ":doc:`metrics-family`" msgstr ":doc:`metrics-family`" -msgid "" -":doc:`pgr_betweennessCentrality` - Calculates relative betweenness " -"centrality using Brandes Algorithm" -msgstr "" -":doc:`pgr_betweennessCentrality` - Calculates relative betweenness " -"centrality using Brandes Algorithm" +msgid ":doc:`pgr_betweennessCentrality` - Calculates relative betweenness centrality using Brandes Algorithm" +msgstr ":doc:`pgr_betweennessCentrality` - Calculates relative betweenness centrality using Brandes Algorithm" msgid ":doc:`pgr_bandwidth` - Computes the bandwidth of a graph." msgstr ":doc:`pgr_bandwidth` - Beräknar bandbredden för en graf." @@ -3760,50 +3144,26 @@ msgstr ":doc:`pgr_hawickCircuits`" msgid "Flow - Family of functions" msgstr "Flow - Familj av funktioner" -msgid "" -":doc:`pgr_maxFlow` - Only the Max flow calculation using Push and Relabel " -"algorithm." -msgstr "" -":doc:`pgr_maxFlow` - Only the Max flow calculation using Push and Relabel " -"algorithm." +msgid ":doc:`pgr_maxFlow` - Only the Max flow calculation using Push and Relabel algorithm." +msgstr ":doc:`pgr_maxFlow` - Only the Max flow calculation using Push and Relabel algorithm." -msgid "" -":doc:`pgr_boykovKolmogorov` - Boykov and Kolmogorov with details of flow on " -"edges." -msgstr "" -":doc:`pgr_boykovKolmogorov` - Boykov and Kolmogorov with details of flow on " -"edges." +msgid ":doc:`pgr_boykovKolmogorov` - Boykov and Kolmogorov with details of flow on edges." +msgstr ":doc:`pgr_boykovKolmogorov` - Boykov and Kolmogorov with details of flow on edges." -msgid "" -":doc:`pgr_edmondsKarp` - Edmonds and Karp algorithm with details of flow on " -"edges." -msgstr "" -":doc:`pgr_edmondsKarp` - Edmonds and Karp algorithm with details of flow on " -"edges." +msgid ":doc:`pgr_edmondsKarp` - Edmonds and Karp algorithm with details of flow on edges." +msgstr ":doc:`pgr_edmondsKarp` - Edmonds and Karp algorithm with details of flow on edges." -msgid "" -":doc:`pgr_pushRelabel` - Push and relabel algorithm with details of flow on " -"edges." -msgstr "" -":doc:`pgr_pushRelabel` - Push and relabel algorithm with details of flow on " -"edges." +msgid ":doc:`pgr_pushRelabel` - Push and relabel algorithm with details of flow on edges." +msgstr ":doc:`pgr_pushRelabel` - Push and relabel algorithm with details of flow on edges." msgid "Applications" msgstr "Ansökningar" -msgid "" -":doc:`pgr_edgeDisjointPaths` - Calculates edge disjoint paths between two " -"groups of vertices." -msgstr "" -":doc:`pgr_edgeDisjointPaths` - Calculates edge disjoint paths between two " -"groups of vertices." +msgid ":doc:`pgr_edgeDisjointPaths` - Calculates edge disjoint paths between two groups of vertices." +msgstr ":doc:`pgr_edgeDisjointPaths` - Calculates edge disjoint paths between two groups of vertices." -msgid "" -":doc:`pgr_maxCardinalityMatch` - Calculates a maximum cardinality matching " -"in a graph." -msgstr "" -":doc:`pgr_maxCardinalityMatch` - Calculates a maximum cardinality matching " -"in a graph." +msgid ":doc:`pgr_maxCardinalityMatch` - Calculates a maximum cardinality matching in a graph." +msgstr ":doc:`pgr_maxCardinalityMatch` - Calculates a maximum cardinality matching in a graph." msgid "Flow Functions General Information" msgstr "Flödesfunktioner Allmän information" @@ -3814,12 +3174,8 @@ msgstr "Grafen är **riktad**." msgid "Process is done only on edges with positive capacities." msgstr "Processen utförs endast på kanter med positiva kapaciteter." -msgid "" -"When the maximum flow is 0 then there is no flow and **EMPTY SET** is " -"returned." -msgstr "" -"När det maximala flödet är 0 finns det inget flöde och **EMPTY SET** " -"returneras." +msgid "When the maximum flow is 0 then there is no flow and **EMPTY SET** is returned." +msgstr "När det maximala flödet är 0 finns det inget flöde och **EMPTY SET** returneras." msgid "There is no flow when source has the same value as target." msgstr "Det finns inget flöde när källan har samma värde som målet." @@ -3842,14 +3198,8 @@ msgstr "en **superkälla** och kanter från den till alla källor," msgid "a **super target** and edges from it to all the targetss." msgstr "ett **supermål** och kanter från det till alla mål." -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 "" -"Det maximala flödet genom grafen är garanterat det värde som returneras av :" -"doc:`pgr_maxFlow ` när det körs med samma parametrar och kan " -"beräknas:" +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 "Det maximala flödet genom grafen är garanterat det värde som returneras av :doc:`pgr_maxFlow ` när det körs med samma parametrar och kan beräknas:" msgid "By aggregation of the outgoing flow from the sources" msgstr "Genom aggregering av det utgående flödet från källorna" @@ -3857,14 +3207,8 @@ msgstr "Genom aggregering av det utgående flödet från källorna" msgid "By aggregation of the incoming flow to the targets" msgstr "Genom aggregering av det inkommande flödet till målen" -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` 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." +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` 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." msgid "Capacity edges" msgstr "Kapacitet kanter" @@ -3938,8 +3282,7 @@ msgstr "Flöde genom kanten i riktning (``start_vid``, ``slut_vid``)." msgid "**residual_capacity**" msgstr "**återstående_kapacitet**" -msgid "" -"Residual capacity of the edge in the direction (``start_vid``, ``end_vid``)." +msgid "Residual capacity of the edge in the direction (``start_vid``, ``end_vid``)." msgstr "Restkapacitet för kanten i riktningen (``start_vid``, ``slut_vid``)." msgid "For :doc:`pgr_maxFlowMinCost`" @@ -3960,11 +3303,8 @@ msgstr "Restkapacitet för kanten i riktningen (källa, mål)." msgid "**cost**" msgstr "**cost**" -msgid "" -"The cost of sending this flow through the edge in the direction (source, " -"target)." -msgstr "" -"Kostnaden för att skicka detta flöde genom kanten i riktningen (källa, mål)." +msgid "The cost of sending this flow through the edge in the direction (source, target)." +msgstr "Kostnaden för att skicka detta flöde genom kanten i riktningen (källa, mål)." msgid "**agg_cost**" msgstr "**agg_cost**" @@ -3975,42 +3315,20 @@ msgstr "Den sammanlagda kostnaden." msgid "Advanced Documentation" msgstr "Avancerad dokumentation" -msgid "" -"A flow network is a directed graph where each edge has a capacity and a " -"flow. The flow through an edge must not exceed the capacity of the edge. " -"Additionally, the incoming and outgoing flow of a node must be equal except " -"for source which only has outgoing flow, and the destination(sink) which " -"only has incoming flow." -msgstr "" -"Ett flödesnät är en riktad graf där varje kant har en kapacitet och ett " -"flöde. Flödet genom en kant får inte överstiga kapaciteten i kanten. " -"Dessutom måste det inkommande och utgående flödet för en nod vara lika med " -"undantag för källan som bara har utgående flöde och destinationen (sink) som " -"bara har inkommande flöde." +msgid "A flow network is a directed graph where each edge has a capacity and a flow. The flow through an edge must not exceed the capacity of the edge. Additionally, the incoming and outgoing flow of a node must be equal except for source which only has outgoing flow, and the destination(sink) which only has incoming flow." +msgstr "Ett flödesnät är en riktad graf där varje kant har en kapacitet och ett flöde. Flödet genom en kant får inte överstiga kapaciteten i kanten. Dessutom måste det inkommande och utgående flödet för en nod vara lika med undantag för källan som bara har utgående flöde och destinationen (sink) som bara har inkommande flöde." -msgid "" -"Maximum flow algorithms calculate the maximum flow through the graph and the " -"flow of each edge." -msgstr "" -"Algoritmer för maximalt flöde beräknar det maximala flödet genom grafen och " -"flödet för varje kant." +msgid "Maximum flow algorithms calculate the maximum flow through the graph and the flow of each edge." +msgstr "Algoritmer för maximalt flöde beräknar det maximala flödet genom grafen och flödet för varje kant." -msgid "" -"The maximum flow through the graph is guaranteed to be the same with all " -"implementations, but the actual flow through each edge may vary." -msgstr "" -"Det maximala flödet genom grafen är garanterat detsamma för alla " -"implementeringar, men det faktiska flödet genom varje kant kan variera." +msgid "The maximum flow through the graph is guaranteed to be the same with all implementations, but the actual flow through each edge may vary." +msgstr "Det maximala flödet genom grafen är garanterat detsamma för alla implementeringar, men det faktiska flödet genom varje kant kan variera." msgid "pgr_maxFlow :math:`(edges\\_sql, source\\_vertex, sink\\_vertex)`" msgstr "pgr_maxFlow :math:`(edges\\_sql, source\\_vertex, sink\\_vertex)`" -msgid "" -"where :math:`edges\\_sql = \\{(id_i, source_i, target_i, capacity_i, " -"reverse\\_capacity_i)\\}`" -msgstr "" -"där :math:`edges\\_sql = \\{(id_i, source_i, target_i, capacity_i, " -"reverse\\_capacity_i)\\}``" +msgid "where :math:`edges\\_sql = \\{(id_i, source_i, target_i, capacity_i, reverse\\_capacity_i)\\}`" +msgstr "där :math:`edges\\_sql = \\{(id_i, source_i, target_i, capacity_i, reverse\\_capacity_i)\\}``" msgid "Graph definition" msgstr "Definition av graf" @@ -4021,29 +3339,11 @@ msgstr "Den viktade riktade grafen, :math:`G(V,E)`, definieras som:" msgid "the set of vertices :math:`V`" msgstr "uppsättningen av hörn :math:`V`" -msgid "" -":math:`source\\_vertex \\cup sink\\_vertex \\bigcup source_i \\bigcup " -"target_i`" -msgstr "" -":math:`source\\_vertex \\cup sink\\_vertex \\bigcup source_i \\bigcup " -"target_i`" +msgid ":math:`source\\_vertex \\cup sink\\_vertex \\bigcup source_i \\bigcup target_i`" +msgstr ":math:`source\\_vertex \\cup sink\\_vertex \\bigcup source_i \\bigcup target_i`" -msgid "" -":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, capacity_i) " -"\\text{ when } capacity > 0 \\} & \\quad \\text{ if } reverse\\_capacity = " -"\\varnothing \\\\ \\text{ } & \\quad \\text{ } \\\\ \\{(source_i, target_i, " -"capacity_i) \\text{ when } capacity > 0 \\} & \\text{ } \\\\ \\cup " -"\\{(target_i, source_i, reverse\\_capacity_i) \\text{ when } " -"reverse\\_capacity_i > 0)\\} & \\quad \\text{ if } reverse\\_capacity \\neq " -"\\varnothing \\\\ \\end{cases}`" -msgstr "" -":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, capacity_i) " -"\\text{ when } capacity > 0 \\} & \\quad \\text{ if } reverse\\_capacity = " -"\\varnothing \\\\ \\text{ } & \\quad \\text{ } \\\\ \\{(source_i, target_i, " -"capacity_i) \\text{ when } capacity > 0 \\} & \\text{ } \\\\ \\cup " -"\\{(target_i, source_i, reverse\\_capacity_i) \\text{ when } " -"reverse\\_capacity_i > 0)\\} & \\quad \\text{ if } reverse\\_capacity \\neq " -"\\varnothing \\\\ \\end{cases}`" +msgid ":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, capacity_i) \\text{ when } capacity > 0 \\} & \\quad \\text{ if } reverse\\_capacity = \\varnothing \\\\ \\text{ } & \\quad \\text{ } \\\\ \\{(source_i, target_i, capacity_i) \\text{ when } capacity > 0 \\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_capacity_i) \\text{ when } reverse\\_capacity_i > 0)\\} & \\quad \\text{ if } reverse\\_capacity \\neq \\varnothing \\\\ \\end{cases}`" +msgstr ":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, capacity_i) \\text{ when } capacity > 0 \\} & \\quad \\text{ if } reverse\\_capacity = \\varnothing \\\\ \\text{ } & \\quad \\text{ } \\\\ \\{(source_i, target_i, capacity_i) \\text{ when } capacity > 0 \\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_capacity_i) \\text{ when } reverse\\_capacity_i > 0)\\} & \\quad \\text{ if } reverse\\_capacity \\neq \\varnothing \\\\ \\end{cases}`" msgid "Maximum flow problem" msgstr "Problem med maximalt flöde" @@ -4060,23 +3360,11 @@ msgstr ":math:`sink\\_vertex \\in V` the sink vertex" msgid ":math:`pgr\\_maxFlow(edges\\_sql, source, sink) = \\boldsymbol{\\Phi}`" msgstr ":math:`pgr\\_maxFlow(edges\\_sql, source, sink) = \\boldsymbol{\\Phi}`" -msgid "" -":math:`\\boldsymbol{\\Phi} = {(id_i, edge\\_id_i, source_i, target_i, " -"flow_i, residual\\_capacity_i)}`" -msgstr "" -":math:`\\boldsymbol{\\Phi} = {(id_i, edge\\_id_i, source_i, target_i, " -"flow_i, residual\\_capacity_i)}`" +msgid ":math:`\\boldsymbol{\\Phi} = {(id_i, edge\\_id_i, source_i, target_i, flow_i, residual\\_capacity_i)}`" +msgstr ":math:`\\boldsymbol{\\Phi} = {(id_i, edge\\_id_i, source_i, target_i, flow_i, residual\\_capacity_i)}`" -msgid "" -":math:`\\boldsymbol{\\Phi}` is a subset of the original edges with their " -"residual capacity and flow. The maximum flow through the graph can be " -"obtained by aggregating on the source or sink and summing the flow from/to " -"it. In particular:" -msgstr "" -":math:`\\boldsymbol{\\Phi}` 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:" +msgid ":math:`\\boldsymbol{\\Phi}` is a subset of the original edges with their residual capacity and flow. The maximum flow through the graph can be obtained by aggregating on the source or sink and summing the flow from/to it. In particular:" +msgstr ":math:`\\boldsymbol{\\Phi}` 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:" msgid ":math:`id_i = i`" msgstr ":math:`id_i = i`" @@ -4090,14 +3378,8 @@ msgstr ":math:`residual\\_capacity_i = capacity_i - flow_i`" msgid "https://en.wikipedia.org/wiki/Maximum_flow_problem" msgstr "https://en.wikipedia.org/wiki/Maximum_flow_problem" -msgid "" -"pgRouting extends the `PostGIS `__/`PostgreSQL `__ geospatial database to provide geospatial routing and " -"other network analysis functionality." -msgstr "" -"pgRouting utökar `PostGIS `__/`PostgreSQL `__ geospatial databas för att tillhandahålla geospatial " -"routing och annan nätverksanalysfunktionalitet." +msgid "pgRouting extends the `PostGIS `__/`PostgreSQL `__ geospatial database to provide geospatial routing and other network analysis functionality." +msgstr "pgRouting utökar `PostGIS `__/`PostgreSQL `__ geospatial databas för att tillhandahålla geospatial routing och annan nätverksanalysfunktionalitet." msgid "This is the manual for pgRouting |release|." msgstr "Detta är manualen för pgRouting |release|." @@ -4105,20 +3387,8 @@ msgstr "Detta är manualen för pgRouting |release|." msgid "Creative Commons Attribution-Share Alike 3.0 License" msgstr "Creative Commons Erkännande-Dela Lika 3.0-licens" -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 "" -"Manualen för pgRouting är licensierad under en `Creative Commons Attribution-" -"Share Alike 3.0 License `_. " -"Du är välkommen att använda detta material på vilket sätt du vill, men vi " -"ber dig att ange pgRouting-projektet som källa och om möjligt en länk " -"tillbaka till https://pgrouting.org. För andra licenser som används i " -"pgRouting, se sidan :ref:`license`." +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 "Manualen för pgRouting är licensierad under en `Creative Commons Attribution-Share Alike 3.0 License `_. Du är välkommen att använda detta material på vilket sätt du vill, men vi ber dig att ange pgRouting-projektet som källa och om möjligt en länk tillbaka till https://pgrouting.org. För andra licenser som används i pgRouting, se sidan :ref:`license`." msgid "General" msgstr "Allmänt" @@ -4150,12 +3420,8 @@ msgstr ":doc:`pgr_kruskal`" msgid ":doc:`pgr_kruskalDD`" msgstr ":doc:`pgr_kruskalDD`" -msgid "" -":doc:`pgr_degree` - Returns a set of vertices and corresponding count of " -"incident edges to the vertex." -msgstr "" -":doc:`pgr_degree` - Returns a set of vertices and corresponding count of " -"incident edges to the vertex." +msgid ":doc:`pgr_degree` - Returns a set of vertices and corresponding count of incident edges to the vertex." +msgstr ":doc:`pgr_degree` - Returns a set of vertices and corresponding count of incident edges to the vertex." msgid ":doc:`prim-family`" msgstr ":doc:`prim-family`" @@ -4178,12 +3444,8 @@ msgstr ":doc:`pgr_full_version`" msgid ":doc:`utilities-family`" msgstr ":doc:`utilities-family`" -msgid "" -":doc:`pgr_extractVertices` - Extracts vertex information based on the edge " -"table information." -msgstr "" -":doc:`pgr_extractVertices` - Extracts vertex information based on the edge " -"table information." +msgid ":doc:`pgr_extractVertices` - Extracts vertex information based on the edge table information." +msgstr ":doc:`pgr_extractVertices` - Extracts vertex information based on the edge table information." msgid ":doc:`pgr_findCloseEdges` - Finds close edges of points on the fly" msgstr ":doc:`pgr_findCloseEdges` - Finds close edges of points on the fly" @@ -4191,12 +3453,8 @@ msgstr ":doc:`pgr_findCloseEdges` - Finds close edges of points on the fly" msgid ":doc:`pgr_separateCrossing` - Breaks geometries that cross each other." msgstr ":doc:`pgr_separateCrossing` - Breaks geometries that cross each other." -msgid "" -":doc:`pgr_separateTouching` - Breaks geometries that (almost) touch each " -"other." -msgstr "" -":doc:`pgr_separateTouching` - Breaks geometries that (almost) touch each " -"other." +msgid ":doc:`pgr_separateTouching` - Breaks geometries that (almost) touch each other." +msgstr ":doc:`pgr_separateTouching` - Breaks geometries that (almost) touch each other." msgid ":doc:`withPoints-family`" msgstr ":doc:`withPoints-family`" @@ -4264,13 +3522,13 @@ msgstr ":doc:`experimental`" msgid ":doc:`release_notes`" msgstr ":doc:`release_notes`" +msgid "pgRouting 4.0" +msgstr "pgRouting 4.0" + msgid "pgRouting 4.0.0-alpha1 Release Notes" msgstr "pgRouting 4.0.0-alpha1 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 4.0.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.0 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 4.0.0 `__" msgid "Build" @@ -4279,8 +3537,7 @@ msgstr "Skapa" msgid "C++ standard is std17" msgstr "C++-standarden är std17" -msgid "" -"Using this standard, all supported toolchains across our CI matrix will work." +msgid "Using this standard, all supported toolchains across our CI matrix will work." msgstr "Med hjälp av denna standard kommer alla verktygskedjor som stöds i vår CI-matris att fungera." msgid "The code is not yet modified to use std17:" @@ -4313,9 +3570,7 @@ msgstr "Doxygen-dokumentationen byggs som standard" msgid "The HTML documentation is built by default" msgstr "HTML-dokumentationen byggs som standard" -msgid "" -"The translated languages (en, es, sv, zh_Hans) HTML documentation are built " -"by default" +msgid "The translated languages (en, es, sv, zh_Hans) HTML documentation are built by default" msgstr "HTML-dokumentationen för översatta språk (en, es, sv, zh_Hans) byggs som standard" msgid "`WITH-DOC` is not used anymore" @@ -4519,12 +3774,8 @@ msgstr "pgr_trsp" msgid "pgr_trsp(text,integer,integer,boolean,boolean,text)" msgstr "pgr_trsp(text,integer,integer,boolean,boolean,text)" -msgid "" -"pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean,text)" -msgstr "" -"pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean,text)" +msgid "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +msgstr "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" msgid "pgr_trspVia" msgstr "pgr_trspVia" @@ -4541,17 +3792,11 @@ msgstr "**Driving side** parametern är positionell utan namn." msgid "Valid values depend on kind of graph" msgstr "Giltiga värden beror på typ av graf" -msgid "" -"pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean," -"character,boolean)" -msgstr "" -"pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean," -"character,boolean)" +msgid "pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgstr "pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" -msgid "" -"pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" -msgstr "" -"pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +msgid "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +msgstr "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" msgid "pgr_trsp_withPoints" msgstr "pgr_trsp_withPoints" @@ -4559,27 +3804,17 @@ msgstr "pgr_trsp_withPoints" msgid "**Driving side** parameter is positional unnamed and compulsory." msgstr "**Driving side** parametern är positionell, namnlös och obligatorisk." -msgid "" -"pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character," -"boolean)" -msgstr "" -"pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character," -"boolean)" +msgid "pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +msgstr "pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" -msgid "" -"pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" -msgstr "" -"pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +msgid "pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +msgstr "pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" -msgid "" -"pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" -msgstr "" -"pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +msgid "pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +msgstr "pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" -msgid "" -"pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" -msgstr "" -"pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" +msgid "pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" +msgstr "pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" msgid "pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" msgstr "pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" @@ -4593,22 +3828,14 @@ msgstr "Resultaten ändras beroende på inmatningsordning" msgid "Only for undirected graphs" msgstr "Endast för odelade grafer" -msgid "" -"pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double " -"precision,double precision,double precision,boolean)" -msgstr "" -"pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double " -"precision,double precision,double precision,boolean)" +msgid "pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgstr "pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgid "pgr_TSPeuclidean" msgstr "pgr_TSPeuclidean" -msgid "" -"pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, " -"integer,double precision,double precision,double precision,boolean)" -msgstr "" -"pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, " -"integer,double precision,double precision,double precision,boolean)" +msgid "pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, integer,double precision,double precision,double precision,boolean)" +msgstr "pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, integer,double precision,double precision,double precision,boolean)" msgid "pgr_turnRestrictedPath" msgstr "pgr_turnRestrictedPath" @@ -4667,172 +3894,106 @@ msgstr "pgr_withpointscostmatrix(text,text,anyarray,boolean,character)" msgid "pgr_withPointsDD" msgstr "pgr_withPointsDD" -msgid "" -"pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" -msgstr "" -"pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgid "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" -msgid "" -"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" -msgstr "" -"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" +msgid "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" msgid "pgr_withPointsKSP" msgstr "pgr_withPointsKSP" -msgid "" -"pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character," -"boolean)" -msgstr "" -"pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character," -"boolean)" +msgid "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" msgid "pgr_withPointsVia" msgstr "pgr_withPointsVia" -msgid "" -"pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character," -"boolean)" -msgstr "" -"pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character," -"boolean)" +msgid "pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgstr "pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgid "Functions promoted to official" msgstr "Funktioner som befordrats till tjänsteman" -msgid "" -"`#2701 `__: pgr_trsp" +msgid "`#2701 `__: pgr_trsp" msgstr "`#2701 `__: pgr_trsp" -msgid "" -"`#2701 `__: pgr_trspVia" +msgid "`#2701 `__: pgr_trspVia" msgstr "`#2701 `__: pgr_trspVia" -msgid "" -"`#2701 `__: " -"pgr_trspVia_withPoints" +msgid "`#2701 `__: pgr_trspVia_withPoints" msgstr "`#2701 `__: pgr_trspVia_withPoints" -msgid "" -"`#2701 `__: " -"pgr_trsp_withPoints" +msgid "`#2701 `__: pgr_trsp_withPoints" msgstr "`#2701 `__: pgr_trsp_withPoints" -msgid "" -"`#2700 `__: " -"pgr_withPoints" +msgid "`#2700 `__: pgr_withPoints" msgstr "`#2700 `__: pgr_withPoints" -msgid "" -"`#2700 `__: " -"pgr_withPointsCost" +msgid "`#2700 `__: pgr_withPointsCost" msgstr "`#2700 `__: pgr_withPointsCost" -msgid "" -"`#2700 `__: " -"pgr_withPointsCostMatrix" +msgid "`#2700 `__: pgr_withPointsCostMatrix" msgstr "`#2700 `__: pgr_withPointsCostMatrix" -msgid "" -"`#2700 `__: " -"pgr_withPointsDD" +msgid "`#2700 `__: pgr_withPointsDD" msgstr "`#2700 `__: pgr_withPointsDD" -msgid "" -"`#2700 `__: " -"pgr_withPointsKSP" +msgid "`#2700 `__: pgr_withPointsKSP" msgstr "`#2700 `__: pgr_withPointsKSP" -msgid "" -"`#2700 `__: " -"pgr_withPointsVia" -msgstr "" -"`#2700 `__: " -"pgr_withPointsVia" +msgid "`#2700 `__: pgr_withPointsVia" +msgstr "`#2700 `__: pgr_withPointsVia" -msgid "" -"`#2983 `__: " -"pgr_dijkstraNear" +msgid "`#2983 `__: pgr_dijkstraNear" msgstr "`#2983 `__: pgr_dijkstraNear" -msgid "" -"`#2983 `__: " -"pgr_dijkstraNearCost" +msgid "`#2983 `__: pgr_dijkstraNearCost" msgstr "`#2983 `__: pgr_dijkstraNearCost" -msgid "" -"`#2983 `__: " -"pgr_dijkstraVia" +msgid "`#2983 `__: pgr_dijkstraVia" msgstr "`#2983 `__: pgr_dijkstraVia" msgid "Signatures promoted to official" msgstr "Underskrifter befordrade till officiella" -msgid "" -"`#2718 `__: " -"pgr_aStar(Combinations)" +msgid "`#2718 `__: pgr_aStar(Combinations)" msgstr "`#2718 `__: pgr_aStar(Kombinationer)" -msgid "" -"`#2718 `__: " -"pgr_aStarCost(Combinations)" +msgid "`#2718 `__: pgr_aStarCost(Combinations)" msgstr "`#2718 `__: pgr_aStarCost(Kombinationer)" -msgid "" -"`#2718 `__: " -"pgr_bdAstar(Combinations)" +msgid "`#2718 `__: pgr_bdAstar(Combinations)" msgstr "`#2718 `__: pgr_bdAstar(Kombinationer)" -msgid "" -"`#2718 `__: " -"pgr_bdAstarCost(Combinations)" +msgid "`#2718 `__: pgr_bdAstarCost(Combinations)" msgstr "`#2718 `__: pgr_bdAstarCost(Kombinationer)" -msgid "" -"`#2718 `__: " -"pgr_bdDijkstra(Combinations)" +msgid "`#2718 `__: pgr_bdDijkstra(Combinations)" msgstr "`#2718 `__: pgr_bdDijkstra(Kombinationer)" -msgid "" -"`#2718 `__: " -"pgr_bdDijkstraCost(Combinations)" +msgid "`#2718 `__: pgr_bdDijkstraCost(Combinations)" msgstr "`#2718 `__: pgr_bdDijkstraCost(Kombinationer)" -msgid "" -"`#2718 `__: " -"pgr_dijkstra(Combinations)" +msgid "`#2718 `__: pgr_dijkstra(Combinations)" msgstr "`#2718 `__: pgr_dijkstra(Kombinationer)" -msgid "" -"`#2718 `__: " -"pgr_dijkstraCost(Combinations)" +msgid "`#2718 `__: pgr_dijkstraCost(Combinations)" msgstr "`#2718 `__: pgr_dijkstraCost(Kombinationer)" -msgid "" -"`#2718 `__: pgr_KSP(All " -"signatures)" +msgid "`#2718 `__: pgr_KSP(All signatures)" msgstr "`#2718 `__: pgr_KSP(Alla signaturer)" -msgid "" -"`#2718 `__: " -"pgr_boykovKolmogorov(Combinations)" +msgid "`#2718 `__: pgr_boykovKolmogorov(Combinations)" msgstr "`#2718 `__: pgr_boykovKolmogorov(Kombinationer)" -msgid "" -"`#2718 `__: " -"pgr_edmondsKarp(Combinations)" +msgid "`#2718 `__: pgr_edmondsKarp(Combinations)" msgstr "`#2718 `__: pgr_edmondsKarp(Kombinationer)" -msgid "" -"`#2718 `__: " -"pgr_maxFlow(Combinations)" +msgid "`#2718 `__: pgr_maxFlow(Combinations)" msgstr "`#2718 `__: pgr_maxFlow(Kombinationer)" -msgid "" -"`#2718 `__: " -"pgr_pushRelabel(Combinations)" +msgid "`#2718 `__: pgr_pushRelabel(Combinations)" msgstr "`#2718 `__: pgr_pushRelabel(Kombinationer)" msgid "New experimental functions." @@ -4841,29 +4002,22 @@ msgstr "Nya experimentella funktioner." msgid "Metrics" msgstr "Mätvärde" -msgid "" -"`#2951 `__: pgr_bandwidth" +msgid "`#2951 `__: pgr_bandwidth" msgstr "`#2951 `__: pgr_bandbredd" msgid "Ordering" msgstr "Ordning" -msgid "" -"`#2954 `__: " -"pgr_kingOrdering" +msgid "`#2954 `__: pgr_kingOrdering" msgstr "`#2954 `__: pgr_kingOrdering" -msgid "" -"`#2955 `__: " -"pgr_sloanOrdering" +msgid "`#2955 `__: pgr_sloanOrdering" msgstr "`#2955 `__: pgr_sloanOrdering" msgid "SQL signatures and output standardization" msgstr "SQL-signaturer och standardisering av utdata" -msgid "" -"`#2904 `__: Standardize " -"output columns of functions with different output" +msgid "`#2904 `__: Standardize output columns of functions with different output" msgstr "`#2904 `__: Standardisera utdatakolumner för funktioner med olika utdata" msgid "columns within overloads" @@ -4872,715 +4026,421 @@ msgstr "kolumner inom överbelastningar" msgid "Standardized to |short-generic-result|" msgstr "Standardiserad till |short-generic-result|" -msgid "" -"`#2905 `__: " -"pgr_withPoints" +msgid "`#2905 `__: pgr_withPoints" msgstr "`#2905 `__: pgr_withPoints" -msgid "" -"`#2906 `__: " -"pgr_bdDijkstra" +msgid "`#2906 `__: pgr_bdDijkstra" msgstr "`#2906 `__: pgr_bdDijkstra" -msgid "" -"`#2907 `__: " -"pgr_bellmanFord" +msgid "`#2907 `__: pgr_bellmanFord" msgstr "`#2907 `__: pgr_bellmanFord" -msgid "" -"`#2908 `__: " -"pgr_binaryBreadthFirstSearch" +msgid "`#2908 `__: pgr_binaryBreadthFirstSearch" msgstr "`#2908 `__: pgr_binaryBreadthFirstSearch" -msgid "" -"`#2910 `__: " -"pgr_edwardMoore" +msgid "`#2910 `__: pgr_edwardMoore" msgstr "`#2910 `__: pgr_edwardMoore" -msgid "" -"`#2913 `__: " -"pgr_dagShortestPath" +msgid "`#2913 `__: pgr_dagShortestPath" msgstr "`#2913 `__: pgr_dagShortestPath" msgid "Standardized to |matrix-result|" msgstr "Standardiserat till |matrix-result|" -msgid "" -"`#2905 `__: " -"pgr_withPointsCost" +msgid "`#2905 `__: pgr_withPointsCost" msgstr "`#2905 `__: pgr_withPointsCost" -msgid "" -"`#2905 `__: " -"pgr_withPointsCostMatrix" +msgid "`#2905 `__: pgr_withPointsCostMatrix" msgstr "`#2905 `__: pgr_withPointsCostMatrix" msgid "Standardized to |generic-result|" msgstr "Standardiserat till |generic-result|" -msgid "" -"`#2909 `__: " -"pgr_edgeDisjointPaths" +msgid "`#2909 `__: pgr_edgeDisjointPaths" msgstr "`#2909 `__: pgr_edgeDisjointPaths" -msgid "" -"`#2909 `__: " -"pgr_turnRestrictedPath" +msgid "`#2909 `__: pgr_turnRestrictedPath" msgstr "`#2909 `__: pgr_turnRestrictedPath" msgid "Standardized to |result_edge_color|" msgstr "Standardiserad till |result_edge_color|" -msgid "" -"`#2924 `__: " -"pgr_edgeColoring" +msgid "`#2924 `__: pgr_edgeColoring" msgstr "`#2924 `__: pgr_edgeColoring" msgid "Standardized to |result_node_color|" msgstr "Standardiserad till |result_node_color|" -msgid "" -"`#2924 `__: pgr_bipartite" +msgid "`#2924 `__: pgr_bipartite" msgstr "`#2924 `__: pgr_bipartite" -msgid "" -"`#2927 `__: " -"pgr_sequentialVertexColoring" +msgid "`#2927 `__: pgr_sequentialVertexColoring" msgstr "`#2927 `__: pgr_sequentialVertexColoring" msgid "Standardized to |result-spantree|" msgstr "Standardiserad till |result-spantree|" -msgid "" -"`#2931 `__: " -"pgr_breadthFirstSearch" +msgid "`#2931 `__: pgr_breadthFirstSearch" msgstr "`#2931 `__: pgr_breadthFirstSearch" -msgid "" -"`#2931 `__: " -"pgr_depthFirstSearch" +msgid "`#2931 `__: pgr_depthFirstSearch" msgstr "`#2931 `__: pgr_depthFirstSearch" msgid "Standardized to |result_node_order|" msgstr "Standardisera till |result_node_order|" -msgid "" -"`#2934 `__: " -"pgr_topologicalSort" +msgid "`#2934 `__: pgr_topologicalSort" msgstr "`#2934 `__: pgr_topologicalSort" msgid "Standardized to |result-closure|" msgstr "Standardisera till |result-closure|" -msgid "" -"`#2934 `__: " -"pgr_transitiveClosure" +msgid "`#2934 `__: pgr_transitiveClosure" msgstr "`#2934 `__: pgr_transitiveClosure" msgid "Removal of SQL deprecated signatures" msgstr "Borttagning av SQL-signaturer som inte längre är aktuella" -msgid "" -"`#2798 `__: " -"pgr_contraction" -msgstr "" -"`#2798 `__: " -"pgr_kontraktion" +msgid "`#2798 `__: pgr_contraction" +msgstr "`#2798 `__: pgr_kontraktion" -msgid "" -"`#2683 `__: pgr_trsp" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2683 `__: pgr_trsp" +msgstr "`#2683 `__: pgr_trsp" -msgid "" -"`#2683 `__: pgr_trspVia" -msgstr "" -"`#2683 `__: pgr_trspVia" +msgid "`#2683 `__: pgr_trspVia" +msgstr "`#2683 `__: pgr_trspVia" -msgid "" -"`#2888 `__: " -"pgr_findCloseEdges" -msgstr "" -"`#2888 `__: " -"pgr_findCloseEdges" +msgid "`#2888 `__: pgr_findCloseEdges" +msgstr "`#2888 `__: pgr_findCloseEdges" -msgid "" -"pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" -msgstr "" -"pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" +msgid "pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" +msgstr "pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" -msgid "" -"pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" -msgstr "" -"pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" +msgid "pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" +msgstr "pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" -msgid "" -"`#2890 `__: " -"pgr_withPointsDD" -msgstr "" -"`#2890 `__: " -"pgr_withPointsDD" +msgid "`#2890 `__: pgr_withPointsDD" +msgstr "`#2890 `__: pgr_withPointsDD" -msgid "" -"`#2895 `__: " -"pgr_withPointsKSP" -msgstr "" -"`#2895 `__: " -"pgr_withPointsKSP" +msgid "`#2895 `__: pgr_withPointsKSP" +msgstr "`#2895 `__: pgr_withPointsKSP" -msgid "" -"`#2899 `__: " -"pgr_maxCardinalityMatch" -msgstr "" -"`#2899 `__: " -"pgr_maxCardinalityMatch" +msgid "`#2899 `__: pgr_maxCardinalityMatch" +msgstr "`#2899 `__: pgr_maxCardinalityMatch" msgid "`#2901 `__: pgr_TSP" -msgstr "" -"`#2901 `__: pgr_TSP" +msgstr "`#2901 `__: pgr_TSP" -msgid "" -"`#2901 `__: " -"pgr_TSPeuclidean" -msgstr "" -"`#2901 `__: " -"pgr_TSPeuclidean" +msgid "`#2901 `__: pgr_TSPeuclidean" +msgstr "`#2901 `__: pgr_TSPeuclidean" msgid "Removal of SQL deprecated functions" msgstr "Borttagning av föråldrade SQL-funktioner" -msgid "" -"`#2681 `__: " -"pgr_trspViaedges" +msgid "`#2681 `__: pgr_trspViaedges" msgstr "`#2681 `__: pgr_trspViaedges" -msgid "" -"`#2682 `__: " -"pgr_trspViaVertices" +msgid "`#2682 `__: pgr_trspViaVertices" msgstr "`#2682 `__: pgr_trspViaVertices" -msgid "" -"`#2748 `__: " -"pgr_alphaShape" -msgstr "" -"`#2748 `__: " -"pgr_alphaShape" +msgid "`#2748 `__: pgr_alphaShape" +msgstr "`#2748 `__: pgr_alphaShape" -msgid "" -"`#2751 `__: " -"pgr_createTopology" +msgid "`#2751 `__: pgr_createTopology" msgstr "`#2751 `__: pgr_createTopology" -msgid "" -"`#2752 `__: " -"pgr_analyzeGraph" -msgstr "" -"`#2752 `__: " -"pgr_analyzeGraph" +msgid "`#2752 `__: pgr_analyzeGraph" +msgstr "`#2752 `__: pgr_analyzeGraph" -msgid "" -"`#2755 `__: " -"pgr_analyzeOneWay" -msgstr "" -"`#2755 `__: " -"pgr_analyzeOneWay" +msgid "`#2755 `__: pgr_analyzeOneWay" +msgstr "`#2755 `__: pgr_analyzeOneWay" -msgid "" -"`#2827 `__: " -"pgr_createVerticesTable" -msgstr "" -"`#2827 `__: " -"pgr_createVerticesTable" +msgid "`#2827 `__: pgr_createVerticesTable" +msgstr "`#2827 `__: pgr_createVerticesTable" -msgid "" -"`#2886 `__: " -"pgr_nodeNetwork" -msgstr "" -"`#2886 `__: " -"pgr_nodeNetwork" +msgid "`#2886 `__: pgr_nodeNetwork" +msgstr "`#2886 `__: pgr_nodeNetwork" msgid "Removal of SQL deprecated internal functions" msgstr "Borttagning av interna funktioner i SQL som inte längre är aktuella" -msgid "" -"`#2748 `__ " -"_pgr_alphaShape(text,double precision)" +msgid "`#2748 `__ _pgr_alphaShape(text,double precision)" msgstr "`#2748 `__ _pgr_alphaShape(text,dubbel precision)" -msgid "" -"`#2861 `__ " -"_pgr_checkVertTab(text,text[],integer,text)" +msgid "`#2861 `__ _pgr_checkVertTab(text,text[],integer,text)" msgstr "`#2861 `__ _pgr_checkVertTab(text,text[],heltal,text)" -msgid "" -"`#2861 `__ " -"_pgr_createIndex(text,text,text,integer,text)" +msgid "`#2861 `__ _pgr_createIndex(text,text,text,integer,text)" msgstr "`#2861 `__ _pgr_createIndex(text,text,text,heltal,text)" -msgid "" -"`#2861 `__ " -"_pgr_createIndex(text,text,text,text,integer,text)" +msgid "`#2861 `__ _pgr_createIndex(text,text,text,text,integer,text)" msgstr "`#2861 `__ _pgr_createIndex(text,text,text,text,heltal,text)" -msgid "" -"`#2913 `__ " -"_pgr_dagShortestPath(text,anyarray,anyarray,boolean,boolean)" +msgid "`#2913 `__ _pgr_dagShortestPath(text,anyarray,anyarray,boolean,boolean)" msgstr "`#2913 `__ _pgr_dagShortestPath(text,valfri matris,valfri matris,boolean,boolean)" -msgid "" -"`#2913 `__ " -"_pgr_dagShortestPath(text,text,boolean,boolean)" +msgid "`#2913 `__ _pgr_dagShortestPath(text,text,boolean,boolean)" msgstr "`#2913 `__ _pgr_dagShortestPath(text,text,boolean,boolean)" -msgid "" -"`#2730 `__ " -"_pgr_dijkstraNear(text,anyarray,anyarray,bigint,boolean)" +msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,anyarray,bigint,boolean)" msgstr "`#2730 `__ _pgr_dijkstraNear(text,valfri matris,valfri matris,bigint,boolean)" -msgid "" -"`#2730 `__ " -"_pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)" +msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)" msgstr "`#2730 `__ _pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)" -msgid "" -"`#2730 `__ " -"_pgr_dijkstraNear(text,bigint,anyarray,bigint,boolean)" +msgid "`#2730 `__ _pgr_dijkstraNear(text,bigint,anyarray,bigint,boolean)" msgstr "`#2730 `__ _pgr_dijkstraNear(text,bigint,valfri matris,bigint,boolean)" -msgid "" -"`#2730 `__ " -"_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" +msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" msgstr "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" -msgid "" -"`#2730 `__ " -"_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" +msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" msgstr "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" -msgid "" -"`#2730 `__ " -"_pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" +msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" msgstr "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" -msgid "" -"`#2730 `__ " -"_pgr_dijkstra(text,text,boolean,boolean,boolean)" +msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,boolean)" msgstr "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,boolean)" -msgid "" -"`#2735 `__ " -"_pgr_drivingDistance(text,anyarray,double precision,boolean,boolean)" +msgid "`#2735 `__ _pgr_drivingDistance(text,anyarray,double precision,boolean,boolean)" msgstr "`#2735 `__ _pgr_drivingDistance(text,valfri matris,dubbel precision,boolean,boolean)" -msgid "" -"`#2861 `__ " -"_pgr_endPoint(geometry)" +msgid "`#2861 `__ _pgr_endPoint(geometry)" msgstr "`#2861 `__ _pgr_endPoint(geometry)" -msgid "" -"`#2861 `__ " -"__pgr_getColumnName(text,text,integer,text)" +msgid "`#2861 `__ __pgr_getColumnName(text,text,integer,text)" msgstr "`#2861 `__ __pgr_getColumnName(text,text,heltal,text)" -msgid "" -"`#2861 `__ " -"__pgr_getColumnName(text,text,text,integer,text)" +msgid "`#2861 `__ __pgr_getColumnName(text,text,text,integer,text)" msgstr "`#2861 `__ __pgr_getColumnName(text,text,text,heltal,text)" -msgid "" -"`#2861 `__ " -"__pgr_getColumnType(text,text,integer,text)" +msgid "`#2861 `__ __pgr_getColumnType(text,text,integer,text)" msgstr "`#2861 `__ __pgr_getColumnType(text,text,heltal,text)" -msgid "" -"`#2861 `__ " -"__pgr_getColumnType(text,text,text,integer,text)" +msgid "`#2861 `__ __pgr_getColumnType(text,text,text,integer,text)" msgstr "`#2861 `__ __pgr_getColumnType(text,text,text,heltal,text)" -msgid "" -"`#2861 `__ " -"__pgr_getTableName(text,integer,text)" +msgid "`#2861 `__ __pgr_getTableName(text,integer,text)" msgstr "`#2861 `__ __pgr_getTableName(text,heltal,text)" -msgid "" -"`#2861 `__ " -"_pgr_isColumnIndexed(text,text,integer,text)" +msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,integer,text)" msgstr "`#2861 `__ _pgr_isColumnIndexed(text,text,heltal,text)" -msgid "" -"`#2861 `__ " -"_pgr_isColumnIndexed(text,text,text,integer,text)" +msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,text,integer,text)" msgstr "`#2861 `__ _pgr_isColumnIndexed(text,text,text,heltal,text)" -msgid "" -"`#2861 `__ " -"_pgr_isColumnIntable(text,text)" +msgid "`#2861 `__ _pgr_isColumnIntable(text,text)" msgstr "`#2861 `__ _pgr_isColumnIntable(text,text)" -msgid "" -"`#2745 `__ " -"_pgr_kruskal(text,anyarray,text,bigint,double precision)" +msgid "`#2745 `__ _pgr_kruskal(text,anyarray,text,bigint,double precision)" msgstr "`#2745 `__ _pgr_kruskal(text,valfri matris,text,bigint,dubbel precision)" -msgid "" -"`#2897 `__ _pgr_ksp(text," -"anyarray,anyarray,integer,boolean,boolean,boolean)" +msgid "`#2897 `__ _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean)" msgstr "`#2897 `__ _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean,boolean)" -msgid "" -"`#2897 `__ _pgr_ksp(text," -"bigint,bigint,integer,boolean,boolean)" +msgid "`#2897 `__ _pgr_ksp(text,bigint,bigint,integer,boolean,boolean)" msgstr "`#2897 `__ _pgr_ksp(text,bigint,bigint,heltal,boolean,boolean)" -msgid "" -"`#2897 `__ _pgr_ksp(text," -"text,integer,boolean,boolean)" +msgid "`#2897 `__ _pgr_ksp(text,text,integer,boolean,boolean)" msgstr "`#2897 `__ _pgr_ksp(text,text,heltal,boolean,boolean)" -msgid "" -"`#2899 `__ " -"_pgr_maxCardinalityMatch(text,boolean)" +msgid "`#2899 `__ _pgr_maxCardinalityMatch(text,boolean)" msgstr "`#2899 `__ _pgr_maxCardinalityMatch(text,boolean)" -msgid "" -"`#2861 `__ " -"_pgr_msg(integer,text,text)" +msgid "`#2861 `__ _pgr_msg(integer,text,text)" msgstr "`#2861 `__ _pgr_msg(heltal,text,text)" -msgid "" -"`#2861 `__ " -"_pgr_onerror(boolean,integer,text,text,text,text)" +msgid "`#2861 `__ _pgr_onerror(boolean,integer,text,text,text,text)" msgstr "`#2861 `__ _pgr_onerror(boolean,heltal,text,text,text,text,text)" -msgid "" -"`#2861 `__ " -"_pgr_pointtoid(geometry,double precision,text,integer)" +msgid "`#2861 `__ _pgr_pointtoid(geometry,double precision,text,integer)" msgstr "`#2861 `__ _pgr_pointtoid(geometri,dubbel precision,text,heltal)" -msgid "" -"`#2743 `__ " -"_pgr_prim(text,anyarray,text,bigint,double precision)" +msgid "`#2743 `__ _pgr_prim(text,anyarray,text,bigint,double precision)" msgstr "`#2743 `__ _pgr_prim(text,valfri matris,text,bigint,dubbel precision)" -msgid "" -"`#2861 `__ " -"_pgr_quote_ident(text)" +msgid "`#2861 `__ _pgr_quote_ident(text)" msgstr "`#2861 `__ _pgr_quote_ident(text)" -msgid "" -"`#2861 `__ " -"_pgr_startPoint(geometry)" +msgid "`#2861 `__ _pgr_startPoint(geometry)" msgstr "`#2861 `__ _pgr_startPoint(geometry)" -msgid "" -"`#2683 `__ " -"_pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean,text)" +msgid "`#2683 `__ _pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" msgstr "`#2683 `__ _pgr_trsp(text,heltal,dubbel precision,heltal,dubbel precision,boolean,boolean,text)" -msgid "" -"`#2683 `__ " -"_pgr_trsp(text,text,anyarray,anyarray,boolean)" +msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,anyarray,boolean)" msgstr "`#2683 `__ _pgr_trsp(text,text,valfri matris,valfri matris,boolean)" -msgid "" -"`#2683 `__ " -"_pgr_trsp(text,text,anyarray,bigint,boolean)" +msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,bigint,boolean)" msgstr "`#2683 `__ _pgr_trsp(text,text,valfri matris,bigint,boolean)" -msgid "" -"`#2683 `__ " -"_pgr_trsp(text,text,bigint,anyarray,boolean)" +msgid "`#2683 `__ _pgr_trsp(text,text,bigint,anyarray,boolean)" msgstr "`#2683 `__ _pgr_trsp(text,text,bigint,valfri matris,boolean)" -msgid "" -"`#2683 `__ " -"_pgr_trsp(text,text,bigint,bigint,boolean)" +msgid "`#2683 `__ _pgr_trsp(text,text,bigint,bigint,boolean)" msgstr "`#2683 `__ _pgr_trsp(text,text,bigint,bigint,boolean)" -msgid "" -"`#2682 `__ " -"_pgr_trspViaVertices(text,integer[],boolean,boolean,text)" +msgid "`#2682 `__ _pgr_trspViaVertices(text,integer[],boolean,boolean,text)" msgstr "`#2682 `__ _pgr_trspViaVertices(text,heltal[],boolean,boolean,text)" -msgid "" -"`#2919 `__ " -"_pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean," -"character,boolean)" +msgid "`#2919 `__ _pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "`#2919 `__ _pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,boolean,character,boolean)" -msgid "" -"`#2919 `__ " -"_pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character," -"boolean)" +msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" msgstr "`#2919 `__ _pgr_trsp_withPoints(text,text,text,valfri matris,valfri matris,boolean,tecken,boolean)" -msgid "" -"`#2919 `__ " -"_pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" +msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" msgstr "`#2919 `__ _pgr_trsp_withPoints(text,text,text,text,boolean,tecken,boolean)" -msgid "" -"`#2901 `__ " -"_pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer," -"integer,double precision,double precision,double precision,boolean)" +msgid "`#2901 `__ _pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgstr "`#2901 `__ _pgr_tspEuclidean(text,bigint,bigint,dubbel precision,heltal,heltal,heltal,dubbel precision,dubbel precision,dubbel precision,boolean)" -msgid "" -"`#2901 `__ _pgr_tsp(text," -"bigint,bigint,double precision,integer,integer,integer,double precision," -"double precision,double precision,boolean)" +msgid "`#2901 `__ _pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgstr "`#2901 `__ _pgr_tsp(text,bigint,bigint,dubbel precision,heltal,heltal,heltal,dubbel precision,dubbel precision,dubbel precision,boolean)" -msgid "" -"`#2861 `__ " -"_pgr_versionLess(text,text)" +msgid "`#2861 `__ _pgr_versionLess(text,text)" msgstr "`#2861 `__ _pgr_versionLess(text,text)" -msgid "" -"`#2890 `__ " -"_pgr_withPointsDD(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" +msgid "`#2890 `__ _pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" msgstr "`#2890 `__ _pgr_withPointsDD(text,text,valfri matris,dubbel precision,boolean,tecken,boolean,boolean)" -msgid "" -"`#2895 `__ " -"_pgr_withPointsKSP(text,text,anyarray,anyarray,integer,character,boolean," -"boolean,boolean,boolean)" +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean)" msgstr "`#2895 `__ _pgr_withPointsKSP(text,text,valfri matris,valfri matris,heltal,tecken,boolean,boolean,boolean,boolean,boolean)" -msgid "" -"`#2895 `__ " -"_pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character," -"boolean)" +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" msgstr "`#2895 `__ _pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" -msgid "" -"`#2895 `__ " -"_pgr_withPointsKSP(text,text,text,integer,character,boolean,boolean,boolean)" +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,text,integer,character,boolean,boolean,boolean)" msgstr "`#2895 `__ _pgr_withPointsKSP(text,text,text,heltal,tecken,boolean,boolean,boolean,boolean)" -msgid "" -"`#2741 `__ " -"_pgr_withPointsVia(text,bigint[],double precision[],boolean)" +msgid "`#2741 `__ _pgr_withPointsVia(text,bigint[],double precision[],boolean)" msgstr "`#2741 `__ _pgr_withPointsVia(text,bigint[],dubbel precision[],boolean)" -msgid "" -"`#2741 `__ " -"_pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character," -"boolean)" +msgid "`#2741 `__ _pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "`#2741 `__ _pgr_withPointsVia(text,text,valfri matris,boolean,boolean,boolean,boolean,tecken,boolean)" -msgid "" -"`#2683 `__ _trsp(text," -"text,anyarray,anyarray,boolean)" +msgid "`#2683 `__ _trsp(text,text,anyarray,anyarray,boolean)" msgstr "`#2683 `__ _trsp(text,text,valfri matris,valfri matris,boolean)" -msgid "" -"`#2683 `__ _v4trsp(text," -"text,anyarray,anyarray,boolean)" +msgid "`#2683 `__ _v4trsp(text,text,anyarray,anyarray,boolean)" msgstr "`#2683 `__ _v4trsp(text,text,valfri matris,valfri matris,boolean)" -msgid "" -"`#2683 `__ _v4trsp(text," -"text,text,boolean)" +msgid "`#2683 `__ _v4trsp(text,text,text,boolean)" msgstr "`#2683 `__ _v4trsp(text,text,text,boolean)" msgid "Summary of functions and signatures no longer on pgrouting" -msgstr "" -"Sammanfattning av funktioner och signaturer som inte längre finns på " -"pgrouting" +msgstr "Sammanfattning av funktioner och signaturer som inte längre finns på pgrouting" -msgid "" -"`#2748 `__ " -"pgr_alphashape(geometry,double precision)" +msgid "`#2748 `__ pgr_alphashape(geometry,double precision)" msgstr "`#2748 `__ pgr_alphashape(geometri,dubbel precision)" -msgid "" -"`#2752 `__ " -"pgr_analyzegraph(text,double precision,text,text,text,text,text)" +msgid "`#2752 `__ pgr_analyzegraph(text,double precision,text,text,text,text,text)" msgstr "`#2752 `__ pgr_analyzegraph(text,dubbel precision,text,text,text,text,text,text)" -msgid "" -"`#2755 `__ " -"pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)" +msgid "`#2755 `__ pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)" msgstr "`#2755 `__ pgr_analyzeoneway(text,text[],text[],text[],text[],text[],boolean,text,text,text)" -msgid "" -"`#2798 `__ " -"pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgid "`#2798 `__ pgr_contraction(text,bigint[],integer,bigint[],boolean)" msgstr "`#2798 `__ pgr_contraction(text,bigint[],integer,bigint[],boolean)" -msgid "" -"`#2751 `__ " -"pgr_createtopology(text,double precision,text,text,text,text,text,boolean)" +msgid "`#2751 `__ pgr_createtopology(text,double precision,text,text,text,text,text,boolean)" msgstr "`#2751 `__ pgr_createtopology(text,dubbel precision,text,text,text,text,text,boolean)" -msgid "" -"`#2827 `__ " -"pgr_createverticestable(text,text,text,text,text)" +msgid "`#2827 `__ pgr_createverticestable(text,text,text,text,text)" msgstr "`#2827 `__ pgr_createverticestable(text,text,text,text,text,text)" -msgid "" -"`#2888 `__ " -"pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" +msgid "`#2888 `__ pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" msgstr "`#2888 `__ pgr_findcloseedges(text,geometry,dubbel precision,heltal,boolean,boolean)" -msgid "" -"`#2888 `__ " -"pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" +msgid "`#2888 `__ pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" msgstr "`#2888 `__ pgr_findcloseedges(text,geometry[],dubbel precision,heltal,boolean,boolean)" -msgid "" -"`#2899 `__ " -"pgr_maxCardinalityMatch(text,boolean)" +msgid "`#2899 `__ pgr_maxCardinalityMatch(text,boolean)" msgstr "`#2899 `__ pgr_maxCardinalityMatch(text,boolean)" -msgid "" -"`#2886 `__ " -"pgr_nodenetwork(text,double precision,text,text,text,text,boolean)" +msgid "`#2886 `__ pgr_nodenetwork(text,double precision,text,text,text,text,boolean)" msgstr "`#2886 `__ pgr_nodenetwork(text,dubbel precision,text,text,text,text,text,boolean)" -msgid "" -"`#2683 `__ pgr_trsp(text," -"integer,double precision,integer,double precision,boolean,boolean,text)" +msgid "`#2683 `__ pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" msgstr "`#2683 `__ pgr_trsp(text,heltal,dubbel precision,heltal,dubbel precision,boolean,boolean,text)" -msgid "" -"`#2683 `__ pgr_trsp(text," -"integer,integer,boolean,boolean,text)" +msgid "`#2683 `__ pgr_trsp(text,integer,integer,boolean,boolean,text)" msgstr "`#2683 `__ pgr_trsp(text,heltal,heltal,boolean,boolean,text)" -msgid "" -"`#2681 `__ " -"pgr_trspViaedges(text,integer[],double precision[],boolean,boolean,text)" +msgid "`#2681 `__ pgr_trspViaedges(text,integer[],double precision[],boolean,boolean,text)" msgstr "`#2681 `__ pgr_trspViaedges(text,heltal[],dubbel precision[],boolean,boolean,text)" -msgid "" -"`#2682 `__ " -"pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" +msgid "`#2682 `__ pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" msgstr "`#2682 `__ pgr_trspViaVertices(text,valfri matris,boolean,boolean,text)" -msgid "" -"`#2919 `__ " -"pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean," -"character,boolean)" +msgid "`#2919 `__ pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "`#2919 `__ pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,boolean,character,boolean)" -msgid "" -"`#2919 `__ " -"pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character," -"boolean)" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" msgstr "`#2919 `__ pgr_trsp_withPoints(text,text,text,valfri matris,valfri matris,boolean,tecken,boolean)" -msgid "" -"`#2919 `__ " -"pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)" msgstr "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)" -msgid "" -"`#2919 `__ " -"pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)" msgstr "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)" -msgid "" -"`#2919 `__ " -"pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)" msgstr "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)" -msgid "" -"`#2919 `__ " -"pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" msgstr "`#2919 `__ pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" -msgid "" -"`#2901 `__ " -"pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer," -"double precision,double precision,double precision,boolean)" +msgid "`#2901 `__ pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgstr "`#2901 `__ pgr_tspEuclidean(text,bigint,bigint,dubbel precision,heltal,heltal,heltal,dubbel precision,dubbel precision,dubbel precision,boolean)" -msgid "" -"`#2901 `__ pgr_tsp(text," -"bigint,bigint,double precision,integer,integer,integer,double precision," -"double precision,double precision,boolean)" +msgid "`#2901 `__ pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" msgstr "`#2901 `__ pgr_tsp(text,bigint,bigint,dubbel precision,heltal,heltal,heltal,dubbel precision,dubbel precision,dubbel precision,boolean)" -msgid "" -"`#2919 `__ " -"pgr_withPointsCostMatrix(text,text,anyarray,boolean,character)" +msgid "`#2919 `__ pgr_withPointsCostMatrix(text,text,anyarray,boolean,character)" msgstr "`#2919 `__ pgr_withPointsCostMatrix(text,text,valfri matris,boolean,tecken)" -msgid "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,anyarray,anyarray,boolean,character)" +msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,anyarray,boolean,character)" msgstr "`#2919 `__ pgr_withPointsCost(text,text,valfri matris,valfri matris,boolean,tecken)" -msgid "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,anyarray,bigint,boolean,character)" +msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,bigint,boolean,character)" msgstr "`#2919 `__ pgr_withPointsCost(text,text,valfri matris,bigint,boolean,tecken)" -msgid "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,bigint,anyarray,boolean,character)" +msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,anyarray,boolean,character)" msgstr "`#2919 `__ pgr_withPointsCost(text,text,bigint,valfri matris,boolean,tecken)" -msgid "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,bigint,bigint,boolean,character)" +msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,bigint,boolean,character)" msgstr "`#2919 `__ pgr_withPointsCost(text,text,bigint,bigint,boolean,character)" -msgid "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,text,boolean,character)" +msgid "`#2919 `__ pgr_withPointsCost(text,text,text,boolean,character)" msgstr "`#2919 `__ pgr_withPointsCost(text,text,text,boolean,tecken)" -msgid "" -"`#2890 `__ " -"pgr_withPointsDD(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" +msgid "`#2890 `__ pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" msgstr "`#2890 `__ pgr_withPointsDD(text,text,valfri matris,dubbel precision,boolean,tecken,boolean,boolean)" -msgid "" -"`#2890 `__ " -"pgr_withPointsDD(text,text,bigint,double precision,boolean,character,boolean)" +msgid "`#2890 `__ pgr_withPointsDD(text,text,bigint,double precision,boolean,character,boolean)" msgstr "`#2890 `__ pgr_withPointsDD(text,text,bigint,dubbel precision,boolean,tecken,boolean)" -msgid "" -"`#2895 `__ " -"pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character," -"boolean)" +msgid "`#2895 `__ pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" msgstr "`#2895 `__ pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" -msgid "" -"`#2919 `__ " -"pgr_withPoints(text,text,anyarray,anyarray,boolean,character,boolean)" +msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,anyarray,boolean,character,boolean)" msgstr "`#2919 `__ pgr_withPoints(text,text,valfri matris,valfri matris,boolean,tecken,boolean)" -msgid "" -"`#2919 `__ " -"pgr_withPoints(text,text,anyarray,bigint,boolean,character,boolean)" +msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,bigint,boolean,character,boolean)" msgstr "`#2919 `__ pgr_withPoints(text,text,valfri matris,bigint,boolean,tecken,boolean)" -msgid "" -"`#2919 `__ " -"pgr_withPoints(text,text,bigint,anyarray,boolean,character,boolean)" +msgid "`#2919 `__ pgr_withPoints(text,text,bigint,anyarray,boolean,character,boolean)" msgstr "`#2919 `__ pgr_withPoints(text,text,bigint,valfri matris,boolean,tecken,boolean)" -msgid "" -"`#2919 `__ " -"pgr_withPoints(text,text,bigint,bigint,boolean,character,boolean)" +msgid "`#2919 `__ pgr_withPoints(text,text,bigint,bigint,boolean,character,boolean)" msgstr "`#2919 `__ pgr_withPoints(text,text,bigint,bigint,boolean,tecken,boolean)" -msgid "" -"`#2919 `__ " -"pgr_withPoints(text,text,text,boolean,character,boolean)" +msgid "`#2919 `__ pgr_withPoints(text,text,text,boolean,character,boolean)" msgstr "`#2919 `__ pgr_withPoints(text,text,text,boolean,tecken,boolean)" -msgid "" -"`#2919 `__ " -"pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character," -"boolean)" +msgid "`#2919 `__ pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" msgstr "`#2919 `__ pgr_withPointsVia(text,text,valfri matris,boolean,boolean,boolean,boolean,tecken,boolean)" msgid "Code enhancements" @@ -5643,14 +4503,10 @@ msgstr "`#2683 `__ _trsp" msgid "`#2683 `__ _v4trsp" msgstr "`#2683 `__ _v4trsp" -msgid "" -"`#2748 `__ " -"_pgr_alphaShape" +msgid "`#2748 `__ _pgr_alphaShape" msgstr "`#2748 `__ _pgr_alphaShape" -msgid "" -"`#2913 `__ " -"_pgr_dagShortestPath" +msgid "`#2913 `__ _pgr_dagShortestPath" msgstr "`#2913 `__ _pgr_dagShortestPath" msgid "All releases" @@ -5659,14 +4515,8 @@ msgstr "Alla utgåvor" msgid "Kruskal - Family of functions" msgstr "Kruskal - Familj av funktioner" -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 "" -"Kruskals algoritm är en \"greedy minimum spanning tree\"-algoritm som i " -"varje cykel hittar och lägger till den kant med minsta möjliga vikt som " -"förbinder två träd i skogen." +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 "Kruskals algoritm är en \"greedy minimum spanning tree\"-algoritm som i varje cykel hittar och lägger till den kant med minsta möjliga vikt som förbinder två träd i skogen." msgid "**The main Characteristics are:**" msgstr "**De viktigaste egenskaperna är:**" @@ -5683,29 +4533,20 @@ msgstr "Metrics - Familj av funktioner" msgid "Migration guide" msgstr "Migrationsguide" -msgid "" -"Several functions are having changes on the signatures, and/or have been " -"replaced by new functions." -msgstr "" -"Flera funktioner har förändringar på signaturerna och/eller har ersatts av " -"nya funktioner." +msgid "Several functions are having changes on the signatures, and/or have been replaced by new functions." +msgstr "Flera funktioner har förändringar på signaturerna och/eller har ersatts av nya funktioner." msgid "Results can be different because of the changes." msgstr "Resultaten kan bli annorlunda på grund av förändringarna." msgid "All deprecated functions will be removed on next major version 4.0.0" -msgstr "" -"Alla föråldrade funktioner kommer att tas bort i nästa större version 4.0.0" +msgstr "Alla föråldrade funktioner kommer att tas bort i nästa större version 4.0.0" msgid "Migration to standardized columns" msgstr "Migrering till standardiserade kolumner" -msgid "" -"There has been an effort to standardize function output columns names and " -"types." -msgstr "" -"Det har gjorts försök att standardisera namn och typer på kolumner för " -"funktionsutdata." +msgid "There has been an effort to standardize function output columns names and types." +msgstr "Det har gjorts försök att standardisera namn och typer på kolumner för funktionsutdata." msgid ":ref:`pgRouting-concepts:Result columns for cost functions`" msgstr ":ref:`pgRouting-concepts:Result columns for cost functions`" @@ -5788,16 +4629,10 @@ msgstr "`Migrering av kostnadsfunktioner`_" msgid "Migration of cost functions" msgstr "Migrering av kostnadsfunktioner" -msgid "" -"The standardized :ref:`pgRouting-concepts:Result columns for cost functions` " -"are |matrix-result|" -msgstr "" -"De standardiserade :ref:`pgRouting-concepts:Result columns for cost " -"functions` är |matrix-result|" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for cost functions` are |matrix-result|" +msgstr "De standardiserade :ref:`pgRouting-concepts:Result columns for cost functions` är |matrix-result|" -msgid "" -"The following functions need to be migrated when they are being used in an " -"application." +msgid "The following functions need to be migrated when they are being used in an application." msgstr "Följande funktioner måste migreras när de används i en applikation." msgid "Version" @@ -5845,22 +4680,14 @@ msgstr "Kombinationer" msgid "Breaking change" msgstr "Brytande förändring" -msgid "" -"If using ``pgr_withPointsCost``: column names must be changed after updating " -"pgRouting" -msgstr "" -"Om du använder ``pgr_withPointsCost``: kolumnnamn måste ändras efter " -"uppdatering av pgRouting" +msgid "If using ``pgr_withPointsCost``: column names must be changed after updating pgRouting" +msgstr "Om du använder ``pgr_withPointsCost``: kolumnnamn måste ändras efter uppdatering av pgRouting" msgid "New output columns are |matrix-result|" msgstr "Nya utdatakolumner är |matrix-result|" -msgid "" -"To get the old version column names: rename ``start_vid`` to ``start_pid`` " -"and ``end_vid`` to ``end_pid``." -msgstr "" -"För att få kolumnnamnen i den gamla versionen: byt namn på ``start_vid`` " -"till ``start_pid`` och ``end_vid`` till ``end_pid``." +msgid "To get the old version column names: rename ``start_vid`` to ``start_pid`` and ``end_vid`` to ``end_pid``." +msgstr "För att få kolumnnamnen i den gamla versionen: byt namn på ``start_vid`` till ``start_pid`` och ``end_vid`` till ``end_pid``." msgid "Examples" msgstr "Exempel" @@ -5871,12 +4698,8 @@ msgstr "Exempel på One to One för kostnadsfunktioner" msgid "Using ``pgr_withPointsCost``" msgstr "Använda ``pgr_withPointsCost``" -msgid "" -"Migrating `this v3.8 `__ example." -msgstr "" -"Migrering av `this v3.8 `__ exempel." +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrering av `this v3.8 `__ exempel." msgid "from" msgstr "från" @@ -5887,52 +4710,32 @@ msgstr "till" msgid "Examples for One to Many for cost functions" msgstr "Exempel på One to Many för kostnadsfunktioner" -msgid "" -"Migrating `this v3.8 `__ example." -msgstr "" -"Migrering av `this v3.8 `__ exempel." +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrering av `this v3.8 `__ exempel." msgid "Examples for Many to One for cost functions" msgstr "Exempel på Many to One för kostnadsfunktioner" -msgid "" -"Migrating `this v3.8 `__ example." -msgstr "" -"Migrering av `this v3.8 `__ exempel." +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrering av `this v3.8 `__ exempel." msgid "Examples for Many to Many for cost functions" msgstr "Exempel på Many to Many för kostnadsfunktioner" -msgid "" -"Migrating `this v3.8 `__ example." -msgstr "" -"Migrering av `this v3.8 `__ exempel." +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrering av `this v3.8 `__ exempel." msgid "Examples for Combinations for cost functions" msgstr "Exempel på Kombinationer för kostnadsfunktioner" -msgid "" -"Migrating `this v3.8 `__ example." -msgstr "" -"Migrering av `this v3.8 `__ exempel." +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrering av `this v3.8 `__ exempel." msgid "Migration of multiple paths functions" msgstr "Migrering av funktioner för flera banor" -msgid "" -"The standardized :ref:`pgRouting-concepts:Result columns for single path " -"functions` are |nksp-result|" -msgstr "" -"De standardiserade :ref:`pgRouting-concepts:Result columns for single path " -"functions` är |nksp-result|" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |nksp-result|" +msgstr "De standardiserade :ref:`pgRouting-concepts:Result columns for single path functions` är |nksp-result|" msgid "``pgr_KSP``" msgstr "``pgr_KSP``" @@ -5961,12 +4764,8 @@ msgstr "Innan du uppdaterar pgRouting, räkna upp |ksp-result|" msgid "One to One example using ``pgr_KSP``" msgstr "Ett till ett exempel med hjälp av ``pgr_KSP``" -msgid "" -"Using `this `__ " -"example." -msgstr "" -"Använda `det här `__ exemplet." +msgid "Using `this `__ example." +msgstr "Använda `det här `__ exemplet." msgid "Migration of |result-disjoint|" msgstr "Migrering av |result-disjoint|" @@ -5983,12 +4782,8 @@ msgstr "Hoppa över när det är tillämpligt, ``end_vid``" msgid "One to One example using ``pgr_edgeDisjointPaths``" msgstr "Ett till ett exempel med hjälp av ``pgr_edgeDisjointPaths``" -msgid "" -"Migrating `this v3.8 `__ example." -msgstr "" -"Migrering av `this v3.8 `__ exempel." +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrering av `this v3.8 `__ exempel." msgid "Before updating pgRouting enumerate the columns: |ksp-result|" msgstr "Innan du uppdaterar pgRouting räkna upp kolumnerna: |ksp-result|" @@ -5996,12 +4791,8 @@ msgstr "Innan du uppdaterar pgRouting räkna upp kolumnerna: |ksp-result|" msgid "Migration of single path functions" msgstr "Migrering av funktioner med en enda sökväg" -msgid "" -"The standardized :ref:`pgRouting-concepts:Result columns for single path " -"functions` are |short-generic-result|" -msgstr "" -"De standardiserade :ref:`pgRouting-concepts:Result columns for single path " -"functions` är |short-generic-result|" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |short-generic-result|" +msgstr "De standardiserade :ref:`pgRouting-concepts:Result columns for single path functions` är |short-generic-result|" msgid "``pgr_dijkstra``" msgstr "``pgr_dijkstra``" @@ -6039,11 +4830,8 @@ msgstr "|old-pid-result|" msgid "Migration of |old-generic-result|" msgstr "Migrering av |old-generic-result|" -msgid "" -"Before updating pgRouting, enumerate the corresponding columns of the " -"signature" -msgstr "" -"Innan du uppdaterar pgRouting, räkna upp motsvarande kolumner i signaturen" +msgid "Before updating pgRouting, enumerate the corresponding columns of the signature" +msgstr "Innan du uppdaterar pgRouting, räkna upp motsvarande kolumner i signaturen" msgid "Migration of |old-pid-result|" msgstr "Migrering av |old-pid-result|" @@ -6063,12 +4851,8 @@ msgstr "``start_vid`` till ``start_pid``" msgid "``end_vid`` to ``end_pid``" msgstr "``slut_vid`` till ``slut_pid``" -msgid "" -"If using ``pgr_withPoints``: column names must be changed after updating " -"pgRouting" -msgstr "" -"Om du använder ``pgr_withPoints``: kolumnnamn måste ändras efter uppdatering " -"av pgRouting" +msgid "If using ``pgr_withPoints``: column names must be changed after updating pgRouting" +msgstr "Om du använder ``pgr_withPoints``: kolumnnamn måste ändras efter uppdatering av pgRouting" msgid "Migration of |result-1-1|" msgstr "Migrering av |result-1-1|" @@ -6085,12 +4869,8 @@ msgstr "Exempel med en till en med en rutt resultat" msgid "Using ``pgr_aStar``" msgstr "Använda ``pgr_aStar``" -msgid "" -"Migrating `this v3.5 `__ example." -msgstr "" -"Migrering av `this v3.5 `__ exempel." +msgid "Migrating `this v3.5 `__ example." +msgstr "Migrering av `this v3.5 `__ exempel." msgid "Before updating pgRouting enumerate the columns: |result-1-1|" msgstr "Innan du uppdaterar pgRouting räkna upp kolumnerna: |result-1-1|" @@ -6098,22 +4878,14 @@ msgstr "Innan du uppdaterar pgRouting räkna upp kolumnerna: |result-1-1|" msgid "Using ``pgr_bdDijkstra``" msgstr "Använda ``pgr_bdDijkstra``" -msgid "" -"Migrating `this v3.8 `__ example." -msgstr "" -"Migrering av `this v3.8 `__ exempel." +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrering av `this v3.8 `__ exempel." msgid "Using ``pgr_DAGshortestPath``" msgstr "Använda ``pgr_DAGshortestPath``" -msgid "" -"Migrating `this v3.8 `__ example." -msgstr "" -"Migrering av `this v3.8 `__ exempel." +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrering av `this v3.8 `__ exempel." msgid "This applies to all signatures of ``pgr_DAGshortestPath``" msgstr "Detta gäller för alla signaturer av ``pgr_DAGshortestPath``" @@ -6124,12 +4896,8 @@ msgstr "Exempel för One to Many med ett ruttresultat" msgid "Using ``pgr_bdAstar``" msgstr "Använda ``pgr_bdAstar``" -msgid "" -"Migrating `this v3.5 `__ example." -msgstr "" -"Migrering av `this v3.5 `__ exempel." +msgid "Migrating `this v3.5 `__ example." +msgstr "Migrering av `this v3.5 `__ exempel." msgid "Before updating pgRouting enumerate the columns: |result-1-m|" msgstr "Innan uppdatering av pgRouting räknas kolumnerna upp: |result-1-m|" @@ -6137,32 +4905,20 @@ msgstr "Innan uppdatering av pgRouting räknas kolumnerna upp: |result-1-m|" msgid "Using ``pgr_withPoints``" msgstr "Använda ``pgr_withPoints``" -msgid "" -"Migrating `this v3.8 `__ example." -msgstr "" -"Migrering av `this v3.8 `__ exempel." +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrering av `this v3.8 `__ exempel." msgid "|pid-1-m|" msgstr "|pid-1-m|" -msgid "" -"To get the old signature column names: filter out the column ``start_vid`` " -"and rename ``end_vid`` to ``end_pid``." -msgstr "" -"För att få de gamla signaturkolumnnamnen: filtrera bort kolumnen " -"``start_vid`` och byt namn på ``end_vid`` till ``end_pid``." +msgid "To get the old signature column names: filter out the column ``start_vid`` and rename ``end_vid`` to ``end_pid``." +msgstr "För att få de gamla signaturkolumnnamnen: filtrera bort kolumnen ``start_vid`` och byt namn på ``end_vid`` till ``end_pid``." msgid "Examples for Many to One with one route result" msgstr "Exempel för Many to One med ett ruttresultat" -msgid "" -"Migrating `this v3.8 `__ example." -msgstr "" -"Migrering av `this v3.8 `__ exempel." +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrering av `this v3.8 `__ exempel." msgid "Before updating pgRouting enumerate the columns: |result-m-1|" msgstr "Innan uppdatering av pgRouting räknas kolumnerna upp: |result-m-1|" @@ -6170,22 +4926,14 @@ msgstr "Innan uppdatering av pgRouting räknas kolumnerna upp: |result-m-1|" msgid "Using ``pgr_dijkstra``" msgstr "Använda ``pgr_dijkstra``" -msgid "" -"Migrating `this v3.4 `__ example." -msgstr "" -"Migrering av `this v3.4 `__ exempel." +msgid "Migrating `this v3.4 `__ example." +msgstr "Migrering av `this v3.4 `__ exempel." msgid "Examples for Many to Many with one route result" msgstr "Exempel för Many to Many med ett ruttresultat" -msgid "" -"Migrating `this v3.8 `__ example." -msgstr "" -"Migrering av `this v3.8 `__ exempel." +msgid "Migrating `this v3.8 `__ example." +msgstr "Migrering av `this v3.8 `__ exempel." msgid "|pid-m-m|" msgstr "|pid-m-m|" @@ -6193,22 +4941,14 @@ msgstr "|pid-m-m|" msgid "Examples for combinations with one route result" msgstr "Exempel på kombinationer med ett vägresultat" -msgid "" -"Migrating `this v3.8 `this `__ example." -msgstr "" -"Migrering av `this v3.8 `this `__ exempel." +msgid "Migrating `this v3.8 `this `__ example." +msgstr "Migrering av `this v3.8 `this `__ exempel." msgid "Migration of spanning tree functions" msgstr "Migrering av spanning tree-funktioner" -msgid "" -"The standardized :ref:`pgRouting-concepts:Result columns for spanning tree " -"functions` are |result-spantree|" -msgstr "" -"De standardiserade :ref:`pgRouting-concepts:Result columns for spanning tree " -"functions` är |result-spantree|" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for spanning tree functions` are |result-spantree|" +msgstr "De standardiserade :ref:`pgRouting-concepts:Result columns for spanning tree functions` är |result-spantree|" msgid "``pgr_drivingDistance``" msgstr "``pgr_drivingDistance``" @@ -6273,12 +5013,8 @@ msgstr "Innan uppdatering av pgRouting räknas kolumnerna upp: |result-bfs|" msgid "Single vertex example using ``pgr_kruskalDD``" msgstr "Exempel på enstaka toppar med ``pgr_kruskalDD``" -msgid "" -"Migrating `this v3.6 `__ example." -msgstr "" -"Migrering av `this v3.6 `__ exempel." +msgid "Migrating `this v3.6 `__ example." +msgstr "Migrering av `this v3.6 `__ exempel." msgid "Before updating pgRouting enumerate the columns: |result-bfs|." msgstr "Innan uppdatering av pgRouting räknas kolumnerna upp: |result-bfs|." @@ -6286,12 +5022,8 @@ msgstr "Innan uppdatering av pgRouting räknas kolumnerna upp: |result-bfs|." msgid "Multiple vertices example using ``pgr_kruskalDFS``" msgstr "Exempel på flera vertikaler med hjälp av ``pgr_kruskalDFS``" -msgid "" -"Migrating `this v3.6 `__ example." -msgstr "" -"Migrering av `this v3.6 `__ exempel." +msgid "Migrating `this v3.6 `__ example." +msgstr "Migrering av `this v3.6 `__ exempel." msgid "Migration from |result-dij-dd|" msgstr "Migrering från |result-dij-dd|" @@ -6323,34 +5055,20 @@ msgstr "byt namn på ``start_vid`` till ``from_v``." msgid "Single vertex example using ``pgr_drivingDistance``" msgstr "Exempel på en enda vertex med hjälp av ``pgr_drivingDistance``" -msgid "" -"Migrating `this v3.5 `__ example." -msgstr "" -"Migrering av `this v3.5 `__ exempel." +msgid "Migrating `this v3.5 `__ example." +msgstr "Migrering av `this v3.5 `__ exempel." msgid "Before updating pgRouting, enumerate |result-1-1-no-seq| columns" -msgstr "" -"Innan du uppdaterar pgRouting, räkna upp kolumnerna |result-1-1-no-seq|" +msgstr "Innan du uppdaterar pgRouting, räkna upp kolumnerna |result-1-1-no-seq|" msgid "Multiple vertices example using ``pgr_drivingDistance``" msgstr "Exempel på flera toppar med hjälp av ``pgr_drivingDistance``" -msgid "" -"Migrating `this v3.5 `__ example." -msgstr "" -"Migrering av `this v3.5 `__ exempel." +msgid "Migrating `this v3.5 `__ example." +msgstr "Migrering av `this v3.5 `__ exempel." -msgid "" -"To get the old version column names |result-dij-dd-m|: filter out the column " -"``pred`` and ``depth`` and rename ``start_vid`` to ``from_v``." -msgstr "" -"För att få den gamla versionens kolumnnamn |result-dij-dd-m|: filtrera bort " -"kolumnen ``pred`` och ``depth`` och byt namn på ``start_vid`` till " -"``from_v``." +msgid "To get the old version column names |result-dij-dd-m|: filter out the column ``pred`` and ``depth`` and rename ``start_vid`` to ``from_v``." +msgstr "För att få den gamla versionens kolumnnamn |result-dij-dd-m|: filtrera bort kolumnen ``pred`` och ``depth`` och byt namn på ``start_vid`` till ``from_v``." msgid "Migration of |result-generic-no-seq|" msgstr "Migrering av |result-generic-no-seq|" @@ -6361,12 +5079,8 @@ msgstr "Efter uppdatering av pgRouting:" msgid "Enumerate |result-1-1-no-seq| columns" msgstr "Räkna upp kolumner för resultat-1-1-icke-seq" -msgid "" -"Use an unnamed valid value for **driving side** after the **distance** " -"parameter." -msgstr "" -"Använd ett icke namngivet giltigt värde för **körsida** efter parametern " -"**avstånd**." +msgid "Use an unnamed valid value for **driving side** after the **distance** parameter." +msgstr "Använd ett icke namngivet giltigt värde för **körsida** efter parametern **avstånd**." msgid "Enumerate |result-m-1-no-seq| columns" msgstr "Räkna upp |result-m-1-no-seq|-kolumner" @@ -6374,9 +5088,7 @@ msgstr "Räkna upp |result-m-1-no-seq|-kolumner" msgid "Default value of **driving side** parameter" msgstr "Standardvärde för parametern **förarsida**" -msgid "" -"**driving side** parameter is unnamed, and valid values differ for directed " -"and undirected graphs." +msgid "**driving side** parameter is unnamed, and valid values differ for directed and undirected graphs." msgstr "*parametern *driving side** är namnlös och giltiga värden skiljer sig åt för riktade och oriktade grafer." msgid "In directed graph: valid values are [``r``, ``R``, ``l``, ``L``]" @@ -6394,22 +5106,14 @@ msgstr "Standardvärde = \"b\";" msgid "Single vertex example using ``pgr_withPointsDD``" msgstr "Exempel på en enda toppunkt med ``pgr_withPointsDD``" -msgid "" -"Migrating `this v3.5 `__ example." -msgstr "" -"Migrering av `this v3.5 `__ exempel." +msgid "Migrating `this v3.5 `__ example." +msgstr "Migrering av `this v3.5 `__ exempel." msgid "Multiple vertices example using ``pgr_withPointsDD``" msgstr "Exempel på flera vertikaler med hjälp av ``pgr_withPointsDD``" -msgid "" -"Migrating `this v3.5 `__ example." -msgstr "" -"Migrering av `this v3.5 `__ exempel." +msgid "Migrating `this v3.5 `__ example." +msgstr "Migrering av `this v3.5 `__ exempel." msgid "Migration of output column name change" msgstr "Ändring av namn på utdatakolumn vid migrering" @@ -6469,8 +5173,7 @@ msgid "Remove column ``seq``" msgstr "Ta bort kolumnen ``seq``" msgid "Rename ``vid`` to ``node`` and ``target_array`` to ``targets``" -msgstr "" -"Byt namn på ``vid`` till ``node`` och ``target_array`` till ``targets``" +msgstr "Byt namn på ``vid`` till ``node`` och ``target_array`` till ``targets``" msgid "Migration from |result-toposort|" msgstr "Migrering från |result-toposort|" @@ -6497,8 +5200,7 @@ msgid "Migration to: |result_node_color|" msgstr "Migration till: |result_node_color|" msgid "Rename ``vertex_id`` to ``node`` and ``color_id`` to ``color``." -msgstr "" -"Byt namn på ``vertex_id`` till ``node`` och ``color_id`` till ``color``." +msgstr "Byt namn på ``vertex_id`` till ``node`` och ``color_id`` till ``color``." msgid "Migration of deleted functions" msgstr "Migrering av borttagna funktioner" @@ -6536,12 +5238,8 @@ msgstr "PostGIS har två sätt att generera alphaShape." msgid "If you have SFCGAL, which you can install using" msgstr "Om du har SFCGAL, som du kan installera med hjälp av" -msgid "" -"Since PostGIS 3.5+ use `CG_AlphaShape `__" -msgstr "" -"Sedan PostGIS 3.5+ används `CG_AlphaShape `__" +msgid "Since PostGIS 3.5+ use `CG_AlphaShape `__" +msgstr "Sedan PostGIS 3.5+ används `CG_AlphaShape `__" msgid "For PostGIS 3.5+ use the old name ``ST_AlphaShape``" msgstr "För PostGIS 3.5+ använd det gamla namnet ``ST_AlphaShape``" @@ -6558,20 +5256,14 @@ msgstr "`ST_ConcaveHull `__" msgid "Migration of ``pgr_nodeNetwork``" msgstr "Migrering av ``pgr_nodeNetwork``" -msgid "" -"**Before Deprecation:** A table with `_nodded` was created. with " -"split edges." -msgstr "" -"**Before Deprecation:** En tabell med `_nodded` skapades. med delade " -"kanter." +msgid "**Before Deprecation:** A table with `_nodded` was created. with split edges." +msgstr "**Before Deprecation:** En tabell med `_nodded` skapades. med delade kanter." msgid "**Migration**" msgstr "**Migration**" msgid "Use :doc:`pgr_separateTouching` and/or use :doc:`pgr_separateCrossing`" -msgstr "" -"Använd :doc:`pgr_separateTouching` och/eller använd :doc:" -"`pgr_separateCrossing`" +msgstr "Använd :doc:`pgr_separateTouching` och/eller använd :doc:`pgr_separateCrossing`" msgid "Migration of ``pgr_createTopology``" msgstr "Migrering av ``pgr_createTopology``" @@ -6579,85 +5271,38 @@ msgstr "Migrering av ``pgr_createTopology``" msgid "A table with `_vertices_pgr` was created." msgstr "En tabell med `_vertices_pgr` skapades." -msgid "" -"**After Deprecation:** The user is responsible to create the complete " -"topology." -msgstr "" -"**Efter Deprecation:** Användaren är ansvarig för att skapa den kompletta " -"topologin." +msgid "**After Deprecation:** The user is responsible to create the complete topology." +msgstr "**Efter Deprecation:** Användaren är ansvarig för att skapa den kompletta topologin." msgid "Build a routing topology" msgstr "Bygga upp en routingtopologi" -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 "" -"Den grundläggande informationen för att använda de flesta av pgRouting-" -"funktionerna ``id, source, target, cost, [reverse_cost]`` är vad som i " -"pgRouting kallas routingtopologin." +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 "Den grundläggande informationen för att använda de flesta av pgRouting-funktionerna ``id, source, target, cost, [reverse_cost]`` är vad som i pgRouting kallas routingtopologin." -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`` är valfritt men rekommenderas starkt för att minska " -"databasens storlek på grund av storleken på geometrikolumnerna. I den här " -"dokumentationen används dock ``reverse_cost`` i den här dokumentationen." +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`` är valfritt men rekommenderas starkt för att minska databasens storlek på grund av storleken på geometrikolumnerna. I den här dokumentationen används dock ``reverse_cost`` i den här dokumentationen." -msgid "" -"When the data comes with geometries and there is no routing topology, then " -"this step is needed." -msgstr "" -"När data levereras med geometrier och det inte finns någon routningstopologi " -"behövs det här steget." +msgid "When the data comes with geometries and there is no routing topology, then this step is needed." +msgstr "När data levereras med geometrier och det inte finns någon routningstopologi behövs det här steget." -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 "" -"Alla geometriernas start- och slutpunkter behöver en identifierare som ska " -"lagras i kolumnerna ``källa`` och ``mål`` i datatabellen. På samma sätt " -"måste ``cost`` och ``reverse_cost`` ha värdet för att korsa kanten i båda " -"riktningarna." +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 "Alla geometriernas start- och slutpunkter behöver en identifierare som ska lagras i kolumnerna ``källa`` och ``mål`` i datatabellen. På samma sätt måste ``cost`` och ``reverse_cost`` ha värdet för att korsa kanten i båda riktningarna." -msgid "" -"If the columns do not exist they need to be added to the table in question. " -"(see `ALTER TABLE `__)" -msgstr "" -"Om kolumnerna inte finns måste de läggas till i tabellen i fråga. (se `ALTER " -"TABLE `__)" +msgid "If the columns do not exist they need to be added to the table in question. (see `ALTER TABLE `__)" +msgstr "Om kolumnerna inte finns måste de läggas till i tabellen i fråga. (se `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 "" -"Funktionen :doc:`pgr_extractVertices` används för att skapa en vertices-" -"tabell baserad på kantidentifieraren och geometrin för kanten i grafen." +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 "Funktionen :doc:`pgr_extractVertices` används för att skapa en vertices-tabell baserad på kantidentifieraren och geometrin för kanten i grafen." -msgid "" -"Finally using the data stored on the vertices tables the ``source`` and " -"``target`` are filled up." -msgstr "" -"Slutligen fylls ``källan`` och ``målet`` på med hjälp av de data som finns " -"lagrade i topparnas tabeller." +msgid "Finally using the data stored on the vertices tables the ``source`` and ``target`` are filled up." +msgstr "Slutligen fylls ``källan`` och ``målet`` på med hjälp av de data som finns lagrade i topparnas tabeller." msgid "Migration of ``pgr_createVerticesTable``" msgstr "Migrering av ``pgr_createVerticesTable``" -msgid "" -"**After Deprecation:** The user is responsible to create the vertices table, " -"indexes, etc. They may use :doc:`pgr_extractVertices` for that purpose." -msgstr "" -"**Efter deprecation:** Användaren är ansvarig för att skapa vertices-" -"tabellen, index, etc. De kan använda :doc:`pgr_extractVertices` för det " -"ändamålet." +msgid "**After Deprecation:** The user is responsible to create the vertices table, indexes, etc. They may use :doc:`pgr_extractVertices` for that purpose." +msgstr "**Efter deprecation:** Användaren är ansvarig för att skapa vertices-tabellen, index, etc. De kan använda :doc:`pgr_extractVertices` för det ändamålet." msgid "Migration of ``pgr_analyzeOneWay``" msgstr "Migrering av ``pgr_analyzeOneWay``" @@ -6674,20 +5319,11 @@ msgstr "Riktningsproblem beräknades baserat på koder." msgid "Dead ends." msgstr "Dödlägen." -msgid "" -"A routing problem can arise when from a vertex there is only a way on or a " -"way out but not both:" -msgstr "" -"Ett routingproblem kan uppstå när det från ett toppunkt bara finns en väg in " -"eller en väg ut, men inte båda:" +msgid "A routing problem can arise when from a vertex there is only a way on or a way out but not both:" +msgstr "Ett routingproblem kan uppstå när det från ett toppunkt bara finns en väg in eller en väg ut, men inte båda:" -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 "" -"Antingen genom att spara eller direkt använda :doc:`pgr_extractVertices` får " -"du information om återvändsgränder och avgör om den intilliggande kanten är " -"enkelriktad eller inte." +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 "Antingen genom att spara eller direkt använda :doc:`pgr_extractVertices` får du information om återvändsgränder och avgör om den intilliggande kanten är enkelriktad eller inte." msgid "In this example :doc:`pgr_extractVertices` has already been applied." msgstr "I detta exempel har :doc:`pgr_extractVertices` redan tillämpats." @@ -6695,14 +5331,8 @@ msgstr "I detta exempel har :doc:`pgr_extractVertices` redan tillämpats." msgid "Bridges." msgstr "Broar." -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 "" -"Ett annat routningsproblem kan uppstå när det finns en kant i en odelad graf " -"vars borttagning ökar antalet anslutna komponenter, och bron bara går åt ett " -"håll." +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 "Ett annat routningsproblem kan uppstå när det finns en kant i en odelad graf vars borttagning ökar antalet anslutna komponenter, och bron bara går åt ett håll." msgid "To determine if the bridges are or not one way." msgstr "För att avgöra om broarna är enkelriktade eller inte." @@ -6726,9 +5356,7 @@ msgid "Graph component" msgstr "Grafkomponent" msgid "A connected subgraph that is not part of any larger connected subgraph." -msgstr "" -"En sammanhängande delgraf som inte är en del av någon större sammanhängande " -"delgraf." +msgstr "En sammanhängande delgraf som inte är en del av någon större sammanhängande delgraf." msgid "Isolated segment" msgstr "Isolerat segment" @@ -6760,12 +5388,8 @@ msgstr "Migration." msgid "Components." msgstr "Komponenter." -msgid "" -"Instead of counting only isolated segments, determine all the components of " -"the graph." -msgstr "" -"Istället för att bara räkna isolerade segment kan du bestämma alla " -"komponenter i grafen." +msgid "Instead of counting only isolated segments, determine all the components of the graph." +msgstr "Istället för att bara räkna isolerade segment kan du bestämma alla komponenter i grafen." msgid "Depending of the final application requirements use:" msgstr "Beroende på de slutliga kraven för applikationen:" @@ -6782,43 +5406,23 @@ msgstr ":doc:`pgr_biconnectedComponents`" msgid "For example:" msgstr "Till exempel:" -msgid "" -"Instead of counting the dead ends, determine all the dead ends of the graph " -"using :doc:`pgr_degree`." -msgstr "" -"I stället för att räkna återvändsgränderna kan du bestämma alla " -"återvändsgränder i grafen med hjälp av :doc:`pgr_degree`." +msgid "Instead of counting the dead ends, determine all the dead ends of the graph using :doc:`pgr_degree`." +msgstr "I stället för att räkna återvändsgränderna kan du bestämma alla återvändsgränder i grafen med hjälp av :doc:`pgr_degree`." msgid "Potential gaps near dead ends." msgstr "Potentiella luckor nära återvändsgränder." -msgid "" -"Instead of counting potential gaps between geometries, determine the " -"geometric gaps in the graph using :doc:`pgr_findCloseEdges`." -msgstr "" -"Istället för att räkna potentiella mellanrum mellan geometrier, bestäm de " -"geometriska mellanrummen i grafen med hjälp av :doc:`pgr_findCloseEdges`." +msgid "Instead of counting potential gaps between geometries, determine the geometric gaps in the graph using :doc:`pgr_findCloseEdges`." +msgstr "Istället för att räkna potentiella mellanrum mellan geometrier, bestäm de geometriska mellanrummen i grafen med hjälp av :doc:`pgr_findCloseEdges`." msgid "Topological relationships." msgstr "Topologiska relationer." -msgid "" -"Instead of counting intersections, determine topological relationships " -"between geometries." -msgstr "" -"Istället för att räkna korsningar, bestäm topologiska relationer mellan " -"geometrier." +msgid "Instead of counting intersections, determine topological relationships between geometries." +msgstr "Istället för att räkna korsningar, bestäm topologiska relationer mellan geometrier." -msgid "" -"Several PostGIS functions can be used: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." -msgstr "" -"Flera PostGIS-funktioner kan användas: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." +msgid "Several PostGIS functions can be used: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." +msgstr "Flera PostGIS-funktioner kan användas: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." msgid "Migration of ``pgr_trsp`` (Vertices)" msgstr "Migrering av ``pgr_trsp`` (toppar)" @@ -6919,12 +5523,8 @@ msgstr "Ännu ej klassificerade migrationer" msgid "Migration of ``pgr_withPointsKSP``" msgstr "Migrering av ``pgr_withPointsKSP``" -msgid "" -"Starting from `v3.6.0 `__ :" -"doc:`pgr_withPointsKSP` result columns are being standardized." -msgstr "" -"Från och med `v3.6.0 `__ :" -"doc:`pgr_withPointsKSP` standardiseras resultatkolumnerna." +msgid "Starting from `v3.6.0 `__ :doc:`pgr_withPointsKSP` result columns are being standardized." +msgstr "Från och med `v3.6.0 `__ :doc:`pgr_withPointsKSP` standardiseras resultatkolumnerna." msgid "|ksp-result|" msgstr "|ksp-result|" @@ -6932,9 +5532,7 @@ msgstr "|ksp-result|" msgid "|generic-result|" msgstr "|generic-result|" -msgid "" -"And ``driving side`` parameter changed from named optional to unnamed " -"**driving side** and its validity differ for directed and undirected graphs." +msgid "And ``driving side`` parameter changed from named optional to unnamed **driving side** and its validity differ for directed and undirected graphs." msgstr "Och parametern ``driving side`` ändrades från namngiven valfri till icke namngiven **driving side** och dess giltighet skiljer sig åt för riktade och oriktade grafer." msgid "``pgr_withPointsKSP`` (`One to One`)" @@ -6958,12 +5556,8 @@ msgstr "Var medveten om att det finns ytterligare resultat Kolumner." msgid "New output columns are |generic-result|" msgstr "Nya utdatakolumner är |generic-result|" -msgid "" -"Using `this `__ example." -msgstr "" -"Använda `det här `__ exemplet." +msgid "Using `this `__ example." +msgstr "Använda `det här `__ exemplet." msgid "``start_vid`` contains the **start vid** parameter value." msgstr "``start_vid`` innehåller parametervärdet **start vid**." @@ -6971,12 +5565,8 @@ msgstr "``start_vid`` innehåller parametervärdet **start vid**." msgid "``end_vid`` contains the **end vid** parameter value." msgstr "``end_vid`` innehåller parametervärdet **end vid**." -msgid "" -"If needed filter out the additional columns, for example, to return the " -"original columns:" -msgstr "" -"Vid behov kan du filtrera bort de extra kolumnerna, t.ex. för att få " -"tillbaka de ursprungliga kolumnerna:" +msgid "If needed filter out the additional columns, for example, to return the original columns:" +msgstr "Vid behov kan du filtrera bort de extra kolumnerna, t.ex. för att få tillbaka de ursprungliga kolumnerna:" msgid "Use ``pgr_withPoints`` when there are no restrictions." msgstr "Använd ``pgr_withPoints`` när det inte finns några begränsningar." @@ -6993,17 +5583,11 @@ msgstr "Använd :doc:`pgr_trsp_withPoints` istället." msgid "Migration of ``pgr_maxCardinalityMatch``" msgstr "Migrering av ``pgr_maxCardinalityMatch``" -msgid "" -":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, therefore " -"the ``directed`` flag has been removed." -msgstr "" -":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, therefore " -"the ``directed`` flag has been removed." +msgid ":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, therefore the ``directed`` flag has been removed." +msgstr ":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, therefore the ``directed`` flag has been removed." -msgid "" -"Starting from `v3.4.0 `__" -msgstr "" -"Startar från `v3.4.0 `__" +msgid "Starting from `v3.4.0 `__" +msgstr "Startar från `v3.4.0 `__" msgid "Signature to be migrated:" msgstr "Signatur som ska migreras:" @@ -7032,35 +5616,20 @@ msgstr "Den valfria flaggan ``directed`` tas bort." msgid "Before migration" msgstr "Före migration" -msgid "" -"Columns used are ``going`` and ``coming`` to represent the existence of an " -"edge." -msgstr "" -"Kolumner som används är \"utgående\" och \"kommande\" för att representera " -"existensen av en kant." +msgid "Columns used are ``going`` and ``coming`` to represent the existence of an edge." +msgstr "Kolumner som används är \"utgående\" och \"kommande\" för att representera existensen av en kant." -msgid "" -"Flag ``directed`` was used to indicate if it was for a **directed** or " -"**undirected** graph." -msgstr "" -"Flaggan ``directed`` användes för att ange om det var för en **directed** " -"eller **undirected** graf." +msgid "Flag ``directed`` was used to indicate if it was for a **directed** or **undirected** graph." +msgstr "Flaggan ``directed`` användes för att ange om det var för en **directed** eller **undirected** graf." msgid "The flag ``directed`` is ignored." msgstr "Flaggan ``directed`` ignoreras." -msgid "" -"Regardless of it's value it gives the result considering the graph as " -"**undirected**." -msgstr "" -"Oavsett dess värde ger det resultatet med tanke på grafen som **undirected**." +msgid "Regardless of it's value it gives the result considering the graph as **undirected**." +msgstr "Oavsett dess värde ger det resultatet med tanke på grafen som **undirected**." -msgid "" -"Use the columns ``cost`` and ``reverse_cost`` to represent the existence of " -"an edge." -msgstr "" -"Använd kolumnerna ``cost`` och ``reverse_cost`` för att representera " -"existensen av en kant." +msgid "Use the columns ``cost`` and ``reverse_cost`` to represent the existence of an edge." +msgstr "Använd kolumnerna ``cost`` och ``reverse_cost`` för att representera existensen av en kant." msgid "Do not use the flag ``directed``." msgstr "Använd inte flaggan ``directed``." @@ -7119,12 +5688,8 @@ msgstr "Gamla restriktioner fylls på" msgid "Old restrictions contents" msgstr "Gamla restriktioner innehåll" -msgid "" -"The restriction with ``rid = 2`` is representing :math:`3 \\rightarrow 5 " -"\\rightarrow9`" -msgstr "" -"Begränsningen med ``rid = 2`` representerar :math:`3 \\rightarrow 5 " -"\\rightarrow9``" +msgid "The restriction with ``rid = 2`` is representing :math:`3 \\rightarrow 5 \\rightarrow9`" +msgstr "Begränsningen med ``rid = 2`` representerar :math:`3 \\rightarrow 5 \\rightarrow9``" msgid ":math:`3\\rightarrow5`" msgstr ":math:`3\\rightarrow5`" @@ -7177,21 +5742,14 @@ msgstr "Lägga till begränsningar" msgid "Restrictions data" msgstr "Begränsningar data" -msgid "" -"The restriction with ``rid = 2`` represents the path :math:`3 \\rightarrow5 " -"\\rightarrow9`." -msgstr "" -"Restriktionen med ``rid = 2`` representerar sökvägen :math:`3 \\rightarrow5 " -"\\rightarrow9``." +msgid "The restriction with ``rid = 2`` represents the path :math:`3 \\rightarrow5 \\rightarrow9`." +msgstr "Restriktionen med ``rid = 2`` representerar sökvägen :math:`3 \\rightarrow5 \\rightarrow9``." msgid "By inspection the path is clear." msgstr "Vid inspektion är vägen tydlig." -msgid "" -"To transform the old restrictions table to the new restrictions structure," -msgstr "" -"Att omvandla den gamla begränsningstabellen till den nya " -"begränsningsstrukturen," +msgid "To transform the old restrictions table to the new restrictions structure," +msgstr "Att omvandla den gamla begränsningstabellen till den nya begränsningsstrukturen," msgid "Create a new table with the new restrictions structure." msgstr "Skapa en ny tabell med den nya begränsningsstrukturen." @@ -7199,12 +5757,8 @@ msgstr "Skapa en ny tabell med den nya begränsningsstrukturen." msgid "In this migration guide ``new_restrictions`` is been used." msgstr "I den här migreringsguiden används ``new_restrictions``." -msgid "" -"For this migration pgRouting supplies an auxiliary function for reversal of " -"an array ``_pgr_array_reverse`` needed for the migration." -msgstr "" -"För denna migrering tillhandahåller pgRouting en hjälpfunktion för " -"reversering av en array ``_pgr_array_reverse`` som behövs för migreringen." +msgid "For this migration pgRouting supplies an auxiliary function for reversal of an array ``_pgr_array_reverse`` needed for the migration." +msgstr "För denna migrering tillhandahåller pgRouting en hjälpfunktion för reversering av en array ``_pgr_array_reverse`` som behövs för migreringen." msgid "``_pgr_array_reverse``:" msgstr "``_pgr_array_reverse``:" @@ -7230,12 +5784,8 @@ msgstr "Beställning - Familj av funktioner" msgid "pgRouting Concepts" msgstr "pgRouting-koncept" -msgid "" -"This is a simple guide that go through some of the steps for getting started " -"with pgRouting. This guide covers:" -msgstr "" -"Det här är en enkel guide som går igenom några av stegen för att komma igång " -"med pgRouting. Den här guiden täcker:" +msgid "This is a simple guide that go through some of the steps for getting started with pgRouting. This guide covers:" +msgstr "Det här är en enkel guide som går igenom några av stegen för att komma igång med pgRouting. Den här guiden täcker:" msgid "Graphs" msgstr "Diagram" @@ -7267,10 +5817,8 @@ msgstr ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V) \\}`" msgid "Directed simple graph" msgstr "Riktad enkel graf" -msgid "" -":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" -msgstr "" -":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" +msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" +msgstr ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" msgid "Graphs:" msgstr "Diagram:" @@ -7278,15 +5826,10 @@ msgstr "Diagram:" msgid "Do not have geometries." msgstr "Har inte geometrier." -msgid "" -"Some graph theory problems require graphs to have weights, called **cost** " -"in pgRouting." -msgstr "" -"Vissa grafteoretiska problem kräver att graferna har vikter, som kallas " -"**kostnad** i pgRouting." +msgid "Some graph theory problems require graphs to have weights, called **cost** in pgRouting." +msgstr "Vissa grafteoretiska problem kräver att graferna har vikter, som kallas **kostnad** i pgRouting." -msgid "" -"In pgRouting there are several ways to represent a graph on the database:" +msgid "In pgRouting there are several ways to represent a graph on the database:" msgstr "I pgRouting finns det flera sätt att representera en graf i databasen:" msgid "With ``cost``" @@ -7301,12 +5844,8 @@ msgstr "Med ``kostnad`` och ``omvänd_kostnad``" msgid "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)" msgstr "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)" -msgid "" -"Identifier of the edge. Requirement to use the database in a consistent. " -"manner." -msgstr "" -"Identifierare av kanten. Krav på att använda databasen på ett konsekvent " -"sätt." +msgid "Identifier of the edge. Requirement to use the database in a consistent. manner." +msgstr "Identifierare av kanten. Krav på att använda databasen på ett konsekvent sätt." msgid "Identifier of a vertex." msgstr "Identifierare för en vertex." @@ -7314,23 +5853,17 @@ msgstr "Identifierare för en vertex." msgid "Weight of the edge (``source``, ``target``):" msgstr "Kantvikt (``källa``, ``mål``):" -msgid "" -"When negative the edge (``source``, ``target``) do not exist on the graph." +msgid "When negative the edge (``source``, ``target``) do not exist on the graph." msgstr "När den är negativ finns inte kanten (``källa``, ``mål``) i grafen." msgid "``cost`` must exist in the query." msgstr "``cost`` måste finnas i frågan." -msgid "" -"When negative the edge (``target``, ``source``) do not exist on the graph." +msgid "When negative the edge (``target``, ``source``) do not exist on the graph." msgstr "När den är negativ finns inte kanten (``mål``, ``källa``) i grafen." -msgid "" -"The decision of the graph to be **directed** or **undirected** is done when " -"executing a pgRouting algorithm." -msgstr "" -"Beslutet om grafen ska vara **directed** eller **undirected** fattas när en " -"pgRouting-algoritm körs." +msgid "The decision of the graph to be **directed** or **undirected** is done when executing a pgRouting algorithm." +msgstr "Beslutet om grafen ska vara **directed** eller **undirected** fattas när en pgRouting-algoritm körs." msgid "Graph with ``cost``" msgstr "Graf med ``kostnad``" @@ -7344,12 +5877,8 @@ msgstr "Grafdata erhålls med en fråga" msgid "``SELECT id, source, target, cost FROM edges``" msgstr "``Välj id, källa, mål, kostnad från kanter``" -msgid "" -":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} " -"\\ge 0 \\}`" -msgstr "" -":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} " -"\\ge 0 \\}`" +msgid ":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} \\ge 0 \\}`" +msgstr ":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} \\ge 0 \\}`" msgid "Edges where ``cost`` is non negative are part of the graph." msgstr "Kanter där ``kostnad`` inte är negativ är en del av grafen." @@ -7360,12 +5889,8 @@ msgstr ":math:`V = \\{source_{id} \\cup target_{id}\\}`" msgid "All vertices in ``source`` and ``target`` are part of the graph." msgstr "Alla hörn i ``källa`` och ``mål`` är en del av grafen." -msgid "" -"In a directed graph the edge :math:`(source_{id}, target_{id}, cost_{id})` " -"has directionality: :math:`source_{id} \\rightarrow target_{id}`" -msgstr "" -"I en riktad graf har kanten :math:`(source_{id}, target_{id}, cost_{id})` " -"riktning: :math:`source_{id} \\rightarrow target_{id}`" +msgid "In a directed graph the edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`" +msgstr "I en riktad graf har kanten :math:`(source_{id}, target_{id}, cost_{id})` riktning: :math:`source_{id} \\rightarrow target_{id}`" msgid "For the following data:" msgstr "För följande uppgifter:" @@ -7376,27 +5901,14 @@ msgstr "Edge :math:`2` (:math:`1 \\rightarrow 3`) är inte en del av grafen." msgid "The data is representing the following graph:" msgstr "Uppgifterna representeras av följande graf:" -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 "" -"I en ostyrd graf har kanten :math:`(källa_{id}, mål_{id}, kostnad_{id})` " -"inte riktning: :math:`källa_{id} \\frac{\\;\\;\\;\\;\\;}{} mål_{id}`" +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 "I en ostyrd graf har kanten :math:`(källa_{id}, mål_{id}, kostnad_{id})` inte riktning: :math:`källa_{id} \\frac{\\;\\;\\;\\;\\;}{} mål_{id}`" -msgid "" -"In terms of a directed graph is like having two edges: :math:`source_{id} " -"\\leftrightarrow target_{id}`" -msgstr "" -"I termer av en riktad graf är det som att ha två kanter: :math:`source_{id} " -"\\leftrightarrow target_{id}`" +msgid "In terms of a directed graph is like having two edges: :math:`source_{id} \\leftrightarrow target_{id}`" +msgstr "I termer av en riktad graf är det som att ha två kanter: :math:`source_{id} \\leftrightarrow target_{id}`" -msgid "" -"Edge :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) is not part of the " -"graph." -msgstr "" -"Kanten :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) är inte en del av " -"grafen." +msgid "Edge :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) is not part of the graph." +msgstr "Kanten :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) är inte en del av grafen." msgid "Graph with ``cost`` and ``reverse_cost``" msgstr "Graf med ``kostnad`` och ``omvända_kostnader``" @@ -7407,30 +5919,14 @@ msgstr "``SELECT id, källa, mål, kostnad, omvänd_kostnad FROM kanter``" msgid "The set of edges :math:`E`:" msgstr "Mängden kanter :math:`E`:" -msgid "" -":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, " -"cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & " -"{\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } " -"reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" -msgstr "" -":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, " -"cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & " -"{\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } " -"reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" +msgid ":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & {\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" +msgstr ":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & {\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" -msgid "" -"Edges :math:`(source \\rightarrow target)` where ``cost`` is non negative " -"are part of the graph." -msgstr "" -"Edges :math:`(source \\rightarrow target)` där ``cost`` är icke-negativ är " -"en del av grafen." +msgid "Edges :math:`(source \\rightarrow target)` where ``cost`` is non negative are part of the graph." +msgstr "Edges :math:`(source \\rightarrow target)` där ``cost`` är icke-negativ är en del av grafen." -msgid "" -"Edges :math:`(target \\rightarrow source)` where ``reverse_cost`` is non " -"negative are part of the graph." -msgstr "" -"Edges :math:`(target \\rightarrow source)` där ``reverse_cost`` är icke-" -"negativ är en del av grafen." +msgid "Edges :math:`(target \\rightarrow source)` where ``reverse_cost`` is non negative are part of the graph." +msgstr "Edges :math:`(target \\rightarrow source)` där ``reverse_cost`` är icke-negativ är en del av grafen." msgid "The set of vertices :math:`V`:" msgstr "Mängden hörn :math:`V`:" @@ -7438,19 +5934,11 @@ msgstr "Mängden hörn :math:`V`:" msgid "In a directed graph both edges have directionality" msgstr "I en riktad graf har båda kanterna riktning" -msgid "" -"edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:" -"`source_{id} \\rightarrow target_{id}`" -msgstr "" -"kanten :math:`(källa_{id}, mål_{id}, kostnad_{id})` har riktning: :math:" -"`källa_{id} \\rightarrow mål_{id}`" +msgid "edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`" +msgstr "kanten :math:`(källa_{id}, mål_{id}, kostnad_{id})` har riktning: :math:`källa_{id} \\rightarrow mål_{id}`" -msgid "" -"edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` has " -"directionality: :math:`target_{id} \\rightarrow source_{id}`" -msgstr "" -"kanten :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` har " -"riktning: :math:`target_{id} \\rightarrow source_{id}`" +msgid "edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` has directionality: :math:`target_{id} \\rightarrow source_{id}`" +msgstr "kanten :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` har riktning: :math:`target_{id} \\rightarrow source_{id}`" msgid "Edges not part of the graph:" msgstr "Kanter som inte är en del av grafen:" @@ -7464,19 +5952,11 @@ msgstr ":math:`3` (:math:`3 \\rightarrow 2`)" msgid "In a directed graph both edges do not have directionality" msgstr "I en riktad graf har inte båda kanterna riktning" -msgid "" -"Edge :math:`(source_{id}, target_{id}, cost_{id})` is :math:`source_{id} " -"\\frac{\\;\\;\\;\\;\\;}{} target_{id}`" -msgstr "" -"Kant :math:`(källa_{id}, mål_{id}, kostnad_{id})` är :math:`källa_{id} " -"\\frac{\\;\\;\\;\\;\\;}{} mål_{id}`" +msgid "Edge :math:`(source_{id}, target_{id}, cost_{id})` is :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" +msgstr "Kant :math:`(källa_{id}, mål_{id}, kostnad_{id})` är :math:`källa_{id} \\frac{\\;\\;\\;\\;\\;}{} mål_{id}`" -msgid "" -"Edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` is :math:" -"`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" -msgstr "" -"Kant :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` är :math:" -"`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" +msgid "Edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` is :math:`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" +msgstr "Kant :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` är :math:`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" msgid "In terms of a directed graph is like having four edges:" msgstr "I termer av en riktad graf är det som att ha fyra kanter:" @@ -7496,37 +5976,23 @@ msgstr ":math:`3` (:math:`3 \\frac{\\;\\;\\;\\;\\;}{} 2`)" msgid "Graphs without geometries" msgstr "Grafer utan geometrier" -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 "" -"Problem med personliga relationer, släktforskning och filberoende kan lösas " -"med hjälp av pgRouting. Dessa problem har normalt inte geometrier som är " -"kopplade till grafen." +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 "Problem med personliga relationer, släktforskning och filberoende kan lösas med hjälp av pgRouting. Dessa problem har normalt inte geometrier som är kopplade till grafen." msgid "Wiki example" msgstr "Wiki-exempel" -msgid "" -"Solve the example problem taken from `wikipedia `__):" -msgstr "" -"Lös exempelproblemet hämtat från `wikipedia `__):" +msgid "Solve the example problem taken from `wikipedia `__):" +msgstr "Lös exempelproblemet hämtat från `wikipedia `__):" msgid "Problem is to find the shortest path from :math:`1` to :math:`5`." -msgstr "" -"Problemet är att hitta den kortaste vägen från :math:`1` till :math:`5`." +msgstr "Problemet är att hitta den kortaste vägen från :math:`1` till :math:`5`." msgid "Is an undirected graph." msgstr "Är en odelad graf." -msgid "" -"Although visually looks like to have geometries, the drawing is not to scale." -msgstr "" -"Även om det visuellt ser ut att finnas geometrier är ritningen inte " -"skalenlig." +msgid "Although visually looks like to have geometries, the drawing is not to scale." +msgstr "Även om det visuellt ser ut att finnas geometrier är ritningen inte skalenlig." msgid "No geometries associated to the vertices or edges" msgstr "Inga geometrier associerade till hörn eller kanter" @@ -7537,14 +6003,8 @@ msgstr "Har 6 hörn :math:`\\{1,2,3,4,5,6\\}`" msgid "Has 9 edges:" msgstr "Har 9 kanter:" -msgid "" -":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\" -"\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & " -"(5,6,9) \\} \\end{align} \\end{split}`" -msgstr "" -":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\" -"\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & " -"(5,6,9) \\} \\end{align} \\end{split}`" +msgid ":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & (5,6,9) \\} \\end{align} \\end{split}`" +msgstr ":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & (5,6,9) \\} \\end{align} \\end{split}`" msgid "The graph can be represented in many ways for example:" msgstr "Grafen kan representeras på många olika sätt, t.ex:" @@ -7552,21 +6012,14 @@ msgstr "Grafen kan representeras på många olika sätt, t.ex:" msgid "Prepare the database" msgstr "Förbereda databasen" -msgid "" -"Create a database for the example, access the database and install " -"pgRouting: ::" -msgstr "" -"Skapa en databas för exemplet, gå in i databasen och installera pgRouting: ::" +msgid "Create a database for the example, access the database and install pgRouting: ::" +msgstr "Skapa en databas för exemplet, gå in i databasen och installera pgRouting: ::" msgid "Create a table" msgstr "Skapa en tabell" -msgid "" -"The basic elements needed to perform basic routing on an undirected graph " -"are:" -msgstr "" -"De grundläggande element som behövs för att utföra grundläggande routing på " -"en odelad graf är:" +msgid "The basic elements needed to perform basic routing on an undirected graph are:" +msgstr "De grundläggande element som behövs för att utföra grundläggande routing på en odelad graf är:" msgid "SMALLINT, INTEGER, BIGINT, REAL, FLOAT" msgstr "SMALLINT, INTEGER, BIGINT, REAL, FLOAT" @@ -7583,12 +6036,8 @@ msgstr "Hitta den kortaste vägen" msgid "To solve this example :doc:`pgr_dijkstra` is used:" msgstr "För att lösa detta exempel används :doc:`pgr_dijkstra`:" -msgid "" -"To go from :math:`1` to :math:`5` the path goes thru the following " -"vertices: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" -msgstr "" -"För att gå från :math:`1` till :math:`5` går vägen genom följande hörn: :" -"math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" +msgid "To go from :math:`1` to :math:`5` the path goes thru the following vertices: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" +msgstr "För att gå från :math:`1` till :math:`5` går vägen genom följande hörn: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" msgid "Vertex information" msgstr "Information om toppunkt" @@ -7602,20 +6051,14 @@ msgstr "Grafer med geometrier" msgid "Create a routing Database" msgstr "Skapa en routningsdatabas" -msgid "" -"The first step is to create a database and load pgRouting in the database." -msgstr "" -"Det första steget är att skapa en databas och ladda pgRouting i databasen." +msgid "The first step is to create a database and load pgRouting in the database." +msgstr "Det första steget är att skapa en databas och ladda pgRouting i databasen." msgid "Typically create a database for each project." msgstr "Vanligtvis skapas en databas för varje projekt." -msgid "" -"Once having the database to work in, load your data and build the routing " -"application in that database." -msgstr "" -"När du väl har en databas att arbeta i laddar du dina data och bygger " -"routingapplikationen i den databasen." +msgid "Once having the database to work in, load your data and build the routing application in that database." +msgstr "När du väl har en databas att arbeta i laddar du dina data och bygger routingapplikationen i den databasen." msgid "Load Data" msgstr "Ladda data" @@ -7632,12 +6075,8 @@ msgstr "`Grafer utan geometrier`_" msgid ":doc:`sampledata`: a small graph used in the documentation examples" msgstr ":doc:`sampledata`: a small graph used in the documentation examples" -msgid "" -"Using `osm2pgrouting `__" -msgstr "" -"Använda `osm2pgrouting `__" +msgid "Using `osm2pgrouting `__" +msgstr "Använda `osm2pgrouting `__" msgid "There are various open source tools that can help, like:" msgstr "Det finns olika verktyg med öppen källkod som kan hjälpa till, t.ex:" @@ -7660,24 +6099,14 @@ msgstr "osm2pgsql" msgid "load OSM data into postgresql" msgstr "ladda OSM-data till postgresql" -msgid "" -"Please note that these tools will **not** import the data in a structure " -"compatible with pgRouting and when this happens the topology needs to be " -"adjusted." -msgstr "" -"Observera att dessa verktyg **inte** kommer att importera data i en struktur " -"som är kompatibel med pgRouting och när detta händer måste topologin " -"justeras." +msgid "Please note that these tools will **not** import the data in a structure compatible with pgRouting and when this happens the topology needs to be adjusted." +msgstr "Observera att dessa verktyg **inte** kommer att importera data i en struktur som är kompatibel med pgRouting och när detta händer måste topologin justeras." msgid "Breakup a segments on each segment-segment intersection" msgstr "Dela upp ett segment på varje segment-segment intersektion" -msgid "" -"When missing, add columns and assign values to ``source``, ``target``, " -"``cost``, ``reverse_cost``." -msgstr "" -"Om de saknas, lägg till kolumner och tilldela värden för ``källa``, ``mål``, " -"``kostnad``, ``omvänd kostnad``." +msgid "When missing, add columns and assign values to ``source``, ``target``, ``cost``, ``reverse_cost``." +msgstr "Om de saknas, lägg till kolumner och tilldela värden för ``källa``, ``mål``, ``kostnad``, ``omvänd kostnad``." msgid "Connect a disconnected graph." msgstr "Anslut en frånkopplad graf." @@ -7686,8 +6115,7 @@ msgid "Create the complete graph topology" msgstr "Skapa den fullständiga grafens topologi" msgid "Create one or more graphs based on the application to be developed." -msgstr "" -"Skapa en eller flera grafer baserat på den applikation som ska utvecklas." +msgstr "Skapa en eller flera grafer baserat på den applikation som ska utvecklas." msgid "Create a contracted graph for the high speed roads" msgstr "Skapa ett sammandraget diagram för höghastighetsvägarna" @@ -7701,32 +6129,14 @@ msgstr "Med några få ord:" msgid "Prepare the graph" msgstr "Förbered grafen" -msgid "" -"What and how to prepare the graph, will depend on the application and/or on " -"the quality of the data and/or on how close the information is to have a " -"topology usable by pgRouting and/or some other factors not mentioned." -msgstr "" -"Vad och hur du ska förbereda grafen beror på applikationen och/eller på " -"datakvaliteten och/eller på hur nära informationen är en topologi som kan " -"användas av pgRouting och/eller på andra faktorer som inte nämns." +msgid "What and how to prepare the graph, will depend on the application and/or on the quality of the data and/or on how close the information is to have a topology usable by pgRouting and/or some other factors not mentioned." +msgstr "Vad och hur du ska förbereda grafen beror på applikationen och/eller på datakvaliteten och/eller på hur nära informationen är en topologi som kan användas av pgRouting och/eller på andra faktorer som inte nämns." -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." -msgstr "" -"Stegen för att förbereda grafen involverar geometriska operationer med hjälp " -"av `PostGIS `__ och vissa andra involverar " -"grafoperationer som :doc:`pgr_contraction` för att dra ihop en graf." +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." +msgstr "Stegen för att förbereda grafen involverar geometriska operationer med hjälp av `PostGIS `__ och vissa andra involverar grafoperationer som :doc:`pgr_contraction` för att dra ihop en graf." -msgid "" -"The `workshop `__ has a step by step " -"on how to prepare a graph using Open Street Map data, for a small " -"application." -msgstr "" -"I workshopen `__ finns en steg-för-" -"stegbeskrivning av hur man skapar en graf med hjälp av Open Street Map-data " -"för en liten applikation." +msgid "The `workshop `__ has a step by step on how to prepare a graph using Open Street Map data, for a small application." +msgstr "I workshopen `__ finns en steg-för-stegbeskrivning av hur man skapar en graf med hjälp av Open Street Map-data för en liten applikation." msgid "The use of indexes on the database design in general:" msgstr "Användningen av index på databasdesignen i allmänhet:" @@ -7737,43 +6147,23 @@ msgstr "Låt geometrierna vara indexerade." msgid "Have the identifiers columns indexed." msgstr "Låt kolumnerna med identifierare indexeras." -msgid "" -"Please consult the `PostgreSQL `__ " -"documentation and the `PostGIS `__ documentation." -msgstr "" -"Vänligen se dokumentationen för `PostgreSQL `__ och dokumentationen för `PostGIS `__." +msgid "Please consult the `PostgreSQL `__ documentation and the `PostGIS `__ documentation." +msgstr "Vänligen se dokumentationen för `PostgreSQL `__ och dokumentationen för `PostGIS `__." -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 "" -"Data som kommer från OSM och använder `osm2pgrouting `__ som ett importverktyg, kommer med " -"routingtopologin. Se ett exempel på användning av ``osm2pgrouting`` på " -"`workshop `__." +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 "Data som kommer från OSM och använder `osm2pgrouting `__ som ett importverktyg, kommer med routingtopologin. Se ett exempel på användning av ``osm2pgrouting`` på `workshop `__." msgid "Adjust costs" msgstr "Justera kostnader" -msgid "" -"For this example the ``cost`` and ``reverse_cost`` values are going to be " -"the double of the length of the geometry." -msgstr "" -"I det här exemplet kommer värdena ``cost`` och ``reverse_cost`` att vara det " -"dubbla av geometrins längd." +msgid "For this example the ``cost`` and ``reverse_cost`` values are going to be the double of the length of the geometry." +msgstr "I det här exemplet kommer värdena ``cost`` och ``reverse_cost`` att vara det dubbla av geometrins längd." msgid "Update costs to length of geometry" msgstr "Uppdatera kostnaderna till geometrins längd" -msgid "" -"Suppose that ``cost`` and ``reverse_cost`` columns in the sample data " -"represent:" -msgstr "" -"Antag att kolumnerna ``kostnad`` och ``omvända_kostnader`` i urvalsdata " -"representerar:" +msgid "Suppose that ``cost`` and ``reverse_cost`` columns in the sample data represent:" +msgstr "Antag att kolumnerna ``kostnad`` och ``omvända_kostnader`` i urvalsdata representerar:" msgid ":math:`1` when the edge exists in the graph" msgstr ":math:`1` when the edge exists in the graph" @@ -7787,12 +6177,8 @@ msgstr "Med hjälp av den informationen uppdateras geometriernas längd:" msgid "Which gives the following results:" msgstr "Vilket ger följande resultat:" -msgid "" -"Note that to be able to follow the documentation examples, everything is " -"based on the original graph." -msgstr "" -"Observera att för att kunna följa dokumentationsexemplen är allt baserat på " -"den ursprungliga grafen." +msgid "Note that to be able to follow the documentation examples, everything is based on the original graph." +msgstr "Observera att för att kunna följa dokumentationsexemplen är allt baserat på den ursprungliga grafen." msgid "Returning to the original data:" msgstr "Återgå till de ursprungliga uppgifterna:" @@ -7842,12 +6228,8 @@ msgstr "Grafen är för stor och behöver krympas." msgid "A sub graph is needed for the application." msgstr "En subgraf behövs för applikationen." -msgid "" -"and many other problems that the pgRouting user, that is the application " -"developer might encounter." -msgstr "" -"och många andra problem som pgRouting-användaren, det vill säga " -"applikationsutvecklaren, kan stöta på." +msgid "and many other problems that the pgRouting user, that is the application developer might encounter." +msgstr "och många andra problem som pgRouting-användaren, det vill säga applikationsutvecklaren, kan stöta på." msgid "Crossing edges" msgstr "Korsande kanter" @@ -7855,26 +6237,17 @@ msgstr "Korsande kanter" msgid "To get the crossing edges:" msgstr "För att få de korsande kanterna:" -msgid "" -"That information is correct, for example, when in terms of vehicles, is it a " -"tunnel or bridge crossing over another road." -msgstr "" -"Den informationen är korrekt, till exempel när det gäller fordon, är det en " -"tunnel eller bro som korsar en annan väg." +msgid "That information is correct, for example, when in terms of vehicles, is it a tunnel or bridge crossing over another road." +msgstr "Den informationen är korrekt, till exempel när det gäller fordon, är det en tunnel eller bro som korsar en annan väg." msgid "It might be incorrect, for example:" msgstr "Det kan till exempel vara felaktigt:" -msgid "" -"When it is actually an intersection of roads, where vehicles can make turns." +msgid "When it is actually an intersection of roads, where vehicles can make turns." msgstr "När det faktiskt är en korsning av vägar, där fordon kan svänga." -msgid "" -"When in terms of electrical lines, the electrical line is able to switch " -"roads even on a tunnel or bridge." -msgstr "" -"När det gäller elektriska ledningar kan den elektriska ledningen byta väg " -"även i en tunnel eller på en bro." +msgid "When in terms of electrical lines, the electrical line is able to switch roads even on a tunnel or bridge." +msgstr "När det gäller elektriska ledningar kan den elektriska ledningen byta väg även i en tunnel eller på en bro." msgid "When it is incorrect, it needs fixing:" msgstr "När den är felaktig behöver den åtgärdas:" @@ -7882,62 +6255,32 @@ msgstr "När den är felaktig behöver den åtgärdas:" msgid "For vehicles and pedestrians" msgstr "För fordon och fotgängare" -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 "" -"Om data kommer från OSM och importerades till databasen med hjälp av " -"``osm2pgrouting``, måste korrigeringen göras i `OSM-portalen `__ och data importeras igen." +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 "Om data kommer från OSM och importerades till databasen med hjälp av ``osm2pgrouting``, måste korrigeringen göras i `OSM-portalen `__ och data importeras igen." -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 "" -"I allmänhet när data kommer från en leverantör som har förberett data för " -"routing av fordon och det finns ett problem, ska data åtgärdas från " -"leverantören" +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 "I allmänhet när data kommer från en leverantör som har förberett data för routing av fordon och det finns ett problem, ska data åtgärdas från leverantören" msgid "For very specific applications" msgstr "För mycket specifika tillämpningar" -msgid "" -"The data is correct when from the point of view of routing vehicles or " -"pedestrians." -msgstr "" -"Uppgifterna är korrekta om de ses ur de dirigerande fordonens eller " -"fotgängarnas synvinkel." +msgid "The data is correct when from the point of view of routing vehicles or pedestrians." +msgstr "Uppgifterna är korrekta om de ses ur de dirigerande fordonens eller fotgängarnas synvinkel." msgid "The data needs a local fix for the specific application." msgstr "Uppgifterna behöver en lokal fix för den specifika applikationen." -msgid "" -"Once analyzed one by one the crossings, for the ones that need a local fix, " -"the edges need to be `split `__." -msgstr "" -"När korsningarna har analyserats en efter en, för de som behöver en lokal " -"fix, måste kanterna `delas `__." +msgid "Once analyzed one by one the crossings, for the ones that need a local fix, the edges need to be `split `__." +msgstr "När korsningarna har analyserats en efter en, för de som behöver en lokal fix, måste kanterna `delas `__." -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 "" -"De nya kanterna måste läggas till i kanttabellen, resten av attributen måste " -"uppdateras i de nya kanterna, de gamla kanterna måste tas bort och " -"routingtopologin måste uppdateras." +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 "De nya kanterna måste läggas till i kanttabellen, resten av attributen måste uppdateras i de nya kanterna, de gamla kanterna måste tas bort och routingtopologin måste uppdateras." msgid "Fixing an intersection" msgstr "Fixa en korsning" -msgid "" -"In this example the original edge table will be used to store the additional " -"geometries." -msgstr "" -"I detta exempel kommer den ursprungliga kanttabellen att användas för att " -"lagra de extra geometrierna." +msgid "In this example the original edge table will be used to store the additional geometries." +msgstr "I detta exempel kommer den ursprungliga kanttabellen att användas för att lagra de extra geometrierna." msgid "An example use without results" msgstr "Ett exempel på användning utan resultat" @@ -7960,24 +6303,14 @@ msgstr "Ytterligare kolumner för att styra segmentens ursprung." msgid "Adding new segments." msgstr "Lägga till nya segment." -msgid "" -"Calling :doc:`pgr_separateCrossing` and adding the new segments to the edges " -"table." -msgstr "" -"Anropar :doc:`pgr_separateCrossing` och lägger till de nya segmenten i " -"tabellen över kanter." +msgid "Calling :doc:`pgr_separateCrossing` and adding the new segments to the edges table." +msgstr "Anropar :doc:`pgr_separateCrossing` och lägger till de nya segmenten i tabellen över kanter." msgid "Update other values" msgstr "Uppdatera andra värden" -msgid "" -"In this example only ``cost`` and ``reverse_cost`` are updated, where they " -"are based on the length of the geometry and the directionality is kept using " -"the ``sign`` function." -msgstr "" -"I det här exemplet uppdateras endast ``cost`` och ``reverse_cost``, där de " -"baseras på geometrins längd och riktningen bibehålls med hjälp av funktionen " -"``sign``." +msgid "In this example only ``cost`` and ``reverse_cost`` are updated, where they are based on the length of the geometry and the directionality is kept using the ``sign`` function." +msgstr "I det här exemplet uppdateras endast ``cost`` och ``reverse_cost``, där de baseras på geometrins längd och riktningen bibehålls med hjälp av funktionen ``sign``." msgid "Update the topology" msgstr "Uppdatera topologin" @@ -7998,8 +6331,7 @@ msgid "Touching edges" msgstr "Beröring av kanter" msgid "Visually the edges seem to be connected, but internally they are not." -msgstr "" -"Visuellt verkar kanterna vara sammankopplade, men internt är de inte det." +msgstr "Visuellt verkar kanterna vara sammankopplade, men internt är de inte det." msgid "The validity of the information is application dependent." msgstr "Informationens giltighet är applikationsberoende." @@ -8007,12 +6339,8 @@ msgstr "Informationens giltighet är applikationsberoende." msgid "Maybe there is a small barrier for vehicles but not for pedestrians." msgstr "Kanske finns det en liten barriär för fordon men inte för fotgängare." -msgid "" -"Once analyzed one by one the touchings, for the ones that need a local fix, " -"the edges need to be `split `__." -msgstr "" -"När beröringarna har analyserats en efter en, för de som behöver en lokal " -"fix, måste kanterna `delas `__." +msgid "Once analyzed one by one the touchings, for the ones that need a local fix, the edges need to be `split `__." +msgstr "När beröringarna har analyserats en efter en, för de som behöver en lokal fix, måste kanterna `delas `__." msgid "Fixing a gap" msgstr "Åtgärda en lucka" @@ -8026,12 +6354,8 @@ msgstr "Analysera nätverket för att hitta luckor." msgid "The analysis tell us that the network has a gap." msgstr "Analysen visar att det finns en lucka i nätverket." -msgid "" -"Calling :doc:`pgr_separateTouching` and adding the new segments to the edges " -"table." -msgstr "" -"Anropar :doc:`pgr_separateTouching` och lägger till de nya segmenten i " -"tabellen över kanter." +msgid "Calling :doc:`pgr_separateTouching` and adding the new segments to the edges table." +msgstr "Anropar :doc:`pgr_separateTouching` och lägger till de nya segmenten i tabellen över kanter." msgid "Routing from :math:`1` to :math:`2` gives a solution." msgstr "En routning från :math:`1` till :math:`2` ger en lösning." @@ -8057,32 +6381,20 @@ msgstr "Från toppunkten till den närmaste toppunkten på kanten" msgid "This solution requires the edge to be split." msgstr "Denna lösning kräver att kanten delas." -msgid "" -"In this example :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` " -"will be used." -msgstr "" -"I detta exempel kommer :doc:`pgr_separateCrossing` och :doc:" -"`pgr_separateTouching` att användas." +msgid "In this example :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` will be used." +msgstr "I detta exempel kommer :doc:`pgr_separateCrossing` och :doc:`pgr_separateTouching` att användas." msgid "Get the connectivity" msgstr "Få anslutningsmöjligheterna" -msgid "" -"In this example: the edges table will need an additional column and the " -"vertex table will be rebuilt completely." -msgstr "" -"I det här exemplet behöver tabellen edges en extra kolumn och tabellen " -"vertex byggs om helt och hållet." +msgid "In this example: the edges table will need an additional column and the vertex table will be rebuilt completely." +msgstr "I det här exemplet behöver tabellen edges en extra kolumn och tabellen vertex byggs om helt och hållet." msgid "Insert new edges" msgstr "Infoga nya kanter" -msgid "" -"Using :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` insert the " -"results into the edges table." -msgstr "" -"Använd :doc:`pgr_separateCrossing` och :doc:`pgr_separateTouching` för att " -"infoga resultaten i tabellen över kanter." +msgid "Using :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` insert the results into the edges table." +msgstr "Använd :doc:`pgr_separateCrossing` och :doc:`pgr_separateTouching` för att infoga resultaten i tabellen över kanter." msgid "Create the vertices table" msgstr "Skapa en tabell över hörnpunkter" @@ -8096,28 +6408,14 @@ msgstr "Sammandragning av en graf" msgid "The graph can be reduced in size using :doc:`contraction-family`" msgstr "Grafen kan minskas i storlek med hjälp av :doc:`contraction-family`" -msgid "" -"When to contract will depend on the size of the graph, processing times, " -"correctness of the data, on the final application, or any other factor not " -"mentioned." -msgstr "" -"När kontrakt ska ingås beror på grafens storlek, behandlingstider, " -"uppgifternas riktighet, den slutliga applikationen eller någon annan faktor " -"som inte nämns." +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 "När kontrakt ska ingås beror på grafens storlek, behandlingstider, uppgifternas riktighet, den slutliga applikationen eller någon annan faktor som inte nämns." -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 "" -"En ganska bra metod för att ta reda på om sammandragning kan vara användbart " -"är på grund av antalet återvändsgränder och/eller antalet linjära kanter." +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 "En ganska bra metod för att ta reda på om sammandragning kan vara användbart är på grund av antalet återvändsgränder och/eller antalet linjära kanter." -msgid "" -"A complete method on how to contract and how to use the contracted graph is " -"described on :doc:`contraction-family`" -msgstr "" -"En fullständig metod för hur man kontraherar och hur man använder den " -"kontraherade grafen beskrivs på :doc:`contraction-family`" +msgid "A complete method on how to contract and how to use the contracted graph is described on :doc:`contraction-family`" +msgstr "En fullständig metod för hur man kontraherar och hur man använder den kontraherade grafen beskrivs på :doc:`contraction-family`" msgid "To get the dead ends:" msgstr "För att få bort återvändsgränderna:" @@ -8125,26 +6423,17 @@ msgstr "För att få bort återvändsgränderna:" msgid "A dead end happens when" msgstr "En återvändsgränd uppstår när" -msgid "" -"The vertex is the limit of a cul-de-sac, a no-through road or a no-exit road." -msgstr "" -"Toppunkten är gränsen för en återvändsgränd, en väg med genomfartsförbud " -"eller en väg med utfartsförbud." +msgid "The vertex is the limit of a cul-de-sac, a no-through road or a no-exit road." +msgstr "Toppunkten är gränsen för en återvändsgränd, en väg med genomfartsförbud eller en väg med utfartsförbud." msgid "The vertex is on the limit of the imported graph." msgstr "Toppunkten ligger på gränsen för den importerade grafen." msgid "If a larger graph is imported then the vertex might not be a dead end" -msgstr "" -"Om en större graf importeras är det inte säkert att toppunkten är en " -"återvändsgränd" +msgstr "Om en större graf importeras är det inte säkert att toppunkten är en återvändsgränd" -msgid "" -"Node :math:`4`, is a dead end on the query, even that it visually looks like " -"an end point of 3 edges." -msgstr "" -"Noden :math:`4`, är en återvändsgränd i frågan, även om den visuellt ser ut " -"som en slutpunkt för 3 kanter." +msgid "Node :math:`4`, is a dead end on the query, even that it visually looks like an end point of 3 edges." +msgstr "Noden :math:`4`, är en återvändsgränd i frågan, även om den visuellt ser ut som en slutpunkt för 3 kanter." msgid "Is node :math:`4` a dead end or not?" msgstr "Är noden :math:`4` en återvändsgränd eller inte?" @@ -8158,36 +6447,20 @@ msgstr "Finns det en sådan liten trottoarkant:" msgid "That does not allow a vehicle to use that visual intersection?" msgstr "Som inte tillåter ett fordon att använda den visuella korsningen?" -msgid "" -"Is the application for pedestrians and therefore the pedestrian can easily " -"walk on the small curb?" -msgstr "" -"Är applikationen för fotgängare och därför kan fotgängaren enkelt gå på den " -"lilla trottoaren?" +msgid "Is the application for pedestrians and therefore the pedestrian can easily walk on the small curb?" +msgstr "Är applikationen för fotgängare och därför kan fotgängaren enkelt gå på den lilla trottoaren?" -msgid "" -"Is the application for the electricity and the electrical lines than can " -"easily be extended on top of the small curb?" -msgstr "" -"Gäller applikationen el och elledningar som enkelt kan förlängas ovanpå den " -"lilla trottoarkanten?" +msgid "Is the application for the electricity and the electrical lines than can easily be extended on top of the small curb?" +msgstr "Gäller applikationen el och elledningar som enkelt kan förlängas ovanpå den lilla trottoarkanten?" -msgid "" -"Is there a big cliff and from eagles view look like the dead end is close to " -"the segment?" -msgstr "" -"Finns det en stor klippa och från örnens utsikt ser det ut som att " -"återvändsgränden ligger nära segmentet?" +msgid "Is there a big cliff and from eagles view look like the dead end is close to the segment?" +msgstr "Finns det en stor klippa och från örnens utsikt ser det ut som att återvändsgränden ligger nära segmentet?" msgid "Depending on the answer, modification of the data might be needed." msgstr "Beroende på svaret kan det bli nödvändigt att ändra uppgifterna." -msgid "" -"When there are many dead ends, to speed up processing, the :doc:`contraction-" -"family` functions can be used to contract the graph." -msgstr "" -"När det finns många återvändsgränder kan funktionerna :doc:`contraction-" -"family` användas för att dra ihop grafen för att påskynda bearbetningen." +msgid "When there are many dead ends, to speed up processing, the :doc:`contraction-family` functions can be used to contract the graph." +msgstr "När det finns många återvändsgränder kan funktionerna :doc:`contraction-family` användas för att dra ihop grafen för att påskynda bearbetningen." msgid "Linear edges" msgstr "Linjära kanter" @@ -8195,29 +6468,17 @@ msgstr "Linjära kanter" msgid "To get the linear edges:" msgstr "För att få de linjära kanterna:" -msgid "" -"These linear vertices are correct, for example, when those the vertices are " -"speed bumps, stop signals and the application is taking them into account." -msgstr "" -"Dessa linjära hörn är korrekta, till exempel när de hörnen är farthinder, " -"stoppsignaler och applikationen tar hänsyn till dem." +msgid "These linear vertices are correct, for example, when those the vertices are speed bumps, stop signals and the application is taking them into account." +msgstr "Dessa linjära hörn är korrekta, till exempel när de hörnen är farthinder, stoppsignaler och applikationen tar hänsyn till dem." -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 "" -"När det finns många linjära toppar, som inte behöver beaktas, för att " -"påskynda bearbetningen, kan funktionerna :doc:`contraction-family` användas " -"för att kontrahera problemet." +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 "När det finns många linjära toppar, som inte behöver beaktas, för att påskynda bearbetningen, kan funktionerna :doc:`contraction-family` användas för att kontrahera problemet." msgid "Function's structure" msgstr "Funktionens struktur" -msgid "" -"Once the graph preparation work has been done above, it is time to use a" -msgstr "" -"När förberedelserna för grafen har gjorts ovan är det dags att använda en" +msgid "Once the graph preparation work has been done above, it is time to use a" +msgstr "När förberedelserna för grafen har gjorts ovan är det dags att använda en" msgid "The general form of a pgRouting function call is:" msgstr "Den allmänna formen för ett pgRouting-funktionsanrop är:" @@ -8226,41 +6487,24 @@ msgid "\\ \\" msgstr "\\ \\" msgid "pgr_(`Inner queries`_, **parameters**, [ ``Optional parameters``)" -msgstr "" -"pgr_(`Inner queries`_, **parameters**, [ ``Optional parameters``)" +msgstr "pgr_(`Inner queries`_, **parameters**, [ ``Optional parameters``)" -msgid "" -"`Inner queries`_: Are compulsory parameters that are ``TEXT`` strings " -"containing SQL queries." -msgstr "" -"`Innerfrågor`_: Är obligatoriska parametrar som är ``TEXT``-strängar som " -"innehåller SQL-frågor." +msgid "`Inner queries`_: Are compulsory parameters that are ``TEXT`` strings containing SQL queries." +msgstr "`Innerfrågor`_: Är obligatoriska parametrar som är ``TEXT``-strängar som innehåller SQL-frågor." -msgid "" -"**parameters**: Additional compulsory parameters needed by the function." -msgstr "" -"**parametrar**: Ytterligare obligatoriska parametrar som behövs för " -"funktionen." +msgid "**parameters**: Additional compulsory parameters needed by the function." +msgstr "**parametrar**: Ytterligare obligatoriska parametrar som behövs för funktionen." -msgid "" -"``Optional parameters``: Are non compulsory **named** parameters that have a " -"default value when omitted." -msgstr "" -"``Optionella parametrar``: Är icke obligatoriska **namngivna** parametrar " -"som har ett standardvärde när de utelämnas." +msgid "``Optional parameters``: Are non compulsory **named** parameters that have a default value when omitted." +msgstr "``Optionella parametrar``: Är icke obligatoriska **namngivna** parametrar som har ett standardvärde när de utelämnas." -msgid "" -"The compulsory parameters are positional parameters, the optional parameters " -"are named parameters." -msgstr "" -"De obligatoriska parametrarna är positionsparametrar och de valfria " -"parametrarna är namnparametrar." +msgid "The compulsory parameters are positional parameters, the optional parameters are named parameters." +msgstr "De obligatoriska parametrarna är positionsparametrar och de valfria parametrarna är namnparametrar." msgid "For example, for this :doc:`pgr_dijkstra` signature:" msgstr "Till exempel, för denna :doc:`pgr_dijkstra` signatur:" -msgid "" -"pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "pgr_dijkstra(`Edges SQL`_, **start vids**, **slut vids**, [``directed``])" msgid "`Edges SQL`_:" @@ -8275,12 +6519,8 @@ msgstr "Det är obligatoriskt." msgid "It is an inner query." msgstr "Det är en inre frågeställning." -msgid "" -"It has no name, so **Edges SQL** gives an idea of what kind of inner query " -"needs to be used" -msgstr "" -"Den har inget namn, så **Edges SQL** ger en uppfattning om vilken typ av " -"inre fråga som måste användas" +msgid "It has no name, so **Edges SQL** gives an idea of what kind of inner query needs to be used" +msgstr "Den har inget namn, så **Edges SQL** ger en uppfattning om vilken typ av inre fråga som måste användas" msgid "**start vid**:" msgstr "**start vid**:" @@ -8288,22 +6528,14 @@ msgstr "**start vid**:" msgid "Is the second parameter." msgstr "Är den andra parametern." -msgid "" -"It has no name, so **start vid** gives an idea of what the second " -"parameter's value should contain." -msgstr "" -"Den har inget namn, så **start vid** ger en uppfattning om vad den andra " -"parameterns värde ska innehålla." +msgid "It has no name, so **start vid** gives an idea of what the second parameter's value should contain." +msgstr "Den har inget namn, så **start vid** ger en uppfattning om vad den andra parameterns värde ska innehålla." msgid "Is the third parameter." msgstr "Är den tredje parametern." -msgid "" -"It has no name, so **end vid** gives an idea of what the third parameter's " -"value should contain" -msgstr "" -"Den har inget namn, så **slut vid** ger en uppfattning om vad den tredje " -"parameterns värde ska innehålla" +msgid "It has no name, so **end vid** gives an idea of what the third parameter's value should contain" +msgstr "Den har inget namn, så **slut vid** ger en uppfattning om vad den tredje parameterns värde ska innehålla" msgid "Is the fourth parameter." msgstr "Är den fjärde parametern." @@ -8314,12 +6546,8 @@ msgstr "Det är valfritt." msgid "It has a name." msgstr "Den har ett namn." -msgid "" -"The full description of the parameters are found on the `Parameters`_ " -"section of each function." -msgstr "" -"En fullständig beskrivning av parametrarna finns i avsnittet `Parametrar`_ " -"för varje funktion." +msgid "The full description of the parameters are found on the `Parameters`_ section of each function." +msgstr "En fullständig beskrivning av parametrarna finns i avsnittet `Parametrar`_ för varje funktion." msgid "Function's overloads" msgstr "Funktionens överbelastningar" @@ -8351,12 +6579,8 @@ msgstr "**One**: **ANY-INTEGER**" msgid "**Many**: ``ARRAY`` [**ANY-INTEGER**]" msgstr "**Många**: ``ARRAY`` [**ANY-INTEGER**]" -msgid "" -"Depending of the function the overloads may vary. But the concept of " -"parameter type change remains the same." -msgstr "" -"Beroende på funktion kan överbelastningarna variera. Men konceptet med " -"ändring av parametertyp förblir detsamma." +msgid "Depending of the function the overloads may vary. But the concept of parameter type change remains the same." +msgstr "Beroende på funktion kan överbelastningarna variera. Men konceptet med ändring av parametertyp förblir detsamma." msgid "When routing from:" msgstr "När du dirigerar från:" @@ -8388,16 +6612,8 @@ msgstr "Användarna kan definiera kombinationerna som de vill." msgid "Needs a `Combinations SQL`_" msgstr "Behöver en `Combinations SQL`_" -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 "" -"Det finns flera olika typer av giltiga inre frågor och de kolumner som " -"returneras beror också på funktionen. Vilken typ av inner query som används " -"beror på funktionens krav. För att förenkla de många olika typerna används " -"**ANY-INTEGER** och **ANY-NUMERICAL**." +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 "Det finns flera olika typer av giltiga inre frågor och de kolumner som returneras beror också på funktionen. Vilken typ av inner query som används beror på funktionens krav. För att förenkla de många olika typerna används **ANY-INTEGER** och **ANY-NUMERICAL**." msgid "Edges SQL for" msgstr "Edges SQL för" @@ -8411,12 +6627,8 @@ msgstr "Allmänt utan ``id``" msgid "General with (X,Y)" msgstr "Allmänt med (X,Y)" -msgid "" -"When negative: edge (``source``, ``target``) does not exist, therefore it's " -"not part of the graph." -msgstr "" -"När den är negativ: kanten (``källa``, ``mål``) existerar inte, därför är " -"den inte en del av grafen." +msgid "When negative: edge (``source``, ``target``) does not exist, therefore it's not part of the graph." +msgstr "När den är negativ: kanten (``källa``, ``mål``) existerar inte, därför är den inte en del av grafen." msgid "Weight of the edge (``target``, ``source``)," msgstr "Kantvikt (``mål``, ``källa``)," @@ -8460,28 +6672,14 @@ msgstr "Används i kombinationssignaturer" msgid "Points SQL for" msgstr "Punkt SQL för" -msgid "" -"The main parameter of the majority of the pgRouting functions is a query " -"that selects the edges of the graph." -msgstr "" -"Huvudparametern för de flesta pgRouting-funktioner är en fråga som väljer ut " -"kanterna i grafen." +msgid "The main parameter of the majority of the pgRouting functions is a query that selects the edges of the graph." +msgstr "Huvudparametern för de flesta pgRouting-funktioner är en fråga som väljer ut kanterna i grafen." -msgid "" -"Depending on the family or category of a function it will have additional " -"parameters, some of them are compulsory and some are optional." -msgstr "" -"Beroende på vilken familj eller kategori en funktion tillhör kommer den att " -"ha ytterligare parametrar, varav vissa är obligatoriska och andra valfria." +msgid "Depending on the family or category of a function it will have additional parameters, some of them are compulsory and some are optional." +msgstr "Beroende på vilken familj eller kategori en funktion tillhör kommer den att ha ytterligare parametrar, varav vissa är obligatoriska och andra valfria." -msgid "" -"The compulsory parameters are nameless and must be given in the required " -"order. The optional parameters are named parameters and will have a default " -"value." -msgstr "" -"De obligatoriska parametrarna är namnlösa och måste anges i den ordning som " -"krävs. De valfria parametrarna är namngivna parametrar och kommer att ha ett " -"standardvärde." +msgid "The compulsory parameters are nameless and must be given in the required order. The optional parameters are named parameters and will have a default value." +msgstr "De obligatoriska parametrarna är namnlösa och måste anges i den ordning som krävs. De valfria parametrarna är namngivna parametrar och kommer att ha ett standardvärde." msgid "Parameters for the Via functions" msgstr "Parametrar för Via-funktionerna" @@ -8505,29 +6703,16 @@ msgid "When ``true`` if a path is missing stops and returns **EMPTY SET**" msgstr "När ``true`` om en sökväg saknas stoppar och returnerar **EMPTY SET**" msgid "When ``false`` ignores missing paths returning all paths found" -msgstr "" -"När ``false`` ignorerar saknade sökvägar returneras alla sökvägar som hittats" +msgstr "När ``false`` ignorerar saknade sökvägar returneras alla sökvägar som hittats" msgid "``U_turn_on_edge``" msgstr "``U_vändning_på_kanten``" -msgid "" -"When ``true`` departing from a visited vertex will not try to avoid using " -"the edge used to reach it. In other words, U turn using the edge with same " -"identifier is allowed." -msgstr "" -"När ``true`` avgår från ett besökt toppunkt kommer inte att försöka undvika " -"att använda den kant som användes för att nå det. Med andra ord är det " -"tillåtet att använda kanten med samma identifierare i U-svängen." +msgid "When ``true`` departing from a visited vertex will not try to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is allowed." +msgstr "När ``true`` avgår från ett besökt toppunkt kommer inte att försöka undvika att använda den kant som användes för att nå det. Med andra ord är det tillåtet att använda kanten med samma identifierare i U-svängen." -msgid "" -"When ``false`` when a departing from a visited vertex tries to avoid using " -"the edge used to reach it. In other words, U turn using the edge with same " -"identifier is used when no other path is found." -msgstr "" -"När ``false`` när en avgång från en besökt topp försöker undvika att använda " -"den kant som användes för att nå den. Med andra ord, U-sväng med kanten med " -"samma identifierare används när ingen annan väg hittas." +msgid "When ``false`` when a departing from a visited vertex tries to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is used when no other path is found." +msgstr "När ``false`` när en avgång från en besökt topp försöker undvika att använda den kant som användes för att nå den. Med andra ord, U-sväng med kanten med samma identifierare används när ingen annan väg hittas." msgid "For the TRSP functions" msgstr "För TRSP-funktionerna" @@ -8535,19 +6720,14 @@ msgstr "För TRSP-funktionerna" msgid "Array of identifiers of destination vertices." msgstr "Array med identifierare för målpunkter." -msgid "" -"There are several kinds of columns returned are depending of the function." -msgstr "" -"Det finns flera olika typer av kolonner som returneras beroende på funktion." +msgid "There are several kinds of columns returned are depending of the function." +msgstr "Det finns flera olika typer av kolonner som returneras beroende på funktion." msgid "Result columns for single path functions" msgstr "Resultatkolumner för funktioner med enkel sökväg" -msgid "" -"Used in functions that return one path solution per departure and " -"destination." -msgstr "" -"Används i funktioner som returnerar en lösning per avgång och destination." +msgid "Used in functions that return one path solution per departure and destination." +msgstr "Används i funktioner som returnerar en lösning per avgång och destination." msgid ":doc:`pgr_dijkstraNear`" msgstr ":doc:`pgr_dijkstraNear`" @@ -8558,10 +6738,8 @@ msgstr "Returnerar |short-generic-result|" msgid "``path_seq``" msgstr "``path_seq``" -msgid "" -"Relative position in the path. Has value **1** for the beginning of a path." -msgstr "" -"Relativ position i tågläget. Har värdet **1** för början av ett tågläge." +msgid "Relative position in the path. Has value **1** for the beginning of a path." +msgstr "Relativ position i tågläget. Har värdet **1** för början av ett tågläge." msgid "Identifier of the starting vertex of the current path." msgstr "Identifierar startpunkten för den aktuella banan." @@ -8570,39 +6748,22 @@ msgid "Identifier of the ending vertex of the current path." msgstr "Identifierare för den aktuella banans slutpunkt." msgid "Identifier of the node in the path from ``start_vid`` to ``end_vid``." -msgstr "" -"Identifierare av noden i sökvägen från ``start_vid`` till ``slut_vid``." +msgstr "Identifierare av noden i sökvägen från ``start_vid`` till ``slut_vid``." -msgid "" -"Identifier of the edge used to go from ``node`` to the next node in the path " -"sequence. **-1** for the last node of the path." -msgstr "" -"Identifierare av den kant som används för att gå från ``node`` till nästa " -"nod i sökvägssekvensen. **-1** för den sista noden i sökvägen." +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 "Identifierare av den kant som används för att gå från ``node`` till nästa nod i sökvägssekvensen. **-1** för den sista noden i sökvägen." -msgid "" -"Cost to traverse from ``node`` using ``edge`` to the next node in the path " -"sequence." -msgstr "" -"Kostnad för att gå från ``nod`` med hjälp av ``edge`` till nästa nod i " -"vägsekvensen." +msgid "Cost to traverse from ``node`` using ``edge`` to the next node in the path sequence." +msgstr "Kostnad för att gå från ``nod`` med hjälp av ``edge`` till nästa nod i vägsekvensen." -msgid "" -"When ``start_vid`` or ``end_vid`` columns have negative values, the " -"identifier is for a Point." -msgstr "" -"När kolumnerna ``start_vid`` eller ``end_vid`` har negativa värden är " -"identifieraren för en Point." +msgid "When ``start_vid`` or ``end_vid`` columns have negative values, the identifier is for a Point." +msgstr "När kolumnerna ``start_vid`` eller ``end_vid`` har negativa värden är identifieraren för en Point." msgid "Result columns for multiple paths functions" msgstr "Resultatkolumner för funktioner med flera sökvägar" -msgid "" -"Used in functions that return many paths solutions per departure and " -"destination." -msgstr "" -"Används i funktioner som returnerar många banlösningar per avgång och " -"destination." +msgid "Used in functions that return many paths solutions per departure and destination." +msgstr "Används i funktioner som returnerar många banlösningar per avgång och destination." msgid ":doc:`pgr_KSP`" msgstr ":doc:`pgr_KSP`" @@ -8619,11 +6780,8 @@ msgstr "``path_id``" msgid "Path identifier." msgstr "Identifierare för sökväg." -msgid "" -"Has value **1** for the first of a path from ``start_vid`` to ``end_vid``." -msgstr "" -"Har värdet **1** för den första i en sökväg från ``start_vid`` till " -"``slut_vid``." +msgid "Has value **1** for the first of a path from ``start_vid`` to ``end_vid``." +msgstr "Har värdet **1** för den första i en sökväg från ``start_vid`` till ``slut_vid``." msgid "Result columns for cost functions" msgstr "Resultatkolumner för kostnadsfunktioner" @@ -8631,12 +6789,8 @@ msgstr "Resultatkolumner för kostnadsfunktioner" msgid "Used by:" msgstr "Används av:" -msgid "" -"When start_vid or end_vid columns have negative values, the identifier is " -"for a Point." -msgstr "" -"När kolumnerna start_vid eller end_vid har negativa värden är identifieraren " -"för en Point." +msgid "When start_vid or end_vid columns have negative values, the identifier is for a Point." +msgstr "När kolumnerna start_vid eller end_vid har negativa värden är identifieraren för en Point." msgid "Result columns for flow functions" msgstr "Resultatkolumner för flödesfunktioner" @@ -8662,18 +6816,11 @@ msgstr "Tips om prestanda" msgid "For the Routing functions" msgstr "För Routing-funktionerna" -msgid "" -"To get faster results bound the queries to an area of interest of routing." -msgstr "" -"För att få snabbare resultat avgränsar du frågorna till ett intresseområde " -"för routning." +msgid "To get faster results bound the queries to an area of interest of routing." +msgstr "För att få snabbare resultat avgränsar du frågorna till ett intresseområde för routning." -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 "" -"I det här exemplet Använd en inre fråga SQL som inte innehåller några kanter " -"i routningsfunktionen och som ligger inom resultatområdet." +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 "I det här exemplet Använd en inre fråga SQL som inte innehåller några kanter i routningsfunktionen och som ligger inom resultatområdet." msgid "Given this area:" msgstr "Med tanke på detta område:" @@ -8687,42 +6834,26 @@ msgstr "Hur du bidrar" msgid "Wiki" msgstr "Wiki" -msgid "" -"Edit an existing `pgRouting Wiki `__ page." -msgstr "" -"Redigera en befintlig sida i `pgRouting Wiki `__." +msgid "Edit an existing `pgRouting Wiki `__ page." +msgstr "Redigera en befintlig sida i `pgRouting Wiki `__." msgid "Or create a new Wiki page" msgstr "Eller skapa en ny Wiki-sida" -msgid "" -"Create a page on the `pgRouting Wiki `__" -msgstr "" -"Skapa en sida på `pgRouting Wiki `__" +msgid "Create a page on the `pgRouting Wiki `__" +msgstr "Skapa en sida på `pgRouting Wiki `__" msgid "Give the title an appropriate name" msgstr "Ge titeln ett lämpligt namn" -msgid "" -"`Example `__" -msgstr "" -"exempel `__" +msgid "`Example `__" +msgstr "exempel `__" msgid "Adding Functionality to pgRouting" msgstr "Lägga till funktionalitet i pgRouting" -msgid "" -"Consult the `developer's documentation `__" -msgstr "" -"Se dokumentationen för utvecklare `__" +msgid "Consult the `developer's documentation `__" +msgstr "Se dokumentationen för utvecklare `__" msgid "See also" msgstr "Se även" @@ -8730,21 +6861,10 @@ msgstr "Se även" msgid "Installation" msgstr "Installation" -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 "" -"Instruktioner för nedladdning och installation av binärfiler för olika " -"operativsystem, ytterligare anmärkningar och korrigeringar som inte ingår i " -"denna dokumentation finns i `Installation wiki `__" +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 "Instruktioner för nedladdning och installation av binärfiler för olika operativsystem, ytterligare anmärkningar och korrigeringar som inte ingår i denna dokumentation finns i `Installation wiki `__" -msgid "" -"To use pgRouting, PostGIS needs to be installed, please read the information " -"about installation in this `Install Guide `__" +msgid "To use pgRouting, PostGIS needs to be installed, please read the information about installation in this `Install Guide `__" msgstr "För att använda pgRouting måste PostGIS vara installerat, läs informationen om installation i denna installationsguide `__" msgid "Short Version" @@ -8756,32 +6876,20 @@ msgstr "Extrahera tar-bollen" msgid "To compile assuming you have all the dependencies in your search path:" msgstr "För att kompilera förutsatt att du har alla beroenden i din sökväg:" -msgid "" -"Once pgRouting is installed, it needs to be enabled in each individual " -"database you want to use it in." -msgstr "" -"När pgRouting har installerats måste det aktiveras i varje enskild databas " -"som du vill använda det i." +msgid "Once pgRouting is installed, it needs to be enabled in each individual database you want to use it in." +msgstr "När pgRouting har installerats måste det aktiveras i varje enskild databas som du vill använda det i." msgid "Get the sources" msgstr "Hämta källorna" -msgid "" -"The pgRouting latest release can be found in https://github.com/pgRouting/" -"pgrouting/releases/latest" -msgstr "" -"Den senaste versionen av pgRouting finns på https://github.com/pgRouting/" -"pgrouting/releases/latest" +msgid "The pgRouting latest release can be found in https://github.com/pgRouting/pgrouting/releases/latest" +msgstr "Den senaste versionen av pgRouting finns på https://github.com/pgRouting/pgrouting/releases/latest" msgid "To download this release:" msgstr "För att ladda ner denna release:" -msgid "" -"Go to :ref:`install-short` for more instructions on extracting tar ball and " -"compiling pgRouting." -msgstr "" -"Gå till :ref:`install-short` för mer instruktioner om hur du extraherar tar " -"ball och kompilerar pgRouting." +msgid "Go to :ref:`install-short` for more instructions on extracting tar ball and compiling pgRouting." +msgstr "Gå till :ref:`install-short` för mer instruktioner om hur du extraherar tar ball och kompilerar pgRouting." msgid "git" msgstr "git" @@ -8789,14 +6897,8 @@ msgstr "git" msgid "To download the repository" msgstr "Så här laddar du ner arkivet" -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 "" -"Gå till :ref:`install-short` för mer instruktioner om hur du kompilerar " -"pgRouting (det finns ingen tarball inblandad när du laddar ner pgRouting-" -"arkivet från GitHub)." +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 "Gå till :ref:`install-short` för mer instruktioner om hur du kompilerar pgRouting (det finns ingen tarball inblandad när du laddar ner pgRouting-arkivet från GitHub)." msgid "Enabling and upgrading in the database" msgstr "Aktivering och uppgradering i databasen" @@ -8804,37 +6906,21 @@ msgstr "Aktivering och uppgradering i databasen" msgid "Enabling the database" msgstr "Aktivering av databasen" -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 är en PostgreSQL-förlängning och beror på PostGIS för att " -"tillhandahålla funktioner till slutanvändaren. Nedanstående kod demonstrerar " -"aktivering av PostGIS och pgRouting i databasen." +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 är en PostgreSQL-förlängning och beror på PostGIS för att tillhandahålla funktioner till slutanvändaren. Nedanstående kod demonstrerar aktivering av PostGIS och pgRouting i databasen." -msgid "" -"Checking PostGIS and pgRouting version after enabling them in the database." -msgstr "" -"Kontroll av PostGIS- och pgRouting-version efter att de har aktiverats i " -"databasen." +msgid "Checking PostGIS and pgRouting version after enabling them in the database." +msgstr "Kontroll av PostGIS- och pgRouting-version efter att de har aktiverats i databasen." msgid "Upgrading the database" msgstr "Uppgradering av databasen" -msgid "" -"To upgrade pgRouting in the database to version 4.0.0 use the following " -"command:" -msgstr "" -"Använd följande kommando för att uppgradera pgRouting i databasen till " -"version 4.0.0:" +#, fuzzy +msgid "To upgrade pgRouting in the database to version 4.1.0 use the following command:" +msgstr "Använd följande kommando för att uppgradera pgRouting i databasen till version 4.0.0:" -msgid "" -"More information can be found in https://www.postgresql.org/docs/current/sql-" -"createextension.html" -msgstr "" -"Mer information finns på https://www.postgresql.org/docs/current/sql-" -"createextension.html" +msgid "More information can be found in https://www.postgresql.org/docs/current/sql-createextension.html" +msgstr "Mer information finns på https://www.postgresql.org/docs/current/sql-createextension.html" msgid "Dependencies" msgstr "Beroenden" @@ -8842,28 +6928,17 @@ msgstr "Beroenden" msgid "Compilation Dependencies" msgstr "Beroenden för kompilering" -msgid "" -"To be able to compile pgRouting, make sure that the following dependencies " -"are met:" -msgstr "" -"För att kunna kompilera pgRouting måste du se till att följande beroenden är " -"uppfyllda:" +msgid "To be able to compile pgRouting, make sure that the following dependencies are met:" +msgstr "För att kunna kompilera pgRouting måste du se till att följande beroenden är uppfyllda:" msgid "C and C++0x compilers" msgstr "C- och C++0x-kompilatorer" -msgid "" -"Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with C++03 " -"or C++11 standard support" -msgstr "" -"Kompilering med Boost 1.56 upp till Boost 1.74 kräver C++-kompilator med " -"standardstöd för C++03 eller C++11" +msgid "Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with C++03 or C++11 standard support" +msgstr "Kompilering med Boost 1.56 upp till Boost 1.74 kräver C++-kompilator med standardstöd för C++03 eller C++11" -msgid "" -"Compiling with Boost 1.75 requires C++ Compiler with C++14 standard support" -msgstr "" -"Kompilering med Boost 1.75 kräver C++-kompilator med stöd för C++14-" -"standarden" +msgid "Compiling with Boost 1.75 requires C++ Compiler with C++14 standard support" +msgstr "Kompilering med Boost 1.75 kräver C++-kompilator med stöd för C++14-standarden" msgid "Postgresql version >= 13" msgstr "Postgresql-version >= 13" @@ -8934,17 +7009,11 @@ msgstr "Byggkatalogen skiljer sig från källkatalogen" msgid "Configuring The Documentation" msgstr "Konfigurera dokumentationen" -msgid "" -"User and developers documentation are not build if prerequisites are not " -"found." +msgid "User and developers documentation are not build if prerequisites are not found." msgstr "Användar- och utvecklardokumentation byggs inte om förutsättningarna inte hittas." -msgid "" -"Most of the effort of the documentation has been on the HTML files. Some " -"variables for building documentation:" -msgstr "" -"Det mesta av arbetet med dokumentationen har lagts på HTML-filerna. Några " -"variabler för att bygga dokumentation:" +msgid "Most of the effort of the documentation has been on the HTML files. Some variables for building documentation:" +msgstr "Det mesta av arbetet med dokumentationen har lagts på HTML-filerna. Några variabler för att bygga dokumentation:" msgid "Variable" msgstr "Variabel" @@ -8965,8 +7034,7 @@ msgid "BUILD_DOXY" msgstr "BYGG_DOXY" msgid "If ON, turn on/off building HTML for developer's documentation" -msgstr "" -"Om ON, aktivera/avaktivera HTML-skapande för utvecklarens dokumentation" +msgstr "Om ON, aktivera/avaktivera HTML-skapande för utvecklarens dokumentation" msgid "BUILD_LATEX" msgstr "BUILD_LATEX" @@ -8987,8 +7055,7 @@ msgid "DOC_USE_BOOTSTRAP" msgstr "DOC_ANVÄNDA_BOOTSTRAP" msgid "If ON, use sphinx-bootstrap for HTML pages of the users documentation" -msgstr "" -"Om PÅ, använd sphinx-bootstrap för HTML-sidor i användardokumentationen" +msgstr "Om PÅ, använd sphinx-bootstrap för HTML-sidor i användardokumentationen" msgid "EN" msgstr "EN" @@ -9023,12 +7090,8 @@ msgstr "Använda ``make`` för att bygga koden och dokumentationen" msgid "The following instructions start from ``path/to/pgrouting/build``" msgstr "Följande instruktioner startar från ``stigen/till/pgrouting/build``" -msgid "" -"We have tested on several platforms, For installing or reinstalling all the " -"steps are needed." -msgstr "" -"Vi har testat på flera plattformar, För installation eller ominstallation " -"behövs alla steg." +msgid "We have tested on several platforms, For installing or reinstalling all the steps are needed." +msgstr "Vi har testat på flera plattformar, För installation eller ominstallation behövs alla steg." msgid "Linux" msgstr "Linux" @@ -9040,37 +7103,13 @@ msgid "Testing" msgstr "Testar" msgid "Currently there is no :code:`make test` and testing is done as follows" -msgstr "" -"För närvarande finns det ingen :code:`make test` och testning görs på " -"följande sätt" +msgstr "För närvarande finns det ingen :code:`make test` och testning görs på följande sätt" -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 är en förlängning av `PostGIS `__ och " -"`PostgreSQL `__ geospatial databas och lägger " -"till routing och annan nätverksanalysfunktionalitet. En föregångare till " -"pgRouting - pgDijkstra, skriven av Sylvain Pasche från `Camptocamp `__, utökades senare av Orkney och döptes om till pgRouting. " -"Projektet stöds och underhålls nu av `Georepublic `__, `Paragon Corporation `__ och " -"en bred användargrupp." +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 är en förlängning av `PostGIS `__ och `PostgreSQL `__ geospatial databas och lägger till routing och annan nätverksanalysfunktionalitet. En föregångare till pgRouting - pgDijkstra, skriven av Sylvain Pasche från `Camptocamp `__, utökades senare av Orkney och döptes om till pgRouting. Projektet stöds och underhålls nu av `Georepublic `__, `Paragon Corporation `__ och en bred användargrupp." -msgid "" -"pgRouting is part of `OSGeo Community Projects `__ from the `OSGeo Foundation `__ and included on `OSGeoLive `__." -msgstr "" -"pgRouting är en del av `OSGeo Community Projects `__ från `OSGeo Foundation `__ och ingår i `OSGeoLive `__." +msgid "pgRouting is part of `OSGeo Community Projects `__ from the `OSGeo Foundation `__ and included on `OSGeoLive `__." +msgstr "pgRouting är en del av `OSGeo Community Projects `__ från `OSGeo Foundation `__ och ingår i `OSGeoLive `__." msgid "Licensing" msgstr "Licens" @@ -9084,45 +7123,26 @@ msgstr "**Licens**" msgid "GNU General Public License v2.0 or later" msgstr "GNU General Public License v2.0 eller senare" -msgid "" -"Most features of pgRouting are available under `GNU General Public License " -"v2.0 or later `_." -msgstr "" -"De flesta funktioner i pgRouting är tillgängliga under `GNU General Public " -"License v2.0 eller senare `_." +msgid "Most features of pgRouting are available under `GNU General Public License v2.0 or later `_." +msgstr "De flesta funktioner i pgRouting är tillgängliga under `GNU General Public License v2.0 eller senare `_." msgid "Boost Software License - Version 1.0" msgstr "Licens för Boost-programvara - Version 1.0" -msgid "" -"Some Boost extensions are available under `Boost Software License - Version " -"1.0 `_." -msgstr "" -"Vissa Boost-tillägg är tillgängliga under `Boost Software License - Version " -"1.0 `_." +msgid "Some Boost extensions are available under `Boost Software License - Version 1.0 `_." +msgstr "Vissa Boost-tillägg är tillgängliga under `Boost Software License - Version 1.0 `_." msgid "MIT-X License" msgstr "MIT-X-licens" -msgid "" -"Some code contributed by iMaptools.com is available under MIT-X license." -msgstr "" -"Viss kod som tillhandahålls av iMaptools.com är tillgänglig under MIT-X-" -"licens." +msgid "Some code contributed by iMaptools.com is available under MIT-X license." +msgstr "Viss kod som tillhandahålls av iMaptools.com är tillgänglig under MIT-X-licens." -msgid "" -"The pgRouting Manual is licensed under a `Creative Commons Attribution-Share " -"Alike 3.0 License `_." -msgstr "" -"Manualen för pgRouting är licensierad under en `Creative Commons Attribution-" -"Share Alike 3.0 License `_." +msgid "The pgRouting Manual is licensed under a `Creative Commons Attribution-Share Alike 3.0 License `_." +msgstr "Manualen för pgRouting är licensierad under en `Creative Commons Attribution-Share Alike 3.0 License `_." -msgid "" -"In general license information should be included in the header of each " -"source file." -msgstr "" -"I allmänhet bör licensinformation inkluderas i sidhuvudet för varje källfil." +msgid "In general license information should be included in the header of each source file." +msgstr "I allmänhet bör licensinformation inkluderas i sidhuvudet för varje källfil." msgid "Contributors" msgstr "Medverkande" @@ -9136,14 +7156,8 @@ msgstr "Personer i denna utgåva v4.0.0 (i alfabetisk ordning)" msgid "Bipasha Gayary, Fan Wu, Regina Obe, Saloni kumari, Vicky Vergara" msgstr "Bipasha Gayary, Fan Wu, Regina Obe, Saloni kumari, Vicky Vergara" -msgid "" -"And all the people that give us a little of their time making comments, " -"finding issues, making pull requests etc. in any of our products: " -"osm2pgrouting, pgRouting, pgRoutingLayer, workshop." -msgstr "" -"Och alla de människor som ger oss lite av sin tid genom att kommentera, " -"hitta problem, göra pull requests etc. i någon av våra produkter: " -"osm2pgrouting, pgRouting, pgRoutingLayer, workshop." +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 "Och alla de människor som ger oss lite av sin tid genom att kommentera, hitta problem, göra pull requests etc. i någon av våra produkter: osm2pgrouting, pgRouting, pgRoutingLayer, workshop." msgid "Translators (in alphabetical order)" msgstr "Översättare (i alfabetisk ordning)" @@ -9169,12 +7183,8 @@ msgstr "Daniel Nylander" msgid "Corporate Sponsors in this release (in alphabetical order)" msgstr "Företagssponsorer i denna utgåva (i alfabetisk ordning)" -msgid "" -"These are corporate entities that have contributed developer time, hosting, " -"or direct monetary funding to the pgRouting project:" -msgstr "" -"Dessa är företagsenheter som har bidragit med utvecklingstid, hosting eller " -"direkt monetär finansiering till pgRouting-projektet:" +msgid "These are corporate entities that have contributed developer time, hosting, or direct monetary funding to the pgRouting project:" +msgstr "Dessa är företagsenheter som har bidragit med utvecklingstid, hosting eller direkt monetär finansiering till pgRouting-projektet:" msgid "`OSGeo `__" msgstr "`OSGeo `__" @@ -9183,8 +7193,7 @@ msgid "`OSGeo UK `__" msgstr "oSGeo Storbritannien `__" msgid "`Google Summer of Code `__" -msgstr "" -"googles sommarprogram för kodning `__" +msgstr "googles sommarprogram för kodning `__" msgid "`HighGo Software `__" msgstr "`HighGo-programvara `__" @@ -9198,20 +7207,7 @@ msgstr "Tidigare och nuvarande bidragsgivare:" msgid "Individuals (in alphabetical order)" msgstr "Enskilda personer (i alfabetisk ordning)" -msgid "" -"Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio " -"Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf " -"Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, " -"Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, " -"Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, " -"Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu " -"Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko " -"Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim " -"Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish " -"Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni " -"Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen " -"Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, " -"Vidhan Jain, Virginia Vergara, Yige Huang" +msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" msgstr "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" msgid "Corporate Sponsors (in alphabetical order)" @@ -9256,19 +7252,11 @@ msgstr "Versaterm Inc." msgid "More Information" msgstr "Mer information" -msgid "" -"The latest software, documentation and news items are available at the " -"pgRouting web site https://pgrouting.org." -msgstr "" -"Den senaste programvaran, dokumentationen och nyheter finns tillgängliga på " -"pgRoutings webbplats https://pgrouting.org." +msgid "The latest software, documentation and news items are available at the pgRouting web site https://pgrouting.org." +msgstr "Den senaste programvaran, dokumentationen och nyheter finns tillgängliga på pgRoutings webbplats https://pgrouting.org." -msgid "" -"PostgreSQL database server at the PostgreSQL main site https://www." -"postgresql.org." -msgstr "" -"PostgreSQL-databasserver på PostgreSQL-huvudwebbplatsen https://www." -"postgresql.org." +msgid "PostgreSQL database server at the PostgreSQL main site https://www.postgresql.org." +msgstr "PostgreSQL-databasserver på PostgreSQL-huvudwebbplatsen https://www.postgresql.org." msgid "PostGIS extension at the PostGIS project web site https://postgis.net." msgstr "PostGIS-tillägg på PostGIS-projektets webbplats https://postgis.net." @@ -9280,8 +7268,7 @@ msgid ":doc:`migration`" msgstr ":doc:`migration`" msgid "``pgr_KSP`` — Yen's algorithm for K shortest paths using Dijkstra." -msgstr "" -"``pgr_KSP`` - Yen's algoritm för K kortaste vägar med hjälp av Dijkstra." +msgstr "``pgr_KSP`` - Yen's algoritm för K kortaste vägar med hjälp av Dijkstra." msgid "Availability" msgstr "Tillgänglighet" @@ -9331,12 +7318,8 @@ msgstr "Version 2.0.0" msgid "Official function." msgstr "Officiell funktion." -msgid "" -"The K shortest path routing algorithm based on Yen's algorithm. \"K\" is the " -"number of shortest paths desired." -msgstr "" -"Algoritmen K för kortaste vägen baseras på Yens algoritm. \"K\" är antalet " -"önskade kortaste vägar." +msgid "The K shortest path routing algorithm based on Yen's algorithm. \"K\" is the number of shortest paths desired." +msgstr "Algoritmen K för kortaste vägen baseras på Yens algoritm. \"K\" är antalet önskade kortaste vägar." msgid "|Boost| Boost Graph Inside" msgstr "|Boost| Boost-graf inuti" @@ -9351,23 +7334,16 @@ msgid "Summary" msgstr "Sammanfattning" msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vid**, **K**, [**options**])" -msgstr "" -"pgr_KSP(`Kanter SQL`_, **start vid**, **end vid**, **K**, [**options**])" +msgstr "pgr_KSP(`Kanter SQL`_, **start vid**, **end vid**, **K**, [**options**])" -msgid "" -"pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" -msgstr "" -"pgr_KSP(`Kanter SQL`_, **start vid**, **end vids**, **K**, [**options**])" +msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" +msgstr "pgr_KSP(`Kanter SQL`_, **start vid**, **end vids**, **K**, [**options**])" -msgid "" -"pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" -msgstr "" -"pgr_KSP(`Kanter SQL`_, **start vids**, **end vid**, **K**, [**options**])" +msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" +msgstr "pgr_KSP(`Kanter SQL`_, **start vids**, **end vid**, **K**, [**options**])" -msgid "" -"pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" -msgstr "" -"pgr_KSP(`Kanter SQL`_, **start vids**, **end vids**, **K**, [**options**])" +msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" +msgstr "pgr_KSP(`Kanter SQL`_, **start vids**, **end vids**, **K**, [**options**])" msgid "pgr_KSP(`Edges SQL`_, `Combinations SQL`_, **K**, [**options**])" msgstr "pgr_KSP(`Kanter SQL`_, `Combinations SQL`_, **K**, [**options**])" @@ -9387,26 +7363,14 @@ msgstr "Exempel" msgid "Get 2 paths from :math:`6` to :math:`17` on a directed graph." msgstr "Hämta 2 vägar från :math:`6` till :math:`17` på en riktad graf." -msgid "" -"Get 2 paths from vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a " -"directed graph." -msgstr "" -"Hämta 2 vägar från toppunkten :math:`6` till toppunkterna :math:`\\{10, 17\\}" -"` i en riktad graf." +msgid "Get 2 paths from vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph." +msgstr "Hämta 2 vägar från toppunkten :math:`6` till toppunkterna :math:`\\{10, 17\\}` i en riktad graf." -msgid "" -"Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a " -"directed graph." -msgstr "" -"Hämta 2 vägar från topparna :math:`\\{6, 1\\}` till toppunkten :math:`17` i " -"en riktad graf." +msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph." +msgstr "Hämta 2 vägar från topparna :math:`\\{6, 1\\}` till toppunkten :math:`17` i en riktad graf." -msgid "" -"Get 2 paths vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on " -"a directed graph." -msgstr "" -"Hämta 2 vägar från topparna :math:`\\{6, 1\\}` till topparna :math:`\\{10, " -"17\\}` i en riktad graf." +msgid "Get 2 paths vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on a directed graph." +msgstr "Hämta 2 vägar från topparna :math:`\\{6, 1\\}` till topparna :math:`\\{10, 17\\}` i en riktad graf." msgid "Using a combinations table on an directed graph" msgstr "Använda en kombinationstabell på en riktad graf" @@ -9438,12 +7402,8 @@ msgstr "När ``false`` Returnerar högst K sökvägar." msgid "When ``true`` all the calculated paths while processing are returned." msgstr "När ``true`` returneras alla beräknade banor under bearbetningen." -msgid "" -"Roughly, when the shortest path has ``N`` edges, the heap will contain about " -"than ``N * K`` paths for small value of ``K`` and ``K > 5``." -msgstr "" -"Grovt sett, när den kortaste vägen har ``N`` kanter, kommer högen att " -"innehålla ungefär än ``N * K`` vägar för litet värde av ``K`` och ``K > 5``." +msgid "Roughly, when the shortest path has ``N`` edges, the heap will contain about than ``N * K`` paths for small value of ``K`` and ``K > 5``." +msgstr "Grovt sett, när den kortaste vägen har ``N`` kanter, kommer högen att innehålla ungefär än ``N * K`` vägar för litet värde av ``K`` och ``K > 5``." msgid "Additional Examples" msgstr "Ytterligare exempel" @@ -9457,12 +7417,8 @@ msgstr "Hämta även sökvägarna i högen." msgid "Get 2 paths using combinations table on an undirected graph" msgstr "Få 2 vägar med hjälp av kombinationstabell på en oriktad graf" -msgid "" -"Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a " -"undirected graph." -msgstr "" -"Hämta 2 vägar från topparna :math:`\\{6, 1\\}` till toppunkten :math:`17` i " -"en odelad graf." +msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a undirected graph." +msgstr "Hämta 2 vägar från topparna :math:`\\{6, 1\\}` till toppunkten :math:`17` i en odelad graf." msgid "https://en.wikipedia.org/wiki/K_shortest_path_routing" msgstr "https://en.wikipedia.org/wiki/K_shortest_path_routing" @@ -9479,26 +7435,14 @@ msgstr "Tillgänglighet:" msgid "Version 3.2.1" msgstr "Version 3.2.1" -msgid "" -"Metric Algorithm from `Boost library `__" -msgstr "" -"Metrisk algoritm från `Boost-biblioteket `__" +msgid "Metric Algorithm from `Boost library `__" +msgstr "Metrisk algoritm från `Boost-biblioteket `__" msgid "Simulated Annealing Algorithm no longer supported" msgstr "Simulated Annealing Algorithm stöds inte längre" -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 "" -"Parametrar relaterade till Simulated Annealing Algorithm ignoreras: " -"`max_processing_time`, `tries_per_temperature`, " -"`max_changes_per_temperature`, `max_consecutive_non_changes`, " -"`initial_temperature`, `final_temperature`, `cooling_factor`, `randomize`" +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 "Parametrar relaterade till Simulated Annealing Algorithm ignoreras: `max_processing_time`, `tries_per_temperature`, `max_changes_per_temperature`, `max_consecutive_non_changes`, `initial_temperature`, `final_temperature`, `cooling_factor`, `randomize`" msgid "Version 2.3.0" msgstr "Version 2.3.0" @@ -9509,12 +7453,8 @@ msgstr "Resultaten ändras beroende på inmatningsordningen för `Matrix SQL`_" msgid "Negative costs are ignored." msgstr "Negativa kostnader ignoreras." -msgid "" -"Can be Used with :doc:`costMatrix-category` functions preferably with " -"`directed => false`." -msgstr "" -"Kan användas med :doc:`costMatrix-category` funktioner helst med `directed " -"=> false`." +msgid "Can be Used with :doc:`costMatrix-category` functions preferably with `directed => false`." +msgstr "Kan användas med :doc:`costMatrix-category` funktioner helst med `directed => false`." msgid "With ``directed => false``" msgstr "Med ``riktad => falsk``" @@ -9534,82 +7474,44 @@ msgstr "alla resekostnader på kanter följer triangelolikheten." msgid "When ``start_vid = 0 OR end_vid = 0``" msgstr "När ``start_vid = 0 OR end_vid = 0``" -msgid "" -"The solutions generated are guaranteed to be *twice as long as the optimal " -"tour in the worst case*" -msgstr "" -"De lösningar som genereras är garanterat * dubbelt så långa som den optimala " -"turen i värsta fall*" +msgid "The solutions generated are guaranteed to be *twice as long as the optimal tour in the worst case*" +msgstr "De lösningar som genereras är garanterat * dubbelt så långa som den optimala turen i värsta fall*" msgid "When ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``" msgstr "När ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``" -msgid "" -"It is **not guaranteed** that the solution will be, in the worst case, twice " -"as long as the optimal tour, due to the fact that `end_vid` is forced to be " -"in a fixed position." -msgstr "" -"Det är **inte garanterat** att lösningen i värsta fall kommer att vara " -"dubbelt så lång som den optimala turen, eftersom `end_vid` tvingas vara i en " -"fast position." +msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour, due to the fact that `end_vid` is forced to be in a fixed position." +msgstr "Det är **inte garanterat** att lösningen i värsta fall kommer att vara dubbelt så lång som den optimala turen, eftersom `end_vid` tvingas vara i en fast position." msgid "With ``directed => true``" msgstr "Med ``riktad => sann``" -msgid "" -"It is **not guaranteed** that the solution will be, in the worst case, twice " -"as long as the optimal tour" -msgstr "" -"Det är **inte garanterat** att lösningen i värsta fall kommer att vara " -"dubbelt så lång som den optimala turen" +msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour" +msgstr "Det är **inte garanterat** att lösningen i värsta fall kommer att vara dubbelt så lång som den optimala turen" msgid "is directed" msgstr "är riktad" -msgid "" -"some (or all) traveling costs on edges might not obey the triangle " -"inequality." -msgstr "" -"vissa (eller alla) resekostnader på kanter kanske inte följer " -"triangelolikheten." +msgid "some (or all) traveling costs on edges might not obey the triangle inequality." +msgstr "vissa (eller alla) resekostnader på kanter kanske inte följer triangelolikheten." -msgid "" -"As an undirected graph is required, the directed graph is transformed as " -"follows:" -msgstr "" -"Eftersom det krävs en oriktad graf, omvandlas den riktade grafen enligt " -"följande:" +msgid "As an undirected graph is required, the directed graph is transformed as follows:" +msgstr "Eftersom det krävs en oriktad graf, omvandlas den riktade grafen enligt följande:" -msgid "" -"edges `(u, v)` and `(v, u)` is considered to be the same edge (denoted `(u, " -"v)`" -msgstr "" -"kanterna `(u, v)` och `(v, u)` anses vara samma kant (betecknas `(u, v)`)" +msgid "edges `(u, v)` and `(v, u)` is considered to be the same edge (denoted `(u, v)`" +msgstr "kanterna `(u, v)` och `(v, u)` anses vara samma kant (betecknas `(u, v)`)" msgid "if ``agg_cost`` differs between one or more instances of edge `(u, v)`" -msgstr "" -"om ``agg_cost`` skiljer sig mellan en eller flera instanser av kant `(u, v)``" +msgstr "om ``agg_cost`` skiljer sig mellan en eller flera instanser av kant `(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 "" -"Det lägsta värdet av ``agg_cost`` för alla instanser av kanten `(u, v)`` " -"kommer att betraktas som ``agg_cost`` för kanten `(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 "Det lägsta värdet av ``agg_cost`` för alla instanser av kanten `(u, v)`` kommer att betraktas som ``agg_cost`` för kanten `(u, v)``" -msgid "" -"Some (or all) traveling costs on edges will still might not obey the " -"triangle inequality." -msgstr "" -"Vissa (eller alla) resekostnader på kanter kommer kanske ändå inte att följa " -"triangelolikheten." +msgid "Some (or all) traveling costs on edges will still might not obey the triangle inequality." +msgstr "Vissa (eller alla) resekostnader på kanter kommer kanske ändå inte att följa triangelolikheten." -msgid "" -"When the data does not come from an undirected graph or its not fully " -"connected:" -msgstr "" -"När data inte kommer från en odelad graf eller om den inte är helt " -"sammanhängande:" +msgid "When the data does not come from an undirected graph or its not fully connected:" +msgstr "När data inte kommer från en odelad graf eller om den inte är helt sammanhängande:" msgid "Missing values will be calculated with dijkstra algorithm." msgstr "Saknade värden kommer att beräknas med dijkstra-algoritmen." @@ -9617,33 +7519,17 @@ msgstr "Saknade värden kommer att beräknas med dijkstra-algoritmen." msgid "When the graph has more than one component:" msgstr "När grafen har mer än en komponent:" -msgid "" -"``start_vid`` or ``end_vid`` are defined and are on the same component: the " -"TSP tour will happen on that component." -msgstr "" -"``start_vid`` eller ``slut_vid`` är definierade och finns på samma " -"komponent: TSP-turen kommer att äga rum på den komponenten." +msgid "``start_vid`` or ``end_vid`` are defined and are on the same component: the TSP tour will happen on that component." +msgstr "``start_vid`` eller ``slut_vid`` är definierade och finns på samma komponent: TSP-turen kommer att äga rum på den komponenten." -msgid "" -"``start_vid`` or ``end_vid`` are defined and are not on the same component: " -"the TSP tour will propose a tour that has both components where connecting " -"costs are estimated." -msgstr "" -"``start_vid`` eller ``slut_vid`` definieras och inte finns på samma " -"komponent: TSP-turen kommer att föreslå en tur som har båda komponenterna " -"där anslutningskostnaderna beräknas." +msgid "``start_vid`` or ``end_vid`` are defined and are not on the same component: the TSP tour will propose a tour that has both components where connecting costs are estimated." +msgstr "``start_vid`` eller ``slut_vid`` definieras och inte finns på samma komponent: TSP-turen kommer att föreslå en tur som har båda komponenterna där anslutningskostnaderna beräknas." -msgid "" -"``start_vid`` or ``end_vid`` are not defined: the starting point could be on " -"any component and will include data only from that component." -msgstr "" -"``start_vid`` eller ``end_vid`` är inte definierade: startpunkten kan vara " -"på vilken komponent som helst och kommer endast att innehålla data från den " -"komponenten." +msgid "``start_vid`` or ``end_vid`` are not defined: the starting point could be on any component and will include data only from that component." +msgstr "``start_vid`` eller ``end_vid`` är inte definierade: startpunkten kan vara på vilken komponent som helst och kommer endast att innehålla data från den komponenten." msgid "One cycle attempt to remove crossing edges is done to the TSP results." -msgstr "" -"Ett cykelförsök för att ta bort korsande kanter görs på TSP-resultaten." +msgstr "Ett cykelförsök för att ta bort korsande kanter görs på TSP-resultaten." msgid "pgr_TSP(`Matrix SQL`_, ``[start_id, end_id]``)" msgstr "pgr_TSP(`Matrix SQL`_, ``[start_id, end_id]``)" @@ -9652,15 +7538,10 @@ msgid "Returns set of |tsp-result|" msgstr "Returnerar uppsättning av |tsp-result|" msgid "Using :doc:`pgr_dijkstraCostMatrix` to generate the matrix information" -msgstr "" -"Använd :doc:`pgr_dijkstraCostMatrix` för att generera matrisinformationen" +msgstr "Använd :doc:`pgr_dijkstraCostMatrix` för att generera matrisinformationen" -msgid "" -"**Line 4** Vertices :math:`\\{2, 4, 13, 14\\}` are not included because they " -"are not connected." -msgstr "" -"**Linje 4** Punkterna :math:`{\\{2, 4, 13, 14\\\\}` är inte inkluderade " -"eftersom de inte är anslutna." +msgid "**Line 4** Vertices :math:`\\{2, 4, 13, 14\\}` are not included because they are not connected." +msgstr "**Linje 4** Punkterna :math:`{\\{2, 4, 13, 14\\\\}` är inte inkluderade eftersom de inte är anslutna." msgid "`Matrix SQL`_ as described below" msgstr "`Matrix SQL`_ enligt beskrivningen nedan" @@ -9686,19 +7567,14 @@ msgstr "**node**" msgid "Identifier of the node/coordinate/point." msgstr "Identifierare av nod/koordinat/punkt." -msgid "" -"Cost to traverse from the current ``node`` to the next ``node`` in the path " -"sequence." -msgstr "" -"Kostnad för att gå från aktuell ``nod`` till nästa ``nod`` i " -"sökvägssekvensen." +msgid "Cost to traverse from the current ``node`` to the next ``node`` in the path sequence." +msgstr "Kostnad för att gå från aktuell ``nod`` till nästa ``nod`` i sökvägssekvensen." msgid "``0`` for the last row in the tour sequence." msgstr "``0`` för den sista raden i turordningssekvensen." msgid "Aggregate cost from the ``node`` at ``seq = 1`` to the current node." -msgstr "" -"Sammanlagd kostnad från ``noden`` vid ``seq = 1`` till den aktuella noden." +msgstr "Sammanlagd kostnad från ``noden`` vid ``seq = 1`` till den aktuella noden." msgid "``0`` for the first row in the tour sequence." msgstr "``0`` för den första raden i turordningen." @@ -9715,30 +7591,17 @@ msgstr "Använda intressepunkter för att generera en asymmetrisk matris." msgid "To generate an asymmetric matrix:" msgstr "För att generera en asymmetrisk matris:" -msgid "" -"**Line 4** The ``side`` information of ``pointsOfInterset`` is ignored by " -"not including it in the query" -msgstr "" -"**Linje 4** Informationen om ``sidan`` av ``pointsOfInterset`` ignoreras " -"genom att inte inkludera den i frågan" +msgid "**Line 4** The ``side`` information of ``pointsOfInterset`` is ignored by not including it in the query" +msgstr "**Linje 4** Informationen om ``sidan`` av ``pointsOfInterset`` ignoreras genom att inte inkludera den i frågan" msgid "**Line 6** Generating an asymmetric matrix with ``directed => true``" -msgstr "" -"**Linje 6** Generering av en asymmetrisk matris med ``directed => true``" +msgstr "**Linje 6** Generering av en asymmetrisk matris med ``directed => true``" -msgid "" -":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered as " -"the ``agg_cost``" -msgstr "" -":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered as " -"the ``agg_cost``" +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))` is going to be considered as the ``agg_cost``" -msgid "" -"The solution that can be larger than *twice as long as the optimal tour* " -"because:" -msgstr "" -"Lösningen som kan vara större än *dubbelt så lång som den optimala turen* " -"eftersom:" +msgid "The solution that can be larger than *twice as long as the optimal tour* because:" +msgstr "Lösningen som kan vara större än *dubbelt så lång som den optimala turen* eftersom:" msgid "Triangle inequality might not be satisfied." msgstr "Triangelns ojämlikhet kanske inte uppfylls." @@ -9749,19 +7612,11 @@ msgstr "``start_id != 0 AND end_id != 0``" msgid "Connected incomplete data" msgstr "Anslutna ofullständiga data" -msgid "" -"Using selected edges :math:`\\{2, 4, 5, 8, 9, 15\\}` the matrix is not " -"complete." -msgstr "" -"Med hjälp av valda kanter :math:`\\{2, 4, 5, 8, 9, 15\\}` är matrisen inte " -"komplett." +msgid "Using selected edges :math:`\\{2, 4, 5, 8, 9, 15\\}` the matrix is not complete." +msgstr "Med hjälp av valda kanter :math:`\\{2, 4, 5, 8, 9, 15\\}` är matrisen inte komplett." -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 "" -"Kostnadsvärdet för :math:`17 \\rightarrow 10` finns inte i matrisen, men det " -"värde som används hämtas från :math:`10 \\rightarrow 17`." +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 "Kostnadsvärdet för :math:`17 \\rightarrow 10` finns inte i matrisen, men det värde som används hämtas från :math:`10 \\rightarrow 17`." msgid "``pgr_TSPeuclidean``" msgstr "``pgr_TSPeuclidean``" @@ -9769,12 +7624,8 @@ msgstr "``pgr_TSPeuclidean``" msgid "``pgr_TSPeuclidean`` - Approximation using *metric* algorithm." msgstr "``pgr_TSPeuclidean`` - Approximation med hjälp av *metrisk* algoritm." -msgid "" -"Using `Boost: metric TSP approx `__" -msgstr "" -"Använda `Boost: metrisk TSP ca `__" +msgid "Using `Boost: metric TSP approx `__" +msgstr "Använda `Boost: metrisk TSP ca `__" msgid "Name change from pgr_eucledianTSP" msgstr "Namnändring från pgr_eucledianTSP" @@ -9783,22 +7634,15 @@ msgid "New official function." msgstr "Ny officiell funktion." msgid "Results change depending on input order of the `Coordinates SQL`_" -msgstr "" -"Resultaten ändras beroende på inmatningsordningen för `Koordinater SQL`_" +msgstr "Resultaten ändras beroende på inmatningsordningen för `Koordinater SQL`_" -msgid "" -"Any duplicated identifier will be ignored. The coordinates that will be kept " -"is arbitrarily." -msgstr "" -"Alla duplicerade identifierare kommer att ignoreras. De koordinater som " -"kommer att behållas är godtyckliga." +msgid "Any duplicated identifier will be ignored. The coordinates that will be kept is arbitrarily." +msgstr "Alla duplicerade identifierare kommer att ignoreras. De koordinater som kommer att behållas är godtyckliga." -msgid "" -"The coordinates are quite similar for the same identifier, for example ::" +msgid "The coordinates are quite similar for the same identifier, for example ::" msgstr "Koordinaterna är ganska lika för samma identifierare, till exempel ::" -msgid "" -"The coordinates are quite different for the same identifier, for example ::" +msgid "The coordinates are quite different for the same identifier, for example ::" msgstr "Koordinaterna är helt olika för samma identifierare, till exempel ::" msgid "pgr_TSPeuclidean(`Coordinates SQL`_, ``[start_id, end_id]``)" @@ -9831,16 +7675,8 @@ msgstr "Y-värde för koordinaten." msgid "Test 29 cities of Western Sahara" msgstr "Test 29 städer i Västsahara" -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 "" -"I det här exemplet visas hur man gör prestandatester med hjälp av University " -"of Waterloos \"exempeldata\" `__ med hjälp av de 29 städerna i \"Västsaharas dataset\" " -"`__" +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 "I det här exemplet visas hur man gör prestandatester med hjälp av University of Waterloos \"exempeldata\" `__ med hjälp av de 29 städerna i \"Västsaharas dataset\" `__" msgid "Creating a table for the data and storing the data" msgstr "Skapa en tabell för data och lagra data" @@ -9851,12 +7687,8 @@ msgstr "Lägga till en geometri (för visuella ändamål)" msgid "Total tour cost" msgstr "Total kostnad för resan" -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 "" -"Få en total kostnad för turnén, jämför värdet med längden på en optimal " -"turné är 27603, givet på datasetet" +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 "Få en total kostnad för turnén, jämför värdet med längden på en optimal turné är 27603, givet på datasetet" msgid "Getting a geometry of the tour" msgstr "Att få en geometri av turen" @@ -9864,14 +7696,8 @@ msgstr "Att få en geometri av turen" msgid "Visual results" msgstr "Visuella resultat" -msgid "" -"Visually, The first image is the `optimal solution `__ and the second image is the solution " -"obtained with ``pgr_TSPeuclidean``." -msgstr "" -"Visuellt, Den första bilden är den `optimala lösningen `__ och den andra bilden är den lösning " -"som erhållits med ``pgr_TSPeuclidean``." +msgid "Visually, The first image is the `optimal solution `__ and the second image is the solution obtained with ``pgr_TSPeuclidean``." +msgstr "Visuellt, Den första bilden är den `optimala lösningen `__ och den andra bilden är den lösning som erhållits med ``pgr_TSPeuclidean``." msgid "``pgr_aStar`` — Shortest path using the A* algorithm." msgstr "``pgr_aStar`` - Kortaste vägen med hjälp av A*-algoritmen." @@ -9909,12 +7735,8 @@ msgstr "pgr_aStar(Many to Many)" msgid "Signature change on pgr_aStar(One to One)" msgstr "Ändring av signatur på pgr_aStar(One to One)" -msgid "" -"The results are equivalent to the union of the results of the `pgr_aStar(` " -"`One to One`_ `)` on the:" -msgstr "" -"Resultaten är likvärdiga med sammanslagningen av resultaten från " -"`pgr_aStar(` `One to One`_ `)` på :" +msgid "The results are equivalent to the union of the results of the `pgr_aStar(` `One to One`_ `)` on the:" +msgstr "Resultaten är likvärdiga med sammanslagningen av resultaten från `pgr_aStar(` `One to One`_ `)` på :" msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" msgstr "pgr_aStar(`Kanter SQL`_, **start vid**, **end vid**, [**options**])" @@ -9938,41 +7760,22 @@ msgid "Returns set of |short-generic-result|" msgstr "Returnerar uppsättning av |short-generic-result|" msgid "Optional parameters are `named parameters` and have a default value." -msgstr "" -"Valfria parametrar är \"namngivna parametrar\" och har ett standardvärde." +msgstr "Valfria parametrar är \"namngivna parametrar\" och har ett standardvärde." -msgid "" -"From vertex :math:`6` to vertex :math:`12` on a **directed** graph with " -"heuristic :math:`2`" -msgstr "" -"Från toppunkt :math:`6` till toppunkt :math:`12` på en **riktad** graf med " -"heuristik :math:`2`" +msgid "From vertex :math:`6` to vertex :math:`12` on a **directed** graph with heuristic :math:`2`" +msgstr "Från toppunkt :math:`6` till toppunkt :math:`12` på en **riktad** graf med heuristik :math:`2`" -msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 12\\}` on a **directed** " -"graph with heuristic :math:`3` and factor :math:`3.5`" -msgstr "" -"Från toppunkten :math:`6` till toppunkterna :math:`\\{10, 12\\}` på en " -"**riktad** graf med heuristiken :math:`3` och faktorn :math:`3.5`" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 12\\}` on a **directed** graph with heuristic :math:`3` and factor :math:`3.5`" +msgstr "Från toppunkten :math:`6` till toppunkterna :math:`\\{10, 12\\}` på en **riktad** graf med heuristiken :math:`3` och faktorn :math:`3.5`" -msgid "" -"From vertices :math:`\\{6, 8\\}` to vertex :math:`10` on an **undirected** " -"graph with heuristic :math:`4`" -msgstr "" -"Från topparna :math:`\\{6, 8\\}` till topp :math:`10` på en **omdirigerad** " -"graf med heuristiken :math:`4`" +msgid "From vertices :math:`\\{6, 8\\}` to vertex :math:`10` on an **undirected** graph with heuristic :math:`4`" +msgstr "Från topparna :math:`\\{6, 8\\}` till topp :math:`10` på en **omdirigerad** graf med heuristiken :math:`4`" -msgid "" -"From vertices :math:`\\{6, 8\\}` to vertices :math:`\\{10, 12\\}` on a " -"**directed** graph with factor :math:`0.5`" -msgstr "" -"Från topparna :math:`\\{6, 8\\}` till topparna :math:`\\{10, 12\\}` på en " -"**riktad** graf med faktorn :math:`0.5`" +msgid "From vertices :math:`\\{6, 8\\}` to vertices :math:`\\{10, 12\\}` on a **directed** graph with factor :math:`0.5`" +msgstr "Från topparna :math:`\\{6, 8\\}` till topparna :math:`\\{10, 12\\}` på en **riktad** graf med faktorn :math:`0.5`" -msgid "" -"Using a combinations table on a **directed** graph with factor :math:`0.5`." -msgstr "" -"Använda en kombinationstabell på en **riktad** graf med faktor :math:`0.5`." +msgid "Using a combinations table on a **directed** graph with factor :math:`0.5`." +msgstr "Använda en kombinationstabell på en **riktad** graf med faktor :math:`0.5`." msgid "Example 1" msgstr "Exempel 1" @@ -9995,10 +7798,8 @@ msgstr "Manuellt tilldelade toppunktskombinationer." msgid "``pgr_aStarCost``" msgstr "``pgr_aStarCost``" -msgid "" -"``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." -msgstr "" -"``pgr_aStarCost`` - Totalkostnad för den kortaste vägen med A*-algoritmen." +msgid "``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." +msgstr "``pgr_aStarCost`` - Totalkostnad för den kortaste vägen med A*-algoritmen." msgid "pgr_aStarCost(Combinations)" msgstr "pgr_aStarCost(Combinations)" @@ -10006,17 +7807,11 @@ msgstr "pgr_aStarCost(Combinations)" msgid "New proposed function." msgstr "Ny föreslagen funktion." -msgid "" -"The ``pgr_aStarCost`` function summarizes the cost of the shortest path " -"using the A* algorithm." +msgid "The ``pgr_aStarCost`` function summarizes the cost of the shortest path using the A* algorithm." msgstr "Funktionen ``pgr_aStarCost`` sammanfattar kostnaden för den kortaste vägen med hjälp av A*-algoritmen." -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 "" -"Låt oss anta att de returnerade värdena lagras i en tabell, så det unika " -"indexet skulle vara paret: `(start_vid, end_vid)`" +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 "Låt oss anta att de returnerade värdena lagras i en tabell, så det unika indexet skulle vara paret: `(start_vid, end_vid)`" msgid "For undirected graphs, the results are symmetric." msgstr "För oriktade grafer är resultaten symmetriska." @@ -10031,21 +7826,16 @@ msgid "`end_vid` ascending" msgstr "`end_vid` stigande" msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgstr "" -"pgr_aStarCost(`Kanter SQL`_, **start vid**, **end vid**, [**options**])" +msgstr "pgr_aStarCost(`Kanter SQL`_, **start vid**, **end vid**, [**options**])" msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "" -"pgr_aStarCost(`Kanter SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "pgr_aStarCost(`Kanter SQL`_, **start vid**, **end vids**, [**options**])" msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "" -"pgr_aStarCost(`Kanter SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "pgr_aStarCost(`Kanter SQL`_, **start vids**, **end vid**, [**options**])" -msgid "" -"pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "" -"pgr_aStarCost(`Kanter SQL`_, **start vids**, **end vids**, [**options**])" +msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "pgr_aStarCost(`Kanter SQL`_, **start vids**, **end vids**, [**options**])" msgid "pgr_aStarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "pgr_aStarCost(`Kanter SQL`_, `Combinations SQL`_, [**options**])" @@ -10059,12 +7849,8 @@ msgstr "pgr_aStarCost(`Kanter SQL`_, **start vids**, **end vids**, [options])" msgid "``pgr_aStarCostMatrix``" msgstr "``pgr_aStarCostMatrix``" -msgid "" -"``pgr_aStarCostMatrix`` - Calculates the a cost matrix using :doc:" -"`pgr_aStar`." -msgstr "" -"``pgr_aStarCostMatrix`` - Beräknar en kostnadsmatris med hjälp av :doc:" -"`pgr_aStar`." +msgid "``pgr_aStarCostMatrix`` - Calculates the a cost matrix using :doc:`pgr_aStar`." +msgstr "``pgr_aStarCostMatrix`` - Beräknar en kostnadsmatris med hjälp av :doc:`pgr_aStar`." msgid "Using internally the :doc:`pgr_aStar` algorithm" msgstr "Intern användning av :doc:`pgr_aStar`-algoritmen" @@ -10096,12 +7882,8 @@ msgstr "När grafen är **icke-riktad** är kostnadsmatrisen symmetrisk" msgid "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" msgstr "pgr_aStarCostMatrix(`Kanter SQL`_, **start vids**, [**options**])" -msgid "" -"Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an " -"**undirected** graph using heuristic :math:`2`" -msgstr "" -"Symmetrisk kostnadsmatris för topparna :math:`\\{5, 6, 10, 15\\}` på en " -"**omdirigerad** graf med heuristiken :math:`2`" +msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph using heuristic :math:`2`" +msgstr "Symmetrisk kostnadsmatris för topparna :math:`\\{5, 6, 10, 15\\}` på en **omdirigerad** graf med heuristiken :math:`2`" msgid "Use with :doc:`pgr_TSP`" msgstr "Använd med :doc:`pgr_TSP`" @@ -10109,12 +7891,8 @@ msgstr "Använd med :doc:`pgr_TSP`" msgid "``pgr_articulationPoints``" msgstr "``pgr_articulationPoints``" -msgid "" -"``pgr_articulationPoints`` - Return the articulation points of an undirected " -"graph." -msgstr "" -"``pgr_articulationPoints`` - Returnerar artikulationspunkterna i en " -"odränerad graf." +msgid "``pgr_articulationPoints`` - Return the articulation points of an undirected graph." +msgstr "``pgr_articulationPoints`` - Returnerar artikulationspunkterna i en odränerad graf." msgid "Result columns change: ``seq`` is removed" msgstr "Ändring av resultatkolumner: ``seq`` tas bort" @@ -10122,17 +7900,8 @@ msgstr "Ändring av resultatkolumner: ``seq`` tas bort" msgid "Version 2.5.0" msgstr "Version 2.5.0" -msgid "" -"Those vertices that belong to more than one biconnected component are called " -"articulation points or, equivalently, cut vertices. Articulation points are " -"vertices whose removal would increase the number of connected components in " -"the graph. This implementation can only be used with an undirected graph." -msgstr "" -"De hörn som tillhör mer än en biconnected komponent kallas " -"artikulationspunkter eller, på motsvarande sätt, cut vertices. " -"Artikulationspunkter är hörn vars borttagning skulle öka antalet anslutna " -"komponenter i grafen. Denna implementation kan endast användas med en odelad " -"graf." +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 "De hörn som tillhör mer än en biconnected komponent kallas artikulationspunkter eller, på motsvarande sätt, cut vertices. Artikulationspunkter är hörn vars borttagning skulle öka antalet anslutna komponenter i grafen. Denna implementation kan endast användas med en odelad graf." msgid "Works for **undirected** graphs." msgstr "Fungerar för **undirected** grafer." @@ -10158,19 +7927,11 @@ msgstr "Rödmarkerade noder är artikulationspunkterna." msgid "Identifier of the vertex." msgstr "Identifierare för toppunkten." -msgid "" -"`Boost: Biconnected components & articulation points `__" -msgstr "" -"`Boost: Biconnected komponenter & ledpunkter `__" +msgid "`Boost: Biconnected components & articulation points `__" +msgstr "`Boost: Biconnected komponenter & ledpunkter `__" -msgid "" -"wikipedia: `Biconnected component `__" -msgstr "" -"wikipedia: `Sammankopplad komponent `__" +msgid "wikipedia: `Biconnected component `__" +msgstr "wikipedia: `Sammankopplad komponent `__" msgid "``pgr_bandwidth`` - Experimental" msgstr "``pgr_bandbredd`` - Experimentell" @@ -10178,14 +7939,10 @@ msgstr "``pgr_bandbredd`` - Experimentell" msgid "``pgr_bandwidth`` - Calculates the bandwidth of the graph" msgstr "``pgr_bandwidth`` - Beräknar grafens bandbredd" -msgid "" -"Bandwidth measures how \"spread out\" the connections are in a graph when " -"vertices are arranged in a linear order (like numbering them 1, 2, 3, etc.)." +msgid "Bandwidth measures how \"spread out\" the connections are in a graph when vertices are arranged in a linear order (like numbering them 1, 2, 3, etc.)." msgstr "Bandbredden mäter hur \"utspridda\" kopplingarna är i en graf när hörnen är ordnade i en linjär ordning (som att numrera dem 1, 2, 3 osv.)." -msgid "" -"For each edge in the graph, calculate the distance between the vertex " -"numbers it connects" +msgid "For each edge in the graph, calculate the distance between the vertex numbers it connects" msgstr "För varje kant i grafen, beräkna avståndet mellan de toppunktsnummer som den ansluter till" msgid "The bandwidth is the maximum of all these distances" @@ -10221,17 +7978,14 @@ msgstr "Oriktad graf med kanter före optimering." msgid "Undirected graph with edges after optimization." msgstr "Oriktad graf med kanter efter optimering." -msgid "" -"`Boost: bandwidth `_" +msgid "`Boost: bandwidth `_" msgstr "`Boost: bandbredd `_" msgid "``pgr_bdAstar``" msgstr "``pgr_bdAstar``" msgid "``pgr_bdAstar`` — Shortest path using the bidirectional A* algorithm." -msgstr "" -"``pgr_bdAstar`` - Kortaste vägen med hjälp av den dubbelriktade A*-" -"algoritmen." +msgstr "``pgr_bdAstar`` - Kortaste vägen med hjälp av den dubbelriktade A*-algoritmen." msgid "pgr_bdAstar(One to One) added ``start_vid`` and ``end_vid`` columns." msgstr "pgr_bdAstar(One to One) added ``start_vid`` and ``end_vid`` columns." @@ -10257,9 +8011,7 @@ msgstr "pgr_bdAstar(Many to Many)" msgid "Signature change on pgr_bdAstar(One to One)" msgstr "Ändring av signatur på pgr_bdAstar(One to One)" -msgid "" -"The results are equivalent to the union of the results of pgr_bdAStar(One to " -"One) on the:" +msgid "The results are equivalent to the union of the results of pgr_bdAStar(One to One) on the:" msgstr "Resultaten är likvärdiga med sammanslagningen av resultaten av pgr_bdAStar(One to One) på:" msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" @@ -10272,8 +8024,7 @@ msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "pgr_bdAstar(`Kanter SQL`_, **start vids**, **end vid**, [**options**])" msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "" -"pgr_bdAstar(`Kanter SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "pgr_bdAstar(`Kanter SQL`_, **start vids**, **end vids**, [**options**])" msgid "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "pgr_bdAstar(`Kanter SQL`_, `Combinations SQL`_, [**options**])" @@ -10281,40 +8032,26 @@ msgstr "pgr_bdAstar(`Kanter SQL`_, `Combinations SQL`_, [**options**])" msgid "``pgr_bdAstarCost``" msgstr "``pgr_bdAstarCost``" -msgid "" -"``pgr_bdAstarCost`` - Total cost of the shortest path using the " -"bidirectional A* algorithm." -msgstr "" -"``pgr_bdAstarCost`` - Totalkostnad för den kortaste vägen med hjälp av den " -"dubbelriktade A*-algoritmen." +msgid "``pgr_bdAstarCost`` - Total cost of the shortest path using the bidirectional A* algorithm." +msgstr "``pgr_bdAstarCost`` - Totalkostnad för den kortaste vägen med hjälp av den dubbelriktade A*-algoritmen." msgid "pgr_bdAstarCost(Combinations)" msgstr "pgr_bdAstarCost(Combinations)" -msgid "" -"The ``pgr_bdAstarCost`` function summarizes the cost of the shortest path " -"using the bidirectional A* algorithm." +msgid "The ``pgr_bdAstarCost`` function summarizes the cost of the shortest path using the bidirectional A* algorithm." msgstr "Funktionen ``pgr_bdAstarCost`` sammanfattar kostnaden för den kortaste vägen med hjälp av den dubbelriktade A*-algoritmen." -msgid "" -"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgstr "" -"pgr_bdAstarCost(`Kanter SQL`_, **start vid**, **end vid**, [**options**])" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgstr "pgr_bdAstarCost(`Kanter SQL`_, **start vid**, **end vid**, [**options**])" -msgid "" -"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "" -"pgr_bdAstarCost(`Kanter SQL`_, **start vid**, **end vids**, [**options**])" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "pgr_bdAstarCost(`Kanter SQL`_, **start vid**, **end vids**, [**options**])" -msgid "" -"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "" -"pgr_bdAstarCost(`Kanter SQL`_, **start vids**, **end vid**, [**options**])" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "pgr_bdAstarCost(`Kanter SQL`_, **start vids**, **end vid**, [**options**])" -msgid "" -"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "" -"pgr_bdAstarCost(`Kanter SQL`_, **start vids**, **end vids**, [**options**])" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "pgr_bdAstarCost(`Kanter SQL`_, **start vids**, **end vids**, [**options**])" msgid "pgr_bdAstarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "pgr_bdAstarCost(`Kanter SQL`_, `Combinations SQL`_, [**options**])" @@ -10322,9 +8059,7 @@ msgstr "pgr_bdAstarCost(`Kanter SQL`_, `Combinations SQL`_, [**options**])" msgid "``pgr_bdAstarCostMatrix``" msgstr "``pgr_bdAstarCostMatrix``" -msgid "" -"``pgr_bdAstarCostMatrix`` - Calculates the cost matrix using :doc:" -"`pgr_bdAstar`." +msgid "``pgr_bdAstarCostMatrix`` - Calculates the cost matrix using :doc:`pgr_bdAstar`." msgstr "``pgr_bdAstarCostMatrix`` - Beräknar kostnadsmatrisen med hjälp av :doc:`pgr_bdAstar`." msgid "Internally uses the :doc:`pgr_bdAstar` algorithm." @@ -10333,12 +8068,8 @@ msgstr "Internt används algoritmen :doc:`pgr_bdAstar`." msgid "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" msgstr "pgr_bdAstarCostMatrix(`Kanter SQL`_, **start vids**, [**options**])" -msgid "" -"``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra " -"algorithm." -msgstr "" -"``pgr_bdDijkstra`` - Returnerar den kortaste vägen med hjälp av " -"Bidirectional Dijkstra-algoritmen." +msgid "``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra algorithm." +msgstr "``pgr_bdDijkstra`` - Returnerar den kortaste vägen med hjälp av Bidirectional Dijkstra-algoritmen." msgid "pgr_bdDijkstra(Combinations)" msgstr "pgr_bdDijkstra(Combinations)" @@ -10355,51 +8086,32 @@ msgstr "pgr_bdDijkstra(Many to Many)" msgid "Signature change on pgr_bdDijkstra(One to One)" msgstr "Ändring av signatur på pgr_bdDijkstra(One to One)" -msgid "" -"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "" -"pgr_bdDijkstra(`Kanter SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_bdDijkstra(`Kanter SQL`_, **start vid**, **end vid**, [``directed``])" -msgid "" -"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "" -"pgr_bdDijkstra(`Kanter SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_bdDijkstra(`Kanter SQL`_, **start vid**, **end vids**, [``directed``])" -msgid "" -"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "" -"pgr_bdDijkstra(`Kanter SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_bdDijkstra(`Kanter SQL`_, **start vids**, **end vid**, [``directed``])" -msgid "" -"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "" -"pgr_bdDijkstra(`Kanter SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_bdDijkstra(`Kanter SQL`_, **start vids**, **end vids**, [``directed``])" msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "pgr_bdDijkstra(`Kanter SQL`_, `Combinations SQL`_, [``directed``])" msgid "From vertex :math:`6` to vertex :math:`10` on a **directed** graph" -msgstr "" -"Från toppunkten :math:`6` till toppunkten :math:`10` på en **riktad** graf" +msgstr "Från toppunkten :math:`6` till toppunkten :math:`10` på en **riktad** graf" -msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed** " -"graph" -msgstr "" -"Från toppunkten :math:`6` till toppunkterna :math:`\\{10, 17\\}` i en " -"**riktad** graf" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed** graph" +msgstr "Från toppunkten :math:`6` till toppunkterna :math:`\\{10, 17\\}` i en **riktad** graf" -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** graph" -msgstr "" -"Från topparna :math:`\\{6, 1\\}` till topp :math:`17` på en **riktad** graf" +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** graph" +msgstr "Från topparna :math:`\\{6, 1\\}` till topp :math:`17` på en **riktad** graf" -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an " -"**undirected** graph" -msgstr "" -"Från topparna :math:`{6, 1\\}` till topparna :math:`{10, 17\\}` på en " -"**omdirigerad** graf" +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an **undirected** graph" +msgstr "Från topparna :math:`{6, 1\\}` till topparna :math:`{10, 17\\}` på en **omdirigerad** graf" msgid "Using a combinations table on an **undirected** graph" msgstr "Använda en kombinationstabell i en **icke-riktad** graf" @@ -10410,50 +8122,29 @@ msgstr "https://en.wikipedia.org/wiki/Bidirectional_search" msgid "``pgr_bdDijkstraCost``" msgstr "``pgr_bdDijkstraCost``" -msgid "" -"``pgr_bdDijkstraCost`` — Returns the shortest path's cost using " -"Bidirectional Dijkstra algorithm." -msgstr "" -"``pgr_bdDijkstraCost`` - Returnerar den kortaste vägens kostnad med hjälp av " -"Bidirectional Dijkstra-algoritmen." +msgid "``pgr_bdDijkstraCost`` — Returns the shortest path's cost using Bidirectional Dijkstra algorithm." +msgstr "``pgr_bdDijkstraCost`` - Returnerar den kortaste vägens kostnad med hjälp av Bidirectional Dijkstra-algoritmen." msgid "pgr_bdDijkstraCost(Combinations)" msgstr "pgr_bdDijkstraCost(Combinations)" -msgid "" -"The ``pgr_bdDijkstraCost`` function summarizes the cost of the shortest path " -"using the bidirectional Dijkstra Algorithm." +msgid "The ``pgr_bdDijkstraCost`` function summarizes the cost of the shortest path using the bidirectional Dijkstra Algorithm." msgstr "Funktionen ``pgr_bdDijkstraCost`` sammanfattar kostnaden för den kortaste vägen med hjälp av den dubbelriktade Dijkstra-algoritmen." -msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" -msgstr "" -"pgr_bdDijkstraCost(`Kanter SQL`_, **start vid**, **end vid** , " -"[``directed``])" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" +msgstr "pgr_bdDijkstraCost(`Kanter SQL`_, **start vid**, **end vid** , [``directed``])" -msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "" -"pgr_bdDijkstraCost(`Kanter SQL`_, **start vid**, **end vids**, " -"[``directed``])" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_bdDijkstraCost(`Kanter SQL`_, **start vid**, **end vids**, [``directed``])" -msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , " -"[``directed``])" -msgstr "" -"pgr_bdDijkstraCost(`Kanter SQL`_, **start vids**, **end vid** , " -"[``directed``])" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , [``directed``])" +msgstr "pgr_bdDijkstraCost(`Kanter SQL`_, **start vids**, **end vid** , [``directed``])" -msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" -msgstr "" -"pgr_bdDijkstraCost(`Kanter SQL`_, **start vids**, **end vids**, " -"[``directed``])" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_bdDijkstraCost(`Kanter SQL`_, **start vids**, **end vids**, [``directed``])" msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [ ``directed``])" -msgstr "" -"pgr_bdDijkstraCost(`Kanter SQL`_, `Combinations SQL`_, [ ``directed``])" +msgstr "pgr_bdDijkstraCost(`Kanter SQL`_, `Combinations SQL`_, [ ``directed``])" msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "pgr_bdDijkstraCost(`Kanter SQL`_, `Combinations SQL`_, [``directed``])" @@ -10461,34 +8152,23 @@ msgstr "pgr_bdDijkstraCost(`Kanter SQL`_, `Combinations SQL`_, [``directed``])" msgid "``pgr_bdDijkstraCostMatrix``" msgstr "``pgr_bdDijkstraCostMatrix``" -msgid "" -"``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using :doc:" -"`pgr_bdDijkstra`." -msgstr "" -"``pgr_bdDijkstraCostMatrix`` - Beräknar en kostnadsmatris med hjälp av :doc:" -"`pgr_bdDijkstra`." +msgid "``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_bdDijkstra`." +msgstr "``pgr_bdDijkstraCostMatrix`` - Beräknar en kostnadsmatris med hjälp av :doc:`pgr_bdDijkstra`." -msgid "" -"Using bidirectional Dijkstra algorithm, calculate and return a cost matrix." -msgstr "" -"Beräkna och returnera en kostnadsmatris med hjälp av den dubbelriktade " -"Dijkstra-algoritmen." +msgid "Using bidirectional Dijkstra algorithm, calculate and return a cost matrix." +msgstr "Beräkna och returnera en kostnadsmatris med hjälp av den dubbelriktade Dijkstra-algoritmen." msgid "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" -msgstr "" -"pgr_bdDijkstraCostMatrix(`Kanter SQL`_, **start vids**, [``directed``])" +msgstr "pgr_bdDijkstraCostMatrix(`Kanter SQL`_, **start vids**, [``directed``])" -msgid "" -"Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an " -"**undirected** graph" -msgstr "" -"Symmetrisk kostnadsmatris för toppar :math:`{\\5, 6, 10, 15\\}` på en " -"**omdirigerad** graf" +msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph" +msgstr "Symmetrisk kostnadsmatris för toppar :math:`{\\5, 6, 10, 15\\}` på en **omdirigerad** graf" msgid "Use with :doc:`pgr_TSP`." msgstr "Använd med :doc:`pgr_TSP`." -msgid "``pgr_bellmanFord - Experimental``" +#, fuzzy +msgid "``pgr_bellmanFord`` - Experimental" msgstr "``pgr_bellmanFord - Experimentell``" msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm." @@ -10497,116 +8177,59 @@ msgstr "``pgr_bellmanFord`` - Kortaste vägen med Bellman-Ford algoritm." msgid "pgr_bellmanFord(Combinations)" msgstr "pgr_bellmanFord(Combinations)" -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 "" -"Bellman-Fords algoritm är uppkallad efter Richard Bellman och Lester Ford, " -"som först publicerade den 1958 respektive 1956. Det är en algoritm för " -"grafsökning som beräknar kortaste vägar från en startpunkt (``start_vid``) " -"till en slutpunkt (``end_vid``) i en graf där vissa av kantvikterna kan vara " -"negativa. Även om den är mer mångsidig är den långsammare än Dijkstras " -"algoritm. Den här implementeringen kan användas med en riktad graf och en " -"oriktad graf." +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 "Bellman-Fords algoritm är uppkallad efter Richard Bellman och Lester Ford, som först publicerade den 1958 respektive 1956. Det är en algoritm för grafsökning som beräknar kortaste vägar från en startpunkt (``start_vid``) till en slutpunkt (``end_vid``) i en graf där vissa av kantvikterna kan vara negativa. Även om den är mer mångsidig är den långsammare än Dijkstras algoritm. Den här implementeringen kan användas med en riktad graf och en oriktad graf." -msgid "" -"Process is valid for edges with both positive and negative edge weights." -msgstr "" -"Processen är giltig för kanter med både positiva och negativa kantvikter." +msgid "Process is valid for edges with both positive and negative edge weights." +msgstr "Processen är giltig för kanter med både positiva och negativa kantvikter." -msgid "" -"When the start vertex and the end vertex are the same, there is no path. The " -"agg_cost would be :math:`0`." -msgstr "" -"När startvertex och slutvertex är desamma finns det ingen väg. Agg_cost " -"skulle vara :math:`0`." +msgid "When the start vertex and the end vertex are the same, there is no path. The agg_cost would be :math:`0`." +msgstr "När startvertex och slutvertex är desamma finns det ingen väg. Agg_cost skulle vara :math:`0`." -msgid "" -"When the start vertex and the end vertex are different, and there exists a " -"path between them without having a *negative cycle*. The agg_cost would be " -"some finite value denoting the shortest distance between them." -msgstr "" -"När startvertex och slutvertex är olika, och det finns en väg mellan dem " -"utan att ha en *negativ cykel*. Agg_cost skulle vara ett ändligt värde som " -"anger det kortaste avståndet mellan dem." +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 "När startvertex och slutvertex är olika, och det finns en väg mellan dem utan att ha en *negativ cykel*. Agg_cost skulle vara ett ändligt värde som anger det kortaste avståndet mellan dem." -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 "" -"När startpunkten och slutpunkten är olika, och det finns en väg mellan dem, " -"men den innehåller en *negativ cykel*. I sådana fall fortsätter agg_cost för " -"dessa toppar att minska och därför kan agg_cost inte definieras för dem." +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 "När startpunkten och slutpunkten är olika, och det finns en väg mellan dem, men den innehåller en *negativ cykel*. I sådana fall fortsätter agg_cost för dessa toppar att minska och därför kan agg_cost inte definieras för dem." -msgid "" -"When the start vertex and the end vertex are different, and there is no " -"path. The agg_cost is :math:`\\infty`." -msgstr "" -"När startvertex och slutvertex är olika och det inte finns någon väg. " -"Agg_cost är :math:`\\infty`." +msgid "When the start vertex and the end vertex are different, and there is no path. The agg_cost is :math:`\\infty`." +msgstr "När startvertex och slutvertex är olika och det inte finns någon väg. Agg_cost är :math:`\\infty`." -msgid "" -"For optimization purposes, any duplicated value in the `start_vids` or " -"`end_vids` are ignored." -msgstr "" -"För optimeringsändamål ignoreras alla duplicerade värden i `start_vids` " -"eller `end_vids`." +msgid "For optimization purposes, any duplicated value in the `start_vids` or `end_vids` are ignored." +msgstr "För optimeringsändamål ignoreras alla duplicerade värden i `start_vids` eller `end_vids`." msgid "Running time: :math:`O(| start\\_vids | * ( V * E))`" msgstr "Speltid: :math:`O(| start\\_vids | * ( V * E))`" -msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "" -"pgr_bellmanFord(`Kanter SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_bellmanFord(`Kanter SQL`_, **start vid**, **end vid**, [``directed``])" -msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "" -"pgr_bellmanFord(`Kanter SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_bellmanFord(`Kanter SQL`_, **start vid**, **end vids**, [``directed``])" -msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "" -"pgr_bellmanFord(`Kanter SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_bellmanFord(`Kanter SQL`_, **start vids**, **end vid**, [``directed``])" -msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "" -"pgr_bellmanFord(`Kanter SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_bellmanFord(`Kanter SQL`_, **start vids**, **end vids**, [``directed``])" msgid "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "pgr_bellmanFord(`Kanter SQL`_, `Combinations SQL`_, [``directed``])" -msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph" msgstr "Från toppunkten :math:`6` till toppunkterna :math:`\\{10, 17\\}` i en riktad graf" -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph" +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph" msgstr "Från topparna :math:`\\{6, 1\\}` till topparna :math:`17` i en riktad graf" -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an " -"undirected graph" +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an undirected graph" msgstr "Från hörn :math:`\\{6, 1\\}` till hörn :math:`\\{10, 17\\}` på en odelad graf" msgid "Using a combinations table on an undirected graph" msgstr "Använda en kombinationstabell på en ostyrd graf" -msgid "" -"`Boost: Bellman Ford `__" -msgstr "" -"`Boost: Bellman Ford `__" +msgid "`Boost: Bellman Ford `__" +msgstr "`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" @@ -10614,40 +8237,20 @@ msgstr "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" msgid "``pgr_betweennessCentrality`` - Experimental" msgstr "``pgr_betweennessCentrality`` - Experimentell" -msgid "" -"``pgr_betweennessCentrality`` - Calculates the relative betweenness " -"centrality using Brandes Algorithm" -msgstr "" -"``pgr_betweennessCentrality`` - Beräknar den relativa betweenness-" -"centraliteten med hjälp av Brandes-algoritmen" +msgid "``pgr_betweennessCentrality`` - Calculates the relative betweenness centrality using Brandes Algorithm" +msgstr "``pgr_betweennessCentrality`` - Beräknar den relativa betweenness-centraliteten med hjälp av Brandes-algoritmen" msgid "Version 3.7.0" msgstr "Version 3.7.0" -msgid "" -"The Brandes Algorithm takes advantage of the sparse graphs for evaluating " -"the betweenness centrality score of all vertices." -msgstr "" -"Brandes-algoritmen utnyttjar de glesa graferna för att utvärdera betweenness " -"centrality-punkten för alla hörn." +msgid "The Brandes Algorithm takes advantage of the sparse graphs for evaluating the betweenness centrality score of all vertices." +msgstr "Brandes-algoritmen utnyttjar de glesa graferna för att utvärdera betweenness centrality-punkten för alla hörn." -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 "" -"Betweenness centrality mäter i vilken utsträckning en toppunkt ligger på de " -"kortaste vägarna mellan alla andra par av toppunkter. Toppar med en hög " -"betweenness centrality-punkt kan ha ett betydande inflytande i ett nätverk " -"genom att de kontrollerar de kortaste vägarna mellan dem." +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 "Betweenness centrality mäter i vilken utsträckning en toppunkt ligger på de kortaste vägarna mellan alla andra par av toppunkter. Toppar med en hög betweenness centrality-punkt kan ha ett betydande inflytande i ett nätverk genom att de kontrollerar de kortaste vägarna mellan dem." -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 "" -"Om dessa toppar tas bort påverkas nätverket genom att det störs, eftersom de " -"flesta av de kortaste vägarna mellan topparna passerar genom dem." +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 "Om dessa toppar tas bort påverkas nätverket genom att det störs, eftersom de flesta av de kortaste vägarna mellan topparna passerar genom dem." msgid "This implementation work for both directed and undirected graphs." msgstr "Denna implementering fungerar för både riktade och oriktade grafer." @@ -10679,12 +8282,8 @@ msgstr "Betweenness Centrality anges inom parentes." msgid "The leaf vertices have betweenness centrality :math:`0`." msgstr "Bladkärnorna har betweenness centrality :math:`0`." -msgid "" -"Betweenness centrality of vertex :math:`6` is higher than of vertex :math:" -"`10`." -msgstr "" -"Betweenness centrality för toppunkten :math:`6` är högre än för toppunkten :" -"math:`10`." +msgid "Betweenness centrality of vertex :math:`6` is higher than of vertex :math:`10`." +msgstr "Betweenness centrality för toppunkten :math:`6` är högre än för toppunkten :math:`10`." msgid "Removing vertex :math:`6` will create three graph components." msgstr "Om du tar bort toppunkten :math:`6` skapas tre grafkomponenter." @@ -10698,27 +8297,17 @@ msgstr "``vid``" msgid "``centrality``" msgstr "``centrality``" -msgid "" -"Relative betweenness centrality score of the vertex (will be in range [0,1])" -msgstr "" -"Relativ betweenness centrality-punkt för vertexet (kommer att ligga inom " -"intervallet [0,1])" +msgid "Relative betweenness centrality score of the vertex (will be in range [0,1])" +msgstr "Relativ betweenness centrality-punkt för vertexet (kommer att ligga inom intervallet [0,1])" -msgid "" -"`Boost: betweenness centrality `_" -msgstr "" -"`Boost: betweenness centrality `_" +msgid "`Boost: betweenness centrality `_" +msgstr "`Boost: betweenness centrality `_" msgid "``pgr_biconnectedComponents``" msgstr "``pgr_biconnectedComponents``" -msgid "" -"``pgr_biconnectedComponents`` — Biconnected components of an undirected " -"graph." -msgstr "" -"``pgr_biconnectedComponents`` - Biconnected-komponenter i en odränerad graf." +msgid "``pgr_biconnectedComponents`` — Biconnected components of an undirected graph." +msgstr "``pgr_biconnectedComponents`` - Biconnected-komponenter i en odränerad graf." msgid "Result columns change:" msgstr "Resultatkolumnerna ändras:" @@ -10729,20 +8318,8 @@ msgstr "``n_seq`` tas bort" msgid "``seq`` changed type to ``BIGINT``" msgstr "``seq`` har ändrat typ till ``BIGINT``" -msgid "" -"The biconnected components of an undirected graph are the maximal subsets of " -"vertices such that the removal of a vertex from particular component will " -"not disconnect the component. Unlike connected components, vertices may " -"belong to multiple biconnected components. Vertices can be present in " -"multiple biconnected components, but each edge can only be contained in a " -"single biconnected component." -msgstr "" -"De biconnected komponenterna i en odelad graf är de maximala delmängderna av " -"hörnpunkter så att borttagandet av en hörnpunkt från en viss komponent inte " -"kommer att koppla bort komponenten. Till skillnad från anslutna komponenter " -"kan toppar tillhöra flera biconnected components. Toppar kan förekomma i " -"flera biconnected components, men varje kant kan bara ingå i en enda " -"biconnected component." +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 "De biconnected komponenterna i en odelad graf är de maximala delmängderna av hörnpunkter så att borttagandet av en hörnpunkt från en viss komponent inte kommer att koppla bort komponenten. Till skillnad från anslutna komponenter kan toppar tillhöra flera biconnected components. Toppar kan förekomma i flera biconnected components, men varje kant kan bara ingå i en enda biconnected component." msgid "Components are described by edges." msgstr "Komponenterna beskrivs med kanter." @@ -10777,128 +8354,62 @@ msgstr "Identifierare av den kant som tillhör ``komponenten``." msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" msgstr "``pgr_binaryBreadthFirstSearch`` - Experimentell" -msgid "" -"``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary " -"graph." -msgstr "" -"``pgr_binaryBreadthFirstSearch`` - Returnerar den kortaste vägen i en binär " -"graf." +msgid "``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary graph." +msgstr "``pgr_binaryBreadthFirstSearch`` - Returnerar den kortaste vägen i en binär graf." -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 "" -"En graf vars kantvikter tillhör uppsättningen {0,X}, där \"X\" är ett icke-" -"negativt heltal, kallas för en \"binär graf\"." +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 "En graf vars kantvikter tillhör uppsättningen {0,X}, där \"X\" är ett icke-negativt heltal, kallas för en \"binär graf\"." msgid "pgr_binaryBreadthFirstSearch(Combinations)" msgstr "pgr_binaryBreadthFirstSearch(Combinations)" -msgid "" -"It is well-known that the shortest paths between a single source and all " -"other vertices can be found using Breadth First Search in :math:`O(|E|)` in " -"an unweighted graph, i.e. the distance is the minimal number of edges that " -"you need to traverse from the source to another vertex. We can interpret " -"such a graph also as a weighted graph, where every edge has the weight :math:" -"`1`. If not all edges in graph have the same weight, then we a more general " -"algorithm is needed, like Dijkstra's Algorithm which runs in :math:`O(|E|log|" -"V|)` time." +msgid "It is well-known that the shortest paths between a single source and all other vertices can be found using Breadth First Search in :math:`O(|E|)` in an unweighted graph, i.e. the distance is the minimal number of edges that you need to traverse from the source to another vertex. We can interpret such a graph also as a weighted graph, where every edge has the weight :math:`1`. If not all edges in graph have the same weight, then we a more general algorithm is needed, like Dijkstra's Algorithm which runs in :math:`O(|E|log|V|)` time." msgstr "Det är välkänt att de kortaste vägarna mellan en enda källa och alla andra toppar kan hittas med hjälp av Breadth First Search på :math:`O(|E|)` i en oviktad graf, dvs. avståndet är det minsta antalet kanter som du behöver korsa från källan till en annan topp. Vi kan också tolka en sådan graf som en viktad graf, där varje kant har vikten :math:`1`. Om inte alla kanter i grafen har samma vikt behövs en mer generell algoritm, som Dijkstras algoritm som går på :math:`O(|E|log|V|)` tid." -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 "" -"Men om vikterna är mer begränsade kan vi använda en snabbare algoritm. Den " -"här algoritmen, som kallas \"Binary Breadth First Search\" eller \"0-1 " -"BFS\", är en variant av standardproblemet Breadth First Search för att lösa " -"SSSP-problemet (kortaste vägen med en källa) på :math:`O(|E|)`, om vikterna " -"för varje kant tillhör uppsättningen {0,X}, där \"X\" är ett icke-negativt " -"heltal." +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 "Men om vikterna är mer begränsade kan vi använda en snabbare algoritm. Den här algoritmen, som kallas \"Binary Breadth First Search\" eller \"0-1 BFS\", är en variant av standardproblemet Breadth First Search för att lösa SSSP-problemet (kortaste vägen med en källa) på :math:`O(|E|)`, om vikterna för varje kant tillhör uppsättningen {0,X}, där \"X\" är ett icke-negativt heltal." -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 "" -"Processen görs endast på \"binära grafer\". ('Binär graf': En graf vars " -"kantvikter tillhör uppsättningen {0,X}, där \"X\" är ett icke-negativt " -"reellt heltal)" +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 "Processen görs endast på \"binära grafer\". ('Binär graf': En graf vars kantvikter tillhör uppsättningen {0,X}, där \"X\" är ett icke-negativt reellt heltal)" msgid "Running time: :math:`O(| start\\_vids | * |E|)`" msgstr "Speltid: :math:`O(| start\\_vids | * |E|)``" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, " -"[``directed``])" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **slut vid**, [``directed``])" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, " -"[``directed``])" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **slut vids**, [``directed``])" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, " -"[``directed``])" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **slut vid**, [``directed``])" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **slut vids**, [``directed``])" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, " -"[``directed``])" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgid "" -"**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :" -"math:`1``)" -msgstr "" -"**Anmärkning:** Använda :doc:`sampledata` Network eftersom alla vikter är " -"desamma (dvs :math:`1``)" +msgid "**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :math:`1``)" +msgstr "**Anmärkning:** Använda :doc:`sampledata` Network eftersom alla vikter är desamma (dvs :math:`1``)" -msgid "" -"`Boost: Breadth First Search `__" -msgstr "" -"`Boost: Bredd först Sök `__" +msgid "`Boost: Breadth First Search `__" +msgstr "`Boost: Bredd först Sök `__" msgid "https://cp-algorithms.com/graph/01_bfs.html" msgstr "https://cp-algorithms.com/graph/01_bfs.html" -msgid "" -"https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" -msgstr "" -"https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" +msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" +msgstr "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" msgid "``pgr_bipartite`` - Experimental" msgstr "``pgr_bipartite`` - Experimentell" -msgid "" -"``pgr_bipartite`` — Disjoint sets of vertices such that no two vertices " -"within the same set are adjacent." -msgstr "" -"``pgr_bipartite`` - Disjunkta uppsättningar av hörnpunkter så att inga två " -"hörnpunkter inom samma uppsättning är angränsande." +msgid "``pgr_bipartite`` — Disjoint sets of vertices such that no two vertices within the same set are adjacent." +msgstr "``pgr_bipartite`` - Disjunkta uppsättningar av hörnpunkter så att inga två hörnpunkter inom samma uppsättning är angränsande." -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 "" -"En bipartitisk graf är en graf med två uppsättningar av hörn som är kopplade " -"till varandra, men inte inom sig själva. En bipartitisk graf är möjlig om " -"grafen kan färgläggas med två färger så att topparna i en uppsättning färgas " -"med samma färg." +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 "En bipartitisk graf är en graf med två uppsättningar av hörn som är kopplade till varandra, men inte inom sig själva. En bipartitisk graf är möjlig om grafen kan färgläggas med två färger så att topparna i en uppsättning färgas med samma färg." msgid "The algorithm works in undirected graph only." msgstr "Algoritmen fungerar endast i ostyrda grafer." @@ -10906,18 +8417,11 @@ msgstr "Algoritmen fungerar endast i ostyrda grafer." msgid "The returned values are not ordered." msgstr "De returnerade värdena är inte ordnade." -msgid "" -"The algorithm checks graph is bipartite or not. If it is bipartite then it " -"returns the node along with two colors `0` and `1` which represents two " -"different sets." -msgstr "" -"Algoritmen kontrollerar om grafen är tvådelad eller inte. Om den är " -"bipartite returnerar den noden tillsammans med två färger `0` och `1` som " -"representerar två olika uppsättningar." +msgid "The algorithm checks graph is bipartite or not. If it is bipartite then it returns the node along with two colors `0` and `1` which represents two different sets." +msgstr "Algoritmen kontrollerar om grafen är tvådelad eller inte. Om den är bipartite returnerar den noden tillsammans med två färger `0` och `1` som representerar två olika uppsättningar." msgid "If graph is not bipartite then algorithm returns empty set." -msgstr "" -"Om grafen inte är bipartitisk returnerar algoritmen en tom uppsättning." +msgstr "Om grafen inte är bipartitisk returnerar algoritmen en tom uppsättning." msgid "pgr_bipartite(`Edges SQL`_)" msgstr "pgr_bipartite(`Kanter SQL`_)" @@ -10931,41 +8435,23 @@ msgstr "Ytterligare exempel" msgid "The odd length cyclic graph can not be bipartite." msgstr "Den cykliska grafen med udda längd kan inte vara bipartit." -msgid "" -"The edge :math:`5 \\rightarrow 1` will make subgraph with vertices :math:" -"`\\{1, 3, 7, 6, 5\\}` an odd length cyclic graph, as the cycle has 5 " -"vertices." -msgstr "" -"Kanten :math:`5 \\rightarrow 1` kommer att göra undergrafen med hörn :math:" -"`\\{1, 3, 7, 6, 5\\}` till en cyklisk graf med udda längd, eftersom cykeln " -"har 5 hörn." +msgid "The edge :math:`5 \\rightarrow 1` will make subgraph with vertices :math:`\\{1, 3, 7, 6, 5\\}` an odd length cyclic graph, as the cycle has 5 vertices." +msgstr "Kanten :math:`5 \\rightarrow 1` kommer att göra undergrafen med hörn :math:`\\{1, 3, 7, 6, 5\\}` till en cyklisk graf med udda längd, eftersom cykeln har 5 hörn." msgid "Edges in blue represent odd length cycle subgraph." msgstr "Kanter i blått representerar cykelundergraf med udda längd." -msgid "" -"`Boost: is_bipartite `__" -msgstr "" -"`Boost: is_bipartite `__" +msgid "`Boost: is_bipartite `__" +msgstr "`Boost: is_bipartite `__" -msgid "" -"`Wikipedia: bipartite graph `__" -msgstr "" -"`Wikipedia: bipartitgraf `__" +msgid "`Wikipedia: bipartite graph `__" +msgstr "`Wikipedia: bipartitgraf `__" msgid "``pgr_boykovKolmogorov``" msgstr "``pgr_boykovKolmogorov``" -msgid "" -"``pgr_boykovKolmogorov`` — Calculates the flow on the graph edges that " -"maximizes the flow from the sources to the targets using Boykov Kolmogorov " -"algorithm." -msgstr "" -"``pgr_boykovKolmogorov`` - Beräknar flödet på grafens kanter som maximerar " -"flödet från källorna till målen med hjälp av Boykov Kolmogorov-algoritmen." +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`` - Beräknar flödet på grafens kanter som maximerar flödet från källorna till målen med hjälp av Boykov Kolmogorov-algoritmen." msgid "pgr_boykovKolmogorov(Combinations)" msgstr "pgr_boykovKolmogorov(Combinations)" @@ -11006,54 +8492,32 @@ msgstr "Från toppunkten :math:`11` till toppunkterna :math:`{\\5, 10, 12\\}`" msgid "From vertices :math:`\\{11, 3, 17\\}` to vertex :math:`12`" msgstr "Från topparna :math:`\\{11, 3, 17\\}` till topp :math:`12`" -msgid "" -"From vertices :math:`\\{11, 3, 17\\}` to vertices :math:`\\{5, 10, 12\\}`" -msgstr "" -"Från topparna :math:`{11, 3, 17\\}` till topparna :math:`{5, 10, 12\\}`" +msgid "From vertices :math:`\\{11, 3, 17\\}` to vertices :math:`\\{5, 10, 12\\}`" +msgstr "Från topparna :math:`{11, 3, 17\\}` till topparna :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 "" -"Att använda en kombinationstabell motsvarar att beräkna resultatet från " -"topparna :math:`\\{5, 6\\}` till topparna :math:`\\{10, 15, 14\\}`." +msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`." +msgstr "Att använda en kombinationstabell motsvarar att beräkna resultatet från topparna :math:`\\{5, 6\\}` till topparna :math:`\\{10, 15, 14\\}`." -msgid "" -"`Boost: Boykov Kolmogorov max flow `__" -msgstr "" -"`Boost: Boykov Kolmogorov maxflöde `__" +msgid "`Boost: Boykov Kolmogorov max flow `__" +msgstr "`Boost: Boykov Kolmogorov maxflöde `__" msgid "``pgr_breadthFirstSearch`` - Experimental" msgstr "``pgr_breadthFirstSearch`` - Experimentell" -msgid "" -"``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth " -"First Search algorithm." -msgstr "" -"``pgr_breadthFirstSearch`` - Returnerar traverseringsordning(ar) med " -"algoritmen Breadth First Search." +msgid "``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth First Search algorithm." +msgstr "``pgr_breadthFirstSearch`` - Returnerar traverseringsordning(ar) med algoritmen Breadth First Search." msgid "Version 4.0.0:" msgstr "Version 4.0.0:" -msgid "" -"Provides the Breadth First Search traversal order from a root vertex to a " -"particular depth." -msgstr "" -"Ger genomgångsordningen Breadth First Search från en rotvertex till ett " -"visst djup." +msgid "Provides the Breadth First Search traversal order from a root vertex to a particular depth." +msgstr "Ger genomgångsordningen Breadth First Search från en rotvertex till ett visst djup." msgid "The implementation will work on any type of graph." msgstr "Implementeringen kommer att fungera på alla typer av grafer." -msgid "" -"Provides the Breadth First Search traversal order from a source node to a " -"target depth level." -msgstr "" -"Ger traverseringsordningen Breadth First Search från en källnod till en " -"måldjupnivå." +msgid "Provides the Breadth First Search traversal order from a source node to a target depth level." +msgstr "Ger traverseringsordningen Breadth First Search från en källnod till en måldjupnivå." msgid "Running time: :math:`O(E + V)`" msgstr "Speltid: :math:`O(E + V)`" @@ -11067,19 +8531,11 @@ msgstr "pgr_breadthFirstSearch(`Kanter SQL`_, **root vids**, [**options**])" msgid "**options:** ``[max_depth, directed]``" msgstr "**options:** ``[max_depth, directed]``" -msgid "" -"From root vertex :math:`6` on a **directed** graph with edges in ascending " -"order of ``id``" -msgstr "" -"Från rotpunkten :math:`6` på en **riktad** graf med kanter i stigande " -"ordning efter ``id``" +msgid "From root vertex :math:`6` on a **directed** graph with edges in ascending order of ``id``" +msgstr "Från rotpunkten :math:`6` på en **riktad** graf med kanter i stigande ordning efter ``id``" -msgid "" -"From root vertices :math:`\\{12, 6\\}` on an **undirected** graph with " -"**depth** :math:`<= 2` and edges in ascending order of ``id``" -msgstr "" -"Från rotkärnor :math:`{12, 6\\}` på en **omdirigerad** graf med **djup** :" -"math:`<= 2` och kanter i stigande ordning efter `id``" +msgid "From root vertices :math:`\\{12, 6\\}` on an **undirected** graph with **depth** :math:`<= 2` and edges in ascending order of ``id``" +msgstr "Från rotkärnor :math:`{12, 6\\}` på en **omdirigerad** graf med **djup** :math:`<= 2` och kanter i stigande ordning efter `id``" msgid "DFS optional parameters" msgstr "DFS valfria parametrar" @@ -11093,12 +8549,8 @@ msgstr "Samma som `Single vertex`_ med kanter i fallande ordning efter ``id``." msgid "The resulting traversal is different." msgstr "Den resulterande traversalen är annorlunda." -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 "" -"Den vänstra bilden visar resultatet med stigande ordning av id:n och den " -"högra bilden visar med fallande ordning av kantidentifierarna." +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 "Den vänstra bilden visar resultatet med stigande ordning av id:n och den högra bilden visar med fallande ordning av kantidentifierarna." msgid "|ascending| |descending|" msgstr "|ascending| |descending|" @@ -11109,12 +8561,8 @@ msgstr "stigande" msgid "descending" msgstr "fallande" -msgid "" -"`Wikipedia: Breadth First Search algorithm `__" -msgstr "" -"`Wikipedia: Algoritmen för bred första sökning `__" +msgid "`Wikipedia: Breadth First Search algorithm `__" +msgstr "`Wikipedia: Algoritmen för bred första sökning `__" msgid "``pgr_bridges``" msgstr "``pgr_bryggor``" @@ -11122,13 +8570,8 @@ msgstr "``pgr_bryggor``" msgid "``pgr_bridges`` - Return the bridges of an undirected graph." msgstr "``pgr_bridges`` - Returnerar broarna i en odränerad graf." -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 "" -"En bro är en kant i en odelad graf vars borttagning ökar dess antal anslutna " -"komponenter. Denna implementation kan endast användas med en odelad graf." +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 "En bro är en kant i en odelad graf vars borttagning ökar dess antal anslutna komponenter. Denna implementation kan endast användas med en odelad graf." msgid "``edge`` ascending" msgstr "``edge`` stigande" @@ -11151,22 +8594,14 @@ msgstr "Identifierar den kant som är en bro." msgid "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" msgstr "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" -msgid "" -"`Boost: Connected components `__" -msgstr "" -"`Boost: Anslutna komponenter `__" +msgid "`Boost: Connected components `__" +msgstr "`Boost: Anslutna komponenter `__" msgid "``pgr_chinesePostman`` - Experimental" msgstr "``pgr_chinesePostman`` - Experimentell" -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`` - Beräknar den kortaste kretsvägen som innehåller " -"varje kant i en riktad graf och som börjar och slutar på samma toppunkt." +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`` - Beräknar den kortaste kretsvägen som innehåller varje kant i en riktad graf och som börjar och slutar på samma toppunkt." msgid "Returns ``EMPTY SET`` on a disconnected graph" msgstr "Returnerar ``EMPTY SET`` på en frånkopplad graf" @@ -11183,12 +8618,8 @@ msgstr "Returnerar uppsättning av ``(seq, nod, kant, kostnad, agg_cost)``" msgid "Sequential value starting from ``1``" msgstr "Sekventiellt värde med början från ``1``" -msgid "" -"Identifier of the edge used to go from ``node`` to the next node in the path " -"sequence. ``-1`` for the last node of the path." -msgstr "" -"Identifierar den kant som används för att gå från ``node`` till nästa nod i " -"bansekvensen. ``-1`` för den sista noden i sökvägen." +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 "Identifierar den kant som används för att gå från ``node`` till nästa nod i bansekvensen. ``-1`` för den sista noden i sökvägen." msgid "Aggregate cost from ``start_v`` to ``node``." msgstr "Sammanlagd kostnad från ``start_v`` till ``node``." @@ -11196,14 +8627,8 @@ msgstr "Sammanlagd kostnad från ``start_v`` till ``node``." msgid "``pgr_chinesePostmanCost`` - Experimental" msgstr "``pgr_chinesePostmanCost`` - Experimentell" -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`` - Beräknar minimikostnaderna för en kretsbana som " -"innehåller varje kant i en riktad graf och som börjar och slutar på samma " -"vertex." +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`` - Beräknar minimikostnaderna för en kretsbana som innehåller varje kant i en riktad graf och som börjar och slutar på samma vertex." msgid "Return value when the graph if disconnected" msgstr "Returvärde när grafen är frånkopplad" @@ -11223,19 +8648,11 @@ msgstr "Minimikostnader för en kretsbana." msgid "``pgr_connectedComponents``" msgstr "``pgr_connectedComponents``" -msgid "" -"``pgr_connectedComponents`` — Connected components of an undirected graph " -"using a DFS-based approach." -msgstr "" -"``pgr_connectedComponents`` - Anslutna komponenter i en odelad graf med " -"hjälp av en DFS-baserad metod." +msgid "``pgr_connectedComponents`` — Connected components of an undirected graph using a DFS-based approach." +msgstr "``pgr_connectedComponents`` - Anslutna komponenter i en odelad graf med hjälp av en DFS-baserad metod." -msgid "" -"A connected component of an undirected graph is a set of vertices that are " -"all reachable from each other." -msgstr "" -"En kopplad komponent i en odelad graf är en uppsättning hörn som alla är " -"nåbara från varandra." +msgid "A connected component of an undirected graph is a set of vertices that are all reachable from each other." +msgstr "En kopplad komponent i en odelad graf är en uppsättning hörn som alla är nåbara från varandra." msgid "Components are described by vertices" msgstr "Komponenterna beskrivs av hörn" @@ -11261,22 +8678,14 @@ msgstr "Identifierare av den toppunkt som tillhör ``komponenten``." msgid "Connecting disconnected components" msgstr "Anslutning av frånkopplade komponenter" -msgid "" -"wikipedia: `Connected component `__" -msgstr "" -"wikipedia: `sammanhängande komponent `__" +msgid "wikipedia: `Connected component `__" +msgstr "wikipedia: `sammanhängande komponent `__" msgid "``pgr_contraction``" msgstr "``pgr_contraction``" -msgid "" -"``pgr_contraction`` — Performs graph contraction and returns the contracted " -"vertices and edges." -msgstr "" -"``pgr_contraction`` - Utför grafkontraktion och returnerar de kontraherade " -"topparna och kanterna." +msgid "``pgr_contraction`` — Performs graph contraction and returns the contracted vertices and edges." +msgstr "``pgr_contraction`` - Utför grafkontraktion och returnerar de kontraherade topparna och kanterna." msgid "Version 3.8.0" msgstr "Version 3.8.0" @@ -11284,20 +8693,14 @@ msgstr "Version 3.8.0" msgid "New signature:" msgstr "Ny signatur:" -msgid "" -"Previously compulsory parameter **Contraction order** is now optional with " -"name ``methods``." -msgstr "" -"Den tidigare obligatoriska parametern **Contraction order** är nu valfri med " -"namnet ``methods``." +msgid "Previously compulsory parameter **Contraction order** is now optional with name ``methods``." +msgstr "Den tidigare obligatoriska parametern **Contraction order** är nu valfri med namnet ``methods``." msgid "New name and order of optional parameters." msgstr "Nytt namn och ordning på valfria parametrar." -msgid "" -"Deprecated signature pgr_contraction(text,bigint[],integer,bigint[],boolean)" -msgstr "" -"Föråldrad signatur pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgid "Deprecated signature pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgstr "Föråldrad signatur pgr_contraction(text,bigint[],integer,bigint[],boolean)" msgid "Name change from ``pgr_contractGraph``" msgstr "Namnändring från ``pgr_contractGraph``" @@ -11305,15 +8708,8 @@ msgstr "Namnändring från ``pgr_contractGraph``" msgid "Bug fixes" msgstr "Buggfixar" -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 "" -"Kontraktion minskar storleken på grafen genom att ta bort några av topparna " -"och kanterna och till exempel lägga till kanter som representerar en sekvens " -"av ursprungliga kanter, vilket minskar den totala tid och det utrymme som " -"används i grafalgoritmer." +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 "Kontraktion minskar storleken på grafen genom att ta bort några av topparna och kanterna och till exempel lägga till kanter som representerar en sekvens av ursprungliga kanter, vilket minskar den totala tid och det utrymme som används i grafalgoritmer." msgid "Does not return the full contracted graph." msgstr "Returnerar inte hela den kontraherade grafen." @@ -11328,8 +8724,7 @@ msgid "The new edges generated by linear contraction." msgstr "De nya kanterna som genereras av linjär sammandragning." msgid "The modified vertices generated by dead end contraction." -msgstr "" -"De modifierade topparna som genereras av sammandragning av återvändsgränder." +msgstr "De modifierade topparna som genereras av sammandragning av återvändsgränder." msgid "The returned values are ordered as follows:" msgstr "De returnerade värdena är ordnade enligt följande:" @@ -11340,12 +8735,8 @@ msgstr "kolumn ``id`` stigande när det är en modifierad vertex." msgid "column ``id`` with negative numbers descending when its a new edge." msgstr "kolumn ``id`` med negativa tal fallande när det är en ny kant." -msgid "" -"Currently there are two types of contraction methods included in this " -"function:" -msgstr "" -"För närvarande finns det två typer av sammandragningsmetoder som ingår i " -"denna funktion:" +msgid "Currently there are two types of contraction methods included in this function:" +msgstr "För närvarande finns det två typer av sammandragningsmetoder som ingår i denna funktion:" msgid "Dead End Contraction. See :doc:`pgr_contractionDeadEnd`." msgstr "Kontraktion för återvändsgränd. Se :doc:`pgr_contractionDeadEnd`." @@ -11443,12 +8834,8 @@ msgstr "När ``typ`` = **'e'**." msgid "Decreasing sequence starting from **-1**." msgstr "Minskande sekvens med början från **-1**." -msgid "" -"Representing a pseudo `id` as is not incorporated in the set of original " -"edges." -msgstr "" -"Representerar ett pseudo-id som inte ingår i uppsättningen av ursprungliga " -"kanter." +msgid "Representing a pseudo `id` as is not incorporated in the set of original edges." +msgstr "Representerar ett pseudo-id som inte ingår i uppsättningen av ursprungliga kanter." msgid "``contracted_vertices``" msgstr "``contracted_vertices``" @@ -11459,24 +8846,14 @@ msgstr "Array med identifierare för kontrakterade vertex." msgid "When ``type`` = **'v'**: :math:`-1`" msgstr "När ``typ`` = **'v'**: :math:`-1`" -msgid "" -"When ``type`` = **'e'**: Identifier of the source vertex of the current edge " -"(``source``, ``target``)." -msgstr "" -"När ``typ`` = **'e'**: Identifierare av källvertexen för den aktuella kanten " -"(``källa``, ``mål``)." +msgid "When ``type`` = **'e'**: Identifier of the source vertex of the current edge (``source``, ``target``)." +msgstr "När ``typ`` = **'e'**: Identifierare av källvertexen för den aktuella kanten (``källa``, ``mål``)." -msgid "" -"When ``type`` = **'e'**: Identifier of the target vertex of the current edge " -"(``source``, ``target``)." -msgstr "" -"När ``typ`` = **'e'**: Identifierare av målvertexen för den aktuella kanten " -"(``källa``, ``mål``)." +msgid "When ``type`` = **'e'**: Identifier of the target vertex of the current edge (``source``, ``target``)." +msgstr "När ``typ`` = **'e'**: Identifierare av målvertexen för den aktuella kanten (``källa``, ``mål``)." -msgid "" -"When ``type`` = **'e'**: Weight of the current edge (``source``, ``target``)." -msgstr "" -"När ``typ`` = **'e'**: Vikt för den aktuella kanten (``källa``, ``mål``)." +msgid "When ``type`` = **'e'**: Weight of the current edge (``source``, ``target``)." +msgstr "När ``typ`` = **'e'**: Vikt för den aktuella kanten (``källa``, ``mål``)." msgid "Only dead end contraction" msgstr "Endast återvändsgränd kontraktion" @@ -11487,16 +8864,8 @@ msgstr "Endast linjär sammandragning" msgid "The cycle" msgstr "Cykeln" -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 "" -"Kontrahering av en graf kan göras med mer än en operation. Ordningen på " -"operationerna påverkar den resulterande kontraherade grafen, efter att ha " -"tillämpat en operation ändras uppsättningen toppar som kan kontraheras med " -"en annan operation." +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 "Kontrahering av en graf kan göras med mer än en operation. Ordningen på operationerna påverkar den resulterande kontraherade grafen, efter att ha tillämpat en operation ändras uppsättningen toppar som kan kontraheras med en annan operation." msgid "This implementation cycles ``cycles`` times through the ``methods`` ." msgstr "Denna implementation cyklar ``cyklar`` gånger genom ``metoderna`` ." @@ -11504,19 +8873,14 @@ msgstr "Denna implementation cyklar ``cyklar`` gånger genom ``metoderna`` ." msgid "Contracting sample data" msgstr "Upphandling av provdata" -msgid "" -"In this section, building and using a contracted graph will be shown by " -"example." -msgstr "" -"I det här avsnittet visas exempel på hur man bygger upp och använder en " -"kontraherad graf." +msgid "In this section, building and using a contracted graph will be shown by example." +msgstr "I det här avsnittet visas exempel på hur man bygger upp och använder en kontraherad graf." msgid "The :doc:`sampledata` for an undirected graph is used" msgstr ":doc:`sampledata` för en enkelriktad graf används" msgid "a dead end operation first followed by a linear operation." -msgstr "" -"först en operation i en återvändsgränd och därefter en linjär operation." +msgstr "först en operation i en återvändsgränd och därefter en linjär operation." msgid "Construction of the graph in the database" msgstr "Konstruktion av grafen i databasen" @@ -11524,28 +8888,17 @@ msgstr "Konstruktion av grafen i databasen" msgid "The original graph:" msgstr "Den ursprungliga grafen:" -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 "" -"Resultaten representerar inte den sammandragna grafen. De representerar de " -"ändringar som måste göras i grafen efter att man har tillämpat " -"sammandragningsmetoderna." +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 "Resultaten representerar inte den sammandragna grafen. De representerar de ändringar som måste göras i grafen efter att man har tillämpat sammandragningsmetoderna." -msgid "" -"Observe that vertices, for example, :math:`6` do not appear in the results " -"because it was not affected by the contraction algorithm." -msgstr "" -"Observera att toppar, till exempel :math:`6`, inte visas i resultaten " -"eftersom de inte påverkades av sammandragningsalgoritmen." +msgid "Observe that vertices, for example, :math:`6` do not appear in the results because it was not affected by the contraction algorithm." +msgstr "Observera att toppar, till exempel :math:`6`, inte visas i resultaten eftersom de inte påverkades av sammandragningsalgoritmen." msgid "After doing the dead end contraction operation:" msgstr "Efter att ha gjort den återvändsgränd sammandragning operation:" msgid "After doing the linear contraction operation to the graph above:" -msgstr "" -"Efter att ha gjort den linjära sammandragningsoperationen på grafen ovan:" +msgstr "Efter att ha gjort den linjära sammandragningsoperationen på grafen ovan:" msgid "The process to create the contraction graph on the database:" msgstr "Processen för att skapa sammandragningsgrafen i databasen:" @@ -11553,12 +8906,8 @@ msgstr "Processen för att skapa sammandragningsgrafen i databasen:" msgid "Add additional columns" msgstr "Lägg till ytterligare kolumner" -msgid "" -"Adding extra columns to the edges and vertices tables. In this documentation " -"the following will be used:" -msgstr "" -"Lägga till extra kolumner i tabellerna edges och vertices. I denna " -"dokumentation kommer följande att användas:" +msgid "Adding extra columns to the edges and vertices tables. In this documentation the following will be used:" +msgstr "Lägga till extra kolumner i tabellerna edges och vertices. I denna dokumentation kommer följande att användas:" msgid "Column." msgstr "Kolumn." @@ -11572,18 +8921,11 @@ msgstr "``is_contracted``" msgid "On the vertex table" msgstr "På toppunktstabellen" -msgid "" -"when ``true`` the vertex is contracted, its not part of the contracted graph." -msgstr "" -"när ``true`` vertexen är kontraherad, är den inte en del av den kontraherade " -"grafen." +msgid "when ``true`` the vertex is contracted, its not part of the contracted graph." +msgstr "när ``true`` vertexen är kontraherad, är den inte en del av den kontraherade grafen." -msgid "" -"when ``false`` the vertex is not contracted, its part of the contracted " -"graph." -msgstr "" -"när ``false`` är vertexen inte kontraherad, den är en del av den " -"kontraherade grafen." +msgid "when ``false`` the vertex is not contracted, its part of the contracted graph." +msgstr "när ``false`` är vertexen inte kontraherad, den är en del av den kontraherade grafen." msgid "``is_new``" msgstr "``is_new``" @@ -11591,19 +8933,11 @@ msgstr "``is_new``" msgid "On the edge table" msgstr "På kanten av bordet" -msgid "" -"when ``true`` the edge was generated by the contraction algorithm. its part " -"of the contracted graph." -msgstr "" -"när ``true`` kanten genererades av sammandragningsalgoritmen. dess del av " -"den sammandragna grafen." +msgid "when ``true`` the edge was generated by the contraction algorithm. its part of the contracted graph." +msgstr "när ``true`` kanten genererades av sammandragningsalgoritmen. dess del av den sammandragna grafen." -msgid "" -"when ``false`` the edge is an original edge, might be or not part of the " -"contracted graph." -msgstr "" -"när ``false`` är kanten en originalkant, som kan vara eller inte vara en del " -"av den kontraherade grafen." +msgid "when ``false`` the edge is an original edge, might be or not part of the contracted graph." +msgstr "när ``false`` är kanten en originalkant, som kan vara eller inte vara en del av den kontraherade grafen." msgid "Store contraction information" msgstr "Lagra information om sammandragning" @@ -11614,17 +8948,11 @@ msgstr "Spara sammandragningsresultaten i en tabell." msgid "Update the edges and vertices tables" msgstr "Uppdatera tabellerna för kanter och toppar" -msgid "" -"Use ``is_contracted`` column to indicate the vertices that are contracted." -msgstr "" -"Använd kolumnen ``is_contracted`` för att ange de toppar som är kontraherade." +msgid "Use ``is_contracted`` column to indicate the vertices that are contracted." +msgstr "Använd kolumnen ``is_contracted`` för att ange de toppar som är kontraherade." -msgid "" -"Fill ``contracted_vertices`` with the information from the results that " -"belong to the vertices." -msgstr "" -"Fyll i ``contracted_vertices`` med informationen från de resultat som hör " -"till topparna." +msgid "Fill ``contracted_vertices`` with the information from the results that belong to the vertices." +msgstr "Fyll i ``contracted_vertices`` med informationen från de resultat som hör till topparna." msgid "Insert the new edges generated by pgr_contraction." msgstr "Infoga de nya kanterna som genererats av pgr_contraction." @@ -11644,23 +8972,11 @@ msgstr "Visuellt:" msgid "Using the contracted graph" msgstr "Använda den kontraherade grafen" -msgid "" -"Depending on the final application the graph is to be prepared. In this " -"example the final application will be to calculate the cost from two " -"vertices in the original graph by using the contracted graph with " -"``pgr_dijkstraCost``" -msgstr "" -"Beroende på den slutliga tillämpningen ska grafen förberedas. I detta " -"exempel kommer den slutliga tillämpningen att vara att beräkna kostnaden " -"från två toppar i originalgrafen genom att använda den kontraherade grafen " -"med ``pgr_dijkstraCost``" +msgid "Depending on the final application the graph is to be prepared. In this example the final application will be to calculate the cost from two vertices in the original graph by using the contracted graph with ``pgr_dijkstraCost``" +msgstr "Beroende på den slutliga tillämpningen ska grafen förberedas. I detta exempel kommer den slutliga tillämpningen att vara att beräkna kostnaden från två toppar i originalgrafen genom att använda den kontraherade grafen med ``pgr_dijkstraCost``" -msgid "" -"There are three cases when calculating the shortest path between a given " -"source and target in a contracted graph:" -msgstr "" -"Det finns tre fall när man beräknar den kortaste vägen mellan en given källa " -"och ett givet mål i en kontrakterad graf:" +msgid "There are three cases when calculating the shortest path between a given source and target in a contracted graph:" +msgstr "Det finns tre fall när man beräknar den kortaste vägen mellan en given källa och ett givet mål i en kontrakterad graf:" msgid "Case 1: Both source and target belong to the contracted graph." msgstr "Fall 1: Både källan och målet hör till den kontrakterade grafen." @@ -11680,24 +8996,17 @@ msgstr "Skapa en vy (eller tabell) av den kontraherade grafen:" msgid "Create the function that will use the contracted graph." msgstr "Skapa den funktion som ska använda den kontraherade grafen." -msgid "" -"Case 2: Source and/or target belong to an edge that has contracted vertices." -msgstr "" -"Fall 2: Källa och/eller mål hör till en kant som har kontraherade toppar." +msgid "Case 2: Source and/or target belong to an edge that has contracted vertices." +msgstr "Fall 2: Källa och/eller mål hör till en kant som har kontraherade toppar." -msgid "" -"Case 3: Source and/or target belong to a vertex that has been contracted." +msgid "Case 3: Source and/or target belong to a vertex that has been contracted." msgstr "Fall 3: Källa och/eller mål hör till en vertex som har kontrakterats." msgid "``pgr_contractionDeadEnd`` - Proposed" msgstr "``pgr_contractionDeadEnd`` - Förslag" -msgid "" -"``pgr_contractionDeadEnd`` — Performs graph contraction and returns the " -"contracted vertices and edges." -msgstr "" -"``pgr_contractionDeadEnd`` - Utför grafkontraktion och returnerar de " -"kontraherade topparna och kanterna." +msgid "``pgr_contractionDeadEnd`` — Performs graph contraction and returns the contracted vertices and edges." +msgstr "``pgr_contractionDeadEnd`` - Utför grafkontraktion och returnerar de kontraherade topparna och kanterna." msgid "A node is considered a dead end node when:" msgstr "En nod anses vara en återvändsgrändsnod när:" @@ -11714,8 +9023,7 @@ msgstr "Om riktade grafer:" msgid "When there is only one adjacent vertex or" msgstr "När det bara finns en angränsande toppunkt eller" -msgid "" -"When all edges are incoming regardless of the number of adjacent vertices." +msgid "When all edges are incoming regardless of the number of adjacent vertices." msgstr "När alla kanter är inkommande oavsett antalet angränsande toppar." msgid "pgr_contractionDeadEnd(`Edges SQL`_, [**options**])" @@ -11731,9 +9039,7 @@ msgid "The green nodes are dead end nodes." msgstr "De gröna noderna är återvändsgrändsnoder." msgid "Node :math:`3` is a dead end node after node :math:`1` is contracted." -msgstr "" -"Noden :math:`3` är en återvändsgränd efter att noden :math:`1` har dragits " -"in." +msgstr "Noden :math:`3` är en återvändsgränd efter att noden :math:`1` har dragits in." msgid "``ARRAY[`` |ANY-INTEGER| ``]``" msgstr "``ARRAY[`` |ANY-INTEGER| ``]`` ``" @@ -11768,10 +9074,8 @@ msgstr "Dead end-knutpunkt på riktad graf" msgid "The green nodes are dead end nodes" msgstr "De gröna noderna är återvändsgrändsnoder" -msgid "" -"The blue nodes have an unlimited number of incoming and/or outgoing edges." -msgstr "" -"De blå noderna har ett obegränsat antal inkommande och/eller utgående kanter." +msgid "The blue nodes have an unlimited number of incoming and/or outgoing edges." +msgstr "De blå noderna har ett obegränsat antal inkommande och/eller utgående kanter." msgid "Node" msgstr "Nod" @@ -11833,51 +9137,26 @@ msgstr ":math:`1,2,3,4,5`" msgid "Many adjacent nodes." msgstr "Många angränsande noder." -msgid "" -"Has more than one adjacent node and some edges are incoming and some are " -"outgoing." -msgstr "" -"Har mer än en angränsande nod och vissa kanter är inkommande och vissa är " -"utgående." +msgid "Has more than one adjacent node and some edges are incoming and some are outgoing." +msgstr "Har mer än en angränsande nod och vissa kanter är inkommande och vissa är utgående." -msgid "" -"From above, nodes :math:`\\{6, 7, 9\\}` are dead ends because the total " -"number of adjacent vertices is one." -msgstr "" -"Ovan är noderna :math:`\\{6, 7, 9\\}` återvändsgränder eftersom det totala " -"antalet angränsande hörn är ett." +msgid "From above, nodes :math:`\\{6, 7, 9\\}` are dead ends because the total number of adjacent vertices is one." +msgstr "Ovan är noderna :math:`\\{6, 7, 9\\}` återvändsgränder eftersom det totala antalet angränsande hörn är ett." -msgid "" -"When there are more than one adjacent vertex, all edges need to be all " -"incoming edges otherwise it is not a dead end." -msgstr "" -"När det finns mer än ett angränsande toppunkt måste alla kanter vara alla " -"inkommande kanter, annars är det inte en återvändsgränd." +msgid "When there are more than one adjacent vertex, all edges need to be all incoming edges otherwise it is not a dead end." +msgstr "När det finns mer än ett angränsande toppunkt måste alla kanter vara alla inkommande kanter, annars är det inte en återvändsgränd." msgid "Step by step dead end contraction" msgstr "Steg för steg återvändsgränd sammandragning" -msgid "" -"The dead end contraction will stop until there are no more dead end nodes. " -"For example, from the following graph where :math:`3` is the dead end node:" -msgstr "" -"Sammandragningen av återvändsgränder kommer att upphöra tills det inte finns " -"några fler återvändsgrändsnoder. Till exempel, från följande graf där :math:" -"`3` är återvändsgränden:" +msgid "The dead end contraction will stop until there are no more dead end nodes. For example, from the following graph where :math:`3` is the dead end node:" +msgstr "Sammandragningen av återvändsgränder kommer att upphöra tills det inte finns några fler återvändsgrändsnoder. Till exempel, från följande graf där :math:`3` är återvändsgränden:" -msgid "" -"After contracting :math:`3`, node :math:`2` is now a dead end node and is " -"contracted:" -msgstr "" -"Efter kontrakteringen av :math:`3` är noden :math:`2` nu en återvändsgränd " -"och kontrakteras:" +msgid "After contracting :math:`3`, node :math:`2` is now a dead end node and is contracted:" +msgstr "Efter kontrakteringen av :math:`3` är noden :math:`2` nu en återvändsgränd och kontrakteras:" -msgid "" -"After contracting :math:`2`, stop. Node :math:`1` has the information of " -"nodes that were contracted." -msgstr "" -"Efter att ha dragit in :math:`2`, sluta. Noden :math:`1` har information om " -"de noder som kontrakterades." +msgid "After contracting :math:`2`, stop. Node :math:`1` has the information of nodes that were contracted." +msgstr "Efter att ha dragit in :math:`2`, sluta. Noden :math:`1` har information om de noder som kontrakterades." msgid "Creating the contracted graph" msgstr "Skapa den kontraherade grafen" @@ -11906,117 +9185,35 @@ msgstr "Används när avgång och destination inte finns i den avtalade grafen" msgid "``pgr_contractionHierarchies`` - Experimental" msgstr "``pgr_contractionHierarchies`` - Experimentell" -msgid "" -"``pgr_contractionHierarchies`` — Performs graph contraction according to the " -"contraction hierarchies method and returns the contracted vertices and " -"shortcut edges created." -msgstr "" -"``pgr_contractionHierarchies`` - Utför grafkontraktion enligt metoden " -"contraction hierarchies och returnerar de kontraherade topparna och de " -"skapade genvägskanterna." +msgid "``pgr_contractionHierarchies`` — Performs graph contraction according to the contraction hierarchies method and returns the contracted vertices and shortcut edges created." +msgstr "``pgr_contractionHierarchies`` - Utför grafkontraktion enligt metoden contraction hierarchies och returnerar de kontraherade topparna och de skapade genvägskanterna." -msgid "" -"The contraction hierarchies method builds, from an initial order of the " -"vertices, a hierarchical order, giving priority to some vertices during the " -"processing of label fixing of shortest paths algorithms. Furthermore, the " -"contraction hierarchies algorithm adds shortcut edges in the graph, that " -"helps the shortest paths algorithm to follow the created hierarchical graph " -"structure." -msgstr "" -"Contraction Hierarchies-metoden bygger, från en initial ordning av topparna, " -"en hierarkisk ordning som prioriterar vissa toppar under bearbetningen av " -"kortaste vägar-algoritmernas etikettfixering. Dessutom lägger algoritmen för " -"sammandragningshierarkier till genvägskanter i grafen, vilket hjälper " -"algoritmen för kortaste vägar att följa den skapade hierarkiska " -"grafstrukturen." +msgid "The contraction hierarchies method builds, from an initial order of the vertices, a hierarchical order, giving priority to some vertices during the processing of label fixing of shortest paths algorithms. Furthermore, the contraction hierarchies algorithm adds shortcut edges in the graph, that helps the shortest paths algorithm to follow the created hierarchical graph structure." +msgstr "Contraction Hierarchies-metoden bygger, från en initial ordning av topparna, en hierarkisk ordning som prioriterar vissa toppar under bearbetningen av kortaste vägar-algoritmernas etikettfixering. Dessutom lägger algoritmen för sammandragningshierarkier till genvägskanter i grafen, vilket hjälper algoritmen för kortaste vägar att följa den skapade hierarkiska grafstrukturen." -msgid "" -"The idea of the hierarchy is to put at a high priority level vertices that " -"belong to the long distance network (highways for example in a road network) " -"and to a low level of priority nodes that belong to the short distance " -"network (arterials or secondary roads for example in road networks)." -msgstr "" -"Tanken med hierarkin är att ge hög prioritet åt toppar som tillhör det " -"långväga nätet (t.ex. motorvägar i ett vägnät) och låg prioritet åt noder " -"som tillhör det kortväga nätet (t.ex. artärer eller sekundära vägar i ett " -"vägnät)." +msgid "The idea of the hierarchy is to put at a high priority level vertices that belong to the long distance network (highways for example in a road network) and to a low level of priority nodes that belong to the short distance network (arterials or secondary roads for example in road networks)." +msgstr "Tanken med hierarkin är att ge hög prioritet åt toppar som tillhör det långväga nätet (t.ex. motorvägar i ett vägnät) och låg prioritet åt noder som tillhör det kortväga nätet (t.ex. artärer eller sekundära vägar i ett vägnät)." -msgid "" -"The contraction hierarchies algorithm makes the assumption that there is " -"already a valuable vertices order that is used to initialize the contraction " -"process. As in most cases there is no valuable initial node ordering, we use " -"the order given by vertices ID. Then, the contraction process is made on the " -"basis of this first order to give the final hierarchy." -msgstr "" -"Algoritmen för sammandragningshierarkier förutsätter att det redan finns en " -"värdefull nodordning som används för att initiera sammandragningsprocessen. " -"Eftersom det i de flesta fall inte finns någon värdefull initial nodordning " -"använder vi den ordning som ges av vertices ID. Sedan görs " -"sammandragningsprocessen på grundval av denna första ordning för att ge den " -"slutliga hierarkin." +msgid "The contraction hierarchies algorithm makes the assumption that there is already a valuable vertices order that is used to initialize the contraction process. As in most cases there is no valuable initial node ordering, we use the order given by vertices ID. Then, the contraction process is made on the basis of this first order to give the final hierarchy." +msgstr "Algoritmen för sammandragningshierarkier förutsätter att det redan finns en värdefull nodordning som används för att initiera sammandragningsprocessen. Eftersom det i de flesta fall inte finns någon värdefull initial nodordning använder vi den ordning som ges av vertices ID. Sedan görs sammandragningsprocessen på grundval av denna första ordning för att ge den slutliga hierarkin." -msgid "" -"The basic idea is to keep the vertices in a priority queue sorted by some " -"estimate of how attractive is their contraction. The implemented case uses " -"the metric called *edge difference*, which corresponds to the difference " -"between the number of shortcuts produced by a vertex contraction and the " -"number of incident edges in the graph before contraction (``#shortcuts - " -"#incident edges``)." -msgstr "" -"Grundidén är att hålla topparna i en prioritetskö sorterade efter någon " -"uppskattning av hur attraktiv deras sammandragning är. I det implementerade " -"fallet används ett mått som kallas *edge difference*, vilket motsvarar " -"skillnaden mellan antalet genvägar som produceras av en vertexkontraktion " -"och antalet infallande kanter i grafen före kontraktionen (``#shortcuts - " -"#incident edges``)." +msgid "The basic idea is to keep the vertices in a priority queue sorted by some estimate of how attractive is their contraction. The implemented case uses the metric called *edge difference*, which corresponds to the difference between the number of shortcuts produced by a vertex contraction and the number of incident edges in the graph before contraction (``#shortcuts - #incident edges``)." +msgstr "Grundidén är att hålla topparna i en prioritetskö sorterade efter någon uppskattning av hur attraktiv deras sammandragning är. I det implementerade fallet används ett mått som kallas *edge difference*, vilket motsvarar skillnaden mellan antalet genvägar som produceras av en vertexkontraktion och antalet infallande kanter i grafen före kontraktionen (``#shortcuts - #incident edges``)." -msgid "" -"Finally, the aim is to reduce the explored part of the graph, when using a " -"bidirectional Dijkstra-like algorithm. The vertices order is used to feed " -"the oriented search. The search is made without losing optimality." -msgstr "" -"Slutligen är målet att minska den utforskade delen av grafen när man " -"använder en dubbelriktad Dijkstra-liknande algoritm. Topparnas ordning " -"används för att mata den orienterade sökningen. Sökningen görs utan att " -"förlora optimalitet." +msgid "Finally, the aim is to reduce the explored part of the graph, when using a bidirectional Dijkstra-like algorithm. The vertices order is used to feed the oriented search. The search is made without losing optimality." +msgstr "Slutligen är målet att minska den utforskade delen av grafen när man använder en dubbelriktad Dijkstra-liknande algoritm. Topparnas ordning används för att mata den orienterade sökningen. Sökningen görs utan att förlora optimalitet." -msgid "" -"Finding an optimal vertices ordering for contraction is a difficult problem. " -"Nevertheless, very simple local heuristics work quite well, according to " -"Geisberger et al. [2]. The principle here is to a priori estimate the value " -"of the *edge difference* and to contract the node at the top of the queue " -"only if the new value of the metric keeps it at the top of the queue. " -"Otherwise, it is reinserted in the queue, at its right place corresponding " -"to the new metric value." -msgstr "" -"Det är ett svårt problem att hitta en optimal ordning på topparna för " -"sammandragning. Ändå fungerar mycket enkla lokala heuristiker ganska bra, " -"enligt Geisberger et al [2]. Principen här är att på förhand uppskatta " -"värdet på *kantskillnaden* och att dra ihop noden högst upp i kön endast om " -"det nya värdet på metriken håller den kvar högst upp i kön. I annat fall " -"återinsätts den i kön på sin rätta plats som motsvarar det nya metriska " -"värdet." +msgid "Finding an optimal vertices ordering for contraction is a difficult problem. Nevertheless, very simple local heuristics work quite well, according to Geisberger et al. [2]. The principle here is to a priori estimate the value of the *edge difference* and to contract the node at the top of the queue only if the new value of the metric keeps it at the top of the queue. Otherwise, it is reinserted in the queue, at its right place corresponding to the new metric value." +msgstr "Det är ett svårt problem att hitta en optimal ordning på topparna för sammandragning. Ändå fungerar mycket enkla lokala heuristiker ganska bra, enligt Geisberger et al [2]. Principen här är att på förhand uppskatta värdet på *kantskillnaden* och att dra ihop noden högst upp i kön endast om det nya värdet på metriken håller den kvar högst upp i kön. I annat fall återinsätts den i kön på sin rätta plats som motsvarar det nya metriska värdet." msgid "The process is done on graphs having only edges with positive costs." msgstr "Processen görs på grafer som bara har kanter med positiva kostnader." -msgid "" -"It is necessary to remember that there are no deleted vertices with this " -"function. At the end, the graph keeps every vertex it had, but has some " -"added edges, corresponding to shortcuts. The vertices which have been " -"contracted, to build the shortcut edges, are kept and hierarchically ordered." -msgstr "" -"Det är nödvändigt att komma ihåg att det inte finns några borttagna toppar " -"med denna funktion. I slutet behåller grafen alla toppar den hade, men har " -"några extra kanter som motsvarar genvägar. De toppar som har dragits ihop " -"för att bygga upp genvägskanterna behålls och ordnas hierarkiskt." +msgid "It is necessary to remember that there are no deleted vertices with this function. At the end, the graph keeps every vertex it had, but has some added edges, corresponding to shortcuts. The vertices which have been contracted, to build the shortcut edges, are kept and hierarchically ordered." +msgstr "Det är nödvändigt att komma ihåg att det inte finns några borttagna toppar med denna funktion. I slutet behåller grafen alla toppar den hade, men har några extra kanter som motsvarar genvägar. De toppar som har dragits ihop för att bygga upp genvägskanterna behålls och ordnas hierarkiskt." -msgid "" -"As for the other contraction methods, it does not return the full contracted " -"graph, only the changes. They are here of two types:" -msgstr "" -"När det gäller de andra kontraktionsmetoderna returneras inte hela den " -"kontraherade grafen, utan endast förändringarna. De är här av två typer:" +msgid "As for the other contraction methods, it does not return the full contracted graph, only the changes. They are here of two types:" +msgstr "När det gäller de andra kontraktionsmetoderna returneras inte hela den kontraherade grafen, utan endast förändringarna. De är här av två typer:" msgid "added shortcut edges, with negative identifiers;" msgstr "lagt till genvägskanter, med negativa identifierare;" @@ -12024,8 +9221,7 @@ msgstr "lagt till genvägskanter, med negativa identifierare;" msgid "contracted nodes with an order." msgstr "kontrakterade noder med en order." -msgid "" -"The ``pgr_contractionHierarchies`` function has the following signature:" +msgid "The ``pgr_contractionHierarchies`` function has the following signature:" msgstr "Funktionen ``pgr_contractionHierarchies`` har följande signatur:" msgid "pgr_contractionHierarchies(`Edges SQL`_, [**options**])" @@ -12040,12 +9236,8 @@ msgstr "Sammandragningshierarkier valfria parametrar" msgid "True if the graph is directed, False otherwise." msgstr "True om grafen är riktad, False annars." -msgid "" -"The function returns many rows (one per vertex and one per shortcut edge " -"created). The columns of the rows are:" -msgstr "" -"Funktionen returnerar många rader (en per toppunkt och en per skapad " -"genvägskant). Kolumnerna i raderna är:" +msgid "The function returns many rows (one per vertex and one per shortcut edge created). The columns of the rows are:" +msgstr "Funktionen returnerar många rader (en per toppunkt och en per skapad genvägskant). Kolumnerna i raderna är:" msgid "Type of the ``id``." msgstr "Typ av ``id``." @@ -12065,55 +9257,26 @@ msgstr "``vertex_order``" msgid "On an undirected graph" msgstr "På en odelad graf" -msgid "" -"The following query shows the original data involved in the contraction " -"operation on an undirected graph." -msgstr "" -"Följande fråga visar de ursprungliga data som är involverade i " -"sammandragningsoperationen på en oriktad graf." +msgid "The following query shows the original data involved in the contraction operation on an undirected graph." +msgstr "Följande fråga visar de ursprungliga data som är involverade i sammandragningsoperationen på en oriktad graf." msgid "building contraction hierarchies on the whole graph" msgstr "bygga sammandragningshierarkier på hela grafen" -msgid "" -"The results do not represent the contracted graph. They represent the " -"changes done to the graph after applying the contraction algorithm and give " -"the vertex order built by the algorithm, by ordering vertices according to " -"the *edge difference* metric. As a consequence, vertices are all represented " -"in the result (except of course forbidden ones). Only shortcut built by the " -"algorithm are represented in the result." -msgstr "" -"Resultaten representerar inte den sammandragna grafen. De representerar de " -"ändringar som gjorts i grafen efter tillämpning av sammandragningsalgoritmen " -"och ger den vertexordning som algoritmen bygger upp genom att ordna vertex " -"enligt *edge difference*-metriken. Som en följd av detta finns alla toppar " -"representerade i resultatet (utom naturligtvis förbjudna). Endast genvägar " -"som byggts av algoritmen finns representerade i resultatet." +msgid "The results do not represent the contracted graph. They represent the changes done to the graph after applying the contraction algorithm and give the vertex order built by the algorithm, by ordering vertices according to the *edge difference* metric. As a consequence, vertices are all represented in the result (except of course forbidden ones). Only shortcut built by the algorithm are represented in the result." +msgstr "Resultaten representerar inte den sammandragna grafen. De representerar de ändringar som gjorts i grafen efter tillämpning av sammandragningsalgoritmen och ger den vertexordning som algoritmen bygger upp genom att ordna vertex enligt *edge difference*-metriken. Som en följd av detta finns alla toppar representerade i resultatet (utom naturligtvis förbjudna). Endast genvägar som byggts av algoritmen finns representerade i resultatet." -msgid "" -"After computing the contraction hierarchies, an order is now given to the " -"vertices," -msgstr "" -"Efter att ha beräknat sammandragningshierarkierna ges nu en ordning till " -"topparna," +msgid "After computing the contraction hierarchies, an order is now given to the vertices," +msgstr "Efter att ha beräknat sammandragningshierarkierna ges nu en ordning till topparna," -msgid "" -"in order to be used with a specific Dijkstra algorithm (implementation " -"coming in a future version), which speeds up the search." -msgstr "" -"för att kunna användas med en specifik Dijkstra-algoritm (implementering " -"kommer i en framtida version), som snabbar upp sökningen." +msgid "in order to be used with a specific Dijkstra algorithm (implementation coming in a future version), which speeds up the search." +msgstr "för att kunna användas med en specifik Dijkstra-algoritm (implementering kommer i en framtida version), som snabbar upp sökningen." msgid "We obtain the contracted graph above:" msgstr "Vi får den kontraherade grafen ovan:" -msgid "" -"We can see without surprise that the vertices belonging to the shortcuts " -"have a tendency to have a high priority level in the resulting vertices " -"order." -msgstr "" -"Vi kan utan överraskning se att de toppar som tillhör genvägarna har en " -"tendens att ha en hög prioritetsnivå i den resulterande topparnas ordning." +msgid "We can see without surprise that the vertices belonging to the shortcuts have a tendency to have a high priority level in the resulting vertices order." +msgstr "Vi kan utan överraskning se att de toppar som tillhör genvägarna har en tendens att ha en hög prioritetsnivå i den resulterande topparnas ordning." msgid "On an undirected graph with forbidden vertices" msgstr "På en odelad graf med förbjudna toppar" @@ -12127,37 +9290,14 @@ msgstr "Detaljer för sammandragningsprocessens steg" msgid "Shortcut building process" msgstr "Genväg till byggprocessen" -msgid "" -"A vertex ``v`` is contracted by adding shortcuts replacing former paths of " -"the form ``(u, v, w)`` by an edge ``(u, w)``. The shortcut ``(u, w)`` is " -"only needed when ``(u, v, w)`` is the only shortest path between ``u`` and " -"``w``." -msgstr "" -"En topp ``v`` dras samman genom att lägga till genvägar som ersätter " -"tidigare vägar av formen ``(u, v, w)`` med en kant ``(u, w)``. Genvägen " -"``(u, w)`` behövs bara när ``(u, v, w)`` är den enda kortaste vägen mellan " -"``u`` och ``w``." +msgid "A vertex ``v`` is contracted by adding shortcuts replacing former paths of the form ``(u, v, w)`` by an edge ``(u, w)``. The shortcut ``(u, w)`` is only needed when ``(u, v, w)`` is the only shortest path between ``u`` and ``w``." +msgstr "En topp ``v`` dras samman genom att lägga till genvägar som ersätter tidigare vägar av formen ``(u, v, w)`` med en kant ``(u, w)``. Genvägen ``(u, w)`` behövs bara när ``(u, v, w)`` är den enda kortaste vägen mellan ``u`` och ``w``." -msgid "" -"When all shortcuts have been added for a given vertex ``v``, the incident " -"edges of ``v`` are removed and another vertex is contracted with the " -"remaining graph." -msgstr "" -"När alla genvägar har lagts till för ett givet toppunkt ``v`` tas de " -"infallande kanterna för ``v`` bort och ett nytt toppunkt dras samman med den " -"återstående grafen." +msgid "When all shortcuts have been added for a given vertex ``v``, the incident edges of ``v`` are removed and another vertex is contracted with the remaining graph." +msgstr "När alla genvägar har lagts till för ett givet toppunkt ``v`` tas de infallande kanterna för ``v`` bort och ett nytt toppunkt dras samman med den återstående grafen." -msgid "" -"The procedure is destructive for the graph and a copy is made to be able to " -"manipulate it again as a whole. The contraction process adds all discovered " -"shortcuts to the edge set ``E`` and attributes a metric to each contracted " -"vertex. This metric is giving what is called the *contraction hierarchy*." -msgstr "" -"Förfarandet är destruktivt för grafen och en kopia görs för att kunna " -"manipulera den igen som en helhet. Kontraktionsprocessen lägger till alla " -"upptäckta genvägar till kantuppsättningen ``E`` och tilldelar en metrik till " -"varje kontraherad vertex. Denna metrik ger det som kallas " -"*kontraktionshierarkin*." +msgid "The procedure is destructive for the graph and a copy is made to be able to manipulate it again as a whole. The contraction process adds all discovered shortcuts to the edge set ``E`` and attributes a metric to each contracted vertex. This metric is giving what is called the *contraction hierarchy*." +msgstr "Förfarandet är destruktivt för grafen och en kopia görs för att kunna manipulera den igen som en helhet. Kontraktionsprocessen lägger till alla upptäckta genvägar till kantuppsättningen ``E`` och tilldelar en metrik till varje kontraherad vertex. Denna metrik ger det som kallas *kontraktionshierarkin*." msgid "Initialize the queue with a first vertices order" msgstr "Initiera kön med en ordning för första toppar" @@ -12198,75 +9338,29 @@ msgstr ":math:`\\{r, u\\}`" msgid "Adjacent edges are removed." msgstr "Intilliggande kanter tas bort." -msgid "" -"Shortcuts are built from predecessors of ``v`` to successors of ``v`` if and " -"only if the path through ``v`` corresponds to the only shortest path between " -"the predecessor and the successor of ``v`` in the graph. The *edge " -"difference* metric here takes the value of -2." -msgstr "" -"Genvägar byggs från föregångare till ``v`` till efterföljare till ``v`` om " -"och endast om vägen genom ``v`` motsvarar den enda kortaste vägen mellan " -"föregångaren och efterföljaren till ``v`` i grafen. Måttet *kantskillnad* " -"antar här värdet -2." +msgid "Shortcuts are built from predecessors of ``v`` to successors of ``v`` if and only if the path through ``v`` corresponds to the only shortest path between the predecessor and the successor of ``v`` in the graph. The *edge difference* metric here takes the value of -2." +msgstr "Genvägar byggs från föregångare till ``v`` till efterföljare till ``v`` om och endast om vägen genom ``v`` motsvarar den enda kortaste vägen mellan föregångaren och efterföljaren till ``v`` i grafen. Måttet *kantskillnad* antar här värdet -2." -msgid "" -"Then the following vertex is contracted. The process goes on until each node " -"of the graph has been contracted. At the end, there are no more edges in the " -"graph, which has been destroyed by the process." -msgstr "" -"Därefter kontraheras följande toppunkt. Processen fortsätter tills varje nod " -"i grafen har dragits samman. I slutet finns det inte längre några kanter i " -"grafen, som har förstörts av processen." +msgid "Then the following vertex is contracted. The process goes on until each node of the graph has been contracted. At the end, there are no more edges in the graph, which has been destroyed by the process." +msgstr "Därefter kontraheras följande toppunkt. Processen fortsätter tills varje nod i grafen har dragits samman. I slutet finns det inte längre några kanter i grafen, som har förstörts av processen." -msgid "" -"This first contraction will give a vertices order, given by ordering them in " -"ascending order on the metric (edge difference). A total vertices order is " -"built. If ``u < v``, then ``u`` is less important than ``v``. The algorithm " -"keeps the vertices into a queue in this order." -msgstr "" -"Denna första sammandragning ger en vertices-ordning, som ges genom att ordna " -"dem i stigande ordning på metriken (kantskillnaden). En total vertices-" -"ordning byggs upp. Om ``u < v``, så är ``u`` mindre viktig än ``v``. " -"Algoritmen håller topparna i en kö i denna ordning." +msgid "This first contraction will give a vertices order, given by ordering them in ascending order on the metric (edge difference). A total vertices order is built. If ``u < v``, then ``u`` is less important than ``v``. The algorithm keeps the vertices into a queue in this order." +msgstr "Denna första sammandragning ger en vertices-ordning, som ges genom att ordna dem i stigande ordning på metriken (kantskillnaden). En total vertices-ordning byggs upp. Om ``u < v``, så är ``u`` mindre viktig än ``v``. Algoritmen håller topparna i en kö i denna ordning." -msgid "" -"A hierarchy will now be constructed by contracting again the vertices in " -"this order." -msgstr "" -"En hierarki kommer nu att konstrueras genom att åter kontrahera topparna i " -"denna ordning." +msgid "A hierarchy will now be constructed by contracting again the vertices in this order." +msgstr "En hierarki kommer nu att konstrueras genom att åter kontrahera topparna i denna ordning." msgid "Build the final vertex order" msgstr "Bygg den slutliga toppunktsordningen" -msgid "" -"Once the first order built, the algorithm uses it to browse the graph once " -"again. For each vertex taken in the queue, the algorithm simulates " -"contraction and calculates its edge difference. If the computed value is " -"greater than the one of the next vertex to be contracted, then the algorithm " -"puts it back in the queue (heuristic approach). Otherwise it contracts it " -"permanently." -msgstr "" -"När den första ordern har byggts använder algoritmen den för att bläddra " -"igenom grafen igen. För varje toppunkt som tas upp i kön simulerar " -"algoritmen sammandragning och beräknar dess kantskillnad. Om det beräknade " -"värdet är större än värdet för nästa toppunkt som ska dras ihop, lägger " -"algoritmen tillbaka den i kön (heuristisk metod). I annat fall dras den in " -"permanent." +msgid "Once the first order built, the algorithm uses it to browse the graph once again. For each vertex taken in the queue, the algorithm simulates contraction and calculates its edge difference. If the computed value is greater than the one of the next vertex to be contracted, then the algorithm puts it back in the queue (heuristic approach). Otherwise it contracts it permanently." +msgstr "När den första ordern har byggts använder algoritmen den för att bläddra igenom grafen igen. För varje toppunkt som tas upp i kön simulerar algoritmen sammandragning och beräknar dess kantskillnad. Om det beräknade värdet är större än värdet för nästa toppunkt som ska dras ihop, lägger algoritmen tillbaka den i kön (heuristisk metod). I annat fall dras den in permanent." msgid "Add shortcuts to the initial graph" msgstr "Lägga till genvägar till den initiala grafen" -msgid "" -"At the end, the algorithm takes the initial graph (before edges deletions) " -"and adds the shortcut edges to it. It gives you the contracted graph, ready " -"to use with a specialized Dijkstra algorithm, which takes into account the " -"order of the nodes in the hierarchy." -msgstr "" -"I slutet tar algoritmen den ursprungliga grafen (före borttagning av kanter) " -"och lägger till genvägskanterna till den. På så sätt får man en sammandragen " -"graf, redo att användas med en specialiserad Dijkstra-algoritm, som tar " -"hänsyn till nodernas ordning i hierarkin." +msgid "At the end, the algorithm takes the initial graph (before edges deletions) and adds the shortcut edges to it. It gives you the contracted graph, ready to use with a specialized Dijkstra algorithm, which takes into account the order of the nodes in the hierarchy." +msgstr "I slutet tar algoritmen den ursprungliga grafen (före borttagning av kanter) och lägger till genvägskanterna till den. På så sätt får man en sammandragen graf, redo att användas med en specialiserad Dijkstra-algoritm, som tar hänsyn till nodernas ordning i hierarkin." msgid "Use the contraction" msgstr "Använd sammandragning" @@ -12277,11 +9371,8 @@ msgstr "Bygg sammandragningen" msgid "Add shortcuts and hierarchy in the existing tables" msgstr "Lägg till genvägar och hierarki i befintliga tabeller" -msgid "" -"Add new columns in the `vertices` and `edges` tables to store the results:" -msgstr "" -"Lägg till nya kolumner i tabellerna `vertices` och `edges` för att lagra " -"resultaten:" +msgid "Add new columns in the `vertices` and `edges` tables to store the results:" +msgstr "Lägg till nya kolumner i tabellerna `vertices` och `edges` för att lagra resultaten:" msgid "Update and insert the results in the two tables." msgstr "Uppdatera och infoga resultaten i de två tabellerna." @@ -12289,23 +9380,14 @@ msgstr "Uppdatera och infoga resultaten i de två tabellerna." msgid "Use a Dijkstra shortest path algorithm on it" msgstr "Använd en Dijkstra-algoritm för kortaste vägen på den" -msgid "" -"Then you can use any Dijkstra-like algorithm, waiting for the adapted one " -"which will take into account the built vertices hierarchy. For example:" -msgstr "" -"Sedan kan du använda vilken Dijkstra-liknande algoritm som helst och vänta " -"på den anpassade algoritmen som tar hänsyn till den uppbyggda " -"toppunktshierarkin. Till exempel:" +msgid "Then you can use any Dijkstra-like algorithm, waiting for the adapted one which will take into account the built vertices hierarchy. For example:" +msgstr "Sedan kan du använda vilken Dijkstra-liknande algoritm som helst och vänta på den anpassade algoritmen som tar hänsyn till den uppbyggda toppunktshierarkin. Till exempel:" msgid "``pgr_contractionLinear`` - Proposed" msgstr "``pgr_contractionLinear`` - Föreslagen" -msgid "" -"``pgr_contractionLinear`` — Performs graph contraction and returns the " -"contracted vertices and edges." -msgstr "" -"``pgr_contractionLinear`` - Utför grafkontraktion och returnerar de " -"kontraherade topparna och kanterna." +msgid "``pgr_contractionLinear`` — Performs graph contraction and returns the contracted vertices and edges." +msgstr "``pgr_contractionLinear`` - Utför grafkontraktion och returnerar de kontraherade topparna och kanterna." msgid "pgr_contractionLinear(`Edges SQL`_, [**options**])" msgstr "pgr_contractionLinear(`Kanter SQL`_, [**options**])" @@ -12313,17 +9395,11 @@ msgstr "pgr_contractionLinear(`Kanter SQL`_, [**options**])" msgid "Linear contraction on an undirected graph." msgstr "Linjär sammandragning på en odelad graf." -msgid "" -"The green nodes are linear nodes and will not be part of the contracted " -"graph." -msgstr "" -"De gröna noderna är linjära noder och kommer inte att vara en del av den " -"kontrakterade grafen." +msgid "The green nodes are linear nodes and will not be part of the contracted graph." +msgstr "De gröna noderna är linjära noder och kommer inte att vara en del av den kontrakterade grafen." msgid "All edges adjacent will not be part of the contracted graph." -msgstr "" -"Alla angränsande kanter kommer inte att vara en del av den kontraherade " -"grafen." +msgstr "Alla angränsande kanter kommer inte att vara en del av den kontraherade grafen." msgid "The red lines will be new edges of the contracted graph." msgstr "De röda linjerna kommer att vara nya kanter i den kontraherade grafen." @@ -12331,12 +9407,8 @@ msgstr "De röda linjerna kommer att vara nya kanter i den kontraherade grafen." msgid "**contraction Order**" msgstr "**contraction Order**" -msgid "" -"Number of times the contraction operations on ``contraction_order`` will be " -"performed." -msgstr "" -"Antal gånger som sammandragningsoperationerna på ``contraction_order`` " -"kommer att utföras." +msgid "Number of times the contraction operations on ``contraction_order`` will be performed." +msgstr "Antal gånger som sammandragningsoperationerna på ``contraction_order`` kommer att utföras." msgid "A node connects two (or more) `linear` edges when" msgstr "En nod förbinder två (eller fler) `linjära` kanter när" @@ -12356,19 +9428,11 @@ msgstr "Linjäriteten är inte symmetrisk" msgid "Graph where linearity is not symmetrical." msgstr "Graf där linjäriteten inte är symmetrisk." -msgid "" -"When the graph is processed as a directed graph, linearity is not " -"symmetrical, therefore the graph can not be contracted." -msgstr "" -"När grafen bearbetas som en riktad graf är linjäriteten inte symmetrisk, och " -"grafen kan därför inte dras ihop." +msgid "When the graph is processed as a directed graph, linearity is not symmetrical, therefore the graph can not be contracted." +msgstr "När grafen bearbetas som en riktad graf är linjäriteten inte symmetrisk, och grafen kan därför inte dras ihop." -msgid "" -"When the same graph is processed as an undirected graph, linearity is " -"symmetrical, therefore the graph can be contracted." -msgstr "" -"När samma graf behandlas som en odelad graf är linjäriteten symmetrisk och " -"grafen kan därför krympas." +msgid "When the same graph is processed as an undirected graph, linearity is symmetrical, therefore the graph can be contracted." +msgstr "När samma graf behandlas som en odelad graf är linjäriteten symmetrisk och grafen kan därför krympas." msgid "The three edges can be replaced by one undirected edge" msgstr "De tre kanterna kan ersättas med en ostyrd kant" @@ -12403,12 +9467,8 @@ msgstr "De fyra kanterna kan ersättas med en ostyrd kant." msgid "Step by step linear contraction" msgstr "Steg för steg linjär sammandragning" -msgid "" -"The linear contraction will stop when there are no more linear edges. For " -"example from the following graph there are linear edges" -msgstr "" -"Den linjära sammandragningen upphör när det inte längre finns några linjära " -"kanter. Till exempel från följande graf finns det linjära kanter" +msgid "The linear contraction will stop when there are no more linear edges. For example from the following graph there are linear edges" +msgstr "Den linjära sammandragningen upphör när det inte längre finns några linjära kanter. Till exempel från följande graf finns det linjära kanter" msgid "Contracting vertex :math:`3`," msgstr "Contracting vertex :math:`3`," @@ -12416,17 +9476,11 @@ msgstr "Contracting vertex :math:`3`," msgid "The vertex :math:`3` is removed from the graph" msgstr "Toppunkten :math:`3` tas bort från grafen" -msgid "" -"The edges :math:`2 \\rightarrow 3` and :math:`w \\rightarrow z` are removed " -"from the graph." -msgstr "" -"Kanterna :math:`2 \\rightarrow 3` och :math:`w \\rightarrow z` tas bort från " -"grafen." +msgid "The edges :math:`2 \\rightarrow 3` and :math:`w \\rightarrow z` are removed from the graph." +msgstr "Kanterna :math:`2 \\rightarrow 3` och :math:`w \\rightarrow z` tas bort från grafen." -msgid "" -"A new edge :math:`2 \\rightarrow 4` is inserted represented with red color." -msgstr "" -"En ny kant :math:`2 \\rightarrow 4` infogas representerad med röd färg." +msgid "A new edge :math:`2 \\rightarrow 4` is inserted represented with red color." +msgstr "En ny kant :math:`2 \\rightarrow 4` infogas representerad med röd färg." msgid "Contracting vertex :math:`2`:" msgstr "Kontraherande vertex :math:`2`:" @@ -12434,24 +9488,14 @@ msgstr "Kontraherande vertex :math:`2`:" msgid "The vertex :math:`2` is removed from the graph" msgstr "Toppunkten :math:`2` tas bort från grafen" -msgid "" -"The edges :math:`1 \\rightarrow 2` and :math:`2 \\rightarrow 3` are removed " -"from the graph." -msgstr "" -"Kanterna :math:`1 \\rightarrow 2` och :math:`2 \\rightarrow 3` tas bort från " -"grafen." +msgid "The edges :math:`1 \\rightarrow 2` and :math:`2 \\rightarrow 3` are removed from the graph." +msgstr "Kanterna :math:`1 \\rightarrow 2` och :math:`2 \\rightarrow 3` tas bort från grafen." -msgid "" -"A new edge :math:`1 \\rightarrow 3` is inserted represented with red color." -msgstr "" -"En ny kant :math:`1 \\rightarrow 3` infogas representerad med röd färg." +msgid "A new edge :math:`1 \\rightarrow 3` is inserted represented with red color." +msgstr "En ny kant :math:`1 \\rightarrow 3` infogas representerad med röd färg." -msgid "" -"Edge :math:`1 \\rightarrow 3` has the information of cost and the nodes that " -"were contracted." -msgstr "" -"Edge :math:`1 \\rightarrow 3` har information om kostnad och de noder som " -"kontrakterades." +msgid "Edge :math:`1 \\rightarrow 3` has the information of cost and the nodes that were contracted." +msgstr "Edge :math:`1 \\rightarrow 3` har information om kostnad och de noder som kontrakterades." msgid "Create the contracted graph." msgstr "Skapa den kontraherade grafen." @@ -12459,42 +9503,23 @@ msgstr "Skapa den kontraherade grafen." msgid "``pgr_cuthillMckeeOrdering`` - Experimental" msgstr "``pgr_cuthillMckeeOrdering`` - Experimentell" -msgid "" -"``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of " -"an undirected graphs" -msgstr "" -"``pgr_cuthillMckeeOrdering`` - Returnerar den omvända Cuthill-Mckee-" -"ordningen för en ostyrd graf" +msgid "``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of an undirected graphs" +msgstr "``pgr_cuthillMckeeOrdering`` - Returnerar den omvända Cuthill-Mckee-ordningen för en ostyrd graf" msgid "Version 3.4.0" msgstr "Version 3.4.0" -msgid "" -"In numerical linear algebra, the Cuthill-McKee algorithm (CM), named after " -"Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse " -"matrix that has a symmetric sparsity pattern into a band matrix form with a " -"small bandwidth." -msgstr "" -"Inom numerisk linjär algebra är Cuthill-McKee-algoritmen (CM), uppkallad " -"efter Elizabeth Cuthill och James McKee, en algoritm för att permutera en " -"gles matris som har ett symmetriskt gleshetsmönster till en bandmatrisform " -"med liten bandbredd." +msgid "In numerical linear algebra, the Cuthill-McKee algorithm (CM), named after Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse matrix that has a symmetric sparsity pattern into a band matrix form with a small bandwidth." +msgstr "Inom numerisk linjär algebra är Cuthill-McKee-algoritmen (CM), uppkallad efter Elizabeth Cuthill och James McKee, en algoritm för att permutera en gles matris som har ett symmetriskt gleshetsmönster till en bandmatrisform med liten bandbredd." -msgid "" -"The vertices are basically assigned a breadth-first search order, except " -"that at each step, the adjacent vertices are placed in the queue in order of " -"increasing degree." -msgstr "" -"Topparna tilldelas i princip en bredd-första sökordning, förutom att de " -"intilliggande topparna i varje steg placeras i kön i stigande grad." +msgid "The vertices are basically assigned a breadth-first search order, except that at each step, the adjacent vertices are placed in the queue in order of increasing degree." +msgstr "Topparna tilldelas i princip en bredd-första sökordning, förutom att de intilliggande topparna i varje steg placeras i kön i stigande grad." msgid "The implementation is for **undirected** graphs." msgstr "Implementationen är för **undirected** grafer." -msgid "" -"The bandwidth minimization problems are considered NP-complete problems." -msgstr "" -"Problemen med att minimera bandbredden anses vara NP-kompletta problem." +msgid "The bandwidth minimization problems are considered NP-complete problems." +msgstr "Problemen med att minimera bandbredden anses vara NP-kompletta problem." msgid "The running time complexity is: :math:`O(m log(m)|V|)`" msgstr "Körtidskomplexiteten är: :math:`O(m log(m)|V|)`" @@ -12523,68 +9548,32 @@ msgstr "Ordningsföljd med början från 1." msgid "New ordering in reverse order." msgstr "Ny beställning i omvänd ordning." -msgid "" -"`Boost: Cuthill-McKee Ordering `__" -msgstr "" -"`Boost: Cuthill-McKee Beställning `__" +msgid "`Boost: Cuthill-McKee Ordering `__" +msgstr "`Boost: Cuthill-McKee Beställning `__" -msgid "" -"`Wikipedia: Cuthill-McKee Ordering `__" -msgstr "" -"`Wikipedia: Cuthill-McKee-ordning `__" +msgid "`Wikipedia: Cuthill-McKee Ordering `__" +msgstr "`Wikipedia: Cuthill-McKee-ordning `__" msgid "``pgr_dagShortestPath`` - Experimental" msgstr "``pgr_dagShortestPath`` - Experimentell" -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`` - Returnerar den kortaste vägen för viktade riktade " -"acykliska grafer (DAG). I synnerhet är DAG-algoritmen för kortaste vägar " -"implementerad av Boost.Graph." +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`` - Returnerar den kortaste vägen för viktade riktade acykliska grafer (DAG). I synnerhet är DAG-algoritmen för kortaste vägar implementerad av Boost.Graph." msgid "pgr_dagShortestPath(Combinations)" msgstr "pgr_dagShortestPath(Combinations)" -msgid "" -"Shortest Path for Directed Acyclic Graph(DAG) is a graph search algorithm " -"that solves the shortest path problem for weighted directed acyclic graph, " -"producing a shortest path from a starting vertex (``start_vid``) to an " -"ending vertex (``end_vid``)." -msgstr "" -"Shortest Path for Directed Acyclic Graph(DAG) är en grafsökningsalgoritm som " -"löser problemet med kortaste vägen för viktad riktad acyklisk graf, vilket " -"ger en kortaste väg från ett startvertex (``start_vid``) till ett slutvertex " -"(``end_vid``)." +msgid "Shortest Path for Directed Acyclic Graph(DAG) is a graph search algorithm that solves the shortest path problem for weighted directed acyclic graph, producing a shortest path from a starting vertex (``start_vid``) to an ending vertex (``end_vid``)." +msgstr "Shortest Path for Directed Acyclic Graph(DAG) är en grafsökningsalgoritm som löser problemet med kortaste vägen för viktad riktad acyklisk graf, vilket ger en kortaste väg från ett startvertex (``start_vid``) till ett slutvertex (``end_vid``)." -msgid "" -"This implementation can only be used with a **directed** graph with no " -"cycles i.e. directed acyclic graph." -msgstr "" -"Denna implementation kan endast användas med en **riktad** graf utan cykler, " -"dvs. en riktad acyklisk graf." +msgid "This implementation can only be used with a **directed** graph with no cycles i.e. directed acyclic graph." +msgstr "Denna implementation kan endast användas med en **riktad** graf utan cykler, dvs. en riktad acyklisk graf." -msgid "" -"The algorithm relies on topological sorting the dag to impose a linear " -"ordering on the vertices, and thus is more efficient for DAG's than either " -"the Dijkstra or Bellman-Ford algorithm." -msgstr "" -"Algoritmen förlitar sig på topologisk sortering av DAG för att införa en " -"linjär ordning på topparna och är därmed effektivare för DAG än både " -"Dijkstra- och Bellman-Ford-algoritmen." +msgid "The algorithm relies on topological sorting the dag to impose a linear ordering on the vertices, and thus is more efficient for DAG's than either the Dijkstra or Bellman-Ford algorithm." +msgstr "Algoritmen förlitar sig på topologisk sortering av DAG för att införa en linjär ordning på topparna och är därmed effektivare för DAG än både Dijkstra- och Bellman-Ford-algoritmen." -msgid "" -"Process is valid for weighted directed acyclic graphs only. otherwise it " -"will throw warnings." -msgstr "" -"Processen är endast giltig för viktade riktade acykliska grafer. annars " -"kommer den att ge varningar." +msgid "Process is valid for weighted directed acyclic graphs only. otherwise it will throw warnings." +msgstr "Processen är endast giltig för viktade riktade acykliska grafer. annars kommer den att ge varningar." msgid "The `agg_cost` the non included values `(v, v)` is `0`" msgstr "Den `agg_cost` de icke inkluderade värdena `(v, v)` är `0`" @@ -12611,8 +9600,7 @@ msgid "pgr_dagShortestPath(`Edges SQL`_, `Combinations SQL`_)" msgstr "pgr_dagShortestPath(`Kanter SQL`_, `Combinations SQL`_)" msgid "From vertex :math:`5` to vertex :math:`11` on a **directed** graph" -msgstr "" -"Från toppunkten :math:`5` till toppunkten :math:`11` på en **riktad** graf" +msgstr "Från toppunkten :math:`5` till toppunkten :math:`11` på en **riktad** graf" msgid "From vertex :math:`5` to vertices :math:`\\{7, 11\\}`" msgstr "Från toppunkten :math:`5` till toppunkterna :math:`{7, 11\\}`" @@ -12620,12 +9608,8 @@ msgstr "Från toppunkten :math:`5` till toppunkterna :math:`{7, 11\\}`" msgid "From vertices :math:`\\{5, 10\\}` to vertex :math:`11`" msgstr "Från topparna :math:`\\{5, 10\\}` till topp :math:`11`" -msgid "" -"From vertices :math:`\\{5, 15\\}` to vertices :math:`\\{11, 17\\}` on an " -"**undirected** graph" -msgstr "" -"Från topparna :math:`\\{5, 15\\}` till topparna :math:`\\{11, 17\\}` i en " -"**omdirigerad** graf" +msgid "From vertices :math:`\\{5, 15\\}` to vertices :math:`\\{11, 17\\}` on an **undirected** graph" +msgstr "Från topparna :math:`\\{5, 15\\}` till topparna :math:`\\{11, 17\\}` i en **omdirigerad** graf" msgid "Return columns" msgstr "Returnera kolumner" @@ -12633,12 +9617,8 @@ msgstr "Returnera kolumner" msgid "Making **start_vids** the same as **end_vids**" msgstr "Gör **start_vids** till samma sak som **end_vids**" -msgid "" -"`Boost: DAG shortest paths `__" -msgstr "" -"`Boost: DAG kortaste vägar `__" +msgid "`Boost: DAG shortest paths `__" +msgstr "`Boost: DAG kortaste vägar `__" msgid "https://en.wikipedia.org/wiki/Topological_sorting" msgstr "https://en.wikipedia.org/wiki/Topological_sorting" @@ -12646,12 +9626,8 @@ msgstr "https://en.wikipedia.org/wiki/Topological_sorting" msgid "``pgr_degree``" msgstr "``pgr_degree``" -msgid "" -"``pgr_degree`` — For each vertex in an undirected graph, return the count of " -"edges incident to the vertex." -msgstr "" -"``pgr_degree`` - För varje toppunkt i en odelad graf, returnera antalet " -"kanter som är kopplade till toppunktet." +msgid "``pgr_degree`` — For each vertex in an undirected graph, return the count of edges incident to the vertex." +msgstr "``pgr_degree`` - För varje toppunkt i en odelad graf, returnera antalet kanter som är kopplade till toppunktet." msgid "Error messages adjustment." msgstr "Justering av felmeddelanden." @@ -12662,12 +9638,8 @@ msgstr "Ny signatur med endast Edges SQL." msgid "Calculates the degree of the vertices of an undirected graph" msgstr "Beräknar graden för topparna i en odelad graf" -msgid "" -"The degree (or valency) of a vertex of a graph is the number of edges that " -"are incident to the vertex." -msgstr "" -"Graden (eller valensen) för ett toppunkt i en graf är antalet kanter som är " -"angränsande till toppunktet." +msgid "The degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex." +msgstr "Graden (eller valensen) för ett toppunkt i en graf är antalet kanter som är angränsande till toppunktet." msgid "A loop contributes 2 to a vertex's degree." msgstr "En loop bidrar med 2 till en topps grad." @@ -12678,20 +9650,13 @@ msgstr "Ett toppunkt med grad 0 kallas ett isolerat toppunkt." msgid "Isolated vertex is not part of the result" msgstr "Isolerad toppunkt är inte en del av resultatet" -msgid "" -"Vertex not participating on the subgraph is considered and isolated vertex." +msgid "Vertex not participating on the subgraph is considered and isolated vertex." msgstr "Vertex som inte deltar i undergrafen betraktas som en isolerad vertex." -msgid "" -"There can be a ``dryrun`` execution and the code used to get the answer will " -"be shown in a PostgreSQL ``NOTICE``." -msgstr "" -"Det kan finnas en ``dryrun`` exekvering och koden som används för att få " -"svaret kommer att visas i en PostgreSQL ``NOTICE``." +msgid "There can be a ``dryrun`` execution and the code used to get the answer will be shown in a PostgreSQL ``NOTICE``." +msgstr "Det kan finnas en ``dryrun`` exekvering och koden som används för att få svaret kommer att visas i en PostgreSQL ``NOTICE``." -msgid "" -"The code can be used as base code for the particular application " -"requirements." +msgid "The code can be used as base code for the particular application requirements." msgstr "Koden kan användas som baskod för de specifika applikationskraven." msgid "No ordering is performed." @@ -12722,16 +9687,10 @@ msgid "Extracting the vertex information" msgstr "Extrahera information om toppunkt" msgid "``pgr_degree`` can use :doc:`pgr_extractVertices` embedded in the call." -msgstr "" -"``pgr_degree`` kan använda :doc:`pgr_extractVertices` inbäddad i anropet." +msgstr "``pgr_degree`` kan använda :doc:`pgr_extractVertices` inbäddad i anropet." -msgid "" -"For decent size networks, it is best to prepare your vertices table before " -"hand and use it on ``pgr_degree`` calls. (See `Using a vertex table`_)" -msgstr "" -"För nätverk av anständig storlek är det bäst att förbereda vertex-tabellen i " -"förväg och använda den vid anrop av ``pgr_degree``. (Se `Användning av en " -"vertex-tabell`_)" +msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls. (See `Using a vertex table`_)" +msgstr "För nätverk av anständig storlek är det bäst att förbereda vertex-tabellen i förväg och använda den vid anrop av ``pgr_degree``. (Se `Användning av en vertex-tabell`_)" msgid "Calculate the degree of the nodes:" msgstr "Beräkna nodernas grad:" @@ -12746,8 +9705,7 @@ msgid "``dryrun``" msgstr "``dryrun``" msgid "When true do not process and get in a NOTICE the resulting query." -msgstr "" -"När det är sant bearbeta inte och få i ett NÄRVARO den resulterande frågan." +msgstr "När det är sant bearbeta inte och få i ett NÄRVARO den resulterande frågan." msgid "For the `Edges and Vertices`_ signature:" msgstr "För signaturen `Edges and Vertices`_:" @@ -12761,12 +9719,8 @@ msgstr "Vertex SQL" msgid "``in_edges``" msgstr "``in_edges``" -msgid "" -"Array of identifiers of the edges that have the vertex ``id`` as *first end " -"point*." -msgstr "" -"Array med identifierare för de kanter som har toppunkten ``id`` som *första " -"slutpunkt*." +msgid "Array of identifiers of the edges that have the vertex ``id`` as *first end point*." +msgstr "Array med identifierare för de kanter som har toppunkten ``id`` som *första slutpunkt*." msgid "When missing, ``out_edges`` must exist." msgstr "När den saknas måste ``out_edges`` finnas." @@ -12774,12 +9728,8 @@ msgstr "När den saknas måste ``out_edges`` finnas." msgid "``out_edges``" msgstr "``out_edges``" -msgid "" -"Array of identifiers of the edges that have the vertex ``id`` as *second end " -"point*." -msgstr "" -"Array med identifierare för de kanter som har toppunkten ``id`` som *andra " -"slutpunkt*." +msgid "Array of identifiers of the edges that have the vertex ``id`` as *second end point*." +msgstr "Array med identifierare för de kanter som har toppunkten ``id`` som *andra slutpunkt*." msgid "When missing, ``in_edges`` must exist." msgstr "När den saknas måste ``in_edges`` finnas." @@ -12809,8 +9759,7 @@ msgid "For the following is a subgraph of the :doc:`sampledata`:" msgstr "För följande är en delgraf av :doc:`sampledata`:" msgid ":math:`E = \\{(1, 5 \\leftrightarrow 6), (1, 6 \\leftrightarrow 10)\\}`" -msgstr "" -":math:`E = \\{(1, 5 \\leftrightarrow 6), (1, 6 \\leftrightarrow 10)\\}`" +msgstr ":math:`E = \\{(1, 5 \\leftrightarrow 6), (1, 6 \\leftrightarrow 10)\\}`" msgid ":math:`V = \\{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17\\}`" msgstr ":math:`V = \\{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17\\}`" @@ -12827,12 +9776,8 @@ msgstr "deras examen visas inte i utdata." msgid "Using a vertex table" msgstr "Använda en toppunktstabell" -msgid "" -"For decent size networks, it is best to prepare your vertices table before " -"hand and use it on ``pgr_degree`` calls." -msgstr "" -"För nätverk av anständig storlek är det bäst att förbereda vertices-tabellen " -"i förväg och använda den vid anrop av ``pgr_degree``." +msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls." +msgstr "För nätverk av anständig storlek är det bäst att förbereda vertices-tabellen i förväg och använda den vid anrop av ``pgr_degree``." msgid "Extract the vertex information and save into a table:" msgstr "Extrahera toppunktsinformationen och spara i en tabell:" @@ -12840,33 +9785,17 @@ msgstr "Extrahera toppunktsinformationen och spara i en tabell:" msgid "Dry run execution" msgstr "Utförande av provkörning" -msgid "" -"To get the query generated used to get the vertex information, use ``dryrun " -"=> true``." -msgstr "" -"Använd ``dryrun => true`` för att få den fråga som genereras för att få fram " -"toppunktsinformationen." +msgid "To get the query generated used to get the vertex information, use ``dryrun => true``." +msgstr "Använd ``dryrun => true`` för att få den fråga som genereras för att få fram toppunktsinformationen." -msgid "" -"The results can be used as base code to make a refinement based on the " -"backend development needs." -msgstr "" -"Resultaten kan användas som baskod för att göra en förfining baserad på " -"behoven för backend-utvecklingen." +msgid "The results can be used as base code to make a refinement based on the backend development needs." +msgstr "Resultaten kan användas som baskod för att göra en förfining baserad på behoven för backend-utvecklingen." msgid "Finding dead ends" msgstr "Att hitta återvändsgränder" -msgid "" -"If there is a vertices table already built using ``pgr_extractVertices`` and " -"want the degree of the whole graph rather than a subset, it can be forgo " -"using ``pgr_degree`` and work with the ``in_edges`` and ``out_edges`` " -"columns directly." -msgstr "" -"Om det redan finns en toppunktstabell som byggts med hjälp av " -"``pgr_extractVertices`` och man vill ha graden för hela grafen i stället för " -"en delmängd, kan man avstå från att använda ``pgr_degree`` och arbeta med " -"kolumnerna ``in_edges`` och ``out_edges`` direkt." +msgid "If there is a vertices table already built using ``pgr_extractVertices`` and want the degree of the whole graph rather than a subset, it can be forgo using ``pgr_degree`` and work with the ``in_edges`` and ``out_edges`` columns directly." +msgstr "Om det redan finns en toppunktstabell som byggts med hjälp av ``pgr_extractVertices`` och man vill ha graden för hela grafen i stället för en delmängd, kan man avstå från att använda ``pgr_degree`` och arbeta med kolumnerna ``in_edges`` och ``out_edges`` direkt." msgid "The degree of a dead end is 1." msgstr "Graden av en återvändsgränd är 1." @@ -12877,11 +9806,8 @@ msgstr "Hitta linjära hörn" msgid "The degree of a linear vertex is 2." msgstr "Graden för ett linjärt toppunkt är 2." -msgid "" -"If there is a vertices table already built using the ``pgr_extractVertices``" -msgstr "" -"Om det redan finns en toppunktstabell som byggts upp med hjälp av " -"``pgr_extractVertices``" +msgid "If there is a vertices table already built using the ``pgr_extractVertices``" +msgstr "Om det redan finns en toppunktstabell som byggts upp med hjälp av ``pgr_extractVertices``" msgid ":doc:`pgr_extractVertices`" msgstr ":doc:`pgr_extractVertices`" @@ -12889,67 +9815,35 @@ msgstr ":doc:`pgr_extractVertices`" msgid "``pgr_depthFirstSearch`` - Proposed" msgstr "``pgr_depthFirstSearch`` - Föreslagen" -msgid "" -"``pgr_depthFirstSearch`` — Returns a depth first search traversal of the " -"graph. The graph can be directed or undirected." -msgstr "" -"``pgr_depthFirstSearch`` - Returnerar en genomgång av grafen med första " -"sökdjupet. Grafen kan vara riktad eller oriktad." +msgid "``pgr_depthFirstSearch`` — Returns a depth first search traversal of the graph. The graph can be directed or undirected." +msgstr "``pgr_depthFirstSearch`` - Returnerar en genomgång av grafen med första sökdjupet. Grafen kan vara riktad eller oriktad." msgid "Version 3.3.0" msgstr "Version 3.3.0" -msgid "" -"Depth First Search algorithm is a traversal algorithm which starts from a " -"root vertex, goes as deep as possible, and backtracks once a vertex is " -"reached with no adjacent vertices or with all visited adjacent vertices. The " -"traversal continues until all the vertices reachable from the root vertex " -"are visited." -msgstr "" -"Depth First Search-algoritmen är en traverseringsalgoritm som startar från " -"en rotvertex, går så djupt som möjligt och backar när en vertex nås utan " -"några intilliggande vertex eller med alla besökta intilliggande vertex. " -"Traversieringen fortsätter tills alla toppar som kan nås från rotvertexen " -"har besökts." +msgid "Depth First Search algorithm is a traversal algorithm which starts from a root vertex, goes as deep as possible, and backtracks once a vertex is reached with no adjacent vertices or with all visited adjacent vertices. The traversal continues until all the vertices reachable from the root vertex are visited." +msgstr "Depth First Search-algoritmen är en traverseringsalgoritm som startar från en rotvertex, går så djupt som möjligt och backar när en vertex nås utan några intilliggande vertex eller med alla besökta intilliggande vertex. Traversieringen fortsätter tills alla toppar som kan nås från rotvertexen har besökts." -msgid "" -"The implementation works for both **directed** and **undirected** graphs." -msgstr "" -"Implementationen fungerar för både **directed** och **undirected** grafer." +msgid "The implementation works for both **directed** and **undirected** graphs." +msgstr "Implementationen fungerar för både **directed** och **undirected** grafer." -msgid "" -"Provides the Depth First Search traversal order from a root vertex or from a " -"set of root vertices." -msgstr "" -"Ger traversieringsordningen Depth First Search från en rotvertex eller från " -"en uppsättning rotvertex." +msgid "Provides the Depth First Search traversal order from a root vertex or from a set of root vertices." +msgstr "Ger traversieringsordningen Depth First Search från en rotvertex eller från en uppsättning rotvertex." -msgid "" -"An optional non-negative maximum depth parameter to limit the results up to " -"a particular depth." -msgstr "" -"En valfri icke-negativ parameter för maximalt djup för att begränsa " -"resultaten till ett visst djup." +msgid "An optional non-negative maximum depth parameter to limit the results up to a particular depth." +msgstr "En valfri icke-negativ parameter för maximalt djup för att begränsa resultaten till ett visst djup." -msgid "" -"For optimization purposes, any duplicated values in the `Root vids` are " -"ignored." -msgstr "" -"För optimeringsändamål ignoreras alla duplicerade värden i `Root vids`." +msgid "For optimization purposes, any duplicated values in the `Root vids` are ignored." +msgstr "För optimeringsändamål ignoreras alla duplicerade värden i `Root vids`." -msgid "" -"It does not produce the shortest path from a root vertex to a target vertex." -msgstr "" -"Den producerar inte den kortaste vägen från en rotvertex till en målvertex." +msgid "It does not produce the shortest path from a root vertex to a target vertex." +msgstr "Den producerar inte den kortaste vägen från en rotvertex till en målvertex." msgid "The aggregate cost of traversal is not guaranteed to be minimal." -msgstr "" -"Det är inte säkert att den sammanlagda kostnaden för traverseringen är " -"minimal." +msgstr "Det är inte säkert att den sammanlagda kostnaden för traverseringen är minimal." msgid "The returned values are ordered in ascending order of `start_vid`." -msgstr "" -"De returnerade värdena är ordnade i stigande ordning efter `start_vid`." +msgstr "De returnerade värdena är ordnade i stigande ordning efter `start_vid`." msgid "Depth First Search Running time: :math:`O(E + V)`" msgstr "Djup Första sökning Löptid: :math:`O(E + V)`" @@ -12964,29 +9858,16 @@ msgid "**options:** ``[directed, max_depth]``" msgstr "**options:** ``[directed, max_depth]``" msgid "Same as `Single vertex`_ but with edges in descending order of ``id``." -msgstr "" -"Samma som `Single vertex`_ men med kanter i fallande ordning efter ``id``." +msgstr "Samma som `Single vertex`_ men med kanter i fallande ordning efter ``id``." -msgid "" -"`Boost: Depth First Search `__" -msgstr "" -"`Boost: Djup första sökning `__" +msgid "`Boost: Depth First Search `__" +msgstr "`Boost: Djup första sökning `__" -msgid "" -"`Boost: Undirected DFS `__" -msgstr "" -"`Boost: Oriktad DFS `__" +msgid "`Boost: Undirected DFS `__" +msgstr "`Boost: Oriktad DFS `__" -msgid "" -"`Wikipedia: Depth First Search algorithm `__" -msgstr "" -"`Wikipedia: Djup först-sökalgoritm `__" +msgid "`Wikipedia: Depth First Search algorithm `__" +msgstr "`Wikipedia: Djup först-sökalgoritm `__" msgid "``pgr_dijkstra`` — Shortest path using Dijkstra algorithm." msgstr "``pgr_dijkstra`` - Kortaste vägen med Dijkstra-algoritmen." @@ -13025,33 +9906,25 @@ msgid "Signature change on pgr_dijkstra(One to One)" msgstr "Ändring av signatur på pgr_dijkstra(One to One)" msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "" -"pgr_dijkstra(`Kanter SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_dijkstra(`Kanter SQL`_, **start vid**, **end vid**, [``directed``])" msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "" -"pgr_dijkstra(`Kanter SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_dijkstra(`Kanter SQL`_, **start vid**, **end vids**, [``directed``])" msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "" -"pgr_dijkstra(`Kanter SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_dijkstra(`Kanter SQL`_, **start vids**, **end vid**, [``directed``])" msgid "pgr_dijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "pgr_dijkstra(`Kanter SQL`_, `Combinations SQL`_, [``directed``])" -msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**" -msgstr "" -"Från toppunkten :math:`6` till toppunkterna :math:`\\{10, 17\\}` på en " -"**riktad**" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**" +msgstr "Från toppunkten :math:`6` till toppunkterna :math:`\\{10, 17\\}` på en **riktad**" -msgid "" -"The examples of this section are based on the :doc:`sampledata` network." +msgid "The examples of this section are based on the :doc:`sampledata` network." msgstr "Exemplen i detta avsnitt är baserade på :doc:`sampledata`-nätverket." msgid "For **directed** graphs with ``cost`` and ``reverse_cost`` columns" -msgstr "" -"För **riktade** grafer med kolumnerna ``kostnad`` och ``omvända_kostnader``" +msgstr "För **riktade** grafer med kolumnerna ``kostnad`` och ``omvända_kostnader``" msgid "Directed graph with cost and reverse cost columns" msgstr "Riktad graf med kolumner för kostnad och omvänd kostnad" @@ -13081,8 +9954,7 @@ msgid "Paths :math:`\\{6, 12\\}\\rightarrow\\{7\\}`" msgstr "Banor :math:`\\{6, 12\\}\\rightarrow\\{7\\}` `" msgid "7) Using `Many to Many`_ to get the solution of examples 1 to 4" -msgstr "" -"7) Använda `Många till många`_ för att få lösningen på exempel 1 till 4" +msgstr "7) Använda `Många till många`_ för att få lösningen på exempel 1 till 4" msgid "Paths :math:`\\{6, 12\\}\\rightarrow\\{10, 7\\}`" msgstr "Banor :math:`\\{6, 12\\}\\rightarrow\\{10, 7\\}`" @@ -13090,15 +9962,11 @@ msgstr "Banor :math:`\\{6, 12\\}\\rightarrow\\{10, 7\\}`" msgid "8) Using `Combinations`_ to get the solution of examples 1 to 3" msgstr "8) Använda `Kombinationer`_ för att få lösningen på exempel 1 till 3" -msgid "" -"Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" -msgstr "" -"Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" +msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" +msgstr "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" msgid "For **undirected** graphs with ``cost`` and ``reverse_cost`` columns" -msgstr "" -"För **omdirigerade** grafer med kolumnerna ``kostnad`` och ``omvända " -"kostnader``" +msgstr "För **omdirigerade** grafer med kolumnerna ``kostnad`` och ``omvända kostnader``" msgid "Undirected graph with cost and reverse cost columns" msgstr "Oriktad graf med kostnads- och omvända kostnadskolumner" @@ -13116,15 +9984,13 @@ msgid "12) Path from :math:`12` to :math:`7`" msgstr "12) Väg från :math:`12` till :math:`7`" msgid "13) Using `One to Many`_ to get the solution of examples 9 and 10" -msgstr "" -"13) Använda `En till många`_ för att få lösningen till exempel 9 och 10" +msgstr "13) Använda `En till många`_ för att få lösningen till exempel 9 och 10" msgid "14) Using `Many to One`_ to get the solution of examples 10 and 12" msgstr "14) Använda `Många till en`_ för att få lösningen på exempel 10 och 12" msgid "15) Using `Many to Many`_ to get the solution of examples 9 to 12" -msgstr "" -"15) Använda `Många till många`_ för att få lösningen på exempel 9 till 12" +msgstr "15) Använda `Många till många`_ för att få lösningen på exempel 9 till 12" msgid "16) Using `Combinations`_ to get the solution of examples 9 to 11" msgstr "16) Använda `Kombinationer`_ för att få lösningen på exempel 9 till 11" @@ -13154,12 +10020,10 @@ msgid "22) Using `Many to One`_ to get the solution of examples 18 and 20" msgstr "22) Använda `Många till en`_ för att få lösningen på exempel 18 och 20" msgid "23) Using `Many to Many`_ to get the solution of examples 17 to 20" -msgstr "" -"23) Använda `Många till många`_ för att få lösningen på exempel 17 till 20" +msgstr "23) Använda `Många till många`_ för att få lösningen på exempel 17 till 20" msgid "24) Using `Combinations`_ to get the solution of examples 17 to 19" -msgstr "" -"24) Använda `Kombinationer`_ för att få lösningen på exempel 17 till 19" +msgstr "24) Använda `Kombinationer`_ för att få lösningen på exempel 17 till 19" msgid "For **undirected** graphs only with ``cost`` column" msgstr "För **ej riktade** grafer endast med kolumn ``kostnad``" @@ -13186,20 +10050,16 @@ msgid "30) Using `Many to One`_ to get the solution of examples 26 and 28" msgstr "30) Använda `Många till en`_ för att få lösningen på exempel 26 och 28" msgid "31) Using `Many to Many`_ to get the solution of examples 25 to 28" -msgstr "" -"31) Använda `Många till många`_ för att få lösningen på exempel 25 till 28" +msgstr "31) Använda `Många till många`_ för att få lösningen på exempel 25 till 28" msgid "32) Using `Combinations`_ to get the solution of examples 25 to 27" -msgstr "" -"32) Använda `Kombinationer`_ för att få lösningen på exempel 25 till 27" +msgstr "32) Använda `Kombinationer`_ för att få lösningen på exempel 25 till 27" msgid "Equvalences between signatures" msgstr "Utjämningar mellan signaturer" -msgid "" -"The following examples find the path for :math:`\\{6\\}\\rightarrow\\{10\\}`" -msgstr "" -"Följande exempel visar sökvägen för :math:`\\{6\\}\\rightarrow\\{10\\}`" +msgid "The following examples find the path for :math:`\\{6\\}\\rightarrow\\{10\\}`" +msgstr "Följande exempel visar sökvägen för :math:`\\{6\\}\\rightarrow\\{10\\}`" msgid "33) Using `One to One`_" msgstr "33) Använda `En till en`_" @@ -13216,12 +10076,8 @@ msgstr "36) Använda `Många till många`_" msgid "37) Using `Combinations`_" msgstr "37) Använda `Kombinationer`_" -msgid "" -"`Boost: Dijkstra shortest paths `__" -msgstr "" -"`Boost: Dijkstra kortaste vägar `__" +msgid "`Boost: Dijkstra shortest paths `__" +msgstr "`Boost: Dijkstra kortaste vägar `__" msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgstr "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" @@ -13229,42 +10085,26 @@ msgstr "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgid "``pgr_dijkstraCost``" msgstr "``pgr_dijkstraCost``" -msgid "" -"``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra " -"algorithm." -msgstr "" -"``pgr_dijkstraCost`` - Totalkostnad för den kortaste vägen med Dijkstra-" -"algoritmen." +msgid "``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra algorithm." +msgstr "``pgr_dijkstraCost`` - Totalkostnad för den kortaste vägen med Dijkstra-algoritmen." msgid "pgr_dijkstraCost(Combinations)" msgstr "pgr_dijkstraCost(Combinations)" -msgid "" -"The ``pgr_dijkstraCost`` function summarizes of the cost of the shortest " -"path using Dijkstra Algorithm." -msgstr "" -"Funktionen ``pgr_dijkstraCost`` sammanfattar kostnaden för den kortaste " -"vägen med hjälp av Dijkstra-algoritmen." +msgid "The ``pgr_dijkstraCost`` function summarizes of the cost of the shortest path using Dijkstra Algorithm." +msgstr "Funktionen ``pgr_dijkstraCost`` sammanfattar kostnaden för den kortaste vägen med hjälp av Dijkstra-algoritmen." -msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "" -"pgr_dijkstraCost(`Kanter SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_dijkstraCost(`Kanter SQL`_, **start vid**, **end vid**, [``directed``])" -msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "" -"pgr_dijkstraCost(`Kanter SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_dijkstraCost(`Kanter SQL`_, **start vid**, **end vids**, [``directed``])" -msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "" -"pgr_dijkstraCost(`Kanter SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_dijkstraCost(`Kanter SQL`_, **start vids**, **end vid**, [``directed``])" -msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "" -"pgr_dijkstraCost(`Kanter SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_dijkstraCost(`Kanter SQL`_, **start vids**, **end vids**, [``directed``])" msgid "pgr_dijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "pgr_dijkstraCost(`Kanter SQL`_, `Combinations SQL`_, [``directed``])" @@ -13272,16 +10112,11 @@ msgstr "pgr_dijkstraCost(`Kanter SQL`_, `Combinations SQL`_, [``directed``])" msgid "``pgr_dijkstraCostMatrix``" msgstr "``pgr_dijkstraCostMatrix``" -msgid "" -"``pgr_dijkstraCostMatrix`` - Calculates a cost matrix using :doc:" -"`pgr_dijkstra`." -msgstr "" -"``pgr_dijkstraCostMatrix`` - Beräknar en kostnadsmatris med hjälp av :doc:" -"`pgr_dijkstra`." +msgid "``pgr_dijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_dijkstra`." +msgstr "``pgr_dijkstraCostMatrix`` - Beräknar en kostnadsmatris med hjälp av :doc:`pgr_dijkstra`." msgid "Using Dijkstra algorithm, calculate and return a cost matrix." -msgstr "" -"Beräkna och returnera en kostnadsmatris med hjälp av Dijkstra-algoritmen." +msgstr "Beräkna och returnera en kostnadsmatris med hjälp av Dijkstra-algoritmen." msgid "pgr_dijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" msgstr "pgr_dijkstraCostMatrix(`Kanter SQL`_, **start vids**, [``directed``])" @@ -13289,20 +10124,11 @@ msgstr "pgr_dijkstraCostMatrix(`Kanter SQL`_, **start vids**, [``directed``])" msgid "``pgr_dijkstraNear``" msgstr "``pgr_dijkstraNear``" -msgid "" -"``pgr_dijkstraNear`` — Using Dijkstra's algorithm, finds the route that " -"leads to the nearest vertex." -msgstr "" -"``pgr_dijkstraNear`` - Med hjälp av Dijkstras algoritm hittar du den rutt " -"som leder till närmaste toppunkt." +msgid "``pgr_dijkstraNear`` — Using Dijkstra's algorithm, finds the route that leads to the nearest vertex." +msgstr "``pgr_dijkstraNear`` - Med hjälp av Dijkstras algoritm hittar du den rutt som leder till närmaste toppunkt." -msgid "" -"Given a graph, a starting vertex and a set of ending vertices, this function " -"finds the shortest path from the starting vertex to the nearest ending " -"vertex." -msgstr "" -"Givet en graf, en startpunkt och en uppsättning slutpunkter, hittar den här " -"funktionen den kortaste vägen från startpunkten till närmaste slutpunkt." +msgid "Given a graph, a starting vertex and a set of ending vertices, this function finds the shortest path from the starting vertex to the nearest ending vertex." +msgstr "Givet en graf, en startpunkt och en uppsättning slutpunkter, hittar den här funktionen den kortaste vägen från startpunkten till närmaste slutpunkt." msgid "Uses Dijkstra algorithm." msgstr "Använder Dijkstra-algoritmen." @@ -13349,21 +10175,14 @@ msgstr "Många till många: :math:`drt * |Startande vids|`" msgid "Combinations: :math:`drt * |Starting vids|`" msgstr "Kombinationer: :math:`drt * |Starting vids|`" -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" -msgstr "" -"pgr_dijkstraNear(`Kanter SQL`_, **start vid**, **end vids**, [**options A**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" +msgstr "pgr_dijkstraNear(`Kanter SQL`_, **start vid**, **end vids**, [**options A**])" -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" -msgstr "" -"pgr_dijkstraNear(`Kanter SQL`_, **start vids**, **end vid**, [**options A**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" +msgstr "pgr_dijkstraNear(`Kanter SQL`_, **start vids**, **end vid**, [**options A**])" -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" -msgstr "" -"pgr_dijkstraNear(`Kanter SQL`_, **start vids**, **end vids**, [**options " -"B**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" +msgstr "pgr_dijkstraNear(`Kanter SQL`_, **start vids**, **end vids**, [**options B**])" msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options B**])" msgstr "pgr_dijkstraNear(`Kanter SQL`_, `Combinations SQL`_, [**options B**])" @@ -13374,23 +10193,19 @@ msgstr "**options A:** ``[directed, cap]``" msgid "**options B:** ``[directed, cap, global]``" msgstr "**options B:** ``[directed, cap, global]``" -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "" -"pgr_dijkstraNear(`Kanter SQL`_, **start vid**, **end vids**, [**options**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "pgr_dijkstraNear(`Kanter SQL`_, **start vid**, **end vids**, [**options**])" msgid "**options:** ``[directed, cap]``" msgstr "**options:** ``[directed, cap]``" msgid "Departing on car from vertex :math:`6` find the nearest subway station." -msgstr "" -"Avgår med bil från toppunkt :math:`6` hitta närmaste tunnelbanestation." +msgstr "Avgår med bil från toppunkt :math:`6` hitta närmaste tunnelbanestation." msgid "Using a **directed** graph for car routing." msgstr "Använda en **riktad** graf för bildirigering." -msgid "" -"The subway stations are on the following vertices :math:`\\{1, 10, 11\\}`" +msgid "The subway stations are on the following vertices :math:`\\{1, 10, 11\\}`" msgstr "Tunnelbanestationerna ligger på följande hörn :math:`\\{1, 10, 11\\}`" msgid "The defaults used:" @@ -13403,37 +10218,24 @@ msgid "`cap => 1`" msgstr "`kap => 1`" msgid "The result shows that station at vertex :math:`11` is the nearest." -msgstr "" -"Resultatet visar att stationen vid toppunktet :math:`11` är den närmaste." +msgstr "Resultatet visar att stationen vid toppunktet :math:`11` är den närmaste." -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **slut vid**, [**options**])" -msgid "" -"Departing on a car from a subway station find the nearest **two** stations " -"to vertex :math:`2`" -msgstr "" -"Avgår med en bil från en tunnelbanestation hitta de närmaste **två** " -"stationerna till toppunkten :math:`2`" +msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`2`" +msgstr "Avgår med en bil från en tunnelbanestation hitta de närmaste **två** stationerna till toppunkten :math:`2`" msgid "On line `4`: using the positional parameter: `directed` set to ``true``" -msgstr "" -"På rad `4`: använder den positionella parametern: `directed` satt till " -"``true``" +msgstr "På rad `4`: använder den positionella parametern: `directed` satt till ``true``" msgid "In line `5`: using named parameter `cap => 2`" msgstr "I rad `5`: använder namngiven parameter `cap => 2`" -msgid "" -"The result shows that station at vertex :math:`10` is the nearest and the " -"next best is :math:`11`." -msgstr "" -"Resultatet visar att stationen vid toppunktet :math:`10` är den närmaste och " -"den näst bästa är :math:`11`." +msgid "The result shows that station at vertex :math:`10` is the nearest and the next best is :math:`11`." +msgstr "Resultatet visar att stationen vid toppunktet :math:`10` är den närmaste och den näst bästa är :math:`11`." -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **slut vids**, [**options**])" msgid "**options:** ``[directed, cap, global]``" @@ -13457,27 +10259,17 @@ msgstr "På rad `4`: använder den namngivna parametern: `directed => false`" msgid "`global => true`" msgstr "`global => sant`" -msgid "" -"For a pedestrian the best connection is to get on/off is at vertex :math:" -"`15` of the first subway line and at vertex :math:`10` of the second subway " -"line." -msgstr "" -"För en fotgängare är den bästa anslutningen att gå av och på vid toppunkten :" -"math:`15` på den första tunnelbanelinjen och vid toppunkten :math:`10` på " -"den andra tunnelbanelinjen." +msgid "For a pedestrian the best connection is to get on/off is at vertex :math:`15` of the first subway line and at vertex :math:`10` of the second subway line." +msgstr "För en fotgängare är den bästa anslutningen att gå av och på vid toppunkten :math:`15` på den första tunnelbanelinjen och vid toppunkten :math:`10` på den andra tunnelbanelinjen." -msgid "" -"Only `one` route is returned because `global` is ``true`` and `cap` is ``1``" -msgstr "" -"Endast `en` rutt returneras eftersom `global` är ``true`` och `cap` är ``1``" +msgid "Only `one` route is returned because `global` is ``true`` and `cap` is ``1``" +msgstr "Endast `en` rutt returneras eftersom `global` är ``true`` och `cap` är ``1``" msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "pgr_dijkstraNear(`Kanter SQL`_, `Combinations SQL`_, [**options**])" -msgid "" -"Find the best car connection between all the stations of two subway lines" -msgstr "" -"Hitta den bästa bilförbindelsen mellan alla stationer på två tunnelbanelinjer" +msgid "Find the best car connection between all the stations of two subway lines" +msgstr "Hitta den bästa bilförbindelsen mellan alla stationer på två tunnelbanelinjer" msgid "The first subway line stations stops are at :math:`\\{1, 10, 11\\}`" msgstr "Den första tunnelbanelinjen stannar vid :math:`\\{1, 10, 11\\}`" @@ -13488,21 +10280,11 @@ msgstr "Den andra tunnelbanelinjens stationer ligger vid :math:`\\{15, 16\\}`" msgid "The combinations contents:" msgstr "Kombinationernas innehåll:" -msgid "" -"lines `3~4` sets the start vertices to be from the first subway line and the " -"ending vertices to be from the second subway line" -msgstr "" -"linjerna `3~4` anger att startpunkterna ska vara från den första " -"tunnelbanelinjen och att slutpunkterna ska vara från den andra " -"tunnelbanelinjen" +msgid "lines `3~4` sets the start vertices to be from the first subway line and the ending vertices to be from the second subway line" +msgstr "linjerna `3~4` anger att startpunkterna ska vara från den första tunnelbanelinjen och att slutpunkterna ska vara från den andra tunnelbanelinjen" -msgid "" -"lines `6~7` sets the start vertices to be from the first subway line and the " -"ending vertices to be from the first subway line" -msgstr "" -"linjerna `6~7` anger att startpunkterna ska vara från den första " -"tunnelbanelinjen och att slutpunkterna ska vara från den första " -"tunnelbanelinjen" +msgid "lines `6~7` sets the start vertices to be from the first subway line and the ending vertices to be from the first subway line" +msgstr "linjerna `6~7` anger att startpunkterna ska vara från den första tunnelbanelinjen och att slutpunkterna ska vara från den första tunnelbanelinjen" msgid "On line `8`: using the named parameter is `global => false`" msgstr "På rad `8`: att använda den namngivna parametern är `global => false`" @@ -13510,47 +10292,23 @@ msgstr "På rad `8`: att använda den namngivna parametern är `global => false` msgid "From the results:" msgstr "Från resultaten:" -msgid "" -"making a connection from the first subway line :math:`\\{1, 10, 11\\}` to " -"the second :math:`\\{15, 16\\}`:" -msgstr "" -"skapa en förbindelse från den första tunnelbanelinjen :math:`\\{1, 10, 11\\" -"\\}` till den andra :math:`\\{15, 16\\\\}`:" +msgid "making a connection from the first subway line :math:`\\{1, 10, 11\\}` to the second :math:`\\{15, 16\\}`:" +msgstr "skapa en förbindelse från den första tunnelbanelinjen :math:`\\{1, 10, 11\\\\}` till den andra :math:`\\{15, 16\\\\}`:" -msgid "" -"The best connections from all the stations from the first line are: :math:" -"`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" -msgstr "" -"De bästa förbindelserna från alla stationer från den första linjen är: :math:" -"`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" +msgid "The best connections from all the stations from the first line are: :math:`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" +msgstr "De bästa förbindelserna från alla stationer från den första linjen är: :math:`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" -msgid "" -"The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` " -"(lines: `11` and `12`)" -msgstr "" -"Den bästa är :math:`(11 \\rightarrow 16)` med en kostnad på :math:`1` " -"(rader: `11` och `12`)" +msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `11` and `12`)" +msgstr "Den bästa är :math:`(11 \\rightarrow 16)` med en kostnad på :math:`1` (rader: `11` och `12`)" -msgid "" -"making a connection from the second subway line :math:`\\{15, 16\\}` to the " -"first :math:`\\{1, 10, 11\\}`:" -msgstr "" -"skapa en förbindelse från den andra tunnelbanelinjen :math:`\\{15, 16\\\\}` " -"till den första :math:`\\{1, 10, 11\\\\}`:" +msgid "making a connection from the second subway line :math:`\\{15, 16\\}` to the first :math:`\\{1, 10, 11\\}`:" +msgstr "skapa en förbindelse från den andra tunnelbanelinjen :math:`\\{15, 16\\\\}` till den första :math:`\\{1, 10, 11\\\\}`:" -msgid "" -"The best connections from all the stations from the second line are: :math:" -"`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" -msgstr "" -"De bästa förbindelserna från alla stationer från den andra linjen är: :math:" -"`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" +msgid "The best connections from all the stations from the second line are: :math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" +msgstr "De bästa förbindelserna från alla stationer från den andra linjen är: :math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" -msgid "" -"Both are equally good as they have the same cost. (lines: `13` and `14` and " -"lines: `15` and `16`)" -msgstr "" -"Båda är lika bra eftersom de har samma kostnad. (rader: `13` och `14` och " -"rader: `15` och `16`)" +msgid "Both are equally good as they have the same cost. (lines: `13` and `14` and lines: `15` and `16`)" +msgstr "Båda är lika bra eftersom de har samma kostnad. (rader: `13` och `14` och rader: `15` och `16`)" msgid "Dijkstra optional parameters" msgstr "Dijkstra valfria parametrar" @@ -13579,80 +10337,40 @@ msgstr "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgid "``pgr_dijkstraNearCost``" msgstr "``pgr_dijkstraNearCost``" -msgid "" -"``pgr_dijkstraNearCost`` — Using dijkstra algorithm, finds the route that " -"leads to the nearest vertex." -msgstr "" -"``pgr_dijkstraNearCost`` - Med hjälp av dijkstra-algoritmen hittar du den " -"rutt som leder till närmaste toppunkt." +msgid "``pgr_dijkstraNearCost`` — Using dijkstra algorithm, finds the route that leads to the nearest vertex." +msgstr "``pgr_dijkstraNearCost`` - Med hjälp av dijkstra-algoritmen hittar du den rutt som leder till närmaste toppunkt." -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options " -"A**])" -msgstr "" -"pgr_dijkstraNearCost(`Kanter SQL`_, **start vid**, **end vids**, [**options " -"A**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" +msgstr "pgr_dijkstraNearCost(`Kanter SQL`_, **start vid**, **end vids**, [**options A**])" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options " -"A**])" -msgstr "" -"pgr_dijkstraNearCost(`Kanter SQL`_, **start vids**, **end vid**, [**options " -"A**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" +msgstr "pgr_dijkstraNearCost(`Kanter SQL`_, **start vids**, **end vid**, [**options A**])" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options " -"B**])" -msgstr "" -"pgr_dijkstraNearCost(`Kanter SQL`_, **start vids**, **end vids**, [**options " -"B**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" +msgstr "pgr_dijkstraNearCost(`Kanter SQL`_, **start vids**, **end vids**, [**options B**])" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" -msgstr "" -"pgr_dijkstraNearCost(`Kanter SQL`_, `Combinations SQL`_, [**options B**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" +msgstr "pgr_dijkstraNearCost(`Kanter SQL`_, `Combinations SQL`_, [**options B**])" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, " -"[**options**])" -msgstr "" -"pgr_dijkstraNearCost(`Kanter SQL`_, **start vid**, **end vids**, " -"[**options**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "pgr_dijkstraNearCost(`Kanter SQL`_, **start vid**, **end vids**, [**options**])" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, " -"[**options**])" -msgstr "" -"pgr_dijkstraNearCost(`Kanter SQL`_, **start vids**, **end vid**, " -"[**options**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "pgr_dijkstraNearCost(`Kanter SQL`_, **start vids**, **end vid**, [**options**])" -msgid "" -"Departing on a car from a subway station find the nearest **two** stations " -"to vertex :math:`6`" -msgstr "" -"Avgår med en bil från en tunnelbanestation hitta de närmaste **två** " -"stationerna till toppunkten :math:`6``" +msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`6`" +msgstr "Avgår med en bil från en tunnelbanestation hitta de närmaste **två** stationerna till toppunkten :math:`6``" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, " -"[**options**])" -msgstr "" -"pgr_dijkstraNearCost(`Kanter SQL`_, **start vids**, **end vids**, " -"[**options**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "pgr_dijkstraNearCost(`Kanter SQL`_, **start vids**, **end vids**, [**options**])" msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgstr "" -"pgr_dijkstraNearCost(`Kanter SQL`_, `Combinations SQL`_, [**options**])" +msgstr "pgr_dijkstraNearCost(`Kanter SQL`_, `Combinations SQL`_, [**options**])" -msgid "" -"The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` " -"(lines: `1`)" -msgstr "" -"Den bästa är :math:`(11 \\rightarrow 16)` med en kostnad av :math:`1` " -"(rader: `1`)" +msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `1`)" +msgstr "Den bästa är :math:`(11 \\rightarrow 16)` med en kostnad av :math:`1` (rader: `1`)" -msgid "" -"Both are equally good as they have the same cost. (lines: `12` and `13`)" +msgid "Both are equally good as they have the same cost. (lines: `12` and `13`)" msgstr "Båda är lika bra eftersom de har samma kostnad. (rader: `12` och `13`)" msgid "``pgr_dijkstraVia``" @@ -13661,14 +10379,8 @@ msgstr "``pgr_dijkstraVia``" msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices." msgstr "``pgr_dijkstraVia`` - Rutt som går genom en lista med toppar." -msgid "" -"Given a list of vertices and a graph, this function is equivalent to finding " -"the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :" -"math:`i < size\\_of(via\\;vertices)`." -msgstr "" -"Med en lista över hörnpunkter och en graf är denna funktion likvärdig med " -"att hitta den kortaste vägen mellan :math:`vertex_i` och :math:`vertex_{i+1}" -"` för alla :math:`i < size\\_of(via\\;hörnpunkter)`." +msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)`." +msgstr "Med en lista över hörnpunkter och en graf är denna funktion likvärdig med att hitta den kortaste vägen mellan :math:`vertex_i` och :math:`vertex_{i+1}` för alla :math:`i < size\\_of(via\\;hörnpunkter)`." msgid "Route" msgstr "Rutt" @@ -13694,29 +10406,20 @@ msgstr "**options:** ``[directed, strict, U_turn_on_edge]``" msgid "Returns set of |via-result|" msgstr "Returnerar uppsättning av |via-result|" -msgid "" -"Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order " -"on an directed graph." -msgstr "" -"Hitta den rutt som besöker topparna :math:`\\{5, 1, 8\\}` i den ordningen i " -"en riktad graf." +msgid "Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order on an directed graph." +msgstr "Hitta den rutt som besöker topparna :math:`\\{5, 1, 8\\}` i den ordningen i en riktad graf." msgid "Via optional parameters" msgstr "Via valfria parametrar" msgid "When ``true`` departing from a visited vertex will not try to avoid" -msgstr "" -"När ``true`` avgår från en besökt vertex kommer inte att försöka undvika" +msgstr "När ``true`` avgår från en besökt vertex kommer inte att försöka undvika" msgid "Identifier of a path. Has value **1** for the first path." msgstr "Identifierare för ett led. Har värdet **1** för det första tågläget." -msgid "" -"Identifier of the edge used to go from ``node`` to the next node in the path " -"sequence." -msgstr "" -"Identifierar den kant som används för att gå från ``node`` till nästa nod i " -"bansekvensen." +msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence." +msgstr "Identifierar den kant som används för att gå från ``node`` till nästa nod i bansekvensen." msgid "-1 for the last node of the path." msgstr "-1 för den sista noden på vägen." @@ -13727,19 +10430,11 @@ msgstr "-2 för den sista noden i rutten." msgid "``route_agg_cost``" msgstr "``route_agg_cost``" -msgid "" -"Total cost from ``start_vid`` of ``seq = 1`` to ``end_vid`` of the current " -"``seq``." -msgstr "" -"Total kostnad från ``start_vid`` av ``seq = 1`` till ``slut_vid`` av den " -"aktuella ``seq``." +msgid "Total cost from ``start_vid`` of ``seq = 1`` to ``end_vid`` of the current ``seq``." +msgstr "Total kostnad från ``start_vid`` av ``seq = 1`` till ``slut_vid`` av den aktuella ``seq``." -msgid "" -"All this examples are about the route that visits the vertices :math:`\\{5, " -"7, 1, 8, 15\\}` in that order on a **directed** graph." -msgstr "" -"Alla dessa exempel handlar om den rutt som besöker topparna :math:`\\{5, 7, " -"1, 8, 15\\}` i den ordningen på en **riktad** graf." +msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a **directed** graph." +msgstr "Alla dessa exempel handlar om den rutt som besöker topparna :math:`\\{5, 7, 1, 8, 15\\}` i den ordningen på en **riktad** graf." msgid "The main query" msgstr "Den huvudsakliga frågeställningen" @@ -13765,8 +10460,7 @@ msgstr ":doc:`via-category`." msgid ":doc:`dijkstra-family`." msgstr ":doc:`dijkstra-family`." -msgid "" -"``pgr_drivingDistance`` - Returns the driving distance from a start node." +msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." msgstr "``pgr_drivingDistance`` - Returnerar köravståndet från en startnod." msgid "pgr_drivingDistance(Single vertex)" @@ -13796,21 +10490,13 @@ msgstr "Ny officiell signatur:" msgid "pgr_drivingDistance(multiple vertices)" msgstr "pgr_drivingDistance(multiple vertices)" -msgid "" -"Using the Dijkstra algorithm, extracts all the nodes that have costs less " -"than or equal to the value ``distance``. The edges extracted will conform to " -"the corresponding spanning tree." -msgstr "" -"Med hjälp av Dijkstra-algoritmen extraheras alla noder som har kostnader som " -"är mindre än eller lika med värdet ``distance``. De kanter som extraheras " -"kommer att överensstämma med motsvarande spännträd." +msgid "Using the Dijkstra algorithm, extracts all the nodes that have costs less than or equal to the value ``distance``. The edges extracted will conform to the corresponding spanning tree." +msgstr "Med hjälp av Dijkstra-algoritmen extraheras alla noder som har kostnader som är mindre än eller lika med värdet ``distance``. De kanter som extraheras kommer att överensstämma med motsvarande spännträd." -msgid "" -"pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" +msgid "pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" msgstr "pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" -msgid "" -"pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" +msgid "pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" msgstr "pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" msgid "**options:** [directed, equicost]" @@ -13825,12 +10511,8 @@ msgstr "Från toppunkten :math:`11` för ett avstånd av :math:`3.0`" msgid "Multiple Vertices" msgstr "Flera vertikaler" -msgid "" -"From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` with equi-" -"cost on a directed graph" -msgstr "" -"Från topparna :math:`\\{11, 16\\}` för ett avstånd av :math:`3.0` med equi-" -"cost på en riktad graf" +msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` with equi-cost on a directed graph" +msgstr "Från topparna :math:`\\{11, 16\\}` för ett avstånd av :math:`3.0` med equi-cost på en riktad graf" msgid "Driving distance optional parameters" msgstr "Valfria parametrar för körsträcka" @@ -13838,47 +10520,26 @@ msgstr "Valfria parametrar för körsträcka" msgid "``equicost``" msgstr "``equicost``" -msgid "" -"When ``true`` the node will only appear in the closest ``start_vid`` list. " -"Tie brakes are arbitrary." -msgstr "" -"När ``true`` kommer noden endast att visas i den närmaste ``start_vid``-" -"listan. Bindningsbromsar är godtyckliga." +msgid "When ``true`` the node will only appear in the closest ``start_vid`` list. Tie brakes are arbitrary." +msgstr "När ``true`` kommer noden endast att visas i den närmaste ``start_vid``-listan. Bindningsbromsar är godtyckliga." -msgid "" -"When ``false`` which resembles several calls using the single vertex " -"signature." -msgstr "" -"När ``false`` vilket liknar flera anrop som använder signaturen med en enda " -"vertex." +msgid "When ``false`` which resembles several calls using the single vertex signature." +msgstr "När ``false`` vilket liknar flera anrop som använder signaturen med en enda vertex." msgid "end-before" msgstr "slut-innan" -msgid "" -"From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` on an " -"undirected graph" -msgstr "" -"Från hörnen :math:`\\{11, 16\\}` för ett avstånd av :math:`3.0` på en odelad " -"graf" +msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` on an undirected graph" +msgstr "Från hörnen :math:`\\{11, 16\\}` för ett avstånd av :math:`3.0` på en odelad graf" msgid "``pgr_edgeColoring`` - Experimental" msgstr "``pgr_edgeColoring`` - Experimentell" -msgid "" -"``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free " -"graphs" -msgstr "" -"``pgr_edgeColoring`` - Returnerar kantfärgning av oledade och loopfria grafer" +msgid "``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free graphs" +msgstr "``pgr_edgeColoring`` - Returnerar kantfärgning av oledade och loopfria grafer" -msgid "" -"Edge Coloring is an algorithm used for coloring of the edges for the " -"vertices in the graph. It is an assignment of colors to the edges of the " -"graph so that no two adjacent edges have the same color." -msgstr "" -"Edge Coloring är en algoritm som används för att färglägga kanterna för " -"topparna i grafen. Det är en tilldelning av färger till kanterna i grafen så " -"att inga två intilliggande kanter har samma färg." +msgid "Edge Coloring is an algorithm used for coloring of the edges for the vertices in the graph. It is an assignment of colors to the edges of the graph so that no two adjacent edges have the same color." +msgstr "Edge Coloring är en algoritm som används för att färglägga kanterna för topparna i grafen. Det är en tilldelning av färger till kanterna i grafen så att inga två intilliggande kanter har samma färg." msgid "The implementation is for **undirected** and **loop-free** graphs" msgstr "Implementeringen är för **undirected** och **loop-free** grafer" @@ -13889,32 +10550,17 @@ msgstr "slinga fri" msgid "no self-loops and no parallel edges." msgstr "inga självslingor och inga parallella kanter." -msgid "" -"Provides the color to be assigned to all the edges present in the graph." +msgid "Provides the color to be assigned to all the edges present in the graph." msgstr "Ger den färg som ska tilldelas alla kanter som finns i grafen." -msgid "" -"At most :math:`\\Delta + 1` colors are used, where :math:`\\Delta` is the " -"degree of the graph." -msgstr "" -"Högst :math:`\\Delta + 1` färger används, där :math:`\\Delta` är grafens " -"grad." +msgid "At most :math:`\\Delta + 1` colors are used, where :math:`\\Delta` is the degree of the graph." +msgstr "Högst :math:`\\Delta + 1` färger används, där :math:`\\Delta` är grafens grad." -msgid "" -"This is optimal for some graphs, and by Vizing's theorem it uses at most one " -"color more than the optimal for all others." -msgstr "" -"Detta är optimalt för vissa grafer och enligt Vizings teorem används högst " -"en färg mer än vad som är optimalt för alla andra." +msgid "This is optimal for some graphs, and by Vizing's theorem it uses at most one color more than the optimal for all others." +msgstr "Detta är optimalt för vissa grafer och enligt Vizings teorem används högst en färg mer än vad som är optimalt för alla andra." -msgid "" -"the chromatic number :math:`x'(G)` (minimum number of colors needed for " -"proper edge coloring of graph) is equal to the degree :math:`\\Delta + 1` of " -"the graph, (:math:`x'(G) = \\Delta`)" -msgstr "" -"det kromatiska talet :math:`x'(G)` (minsta antal färger som behövs för " -"korrekt kantfärgning av grafen) är lika med graden :math:`\\Delta + 1` av " -"grafen, (:math:`x'(G) = \\Delta`)" +msgid "the chromatic number :math:`x'(G)` (minimum number of colors needed for proper edge coloring of graph) is equal to the degree :math:`\\Delta + 1` of the graph, (:math:`x'(G) = \\Delta`)" +msgstr "det kromatiska talet :math:`x'(G)` (minsta antal färger som behövs för korrekt kantfärgning av grafen) är lika med graden :math:`\\Delta + 1` av grafen, (:math:`x'(G) = \\Delta`)" msgid "The algorithm tries to assign the least possible color to every edge." msgstr "Algoritmen försöker tilldela varje kant minsta möjliga färg." @@ -13922,11 +10568,8 @@ msgstr "Algoritmen försöker tilldela varje kant minsta möjliga färg." msgid "Does not always produce optimal coloring." msgstr "Ger inte alltid optimal färgsättning." -msgid "" -"The returned rows are ordered in ascending order of the edge identifier." -msgstr "" -"De returnerade raderna är ordnade i stigande ordning efter " -"kantidentifieraren." +msgid "The returned rows are ordered in ascending order of the edge identifier." +msgstr "De returnerade raderna är ordnade i stigande ordning efter kantidentifieraren." msgid "Efficient graph coloring is an NP-Hard problem, and therefore:" msgstr "Effektiv färgläggning av grafer är ett NP-hårt problem och därför:" @@ -13946,49 +10589,29 @@ msgstr "pgr_edgeColoring(`Kanter SQL`_)" msgid "Graph coloring of pgRouting :doc:`sampledata`" msgstr "Grafisk färgläggning av pgRouting :doc:`sampledata`" -msgid "" -"`Boost: Edge Coloring `__" -msgstr "" -"`Boost: Färgläggning av kanter `__" +msgid "`Boost: Edge Coloring `__" +msgstr "`Boost: Färgläggning av kanter `__" -msgid "" -"`Wikipedia: Graph coloring `__" -msgstr "" -"`Wikipedia: Färgläggning av grafer `__" +msgid "`Wikipedia: Graph coloring `__" +msgstr "`Wikipedia: Färgläggning av grafer `__" -msgid "" -"``pgr_edgeDisjointPaths`` — Calculates edge disjoint paths between two " -"groups of vertices." -msgstr "" -"``pgr_edgeDisjointPaths`` - Beräknar kantdisjunkta vägar mellan två grupper " -"av toppar." +msgid "``pgr_edgeDisjointPaths`` — Calculates edge disjoint paths between two groups of vertices." +msgstr "``pgr_edgeDisjointPaths`` - Beräknar kantdisjunkta vägar mellan två grupper av toppar." msgid "pgr_edgeDisjointPaths(Combinations)" msgstr "pgr_edgeDisjointPaths(Combinations)" -msgid "" -"Calculates the edge disjoint paths between two groups of vertices. Utilizes " -"underlying maximum flow algorithms to calculate the paths." -msgstr "" -"Beräknar de kantdisjunkta vägarna mellan två grupper av hörnpunkter. " -"Använder underliggande algoritmer för maximalt flöde för att beräkna vägarna." +msgid "Calculates the edge disjoint paths between two groups of vertices. Utilizes underlying maximum flow algorithms to calculate the paths." +msgstr "Beräknar de kantdisjunkta vägarna mellan två grupper av hörnpunkter. Använder underliggande algoritmer för maximalt flöde för att beräkna vägarna." msgid "The main characterics are:" msgstr "De viktigaste egenskaperna är:" msgid "Calculates the edge disjoint paths between any two groups of vertices." -msgstr "" -"Beräknar de kantskiljande vägarna mellan två valfria grupper av hörnpunkter." +msgstr "Beräknar de kantskiljande vägarna mellan två valfria grupper av hörnpunkter." -msgid "" -"Returns EMPTY SET when source and destination are the same, or cannot be " -"reached." -msgstr "" -"Returnerar EMPTY SET när källan och destinationen är desamma eller inte kan " -"nås." +msgid "Returns EMPTY SET when source and destination are the same, or cannot be reached." +msgstr "Returnerar EMPTY SET när källan och destinationen är desamma eller inte kan nås." msgid "The graph can be directed or undirected." msgstr "Grafen kan vara riktad eller oriktad." @@ -13996,38 +10619,23 @@ msgstr "Grafen kan vara riktad eller oriktad." msgid "Uses :doc:`pgr_boykovKolmogorov` to calculate the paths." msgstr "Använder :doc:`pgr_boykovKolmogorov` för att beräkna banorna." -msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, " -"[``directed``])" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **slut vid**, [``directed``])" -msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vids**, " -"[``directed``])" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **slut vids**, [``directed``])" -msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vid**, " -"[``directed``])" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **slut vid**, [``directed``])" -msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **slut vids**, [``directed``])" -msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgid "" -"Using a combinations table, equivalent to calculating result from vertices :" -"math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}` on an undirected " -"graph." -msgstr "" -"Att använda en kombinationstabell motsvarar att beräkna resultatet från " -"topparna :math:`\\{5, 6\\}` till topparna :math:`\\{10, 15, 14\\}` i en " -"ostyrd graf." +msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}` on an undirected graph." +msgstr "Att använda en kombinationstabell motsvarar att beräkna resultatet från topparna :math:`\\{5, 6\\}` till topparna :math:`\\{10, 15, 14\\}` i en ostyrd graf." msgid "Manually assigned vertex combinations on an undirected graph." msgstr "Manuellt tilldelade toppunktskombinationer på en odelad graf." @@ -14035,12 +10643,8 @@ msgstr "Manuellt tilldelade toppunktskombinationer på en odelad graf." msgid "``pgr_edmondsKarp``" msgstr "``pgr_edmondsKarp``" -msgid "" -"``pgr_edmondsKarp`` — Calculates the flow on the graph edges that maximizes " -"the flow from the sources to the targets using Edmonds Karp Algorithm." -msgstr "" -"``pgr_edmondsKarp`` - Beräknar flödet på grafens kanter som maximerar flödet " -"från källorna till målen med hjälp av Edmonds Karps algoritm." +msgid "``pgr_edmondsKarp`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Edmonds Karp Algorithm." +msgstr "``pgr_edmondsKarp`` - Beräknar flödet på grafens kanter som maximerar flödet från källorna till målen med hjälp av Edmonds Karps algoritm." msgid "pgr_edmondsKarp(Combinations)" msgstr "pgr_edmondsKarp(Combinations)" @@ -14066,12 +10670,8 @@ msgstr "pgr_edmondsKarp(`Kanter SQL`_, **start vids**, **end vids**)" msgid "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" msgstr "pgr_edmondsKarp(`Kanter SQL`_, `Combinations SQL`_)" -msgid "" -"`Boost: Edmonds Karp max flow `__" -msgstr "" -"`Boost: Edmonds Karp maxflöde `__" +msgid "`Boost: Edmonds Karp max flow `__" +msgstr "`Boost: Edmonds Karp maxflöde `__" msgid "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" msgstr "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" @@ -14079,52 +10679,23 @@ msgstr "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" msgid "``pgr_edwardMoore`` - Experimental" msgstr "``pgr_edwardMoore`` - Experimentell" -msgid "" -"``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore algorithm." -msgstr "" -"``pgr_edwardMoore`` - Returnerar den kortaste vägen med Edward-Moore-" -"algoritmen." +msgid "``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore algorithm." +msgstr "``pgr_edwardMoore`` - Returnerar den kortaste vägen med Edward-Moore-algoritmen." -msgid "" -"Edward Moore’s Algorithm is an improvement of the Bellman-Ford Algorithm. It " -"can compute the shortest paths from a single source vertex to all other " -"vertices in a weighted directed graph. The main difference between Edward " -"Moore's Algorithm and Bellman Ford's Algorithm lies in the run time." -msgstr "" -"Edward Moores algoritm är en förbättring av Bellman-Ford-algoritmen. Den kan " -"beräkna de kortaste vägarna från ett enda källvertex till alla andra vertex " -"i en viktad riktad graf. Den största skillnaden mellan Edward Moores " -"algoritm och Bellman Fords algoritm ligger i körtiden." +msgid "Edward Moore’s Algorithm is an improvement of the Bellman-Ford Algorithm. It can compute the shortest paths from a single source vertex to all other vertices in a weighted directed graph. The main difference between Edward Moore's Algorithm and Bellman Ford's Algorithm lies in the run time." +msgstr "Edward Moores algoritm är en förbättring av Bellman-Ford-algoritmen. Den kan beräkna de kortaste vägarna från ett enda källvertex till alla andra vertex i en viktad riktad graf. Den största skillnaden mellan Edward Moores algoritm och Bellman Fords algoritm ligger i körtiden." -msgid "" -"The worst-case running time of the algorithm is :math:`O(| V | * | E |)` " -"similar to the time complexity of Bellman-Ford algorithm. However, " -"experiments suggest that this algorithm has an average running time " -"complexity of :math:`O( | E | )` for random graphs. This is significantly " -"faster in terms of computation speed." -msgstr "" -"I värsta fall är algoritmens körtid :math:`O(| V | * | E |)`, vilket liknar " -"tidskomplexiteten för Bellman-Ford-algoritmen. Experiment tyder dock på att " -"denna algoritm har en genomsnittlig komplexitet på :math:`O( | E | )` för " -"slumpmässiga grafer. Detta är betydligt snabbare när det gäller " -"beräkningshastighet." +msgid "The worst-case running time of the algorithm is :math:`O(| V | * | E |)` similar to the time complexity of Bellman-Ford algorithm. However, experiments suggest that this algorithm has an average running time complexity of :math:`O( | E | )` for random graphs. This is significantly faster in terms of computation speed." +msgstr "I värsta fall är algoritmens körtid :math:`O(| V | * | E |)`, vilket liknar tidskomplexiteten för Bellman-Ford-algoritmen. Experiment tyder dock på att denna algoritm har en genomsnittlig komplexitet på :math:`O( | E | )` för slumpmässiga grafer. Detta är betydligt snabbare när det gäller beräkningshastighet." -msgid "" -"Thus, the algorithm is at-best, significantly faster than Bellman-Ford " -"algorithm and is at-worst,as good as Bellman-Ford algorithm" -msgstr "" -"Algoritmen är alltså i bästa fall betydligt snabbare än Bellman-Ford-" -"algoritmen och i sämsta fall lika bra som Bellman-Ford-algoritmen" +msgid "Thus, the algorithm is at-best, significantly faster than Bellman-Ford algorithm and is at-worst,as good as Bellman-Ford algorithm" +msgstr "Algoritmen är alltså i bästa fall betydligt snabbare än Bellman-Ford-algoritmen och i sämsta fall lika bra som Bellman-Ford-algoritmen" msgid "The `agg_cost` the non included values `(v, v)` is :math:`0`" msgstr "`agg_cost` de icke inkluderade värdena `(v, v)` är :math:`0`" -msgid "" -"For optimization purposes, any duplicated value in the `start vids` or `end " -"vids` are ignored." -msgstr "" -"För optimeringsändamål ignoreras alla duplicerade värden i `start vids` " -"eller `end vids`." +msgid "For optimization purposes, any duplicated value in the `start vids` or `end vids` are ignored." +msgstr "För optimeringsändamål ignoreras alla duplicerade värden i `start vids` eller `end vids`." msgid "Running time:" msgstr "Löptid:" @@ -14135,25 +10706,17 @@ msgstr "Sämsta fall: :math:`O(| V | * | E |)`" msgid "Average case: :math:`O( | E | )`" msgstr "Genomsnittligt fall: :math:`O( | E | )`" -msgid "" -"pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "" -"pgr_edwardMoore(`Kanter SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_edwardMoore(`Kanter SQL`_, **start vid**, **end vid**, [``directed``])" -msgid "" -"pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "" -"pgr_edwardMoore(`Kanter SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_edwardMoore(`Kanter SQL`_, **start vid**, **end vids**, [``directed``])" -msgid "" -"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "" -"pgr_edwardMoore(`Kanter SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_edwardMoore(`Kanter SQL`_, **start vids**, **end vid**, [``directed``])" -msgid "" -"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "" -"pgr_edwardMoore(`Kanter SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_edwardMoore(`Kanter SQL`_, **start vids**, **end vids**, [``directed``])" msgid "pgr_edwardMoore(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "pgr_edwardMoore(`Kanter SQL`_, `Combinations SQL`_, [``directed``])" @@ -14170,18 +10733,11 @@ msgstr "``pgr_extractVertices``" msgid "``pgr_extractVertices`` — Extracts the vertices information" msgstr "``pgr_extractVertices`` - Extraherar information om hörnpunkter" -msgid "" -"This is an auxiliary function for extracting the vertex information of the " -"set of edges of a graph." -msgstr "" -"Detta är en hjälpfunktion för att extrahera toppunktsinformationen för en " -"grafs uppsättning kanter." +msgid "This is an auxiliary function for extracting the vertex information of the set of edges of a graph." +msgstr "Detta är en hjälpfunktion för att extrahera toppunktsinformationen för en grafs uppsättning kanter." -msgid "" -"When the edge identifier is given, then it will also calculate the in and " -"out edges" -msgstr "" -"När kantidentifieraren anges kommer den också att beräkna in- och utkanterna" +msgid "When the edge identifier is given, then it will also calculate the in and out edges" +msgstr "När kantidentifieraren anges kommer den också att beräkna in- och utkanterna" msgid "pgr_extractVertices(`Edges SQL`_, [``dryrun``])" msgstr "pgr_extractVertices(`Kanter SQL`_, [``dryrun``])" @@ -14204,12 +10760,8 @@ msgstr "``LINESTRING``" msgid "Geometry of the edge." msgstr "Geometri för kanten." -msgid "" -"This inner query takes precedence over the next two inner query, therefore " -"other columns are ignored when ``geom`` column appears." -msgstr "" -"Denna inre fråga har företräde framför de två följande inre frågorna, och " -"därför ignoreras andra kolumner när kolumnen ``geom`` visas." +msgid "This inner query takes precedence over the next two inner query, therefore other columns are ignored when ``geom`` column appears." +msgstr "Denna inre fråga har företräde framför de två följande inre frågorna, och därför ignoreras andra kolumner när kolumnen ``geom`` visas." msgid "Ignored columns:" msgstr "Ignorerade kolumner:" @@ -14223,12 +10775,8 @@ msgstr "``endpoint``" msgid "When vertex geometry is known" msgstr "När toppunktsgeometrin är känd" -msgid "" -"To use this inner query the column ``geom`` should not be part of the set of " -"columns." -msgstr "" -"För att använda den här inre frågan får kolumnen ``geom`` inte ingå i " -"kolumnuppsättningen." +msgid "To use this inner query the column ``geom`` should not be part of the set of columns." +msgstr "För att använda den här inre frågan får kolumnen ``geom`` inte ingå i kolumnuppsättningen." msgid "``POINT``" msgstr "``POINT``" @@ -14239,23 +10787,14 @@ msgstr "POINT Geometri för startvertexen." msgid "POINT geometry of the ending vertex." msgstr "POINT Geometri för den avslutande vertexen." -msgid "" -"This inner query takes precedence over the next inner query, therefore other " -"columns are ignored when ``startpoint`` and ``endpoint`` columns appears." -msgstr "" -"Denna inre fråga har företräde framför nästa inre fråga, och därför " -"ignoreras andra kolumner när kolumnerna ``startpunkt`` och ``slutpunkt`` " -"visas." +msgid "This inner query takes precedence over the next inner query, therefore other columns are ignored when ``startpoint`` and ``endpoint`` columns appears." +msgstr "Denna inre fråga har företräde framför nästa inre fråga, och därför ignoreras andra kolumner när kolumnerna ``startpunkt`` och ``slutpunkt`` visas." msgid "When identifiers of vertices are known" msgstr "När identifierare av toppar är kända" -msgid "" -"To use this inner query the columns ``geom``, ``startpoint`` and " -"``endpoint`` should not be part of the set of columns." -msgstr "" -"För att kunna använda den här inre frågan får kolumnerna ``geom``, " -"``startpoint`` och ``endpoint`` inte ingå i kolumnuppsättningen." +msgid "To use this inner query the columns ``geom``, ``startpoint`` and ``endpoint`` should not be part of the set of columns." +msgstr "För att kunna använda den här inre frågan får kolumnerna ``geom``, ``startpoint`` och ``endpoint`` inte ingå i kolumnuppsättningen." msgid "``NULL`` When the ``id`` is not part of the inner query" msgstr "``NULL`` När ``id`` inte är en del av den inre frågan" @@ -14269,12 +10808,8 @@ msgstr "``NULL`` När ingen geometri anges" msgid "Geometry of the point" msgstr "Geometri för punkten" -msgid "" -"To get the query generated used to get the vertex information, use ``dryrun :" -"= true``." -msgstr "" -"Använd ``dryrun := true`` för att få den fråga som genereras för att få fram " -"toppunktsinformationen." +msgid "To get the query generated used to get the vertex information, use ``dryrun := true``." +msgstr "Använd ``dryrun := true`` för att få den fråga som genereras för att få fram toppunktsinformationen." msgid "Create a routing topology" msgstr "Skapa en routningstopologi" @@ -14285,10 +10820,8 @@ msgstr "Kontrollera att databasen inte har ``vertices_table``" msgid "Clean up the columns of the routing topology to be created" msgstr "Rensa upp kolumnerna i den routningstopologi som ska skapas" -msgid "" -"When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, )``" -msgstr "" -"När ``LINESTRING`` har en SRID används ``geom::geometry(POINT, )``" +msgid "When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, )``" +msgstr "När ``LINESTRING`` har en SRID används ``geom::geometry(POINT, )``" msgid "For big edge tables that are been prepared," msgstr "För bord med stor kant som är förberedda," @@ -14321,39 +10854,27 @@ msgid "``pgr_findCloseEdges``" msgstr "``pgr_findCloseEdges``" msgid "``pgr_findCloseEdges`` - Finds the close edges to a point geometry." -msgstr "" -"``pgr_findCloseEdges`` - Hittar de närmaste kanterna till en punktgeometri." +msgstr "``pgr_findCloseEdges`` - Hittar de närmaste kanterna till en punktgeometri." msgid "``partial`` option is removed." msgstr "``partial`` alternativet är borttaget." -msgid "" -"``pgr_findCloseEdges`` - An utility function that finds the closest edge to " -"a point geometry." -msgstr "" -"``pgr_findCloseEdges`` - En verktygsfunktion som hittar den närmaste kanten " -"till en punktgeometri." +msgid "``pgr_findCloseEdges`` - An utility function that finds the closest edge to a point geometry." +msgstr "``pgr_findCloseEdges`` - En verktygsfunktion som hittar den närmaste kanten till en punktgeometri." -msgid "" -"The geometries must be in the same coordinate system (have the same SRID)." +msgid "The geometries must be in the same coordinate system (have the same SRID)." msgstr "Geometrierna måste ligga i samma koordinatsystem (ha samma SRID)." -msgid "" -"The code to do the calculations can be obtained for further specific " -"adjustments needed by the application." -msgstr "" -"Koden för att göra beräkningarna kan erhållas för ytterligare specifika " -"justeringar som krävs av applikationen." +msgid "The code to do the calculations can be obtained for further specific adjustments needed by the application." +msgstr "Koden för att göra beräkningarna kan erhållas för ytterligare specifika justeringar som krävs av applikationen." msgid "``EMPTY SET`` is returned on dryrun executions" msgstr "``EMPTY SET`` returneras vid dryrun-körningar" -msgid "" -"pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" +msgid "pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" msgstr "pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" -msgid "" -"pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" +msgid "pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" msgstr "pgr_findCloseEdges(`Edges SQL`_, **punkter**, **tolerans**, [**alternativ**])" msgid "**options:** ``[cap, dryrun]``" @@ -14404,12 +10925,8 @@ msgstr "Begränsa utmatningsraderna" msgid "When ``false`` calculations are performed." msgstr "När ``falska`` beräkningar utförs." -msgid "" -"When ``true`` calculations are not performed and the query to do the " -"calculations is exposed in a PostgreSQL ``NOTICE``." -msgstr "" -"När `` sanna`` beräkningar inte utförs och frågan för att göra beräkningarna " -"exponeras i en PostgreSQL ``NOTICE``." +msgid "When ``true`` calculations are not performed and the query to do the calculations is exposed in a PostgreSQL ``NOTICE``." +msgstr "När `` sanna`` beräkningar inte utförs och frågan för att göra beräkningarna exponeras i en PostgreSQL ``NOTICE``." msgid "``geometry``" msgstr "``geometry``" @@ -14420,12 +10937,8 @@ msgstr "Geometri för ``LINESTRING`` på kanten." msgid "When :math:`cap = 1`, it is the closest edge." msgstr "När :math:`cap = 1` är det den närmaste kanten." -msgid "" -"Value in <0,1> that indicates the relative position from the first end-point " -"of the edge." -msgstr "" -"Värde i <0,1> som anger den relativa positionen från den första ändpunkten " -"på kanten." +msgid "Value in <0,1> that indicates the relative position from the first end-point of the edge." +msgstr "Värde i <0,1> som anger den relativa positionen från den första ändpunkten på kanten." msgid "Value in ``[r, l]`` indicating if the point is:" msgstr "Värde i ``[r, l]`` som indikerar om punkten är:" @@ -14448,12 +10961,8 @@ msgstr "Avstånd från punkten till kanten." msgid "Original ``POINT`` geometry." msgstr "Ursprunglig ``POINT`` geometri." -msgid "" -"``LINESTRING`` geometry that connects the original **point** to the closest " -"point of the edge with identifier ``edge_id``" -msgstr "" -"``LINESTRING`` geometri som förbinder den ursprungliga **punkten** med den " -"närmaste punkten på kanten med identifieraren ``edge_id``" +msgid "``LINESTRING`` geometry that connects the original **point** to the closest point of the edge with identifier ``edge_id``" +msgstr "``LINESTRING`` geometri som förbinder den ursprungliga **punkten** med den närmaste punkten på kanten med identifieraren ``edge_id``" msgid "One point in an edge" msgstr "En punkt i en kant" @@ -14464,12 +10973,8 @@ msgstr "Den gröna noden är den ursprungliga punkten." msgid "``geom`` has the value of the original point." msgstr "``geom`` har värdet av den ursprungliga punkten." -msgid "" -"The geometry ``edge`` is a line that connects the original point with the " -"edge :math:`sp \\rightarrow ep` edge." -msgstr "" -"Geometrin ``kant`` är en linje som förbinder den ursprungliga punkten med " -"kanten :math:`sp \\rightarrow ep` kant." +msgid "The geometry ``edge`` is a line that connects the original point with the edge :math:`sp \\rightarrow ep` edge." +msgstr "Geometrin ``kant`` är en linje som förbinder den ursprungliga punkten med kanten :math:`sp \\rightarrow ep` kant." msgid "The point is located at the left of the edge." msgstr "Punkten är placerad till vänster om kanten." @@ -14489,12 +10994,8 @@ msgstr "``dryrun => true``" msgid "Generates a PostgreSQL ``NOTICE`` with the code used." msgstr "Genererar en PostgreSQL ``NOTICE`` med den använda koden." -msgid "" -"The generated code can be used as a starting base code for additional " -"requirements, like taking into consideration the SRID." -msgstr "" -"Den genererade koden kan användas som en baskod för ytterligare krav, t.ex. " -"för att ta hänsyn till SRID." +msgid "The generated code can be used as a starting base code for additional requirements, like taking into consideration the SRID." +msgstr "Den genererade koden kan användas som en baskod för ytterligare krav, t.ex. för att ta hänsyn till SRID." msgid "Many points in an edge" msgstr "Många punkter i en kant" @@ -14502,20 +11003,11 @@ msgstr "Många punkter i en kant" msgid "The green nodes are the **original points**" msgstr "De gröna noderna är **originalpunkterna**" -msgid "" -"The geometry ``geom``, marked as **g1** and **g2** are the **original " -"points**" -msgstr "" -"Geometrin ``geom``, markerad som **g1** och **g2** är de **originalpunkter**" +msgid "The geometry ``geom``, marked as **g1** and **g2** are the **original points**" +msgstr "Geometrin ``geom``, markerad som **g1** och **g2** är de **originalpunkter**" -msgid "" -"The geometry ``edge``, marked as **edge1** and **edge2** is a line that " -"connects the **original point** with the closest point on the :math:`sp " -"\\rightarrow ep` edge." -msgstr "" -"Geometrin ``kant``, markerad som **kant1** och **kant2** är en linje som " -"förbinder **originalpunkten** med den närmaste punkten på :math:`sp " -"\\rightarrow ep`-kanten." +msgid "The geometry ``edge``, marked as **edge1** and **edge2** is a line that connects the **original point** with the closest point on the :math:`sp \\rightarrow ep` edge." +msgstr "Geometrin ``kant``, markerad som **kant1** och **kant2** är en linje som förbinder **originalpunkten** med den närmaste punkten på :math:`sp \\rightarrow ep`-kanten." msgid "Many points dry run execution" msgstr "Utförande av torrkörning på många punkter" @@ -14523,11 +11015,8 @@ msgstr "Utförande av torrkörning på många punkter" msgid "Do not process query" msgstr "Bearbeta inte förfrågan" -msgid "" -"Generate a PostgreSQL ``NOTICE`` with the code used to calculate all columns" -msgstr "" -"Generera en PostgreSQL ``NOTICE`` med koden som används för att beräkna alla " -"kolumner" +msgid "Generate a PostgreSQL ``NOTICE`` with the code used to calculate all columns" +msgstr "Generera en PostgreSQL ``NOTICE`` med koden som används för att beräkna alla kolumner" msgid "Find at most two routes to a given point" msgstr "Hitta högst två vägar till en given punkt" @@ -14544,28 +11033,14 @@ msgstr "Hantering av punkter utanför grafen." msgid "Points of interest" msgstr "Attraktioner" -msgid "" -"Some times the applications work \"on the fly\" starting from a location " -"that is not a vertex in the graph. Those locations, in pgRrouting are called " -"points of interest." -msgstr "" -"Ibland fungerar applikationerna \"on the fly\" med utgångspunkt från en " -"plats som inte är ett vertex i grafen. Dessa platser kallas i pgRrouting för " -"intressepunkter." +msgid "Some times the applications work \"on the fly\" starting from a location that is not a vertex in the graph. Those locations, in pgRrouting are called points of interest." +msgstr "Ibland fungerar applikationerna \"on the fly\" med utgångspunkt från en plats som inte är ett vertex i grafen. Dessa platser kallas i pgRrouting för intressepunkter." -msgid "" -"The information needed in the points of interest is ``pid``, ``edge_id``, " -"``side``, ``fraction``." -msgstr "" -"Den information som behövs i intressepunkterna är ``pid``, ``edge_id``, " -"``side``, ``fraction``." +msgid "The information needed in the points of interest is ``pid``, ``edge_id``, ``side``, ``fraction``." +msgstr "Den information som behövs i intressepunkterna är ``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 "" -"På denna dokumentation kommer det att finnas cirka 6 fasta punkter av " -"intresse och de kommer att lagras på ett bord." +msgid "On this documentation there will be some 6 fixed points of interest and they will be stored on a table." +msgstr "På denna dokumentation kommer det att finnas cirka 6 fasta punkter av intresse och de kommer att lagras på ett bord." msgid "A unique identifier." msgstr "En unik identifierare." @@ -14585,12 +11060,8 @@ msgstr "Punkternas geometri." msgid "The distance between ``geom`` and the segment ``edge_id``." msgstr "Avståndet mellan ``geom`` och segmentet ``edge_id``." -msgid "" -"A segment that connects the ``geom`` of the point to the closest point on " -"the segment ``edge_id``." -msgstr "" -"Ett segment som förbinder punktens ``geom`` med den närmaste punkten på " -"segmentet ``edge_id``." +msgid "A segment that connects the ``geom`` of the point to the closest point on the segment ``edge_id``." +msgstr "Ett segment som förbinder punktens ``geom`` med den närmaste punkten på segmentet ``edge_id``." msgid "``newPoint``" msgstr "``newPoint``" @@ -14607,12 +11078,8 @@ msgstr "Infoga intressepunkterna." msgid "Filling the rest of the table." msgstr "Fyller resten av bordet." -msgid "" -"Any other additional modification: In this manual, point :math:`6` can be " -"reached from both sides." -msgstr "" -"Någon annan ytterligare modifiering: I denna manual kan punkten :math:`6` " -"nås från båda sidor." +msgid "Any other additional modification: In this manual, point :math:`6` can be reached from both sides." +msgstr "Någon annan ytterligare modifiering: I denna manual kan punkten :math:`6` nås från båda sidor." msgid "The points of interest:" msgstr "De intressanta platserna:" @@ -14620,23 +11087,11 @@ msgstr "De intressanta platserna:" msgid "``pgr_floydWarshall``" msgstr "``pgr_floydWarshall``" -msgid "" -"``pgr_floydWarshall`` - Returns the sum of the costs of the shortest path " -"for each pair of nodes in the graph using Floyd-Warshall algorithm." -msgstr "" -"``pgr_floydWarshall`` - Returnerar summan av kostnaderna för den kortaste " -"vägen för varje par av noder i grafen med hjälp av Floyd-Warshall-algoritmen." +msgid "``pgr_floydWarshall`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Floyd-Warshall algorithm." +msgstr "``pgr_floydWarshall`` - Returnerar summan av kostnaderna för den kortaste vägen för varje par av noder i grafen med hjälp av Floyd-Warshall-algoritmen." -msgid "" -"The Floyd-Warshall algorithm, also known as Floyd's algorithm, is a good " -"choice to calculate the sum of the costs of the shortest path for each pair " -"of nodes in the graph, for *dense graphs*. We use Boost's implementation " -"which runs in :math:`\\Theta(V^3)` time," -msgstr "" -"Floyd-Warshall-algoritmen, även känd som Floyds algoritm, är ett bra val för " -"att beräkna summan av kostnaderna för den kortaste vägen för varje par noder " -"i grafen, för *täta grafer*. Vi använder Boosts implementation som körs på :" -"math:`\\Theta(V^3)`-tid," +msgid "The Floyd-Warshall algorithm, also known as Floyd's algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *dense graphs*. We use Boost's implementation which runs in :math:`\\Theta(V^3)` time," +msgstr "Floyd-Warshall-algoritmen, även känd som Floyds algoritm, är ett bra val för att beräkna summan av kostnaderna för den kortaste vägen för varje par noder i grafen, för *täta grafer*. Vi använder Boosts implementation som körs på :math:`\\Theta(V^3)`-tid," msgid "pgr_floydWarshall(`Edges SQL`_, [``directed``])" msgstr "pgr_floydWarshall(`Kanter SQL`_, [``directed``])" @@ -14644,19 +11099,14 @@ msgstr "pgr_floydWarshall(`Kanter SQL`_, [``directed``])" msgid "For a directed subgraph with edges :math:`\\{1, 2, 3, 4\\}`." msgstr "För en riktad delgraf med kanter :math:`\\{1, 2, 3, 4\\}`." -msgid "" -"Boost `Floyd-Warshall `_" +msgid "Boost `Floyd-Warshall `_" msgstr "Boost `Floyd-Warshall `_" msgid "``pgr_full_version``" msgstr "``pgr_full_version``" -msgid "" -"``pgr_full_version`` — Get the details of pgRouting version information." -msgstr "" -"``pgr_full_version`` - Hämta detaljerna i versionsinformationen för " -"pgRouting." +msgid "``pgr_full_version`` — Get the details of pgRouting version information." +msgstr "``pgr_full_version`` - Hämta detaljerna i versionsinformationen för pgRouting." msgid "Get complete details of pgRouting version information" msgstr "Få fullständig information om pgRouting version information" @@ -14727,42 +11177,14 @@ msgstr "Git-hash av pgRouting-byggnaden" msgid "``pgr_hawickCircuits`` - Experimental" msgstr "``pgr_hawickCircuits`` - Experimentell" -msgid "" -"``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits " -"algorithm." -msgstr "" -"``pgr_hawickCircuits`` - Returnerar listan över kretsar som använder Hawick-" -"kretsalgoritmen." +msgid "``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits algorithm." +msgstr "``pgr_hawickCircuits`` - Returnerar listan över kretsar som använder Hawick-kretsalgoritmen." -msgid "" -"Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. " -"James. This algorithm solves the problem of detecting and enumerating " -"circuits in graphs. It is capable of circuit enumeration in graphs with " -"directed-arcs, multiple-arcs and self-arcs with a memory efficient and high-" -"performance im-plementation. It is an extension of Johnson's Algorithm of " -"finding all the elementary circuits of a directed graph." -msgstr "" -"Hawick Circuit algorithm, publicerades 2008 av Ken Hawick och Health A. " -"James. Algoritmen löser problemet med att upptäcka och räkna upp kretsar i " -"grafer. Den kan räkna upp kretsar i grafer med riktade arcs, multipla arcs " -"och self-arcs med en minneseffektiv och högpresterande implementering. Den " -"är en utvidgning av Johnsons algoritm för att hitta alla elementära kretsar " -"i en riktad graf." +msgid "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. James. This algorithm solves the problem of detecting and enumerating circuits in graphs. It is capable of circuit enumeration in graphs with directed-arcs, multiple-arcs and self-arcs with a memory efficient and high-performance im-plementation. It is an extension of Johnson's Algorithm of finding all the elementary circuits of a directed graph." +msgstr "Hawick Circuit algorithm, publicerades 2008 av Ken Hawick och Health A. James. Algoritmen löser problemet med att upptäcka och räkna upp kretsar i grafer. Den kan räkna upp kretsar i grafer med riktade arcs, multipla arcs och self-arcs med en minneseffektiv och högpresterande implementering. Den är en utvidgning av Johnsons algoritm för att hitta alla elementära kretsar i en riktad graf." -msgid "" -"There are 2 variations defined in the Boost Graph Library. Here, we have " -"implemented only 2nd as it serves the most suitable and practical usecase. " -"In this variation we get the circuits after filtering out the circuits " -"caused by parallel edges. Parallel edge circuits have more use cases when " -"you want to count the no. of circuits.Maybe in future, we will also " -"implemenent this variation." -msgstr "" -"Det finns 2 varianter definierade i Boost Graph Library. Här har vi bara " -"implementerat den andra eftersom den är det mest lämpliga och praktiska " -"användningsfallet. I den här varianten får vi kretsarna efter att ha " -"filtrerat bort de kretsar som orsakas av parallella kanter. Parallella " -"kantkretsar har fler användningsfall när du vill räkna antalet kretsar. " -"Kanske i framtiden kommer vi också att implementera denna variation." +msgid "There are 2 variations defined in the Boost Graph Library. Here, we have implemented only 2nd as it serves the most suitable and practical usecase. In this variation we get the circuits after filtering out the circuits caused by parallel edges. Parallel edge circuits have more use cases when you want to count the no. of circuits.Maybe in future, we will also implemenent this variation." +msgstr "Det finns 2 varianter definierade i Boost Graph Library. Här har vi bara implementerat den andra eftersom den är det mest lämpliga och praktiska användningsfallet. I den här varianten får vi kretsarna efter att ha filtrerat bort de kretsar som orsakas av parallella kanter. Parallella kantkretsar har fler användningsfall när du vill räkna antalet kretsar. Kanske i framtiden kommer vi också att implementera denna variation." msgid "The algorithm implementation works only for directed graph" msgstr "Implementeringen av algoritmen fungerar endast för riktade grafer" @@ -14788,8 +11210,7 @@ msgstr "Kretsar som finns i pgRouting :doc:`sampledata`" msgid "Id of the circuit starting from ``1``" msgstr "Id för kretsen med början från ``1``" -msgid "" -"Relative position in the path. Has value ``0`` for beginning of the path" +msgid "Relative position in the path. Has value ``0`` for beginning of the path" msgstr "Relativ position i banan. Har värdet ``0`` för början av banan" msgid "Identifier of the starting vertex of the circuit." @@ -14801,40 +11222,22 @@ msgstr "Identifierare för kretsens slutpunkt." msgid "Identifier of the node in the path from a vid to next vid." msgstr "Identifierare av noden i sökvägen från en vid till nästa vid." -msgid "" -"`Boost: Hawick Circuit Algorithm `__" -msgstr "" -"`Boost: Hawick Circuit Algorithm `__" +msgid "`Boost: Hawick Circuit Algorithm `__" +msgstr "`Boost: Hawick Circuit Algorithm `__" msgid "``pgr_isPlanar`` - Experimental" msgstr "``pgr_isPlanar`` - Experimentell" -msgid "" -"``pgr_isPlanar`` — Returns a boolean depending upon the planarity of the " -"graph." -msgstr "" -"``pgr_isPlanar`` - Returnerar ett boolean beroende på grafens planaritet." +msgid "``pgr_isPlanar`` — Returns a boolean depending upon the planarity of the graph." +msgstr "``pgr_isPlanar`` - Returnerar ett boolean beroende på grafens planaritet." -msgid "" -"A graph is planar if it can be drawn in two-dimensional space with no two of " -"its edges crossing. Such a drawing of a planar graph is called a plane " -"drawing. Every planar graph also admits a straight-line drawing, which is a " -"plane drawing where each edge is represented by a line segment. When a graph " -"has :math:`K_5` or :math:`K_{3, 3}` as subgraph then the graph is not planar." -msgstr "" -"En graf är plan om den kan ritas i ett tvådimensionellt rum utan att två av " -"dess kanter korsar varandra. En sådan ritning av en plan graf kallas för en " -"plan ritning. Varje plan graf kan också ritas med en rak linje, vilket är en " -"plan ritning där varje kant representeras av ett linjesegment. När en graf " -"har :math:`K_5` eller :math:`K_{3, 3}` som undergraf är grafen inte plan." +msgid "A graph is planar if it can be drawn in two-dimensional space with no two of its edges crossing. Such a drawing of a planar graph is called a plane drawing. Every planar graph also admits a straight-line drawing, which is a plane drawing where each edge is represented by a line segment. When a graph has :math:`K_5` or :math:`K_{3, 3}` as subgraph then the graph is not planar." +msgstr "En graf är plan om den kan ritas i ett tvådimensionellt rum utan att två av dess kanter korsar varandra. En sådan ritning av en plan graf kallas för en plan ritning. Varje plan graf kan också ritas med en rak linje, vilket är en plan ritning där varje kant representeras av ett linjesegment. När en graf har :math:`K_5` eller :math:`K_{3, 3}` som undergraf är grafen inte plan." msgid "This implementation use the Boyer-Myrvold Planarity Testing." msgstr "Denna implementering använder Boyer-Myrvolds planaritetstest." -msgid "" -"It will return a boolean value depending upon the planarity of the graph." +msgid "It will return a boolean value depending upon the planarity of the graph." msgstr "Den returnerar ett booleskt värde som beror på grafens planhet." msgid "Applicable only for **undirected** graphs." @@ -14864,82 +11267,46 @@ msgstr "`true` när grafen är planar." msgid "`false` when the graph is not planar." msgstr "`false` när grafen inte är planar." -msgid "" -"The following edges will make the subgraph with vertices {10, 15, 11, 16, " -"13} a :math:`K_1` graph." -msgstr "" -"Följande kanter kommer att göra undergrafen med topparna {10, 15, 11, 16, " -"13} till en :math:`K_1`-graf." +msgid "The following edges will make the subgraph with vertices {10, 15, 11, 16, 13} a :math:`K_1` graph." +msgstr "Följande kanter kommer att göra undergrafen med topparna {10, 15, 11, 16, 13} till en :math:`K_1`-graf." -msgid "" -"The new graph is not planar because it has a :math:`K_5` subgraph. Edges in " -"blue represent :math:`K_5` subgraph." -msgstr "" -"Den nya grafen är inte plan eftersom den har en :math:`K_5`-undergraf. " -"Kanter i blått representerar :math:`K_5` subgraf." +msgid "The new graph is not planar because it has a :math:`K_5` subgraph. Edges in blue represent :math:`K_5` subgraph." +msgstr "Den nya grafen är inte plan eftersom den har en :math:`K_5`-undergraf. Kanter i blått representerar :math:`K_5` subgraf." -msgid "" -"`Boost: Boyer Myrvold `__" -msgstr "" -"`Boost: Boyer Myrvold `__" +msgid "`Boost: Boyer Myrvold `__" +msgstr "`Boost: Boyer Myrvold `__" msgid "``pgr_johnson``" msgstr "``pgr_johnson``" -msgid "" -"``pgr_johnson`` - Returns the sum of the costs of the shortest path for each " -"pair of nodes in the graph using Johnson algorithm." +msgid "``pgr_johnson`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Johnson algorithm." msgstr "``pgr_johnson`` - Returnerar summan av kostnaderna för den kortaste vägen för varje par noder i grafen med hjälp av Johnson-algoritmen." -msgid "" -"The Johnson algorithm, is a good choice to calculate the sum of the costs of " -"the shortest path for each pair of nodes in the graph, for *sparse graphs*. " -"It uses the Boost's implementation which runs in :math:`O(V E \\log V)` time," -msgstr "" -"Johnson-algoritmen är ett bra val för att beräkna summan av kostnaderna för " -"den kortaste vägen för varje par noder i grafen, för *glesa grafer*. Den " -"använder Boosts implementation som körs på :math:`O(V E \\log V)` tid," +msgid "The Johnson algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *sparse graphs*. It uses the Boost's implementation which runs in :math:`O(V E \\log V)` time," +msgstr "Johnson-algoritmen är ett bra val för att beräkna summan av kostnaderna för den kortaste vägen för varje par noder i grafen, för *glesa grafer*. Den använder Boosts implementation som körs på :math:`O(V E \\log V)` tid," msgid "pgr johnson(`Edges SQL`_, [``directed``])" msgstr "pgr johnson(`Kanter SQL`_, [``directed``])" -msgid "" -"Boost `Johnson `_" -msgstr "" -"Boost `Johnson `_" +msgid "Boost `Johnson `_" +msgstr "Boost `Johnson `_" msgid "``pgr_kingOrdering`` - Experimental" msgstr "``pgr_kingOrdering`` - Experimentell" -msgid "" -"``pgr_kingOrdering`` — Returns the King ordering of an undirected graph." +msgid "``pgr_kingOrdering`` — Returns the King ordering of an undirected graph." msgstr "``pgr_kingOrdering`` - Returnerar King-ordningen för en odelad graf." -msgid "" -"In numerical linear algebra and graph theory, the King ordering algorithm is " -"a heuristic designed to reorder the vertices of a graph so as to reduce its " -"bandwidth." +msgid "In numerical linear algebra and graph theory, the King ordering algorithm is a heuristic designed to reorder the vertices of a graph so as to reduce its bandwidth." msgstr "Inom numerisk linjär algebra och grafteori är King Ordering Algorithm en heuristisk metod för att omordna topparna i en graf så att bandbredden minskar." -msgid "" -"The method follows a breadth-first search (BFS) traversal, but with a " -"refinement: at each step, the unvisited neighbors of the current vertex are " -"inserted into the queue in ascending order of their pseudo-degree, where the " -"pseudo-degree of a vertex is the number of edges connecting it to yet-" -"unvisited vertices. This prioritization often yields a smaller bandwidth " -"compared to simpler BFS orderings." +msgid "The method follows a breadth-first search (BFS) traversal, but with a refinement: at each step, the unvisited neighbors of the current vertex are inserted into the queue in ascending order of their pseudo-degree, where the pseudo-degree of a vertex is the number of edges connecting it to yet-unvisited vertices. This prioritization often yields a smaller bandwidth compared to simpler BFS orderings." msgstr "Metoden följer en BFS-traversering (breadth-first search), men med en förfining: i varje steg infogas de obesökta grannarna till det aktuella toppunktet i kön i stigande ordning efter deras pseudograd, där pseudograden för ett toppunkt är antalet kanter som ansluter det till ännu obesökta toppunkter. Den här prioriteringen ger ofta en mindre bandbredd jämfört med enklare BFS-ordning." msgid "The implementation targets undirected graphs." msgstr "Implementationen är inriktad på oledade grafer." -msgid "" -"Bandwidth minimization is an NP-complete problem; King ordering provides a " -"practical local minimization approach." +msgid "Bandwidth minimization is an NP-complete problem; King ordering provides a practical local minimization approach." msgstr "Minimering av bandbredd är ett NP-komplett problem; King Ordering ger en praktisk lokal minimeringsmetod." msgid "The time complexity is: :math:`O(m^2 \\log(m)|E|)`" @@ -14954,25 +11321,17 @@ msgstr ":math:`m` är den högsta graden bland alla toppar." msgid "pgr_kingOrdering(`Edges SQL`_)" msgstr "pgr_kingOrdering(`Edges SQL`_)" -msgid "" -"`Boost: King Ordering `__" +msgid "`Boost: King Ordering `__" msgstr "`Boost: Kungens beställning `__" msgid "``pgr_kruskal``" msgstr "``pgr_kruskal``" -msgid "" -"``pgr_kruskal`` — Minimum spanning tree of a graph using Kruskal's algorithm." -msgstr "" -"``pgr_kruskal`` - Minsta spännviddsträd för en graf med Kruskals algoritm." +msgid "``pgr_kruskal`` — Minimum spanning tree of a graph using Kruskal's algorithm." +msgstr "``pgr_kruskal`` - Minsta spännviddsträd för en graf med Kruskals algoritm." -msgid "" -"This algorithm finds the minimum spanning forest in a possibly disconnected " -"graph using Kruskal's algorithm." -msgstr "" -"Denna algoritm hittar den minsta spännvidden i en eventuellt frånkopplad " -"graf med hjälp av Kruskals algoritm." +msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Kruskal's algorithm." +msgstr "Denna algoritm hittar den minsta spännvidden i en eventuellt frånkopplad graf med hjälp av Kruskals algoritm." msgid "EMPTY SET is returned when there are no edges in the graph." msgstr "EMPTY SET returneras när det inte finns några kanter i grafen." @@ -14986,26 +11345,17 @@ msgstr "Returnerar uppsättning av |result-mst|" msgid "Minimum spanning forest" msgstr "Skog med minsta spann" -msgid "" -"``pgr_kruskalBFS`` — Kruskal's algorithm for Minimum Spanning Tree with " -"breadth First Search ordering." -msgstr "" -"``pgr_kruskalBFS`` - Kruskals algoritm för minsta spännviddsträd med bredd " -"först sökordning." +msgid "``pgr_kruskalBFS`` — Kruskal's algorithm for Minimum Spanning Tree with breadth First Search ordering." +msgstr "``pgr_kruskalBFS`` - Kruskals algoritm för minsta spännviddsträd med bredd först sökordning." msgid "Added ``pred`` result columns." msgstr "Lagt till ``pred`` resultatkolumner." -msgid "" -"Visits and extracts the nodes information in Breath First Search ordering of " -"the Minimum Spanning Tree created using Kruskal's algorithm." -msgstr "" -"Besöker och extraherar nodinformationen i Breath First Search-ordningen i " -"det minsta spännviddsträdet som skapats med Kruskals algoritm." +msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." +msgstr "Besöker och extraherar nodinformationen i Breath First Search-ordningen i det minsta spännviddsträdet som skapats med Kruskals algoritm." msgid "Returned tree nodes from a root vertex are on Breath First Search order" -msgstr "" -"Returnerade trädnoder från en rotvertex är på Breath First Search-ordning" +msgstr "Returnerade trädnoder från en rotvertex är på Breath First Search-ordning" msgid "Breath First Search Running time: :math:`O(E + V)`" msgstr "Breath First Search Speltid: :math:`O(E + V)`" @@ -15019,24 +11369,14 @@ msgstr "pgr_kruskalBFS(`Kanter SQL`_, **root vids**, [``max_depth``])" msgid "The Minimum Spanning Tree having as root vertex :math:`6`" msgstr "Det minsta spännviddsträdet som har som rotvertex :math:`6``" -msgid "" -"The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:" -"`depth \\leq 3`" -msgstr "" -"Det minsta spännviddsträdet som börjar på topparna :math:`\\{9, 6\\}` med :" -"math:`djup \\leq 3`" +msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`depth \\leq 3`" +msgstr "Det minsta spännviddsträdet som börjar på topparna :math:`\\{9, 6\\}` med :math:`djup \\leq 3`" msgid "``pgr_kruskalDD`` — Catchament nodes using Kruskal's algorithm." msgstr "``pgr_kruskalDD`` - Fångar upp noder med hjälp av Kruskals algoritm." -msgid "" -"Using Kruskal's algorithm, extracts the nodes that have aggregate costs less " -"than or equal to a **distance** from a **root** vertex (or vertices) within " -"the calculated minimum spanning tree." -msgstr "" -"Använd Kruskals algoritm för att extrahera de noder som har aggregerade " -"kostnader som är mindre än eller lika med ett **avstånd** från en **rot**-" -"vertex (eller vertex) inom det beräknade minsta spännvidden i trädet." +msgid "Using Kruskal's algorithm, extracts the nodes that have aggregate costs less than or equal to a **distance** from a **root** vertex (or vertices) within the calculated minimum spanning tree." +msgstr "Använd Kruskals algoritm för att extrahera de noder som har aggregerade kostnader som är mindre än eller lika med ett **avstånd** från en **rot**-vertex (eller vertex) inom det beräknade minsta spännvidden i trädet." msgid "Returned tree nodes from a root vertex are on Depth First Search order." msgstr "Returnerade trädnoder från en rotvertex är på djupet först sökordning." @@ -15050,33 +11390,17 @@ msgstr "pgr_kruskalDD(`Kanter SQL`_, **root vid**, **distance**)" msgid "pgr_kruskalDD(`Edges SQL`_, **root vids**, **distance**)" msgstr "pgr_kruskalDD(`Kanter SQL`_, **root vids**, **distance**)" -msgid "" -"The Minimum Spanning Tree starting on vertex :math:`6` with :math:`distance " -"\\leq 3.5`" -msgstr "" -"Det minsta spännviddsträdet som börjar på toppunkten :math:`6` med :math:" -"`avstånd \\leq 3.5`" +msgid "The Minimum Spanning Tree starting on vertex :math:`6` with :math:`distance \\leq 3.5`" +msgstr "Det minsta spännviddsträdet som börjar på toppunkten :math:`6` med :math:`avstånd \\leq 3.5`" -msgid "" -"The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:" -"`distance \\leq 3.5`" -msgstr "" -"Det minsta spännviddsträdet som börjar på topparna :math:`\\{9, 6\\}` med :" -"math:`avstånd \\leq 3.5`" +msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`distance \\leq 3.5`" +msgstr "Det minsta spännviddsträdet som börjar på topparna :math:`\\{9, 6\\}` med :math:`avstånd \\leq 3.5`" -msgid "" -"``pgr_kruskalDFS`` — Kruskal's algorithm for Minimum Spanning Tree with " -"Depth First Search ordering." -msgstr "" -"``pgr_kruskalDFS`` - Kruskals algoritm för minsta spännviddsträd med djup " -"första sökordning." +msgid "``pgr_kruskalDFS`` — Kruskal's algorithm for Minimum Spanning Tree with Depth First Search ordering." +msgstr "``pgr_kruskalDFS`` - Kruskals algoritm för minsta spännviddsträd med djup första sökordning." -msgid "" -"Visits and extracts the nodes information in Depth First Search ordering of " -"the Minimum Spanning Tree created using Kruskal's algorithm." -msgstr "" -"Besöker och extraherar nodernas information i Depth First Search-ordningen " -"för det minsta spännviddsträdet som skapats med Kruskals algoritm." +msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." +msgstr "Besöker och extraherar nodernas information i Depth First Search-ordningen för det minsta spännviddsträdet som skapats med Kruskals algoritm." msgid "Returned tree nodes from a root vertex are on Depth First Search order" msgstr "Returnerade trädnoder från en rotvertex är på djupet först sökordning" @@ -15090,22 +11414,11 @@ msgstr "pgr_kruskalDFS(`Kanter SQL`_, **root vids**, [``max_depth``])" msgid "``pgr_lengauerTarjanDominatorTree`` - Experimental" msgstr "``pgr_lengauerTarjanDominatorTree`` - Experimentell" -msgid "" -"``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all " -"vertices." -msgstr "" -"``pgr_lengauerTarjanDominatorTree`` - Returnerar den omedelbara dominatorn " -"för alla toppar." +msgid "``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all vertices." +msgstr "``pgr_lengauerTarjanDominatorTree`` - Returnerar den omedelbara dominatorn för alla toppar." -msgid "" -"The algorithm calculates the *immediate dominator* of each vertex called " -"**idom**, once **idom** of each vertex is calculated then by making every " -"**idom** of each vertex as its parent, the dominator tree can be built." -msgstr "" -"Algoritmen beräknar den * omedelbara dominatorn * för varje toppunkt som " -"kallas **idom**, när **idom** för varje toppunkt har beräknats genom att " -"göra varje **idom** för varje toppunkt som dess förälder, kan " -"dominatorträdet byggas." +msgid "The algorithm calculates the *immediate dominator* of each vertex called **idom**, once **idom** of each vertex is calculated then by making every **idom** of each vertex as its parent, the dominator tree can be built." +msgstr "Algoritmen beräknar den * omedelbara dominatorn * för varje toppunkt som kallas **idom**, när **idom** för varje toppunkt har beräknats genom att göra varje **idom** för varje toppunkt som dess förälder, kan dominatorträdet byggas." msgid "The algorithm works in directed graph only." msgstr "Algoritmen fungerar endast i riktade grafer." @@ -15113,8 +11426,7 @@ msgstr "Algoritmen fungerar endast i riktade grafer." msgid "The algorithm returns *idom* of each vertex." msgstr "Algoritmen returnerar *idom* för varje toppunkt." -msgid "" -"If the *root vertex* not present in the graph then it returns empty set." +msgid "If the *root vertex* not present in the graph then it returns empty set." msgstr "Om *rotvertexet* inte finns i grafen returneras en tom uppsättning." msgid "Running time: :math:`O((V+E)log(V+E))`" @@ -15153,64 +11465,38 @@ msgstr "Omedelbar dominator av toppunkt." msgid "Dominator tree of another component." msgstr "Dominant träd av en annan komponent." -msgid "" -"`Boost: Lengauer-Tarjan dominator `__" -msgstr "" -"`Boost: Lengauer-Tarjan dominator `__" +msgid "`Boost: Lengauer-Tarjan dominator `__" +msgstr "`Boost: Lengauer-Tarjan dominator `__" -msgid "" -"`Wikipedia: dominator tree `__" -msgstr "" -"`Wikipedia: dominatorträd `__" +msgid "`Wikipedia: dominator tree `__" +msgstr "`Wikipedia: dominatorträd `__" msgid "``pgr_lineGraph`` - Proposed" msgstr "``pgr_lineGraph`` - Föreslagen" -msgid "" -"``pgr_lineGraph`` — Transforms the given graph into its corresponding edge-" -"based graph." -msgstr "" -"``pgr_lineGraph`` - Transformerar den givna grafen till dess motsvarande " -"kantbaserade graf." +msgid "``pgr_lineGraph`` — Transforms the given graph into its corresponding edge-based graph." +msgstr "``pgr_lineGraph`` - Transformerar den givna grafen till dess motsvarande kantbaserade graf." msgid "Works for directed and undirected graphs." msgstr "Fungerar för riktade och oriktade grafer." -msgid "" -"Given a graph :math:`G`, its line graph :math:`L(G)` is a graph such that:" -msgstr "" -"Givet en graf :math:`G`, är dess linjegraf :math:`L(G)` en sådan graf att:" +msgid "Given a graph :math:`G`, its line graph :math:`L(G)` is a graph such that:" +msgstr "Givet en graf :math:`G`, är dess linjegraf :math:`L(G)` en sådan graf att:" msgid "Each vertex of :math:`L(G)` represents an edge of :math:`G`." msgstr "Varje toppunkt i :math:`L(G)` representerar en kant i :math:`G`." -msgid "" -"Two vertices of :math:`L(G)` are adjacent if and only if their corresponding " -"edges share a common endpoint in :math:`G`" -msgstr "" -"Två hörn i :math:`L(G)` är angränsande om och endast om deras motsvarande " -"kanter har en gemensam ändpunkt i :math:`G`" +msgid "Two vertices of :math:`L(G)` are adjacent if and only if their corresponding edges share a common endpoint in :math:`G`" +msgstr "Två hörn i :math:`L(G)` är angränsande om och endast om deras motsvarande kanter har en gemensam ändpunkt i :math:`G`" -msgid "" -"The ``cost`` and ``reverse_cost`` columns of the result represent existence " -"of the edge." -msgstr "" -"Kolumnerna ``cost`` och ``reverse_cost`` i resultatet representerar " -"existensen av kanten." +msgid "The ``cost`` and ``reverse_cost`` columns of the result represent existence of the edge." +msgstr "Kolumnerna ``cost`` och ``reverse_cost`` i resultatet representerar existensen av kanten." msgid "When the graph is directed the result is directed." msgstr "När grafen är riktad är resultatet riktat." -msgid "" -"To get the complete Line Graph use unique identifiers on the double way " -"edges (See `Additional Examples`_)." -msgstr "" -"För att få en komplett linjediagram används unika identifierare på " -"dubbelvägskanterna (se `Ytterligare exempel`_)." +msgid "To get the complete Line Graph use unique identifiers on the double way edges (See `Additional Examples`_)." +msgstr "För att få en komplett linjediagram används unika identifierare på dubbelvägskanterna (se `Ytterligare exempel`_)." msgid "When the graph is undirected the result is undirected." msgstr "När grafen är odränerad är resultatet odränerat." @@ -15239,44 +11525,26 @@ msgstr "När `negativ`: målet är den omvända kanten i den ursprungliga grafen msgid "Weight of the edge (``source``, ``target``)." msgstr "Kantvikt (``källa``, ``mål``)." -msgid "" -"When `negative`: edge (``source``, ``target``) does not exist, therefore " -"it’s not part of the graph." -msgstr "" -"När `negativ`: kanten (``källa``, ``mål``) existerar inte, därför är den " -"inte en del av grafen." +msgid "When `negative`: edge (``source``, ``target``) does not exist, therefore it’s not part of the graph." +msgstr "När `negativ`: kanten (``källa``, ``mål``) existerar inte, därför är den inte en del av grafen." msgid "Weight of the edge (``target``, ``source``)." msgstr "Kantvikt (``mål``, ``källa``)." -msgid "" -"When `negative`: edge (``target``, ``source``) does not exist, therefore " -"it’s not part of the graph." -msgstr "" -"När `negativ`: kant (``mål``, ``källa``) finns inte, därför är den inte en " -"del av grafen." +msgid "When `negative`: edge (``target``, ``source``) does not exist, therefore it’s not part of the graph." +msgstr "När `negativ`: kant (``mål``, ``källa``) finns inte, därför är den inte en del av grafen." msgid "Given the following directed graph" msgstr "Givet följande riktade graf" -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 ":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 "Representation som riktad med delade kantidentifierare" -msgid "" -"For the simplicity, the design of the edges table on the database, has the " -"edge's identifiers are represented with 3 digits:" -msgstr "" -"För enkelhetens skull har utformningen av kanttabellen i databasen, att " -"kanternas identifierare representeras med 3 siffror:" +msgid "For the simplicity, the design of the edges table on the database, has the edge's identifiers are represented with 3 digits:" +msgstr "För enkelhetens skull har utformningen av kanttabellen i databasen, att kanternas identifierare representeras med 3 siffror:" msgid "hundreds" msgstr "hundratals" @@ -15299,35 +11567,20 @@ msgstr "målvertexen" msgid "In this image," msgstr "I den här bilden," -msgid "" -"Single or double head arrows represent one edge (row) on the edges table." -msgstr "" -"Pilarna med enkelt eller dubbelt huvud representerar en kant (rad) på " -"kanttabellen." +msgid "Single or double head arrows represent one edge (row) on the edges table." +msgstr "Pilarna med enkelt eller dubbelt huvud representerar en kant (rad) på kanttabellen." msgid "The numbers in the yellow shadow are the edge identifiers." msgstr "Siffrorna i den gula skuggan är kantidentifierare." -msgid "" -"Two pair of edges share the same identifier when the ``reverse_cost`` column " -"is used." -msgstr "" -"Två par kanter delar samma identifierare när kolumnen ``reverse_cost`` " -"används." +msgid "Two pair of edges share the same identifier when the ``reverse_cost`` column is used." +msgstr "Två par kanter delar samma identifierare när kolumnen ``reverse_cost`` används." -msgid "" -"Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with one " -"edge row with :math:`id=203`." -msgstr "" -"Kanterna :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` representeras av en " -"kantrad med :math:`id=203`." +msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with one edge row with :math:`id=203`." +msgstr "Kanterna :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` representeras av en kantrad med :math:`id=203`." -msgid "" -"Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with one " -"edge row with :math:`id=304`." -msgstr "" -"Kanterna :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` representeras av en " -"kantrad med :math:`id=304`." +msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with one edge row with :math:`id=304`." +msgstr "Kanterna :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` representeras av en kantrad med :math:`id=304`." msgid "The graph can be created as follows:" msgstr "Grafen kan skapas på följande sätt:" @@ -15338,17 +11591,13 @@ msgstr "Linjediagram över en riktad graf som representeras med delade kanter" msgid "The result is a directed graph." msgstr "Resultatet är en riktad graf." -msgid "" -"For :math:`seq=4` from :math:`203 \\leftrightarrow 304` represent two edges" -msgstr "" -"För :math:`seq=4` från :math:`203 \\vänster höger pil 304` representerar två " -"kanter" +msgid "For :math:`seq=4` from :math:`203 \\leftrightarrow 304` represent two edges" +msgstr "För :math:`seq=4` från :math:`203 \\vänster höger pil 304` representerar två kanter" msgid "For all the other values of ``seq`` represent one edge." msgstr "För alla andra värden av ``seq`` representerar en kant." -msgid "" -"The ``cost`` and ``reverse_cost`` values represent the existence of the edge." +msgid "The ``cost`` and ``reverse_cost`` values represent the existence of the edge." msgstr "Värdena ``cost`` och ``reverse_cost`` anger om kanten existerar." msgid "When positive: the edge exists." @@ -15361,120 +11610,67 @@ msgid "Representation as directed with unique edge identifiers" msgstr "Representation som riktad med unika kantidentifierare" msgid "Single head arrows represent one edge (row) on the edges table." -msgstr "" -"Pilarna med ett huvud representerar en kant (rad) i tabellen över kanter." +msgstr "Pilarna med ett huvud representerar en kant (rad) i tabellen över kanter." msgid "There are no double head arrows" msgstr "Det finns inga pilar med dubbla huvuden" -msgid "" -"Two pair of edges share the same ending nodes and the ``reverse_cost`` " -"column is not used." -msgstr "" -"Två par kanter har samma slutnoder och kolumnen ``reverse_cost`` används " -"inte." +msgid "Two pair of edges share the same ending nodes and the ``reverse_cost`` column is not used." +msgstr "Två par kanter har samma slutnoder och kolumnen ``reverse_cost`` används inte." -msgid "" -"Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with two " -"edges :math:`id=203` and :math:`id=302` respectively." -msgstr "" -"Kanterna :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` representeras med två " -"kanter :math:`id=203` respektive :math:`id=302`." +msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with two edges :math:`id=203` and :math:`id=302` respectively." +msgstr "Kanterna :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` representeras med två kanter :math:`id=203` respektive :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 "" -"Kanterna :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` representeras med två " -"kanter :math:`id=304` respektive :math:`id=403`." +msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with two edges :math:`id=304` and :math:`id=403` respectively." +msgstr "Kanterna :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` representeras med två kanter :math:`id=304` respektive :math:`id=403`." msgid "Line Graph of a directed graph represented with unique edges" msgstr "Linjediagram över en riktad graf som representeras med unika kanter" -msgid "" -"For :math:`seq=7` from :math:`203 \\leftrightarrow 302` represent two edges." -msgstr "" -"För :math:`seq=7` från :math:`203 \\leftrightarrow 302` representerar två " -"kanter." +msgid "For :math:`seq=7` from :math:`203 \\leftrightarrow 302` represent two edges." +msgstr "För :math:`seq=7` från :math:`203 \\leftrightarrow 302` representerar två kanter." -msgid "" -"For :math:`seq=8` from :math:`304 \\leftrightarrow 403` represent two edges." -msgstr "" -"För :math:`seq=8` från :math:`304 \\vänster höger pil 403` representerar två " -"kanter." +msgid "For :math:`seq=8` from :math:`304 \\leftrightarrow 403` represent two edges." +msgstr "För :math:`seq=8` från :math:`304 \\vänster höger pil 403` representerar två kanter." msgid "wikipedia: `Line Graph `__" msgstr "wikipedia: `Linjediagram `__" -msgid "" -"mathworld: `Line Graph `__" -msgstr "" -"mathworld: `Linjegraf `__" +msgid "mathworld: `Line Graph `__" +msgstr "mathworld: `Linjegraf `__" msgid "``pgr_lineGraphFull`` - Experimental" msgstr "``pgr_lineGraphFull`` - Experimentell" -msgid "" -"``pgr_lineGraphFull`` — Transforms a given graph into a new graph where all " -"of the vertices from the original graph are converted to line graphs." -msgstr "" -"``pgr_lineGraphFull`` - Transformerar en given graf till en ny graf där alla " -"hörn från den ursprungliga grafen konverteras till linjegrafer." +msgid "``pgr_lineGraphFull`` — Transforms a given graph into a new graph where all of the vertices from the original graph are converted to line graphs." +msgstr "``pgr_lineGraphFull`` - Transformerar en given graf till en ny graf där alla hörn från den ursprungliga grafen konverteras till linjegrafer." msgid "Version 2.6.0" msgstr "Version 2.6.0" -msgid "" -"``pgr_lineGraphFull``, converts original directed graph to a directed line " -"graph by converting each vertex to a complete graph and keeping all the " -"original edges. The new connecting edges have a cost 0 and go between the " -"adjacent original edges, respecting the directionality." -msgstr "" -"``pgr_lineGraphFull``, konverterar en ursprunglig riktad graf till en riktad " -"linjegraf genom att konvertera varje vertex till en komplett graf och " -"behålla alla ursprungliga kanter. De nya anslutande kanterna har en kostnad " -"på 0 och går mellan de intilliggande ursprungliga kanterna, med respekt för " -"riktningen." +msgid "``pgr_lineGraphFull``, converts original directed graph to a directed line graph by converting each vertex to a complete graph and keeping all the original edges. The new connecting edges have a cost 0 and go between the adjacent original edges, respecting the directionality." +msgstr "``pgr_lineGraphFull``, konverterar en ursprunglig riktad graf till en riktad linjegraf genom att konvertera varje vertex till en komplett graf och behålla alla ursprungliga kanter. De nya anslutande kanterna har en kostnad på 0 och går mellan de intilliggande ursprungliga kanterna, med respekt för riktningen." -msgid "" -"A possible application of the resulting graph is **\"routing with two edge " -"restrictions\"**:" -msgstr "" -"En möjlig tillämpning av den resulterande grafen är **\"routing med två " -"kantbegränsningar\"**:" +msgid "A possible application of the resulting graph is **\"routing with two edge restrictions\"**:" +msgstr "En möjlig tillämpning av den resulterande grafen är **\"routing med två kantbegränsningar\"**:" -msgid "" -"Setting a cost of using the vertex when routing between edges on the " -"connecting edge" -msgstr "" -"Ställer in en kostnad för att använda vertexen vid routing mellan kanter på " -"den anslutande kanten" +msgid "Setting a cost of using the vertex when routing between edges on the connecting edge" +msgstr "Ställer in en kostnad för att använda vertexen vid routing mellan kanter på den anslutande kanten" msgid "Forbid the routing between two edges by removing the connecting edge" -msgstr "" -"Förbjud routing mellan två kanter genom att ta bort den anslutande kanten" +msgstr "Förbjud routing mellan två kanter genom att ta bort den anslutande kanten" -msgid "" -"This is possible because each of the intersections (vertices) in the " -"original graph are now complete graphs that have a new edge for each " -"possible turn across that intersection." -msgstr "" -"Detta är möjligt eftersom alla korsningar (hörnpunkter) i den ursprungliga " -"grafen nu är kompletta grafer som har en ny kant för varje möjlig sväng över " -"korsningen." +msgid "This is possible because each of the intersections (vertices) in the original graph are now complete graphs that have a new edge for each possible turn across that intersection." +msgstr "Detta är möjligt eftersom alla korsningar (hörnpunkter) i den ursprungliga grafen nu är kompletta grafer som har en ny kant för varje möjlig sväng över korsningen." msgid "This function is for **directed** graphs." msgstr "Denna funktion är avsedd för **riktade** grafer." -msgid "" -"Results are undefined when a negative vertex id is used in the input graph." -msgstr "" -"Resultaten är odefinierade när ett negativt vertex-id används i indatagrafen." +msgid "Results are undefined when a negative vertex id is used in the input graph." +msgstr "Resultaten är odefinierade när ett negativt vertex-id används i indatagrafen." -msgid "" -"Results are undefined when a duplicated edge id is used in the input graph." -msgstr "" -"Resultaten är odefinierade när ett duplicerat kant-ID används i indatagrafen." +msgid "Results are undefined when a duplicated edge id is used in the input graph." +msgstr "Resultaten är odefinierade när ett duplicerat kant-ID används i indatagrafen." msgid "Running time: TBD" msgstr "Löptid: TBD" @@ -15488,22 +11684,14 @@ msgstr "Returnerar uppsättning av |result-linegf|" msgid "Full line graph of subgraph of edges :math:`\\{4, 7, 8, 10\\}`" msgstr "Fullständig linjegraf av delgraf av kanter :math:`{\\4, 7, 8, 10\\}`" -msgid "" -"The examples include the subgraph including edges 4, 7, 8, and 10 with " -"``reverse_cost``." -msgstr "" -"Exemplen inkluderar delgrafen som innehåller kanterna 4, 7, 8 och 10 med " -"``reverse_cost``." +msgid "The examples include the subgraph including edges 4, 7, 8, and 10 with ``reverse_cost``." +msgstr "Exemplen inkluderar delgrafen som innehåller kanterna 4, 7, 8 och 10 med ``reverse_cost``." msgid "The data" msgstr "Uppgifterna" -msgid "" -"This example displays how this graph transformation works to create " -"additional edges for each possible turn in a graph." -msgstr "" -"Detta exempel visar hur denna grafomvandling fungerar för att skapa " -"ytterligare kanter för varje möjlig vändning i en graf." +msgid "This example displays how this graph transformation works to create additional edges for each possible turn in a graph." +msgstr "Detta exempel visar hur denna grafomvandling fungerar för att skapa ytterligare kanter för varje möjlig vändning i en graf." msgid "|first|" msgstr "|first|" @@ -15520,51 +11708,23 @@ msgstr "|second|" msgid "second" msgstr "sekund" -msgid "" -"In the transformed graph, all of the edges from the original graph are still " -"present (yellow), but we now have additional edges for every turn that could " -"be made across vertex 7 (orange)." -msgstr "" -"I den transformerade grafen finns alla kanter från den ursprungliga grafen " -"kvar (gult), men vi har nu ytterligare kanter för varje sväng som skulle " -"kunna göras över toppunkt 7 (orange)." +msgid "In the transformed graph, all of the edges from the original graph are still present (yellow), but we now have additional edges for every turn that could be made across vertex 7 (orange)." +msgstr "I den transformerade grafen finns alla kanter från den ursprungliga grafen kvar (gult), men vi har nu ytterligare kanter för varje sväng som skulle kunna göras över toppunkt 7 (orange)." msgid "Creating table that identifies transformed vertices" msgstr "Skapa tabell som identifierar transformerade toppar" -msgid "" -"The vertices in the transformed graph are each created by splitting up the " -"vertices in the original graph. Unless a vertex in the original graph is a " -"leaf vertex, it will generate more than one vertex in the transformed graph. " -"One of the newly created vertices in the transformed graph will be given the " -"same vertex identifier as the vertex that it was created from in the " -"original graph, but the rest of the newly created vertices will have " -"negative vertex ids." -msgstr "" -"Varje toppunkt i den transformerade grafen skapas genom att dela upp " -"toppunkterna i den ursprungliga grafen. Om inte en vertex i den ursprungliga " -"grafen är en bladvertex kommer den att generera mer än en vertex i den " -"transformerade grafen. Ett av de nyskapade vertexen i den transformerade " -"grafen får samma vertexidentifierare som det vertex som det skapades från i " -"den ursprungliga grafen, men resten av de nyskapade vertexen får negativa " -"vertexidentifierare." +msgid "The vertices in the transformed graph are each created by splitting up the vertices in the original graph. Unless a vertex in the original graph is a leaf vertex, it will generate more than one vertex in the transformed graph. One of the newly created vertices in the transformed graph will be given the same vertex identifier as the vertex that it was created from in the original graph, but the rest of the newly created vertices will have negative vertex ids." +msgstr "Varje toppunkt i den transformerade grafen skapas genom att dela upp toppunkterna i den ursprungliga grafen. Om inte en vertex i den ursprungliga grafen är en bladvertex kommer den att generera mer än en vertex i den transformerade grafen. Ett av de nyskapade vertexen i den transformerade grafen får samma vertexidentifierare som det vertex som det skapades från i den ursprungliga grafen, men resten av de nyskapade vertexen får negativa vertexidentifierare." -msgid "" -"Following is an example of how to generate a table that maps the ids of the " -"newly created vertices with the original vertex that they were created from" -msgstr "" -"Här följer ett exempel på hur man genererar en tabell som mappar id:n för de " -"nyskapade topparna med den ursprungliga topp som de skapades från" +msgid "Following is an example of how to generate a table that maps the ids of the newly created vertices with the original vertex that they were created from" +msgstr "Här följer ett exempel på hur man genererar en tabell som mappar id:n för de nyskapade topparna med den ursprungliga topp som de skapades från" msgid "Store edge results" msgstr "Förvara kantresultat" -msgid "" -"The first step is to store the results of the ``pgr_lineGraphFull`` call " -"into a table" -msgstr "" -"Det första steget är att lagra resultatet av anropet ``pgr_lineGraphFull`` i " -"en tabell" +msgid "The first step is to store the results of the ``pgr_lineGraphFull`` call into a table" +msgstr "Det första steget är att lagra resultatet av anropet ``pgr_lineGraphFull`` i en tabell" msgid "Create the mapping table" msgstr "Skapa mappningstabellen" @@ -15584,12 +11744,8 @@ msgstr "De positiva vertexidentifierarna är de ursprungliga identifierarna" msgid "Inspecting the vertices map" msgstr "Inspektion av kartan över hörnpunkter" -msgid "" -"The self loops happen when there is no cost traveling to the ``target`` and " -"the source has an original value." -msgstr "" -"Självslingorna uppstår när det inte kostar något att resa till \"målet\" och " -"källan har ett ursprungligt värde." +msgid "The self loops happen when there is no cost traveling to the ``target`` and the source has an original value." +msgstr "Självslingorna uppstår när det inte kostar något att resa till \"målet\" och källan har ett ursprungligt värde." msgid "Updating values from self loops" msgstr "Uppdatering av värden från självloopar" @@ -15603,29 +11759,17 @@ msgstr "Uppdatering från inre självloopar" msgid "Adding a soft restriction" msgstr "Lägga till en mjuk begränsning" -msgid "" -"A soft restriction going from vertex 6 to vertex 3 using edges 4 -> 7 is " -"wanted." -msgstr "" -"En mjuk begränsning som går från toppunkt 6 till toppunkt 3 med hjälp av " -"kanterna 4 -> 7 önskas." +msgid "A soft restriction going from vertex 6 to vertex 3 using edges 4 -> 7 is wanted." +msgstr "En mjuk begränsning som går från toppunkt 6 till toppunkt 3 med hjälp av kanterna 4 -> 7 önskas." msgid "Identifying the restriction" msgstr "Identifiering av begränsningen" -msgid "" -"Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where the " -"cost will be increased" -msgstr "" -"Kör en :doc:`pgr_dijkstraNear` kanten med kostnad 0, kant 8, är där " -"kostnaden kommer att ökas" +msgid "Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where the cost will be increased" +msgstr "Kör en :doc:`pgr_dijkstraNear` kanten med kostnad 0, kant 8, är där kostnaden kommer att ökas" -msgid "" -"The edge to be altered is ``WHERE cost = 0 AND seq != 1 AND edge != -1`` " -"from the previous query:" -msgstr "" -"Kanten som ska ändras är ``WHERE cost = 0 AND seq != 1 AND edge != -1`` från " -"den föregående frågan:" +msgid "The edge to be altered is ``WHERE cost = 0 AND seq != 1 AND edge != -1`` from the previous query:" +msgstr "Kanten som ska ändras är ``WHERE cost = 0 AND seq != 1 AND edge != -1`` från den föregående frågan:" msgid "Adding a value to the restriction" msgstr "Lägga till ett värde till begränsningen" @@ -15642,15 +11786,11 @@ msgstr "Nu använder rutten inte kant 8 och gör en U-sväng på en bladvertex." msgid "Simplifying leaf vertices" msgstr "Förenkling av bladhörnpunkter" -msgid "" -"In this example, there is no additional cost for traversing a leaf vertex." -msgstr "" -"I det här exemplet tillkommer ingen extra kostnad för att passera en " -"bladvertex." +msgid "In this example, there is no additional cost for traversing a leaf vertex." +msgstr "I det här exemplet tillkommer ingen extra kostnad för att passera en bladvertex." msgid "Using the vertex map give the leaf verices their original value." -msgstr "" -"Med hjälp av vertexkartan ger du bladvertices deras ursprungliga värde." +msgstr "Med hjälp av vertexkartan ger du bladvertices deras ursprungliga värde." msgid "On the source column" msgstr "På källkolumnen" @@ -15667,11 +11807,8 @@ msgstr "Bladnodernas självslingor är" msgid "Which can be removed" msgstr "Som kan tas bort" -msgid "" -"Routing can be done now using the original vertices id using :doc:" -"`pgr_dijkstra`" -msgstr "" -"Routing kan nu göras med hjälp av originalvertices id med :doc:`pgr_dijkstra`" +msgid "Routing can be done now using the original vertices id using :doc:`pgr_dijkstra`" +msgstr "Routing kan nu göras med hjälp av originalvertices id med :doc:`pgr_dijkstra`" msgid "Complete routing graph" msgstr "Komplett routningsgraf" @@ -15679,16 +11816,11 @@ msgstr "Komplett routningsgraf" msgid "Add edges from the original graph" msgstr "Lägg till kanter från den ursprungliga grafen" -msgid "" -"Add all the edges that are not involved in the line graph process to the new " -"table" -msgstr "" -"Lägg till alla kanter som inte är involverade i linjediagramprocessen i den " -"nya tabellen" +msgid "Add all the edges that are not involved in the line graph process to the new table" +msgstr "Lägg till alla kanter som inte är involverade i linjediagramprocessen i den nya tabellen" msgid "Some administrative tasks to get new identifiers for the edges" -msgstr "" -"Vissa administrativa uppgifter för att få nya identifierare för kanterna" +msgstr "Vissa administrativa uppgifter för att få nya identifierare för kanterna" msgid "Add the newly calculated edges" msgstr "Lägg till de nyligen beräknade kanterna" @@ -15696,12 +11828,8 @@ msgstr "Lägg till de nyligen beräknade kanterna" msgid "Using the routing graph" msgstr "Använda routningsgrafen" -msgid "" -"When using this method for routing with soft restrictions there will be " -"uturns" -msgstr "" -"När du använder den här metoden för routning med mjuka begränsningar kommer " -"det att finnas uturns" +msgid "When using this method for routing with soft restrictions there will be uturns" +msgstr "När du använder den här metoden för routning med mjuka begränsningar kommer det att finnas uturns" msgid "Routing from :math:`5` to :math:`1`" msgstr "Routning från :math:`5` till :math:`1`" @@ -15716,35 +11844,15 @@ msgid "``pgr_makeConnected`` - Experimental" msgstr "``pgr_makeConnected`` - Experimentell" msgid "``pgr_makeConnected`` — Set of edges that will connect the graph." -msgstr "" -"``pgr_makeConnected`` - Uppsättning kanter som kommer att ansluta grafen." +msgstr "``pgr_makeConnected`` - Uppsättning kanter som kommer att ansluta grafen." -msgid "" -"Adds the minimum number of edges needed to make the input graph connected. " -"The algorithm first identifies all of the connected components in the graph, " -"then adds edges to connect those components together in a path. For example, " -"if a graph contains three connected components A, B, and C, make_connected " -"will add two edges. The two edges added might consist of one connecting a " -"vertex in A with a vertex in B and one connecting a vertex in B with a " -"vertex in C." -msgstr "" -"Lägger till det minsta antal kanter som behövs för att göra indatagrafen " -"ansluten. Algoritmen identifierar först alla anslutna komponenter i grafen " -"och lägger sedan till kanter för att ansluta dessa komponenter till varandra " -"i en väg. Om en graf t.ex. innehåller tre anslutna komponenter A, B och C " -"lägger make_connected till två kanter. De två kanterna som läggs till kan " -"bestå av en som förbinder ett toppunkt i A med ett toppunkt i B och en som " -"förbinder ett toppunkt i B med ett toppunkt i C." +msgid "Adds the minimum number of edges needed to make the input graph connected. The algorithm first identifies all of the connected components in the graph, then adds edges to connect those components together in a path. For example, if a graph contains three connected components A, B, and C, make_connected will add two edges. The two edges added might consist of one connecting a vertex in A with a vertex in B and one connecting a vertex in B with a vertex in C." +msgstr "Lägger till det minsta antal kanter som behövs för att göra indatagrafen ansluten. Algoritmen identifierar först alla anslutna komponenter i grafen och lägger sedan till kanter för att ansluta dessa komponenter till varandra i en väg. Om en graf t.ex. innehåller tre anslutna komponenter A, B och C lägger make_connected till två kanter. De två kanterna som läggs till kan bestå av en som förbinder ett toppunkt i A med ett toppunkt i B och en som förbinder ett toppunkt i B med ett toppunkt i C." -msgid "" -"It will give a minimum list of all edges which are needed in the graph to " -"make connect it." -msgstr "" -"Det kommer att ge en minimilista över alla kanter som behövs i grafen för " -"att ansluta den." +msgid "It will give a minimum list of all edges which are needed in the graph to make connect it." +msgstr "Det kommer att ge en minimilista över alla kanter som behövs i grafen för att ansluta den." -msgid "" -"The algorithm does not considers geometric topology in the calculations." +msgid "The algorithm does not considers geometric topology in the calculations." msgstr "Algoritmen tar inte hänsyn till geometrisk topologi i beräkningarna." msgid "pgr_makeConnected(`Edges SQL`_)" @@ -15756,22 +11864,14 @@ msgstr "Returnerar uppsättning av |result-component-make|" msgid "List of edges that are needed to connect the graph." msgstr "Lista över kanter som behövs för att koppla ihop grafen." -msgid "" -"`Boost: make connected `__" -msgstr "" -"`Boost: skapa anslutning `__" +msgid "`Boost: make connected `__" +msgstr "`Boost: skapa anslutning `__" msgid "``pgr_maxCardinalityMatch``" msgstr "``pgr_maxCardinalityMatch``" -msgid "" -"``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a " -"graph." -msgstr "" -"``pgr_maxCardinalityMatch`` - Beräknar en matchning med maximal kardinalitet " -"i en graf." +msgid "``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a graph." +msgstr "``pgr_maxCardinalityMatch`` - Beräknar en matchning med maximal kardinalitet i en graf." msgid "pgr_maxCardinalityMatch(text) returns only ``edge`` column." msgstr "pgr_maxCardinalityMatch(text) returns only ``edge`` column." @@ -15785,19 +11885,11 @@ msgstr "riktad => ``false`` när den används." msgid "Renamed from ``pgr_maximumCardinalityMatching``" msgstr "Omdöpta från ``pgr_maximumCardinalityMatching``" -msgid "" -"A matching or independent edge set in a graph is a set of edges without " -"common vertices." -msgstr "" -"En matchande eller oberoende kantuppsättning i en graf är en uppsättning " -"kanter utan gemensamma toppar." +msgid "A matching or independent edge set in a graph is a set of edges without common vertices." +msgstr "En matchande eller oberoende kantuppsättning i en graf är en uppsättning kanter utan gemensamma toppar." -msgid "" -"A maximum matching is a matching that contains the largest possible number " -"of edges." -msgstr "" -"En maximal matchning är en matchning som innehåller största möjliga antal " -"kanter." +msgid "A maximum matching is a matching that contains the largest possible number of edges." +msgstr "En maximal matchning är en matchning som innehåller största möjliga antal kanter." msgid "There may be many maximum matchings." msgstr "Det kan finnas många maximala matchningar." @@ -15817,33 +11909,20 @@ msgstr "pgr_maxCardinalityMatch(`Kanter SQL`_)" msgid "Using all edges." msgstr "Använd alla kanter." -msgid "" -"SQL query, which should return a set of rows with the following columns:" -msgstr "" -"SQL-fråga, som ska returnera en uppsättning rader med följande kolumner:" +msgid "SQL query, which should return a set of rows with the following columns:" +msgstr "SQL-fråga, som ska returnera en uppsättning rader med följande kolumner:" -msgid "" -"A positive value represents the existence of the edge (``source``, " -"``target``)." -msgstr "" -"Ett positivt värde representerar existensen av kanten (``källa``, ``mål``)." +msgid "A positive value represents the existence of the edge (``source``, ``target``)." +msgstr "Ett positivt värde representerar existensen av kanten (``källa``, ``mål``)." -msgid "" -"A positive value represents the existence of the edge (``target``, " -"``source``)" -msgstr "" -"Ett positivt värde representerar existensen av kanten (``target``, " -"``source``)" +msgid "A positive value represents the existence of the edge (``target``, ``source``)" +msgstr "Ett positivt värde representerar existensen av kanten (``target``, ``source``)" msgid "Identifier of the edge in the original query." msgstr "Identifierare av kanten i den ursprungliga frågan." -msgid "" -"`Boost: maximum_matching `__" -msgstr "" -"`Boost: maximum_matching `__" +msgid "`Boost: maximum_matching `__" +msgstr "`Boost: maximum_matching `__" msgid "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" msgstr "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" @@ -15854,12 +11933,8 @@ msgstr "https://en.wikipedia.org/wiki/Ackermann_function" msgid "``pgr_maxFlow``" msgstr "``pgr_maxFlow``" -msgid "" -"``pgr_maxFlow`` — Calculates the maximum flow in a directed graph from the " -"source(s) to the targets(s) using the Push Relabel algorithm." -msgstr "" -"``pgr_maxFlow`` - Beräknar det maximala flödet i en riktad graf från " -"källorna till målen med hjälp av Push Relabel-algoritmen." +msgid "``pgr_maxFlow`` — Calculates the maximum flow in a directed graph from the source(s) to the targets(s) using the Push Relabel algorithm." +msgstr "``pgr_maxFlow`` - Beräknar det maximala flödet i en riktad graf från källorna till målen med hjälp av Push Relabel-algoritmen." msgid "pgr_maxFlow(Combinations)" msgstr "pgr_maxFlow(Combinations)" @@ -15867,10 +11942,8 @@ msgstr "pgr_maxFlow(Combinations)" msgid "Calculates the maximum flow from the sources to the targets." msgstr "Beräknar det maximala flödet från källorna till målen." -msgid "" -"When the maximum flow is **0** then there is no flow and **0** is returned." -msgstr "" -"När det maximala flödet är **0** finns det inget flöde och **0** returneras." +msgid "When the maximum flow is **0** then there is no flow and **0** is returned." +msgstr "När det maximala flödet är **0** finns det inget flöde och **0** returneras." msgid "Uses the :doc:`pgr_pushRelabel ` algorithm." msgstr "Använder algoritmen :doc:`pgr_pushRelabel `." @@ -15899,27 +11972,17 @@ msgstr "RETURNERAR ``BIGINT``" msgid "Maximum flow possible from the source(s) to the target(s)" msgstr "Högsta möjliga flöde från källan/källorna till målet/målen" -msgid "" -"`Boost: push relabel max flow `__" -msgstr "" -"`Boost: push relabel max flöde `__" +msgid "`Boost: push relabel max flow `__" +msgstr "`Boost: push relabel max flöde `__" -msgid "" -"https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" -msgstr "" -"https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" +msgid "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" +msgstr "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" msgid "``pgr_maxFlowMinCost`` - Experimental" msgstr "``pgr_maxFlowMinCost`` - Experimentell" -msgid "" -"``pgr_maxFlowMinCost`` — Calculates the edges that minimizes the total cost " -"of the maximum flow on a graph" -msgstr "" -"``pgr_maxFlowMinCost`` - Beräknar de kanter som minimerar den totala " -"kostnaden för det maximala flödet i en graf" +msgid "``pgr_maxFlowMinCost`` — Calculates the edges that minimizes the total cost of the maximum flow on a graph" +msgstr "``pgr_maxFlowMinCost`` - Beräknar de kanter som minimerar den totala kostnaden för det maximala flödet i en graf" msgid "pgr_maxFlowMinCost(Combinations)" msgstr "pgr_maxFlowMinCost(Combinations)" @@ -15934,9 +11997,7 @@ msgid "The cost value of all input edges must be nonnegative." msgstr "Kostnadsvärdet för alla inmatade kanter måste vara icke-negativt." msgid "Process is done when the cost value of all input edges is nonnegative." -msgstr "" -"Processen är klar när kostnadsvärdet för alla inmatade kanter är icke-" -"negativt." +msgstr "Processen är klar när kostnadsvärdet för alla inmatade kanter är icke-negativt." msgid "Process is done on edges with nonnegative cost." msgstr "Processen görs på kanter med icke-negativ kostnad." @@ -15947,12 +12008,8 @@ msgstr "Drifttid: :math:`O(U * (E + V * logV))`" msgid "where :math:`U` is the value of the max flow." msgstr "där :math:`U` är värdet på maxflödet." -msgid "" -":math:`U` is upper bound on number of iterations. In many real world cases " -"number of iterations is much smaller than :math:`U`." -msgstr "" -":math:`U` is upper bound on number of iterations. In many real world cases " -"number of iterations is much smaller than :math:`U`." +msgid ":math:`U` is upper bound on number of iterations. In many real world cases number of iterations is much smaller than :math:`U`." +msgstr ":math:`U` is upper bound on number of iterations. In many real world cases number of iterations is much smaller than :math:`U`." msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vid**)" msgstr "pgr_maxFlowMinCost(`Kanter SQL`_, **start vid**, **end vid**)" @@ -15975,12 +12032,8 @@ msgstr "Returnerar uppsättning av |result-flow-mincost|" msgid "``pgr_maxFlowMinCost_Cost`` - Experimental" msgstr "``pgr_maxFlowMinCost_Cost`` - Experimentell" -msgid "" -"``pgr_maxFlowMinCost_Cost`` — Calculates the minimum total cost of the " -"maximum flow on a graph" -msgstr "" -"``pgr_maxFlowMinCost_Cost`` - Beräknar den lägsta totala kostnaden för det " -"maximala flödet i en graf" +msgid "``pgr_maxFlowMinCost_Cost`` — Calculates the minimum total cost of the maximum flow on a graph" +msgstr "``pgr_maxFlowMinCost_Cost`` - Beräknar den lägsta totala kostnaden för det maximala flödet i en graf" msgid "pgr_maxFlowMinCost_Cost(Combinations)" msgstr "pgr_maxFlowMinCost_Cost(Combinations)" @@ -15989,8 +12042,7 @@ msgid "**The cost value of all input edges must be nonnegative.**" msgstr "**Kostnadsvärdet för alla inmatade kanter måste vara icke-negativt.**" msgid "When the maximum flow is 0 then there is no flow and **0** is returned." -msgstr "" -"När det maximala flödet är 0 finns det inget flöde och **0** returneras." +msgstr "När det maximala flödet är 0 finns det inget flöde och **0** returneras." msgid "Uses :doc:`pgr_maxFlowMinCost`." msgstr "Använder :doc:`pgr_maxFlowMinCost`." @@ -16020,16 +12072,10 @@ msgid "``pgr_pickDeliver`` - Experimental" msgstr "``pgr_pickDeliver`` - Experimentell" msgid "``pgr_pickDeliver`` - Pickup and delivery Vehicle Routing Problem" -msgstr "" -"``pgr_pickDeliver`` - Problem med ruttplanering för hämtning och leverans av " -"fordon" +msgstr "``pgr_pickDeliver`` - Problem med ruttplanering för hämtning och leverans av fordon" -msgid "" -"Problem: Distribute and optimize the pickup-delivery pairs into a fleet of " -"vehicles." -msgstr "" -"Problem: Fördela och optimera upphämtnings- och leveranspar i en " -"fordonsflotta." +msgid "Problem: Distribute and optimize the pickup-delivery pairs into a fleet of vehicles." +msgstr "Problem: Fördela och optimera upphämtnings- och leveranspar i en fordonsflotta." msgid "Optimization problem is NP-hard." msgstr "Optimeringsproblemet är NP-svårt." @@ -16085,18 +12131,13 @@ msgstr "Om det finns ett upphämtnings-/leveranspar som bryter mot tidsfönstret msgid "The speed, max_cycles, ma_capacity have illegal values" msgstr "Hastigheten, max_cycles, ma_capacity har olagliga värden" -msgid "" -"Six different initial will be optimized - the best solution found will be " -"result" -msgstr "" -"Sex olika initialer kommer att optimeras - den bästa lösningen som hittas " -"blir resultatet" +msgid "Six different initial will be optimized - the best solution found will be result" +msgstr "Sex olika initialer kommer att optimeras - den bästa lösningen som hittas blir resultatet" msgid "Signature" msgstr "Underskrift" -msgid "" -"pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" +msgid "pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" msgstr "pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" msgid "**options:** ``[factor, max_cycles, initial_sol]``" @@ -16141,11 +12182,8 @@ msgstr "[end_node_id, end_open, end_close, end_service]" msgid "``pgr_pickDeliverEuclidean`` - Experimental" msgstr "``pgr_pickDeliverEuclidean`` - Experimentell" -msgid "" -"``pgr_pickDeliverEuclidean`` - Pickup and delivery Vehicle Routing Problem" -msgstr "" -"``pgr_pickDeliverEuclidean`` - Problem med ruttplanering för hämtning och " -"leverans av fordon" +msgid "``pgr_pickDeliverEuclidean`` - Pickup and delivery Vehicle Routing Problem" +msgstr "``pgr_pickDeliverEuclidean`` - Problem med ruttplanering för hämtning och leverans av fordon" msgid "Replaces ``pgr_gsoc_vrppdtw``" msgstr "Ersätter ``pgr_gsoc_vrppdtw``" @@ -16172,8 +12210,7 @@ msgid "has (x, y) pickup and delivery locations." msgstr "har (x, y) upphämtnings- och leveransplatser." msgid "has opening and closing times for the pickup and delivery locations." -msgstr "" -"har öppnings- och stängningstider för upphämtnings- och leveransplatserna." +msgstr "har öppnings- och stängningstider för upphämtnings- och leveransplatserna." msgid "has a pickup and deliver service times." msgstr "har en upphämtning och leverera servicetider." @@ -16199,12 +12236,8 @@ msgstr "start_x, start_y, start_open, start_close [, start_service, ]" msgid "[ end_x, end_y, end_open, end_close, end_service ]" msgstr "[ end_x, end_y, end_open, end_close, end_service ]" -msgid "" -"This data example **lc101** is from data published at https://www.sintef.no/" -"projectweb/top/pdptw/li-lim-benchmark/" -msgstr "" -"Detta dataexempel **lc101** är hämtat från data som publicerats på https://" -"www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/" +msgid "This data example **lc101** is from data published at https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/" +msgstr "Detta dataexempel **lc101** är hämtat från data som publicerats på https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/" msgid "There are 25 vehicles in the problem all with the same characteristics." msgstr "Det finns 25 fordon i problemet som alla har samma egenskaper." @@ -16212,11 +12245,8 @@ msgstr "Det finns 25 fordon i problemet som alla har samma egenskaper." msgid "The original orders" msgstr "De ursprungliga beställningarna" -msgid "" -"The data comes in different rows for the pickup and the delivery of the same " -"order." -msgstr "" -"Uppgifterna kommer i olika rader för upphämtning och leverans av samma order." +msgid "The data comes in different rows for the pickup and the delivery of the same order." +msgstr "Uppgifterna kommer i olika rader för upphämtning och leverans av samma order." msgid "The original data needs to be converted to an appropriate table:" msgstr "Originaldata måste konverteras till en lämplig tabell:" @@ -16224,14 +12254,8 @@ msgstr "Originaldata måste konverteras till en lämplig tabell:" msgid "The query" msgstr "Frågeställningen" -msgid "" -"Showing only the relevant information to compare with the best solution " -"information published on https://www.sintef.no/projectweb/top/pdptw/100-" -"customers/" -msgstr "" -"Visar endast relevant information för att jämföra med informationen om den " -"bästa lösningen som publiceras på https://www.sintef.no/projectweb/top/" -"pdptw/100-customers/" +msgid "Showing only the relevant information to compare with the best solution information published on https://www.sintef.no/projectweb/top/pdptw/100-customers/" +msgstr "Visar endast relevant information för att jämföra med informationen om den bästa lösningen som publiceras på https://www.sintef.no/projectweb/top/pdptw/100-customers/" msgid "The best solution found for **lc101** is a travel time: 828.94" msgstr "Den bästa lösningen som hittades för **lc101** är en restid: 828.94" @@ -16242,16 +12266,11 @@ msgstr "Restid för detta genomförande: 854.54" msgid "``pgr_prim``" msgstr "``pgr_prim``" -msgid "" -"``pgr_prim`` — Minimum spanning forest of a graph using Prim's algorithm." +msgid "``pgr_prim`` — Minimum spanning forest of a graph using Prim's algorithm." msgstr "``pgr_prim`` - Skog med minsta spann i en graf med Prims algoritm." -msgid "" -"This algorithm finds the minimum spanning forest in a possibly disconnected " -"graph using Prim's algorithm." -msgstr "" -"Denna algoritm hittar den minsta spännviddsskogen i en eventuellt " -"frånkopplad graf med hjälp av Prims algoritm." +msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Prim's algorithm." +msgstr "Denna algoritm hittar den minsta spännviddsskogen i en eventuellt frånkopplad graf med hjälp av Prims algoritm." msgid "Prim's running time: :math:`O(E * log V)`" msgstr "Prims körtid: :math:`O(E * log V)`" @@ -16262,26 +12281,14 @@ msgstr "pgr_prim(`Kanter SQL`_)" msgid "Minimum spanning forest of a subgraph" msgstr "Minsta skog som spänner över en delgraf" -msgid "" -"`Boost: Prim's algorithm documentation `__" -msgstr "" -"`Boost: Dokumentation av Prims algoritm `__" +msgid "`Boost: Prim's algorithm documentation `__" +msgstr "`Boost: Dokumentation av Prims algoritm `__" -msgid "" -"``pgr_primBFS`` — Prim's algorithm for Minimum Spanning Tree with Depth " -"First Search ordering." -msgstr "" -"``pgr_primBFS`` - Prims algoritm för minsta spännviddsträd med djup först-" -"sökordning." +msgid "``pgr_primBFS`` — Prim's algorithm for Minimum Spanning Tree with Depth First Search ordering." +msgstr "``pgr_primBFS`` - Prims algoritm för minsta spännviddsträd med djup först-sökordning." -msgid "" -"Visits and extracts the nodes information in Breath First Search ordering of " -"the Minimum Spanning Tree created using Prims's algorithm." -msgstr "" -"Besöker och extraherar nodinformationen i Breath First Search-ordningen i " -"det minsta spännviddsträdet som skapats med Prims algoritm." +msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." +msgstr "Besöker och extraherar nodinformationen i Breath First Search-ordningen i det minsta spännviddsträdet som skapats med Prims algoritm." msgid "pgr_primBFS(`Edges SQL`_, **root vid**, [``max_depth``])" msgstr "pgr_primBFS(`Kanter SQL`_, **root vid**, [``max_depth``])" @@ -16292,14 +12299,8 @@ msgstr "pgr_primBFS(`Kanter SQL`_, **root vids**, [``max_depth``])" msgid "``pgr_primDD`` — Catchament nodes using Prim's algorithm." msgstr "``pgr_primDD`` - Fångar upp noder med Prims algoritm." -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 "" -"Med hjälp av Prims algoritm, extrahera de noder som har aggregerade " -"kostnader som är mindre än eller lika med ett avstånd från en rotvertex " -"(eller vertex) inom det beräknade minsta spännträd." +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 "Med hjälp av Prims algoritm, extrahera de noder som har aggregerade kostnader som är mindre än eller lika med ett avstånd från en rotvertex (eller vertex) inom det beräknade minsta spännträd." msgid "pgr_primDD(`Edges SQL`_, **root vid**, **distance**)" msgstr "pgr_primDD(`Kanter SQL`_, **root vid**, **distance**)" @@ -16307,19 +12308,11 @@ msgstr "pgr_primDD(`Kanter SQL`_, **root vid**, **distance**)" msgid "pgr_primDD(`Edges SQL`_, **root vids**, **distance**)" msgstr "pgr_primDD(`Kanter SQL`_, **root vids**, **distance**)" -msgid "" -"``pgr_primDFS`` — Prim algorithm for Minimum Spanning Tree with Depth First " -"Search ordering." -msgstr "" -"``pgr_primDFS`` - Prim-algoritm för minsta spännviddsträd med djup först-" -"sökordning." +msgid "``pgr_primDFS`` — Prim algorithm for Minimum Spanning Tree with Depth First Search ordering." +msgstr "``pgr_primDFS`` - Prim-algoritm för minsta spännviddsträd med djup först-sökordning." -msgid "" -"Visits and extracts the nodes information in Depth First Search ordering of " -"the Minimum Spanning Tree created using Prims's algorithm." -msgstr "" -"Besöker och extraherar nodernas information i Depth First Search-ordningen " -"för det minsta spännviddsträdet som skapats med Prims algoritm." +msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." +msgstr "Besöker och extraherar nodernas information i Depth First Search-ordningen för det minsta spännviddsträdet som skapats med Prims algoritm." msgid "pgr_primDFS(`Edges SQL`_, **root vid**, [``max_depth``])" msgstr "pgr_primDFS(`Kanter SQL`_, **root vid**, [``max_depth``])" @@ -16330,12 +12323,8 @@ msgstr "pgr_primDFS(`Kanter SQL`_, **root vids**, [``max_depth``])" msgid "``pgr_pushRelabel``" msgstr "``pgr_pushRelabel``" -msgid "" -"``pgr_pushRelabel`` — Calculates the flow on the graph edges that maximizes " -"the flow from the sources to the targets using Push Relabel Algorithm." -msgstr "" -"``pgr_pushRelabel`` - Beräknar flödet på grafens kanter som maximerar flödet " -"från källorna till målen med hjälp av Push Relabel-algoritmen." +msgid "``pgr_pushRelabel`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Push Relabel Algorithm." +msgstr "``pgr_pushRelabel`` - Beräknar flödet på grafens kanter som maximerar flödet från källorna till målen med hjälp av Push Relabel-algoritmen." msgid "pgr_pushRelabel(Combinations)" msgstr "pgr_pushRelabel(Combinations)" @@ -16361,12 +12350,8 @@ msgstr "pgr_pushRelabel(`Kanter SQL`_, `Combinations SQL`_)" msgid "``pgr_separateCrossing``" msgstr "``pgr_separeraKorsning``" -msgid "" -"``pgr_separateCrossing`` - From crossing geometries generates geometries " -"that do not cross." -msgstr "" -"``pgr_separateCrossing`` - Från korsande geometrier genereras geometrier som " -"inte korsar varandra." +msgid "``pgr_separateCrossing`` - From crossing geometries generates geometries that do not cross." +msgstr "``pgr_separateCrossing`` - Från korsande geometrier genereras geometrier som inte korsar varandra." msgid "Proposed function." msgstr "Föreslagen funktion." @@ -16395,33 +12380,17 @@ msgstr "Används i ST_Snap före ST_Split" msgid "Get the code for further refinement." msgstr "Hämta koden för ytterligare förfining." -msgid "" -"When there are special details that need to be taken care of because of the " -"final application or the quality of the data, the code can be obtained On a " -"PostgreSQL ``NOTICE`` using the ``dryrun`` flag." -msgstr "" -"När det finns speciella detaljer som måste tas om hand på grund av den " -"slutliga applikationen eller datakvaliteten kan koden erhållas på en " -"PostgreSQL ``NOTICE`` med hjälp av ``dryrun`` flaggan." +msgid "When there are special details that need to be taken care of because of the final application or the quality of the data, the code can be obtained On a PostgreSQL ``NOTICE`` using the ``dryrun`` flag." +msgstr "När det finns speciella detaljer som måste tas om hand på grund av den slutliga applikationen eller datakvaliteten kan koden erhållas på en PostgreSQL ``NOTICE`` med hjälp av ``dryrun`` flaggan." msgid "``pgr_separateTouching``" msgstr "``pgr_separateTouching``" -msgid "" -"``pgr_separateTouching`` - From touching geometries generates geometries " -"that are properly connected at endpoints" -msgstr "" -"``pgr_separateTouching`` - Från berörande geometrier genereras geometrier " -"som är korrekt anslutna vid ändpunkterna" +msgid "``pgr_separateTouching`` - From touching geometries generates geometries that are properly connected at endpoints" +msgstr "``pgr_separateTouching`` - Från berörande geometrier genereras geometrier som är korrekt anslutna vid ändpunkterna" -msgid "" -"This is an auxiliary function for processing geometries that touch but don't " -"share exact endpoints, splitting them at their intersection points to " -"improve network connectivity." -msgstr "" -"Detta är en hjälpfunktion för bearbetning av geometrier som berör varandra " -"men inte har exakta ändpunkter, och som delas upp vid sina skärningspunkter " -"för att förbättra nätverksanslutningen." +msgid "This is an auxiliary function for processing geometries that touch but don't share exact endpoints, splitting them at their intersection points to improve network connectivity." +msgstr "Detta är en hjälpfunktion för bearbetning av geometrier som berör varandra men inte har exakta ändpunkter, och som delas upp vid sina skärningspunkter för att förbättra nätverksanslutningen." msgid "pgr_separateTouching(`Edges SQL`_, [``tolerance``, ``dryrun``])" msgstr "pgr_separateTouching(`Kanter SQL`_, [``tolerance``, ``dryrun``])" @@ -16429,27 +12398,16 @@ msgstr "pgr_separateTouching(`Kanter SQL`_, [``tolerance``, ``dryrun``])" msgid "``pgr_sequentialVertexColoring`` - Proposed" msgstr "```pgr_sequentialVertexColoring`` - Föreslagen" -msgid "" -"``pgr_sequentialVertexColoring`` — Returns the vertex coloring of an " -"undirected graph, using greedy approach." -msgstr "" -"``pgr_sequentialVertexColoring`` - Returnerar vertexfärgningen av en odelad " -"graf med hjälp av en girig metod." +msgid "``pgr_sequentialVertexColoring`` — Returns the vertex coloring of an undirected graph, using greedy approach." +msgstr "``pgr_sequentialVertexColoring`` - Returnerar vertexfärgningen av en odelad graf med hjälp av en girig metod." -msgid "" -"Sequential vertex coloring algorithm is a graph coloring algorithm in which " -"color identifiers are assigned to the vertices of a graph in a sequential " -"manner, such that no edge connects two identically colored vertices." -msgstr "" -"Sequential vertex coloring algorithm är en algoritm för färgläggning av " -"grafer där färgidentifierare tilldelas topparna i en graf sekventiellt, så " -"att ingen kant förbinder två identiskt färgade toppar." +msgid "Sequential vertex coloring algorithm is a graph coloring algorithm in which color identifiers are assigned to the vertices of a graph in a sequential manner, such that no edge connects two identically colored vertices." +msgstr "Sequential vertex coloring algorithm är en algoritm för färgläggning av grafer där färgidentifierare tilldelas topparna i en graf sekventiellt, så att ingen kant förbinder två identiskt färgade toppar." msgid "The implementation is applicable only for **undirected** graphs." msgstr "Implementeringen är endast tillämplig för **undirected** grafer." -msgid "" -"Provides the color to be assigned to all the vertices present in the graph." +msgid "Provides the color to be assigned to all the vertices present in the graph." msgstr "Ger den färg som ska tilldelas alla hörn som finns i grafen." msgid "Color identifiers values are in the Range :math:`[1, |V|]`" @@ -16458,21 +12416,11 @@ msgstr "Värden för färgidentifierare ligger i intervallet :math:`[1, |V|]`" msgid "The algorithm tries to assign the least possible color to every vertex." msgstr "Algoritmen försöker tilldela minsta möjliga färg till varje toppunkt." -msgid "" -"Efficient graph coloring is an NP-Hard problem, and therefore, this " -"algorithm does not always produce optimal coloring. It follows a greedy " -"strategy by iterating through all the vertices sequentially, and assigning " -"the smallest possible color that is not used by its neighbors, to each " -"vertex." -msgstr "" -"Effektiv färgläggning av grafer är ett NP-hårt problem, och därför ger den " -"här algoritmen inte alltid optimal färgläggning. Den följer en girig " -"strategi genom att iterera genom alla toppar i följd och tilldela varje topp " -"den minsta möjliga färg som inte används av dess grannar." +msgid "Efficient graph coloring is an NP-Hard problem, and therefore, this algorithm does not always produce optimal coloring. It follows a greedy strategy by iterating through all the vertices sequentially, and assigning the smallest possible color that is not used by its neighbors, to each vertex." +msgstr "Effektiv färgläggning av grafer är ett NP-hårt problem, och därför ger den här algoritmen inte alltid optimal färgläggning. Den följer en girig strategi genom att iterera genom alla toppar i följd och tilldela varje topp den minsta möjliga färg som inte används av dess grannar." msgid "The returned rows are ordered in ascending order of the vertex value." -msgstr "" -"De återlämnade raderna är ordnade i stigande ordning efter vertexvärdet." +msgstr "De återlämnade raderna är ordnade i stigande ordning efter vertexvärdet." msgid "Sequential Vertex Coloring Running Time: :math:`O(|V|*(d + k))`" msgstr "Sekventiell vertexfärgning Körtid: :math:`O(|V|*(d + k))`" @@ -16486,46 +12434,31 @@ msgstr ":math:`k` is the number of colors used." msgid "pgr_sequentialVertexColoring(`Edges SQL`_)" msgstr "pgr_sequentialVertexColoring(`Kanter SQL`_)" -msgid "" -"`Boost: Sequential Vertex Coloring `__" -msgstr "" -"`Boost: Sekventiell färgläggning av toppar `__" +msgid "`Boost: Sequential Vertex Coloring `__" +msgstr "`Boost: Sekventiell färgläggning av toppar `__" msgid "``pgr_sloanOrdering`` - Experimental" msgstr "``pgr_sloanOrdering`` - Experimentell" -msgid "" -"``pgr_sloanOrdering`` — Returns the Sloan ordering of an undirected graph" +msgid "``pgr_sloanOrdering`` — Returns the Sloan ordering of an undirected graph" msgstr "``pgr_sloanOrdering`` - Returnerar Sloan-ordningen för en odränerad graf" -msgid "" -"The Sloan ordering algorithm reorders the vertices of a graph to reduce " -"bandwidth, profile, and wavefront properties, which is particularly useful " -"for sparse matrix computations and finite element analysis." +msgid "The Sloan ordering algorithm reorders the vertices of a graph to reduce bandwidth, profile, and wavefront properties, which is particularly useful for sparse matrix computations and finite element analysis." msgstr "Sloans ordningsalgoritm ordnar om topparna i en graf för att minska bandbredd, profil och vågfrontsegenskaper, vilket är särskilt användbart för glesa matrisberäkningar och finita elementanalyser." msgid "Finds a pseudoperipheral vertex pair to determine good starting points" msgstr "Hittar ett pseudoperifert toppunktspar för att bestämma bra startpunkter" -msgid "" -"Uses a priority-based algorithm that balances vertex degree and distance " -"from the start vertex." +msgid "Uses a priority-based algorithm that balances vertex degree and distance from the start vertex." msgstr "Använder en prioritetsbaserad algoritm som balanserar vertexgrad och avstånd från startvertexet." -msgid "" -"Aims to minimize bandwidth (maximum difference between connected vertex " -"indices." +msgid "Aims to minimize bandwidth (maximum difference between connected vertex indices." msgstr "Syftar till att minimera bandbredden (maximal skillnad mellan index för anslutna vertex)." -msgid "" -"Typically produces better orderings than simple breadth-first approaches." +msgid "Typically produces better orderings than simple breadth-first approaches." msgstr "Ger vanligtvis bättre ordningar än enkla bredd-först-metoder." -msgid "" -"Time complexity: :math:`O(V² + E)` where V is the number of vertices and E " -"is the number of edges." +msgid "Time complexity: :math:`O(V² + E)` where V is the number of vertices and E is the number of edges." msgstr "Tidskomplexitet: :math:`O(V² + E)` där V är antalet toppar och E är antalet kanter." msgid "pgr_sloanOrdering(`Edges SQL`_)" @@ -16540,9 +12473,7 @@ msgstr "Ny beställning av Sloan." msgid "Sloan ordering of Original graph from Boost example (vertices 0-9)." msgstr "Sloan-ordning av originalgrafen från Boost-exemplet (toppar 0-9)." -msgid "" -"`Boost: Sloan Ordering `__" +msgid "`Boost: Sloan Ordering `__" msgstr "`Boost: Sloan Beställning `__" msgid "``pgr_stoerWagner`` - Experimental" @@ -16554,43 +12485,14 @@ msgstr "``pgr_stoerWagner`` - Min-cut av grafen med stoerWagner-algoritmen." msgid "Version 3.0" msgstr "Version 3.0" -msgid "" -"In graph theory, the Stoer–Wagner algorithm is a recursive algorithm to " -"solve the minimum cut problem in undirected weighted graphs with non-" -"negative weights. The essential idea of this algorithm is to shrink the " -"graph by merging the most intensive vertices, until the graph only contains " -"two combined vertex sets. At each phase, the algorithm finds the minimum s-t " -"cut for two vertices s and t chosen as its will. Then the algorithm shrinks " -"the edge between s and t to search for non s-t cuts. The minimum cut found " -"in all phases will be the minimum weighted cut of the graph." -msgstr "" -"Inom grafteorin är Stoer-Wagner-algoritmen en rekursiv algoritm för att lösa " -"problemet med minsta snitt i ovägda viktade grafer med icke-negativa vikter. " -"Den grundläggande idén med denna algoritm är att krympa grafen genom att slå " -"samman de mest intensiva topparna, tills grafen bara innehåller två " -"kombinerade toppuppsättningar. I varje fas hittar algoritmen det minsta s-t-" -"snittet för två toppar s och t som valts som dess vilja. Därefter krymper " -"algoritmen kanten mellan s och t för att söka efter andra snitt än s-t-" -"snitt. Det minsta snitt som hittas i alla faser kommer att vara det minsta " -"viktade snittet i grafen." +msgid "In graph theory, the Stoer–Wagner algorithm is a recursive algorithm to solve the minimum cut problem in undirected weighted graphs with non-negative weights. The essential idea of this algorithm is to shrink the graph by merging the most intensive vertices, until the graph only contains two combined vertex sets. At each phase, the algorithm finds the minimum s-t cut for two vertices s and t chosen as its will. Then the algorithm shrinks the edge between s and t to search for non s-t cuts. The minimum cut found in all phases will be the minimum weighted cut of the graph." +msgstr "Inom grafteorin är Stoer-Wagner-algoritmen en rekursiv algoritm för att lösa problemet med minsta snitt i ovägda viktade grafer med icke-negativa vikter. Den grundläggande idén med denna algoritm är att krympa grafen genom att slå samman de mest intensiva topparna, tills grafen bara innehåller två kombinerade toppuppsättningar. I varje fas hittar algoritmen det minsta s-t-snittet för två toppar s och t som valts som dess vilja. Därefter krymper algoritmen kanten mellan s och t för att söka efter andra snitt än s-t-snitt. Det minsta snitt som hittas i alla faser kommer att vara det minsta viktade snittet i grafen." -msgid "" -"A cut is a partition of the vertices of a graph into two disjoint subsets. A " -"minimum cut is a cut for which the size or weight of the cut is not larger " -"than the size of any other cut. For an unweighted graph, the minimum cut " -"would simply be the cut with the least edges. For a weighted graph, the sum " -"of all edges' weight on the cut determines whether it is a minimum cut." -msgstr "" -"Ett snitt är en uppdelning av hörnen i en graf i två disjunkta delmängder. " -"En minsta skärning är en skärning där skärningens storlek eller vikt inte är " -"större än storleken på någon annan skärning. För en oviktad graf skulle det " -"minsta snittet helt enkelt vara det snitt som har minst kanter. För en " -"viktad graf är det summan av alla kanters vikt på snittet som avgör om det " -"är ett minimisnitt." +msgid "A cut is a partition of the vertices of a graph into two disjoint subsets. A minimum cut is a cut for which the size or weight of the cut is not larger than the size of any other cut. For an unweighted graph, the minimum cut would simply be the cut with the least edges. For a weighted graph, the sum of all edges' weight on the cut determines whether it is a minimum cut." +msgstr "Ett snitt är en uppdelning av hörnen i en graf i två disjunkta delmängder. En minsta skärning är en skärning där skärningens storlek eller vikt inte är större än storleken på någon annan skärning. För en oviktad graf skulle det minsta snittet helt enkelt vara det snitt som har minst kanter. För en viktad graf är det summan av alla kanters vikt på snittet som avgör om det är ett minimisnitt." msgid "Sum of the weights of all edges between the two sets is mincut." -msgstr "" -"Summan av vikterna för alla kanter mellan de två uppsättningarna är mincut." +msgstr "Summan av vikterna för alla kanter mellan de två uppsättningarna är mincut." msgid "A **mincut** is a cut having the least weight." msgstr "Ett **mincut** är ett snitt som har minst vikt." @@ -16604,12 +12506,8 @@ msgstr "När det inte finns någon kant i grafen returneras EMPTY SET." msgid "When the graph is unconnected then EMPTY SET is return." msgstr "När grafen inte är sammankopplad returneras EMPTY SET." -msgid "" -"Sometimes a graph has multiple min-cuts, but all have the same weight. The " -"this function determines exactly one of the min-cuts as well as its weight." -msgstr "" -"Ibland har en graf flera min-cuts, men alla har samma vikt. Den här " -"funktionen bestämmer exakt en av min-cuts samt dess vikt." +msgid "Sometimes a graph has multiple min-cuts, but all have the same weight. The this function determines exactly one of the min-cuts as well as its weight." +msgstr "Ibland har en graf flera min-cuts, men alla har samma vikt. Den här funktionen bestämmer exakt en av min-cuts samt dess vikt." msgid "Running time: :math:`O(V*E + V^2*log V)`." msgstr "Drifttid: :math:`O(V*E + V^2*log V)`." @@ -16647,12 +12545,8 @@ msgstr "minutskärning av en kant" msgid "Using :doc:`pgr_connectedComponents`" msgstr "Använda :doc:`pgr_connectedComponents`" -msgid "" -"`Boost: Stoer Wagner min cut `__" -msgstr "" -"`Boost: Stoer Wagner min cut `__" +msgid "`Boost: Stoer Wagner min cut `__" +msgstr "`Boost: Stoer Wagner min cut `__" msgid "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" msgstr "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" @@ -16660,19 +12554,11 @@ msgstr "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" msgid "``pgr_strongComponents``" msgstr "``pgr_strongComponents``" -msgid "" -"``pgr_strongComponents`` — Strongly connected components of a directed graph " -"using Tarjan's algorithm based on DFS." -msgstr "" -"``pgr_strongComponents`` - Starkt förbundna komponenter i en riktad graf med " -"hjälp av Tarjans algoritm baserad på DFS." +msgid "``pgr_strongComponents`` — Strongly connected components of a directed graph using Tarjan's algorithm based on DFS." +msgstr "``pgr_strongComponents`` - Starkt förbundna komponenter i en riktad graf med hjälp av Tarjans algoritm baserad på DFS." -msgid "" -"A strongly connected component of a directed graph is a set of vertices that " -"are all reachable from each other." -msgstr "" -"En starkt sammanhängande komponent i en riktad graf är en uppsättning hörn " -"som alla är nåbara från varandra." +msgid "A strongly connected component of a directed graph is a set of vertices that are all reachable from each other." +msgstr "En starkt sammanhängande komponent i en riktad graf är en uppsättning hörn som alla är nåbara från varandra." msgid "Works for **directed** graphs." msgstr "Fungerar för **riktade** grafer." @@ -16686,48 +12572,25 @@ msgstr "pgr_strongComponents(`Kanter SQL`_)" msgid "The strong components of the graph" msgstr "De starka komponenterna i grafen" -msgid "" -"`Boost: Strong components `__" -msgstr "" -"`Boost: Starka komponenter `__" +msgid "`Boost: Strong components `__" +msgstr "`Boost: Starka komponenter `__" -msgid "" -"wikipedia: `Strongly connected component `__" -msgstr "" -"wikipedia: `Starkt ansluten komponent `__" +msgid "wikipedia: `Strongly connected component `__" +msgstr "wikipedia: `Starkt ansluten komponent `__" msgid "``pgr_topologicalSort`` - Experimental" msgstr "``pgr_topologicalSort`` - Experimentell" -msgid "" -"``pgr_topologicalSort`` — Linear ordering of the vertices for directed " -"acyclic graphs (DAG)." -msgstr "" -"``pgr_topologicalSort`` - Linjär ordning av topparna för riktade acykliska " -"grafer (DAG)." +msgid "``pgr_topologicalSort`` — Linear ordering of the vertices for directed acyclic graphs (DAG)." +msgstr "``pgr_topologicalSort`` - Linjär ordning av topparna för riktade acykliska grafer (DAG)." -msgid "" -"The topological sort algorithm creates a linear ordering of the vertices " -"such that if edge :math:`(u,v)` appears in the graph, then :math:`v` comes " -"before :math:`u` in the ordering." -msgstr "" -"Den topologiska sorteringsalgoritmen skapar en linjär ordning av hörnen så " -"att om kanten :math:`(u,v)` förekommer i grafen, så kommer :math:`v` före :" -"math:`u` i ordningen." +msgid "The topological sort algorithm creates a linear ordering of the vertices such that if edge :math:`(u,v)` appears in the graph, then :math:`v` comes before :math:`u` in the ordering." +msgstr "Den topologiska sorteringsalgoritmen skapar en linjär ordning av hörnen så att om kanten :math:`(u,v)` förekommer i grafen, så kommer :math:`v` före :math:`u` i ordningen." -msgid "" -"Process is valid for directed acyclic graphs only. otherwise it will throw " -"warnings." -msgstr "" -"Processen är endast giltig för riktade acykliska grafer. annars kommer den " -"att ge varningar." +msgid "Process is valid for directed acyclic graphs only. otherwise it will throw warnings." +msgstr "Processen är endast giltig för riktade acykliska grafer. annars kommer den att ge varningar." -msgid "" -"For optimization purposes, if there are more than one answer, the function" +msgid "For optimization purposes, if there are more than one answer, the function" msgstr "För optimeringsändamål, om det finns mer än ett svar, kan funktionen" msgid "will return one of them." @@ -16757,25 +12620,17 @@ msgstr "Topologisk sortering av enkelriktade segment" msgid "Graph is not a DAG" msgstr "Grafen är inte en DAG" -msgid "" -"`Boost: topological sort `__" -msgstr "" -"`Boost: topologisk sortering `__" +msgid "`Boost: topological sort `__" +msgstr "`Boost: topologisk sortering `__" msgid "``pgr_transitiveClosure`` - Experimental" msgstr "``pgr_transitiveClosure`` - Experimentell" -msgid "" -"``pgr_transitiveClosure`` — Transitive closure graph of a directed graph." -msgstr "" -"``pgr_transitiveClosure`` - Transitiv stängningsgraf för en riktad graf." +msgid "``pgr_transitiveClosure`` — Transitive closure graph of a directed graph." +msgstr "``pgr_transitiveClosure`` - Transitiv stängningsgraf för en riktad graf." -msgid "" -"Transforms the input directed graph into the transitive closure of the graph." -msgstr "" -"Transformerar den inmatade riktade grafen till grafens transitiva slutenhet." +msgid "Transforms the input directed graph into the transitive closure of the graph." +msgstr "Transformerar den inmatade riktade grafen till grafens transitiva slutenhet." msgid "Process is valid for directed graphs." msgstr "Processen är giltig för riktade grafer." @@ -16783,12 +12638,8 @@ msgstr "Processen är giltig för riktade grafer." msgid "The transitive closure of an undirected graph produces a cluster graph" msgstr "Den transitiva stängningen av en odelad graf ger en klustergraf" -msgid "" -"Reachability between vertices on an undirected graph happens when they " -"belong to the same connected component. (see :doc:`pgr_connectedComponents`)" -msgstr "" -"Nåbarhet mellan hörn i en odelad graf uppstår när de tillhör samma " -"sammankopplade komponent. (se :doc:`pgr_connectedComponents`)" +msgid "Reachability between vertices on an undirected graph happens when they belong to the same connected component. (see :doc:`pgr_connectedComponents`)" +msgstr "Nåbarhet mellan hörn i en odelad graf uppstår när de tillhör samma sammankopplade komponent. (se :doc:`pgr_connectedComponents`)" msgid "The returned values are not ordered" msgstr "De returnerade värdena är inte ordnade" @@ -16823,12 +12674,8 @@ msgstr "Identifierare av målen för kanterna" msgid "Identifiers of the vertices that are reachable from vertex v." msgstr "Identifierare för de toppar som är nåbara från topp v." -msgid "" -"`Boost: transitive closure `__" -msgstr "" -"`Boost: transitiv stängning `__" +msgid "`Boost: transitive closure `__" +msgstr "`Boost: transitiv stängning `__" msgid "https://en.wikipedia.org/wiki/Transitive_closure" msgstr "https://en.wikipedia.org/wiki/Transitive_closure" @@ -16869,20 +12716,11 @@ msgstr "pgr_trspViaVertices" msgid "pgr_trspViaEdges" msgstr "pgr_trspViaEdges" -msgid "" -"Turn restricted shortest path (TRSP) is an algorithm that receives turn " -"restrictions in form of a query like those found in real world navigable " -"road networks." -msgstr "" -"Turn restricted shortest path (TRSP) är en algoritm som tar emot " -"svängrestriktioner i form av en fråga, liknande de som finns i verkliga " -"vägnät." +msgid "Turn restricted shortest path (TRSP) is an algorithm that receives turn restrictions in form of a query like those found in real world navigable road networks." +msgstr "Turn restricted shortest path (TRSP) är en algoritm som tar emot svängrestriktioner i form av en fråga, liknande de som finns i verkliga vägnät." -msgid "" -"It does no guarantee the shortest path as it might contain restriction paths." -msgstr "" -"Den garanterar inte den kortaste vägen eftersom den kan innehålla " -"begränsande vägar." +msgid "It does no guarantee the shortest path as it might contain restriction paths." +msgstr "Den garanterar inte den kortaste vägen eftersom den kan innehålla begränsande vägar." msgid "The general algorithm is as follows:" msgstr "Den allmänna algoritmen är som följer:" @@ -16896,76 +12734,47 @@ msgstr "Om lösningen passerar genom en begränsning då." msgid "Execute the **TRSP** algorithm with restrictions." msgstr "Utför **TRSP**-algoritmen med begränsningar." -msgid "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, " -"[``directed``])" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **slut vid**, [``directed``])" -msgid "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vids**, " -"[``directed``])" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **slut vids**, [``directed``])" -msgid "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vid**, " -"[``directed``])" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **slut vid**, [``directed``])" -msgid "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, " -"[``directed``])" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **slut vids**, [``directed``])" -msgid "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, " -"[``directed``])" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, [``directed``])" msgstr "pgr_trsp(`Edges SQL`_, `Restriktioner SQL`_, `Kombinationer SQL`_, [``directed``])" msgid "From vertex :math:`6` to vertex :math:`10` on an undirected graph." msgstr "Från toppunkt :math:`6` till toppunkt :math:`10` i en odelad graf." -msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 1\\}` on an undirected graph." -msgstr "" -"Från toppunkten :math:`6` till toppunkterna :math:`\\{10, 1\\}` i en odelad " -"graf." +msgid "From vertex :math:`6` to vertices :math:`\\{10, 1\\}` on an undirected graph." +msgstr "Från toppunkten :math:`6` till toppunkterna :math:`\\{10, 1\\}` i en odelad graf." -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertex :math:`8` on a directed graph." -msgstr "" -"Från topparna :math:`\\{6, 1\\}` till topparna :math:`8` i en riktad graf." +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`8` on a directed graph." +msgstr "Från topparna :math:`\\{6, 1\\}` till topparna :math:`8` i en riktad graf." -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 8\\}` on an " -"undirected graph." -msgstr "" -"Från hörn :math:`\\{6, 1\\}` till hörn :math:`\\{10, 8\\}` i en odelad graf." +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 8\\}` on an undirected graph." +msgstr "Från hörn :math:`\\{6, 1\\}` till hörn :math:`\\{10, 8\\}` i en odelad graf." msgid "Using a combinations table on an undirected graph." msgstr "Använda en kombinationstabell på en ostyrd graf." -msgid "" -"`Deprecated documentation `_" -msgstr "" -"föråldrad dokumentation `_" +msgid "`Deprecated documentation `_" +msgstr "föråldrad dokumentation `_" msgid "``pgr_trspVia``" msgstr "``pgr_trspVia``" -msgid "" -"``pgr_trspVia`` Route that goes through a list of vertices with restrictions." -msgstr "" -"``pgr_trspVia`` Rutt som går igenom en lista med toppar med restriktioner." +msgid "``pgr_trspVia`` Route that goes through a list of vertices with restrictions." +msgstr "``pgr_trspVia`` Rutt som går igenom en lista med toppar med restriktioner." -msgid "" -"Given a list of vertices and a graph, this function is equivalent to finding " -"the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :" -"math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." -msgstr "" -"Givet en lista med toppar och en graf är denna funktion likvärdig med att " -"hitta den kortaste vägen mellan :math:`vertex_i` och :math:`vertex_{i+1}` " -"för alla :math:`i < size\\_of(via\\;toppar)` och försöker att inte använda " -"begränsade vägar." +msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." +msgstr "Givet en lista med toppar och en graf är denna funktion likvärdig med att hitta den kortaste vägen mellan :math:`vertex_i` och :math:`vertex_{i+1}` för alla :math:`i < size\\_of(via\\;toppar)` och försöker att inte använda begränsade vägar." msgid "The paths represents the sections of the route." msgstr "Banorna representerar de olika delarna av rutten." @@ -16973,11 +12782,8 @@ msgstr "Banorna representerar de olika delarna av rutten." msgid "Execute a :doc:`pgr_dijkstraVia`." msgstr "Exekvera en :doc:`pgr_dijkstraVia`." -msgid "" -"For the set of sub paths of the solution that pass through a restriction then" -msgstr "" -"För uppsättningen delvägar för lösningen som passerar genom en begränsning " -"gäller följande" +msgid "For the set of sub paths of the solution that pass through a restriction then" +msgstr "För uppsättningen delvägar för lösningen som passerar genom en begränsning gäller följande" msgid "Execute the **TRSP** algorithm with restrictions for the paths." msgstr "Utför **TRSP**-algoritmen med begränsningar för banorna." @@ -16985,17 +12791,11 @@ msgstr "Utför **TRSP**-algoritmen med begränsningar för banorna." msgid "**NOTE** when this is done, ``U_turn_on_edge`` flag is ignored." msgstr "**OBSERVERA** när detta görs ignoreras flaggan ``U_turn_on_edge``." -msgid "" -"pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, " -"[**options**])" +msgid "pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, [**options**])" msgstr "pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, [**options**])" -msgid "" -"All this examples are about the route that visits the vertices :math:`\\{5, " -"7, 1, 8, 15\\}` in that order on a directed graph." -msgstr "" -"Alla dessa exempel handlar om den rutt som besöker topparna :math:`\\{5, 7, " -"1, 8, 15\\}` i den ordningen i en riktad graf." +msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a directed graph." +msgstr "Alla dessa exempel handlar om den rutt som besöker topparna :math:`\\{5, 7, 1, 8, 15\\}` i den ordningen i en riktad graf." msgid "Simulation of how algorithm works." msgstr "Simulering av hur algoritmen fungerar." @@ -17003,24 +12803,14 @@ msgstr "Simulering av hur algoritmen fungerar." msgid "The algorithm performs a :doc:`pgr_dijkstraVia`" msgstr "Algoritmen utför en :doc:`pgr_dijkstraVia`" -msgid "" -"Detects which of the sub paths pass through a restriction in this case is " -"for the ``path_id = 5`` from ``6`` to ``3`` because the path :math:`15 " -"\\rightarrow 1` is restricted." -msgstr "" -"Detekterar vilka av undervägarna som passerar genom en begränsning i det här " -"fallet är för ``väg_id = 5`` från ``6`` till ``3`` eftersom vägen :math:`15 " -"\\rightarrow 1` är begränsad." +msgid "Detects which of the sub paths pass through a restriction in this case is for the ``path_id = 5`` from ``6`` to ``3`` because the path :math:`15 \\rightarrow 1` is restricted." +msgstr "Detekterar vilka av undervägarna som passerar genom en begränsning i det här fallet är för ``väg_id = 5`` från ``6`` till ``3`` eftersom vägen :math:`15 \\rightarrow 1` är begränsad." msgid "Executes the :doc:`pgr_trsp` algorithm for the conflicting paths." msgstr "Exekverar :doc:`pgr_trsp` -algoritmen för de motstridiga vägarna." -msgid "" -"From the :doc:`pgr_dijkstraVia` result it removes the conflicting paths and " -"builds the solution with the results of the :doc:`pgr_trsp` algorithm:" -msgstr "" -"Från :doc:`pgr_dijkstraVia`-resultatet tar den bort de motstridiga vägarna " -"och bygger lösningen med resultaten från :doc:`pgr_trsp`-algoritmen:" +msgid "From the :doc:`pgr_dijkstraVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" +msgstr "Från :doc:`pgr_dijkstraVia`-resultatet tar den bort de motstridiga vägarna och bygger lösningen med resultaten från :doc:`pgr_trsp`-algoritmen:" msgid "Getting the same result as ``pgr_trspVia``:" msgstr "Får samma resultat som ``pgr_trspVia``:" @@ -17029,31 +12819,16 @@ msgid "Example 8" msgstr "Exempel 8" msgid "Sometimes ``U_turn_on_edge`` flag is ignored when is set to ``false``." -msgstr "" -"Ibland ignoreras flaggan ``U_turn_on_edge`` när den är satt till ``false``." +msgstr "Ibland ignoreras flaggan ``U_turn_on_edge`` när den är satt till ``false``." -msgid "" -"The first step, doing a :doc:`pgr_dijkstraVia` does consider not making a U " -"turn on the same edge. But the path :math:`16 \\rightarrow 13` (Rows 4 and " -"5) is restricted and the result is using it." -msgstr "" -"Det första steget, att göra en :doc:`pgr_dijkstraVia` tar hänsyn till att " -"inte göra en U-sväng på samma kant. Men sökvägen :math:`16 \\rightarrow 13` " -"(rad 4 och 5) är begränsad och resultatet använder den." +msgid "The first step, doing a :doc:`pgr_dijkstraVia` does consider not making a U turn on the same edge. But the path :math:`16 \\rightarrow 13` (Rows 4 and 5) is restricted and the result is using it." +msgstr "Det första steget, att göra en :doc:`pgr_dijkstraVia` tar hänsyn till att inte göra en U-sväng på samma kant. Men sökvägen :math:`16 \\rightarrow 13` (rad 4 och 5) är begränsad och resultatet använder den." -msgid "" -"When executing the :doc:`pgr_trsp` algorithm for the conflicting path, there " -"is no ``U_turn_on_edge`` flag." -msgstr "" -"När :doc:`pgr_trsp`-algoritmen körs för den konfliktfyllda banan finns det " -"ingen flagga för ``U_turn_on_edge``." +msgid "When executing the :doc:`pgr_trsp` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." +msgstr "När :doc:`pgr_trsp`-algoritmen körs för den konfliktfyllda banan finns det ingen flagga för ``U_turn_on_edge``." -msgid "" -"Therefore the result ignores the ``U_turn_on_edge`` flag when set to " -"``false``." -msgstr "" -"Därför ignorerar resultatet flaggan ``U_turn_on_edge`` när den är inställd " -"på ``false``." +msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``." +msgstr "Därför ignorerar resultatet flaggan ``U_turn_on_edge`` när den är inställd på ``false``." msgid ":doc:`via-category`" msgstr ":doc:`via-category`" @@ -17061,26 +12836,11 @@ msgstr ":doc:`via-category`" msgid "``pgr_trspVia_withPoints``" msgstr "``pgr_trspVia_withPoints``" -msgid "" -"``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/" -"or points with restrictions." -msgstr "" -"``pgr_trspVia_withPoints`` - Rutt som går igenom en lista med toppar och/" -"eller punkter med restriktioner." +msgid "``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/or points with restrictions." +msgstr "``pgr_trspVia_withPoints`` - Rutt som går igenom en lista med toppar och/eller punkter med restriktioner." -msgid "" -"Given a graph, a set of restriction on the graph edges, a set of points on " -"the graphs edges and a list of vertices, this function is equivalent to " -"finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` " -"(where :math:`vertex` can be a vertex or a point on the graph) for all :math:" -"`i < size\\_of(via\\;vertices)` trying not to use restricted paths." -msgstr "" -"Med tanke på en graf, en uppsättning begränsningar på grafens kanter, en " -"uppsättning punkter på grafens kanter och en lista med vertexer, är denna " -"funktion likvärdig med att hitta den kortaste vägen mellan :math:`vertex_i` " -"och :math:`vertex_{i+1}` (där :math:`vertex` kan vara en vertex eller en " -"punkt i grafen) för alla :math:`i < size\\_of(via\\;vertices)` och försöker " -"att inte använda begränsade vägar." +msgid "Given a graph, a set of restriction on the graph edges, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." +msgstr "Med tanke på en graf, en uppsättning begränsningar på grafens kanter, en uppsättning punkter på grafens kanter och en lista med vertexer, är denna funktion likvärdig med att hitta den kortaste vägen mellan :math:`vertex_i` och :math:`vertex_{i+1}` (där :math:`vertex` kan vara en vertex eller en punkt i grafen) för alla :math:`i < size\\_of(via\\;vertices)` och försöker att inte använda begränsade vägar." msgid "is a sequence of paths" msgstr "är en sekvens av banor" @@ -17097,11 +12857,8 @@ msgstr "Topparnas identifierare kommer att förbli positiva." msgid "Execute a :doc:`pgr_withPointsVia`." msgstr "Exekvera en :doc:`pgr_withPointsVia`." -msgid "" -"For the set of paths of the solution that pass through a restriction then" -msgstr "" -"För uppsättningen av vägar för lösningen som passerar genom en restriktion " -"gäller följande" +msgid "For the set of paths of the solution that pass through a restriction then" +msgstr "För uppsättningen av vägar för lösningen som passerar genom en restriktion gäller följande" msgid "Execute the **TRSP** algorithm with restrictions for the path." msgstr "Utför **TRSP**-algoritmen med begränsningar för banan." @@ -17109,20 +12866,14 @@ msgstr "Utför **TRSP**-algoritmen med begränsningar för banan." msgid "Do not use negative values on identifiers of the inner queries." msgstr "Använd inte negativa värden på identifierare för de inre frågorna." -msgid "" -"pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**via vertices**, [**driving side**,] [**options**])" +msgid "pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, [**driving side**,] [**options**])" msgstr "pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, [**driving side**,] [**options**])" msgid "**options:** ``[directed, strict, U_turn_on_edge, details]``" msgstr "**options:** ``[directed, strict, U_turn_on_edge, details]``" -msgid "" -"Find the route that visits the vertices :math:`\\{-6, 15, -5\\}` in that " -"order on an directed graph." -msgstr "" -"Hitta den rutt som besöker topparna :math:`\\{-6, 15, -5\\\\}` i den " -"ordningen i en riktad graf." +msgid "Find the route that visits the vertices :math:`\\{-6, 15, -5\\}` in that order on an directed graph." +msgstr "Hitta den rutt som besöker topparna :math:`\\{-6, 15, -5\\\\}` i den ordningen i en riktad graf." msgid "When positive it is considered a vertex identifier" msgstr "När den är positiv betraktas den som en vertexidentifierare" @@ -17133,12 +12884,8 @@ msgstr "När den är negativ betraktas den som en punktidentifierare" msgid "[**driving side**]" msgstr "[**driving side**]" -msgid "" -"Value in [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] indicating if the " -"driving side is:" -msgstr "" -"Värde i [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] som anger om förarsidan " -"är:" +msgid "Value in [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] indicating if the driving side is:" +msgstr "Värde i [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] som anger om förarsidan är:" msgid "For directed graph:" msgstr "För riktad graf:" @@ -17174,22 +12921,13 @@ msgid "For showing points stops." msgstr "För att visa punkter stoppar." msgid "When ``true`` the results will include the points that are in the path." -msgstr "" -"När ``true`` visas kommer resultaten att inkludera de punkter som ligger i " -"banan." +msgstr "När ``true`` visas kommer resultaten att inkludera de punkter som ligger i banan." -msgid "" -"When ``false`` the results will not include the points that are in the path." -msgstr "" -"När ``false`` visas kommer resultaten inte att omfatta de punkter som ligger " -"i banan." +msgid "When ``false`` the results will not include the points that are in the path." +msgstr "När ``false`` visas kommer resultaten inte att omfatta de punkter som ligger i banan." -msgid "" -"When ``start_vid``, ``end_vid`` and ``node`` columns have negative values, " -"the identifier is for a Point." -msgstr "" -"När kolumnerna ``start_vid``, ``end_vid`` och ``node`` har negativa värden " -"är identifieraren för en Point." +msgid "When ``start_vid``, ``end_vid`` and ``node`` columns have negative values, the identifier is for a Point." +msgstr "När kolumnerna ``start_vid``, ``end_vid`` och ``node`` har negativa värden är identifieraren för en Point." msgid "Use ``pgr_findCloseEdges`` for points on the fly" msgstr "Använd ``pgr_findCloseEdges`` för punkter i farten" @@ -17197,97 +12935,50 @@ msgstr "Använd ``pgr_findCloseEdges`` för punkter i farten" msgid "Using :doc:`pgr_findCloseEdges`:" msgstr "Använder :doc:`pgr_findCloseEdges`:" -msgid "" -"Visit from vertex :math:`1` to the two locations on the graph of point " -"`(2.9, 1.8)` in order of closeness to the graph." -msgstr "" -"Besök från toppunkten :math:`1` till de två platserna på grafen för punkten " -"`(2,9, 1,8)` i ordning efter närhet till grafen." +msgid "Visit from vertex :math:`1` to the two locations on the graph of point `(2.9, 1.8)` in order of closeness to the graph." +msgstr "Besök från toppunkten :math:`1` till de två platserna på grafen för punkten `(2,9, 1,8)` i ordning efter närhet till grafen." -msgid "" -"Point :math:`-1` corresponds to the closest edge from point `(2.9, 1.8)`." -msgstr "" -"Punkten :math:`-1` motsvarar den närmaste kanten från punkten `(2,9, 1,8)`." +msgid "Point :math:`-1` corresponds to the closest edge from point `(2.9, 1.8)`." +msgstr "Punkten :math:`-1` motsvarar den närmaste kanten från punkten `(2,9, 1,8)`." -msgid "" -"Point :math:`-2` corresponds to the next close edge from point `(2.9, 1.8)`." -msgstr "" -"Punkten :math:`-2` motsvarar nästa nära kant från punkten `(2,9, 1,8)`." +msgid "Point :math:`-2` corresponds to the next close edge from point `(2.9, 1.8)`." +msgstr "Punkten :math:`-2` motsvarar nästa nära kant från punkten `(2,9, 1,8)`." -msgid "" -"Point :math:`-2` is visited on the route to from vertex :math:`1` to Point :" -"math:`-1` (See row where :math:`seq = 4`)." -msgstr "" -"Punkt :math:`-2` besöks på rutten till från toppunkt :math:`1` till punkt :" -"math:`-1` (Se rad där :math:`seq = 4`)." +msgid "Point :math:`-2` is visited on the route to from vertex :math:`1` to Point :math:`-1` (See row where :math:`seq = 4`)." +msgstr "Punkt :math:`-2` besöks på rutten till från toppunkt :math:`1` till punkt :math:`-1` (Se rad där :math:`seq = 4`)." msgid "Usage variations" msgstr "Variationer i användning" -msgid "" -"All this examples are about the route that visits the vertices :math:`\\{-6, " -"7, -4, 8, -2\\}` in that order on a directed graph." -msgstr "" -"Alla dessa exempel handlar om den rutt som besöker topparna :math:`\\{-6, 7, " -"-4, 8, -2\\\\}` i den ordningen i en riktad graf." +msgid "All this examples are about the route that visits the vertices :math:`\\{-6, 7, -4, 8, -2\\}` in that order on a directed graph." +msgstr "Alla dessa exempel handlar om den rutt som besöker topparna :math:`\\{-6, 7, -4, 8, -2\\\\}` i den ordningen i en riktad graf." msgid "Status of \"passes in front\" or \"visits\" of the nodes and points." -msgstr "" -"Status för \"passeringar framför\" eller \"besök\" av noder och punkter." +msgstr "Status för \"passeringar framför\" eller \"besök\" av noder och punkter." msgid "The algorithm performs a :doc:`pgr_withPointsVia`" msgstr "Algoritmen utför en :doc:`pgr_withPointsVia`" -msgid "" -"Detects which of the paths pass through a restriction in this case is for " -"the ``path_id = 1`` from ``-6`` to ``15`` because the path :math:`9 " -"\\rightarrow 16` is restricted." -msgstr "" -"Detekterar vilka av sökvägarna som passerar genom en begränsning i detta " -"fall är för ``path_id = 1`` från ``-6`` till ``15`` eftersom sökvägen :math:" -"`9 \\rightarrow 16` är begränsad." +msgid "Detects which of the paths pass through a restriction in this case is for the ``path_id = 1`` from ``-6`` to ``15`` because the path :math:`9 \\rightarrow 16` is restricted." +msgstr "Detekterar vilka av sökvägarna som passerar genom en begränsning i detta fall är för ``path_id = 1`` från ``-6`` till ``15`` eftersom sökvägen :math:`9 \\rightarrow 16` är begränsad." -msgid "" -"Executes the :ref:`TRSP-family:TRSP algorithm` for the conflicting paths." -msgstr "" -"Exekverar :ref:`TRSP-family:TRSP algorithm` för de motstridiga sökvägarna." +msgid "Executes the :ref:`TRSP-family:TRSP algorithm` for the conflicting paths." +msgstr "Exekverar :ref:`TRSP-family:TRSP algorithm` för de motstridiga sökvägarna." -msgid "" -"From the :doc:`pgr_withPointsVia` result it removes the conflicting paths " -"and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" -msgstr "" -"Från resultatet av :doc:`pgr_withPointsVia` tar den bort de motstridiga " -"vägarna och bygger lösningen med resultaten av algoritmen :doc:`pgr_trsp`:" +msgid "From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" +msgstr "Från resultatet av :doc:`pgr_withPointsVia` tar den bort de motstridiga vägarna och bygger lösningen med resultaten av algoritmen :doc:`pgr_trsp`:" msgid "Getting the same result as ``pgr_trspVia_withPoints``:" msgstr "Får samma resultat som ``pgr_trspVia_withPoints``:" -msgid "" -"The first step, doing a :doc:`pgr_withPointsVia` does consider not making a " -"U turn on the same edge. But the path :math:`9 \\rightarrow 16` (Rows 4 and " -"5) is restricted and the result is using it." -msgstr "" -"Det första steget, att göra en :doc:`pgr_withPointsVia` tar hänsyn till att " -"inte göra en U-sväng på samma kant. Men banan :math:`9 \\rightarrow 16` (rad " -"4 och 5) är begränsad och resultatet är att använda den." +msgid "The first step, doing a :doc:`pgr_withPointsVia` does consider not making a U turn on the same edge. But the path :math:`9 \\rightarrow 16` (Rows 4 and 5) is restricted and the result is using it." +msgstr "Det första steget, att göra en :doc:`pgr_withPointsVia` tar hänsyn till att inte göra en U-sväng på samma kant. Men banan :math:`9 \\rightarrow 16` (rad 4 och 5) är begränsad och resultatet är att använda den." -msgid "" -"When executing the :doc:`pgr_trsp_withPoints` algorithm for the conflicting " -"path, there is no ``U_turn_on_edge`` flag." -msgstr "" -"När algoritmen :doc:`pgr_trsp_withPoints` exekveras för den konfliktfyllda " -"banan finns det ingen flagga ``U_turn_on_edge``." +msgid "When executing the :doc:`pgr_trsp_withPoints` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." +msgstr "När algoritmen :doc:`pgr_trsp_withPoints` exekveras för den konfliktfyllda banan finns det ingen flagga ``U_turn_on_edge``." -msgid "" -"Therefore the result ignores the ``U_turn_on_edge`` flag when set to " -"``false``. From the :doc:`pgr_withPointsVia` result it removes the " -"conflicting paths and builds the solution with the results of the :doc:" -"`pgr_trsp` algorithm. In this case a U turn is been done using the same edge." -msgstr "" -"Därför ignorerar resultatet flaggan ``U_turn_on_edge`` när den är inställd " -"på ``false``. Från :doc:`pgr_withPointsVia`-resultatet tar den bort de " -"motstridiga vägarna och bygger lösningen med resultaten från :doc:`pgr_trsp`-" -"algoritmen. I det här fallet har en U-sväng gjorts med samma kant." +msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``. From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm. In this case a U turn is been done using the same edge." +msgstr "Därför ignorerar resultatet flaggan ``U_turn_on_edge`` när den är inställd på ``false``. Från :doc:`pgr_withPointsVia`-resultatet tar den bort de motstridiga vägarna och bygger lösningen med resultaten från :doc:`pgr_trsp`-algoritmen. I det här fallet har en U-sväng gjorts med samma kant." msgid "``pgr_trsp_withPoints``" msgstr "``pgr_trsp_withPoints``" @@ -17295,14 +12986,8 @@ msgstr "``pgr_trsp_withPoints``" msgid "``pgr_trsp_withPoints`` Routing Vertex/Point with restrictions." msgstr "``pgr_trsp_withPoints`` Routing Vertex/Point med restriktioner." -msgid "" -"Modify the graph to include points defined by `Points SQL`_. Consider the " -"invalid paths on `Restrictions SQL`_. Using Dijkstra algorithm, find the " -"shortest path." -msgstr "" -"Modifiera grafen så att den innehåller punkter definierade av `Points SQL`_. " -"Beakta de ogiltiga vägarna i `Restrictions SQL`_. Använd Dijkstra-algoritmen " -"för att hitta den kortaste vägen." +msgid "Modify the graph to include points defined by `Points SQL`_. Consider the invalid paths on `Restrictions SQL`_. Using Dijkstra algorithm, find the shortest path." +msgstr "Modifiera grafen så att den innehåller punkter definierade av `Points SQL`_. Beakta de ogiltiga vägarna i `Restrictions SQL`_. Använd Dijkstra-algoritmen för att hitta den kortaste vägen." msgid "Vertices of the graph are:" msgstr "Grafens hörn är:" @@ -17319,100 +13004,56 @@ msgstr "`Agg_cost` i de icke inkluderade värdena \"v, v\" är \"0\"" msgid "The `agg_cost` in the non included values `(u, v)` is :math:`\\infty`" msgstr "Agg_cost i de icke inkluderade värdena `(u, v)` är :math:`\\infty`" -msgid "" -"For optimization purposes, any duplicated value in the input arrays of " -"**start vids** or **end vids** or are ignored." -msgstr "" -"För optimeringsändamål ignoreras alla duplicerade värden i " -"inmatningsmatriserna för **start vids** eller **end vids** eller." +msgid "For optimization purposes, any duplicated value in the input arrays of **start vids** or **end vids** or are ignored." +msgstr "För optimeringsändamål ignoreras alla duplicerade värden i inmatningsmatriserna för **start vids** eller **end vids** eller." msgid "Running time: :math:`O(|start\\_vids|\\times(V \\log V + E))`" msgstr "Drifttid: :math:`O(|start\\_vids|\\times(V \\log V + E))`" -msgid "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**start vid**, **end vid**, [**driving side**,] [**options**])" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**,] [**options**])" msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **slut vid**, [**driving side**,] [**options**])" -msgid "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**start vid**, **end vids**, [**driving side**,] [**options**])" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**,] [**options**])" msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **slut vids**, [**driving side**,] [**options**])" -msgid "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**start vids**, **end vid**, [**driving side**,] [**options**])" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**,] [**options**])" msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **slut vid**, [**driving side**,] [**options**])" -msgid "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**start vids**, **end vids**, [**driving side**,] [**options**])" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**,] [**options**])" msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **slut vids**, [**driving side**,] [**options**])" -msgid "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"`Combinations SQL`_, [**driving side**,] [**options**])" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**,] [**options**])" msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**,] [**options**])" msgid "**options:** ``[directed, details]``" msgstr "**options:** ``[directed, details]``" -msgid "" -"From point :math:`1` to vertex :math:`10` with right driving side in " -"directed graph. (with details)" -msgstr "" -"Från punkt :math:`1` till toppunkt :math:`10` med höger drivsida i riktad " -"graf. (med detaljer)" +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (with details)" +msgstr "Från punkt :math:`1` till toppunkt :math:`10` med höger drivsida i riktad graf. (med detaljer)" -msgid "" -"From point :math:`1` to point :math:`3` and vertex :math:`7` on an " -"undirected graph" -msgstr "" -"Från punkt :math:`1` till punkt :math:`3` och toppunkt :math:`7` på en " -"odelad graf" +msgid "From point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" +msgstr "Från punkt :math:`1` till punkt :math:`3` och toppunkt :math:`7` på en odelad graf" -msgid "" -"From point :math:`1` and vertex :math:`6` to point :math:`3` with right " -"driving side in directed graph. (without details)" -msgstr "" -"Från punkt :math:`1` och toppunkt :math:`6` till punkt :math:`3` med höger " -"drivsida i riktad graf. (utan detaljer)" +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph. (without details)" +msgstr "Från punkt :math:`1` och toppunkt :math:`6` till punkt :math:`3` med höger drivsida i riktad graf. (utan detaljer)" -msgid "" -"From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :" -"math:`1` with left side driving." -msgstr "" -"Från punkt :math:`1` och toppunkt :math:`6` till punkt :math:`3` och " -"toppunkt :math:`1` med körning på vänster sida." +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` with left side driving." +msgstr "Från punkt :math:`1` och toppunkt :math:`6` till punkt :math:`3` och toppunkt :math:`1` med körning på vänster sida." msgid "Two combinations" msgstr "Två kombinationer" -msgid "" -"From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to " -"point :math:`3` with right side driving. (with details)" -msgstr "" -"Från punkt :math:`1` till toppunkt :math:`10`, och från toppunkt :math:`6` " -"till punkt :math:`3` med högerkörning. (med detaljer)" +msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving. (with details)" +msgstr "Från punkt :math:`1` till toppunkt :math:`10`, och från toppunkt :math:`6` till punkt :math:`3` med högerkörning. (med detaljer)" msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_." msgstr "Använd :doc:`pgr_findCloseEdges` i `Points SQL`_." -msgid "" -"Find the routes from vertex :math:`1` to the two closest locations on the " -"graph of point `(2.9, 1.8)`." -msgstr "" -"Hitta vägarna från toppunkten :math:`1` till de två närmaste platserna på " -"grafen för punkten `(2,9, 1,8)`." +msgid "Find the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." +msgstr "Hitta vägarna från toppunkten :math:`1` till de två närmaste platserna på grafen för punkten `(2,9, 1,8)`." -msgid "" -"All the examples are about traveling from point :math:`1` and vertex :math:" -"`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}` with " -"restrictions" -msgstr "" -"Alla exempel handlar om att resa från punkt :math:`1` och toppunkt :math:`5` " -"till punkter :math:`\\{2, 3, 6\\}` och toppunkter :math:`\\{10, 11\\}` med " -"restriktioner" +msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}` with restrictions" +msgstr "Alla exempel handlar om att resa från punkt :math:`1` och toppunkt :math:`5` till punkter :math:`\\{2, 3, 6\\}` och toppunkter :math:`\\{10, 11\\}` med restriktioner" msgid "Passes in front or visits with right side driving." msgstr "Passerar framför eller besöker med högerkörning." @@ -17426,23 +13067,13 @@ msgstr "Passerar framför eller besöker med vänsterkörning." msgid "``pgr_turnRestrictedPath`` - Experimental" msgstr "``pgr_turnRestrictedPath`` - Experimentell" -msgid "" -"``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex - Vertex routing " -"with restrictions" -msgstr "" -"``pgr_turnRestrictedPath`` Använd Yen's algoritm Vertex - Vertex routing med " -"restriktioner" +msgid "``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex - Vertex routing with restrictions" +msgstr "``pgr_turnRestrictedPath`` Använd Yen's algoritm Vertex - Vertex routing med restriktioner" -msgid "" -"Using Yen's algorithm to obtain K shortest paths and analyze the paths to " -"select the paths that do not use the restrictions" -msgstr "" -"Använd Yen's algoritm för att få K kortaste vägar och analysera vägarna för " -"att välja de vägar som inte använder begränsningarna" +msgid "Using Yen's algorithm to obtain K shortest paths and analyze the paths to select the paths that do not use the restrictions" +msgstr "Använd Yen's algoritm för att få K kortaste vägar och analysera vägarna för att välja de vägar som inte använder begränsningarna" -msgid "" -"pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, " -"**end vid**, **K**, [**options**])" +msgid "pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, **K**, [**options**])" msgstr "pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **slut vid**, **K**, [**options**])" msgid "**options:** ``[directed, heap_paths, stop_on_first, strict]``" @@ -17457,17 +13088,14 @@ msgstr "Särskilda valfria parametrar" msgid "``stop_on_first``" msgstr "``stopp_på_första``" -msgid "" -"When ``true`` stops on first path found that dos not violate restrictions" -msgstr "" -"När ``true`` stannar på första bästa väg som inte bryter mot restriktioner" +msgid "When ``true`` stops on first path found that dos not violate restrictions" +msgstr "När ``true`` stannar på första bästa väg som inte bryter mot restriktioner" msgid "When ``false`` returns at most K paths" msgstr "När ``false`` returnerar högst K sökvägar" msgid "When ``true`` returns only paths that do not violate restrictions" -msgstr "" -"När ``true`` returnerar endast sökvägar som inte bryter mot begränsningar" +msgstr "När ``true`` returnerar endast sökvägar som inte bryter mot begränsningar" msgid "When ``false`` returns the paths found" msgstr "När ``false`` returneras de hittade sökvägarna" @@ -17476,8 +13104,7 @@ msgid "From vertex :math:`3` to :math:`8` with ``strict`` flag on." msgstr "Från toppunkt :math:`3` till :math:`8` med flaggan ``strict`` på." msgid "No results because the only path available follows a restriction." -msgstr "" -"Inga resultat eftersom den enda tillgängliga vägen följer en begränsning." +msgstr "Inga resultat eftersom den enda tillgängliga vägen följer en begränsning." msgid "From vertex :math:`3` to vertex :math:`8` on an undirected graph" msgstr "Från toppunkt :math:`3` till toppunkt :math:`8` i en odelad graf" @@ -17521,120 +13148,62 @@ msgstr "**TBD**" msgid "TBD" msgstr "TBD" -msgid "" -"``pgr_withPoints`` - Returns the shortest path in a graph with additional " -"temporary vertices." -msgstr "" -"``pgr_withPoints`` - Returnerar den kortaste vägen i en graf med ytterligare " -"tillfälliga toppar." +msgid "``pgr_withPoints`` - Returns the shortest path in a graph with additional temporary vertices." +msgstr "``pgr_withPoints`` - Returnerar den kortaste vägen i en graf med ytterligare tillfälliga toppar." msgid "pgr_withPoints(Combinations)" msgstr "pgr_withPoints(Combinations)" -msgid "" -"Modify the graph to include points defined by `Points SQL`_. Using Dijkstra " -"algorithm, find the shortest path." -msgstr "" -"Modifiera grafen så att den innehåller punkter definierade av `Points SQL`_. " -"Använd Dijkstra-algoritmen för att hitta den kortaste vägen." +msgid "Modify the graph to include points defined by `Points SQL`_. Using Dijkstra algorithm, find the shortest path." +msgstr "Modifiera grafen så att den innehåller punkter definierade av `Points SQL`_. Använd Dijkstra-algoritmen för att hitta den kortaste vägen." -msgid "" -"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, " -"[**driving side**] [**options**])" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" msgstr "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **slut vid**, [**körsida**] [**alternativ**])" -msgid "" -"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, " -"[**driving side**] [**options**])" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" msgstr "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vids**, [**körsida**] [**options**])" -msgid "" -"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, " -"[**driving side**] [**options**])" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" msgstr "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vid**, [**drivande sida**] [**optioner**])" -msgid "" -"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, " -"[**driving side**] [**options**])" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" msgstr "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vids**, [**drivande sida**] [**optioner**])" -msgid "" -"pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving " -"side**] [**options**])" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" msgstr "pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" msgid "**options:** ``[directed, details])``" msgstr "**options:** ``[directed, details])``" -msgid "" -"From point :math:`1` to vertex :math:`10` with right driving side in " -"directed graph. (without details)" -msgstr "" -"Från punkt :math:`1` till toppunkt :math:`10` med höger drivsida i riktad " -"graf. (utan detaljer)" +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (without details)" +msgstr "Från punkt :math:`1` till toppunkt :math:`10` med höger drivsida i riktad graf. (utan detaljer)" -msgid "" -"Identifier of the starting vertex of the path. Negative value is for point’s " -"identifier." -msgstr "" -"Identifierare för banans startvertex. Negativt värde är för punktens " -"identifierare." +msgid "Identifier of the starting vertex of the path. Negative value is for point’s identifier." +msgstr "Identifierare för banans startvertex. Negativt värde är för punktens identifierare." -msgid "" -"Array of identifiers of starting vertices. Negative values are for point’s " -"identifiers." -msgstr "" -"Array med identifierare för startpunkter. Negativa värden är för punktens " -"identifierare." +msgid "Array of identifiers of starting vertices. Negative values are for point’s identifiers." +msgstr "Array med identifierare för startpunkter. Negativa värden är för punktens identifierare." -msgid "" -"Identifier of the ending vertex of the path. Negative value is for point’s " -"identifier." -msgstr "" -"Identifierare för banans slutpunkt. Negativt värde är för punktens " -"identifierare." +msgid "Identifier of the ending vertex of the path. Negative value is for point’s identifier." +msgstr "Identifierare för banans slutpunkt. Negativt värde är för punktens identifierare." -msgid "" -"Array of identifiers of ending vertices. Negative values are for point’s " -"identifiers." -msgstr "" -"Array med identifierare för ändpunkter. Negativa värden är för punktens " -"identifierare." +msgid "Array of identifiers of ending vertices. Negative values are for point’s identifiers." +msgstr "Array med identifierare för ändpunkter. Negativa värden är för punktens identifierare." -msgid "" -"All the examples are about traveling from point :math:`1` and vertex :math:" -"`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" -msgstr "" -"Alla exempel handlar om att resa från punkten :math:`1` och toppunkten :math:" -"`5` till punkterna :math:`\\{2, 3, 6\\}` och toppunkterna :math:`\\{10, 11\\}" -"`" +msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" +msgstr "Alla exempel handlar om att resa från punkten :math:`1` och toppunkten :math:`5` till punkterna :math:`\\{2, 3, 6\\}` och toppunkterna :math:`\\{10, 11\\}`" -msgid "" -"``pgr_withPointsCost`` - Calculates the shortest path and returns only the " -"aggregate cost of the shortest path found, for the combination of points " -"given." -msgstr "" -"``pgr_withPointsCost`` - Beräknar den kortaste vägen och returnerar endast " -"den sammanlagda kostnaden för den kortaste vägen som hittats, för den " -"kombination av punkter som anges." +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`` - Beräknar den kortaste vägen och returnerar endast den sammanlagda kostnaden för den kortaste vägen som hittats, för den kombination av punkter som anges." msgid "pgr_withPointsCost(Combinations)" msgstr "pgr_withPointsCost(Combinations)" -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 "" -"Modifiera grafen så att den innehåller punkter definierade av points_sql. " -"Använd Dijkstra-algoritmen och returnera endast den sammanlagda kostnaden " -"för den kortaste vägen som hittats." +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 "Modifiera grafen så att den innehåller punkter definierade av points_sql. Använd Dijkstra-algoritmen och returnera endast den sammanlagda kostnaden för den kortaste vägen som hittats." -msgid "" -"Returns the sum of the costs of the shortest path for pair combination of " -"vertices in the modified graph." -msgstr "" -"Returnerar summan av kostnaderna för den kortaste vägen för parkombinationer " -"av toppar i den modifierade grafen." +msgid "Returns the sum of the costs of the shortest path for pair combination of vertices in the modified graph." +msgstr "Returnerar summan av kostnaderna för den kortaste vägen för parkombinationer av toppar i den modifierade grafen." msgid "The returned values are in the form of a set of |matrix-result|." msgstr "De returnerade värdena är i form av en uppsättning |matrix-result|." @@ -17645,78 +13214,44 @@ msgstr "**positiv** när den hör till kanterna_sql" msgid "**negative** when it belongs to the points_sql" msgstr "**negativ** när den hör till punktsql" -msgid "" -"If the values returned are stored in a table, the unique index would be the " -"pair: `(start_vid, end_vid)`." -msgstr "" -"Om de värden som returneras lagras i en tabell skulle det unika indexet vara " -"paret: `(start_vid, end_vid)`." +msgid "If the values returned are stored in a table, the unique index would be the pair: `(start_vid, end_vid)`." +msgstr "Om de värden som returneras lagras i en tabell skulle det unika indexet vara paret: `(start_vid, end_vid)`." msgid "For **undirected** graphs, the results are **symmetric**." msgstr "För **ej riktade** grafer är resultaten **symmetriska**." -msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, " -"[**driving side**] [**options**])" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" msgstr "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **slut vid**, [**drivande sida**] [**optioner**])" -msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, " -"[**driving side**] [**options**])" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" msgstr "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vids**, [**driving side**] [**options**])" -msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, " -"[**driving side**] [**options**])" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" msgstr "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vid**, [**driving side**] [**options**])" -msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end " -"vids**, [**driving side**] [**options**])" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" msgstr "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vids**, [**driving side**] [**options**])" -msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, " -"[**driving side**] [**options**])" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" msgstr "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" msgid "**options:** ``[directed]``" msgstr "**options:** ``[directed]``" -msgid "" -"There is no **details** flag, unlike the other members of the withPoints " -"family of functions." -msgstr "" -"Det finns ingen **details**-flagga, till skillnad från de andra medlemmarna " -"i withPoints-familjen av funktioner." +msgid "There is no **details** flag, unlike the other members of the withPoints family of functions." +msgstr "Det finns ingen **details**-flagga, till skillnad från de andra medlemmarna i withPoints-familjen av funktioner." -msgid "" -"From point :math:`1` to vertex :math:`10` with right driving side in " -"directed graph." -msgstr "" -"Från punkt :math:`1` till toppunkt :math:`10` med höger drivsida i riktad " -"graf." +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph." +msgstr "Från punkt :math:`1` till toppunkt :math:`10` med höger drivsida i riktad graf." -msgid "" -"From point :math:`1` and vertex :math:`6` to point :math:`3` with right " -"driving side in directed graph." -msgstr "" -"Från punkt :math:`1` och toppunkt :math:`6` till punkt :math:`3` med höger " -"drivsida i riktad graf." +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph." +msgstr "Från punkt :math:`1` och toppunkt :math:`6` till punkt :math:`3` med höger drivsida i riktad graf." -msgid "" -"From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to " -"point :math:`3` with right side driving." -msgstr "" -"Från punkt :math:`1` till toppunkt :math:`10`, och från toppunkt :math:`6` " -"till punkt :math:`3` med körning på höger sida." +msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving." +msgstr "Från punkt :math:`1` till toppunkt :math:`10`, och från toppunkt :math:`6` till punkt :math:`3` med körning på höger sida." -msgid "" -"Find the cost of the routes from vertex :math:`1` to the two closest " -"locations on the graph of point `(2.9, 1.8)`." -msgstr "" -"Beräkna kostnaden för rutterna från toppunkten :math:`1` till de två " -"närmaste platserna på grafen för punkten `(2,9, 1,8)`." +msgid "Find the cost of the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." +msgstr "Beräkna kostnaden för rutterna från toppunkten :math:`1` till de två närmaste platserna på grafen för punkten `(2,9, 1,8)`." msgid "Being close to the graph does not mean have a shorter route." msgstr "Att vara nära grafen betyder inte att man har en kortare väg." @@ -17724,12 +13259,8 @@ msgstr "Att vara nära grafen betyder inte att man har en kortare väg." msgid "Right side driving topology" msgstr "Topologi för drivning av höger sida" -msgid "" -"Traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, " -"3, 6\\}` and vertices :math:`\\{10, 11\\}`" -msgstr "" -"Reser från punkt :math:`1` och toppunkt :math:`5` till punkterna :math:" -"`\\{2, 3, 6\\}` och toppunkterna :math:`\\{10, 11\\}`" +msgid "Traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" +msgstr "Reser från punkt :math:`1` och toppunkt :math:`5` till punkterna :math:`\\{2, 3, 6\\}` och toppunkterna :math:`\\{10, 11\\}`" msgid "Left side driving topology" msgstr "Topologi för drivning av vänster sida" @@ -17737,24 +13268,14 @@ msgstr "Topologi för drivning av vänster sida" msgid "Does not matter driving side driving topology" msgstr "Spelar ingen roll drivsida drivtopologi" -msgid "" -"``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:" -"`pgr_withPoints`." -msgstr "" -"``pgr_withPointsCostMatrix`` - Beräknar en kostnadsmatris med hjälp av :doc:" -"`pgr_withPoints`." +msgid "``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:`pgr_withPoints`." +msgstr "``pgr_withPointsCostMatrix`` - Beräknar en kostnadsmatris med hjälp av :doc:`pgr_withPoints`." -msgid "" -"pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, " -"[**driving side**] [**options**])" +msgid "pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, [**driving side**] [**options**])" msgstr "pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, [**driving side**] [**options**])" -msgid "" -"Cost matrix for points :math:`\\{1, 6\\}` and vertices :math:`\\{10, 11\\}` " -"on an **undirected** graph" -msgstr "" -"Kostnadsmatris för punkterna :math:`\\{1, 6\\}` och hörnen :math:`\\{10, " -"11\\}` i en **omdirigerad** graf" +msgid "Cost matrix for points :math:`\\{1, 6\\}` and vertices :math:`\\{10, 11\\}` on an **undirected** graph" +msgstr "Kostnadsmatris för punkterna :math:`\\{1, 6\\}` och hörnen :math:`\\{10, 11\\}` i en **omdirigerad** graf" msgid "Returning a **symmetrical** cost matrix" msgstr "Returnerar en **symmetrisk** kostnadsmatris" @@ -17765,16 +13286,10 @@ msgstr "Använda standardvärdet ``side`` på **points_sql**-frågan" msgid "Using the default ``driving side`` value" msgstr "Använda standardvärdet för \"körsida" -msgid "" -"Find the matrix cost of the routes from vertex :math:`1` and the two closest " -"locations on the graph of point `(2.9, 1.8)`." -msgstr "" -"Hitta matriskostnaden för rutterna från toppunkten :math:`1` och de två " -"närmaste platserna på grafen för punkten `(2,9, 1,8)`." +msgid "Find the matrix cost of the routes from vertex :math:`1` and the two closest locations on the graph of point `(2.9, 1.8)`." +msgstr "Hitta matriskostnaden för rutterna från toppunkten :math:`1` och de två närmaste platserna på grafen för punkten `(2,9, 1,8)`." -msgid "" -"``pgr_withPointsDD`` - Returns the driving **distance** from a starting " -"point." +msgid "``pgr_withPointsDD`` - Returns the driving **distance** from a starting point." msgstr "``pgr_withPointsDD`` - Returnerar köravståndet **från** en startpunkt." msgid "Output columns standardized to |result-spantree|" @@ -17789,25 +13304,13 @@ msgstr "Punkter som nås inom avståndet ingår inte." msgid "Deprecated signatures:" msgstr "Föråldrade signaturer:" -msgid "" -"Modify the graph to include points and using Dijkstra algorithm, extracts " -"all the nodes and points that have costs less than or equal to the value " -"``**distance**`` from the starting point. The edges extracted will conform " -"the corresponding spanning tree." -msgstr "" -"Modifiera grafen så att den inkluderar punkter och använd Dijkstra-" -"algoritmen för att extrahera alla noder och punkter som har kostnader som är " -"mindre än eller lika med värdet ``**avstånd**`` från startpunkten. De " -"extraherade kanterna kommer att överensstämma med motsvarande spännträd." +msgid "Modify the graph to include points and using Dijkstra algorithm, extracts all the nodes and points that have costs less than or equal to the value ``**distance**`` from the starting point. The edges extracted will conform the corresponding spanning tree." +msgstr "Modifiera grafen så att den inkluderar punkter och använd Dijkstra-algoritmen för att extrahera alla noder och punkter som har kostnader som är mindre än eller lika med värdet ``**avstånd**`` från startpunkten. De extraherade kanterna kommer att överensstämma med motsvarande spännträd." -msgid "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, " -"[**driving side**], [**options A**])" +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options A**])" msgstr "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options A**])" -msgid "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, " -"[**driving side**], [**options B**])" +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options B**])" msgstr "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options B**])" msgid "**options A:** ``[directed, details]``" @@ -17816,73 +13319,44 @@ msgstr "**options A:** ``[directed, details]``" msgid "**options B:** ``[directed, details, equicost]``" msgstr "**options B:** ``[directed, details, equicost]``" -msgid "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, " -"[**driving side**], [**options**])" +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options**])" msgstr "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options**])" -msgid "" -"Right side driving topology, from point :math:`1` within a distance of :math:" -"`3.3` with details." -msgstr "" -"Höger sida körtopologi, från punkt :math:`1` inom ett avstånd av :math:`3.3` " -"med detaljer." +msgid "Right side driving topology, from point :math:`1` within a distance of :math:`3.3` with details." +msgstr "Höger sida körtopologi, från punkt :math:`1` inom ett avstånd av :math:`3.3` med detaljer." -msgid "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, " -"[**driving side**], [**options**])" +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options**])" msgstr "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options**])" msgid "**options:** ``[directed, details, equicost]``" msgstr "**options:** ``[directed, details, equicost]``" -msgid "" -"From point :math:`1` and vertex :math:`16` within a distance of :math:`3.3` " -"with ``equicost`` on a directed graph" -msgstr "" -"Från punkt :math:`1` och toppunkt :math:`16` inom ett avstånd av :math:`3.3` " -"med ``equicost`` på en riktad graf" +msgid "From point :math:`1` and vertex :math:`16` within a distance of :math:`3.3` with ``equicost`` on a directed graph" +msgstr "Från punkt :math:`1` och toppunkt :math:`16` inom ett avstånd av :math:`3.3` med ``equicost`` på en riktad graf" msgid "Negative values represent a point" msgstr "Negativa värden representerar en punkt" -msgid "" -"Find the driving distance from the two closest locations on the graph of " -"point `(2.9, 1.8)`." -msgstr "" -"Hitta köravståndet från de två närmaste platserna på grafen för punkten " -"`(2,9, 1,8)`." +msgid "Find the driving distance from the two closest locations on the graph of point `(2.9, 1.8)`." +msgstr "Hitta köravståndet från de två närmaste platserna på grafen för punkten `(2,9, 1,8)`." -msgid "" -"Point :math:`-1` corresponds to the closest edge from point :math:`(2.9, " -"1.8)`." -msgstr "" -"Punkt :math:`-1` motsvarar den närmaste kanten från punkt :math:`(2,9, 1,8)`." +msgid "Point :math:`-1` corresponds to the closest edge from point :math:`(2.9, 1.8)`." +msgstr "Punkt :math:`-1` motsvarar den närmaste kanten från punkt :math:`(2,9, 1,8)`." -msgid "" -"Point :math:`-2` corresponds to the next close edge from point :math:`(2.9, " -"1.8)`." -msgstr "" -"Punkt :math:`-2` motsvarar nästa nära kant från punkt :math:`(2,9, 1,8)`." +msgid "Point :math:`-2` corresponds to the next close edge from point :math:`(2.9, 1.8)`." +msgstr "Punkt :math:`-2` motsvarar nästa nära kant från punkt :math:`(2,9, 1,8)`." msgid "Driving side does not matter" msgstr "Körsidan spelar ingen roll" -msgid "" -"From point :math:`1` within a distance of :math:`3.3`, does not matter " -"driving side, with details." -msgstr "" -"Från punkt :math:`1` inom ett avstånd av :math:`3.3`, spelar ingen roll " -"körsida, med detaljer." +msgid "From point :math:`1` within a distance of :math:`3.3`, does not matter driving side, with details." +msgstr "Från punkt :math:`1` inom ett avstånd av :math:`3.3`, spelar ingen roll körsida, med detaljer." msgid "``pgr_withPointsKSP``" msgstr "``pgr_withPointsKSP``" -msgid "" -"``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." -msgstr "" -"``pgr_withPointsKSP`` - Yen's algoritm för K kortaste vägar med hjälp av " -"Dijkstra." +msgid "``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." +msgstr "``pgr_withPointsKSP`` - Yen's algoritm för K kortaste vägar med hjälp av Dijkstra." msgid "pgr_withPointsKSP(One to Many)" msgstr "pgr_withPointsKSP(One to Many)" @@ -17896,48 +13370,29 @@ msgstr "pgr_withPointsKSP(Many to Many)" msgid "pgr_withPointsKSP(Combinations)" msgstr "pgr_withPointsKSP(Combinations)" -msgid "" -"Modifies the graph to include the points defined in the `Points SQL`_ and " -"using Yen algorithm, finds the :math:`K` shortest paths." -msgstr "" -"Modifierar grafen så att den innehåller de punkter som definieras i `Points " -"SQL`_ och använder Yen-algoritmen för att hitta de :math:`K` kortaste " -"vägarna." +msgid "Modifies the graph to include the points defined in the `Points SQL`_ and using Yen algorithm, finds the :math:`K` shortest paths." +msgstr "Modifierar grafen så att den innehåller de punkter som definieras i `Points SQL`_ och använder Yen-algoritmen för att hitta de :math:`K` kortaste vägarna." -msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, " -"**K**, [**driving side**], [**options**])" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, [**driving side**], [**options**])" msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **slut vid**, **K**, [**drivande sida**], [**alternativ**])" -msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, " -"**K**, [**driving side**], [**options**])" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, [**driving side**], [**options**])" msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vids**, **K**, [**drivande sida**], [**alternativ**])" -msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, " -"**K**, [**driving side**], [**options**])" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, [**driving side**], [**options**])" msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vid**, **K**, [**drivande sida**], [**alternativ**])" -msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, " -"**K**, [**driving side**], [**options**])" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, [**driving side**], [**options**])" msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vids**, **K**, [**drivande sida**], [**alternativ**])" -msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, " -"[**driving side**], [**options**])" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, [**driving side**], [**options**])" msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, [**driving side**], [**options**])" msgid "**options:** ``[directed, heap_paths, details]``" msgstr "**options:** ``[directed, heap_paths, details]``" -msgid "" -"Get 2 paths from Point :math:`1` to point :math:`2` on a directed graph with " -"**left** side driving." -msgstr "" -"Få 2 vägar från punkt :math:`1` till punkt :math:`2` på en riktad graf med " -"**vänster** sida som kör." +msgid "Get 2 paths from Point :math:`1` to point :math:`2` on a directed graph with **left** side driving." +msgstr "Få 2 vägar från punkt :math:`1` till punkt :math:`2` på en riktad graf med **vänster** sida som kör." msgid "For a directed graph." msgstr "För en riktad graf." @@ -17948,29 +13403,14 @@ msgstr "Inga detaljer ges om avståndet till andra punkter i frågan." msgid "No heap paths are returned." msgstr "Inga heap-sökvägar returneras." -msgid "" -"Get 2 paths from point :math:`1` to point :math:`3` and vertex :math:`7` on " -"an undirected graph" -msgstr "" -"Hämta 2 vägar från punkt :math:`1` till punkt :math:`3` och toppunkt :math:" -"`7` i en ostyrd graf" +msgid "Get 2 paths from point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" +msgstr "Hämta 2 vägar från punkt :math:`1` till punkt :math:`3` och toppunkt :math:`7` i en ostyrd graf" -msgid "" -"Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` on a " -"**directed** graph with **right** side driving and **details** set to " -"**True**" -msgstr "" -"Hämta en väg från punkt :math:`1` och vertex :math:`6` till punkt :math:`3` " -"i en **riktad** graf med **höger** sida och **detaljer** inställt på **True**" +msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` on a **directed** graph with **right** side driving and **details** set to **True**" +msgstr "Hämta en väg från punkt :math:`1` och vertex :math:`6` till punkt :math:`3` i en **riktad** graf med **höger** sida och **detaljer** inställt på **True**" -msgid "" -"Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` and " -"vertex :math:`1` on a **directed** graph with **left** side driving and " -"**heap_paths** set to **True**" -msgstr "" -"Hämta en väg från punkt :math:`1` och toppunkt :math:`6` till punkt :math:" -"`3` och toppunkt :math:`1` i en **directed** graf med **left** side driving " -"och **heap_paths** satt till **True**" +msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` on a **directed** graph with **left** side driving and **heap_paths** set to **True**" +msgstr "Hämta en väg från punkt :math:`1` och toppunkt :math:`6` till punkt :math:`3` och toppunkt :math:`1` i en **directed** graf med **left** side driving och **heap_paths** satt till **True**" msgid "Using a combinations table on an **directed** graph" msgstr "Använda en kombinationstabell på en **riktad** graf" @@ -17981,139 +13421,65 @@ msgstr "Antal nödvändiga sökvägar" msgid "withPointsKSP optional parameters" msgstr "withPointsKSP valfria parametrar" -msgid "" -"Get :math:`2` paths using left side driving topology, from vertex :math:`1` " -"to the closest location on the graph of point `(2.9, 1.8)`." -msgstr "" -"Skaffa :math:`2` banor med hjälp av vänstersidig körtopologi, från " -"toppunkten :math:`1` till den närmaste platsen på grafen för punkten `(2,9, " -"1,8)`." +msgid "Get :math:`2` paths using left side driving topology, from vertex :math:`1` to the closest location on the graph of point `(2.9, 1.8)`." +msgstr "Skaffa :math:`2` banor med hjälp av vänstersidig körtopologi, från toppunkten :math:`1` till den närmaste platsen på grafen för punkten `(2,9, 1,8)`." msgid "Left driving side" msgstr "Vänster körsida" -msgid "" -"Get :math:`2` paths using left side driving topology, from point :math:`1` " -"to point :math:`3` with details." -msgstr "" -"Få :math:`2` banor med hjälp av vänstersidig drivtopologi, från punkt :math:" -"`1` till punkt :math:`3` med detaljer." +msgid "Get :math:`2` paths using left side driving topology, from point :math:`1` to point :math:`3` with details." +msgstr "Få :math:`2` banor med hjälp av vänstersidig drivtopologi, från punkt :math:`1` till punkt :math:`3` med detaljer." msgid "Right driving side" msgstr "Höger körsida" -msgid "" -"Get :math:`2` paths using right side driving topology from, point :math:`1` " -"to point :math:`2` with heap paths and details." -msgstr "" -"Få :math:`2` banor med hjälp av höger sidas drivande topologi från, punkt :" -"math:`1` till punkt :math:`2` med högbanor och detaljer." +msgid "Get :math:`2` paths using right side driving topology from, point :math:`1` to point :math:`2` with heap paths and details." +msgstr "Få :math:`2` banor med hjälp av höger sidas drivande topologi från, punkt :math:`1` till punkt :math:`2` med högbanor och detaljer." msgid "``pgr_withPointsVia``" msgstr "``pgr_medPointsVia``" -msgid "" -"``pgr_withPointsVia`` - Route that goes through a list of vertices and/or " -"points." -msgstr "" -"``pgr_withPointsVia`` - Rutt som går genom en lista med toppar och/eller " -"punkter." +msgid "``pgr_withPointsVia`` - Route that goes through a list of vertices and/or points." +msgstr "``pgr_withPointsVia`` - Rutt som går genom en lista med toppar och/eller punkter." -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 "" -"Med tanke på en graf, en uppsättning punkter på grafens kanter och en lista " -"med hörnpunkter är denna funktion likvärdig med att hitta den kortaste vägen " -"mellan :math:`vertex_i` och :math:`vertex_{i+1}` (där :math:`vertex` kan " -"vara en hörnpunkt eller en punkt i grafen) för alla :math:`i < " -"size\\_of(via\\;vertices)`." +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 "Med tanke på en graf, en uppsättning punkter på grafens kanter och en lista med hörnpunkter är denna funktion likvärdig med att hitta den kortaste vägen mellan :math:`vertex_i` och :math:`vertex_{i+1}` (där :math:`vertex` kan vara en hörnpunkt eller en punkt i grafen) för alla :math:`i < size\\_of(via\\;vertices)`." -msgid "" -"pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, [**driving " -"side**] [**options**])" +msgid "pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, [**driving side**] [**options**])" msgstr "pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, [**driving side**] [**options**])" -msgid "" -"Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that " -"order with right driving side in directed graph.." -msgstr "" -"Hitta rutten som besöker topparna :math:`\\{ -6, 15, -1\\\\}` i den " -"ordningen med höger körsida i riktad graf..." +msgid "Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that order with right driving side in directed graph.." +msgstr "Hitta rutten som besöker topparna :math:`\\{ -6, 15, -1\\\\}` i den ordningen med höger körsida i riktad graf..." msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_" msgstr "Använd :doc:`pgr_findCloseEdges` i `Points SQL`_" -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 "" -"Alla dessa exempel handlar om den rutt som besöker topparna :math:`\\{-1, 7, " -"-3, 16, 15\\}` i den ordningen i en **riktad** graf." +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 "Alla dessa exempel handlar om den rutt som besöker topparna :math:`\\{-1, 7, -3, 16, 15\\}` i den ordningen i en **riktad** graf." msgid "Prim - Family of functions" msgstr "Prim - Familj av funktioner" -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-algoritmen utvecklades 1930 av den tjeckiske matematikern Vojtěch " -"Jarník. Det är en girig algoritm som hittar ett träd med minsta spännvidd " -"för en viktad oiktad graf. Detta innebär att den hittar en delmängd av " -"kanterna som bildar ett träd som inkluderar varje vertex, där den totala " -"vikten av alla kanter i trädet minimeras. Algoritmen bygger trädet ett " -"vertex i taget, från ett godtyckligt startvertex, och lägger i varje steg " -"till den billigaste möjliga förbindelsen från trädet till ett annat vertex." +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-algoritmen utvecklades 1930 av den tjeckiske matematikern Vojtěch Jarník. Det är en girig algoritm som hittar ett träd med minsta spännvidd för en viktad oiktad graf. Detta innebär att den hittar en delmängd av kanterna som bildar ett träd som inkluderar varje vertex, där den totala vikten av alla kanter i trädet minimeras. Algoritmen bygger trädet ett vertex i taget, från ett godtyckligt startvertex, och lägger i varje steg till den billigaste möjliga förbindelsen från trädet till ett annat vertex." -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 "" -"Den här algoritmen hittar den minsta överspännande skogen i en eventuellt " -"frånkopplad graf; däremot hittar den mest grundläggande formen av Prims " -"algoritm bara minsta överspännande träd i sammanhängande grafer. Men om man " -"kör Prims algoritm separat för varje ansluten komponent i grafen kallas den " -"minsta spännvidden för skog." +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 "Den här algoritmen hittar den minsta överspännande skogen i en eventuellt frånkopplad graf; däremot hittar den mest grundläggande formen av Prims algoritm bara minsta överspännande träd i sammanhängande grafer. Men om man kör Prims algoritm separat för varje ansluten komponent i grafen kallas den minsta spännvidden för skog." -msgid "" -"From boost Graph: \"The algorithm as implemented in Boost.Graph does not " -"produce correct results on graphs with parallel edges.\"" -msgstr "" -"Från Boost Graph: \"Algoritmen som den implementeras i Boost.Graph ger inte " -"korrekta resultat på grafer med parallella kanter.\"" +msgid "From boost Graph: \"The algorithm as implemented in Boost.Graph does not produce correct results on graphs with parallel edges.\"" +msgstr "Från Boost Graph: \"Algoritmen som den implementeras i Boost.Graph ger inte korrekta resultat på grafer med parallella kanter.\"" -msgid "" -"Boost: `Prim's algorithm `__" -msgstr "" -"Boost: `Prims algoritm `__" +msgid "Boost: `Prim's algorithm `__" +msgstr "Boost: `Prims algoritm `__" -msgid "" -"Wikipedia: `Prim's algorithm `__" -msgstr "" -"Wikipedia: `Prims algoritm `__" +msgid "Wikipedia: `Prim's algorithm `__" +msgstr "Wikipedia: `Prims algoritm `__" msgid "Proposed Functions" msgstr "Föreslagna funktioner" -msgid "" -":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." -msgstr "" -":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." +msgid ":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." +msgstr ":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." msgid "Reference" msgstr "Referens" @@ -18121,12 +13487,8 @@ msgstr "Referens" msgid "Release Notes" msgstr "Anteckningar för release" -msgid "" -"To see the full list of changes check the list of `Git commits `_ on Github." -msgstr "" -"För att se den fullständiga listan över ändringar, se listan över `Git " -"commits `_ på Github." +msgid "To see the full list of changes check the list of `Git commits `_ on Github." +msgstr "För att se den fullständiga listan över ändringar, se listan över `Git commits `_ på Github." msgid "Mayors" msgstr "Borgmästare" @@ -18137,9 +13499,21 @@ msgstr "pgRouting 4" msgid "Minors 4.x" msgstr "Minors 4.x" -msgid "pgRouting 4.0" +#, fuzzy +msgid "pgRouting 4.1" msgstr "pgRouting 4.0" +#, fuzzy +msgid "pgRouting 4.1.0 Release Notes" +msgstr "pgRouting 3.1.0 Release Notes" + +#, fuzzy +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.1.0 `__" +msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 4.0.0 `__" + +msgid "No changes yet" +msgstr "" + msgid "pgRouting 3" msgstr "pgRouting 3" @@ -18152,10 +13526,7 @@ msgstr "pgRouting 3.8" msgid "pgRouting 3.8.0 Release Notes" msgstr "pgRouting 3.8.0 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.8.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.8.0 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.8.0 `__" msgid "Promotion to official function of pgRouting." @@ -18164,43 +13535,23 @@ msgstr "Befordran till officiell funktion för pgRouting." msgid "Metric" msgstr "Metriska" -msgid "" -"`#2760 `__: Promoted to " -"official pgr_degree in version 3.8" -msgstr "" -"`#2760 `__: Befordrad " -"till officiell pgr_grad i version 3.8" +msgid "`#2760 `__: Promoted to official pgr_degree in version 3.8" +msgstr "`#2760 `__: Befordrad till officiell pgr_grad i version 3.8" msgid "Utilities" msgstr "Verktyg" -msgid "" -"`#2772 `__: Promoted to " -"official pgr_extractVertices in version 3.8" -msgstr "" -"`#2772 `__: Befordrad " -"till officiell pgr_extractVertices i version 3.8" +msgid "`#2772 `__: Promoted to official pgr_extractVertices in version 3.8" +msgstr "`#2772 `__: Befordrad till officiell pgr_extractVertices i version 3.8" -msgid "" -"`#2774 `__: Promoted to " -"official pgr_findCloseEdges in version 3.8" -msgstr "" -"`#2774 `__: Befordrad " -"till officiell pgr_findCloseEdges i version 3.8" +msgid "`#2774 `__: Promoted to official pgr_findCloseEdges in version 3.8" +msgstr "`#2774 `__: Befordrad till officiell pgr_findCloseEdges i version 3.8" -msgid "" -"`#2873 `__: Promoted to " -"official pgr_separateCrossing in version 3.8" -msgstr "" -"`#2873 `__: Befordrad " -"till officiell pgr_separateCrossing i version 3.8" +msgid "`#2873 `__: Promoted to official pgr_separateCrossing in version 3.8" +msgstr "`#2873 `__: Befordrad till officiell pgr_separateCrossing i version 3.8" -msgid "" -"`#2874 `__: Promoted to " -"official pgr_separateTouching in version 3.8" -msgstr "" -"`#2874 `__: Befordrad " -"till officiell pgr_separateTouching i version 3.8" +msgid "`#2874 `__: Promoted to official pgr_separateTouching in version 3.8" +msgstr "`#2874 `__: Befordrad till officiell pgr_separateTouching i version 3.8" msgid "Proposed functions" msgstr "Föreslagna funktioner" @@ -18208,60 +13559,32 @@ msgstr "Föreslagna funktioner" msgid "Contraction" msgstr "Sammandragning" -msgid "" -"`#2790 `__: " -"pgr_contractionDeadEnd new contraction function" -msgstr "" -"`#2790 `__: " -"pgr_contractionDeadEnd ny funktion för sammandragning" +msgid "`#2790 `__: pgr_contractionDeadEnd new contraction function" +msgstr "`#2790 `__: pgr_contractionDeadEnd ny funktion för sammandragning" -msgid "" -"`#2791 `__: " -"pgr_contractionLinear new contraction function" -msgstr "" -"`#2791 `__: " -"pgr_contractionLinear ny funktion för sammandragning" +msgid "`#2791 `__: pgr_contractionLinear new contraction function" +msgstr "`#2791 `__: pgr_contractionLinear ny funktion för sammandragning" -msgid "" -"`#2536 `__: Support for " -"contraction hierarchies (pgr_contractionHierarchies)" -msgstr "" -"`#2536 `__: Stöd för " -"sammandragningshierarkier (pgr_contractionHierarchies)" +msgid "`#2536 `__: Support for contraction hierarchies (pgr_contractionHierarchies)" +msgstr "`#2536 `__: Stöd för sammandragningshierarkier (pgr_contractionHierarchies)" -msgid "" -"`#2848 `__: Create " -"pgr_separateCrossing new utility function" -msgstr "" -"`#2848 `__: Skapa " -"pgr_separateCrossing ny verktygsfunktion" +msgid "`#2848 `__: Create pgr_separateCrossing new utility function" +msgstr "`#2848 `__: Skapa pgr_separateCrossing ny verktygsfunktion" -msgid "" -"`#2849 `__: Create of " -"pgr_separateTouching new utility function" -msgstr "" -"`#2849 `__: Skapande av " -"pgr_separateTouching ny verktygsfunktion" +msgid "`#2849 `__: Create of pgr_separateTouching new utility function" +msgstr "`#2849 `__: Skapande av pgr_separateTouching ny verktygsfunktion" msgid "Official functions changes" msgstr "Förändringar i officiella funktioner" -msgid "" -"`#2786 `__: " -"pgr_contraction(edges) new signature" -msgstr "" -"`#2786 `__: " -"pgr_contraction(edges) ny signatur" +msgid "`#2786 `__: pgr_contraction(edges) new signature" +msgstr "`#2786 `__: pgr_contraction(edges) ny signatur" msgid "C/C++ code enhancements" msgstr "Förbättringar av C/C++-kod" -msgid "" -"`#2802 `__: Code " -"reorganization on pgr_contraction" -msgstr "" -"`#2802 `__: " -"Omorganisering av kod för pgr_contraction" +msgid "`#2802 `__: Code reorganization on pgr_contraction" +msgstr "`#2802 `__: Omorganisering av kod för pgr_contraction" msgid "Other enhancements:" msgstr "Andra förbättringar:" @@ -18272,50 +13595,26 @@ msgstr "`#2869 `__:" msgid "SQL code enhancements" msgstr "Förbättringar av SQL-kod" -msgid "" -"`#2850 `__: Rewrite " -"pgr_nodeNetwork" -msgstr "" -"`#2850 `__: Skriv om " -"pgr_nodeNetwork" +msgid "`#2850 `__: Rewrite pgr_nodeNetwork" +msgstr "`#2850 `__: Skriv om pgr_nodeNetwork" msgid "Deprecation of SQL functions" msgstr "Utfasning av SQL-funktioner" -msgid "" -"`#2749 `__: Deprecate " -"pgr_AlphaShape in 3.8" -msgstr "" -"`#2749 `__: Avveckla " -"pgr_AlphaShape i 3.8" +msgid "`#2749 `__: Deprecate pgr_AlphaShape in 3.8" +msgstr "`#2749 `__: Avveckla pgr_AlphaShape i 3.8" -msgid "" -"`#2750 `__: Deprecate " -"pgr_CreateTopology in 3.8" -msgstr "" -"`#2750 `__: Avveckla " -"pgr_CreateTopology i 3.8" +msgid "`#2750 `__: Deprecate pgr_CreateTopology in 3.8" +msgstr "`#2750 `__: Avveckla pgr_CreateTopology i 3.8" -msgid "" -"`#2753 `__: Deprecate " -"pgr_analyzeGraph in 3.8" -msgstr "" -"`#2753 `__: Avveckla " -"pgr_analyzeGraph i 3.8" +msgid "`#2753 `__: Deprecate pgr_analyzeGraph in 3.8" +msgstr "`#2753 `__: Avveckla pgr_analyzeGraph i 3.8" -msgid "" -"`#2754 `__: Deprecate " -"pgr_analyzeOneWay in 3.8" -msgstr "" -"`#2754 `__: Avveckla " -"pgr_analyzeOneWay i 3.8" +msgid "`#2754 `__: Deprecate pgr_analyzeOneWay in 3.8" +msgstr "`#2754 `__: Avveckla pgr_analyzeOneWay i 3.8" -msgid "" -"`#2826 `__: Deprecate " -"pgr_createVerticesTable in 3.8" -msgstr "" -"`#2826 `__: Avveckla " -"pgr_createVerticesTable i 3.8" +msgid "`#2826 `__: Deprecate pgr_createVerticesTable in 3.8" +msgstr "`#2826 `__: Avveckla pgr_createVerticesTable i 3.8" msgid "In the deprecated functions:" msgstr "I de föråldrade funktionerna:" @@ -18332,29 +13631,19 @@ msgstr "pgRouting 3.7" msgid "pgRouting 3.7.3 Release Notes" msgstr "pgRouting 3.7.3 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.7.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.3 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.7.3 `__" -msgid "" -"`#2731 `__: Build " -"Failure on Ubuntu 22" +msgid "`#2731 `__: Build Failure on Ubuntu 22" msgstr "`#2731 `__: Byggfel på Ubuntu 22" msgid "pgRouting 3.7.2 Release Notes" msgstr "pgRouting 3.7.2 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.7.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.2 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.7.2 `__" -msgid "" -"`#2713 `__: cmake " -"missing some policies and min version" +msgid "`#2713 `__: cmake missing some policies and min version" msgstr "`#2713 `__: cmake saknar vissa policyer och min-version" msgid "Using OLD policies: CMP0148, CMP0144, CMP0167" @@ -18363,33 +13652,22 @@ msgstr "Använda gamla policyer: CMP0148, CMP0144, CMP0167" msgid "Minimum cmake version 3.12" msgstr "Minsta cmake-version 3.12" -msgid "" -"`#2707 `__: Build " -"failure in pgRouting 3.7.1 on Alpine" +msgid "`#2707 `__: Build failure in pgRouting 3.7.1 on Alpine" msgstr "`#2707 `__: Byggfel i pgRouting 3.7.1 på Alpine" -msgid "" -"`#2706 `__: winnie " -"crashing on pgr_betweennessCentrality" +msgid "`#2706 `__: winnie crashing on pgr_betweennessCentrality" msgstr "`#2706 `__: winnie kraschar på pgr_betweennessCentrality" msgid "pgRouting 3.7.1 Release Notes" msgstr "pgRouting 3.7.1 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.7.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.1 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.7.1 `__" -msgid "" -"`#2680 `__: fails to " -"compile under mingw64 gcc 13.2" +msgid "`#2680 `__: fails to compile under mingw64 gcc 13.2" msgstr "`#2680 `__: går inte att kompilera under mingw64 gcc 13.2" -msgid "" -"`#2689 `__: When point " -"is a vertex, the withPoints family do not return results." +msgid "`#2689 `__: When point is a vertex, the withPoints family do not return results." msgstr "`#2689 `__: När en punkt är en vertex ger inte withPoints-familjen något resultat." msgid "C/C++ code enhancemet" @@ -18401,18 +13679,13 @@ msgstr "TRSP-familjen" msgid "pgRouting 3.7.0 Release Notes" msgstr "pgRouting 3.7.0 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.7.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.0 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.7.0 `__" msgid "Support" msgstr "Support" -msgid "" -"`#2656 `__: Stop support " -"of PostgreSQL12 on pgrouting v3.7" +msgid "`#2656 `__: Stop support of PostgreSQL12 on pgrouting v3.7" msgstr "`#2656 `__: Stoppa stöd för PostgreSQL12 på pgrouting v3.7" msgid "Stopping support of PostgreSQL 12" @@ -18424,9 +13697,7 @@ msgstr "CI testar inte för PostgreSQL 12" msgid "pgr_betweennessCentrality" msgstr "pgr_betweennessCentrality" -msgid "" -"`#2605 `__: Standardize " -"spanning tree functions output" +msgid "`#2605 `__: Standardize spanning tree functions output" msgstr "`#2605 `__: Standardisera utdata för funktioner för spänningsträd" msgid "Functions:" @@ -18435,9 +13706,7 @@ msgstr "Funktioner:" msgid "Experimental promoted to proposed." msgstr "Experimentell befordrad till föreslagen." -msgid "" -"`#2635 `__: " -"pgr_LineGraph ignores directed flag and use negative values for identifiers." +msgid "`#2635 `__: pgr_LineGraph ignores directed flag and use negative values for identifiers." msgstr "`#2635 `__: pgr_LineGraph ignorerar directed flag och använder negativa värden för identifierare." msgid "``pgr_lineGraph``" @@ -18446,19 +13715,13 @@ msgstr "``pgr_lineGraph``" msgid "Code enhancement" msgstr "Förbättring av kod" -msgid "" -"`#2599 `__: Driving " -"distance cleanup" +msgid "`#2599 `__: Driving distance cleanup" msgstr "`#2599 `__: Körsträcka uppstädning" -msgid "" -"`#2607 `__: Read " -"postgresql data on C++" +msgid "`#2607 `__: Read postgresql data on C++" msgstr "`#2607 `__: Läsa postgresql-data på C++" -msgid "" -"`#2614 `__: Clang tidy " -"does not work" +msgid "`#2614 `__: Clang tidy does not work" msgstr "`#2614 `__: Clang tidy fungerar inte" msgid "pgRouting 3.6" @@ -18467,10 +13730,7 @@ msgstr "pgRouting 3.6" msgid "pgRouting 3.6.3 Release Notes" msgstr "pgRouting 3.6.3 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.6.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.3 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.6.3 `__" msgid "Explicit minimum requirements:" @@ -18500,19 +13760,14 @@ msgstr "CI-test" msgid "Add a clang tidy test on changed files." msgstr "Lägg till ett clang tidy-test på ändrade filer." -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 "" -"Uppdateringstest inte gjort på versioner: 3.0.1, 3.0.2, 3.0.3, 3.0.4, 3.1.0, " -"3.1.1, 3.1.2" +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 "Uppdateringstest inte gjort på versioner: 3.0.1, 3.0.2, 3.0.3, 3.0.4, 3.1.0, 3.1.1, 3.1.2" msgid "Documentation" msgstr "Dokumentation" msgid "Results of documentation queries adujsted to boost 1.83.0 version:" -msgstr "" -"Resultat av dokumentationsförfrågningar adujsted till boost 1.83.0 version:" +msgstr "Resultat av dokumentationsförfrågningar adujsted till boost 1.83.0 version:" msgid "pgr_stoerWagner" msgstr "pgr_stoerWagner" @@ -18526,10 +13781,7 @@ msgstr "buggfixar" msgid "pgRouting 3.6.2 Release Notes" msgstr "pgRouting 3.6.2 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.6.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.2 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.6.2 `__" msgid "Upgrade fix" @@ -18553,113 +13805,74 @@ msgstr "Namnändring till `NEWS.md` för bättre visualisering på GitHub" msgid "pgRouting 3.6.1 Release Notes" msgstr "pgRouting 3.6.1 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.6.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.1 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.6.1 `__" -msgid "" -"`#2588 `__: pgrouting " -"3.6.0 fails to build on OSX" +msgid "`#2588 `__: pgrouting 3.6.0 fails to build on OSX" msgstr "`#2588 `__: pgrouting 3.6.0 går inte att bygga under OSX" msgid "pgRouting 3.6.0 Release Notes" msgstr "pgRouting 3.6.0 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.6.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.0 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.6.0 `__" -msgid "" -"`#2516 `__: Standardize " -"output pgr_aStar" +msgid "`#2516 `__: Standardize output pgr_aStar" msgstr "`#2516 `__: Standardisera utdata pgr_aStar" msgid "Standardize output columns to |short-generic-result|" msgstr "Standardisera utdatakolumner till |short-generic-result|" -msgid "" -"`#2523 `__: Standardize " -"output pgr_bdAstar" +msgid "`#2523 `__: Standardize output pgr_bdAstar" msgstr "`#2523 `__: Standardisera utdata pgr_bdAstar" -msgid "" -"`#2547 `__: Standardize " -"output and modifying signature pgr_KSP" +msgid "`#2547 `__: Standardize output and modifying signature pgr_KSP" msgstr "`#2547 `__: Standardisera utdata och modifiera signatur pgr_KSP" -msgid "" -"`#2548 `__: Standardize " -"output pgr_drivingDistance" +msgid "`#2548 `__: Standardize output pgr_drivingDistance" msgstr "`#2548 `__: Standardisera utdata pgr_drivingDistance" msgid "Proposed functions changes" msgstr "Föreslagna ändringar av funktioner" -msgid "" -"`#2544 `__: Standardize " -"output and modifying signature pgr_withPointsDD" +msgid "`#2544 `__: Standardize output and modifying signature pgr_withPointsDD" msgstr "`#2544 `__: Standardisera utdata och modifiera signaturen pgr_withPointsDD" -msgid "" -"`#2546 `__: Standardize " -"output and modifying signature pgr_withPointsKSP" +msgid "`#2546 `__: Standardize output and modifying signature pgr_withPointsKSP" msgstr "`#2546 `__: Standardisera utdata och modifiera signaturen pgr_withPointsKSP" -msgid "" -"`#2504 `__: To C++ pg " -"data get, fetch and check." +msgid "`#2504 `__: To C++ pg data get, fetch and check." msgstr "`#2504 `__: Till C++ pg-data hämta, hämta och kontrollera." msgid "Stopping support for compilation with MSVC." msgstr "Stoppar stöd för kompilering med MSVC." -msgid "" -"`#2505 `__: Using " -"namespace." +msgid "`#2505 `__: Using namespace." msgstr "`#2505 `__: Använder namnrymd." -msgid "" -"`#2512 `__: [Dijkstra] " -"Removing duplicate code on Dijkstra." +msgid "`#2512 `__: [Dijkstra] Removing duplicate code on Dijkstra." msgstr "`#2512 `__: [Dijkstra] Borttagning av duplicerad kod på Dijkstra." -msgid "" -"`#2517 `__: Astar code " -"simplification." +msgid "`#2517 `__: Astar code simplification." msgstr "`#2517 `__: Förenkling av Astar-kod." -msgid "" -"`#2521 `__: Dijkstra " -"code simplification." +msgid "`#2521 `__: Dijkstra code simplification." msgstr "`#2521 `__: Förenkling av Dijkstra-kod." -msgid "" -"`#2522 `__: bdAstar code " -"simplification." +msgid "`#2522 `__: bdAstar code simplification." msgstr "`#2522 `__: Förenkling av bdAstar-koden." -msgid "" -"`#2490 `__: Automatic " -"page history links." +msgid "`#2490 `__: Automatic page history links." msgstr "`#2490 `__: Automatiska länkar till sidhistorik." msgid "..rubric:: Standardize SQL" msgstr "..rubric:: Standardize SQL" -msgid "" -"`#2555 `__: Standardize " -"deprecated messages" +msgid "`#2555 `__: Standardize deprecated messages" msgstr "`#2555 `__: Standardisera föråldrade meddelanden" -msgid "" -"On new internal function: do not use named parameters and default parameters." -msgstr "" -"För nya interna funktioner: använd inte namngivna parametrar och " -"standardparametrar." +msgid "On new internal function: do not use named parameters and default parameters." +msgstr "För nya interna funktioner: använd inte namngivna parametrar och standardparametrar." msgid "pgRouting 3.5" msgstr "pgRouting 3.5" @@ -18667,10 +13880,7 @@ msgstr "pgRouting 3.5" msgid "pgRouting 3.5.1 Release Notes" msgstr "pgRouting 3.5.1 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.5.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.5.1 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.5.1 `__" msgid "Documentation fixes" @@ -18694,22 +13904,16 @@ msgstr "använder bootstrap_version 2 eftersom 3+ inte gör dropdowns" msgid "Issue fixes" msgstr "Problemkorrigeringar" -msgid "" -"`#2565 `__: " -"pgr_lengauerTarjanDominatorTree triggers an assertion" +msgid "`#2565 `__: pgr_lengauerTarjanDominatorTree triggers an assertion" msgstr "`#2565 `__: pgr_lengauerTarjanDominatorTree utlöser ett påstående" msgid "SQL enhancements" msgstr "Förbättringar av SQL" -msgid "" -"`#2561 `__: Not use " -"wildcards on SQL" +msgid "`#2561 `__: Not use wildcards on SQL" msgstr "`#2561 `__: Använd inte jokertecken i SQL" -msgid "" -"`#2559 `__: pgtap test " -"using sampledata" +msgid "`#2559 `__: pgtap test using sampledata" msgstr "`#2559 `__: pgtap-test med sampledata" msgid "Build fixes" @@ -18727,10 +13931,7 @@ msgstr "Gruppering av rubriker för postgres-läsare" msgid "pgRouting 3.5.0 Release Notes" msgstr "pgRouting 3.5.0 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.5.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.5.0 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.5.0 `__" msgid "Dijkstra" @@ -18742,66 +13943,35 @@ msgstr "pgRouting 3.4" msgid "pgRouting 3.4.2 Release Notes" msgstr "pgRouting 3.4.2 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.4.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.4.2 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.4.2 `__" -msgid "" -"`#2394 `__: pgr_bdAstar " -"accumulates heuristic cost in visited node cost." -msgstr "" -"`#2394 `__: pgr_bdAstar " -"ackumulerar heuristisk kostnad i besökt nodkostnad." +msgid "`#2394 `__: pgr_bdAstar accumulates heuristic cost in visited node cost." +msgstr "`#2394 `__: pgr_bdAstar ackumulerar heuristisk kostnad i besökt nodkostnad." -msgid "" -"`#2427 `__: " -"pgr_createVerticesTable & pgr_createTopology, variable should be of type " -"Record." -msgstr "" -"`#2427 `__: " -"pgr_createVerticesTable & pgr_createTopology, variabeln ska vara av typen " -"Record." +msgid "`#2427 `__: pgr_createVerticesTable & pgr_createTopology, variable should be of type Record." +msgstr "`#2427 `__: pgr_createVerticesTable & pgr_createTopology, variabeln ska vara av typen Record." msgid "pgRouting 3.4.1 Release Notes" msgstr "pgRouting 3.4.1 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.4.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.4.1 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.4.1 `__" -msgid "" -"`#2401 `__: pgRouting " -"3.4.0 do not build docs when sphinx is too low or missing" -msgstr "" -"`#2401 `__: pgRouting " -"3.4.0 bygger inte dokument när sphinx är för låg eller saknas" +msgid "`#2401 `__: pgRouting 3.4.0 do not build docs when sphinx is too low or missing" +msgstr "`#2401 `__: pgRouting 3.4.0 bygger inte dokument när sphinx är för låg eller saknas" -msgid "" -"`#2398 `__: v3.4.0 does " -"not upgrade from 3.3.3" -msgstr "" -"`#2398 `__: v3.4.0 " -"uppgraderar inte från 3.3.3" +msgid "`#2398 `__: v3.4.0 does not upgrade from 3.3.3" +msgstr "`#2398 `__: v3.4.0 uppgraderar inte från 3.3.3" msgid "pgRouting 3.4.0 Release Notes" msgstr "pgRouting 3.4.0 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.4.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.4.0 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.4.0 `__" -msgid "" -"`#1891 `__: pgr_ksp " -"doesn't give all correct shortest path" -msgstr "" -"`#1891 `__: pgr_ksp ger " -"inte alla korrekta kortaste vägar" +msgid "`#1891 `__: pgr_ksp doesn't give all correct shortest path" +msgstr "`#1891 `__: pgr_ksp ger inte alla korrekta kortaste vägar" msgid "New proposed functions." msgstr "Nya föreslagna funktioner." @@ -18881,51 +14051,31 @@ msgstr "pgRouting 3.3" msgid "pgRouting 3.3.5 Release Notes" msgstr "pgRouting 3.3.5 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.5 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.5 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.3.5 `__" msgid "pgRouting 3.3.4 Release Notes" msgstr "pgRouting 3.3.4 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.4 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.4 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.3.4 `__" -msgid "" -"`#2400 `__: pgRouting " -"3.3.3 does not build in focal" -msgstr "" -"`#2400 `__: pgRouting " -"3.3.3 kan inte byggas i fokal" +msgid "`#2400 `__: pgRouting 3.3.3 does not build in focal" +msgstr "`#2400 `__: pgRouting 3.3.3 kan inte byggas i fokal" msgid "pgRouting 3.3.3 Release Notes" msgstr "pgRouting 3.3.3 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.3 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.3.3 `__" -msgid "" -"Ignoring optional boolean parameter, as the algorithm works only for " -"undirected graphs." -msgstr "" -"Ignorerar den valfria booleska parametern, eftersom algoritmen endast " -"fungerar för oriktade grafer." +msgid "Ignoring optional boolean parameter, as the algorithm works only for undirected graphs." +msgstr "Ignorerar den valfria booleska parametern, eftersom algoritmen endast fungerar för oriktade grafer." msgid "pgRouting 3.3.2 Release Notes" msgstr "pgRouting 3.3.2 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.2 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.3.2 `__" msgid "Revised documentation" @@ -18950,9 +14100,7 @@ msgid "``geom`` instead of ``the_geom``" msgstr "``geom`` i stället för ``the_geom``" msgid "Avoiding usage of functions that modify indexes, columns etc on tables." -msgstr "" -"Undvika användning av funktioner som modifierar index, kolumner etc. i " -"tabeller." +msgstr "Undvika användning av funktioner som modifierar index, kolumner etc. i tabeller." msgid "Using ``pgr_extractVertices`` to create a routing topology" msgstr "Använda ``pgr_extractVertices`` för att skapa en routningstopologi" @@ -18960,93 +14108,47 @@ msgstr "Använda ``pgr_extractVertices`` för att skapa en routningstopologi" msgid "Restructure of the pgRouting concepts page." msgstr "Omstrukturering av sidan med pgRouting-koncept." -msgid "" -"`#2276 `__: " -"edgeDisjointPaths issues with start_vid and combinations" -msgstr "" -"`#2276 `__: " -"edgeDisjointPaths-problem med start_vid och kombinationer" +msgid "`#2276 `__: edgeDisjointPaths issues with start_vid and combinations" +msgstr "`#2276 `__: edgeDisjointPaths-problem med start_vid och kombinationer" -msgid "" -"`#2312 `__: " -"pgr_extractVertices error when target is not BIGINT" -msgstr "" -"`#2312 `__: " -"pgr_extractVertices fel när målet inte är BIGINT" +msgid "`#2312 `__: pgr_extractVertices error when target is not BIGINT" +msgstr "`#2312 `__: pgr_extractVertices fel när målet inte är BIGINT" -msgid "" -"`#2357 `__: Apply clang-" -"tidy performance-*" -msgstr "" -"`#2357 `__: Tillämpa " -"clang-tidy prestanda-*" +msgid "`#2357 `__: Apply clang-tidy performance-*" +msgstr "`#2357 `__: Tillämpa clang-tidy prestanda-*" msgid "pgRouting 3.3.1 Release Notes" msgstr "pgRouting 3.3.1 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.1 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.3.1 `__" -msgid "" -"`#2216 `__: Warnings " -"when using clang" -msgstr "" -"`#2216 `__: Varningar " -"vid användning av clang" +msgid "`#2216 `__: Warnings when using clang" +msgstr "`#2216 `__: Varningar vid användning av clang" -msgid "" -"`#2266 `__: Error " -"processing restrictions" -msgstr "" -"`#2266 `__: Fel vid " -"bearbetning av restriktioner" +msgid "`#2266 `__: Error processing restrictions" +msgstr "`#2266 `__: Fel vid bearbetning av restriktioner" msgid "pgRouting 3.3.0 Release Notes" msgstr "pgRouting 3.3.0 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.0 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.3.0 `__" -msgid "" -"`#2057 `__: trspViaEdges " -"columns in different order" -msgstr "" -"`#2057 `__: trspViaEdges-" -"kolumner i olika ordning" +msgid "`#2057 `__: trspViaEdges columns in different order" +msgstr "`#2057 `__: trspViaEdges-kolumner i olika ordning" -msgid "" -"`#2087 `__: " -"pgr_extractVertices to proposed" -msgstr "" -"`#2087 `__: " -"pgr_extractVertices till förslag" +msgid "`#2087 `__: pgr_extractVertices to proposed" +msgstr "`#2087 `__: pgr_extractVertices till förslag" -msgid "" -"`#2201 `__: " -"pgr_depthFirstSearch to proposed" -msgstr "" -"`#2201 `__: " -"pgr_depthFirstSearch till proposed" +msgid "`#2201 `__: pgr_depthFirstSearch to proposed" +msgstr "`#2201 `__: pgr_depthFirstSearch till proposed" -msgid "" -"`#2202 `__: " -"pgr_sequentialVertexColoring to proposed" -msgstr "" -"`#2202 `__: " -"pgr_sequentialVertexColoring till föreslagen" +msgid "`#2202 `__: pgr_sequentialVertexColoring to proposed" +msgstr "`#2202 `__: pgr_sequentialVertexColoring till föreslagen" -msgid "" -"`#2203 `__: " -"pgr_dijkstraNear and pgr_dijkstraNearCost to proposed" -msgstr "" -"`#2203 `__: " -"pgr_dijkstraNear och pgr_dijkstraNearCost till föreslagna" +msgid "`#2203 `__: pgr_dijkstraNear and pgr_dijkstraNearCost to proposed" +msgstr "`#2203 `__: pgr_dijkstraNear och pgr_dijkstraNearCost till föreslagna" msgid "Coloring" msgstr "Färgläggning" @@ -19096,51 +14198,29 @@ msgstr "pgRouting 3.2" msgid "pgRouting 3.2.2 Release Notes" msgstr "pgRouting 3.2.2 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.2.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.2.2 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.2.2 `__" -msgid "" -"`#2093 `__: Compilation " -"on Visual Studio" -msgstr "" -"`#2093 `__: Kompilering " -"i Visual Studio" +msgid "`#2093 `__: Compilation on Visual Studio" +msgstr "`#2093 `__: Kompilering i Visual Studio" -msgid "" -"`#2189 `__: Build error " -"on RHEL 7" -msgstr "" -"`#2189 `__: Byggfel på " -"RHEL 7" +msgid "`#2189 `__: Build error on RHEL 7" +msgstr "`#2189 `__: Byggfel på RHEL 7" msgid "pgRouting 3.2.1 Release Notes" msgstr "pgRouting 3.2.1 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.2.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.2.1 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.2.1 `__" -msgid "" -"`#1883 `__: " -"pgr_TSPEuclidean crashes connection on Windows" -msgstr "" -"`#1883 `__: " -"pgr_TSPEuclidean kraschar anslutningen i Windows" +msgid "`#1883 `__: pgr_TSPEuclidean crashes connection on Windows" +msgstr "`#1883 `__: pgr_TSPEuclidean kraschar anslutningen i Windows" msgid "The solution is to use Boost::graph::metric_tsp_approx" msgstr "Lösningen är att använda Boost::graph::metric_tsp_approx" -msgid "" -"To not break user's code the optional parameters related to the TSP " -"Annaeling are ignored" -msgstr "" -"För att inte bryta användarens kod ignoreras de valfria parametrarna som är " -"relaterade till TSP Annaeling" +msgid "To not break user's code the optional parameters related to the TSP Annaeling are ignored" +msgstr "För att inte bryta användarens kod ignoreras de valfria parametrarna som är relaterade till TSP Annaeling" msgid "The function with the annaeling optional parameters is deprecated" msgstr "Funktionen med de valfria parametrarna annaeling är föråldrad" @@ -19148,18 +14228,11 @@ msgstr "Funktionen med de valfria parametrarna annaeling är föråldrad" msgid "pgRouting 3.2.0 Release Notes" msgstr "pgRouting 3.2.0 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.2.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.2.0 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.2.0 `__" -msgid "" -"`#1850 `__: Change Boost " -"min version to 1.56" -msgstr "" -"`#1850 `__: Ändra Boost " -"min-version till 1.56" +msgid "`#1850 `__: Change Boost min version to 1.56" +msgstr "`#1850 `__: Ändra Boost min-version till 1.56" msgid "Removing support for Boost v1.53, v1.54 & v1.55" msgstr "Borttagande av stöd för Boost v1.53, v1.54 & v1.55" @@ -19191,10 +14264,7 @@ msgstr "pgRouting 3.1" msgid "pgRouting 3.1.4 Release Notes" msgstr "pgRouting 3.1.4 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.1.4 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.4 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.1.4 `__" msgid "Issues fixes" @@ -19203,128 +14273,64 @@ msgstr "Problemlösningar" msgid "pgRouting 3.1.3 Release Notes" msgstr "pgRouting 3.1.3 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.1.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.3 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.1.3 `__" -msgid "" -"`#1825 `__: Boost " -"versions are not honored" -msgstr "" -"`#1825 `__: Boost-" -"versioner respekteras inte" +msgid "`#1825 `__: Boost versions are not honored" +msgstr "`#1825 `__: Boost-versioner respekteras inte" -msgid "" -"`#1849 `__: Boost 1.75.0 " -"geometry \"point_xy.hpp\" build error on macOS environment" -msgstr "" -"`#1849 `__: Boost 1.75.0 " -"geometri \"point_xy.hpp\" byggfel i macOS-miljö" +msgid "`#1849 `__: Boost 1.75.0 geometry \"point_xy.hpp\" build error on macOS environment" +msgstr "`#1849 `__: Boost 1.75.0 geometri \"point_xy.hpp\" byggfel i macOS-miljö" -msgid "" -"`#1861 `__: vrp " -"functions crash server" -msgstr "" -"`#1861 `__: vrp-" -"funktioner kraschar server" +msgid "`#1861 `__: vrp functions crash server" +msgstr "`#1861 `__: vrp-funktioner kraschar server" msgid "pgRouting 3.1.2 Release Notes" msgstr "pgRouting 3.1.2 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.1.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.2 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.1.2 `__" -msgid "" -"`#1304 `__: FreeBSD 12 " -"64-bit crashes on pgr_vrOneDepot tests Experimental Function" -msgstr "" -"`#1304 `__: FreeBSD 12 " -"64-bit kraschar på pgr_vrOneDepot-tester Experimentell funktion" +msgid "`#1304 `__: FreeBSD 12 64-bit crashes on pgr_vrOneDepot tests Experimental Function" +msgstr "`#1304 `__: FreeBSD 12 64-bit kraschar på pgr_vrOneDepot-tester Experimentell funktion" -msgid "" -"`#1356 `__: tools/" -"testers/pg_prove_tests.sh fails when PostgreSQL port is not passed" -msgstr "" -"`#1356 `__: tools/" -"testers/pg_prove_tests.sh misslyckas när PostgreSQL-porten inte är godkänd" +msgid "`#1356 `__: tools/testers/pg_prove_tests.sh fails when PostgreSQL port is not passed" +msgstr "`#1356 `__: tools/testers/pg_prove_tests.sh misslyckas när PostgreSQL-porten inte är godkänd" -msgid "" -"`#1725 `__: Server crash " -"on pgr_pickDeliver and pgr_vrpOneDepot on openbsd" -msgstr "" -"`#1725 `__: Serverkrasch " -"på pgr_pickDeliver och pgr_vrpOneDepot på openbsd" +msgid "`#1725 `__: Server crash on pgr_pickDeliver and pgr_vrpOneDepot on openbsd" +msgstr "`#1725 `__: Serverkrasch på pgr_pickDeliver och pgr_vrpOneDepot på openbsd" -msgid "" -"`#1760 `__: TSP server " -"crash on ubuntu 20.04 #1760" -msgstr "" -"`#1760 `__: TSP-" -"serverkrasch på ubuntu 20.04 #1760" +msgid "`#1760 `__: TSP server crash on ubuntu 20.04 #1760" +msgstr "`#1760 `__: TSP-serverkrasch på ubuntu 20.04 #1760" -msgid "" -"`#1770 `__: Remove " -"warnings when using clang compiler" -msgstr "" -"`#1770 `__: Ta bort " -"varningar vid användning av clang-kompilatorn" +msgid "`#1770 `__: Remove warnings when using clang compiler" +msgstr "`#1770 `__: Ta bort varningar vid användning av clang-kompilatorn" msgid "pgRouting 3.1.1 Release Notes" msgstr "pgRouting 3.1.1 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.1.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.1 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.1.1 `__" -msgid "" -"`#1733 `__: pgr_bdAstar " -"fails when source or target vertex does not exist in the graph" -msgstr "" -"`#1733 `__: pgr_bdAstar " -"misslyckas när käll- eller målvertexen inte finns i grafen" +msgid "`#1733 `__: pgr_bdAstar fails when source or target vertex does not exist in the graph" +msgstr "`#1733 `__: pgr_bdAstar misslyckas när käll- eller målvertexen inte finns i grafen" -msgid "" -"`#1647 `__: Linear " -"Contraction contracts self loops" -msgstr "" -"`#1647 `__: Linjär " -"sammandragning kontrakterar självloopar" +msgid "`#1647 `__: Linear Contraction contracts self loops" +msgstr "`#1647 `__: Linjär sammandragning kontrakterar självloopar" -msgid "" -"`#1640 `__: " -"pgr_withPoints fails when points_sql is empty" -msgstr "" -"`#1640 `__: " -"pgr_withPoints misslyckas när points_sql är tom" +msgid "`#1640 `__: pgr_withPoints fails when points_sql is empty" +msgstr "`#1640 `__: pgr_withPoints misslyckas när points_sql är tom" -msgid "" -"`#1616 `__: Path " -"evaluation on C++ not updated before the results go back to C" -msgstr "" -"`#1616 `__: " -"Banutvärdering på C++ uppdateras inte innan resultaten går tillbaka till C" +msgid "`#1616 `__: Path evaluation on C++ not updated before the results go back to C" +msgstr "`#1616 `__: Banutvärdering på C++ uppdateras inte innan resultaten går tillbaka till C" -msgid "" -"`#1300 `__: " -"pgr_chinesePostman crash on test data" -msgstr "" -"`#1300 `__: " -"pgr_chinesePostman kraschar på testdata" +msgid "`#1300 `__: pgr_chinesePostman crash on test data" +msgstr "`#1300 `__: pgr_chinesePostman kraschar på testdata" msgid "pgRouting 3.1.0 Release Notes" msgstr "pgRouting 3.1.0 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.1.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.0 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.1.0 `__" msgid "pgr_dijkstra(combinations)" @@ -19345,19 +14351,13 @@ msgstr "pgRouting 3.0" msgid "pgRouting 3.0.6 Release Notes" msgstr "pgRouting 3.0.6 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.6 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.6 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.0.6 `__" msgid "pgRouting 3.0.5 Release Notes" msgstr "pgRouting 3.0.5 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.5 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.5 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.0.5 `__" msgid "Backport issue fixes" @@ -19366,106 +14366,59 @@ msgstr "Fixar problem med backport" msgid "pgRouting 3.0.4 Release Notes" msgstr "pgRouting 3.0.4 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.4 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.4 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.0.4 `__" msgid "pgRouting 3.0.3 Release Notes" msgstr "pgRouting 3.0.3 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.3 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.0.3 `__" msgid "pgRouting 3.0.2 Release Notes" msgstr "pgRouting 3.0.2 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.2 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.0.2 `__" -msgid "" -"`#1378 `__: Visual " -"Studio build failing" -msgstr "" -"`#1378 `__: Visual " -"Studio-byggnad misslyckas" +msgid "`#1378 `__: Visual Studio build failing" +msgstr "`#1378 `__: Visual Studio-byggnad misslyckas" msgid "pgRouting 3.0.1 Release Notes" msgstr "pgRouting 3.0.1 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.1 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.0.1 `__" -msgid "" -"`#232 `__: Honor client " -"cancel requests in C /C++ code" -msgstr "" -"`#232 `__: Uppfylla " -"begäran om avbrytande av klient i C/C++-kod" +msgid "`#232 `__: Honor client cancel requests in C /C++ code" +msgstr "`#232 `__: Uppfylla begäran om avbrytande av klient i C/C++-kod" msgid "pgRouting 3.0.0 Release Notes" msgstr "pgRouting 3.0.0 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.0 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.0.0 `__" msgid "Fixed Issues" msgstr "Korrigerade problem" -msgid "" -"`#1153 `__: Renamed " -"pgr_eucledianTSP to pgr_TSPeuclidean" -msgstr "" -"`#1153 `__: Bytte namn " -"på pgr_eucledianTSP till pgr_TSPeuclidean" +msgid "`#1153 `__: Renamed pgr_eucledianTSP to pgr_TSPeuclidean" +msgstr "`#1153 `__: Bytte namn på pgr_eucledianTSP till pgr_TSPeuclidean" -msgid "" -"`#1188 `__: Removed CGAL " -"dependency" -msgstr "" -"`#1188 `__: Borttaget " -"CGAL-beroende" +msgid "`#1188 `__: Removed CGAL dependency" +msgstr "`#1188 `__: Borttaget CGAL-beroende" -msgid "" -"`#1002 `__: Fixed " -"contraction issues:" -msgstr "" -"`#1002 `__: Fixade " -"problem med sammandragning:" +msgid "`#1002 `__: Fixed contraction issues:" +msgstr "`#1002 `__: Fixade problem med sammandragning:" -msgid "" -"`#1004 `__: Contracts " -"when forbidden vertices do not belong to graph" -msgstr "" -"`#1004 `__: Kontrakt när " -"förbjudna toppar inte tillhör grafen" +msgid "`#1004 `__: Contracts when forbidden vertices do not belong to graph" +msgstr "`#1004 `__: Kontrakt när förbjudna toppar inte tillhör grafen" -msgid "" -"`#1005 `__: Intermideate " -"results eliminated" -msgstr "" -"`#1005 `__: Medelmåttiga " -"resultat eliminerade" +msgid "`#1005 `__: Intermideate results eliminated" +msgstr "`#1005 `__: Medelmåttiga resultat eliminerade" -msgid "" -"`#1006 `__: No loss of " -"information" -msgstr "" -"`#1006 `__: Ingen " -"förlust av information" +msgid "`#1006 `__: No loss of information" +msgstr "`#1006 `__: Ingen förlust av information" msgid "New Functions" msgstr "Nya funktioner" @@ -19719,58 +14672,37 @@ msgstr "pgRouting 2.6" msgid "pgRouting 2.6.3 Release Notes" msgstr "pgRouting 2.6.3 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.6.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.3 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.6.3 `__" -msgid "" -"`#1219 `__: Implicit " -"cast for via_path integer to text" +msgid "`#1219 `__: Implicit cast for via_path integer to text" msgstr "`#1219 `__: Implicit kast för via_path heltal till text" -msgid "" -"`#1193 `__: Fixed " -"pgr_pointsAsPolygon breaking when comparing strings in WHERE clause" +msgid "`#1193 `__: Fixed pgr_pointsAsPolygon breaking when comparing strings in WHERE clause" msgstr "`#1193 `__: Fixat att pgr_pointsAsPolygon bröts när strängar jämfördes i WHERE-satsen" -msgid "" -"`#1185 `__: Improve " -"FindPostgreSQL.cmake" +msgid "`#1185 `__: Improve FindPostgreSQL.cmake" msgstr "`#1185 `__: Förbättra FindPostgreSQL.cmake" msgid "pgRouting 2.6.2 Release Notes" msgstr "pgRouting 2.6.2 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.6.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.2 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.6.2 `__" -msgid "" -"`#1152 `__: Fixes " -"driving distance when vertex is not part of the graph" +msgid "`#1152 `__: Fixes driving distance when vertex is not part of the graph" msgstr "`#1152 `__: Fixar körsträcka när vertex inte är en del av grafen" -msgid "" -"`#1098 `__: Fixes " -"windows test" +msgid "`#1098 `__: Fixes windows test" msgstr "`#1098 `__: Åtgärdar Windows-test" -msgid "" -"`#1165 `__: Fixes build " -"for python3 and perl5" +msgid "`#1165 `__: Fixes build for python3 and perl5" msgstr "`#1165 `__: Fixar byggandet för python3 och perl5" msgid "pgRouting 2.6.1 Release Notes" msgstr "pgRouting 2.6.1 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.6.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.1 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.6.1 `__" msgid "Fixes server crash on several functions." @@ -19851,21 +14783,14 @@ msgstr "Åtgärdat ett fel på Astar och bdAstar." msgid "pgRouting 2.6.0 Release Notes" msgstr "pgRouting 2.6.0 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.6.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.0 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.6.0 `__" msgid "pgr_lineGraphFull" msgstr "pgr_lineGraphFull" -msgid "" -"Fix pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean[,text])" -msgstr "" -"Fix pgr_trsp(text,heltal,dubbel precision,heltal,dubbel precision,boolean," -"boolean[,text])" +msgid "Fix pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean[,text])" +msgstr "Fix pgr_trsp(text,heltal,dubbel precision,heltal,dubbel precision,boolean,boolean[,text])" msgid "without restrictions" msgstr "utan begränsningar" @@ -19885,12 +14810,8 @@ msgstr "samtal original trsp kod" msgid "Internal code" msgstr "Intern kod" -msgid "" -"Cleaned the internal code of trsp(text,integer,integer,boolean,boolean [, " -"text])" -msgstr "" -"Rensade den interna koden för trsp(text,heltal,heltal,boolean,boolean [, " -"text])" +msgid "Cleaned the internal code of trsp(text,integer,integer,boolean,boolean [, text])" +msgstr "Rensade den interna koden för trsp(text,heltal,heltal,boolean,boolean [, text])" msgid "Removed the use of pointers" msgstr "Tog bort användningen av pekare" @@ -19907,10 +14828,7 @@ msgstr "pgRouting 2.5" msgid "pgRouting 2.5.5 Release Notes" msgstr "pgRouting 2.5.5 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.5 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.5 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.5.5 `__" msgid "Fixes driving distance when vertex is not part of the graph" @@ -19925,35 +14843,22 @@ msgstr "Fixar byggsätt för python3 och perl5" msgid "pgRouting 2.5.4 Release Notes" msgstr "pgRouting 2.5.4 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.4 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.4 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.5.4 `__" msgid "pgRouting 2.5.3 Release Notes" msgstr "pgRouting 2.5.3 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.3 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.5.3 `__" -msgid "" -"Fix for postgresql 11: Removed a compilation error when compiling with " -"postgreSQL" -msgstr "" -"Fix för postgresql 11: Tog bort ett kompileringsfel vid kompilering med " -"postgreSQL" +msgid "Fix for postgresql 11: Removed a compilation error when compiling with postgreSQL" +msgstr "Fix för postgresql 11: Tog bort ett kompileringsfel vid kompilering med postgreSQL" msgid "pgRouting 2.5.2 Release Notes" msgstr "pgRouting 2.5.2 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.2 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.5.2 `__" msgid "Fix for postgresql 10.1: Removed a compiler condition" @@ -19962,10 +14867,7 @@ msgstr "Fix för postgresql 10.1: Tog bort ett kompilatorvillkor" msgid "pgRouting 2.5.1 Release Notes" msgstr "pgRouting 2.5.1 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.1 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.5.1 `__" msgid "Fixed prerequisite minimum version of: cmake" @@ -19974,10 +14876,7 @@ msgstr "Fixad förkunskapskrav för minsta version av: cmake" msgid "pgRouting 2.5.0 Release Notes" msgstr "pgRouting 2.5.0 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.0 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.5.0 `__" msgid "enhancement:" @@ -19999,8 +14898,7 @@ msgid "Parameter names changed" msgstr "Namn på parametrar ändrade" msgid "The many version results are the union of the One to One version" -msgstr "" -"Resultaten för många versioner är en sammanslagning av One to One-versionen" +msgstr "Resultaten för många versioner är en sammanslagning av One to One-versionen" msgid "New Signatures" msgstr "Nya signaturer" @@ -20041,10 +14939,7 @@ msgstr "pgRouting 2.4" msgid "pgRouting 2.4.2 Release Notes" msgstr "pgRouting 2.4.2 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.4.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.4.2 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.4.2 `__" msgid "Improvement" @@ -20056,18 +14951,13 @@ msgstr "Fungerar för postgreSQL 10" msgid "Fixed: Unexpected error column \"cname\"" msgstr "Fast: Oväntad felkolumn \"cname\"" -msgid "" -"Replace __linux__ with __GLIBC__ for glibc-specific headers and functions" -msgstr "" -"Ersätt __linux__ med __GLIBC__ för glibc-specifika rubriker och funktioner" +msgid "Replace __linux__ with __GLIBC__ for glibc-specific headers and functions" +msgstr "Ersätt __linux__ med __GLIBC__ för glibc-specifika rubriker och funktioner" msgid "pgRouting 2.4.1 Release Notes" msgstr "pgRouting 2.4.1 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.4.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.4.1 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.4.1 `__" msgid "Fixed compiling error on macOS" @@ -20079,10 +14969,7 @@ msgstr "Villkorligt fel på pgr_withPoints" msgid "pgRouting 2.4.0 Release Notes" msgstr "pgRouting 2.4.0 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.4.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.4.0 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.4.0 `__" msgid "Deprecated signatures." @@ -20101,8 +14988,7 @@ msgid "pgr_withPointsKSP: fixed ordering" msgstr "pgr_withPointsKSP: fixed ordering" msgid "TRSP original code is used with no changes on the compilation warnings" -msgstr "" -"TRSP:s originalkod används utan ändringar i sammanställningsvarningarna" +msgstr "TRSP:s originalkod används utan ändringar i sammanställningsvarningarna" msgid "pgRouting 2.3" msgstr "pgRouting 2.3" @@ -20110,10 +14996,7 @@ msgstr "pgRouting 2.3" msgid "pgRouting 2.3.2 Release Notes" msgstr "pgRouting 2.3.2 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.3.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.3.2 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.3.2 `__" msgid "Fixed pgr_gsoc_vrppdtw crash when all orders fit on one truck." @@ -20131,10 +15014,7 @@ msgstr "Fixad tvetydighet på seq" msgid "pgRouting 2.3.1 Release Notes" msgstr "pgRouting 2.3.1 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.3.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.3.1 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.3.1 `__" msgid "Leaks on proposed max_flow functions" @@ -20149,10 +15029,7 @@ msgstr "Typer diskrepans på pgr_createVerticesTable" msgid "pgRouting 2.3.0 Release Notes" msgstr "pgRouting 2.3.0 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.3.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.3.0 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.3.0 `__" msgid "pgr_eucledianTSP" @@ -20224,10 +15101,7 @@ msgstr "pgRouting 2.2" msgid "pgRouting 2.2.4 Release Notes" msgstr "pgRouting 2.2.4 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.2.4 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.4 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.2.4 `__" msgid "Bogus uses of extern \"C\"" @@ -20242,10 +15116,7 @@ msgstr "Regressionsfel pgr_nodeNetwork" msgid "pgRouting 2.2.3 Release Notes" msgstr "pgRouting 2.2.3 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.2.3 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.3 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.2.3 `__" msgid "Fixed compatibility issues with PostgreSQL 9.6." @@ -20254,10 +15125,7 @@ msgstr "Fixade kompatibilitetsproblem med PostgreSQL 9.6." msgid "pgRouting 2.2.2 Release Notes" msgstr "pgRouting 2.2.2 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.2.2 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.2 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.2.2 `__" msgid "Fixed regression error on pgr_drivingDistance" @@ -20266,10 +15134,7 @@ msgstr "Åtgärdat regressionsfel på pgr_drivingDistance" msgid "pgRouting 2.2.1 Release Notes" msgstr "pgRouting 2.2.1 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.2.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.1 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.2.1 `__" msgid "Server crash fix on pgr_alphaShape" @@ -20281,10 +15146,7 @@ msgstr "Buggfix för funktionerna i With Points-familjen" msgid "pgRouting 2.2.0 Release Notes" msgstr "pgRouting 2.2.0 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.2.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.0 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.2.0 `__" msgid "Improvements" @@ -20374,10 +15236,7 @@ msgstr "pgRouting 2.1" msgid "pgRouting 2.1.0 Release Notes" msgstr "pgRouting 2.1.0 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.1.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.1.0 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.1.0 `__" msgid "Refactored" @@ -20386,54 +15245,29 @@ msgstr "Refaktoriserad" msgid "pgr_dijkstra(One to One)" msgstr "pgr_dijkstra(One to One)" -msgid "" -"pgr_alphaShape function now can generate better (multi)polygon with holes " -"and alpha parameter." -msgstr "" -"pgr_alphaShape function now can generate better (multi)polygon with holes " -"and alpha parameter." +msgid "pgr_alphaShape function now can generate better (multi)polygon with holes and alpha parameter." +msgstr "pgr_alphaShape function now can generate better (multi)polygon with holes and alpha parameter." -msgid "" -"Proposed functions from Steve Woodbridge, (Classified as Convenience by the " -"author.)" -msgstr "" -"Föreslagna funktioner från Steve Woodbridge, (Klassificeras som bekvämlighet " -"av författaren.)" +msgid "Proposed functions from Steve Woodbridge, (Classified as Convenience by the author.)" +msgstr "Föreslagna funktioner från Steve Woodbridge, (Klassificeras som bekvämlighet av författaren.)" -msgid "" -"pgr_pointToEdgeNode - convert a point geometry to a vertex_id based on " -"closest edge." -msgstr "" -"pgr_pointToEdgeNode - convert a point geometry to a vertex_id based on " -"closest edge." +msgid "pgr_pointToEdgeNode - convert a point geometry to a vertex_id based on closest edge." +msgstr "pgr_pointToEdgeNode - convert a point geometry to a vertex_id based on closest edge." -msgid "" -"pgr_flipEdges - flip the edges in an array of geometries so the connect end " -"to end." -msgstr "" -"pgr_flipEdges - flip the edges in an array of geometries so the connect end " -"to end." +msgid "pgr_flipEdges - flip the edges in an array of geometries so the connect end to end." +msgstr "pgr_flipEdges - flip the edges in an array of geometries so the connect end to end." -msgid "" -"pgr_textToPoints - convert a string of x,y;x,y;... locations into point " -"geometries." -msgstr "" -"pgr_textToPoints - convert a string of x,y;x,y;... locations into point " -"geometries." +msgid "pgr_textToPoints - convert a string of x,y;x,y;... locations into point geometries." +msgstr "pgr_textToPoints - convert a string of x,y;x,y;... locations into point geometries." -msgid "" -"pgr_pointsToVids - convert an array of point geometries into vertex ids." -msgstr "" -"pgr_pointsToVids - convert an array of point geometries into vertex ids." +msgid "pgr_pointsToVids - convert an array of point geometries into vertex ids." +msgstr "pgr_pointsToVids - convert an array of point geometries into vertex ids." msgid "pgr_pointsToDMatrix - Create a distance matrix from an array of points." -msgstr "" -"pgr_pointsToDMatrix - Create a distance matrix from an array of points." +msgstr "pgr_pointsToDMatrix - Create a distance matrix from an array of points." -msgid "" -"pgr_vidsToDMatrix - Create a distance matrix from an array of vertix_id." -msgstr "" -"pgr_vidsToDMatrix - Create a distance matrix from an array of vertix_id." +msgid "pgr_vidsToDMatrix - Create a distance matrix from an array of vertix_id." +msgstr "pgr_vidsToDMatrix - Create a distance matrix from an array of vertix_id." msgid "Added proposed functions from GSoc Projects:" msgstr "Lagt till föreslagna funktioner från GSoc Projects:" @@ -20504,12 +15338,8 @@ msgstr "tillåta valfritt heltal i id:et" msgid "allow any-numerical on the cost/reverse_cost columns" msgstr "tillåta valfri numerisk i kostnads-/omvända_kostnadskolumnerna" -msgid "" -"Instead of generating many libraries: - All functions are encapsulated in " -"one library - The library has the prefix 2-1-0" -msgstr "" -"Istället för att generera många bibliotek: - Alla funktioner är inkapslade i " -"ett bibliotek - Biblioteket har prefixet 2-1-0" +msgid "Instead of generating many libraries: - All functions are encapsulated in one library - The library has the prefix 2-1-0" +msgstr "Istället för att generera många bibliotek: - Alla funktioner är inkapslade i ett bibliotek - Biblioteket har prefixet 2-1-0" msgid "pgRouting 2.0" msgstr "pgRouting 2.0" @@ -20517,10 +15347,7 @@ msgstr "pgRouting 2.0" msgid "pgRouting 2.0.1 Release Notes" msgstr "pgRouting 2.0.1 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.0.1 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.0.1 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.0.1 `__" msgid "Minor bug fixes." @@ -20532,20 +15359,11 @@ msgstr "Inga uppgifter om buggfixarna sparades." msgid "pgRouting 2.0.0 Release Notes" msgstr "pgRouting 2.0.0 Release Notes" -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.0.0 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.0.0 `__" msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.0.0 `__" -msgid "" -"With the release of pgRouting 2.0.0 the library has abandoned backwards " -"compatibility to `pgRouting 1.0`_ releases. The main Goals for this release " -"are:" -msgstr "" -"Med lanseringen av pgRouting 2.0.0 har biblioteket övergett " -"bakåtkompatibilitet till `pgRouting 1.0`_-utgåvor. Huvudmålen för denna " -"utgåva är:" +msgid "With the release of pgRouting 2.0.0 the library has abandoned backwards compatibility to `pgRouting 1.0`_ releases. The main Goals for this release are:" +msgstr "Med lanseringen av pgRouting 2.0.0 har biblioteket övergett bakåtkompatibilitet till `pgRouting 1.0`_-utgåvor. Huvudmålen för denna utgåva är:" msgid "Major restructuring of pgRouting." msgstr "Stor omstrukturering av pgRouting." @@ -20577,28 +15395,17 @@ msgstr "Och gjort det enklare för flera utvecklare att bidra." msgid "Important Changes" msgstr "Viktiga förändringar" -msgid "" -"Graph Analytics - tools for detecting and fixing connection some problems in " -"a graph" -msgstr "" -"Graph Analytics - verktyg för att upptäcka och åtgärda vissa problem med " -"kopplingar i en graf" +msgid "Graph Analytics - tools for detecting and fixing connection some problems in a graph" +msgstr "Graph Analytics - verktyg för att upptäcka och åtgärda vissa problem med kopplingar i en graf" msgid "A collection of useful utility functions" msgstr "En samling användbara nyttofunktioner" -msgid "" -"Two new All Pairs Short Path algorithms (pgr_apspJohnson, pgr_apspWarshall)" -msgstr "" -"Två nya algoritmer för korta vägar för alla par (pgr_apspJohnson, " -"pgr_apspWarshall)" +msgid "Two new All Pairs Short Path algorithms (pgr_apspJohnson, pgr_apspWarshall)" +msgstr "Två nya algoritmer för korta vägar för alla par (pgr_apspJohnson, pgr_apspWarshall)" -msgid "" -"Bi-directional Dijkstra and A-star search algorithms (pgr_bdAstar, " -"pgr_bdDijkstra)" -msgstr "" -"Dubbelriktade Dijkstra- och A-star-sökalgoritmer (pgr_bdAstar, " -"pgr_bdDijkstra)" +msgid "Bi-directional Dijkstra and A-star search algorithms (pgr_bdAstar, pgr_bdDijkstra)" +msgstr "Dubbelriktade Dijkstra- och A-star-sökalgoritmer (pgr_bdAstar, pgr_bdDijkstra)" msgid "One to many nodes search (pgr_kDijkstra)" msgstr "Sökning från en till många noder (pgr_kDijkstra)" @@ -20606,12 +15413,8 @@ msgstr "Sökning från en till många noder (pgr_kDijkstra)" msgid "K alternate paths shortest path (pgr_ksp)" msgstr "K alternativa vägar kortaste vägen (pgr_ksp)" -msgid "" -"New TSP solver that simplifies the code and the build process (pgr_tsp), " -"dropped \"Gaul Library\" dependency" -msgstr "" -"Ny TSP-lösare som förenklar koden och byggprocessen (pgr_tsp), har tagit " -"bort beroendet av \"Gaul Library\"" +msgid "New TSP solver that simplifies the code and the build process (pgr_tsp), dropped \"Gaul Library\" dependency" +msgstr "Ny TSP-lösare som förenklar koden och byggprocessen (pgr_tsp), har tagit bort beroendet av \"Gaul Library\"" msgid "Turn Restricted shortest path (pgr_trsp) that replaces Shooting Star" msgstr "Turn Begränsad kortaste väg (pgr_trsp) som ersätter Shooting Star" @@ -20619,27 +15422,17 @@ msgstr "Turn Begränsad kortaste väg (pgr_trsp) som ersätter Shooting Star" msgid "Dropped support for Shooting Star" msgstr "Slopat stöd för Shooting Star" -msgid "" -"Built a test infrastructure that is run before major code changes are " -"checked in" -msgstr "" -"Byggt upp en testinfrastruktur som körs innan större kodändringar checkas in" +msgid "Built a test infrastructure that is run before major code changes are checked in" +msgstr "Byggt upp en testinfrastruktur som körs innan större kodändringar checkas in" -msgid "" -"Tested and fixed most all of the outstanding bugs reported against 1.x that " -"existing in the 2.0-dev code base." -msgstr "" -"Testat och åtgärdat de flesta av de utestående buggarna som rapporterats mot " -"1.x och som finns i 2.0-dev-kodbasen." +msgid "Tested and fixed most all of the outstanding bugs reported against 1.x that existing in the 2.0-dev code base." +msgstr "Testat och åtgärdat de flesta av de utestående buggarna som rapporterats mot 1.x och som finns i 2.0-dev-kodbasen." msgid "Improved build process for Windows" msgstr "Förbättrad byggprocess för Windows" -msgid "" -"Automated testing on Linux and Windows platforms trigger by every commit" -msgstr "" -"Automatiserad testning på Linux- och Windows-plattformar som utlöses av " -"varje åtagande" +msgid "Automated testing on Linux and Windows platforms trigger by every commit" +msgstr "Automatiserad testning på Linux- och Windows-plattformar som utlöses av varje åtagande" msgid "Modular library design" msgstr "Modulär biblioteksdesign" @@ -20677,17 +15470,8 @@ msgstr "pgRouting 1" msgid "pgRouting 1.0" msgstr "pgRouting 1.0" -msgid "" -"To see the issues closed by this release see the `Git closed issues for 1.x " -"`_ on Github. The following release notes have been copied " -"from the previous ``RELEASE_NOTES`` file and are kept as a reference." -msgstr "" -"För att se de problem som stängts av denna utgåva, se `Git stängda problem " -"för 1.x `_ på Github. Följande release " -"notes har kopierats från den tidigare filen ``RELEASE_NOTES`` och behålls " -"som en referens." +msgid "To see the issues closed by this release see the `Git closed issues for 1.x `_ on Github. The following release notes have been copied from the previous ``RELEASE_NOTES`` file and are kept as a reference." +msgstr "För att se de problem som stängts av denna utgåva, se `Git stängda problem för 1.x `_ på Github. Följande release notes har kopierats från den tidigare filen ``RELEASE_NOTES`` och behålls som en referens." msgid "Changes for release 1.05" msgstr "Ändringar för version 1.05" @@ -20740,11 +15524,8 @@ msgstr "Ändringar för version 0.9.9" msgid "PostgreSQL 8.2 support" msgstr "Stöd för PostgreSQL 8.2" -msgid "" -"Shortest path functions return empty result if they could not find any path" -msgstr "" -"Kortaste vägen-funktioner returnerar ett tomt resultat om de inte kunde " -"hitta någon väg" +msgid "Shortest path functions return empty result if they could not find any path" +msgstr "Kortaste vägen-funktioner returnerar ett tomt resultat om de inte kunde hitta någon väg" msgid "Changes for release 0.9.8" msgstr "Ändringar för version 0.9.8" @@ -20756,8 +15537,7 @@ msgid "Directed shortest path functions were added" msgstr "Directed shortest path-funktioner lades till" msgid "routing_postgis.sql was modified to use dijkstra in TSP search" -msgstr "" -"routing_postgis.sql modifierades för att använda dijkstra i TSP-sökning" +msgstr "routing_postgis.sql modifierades för att använda dijkstra i TSP-sökning" msgid "Function Families" msgstr "Funktionsfamiljer" @@ -20765,14 +15545,8 @@ msgstr "Funktionsfamiljer" msgid "Sample Data" msgstr "Exempeldata" -msgid "" -"The documentation provides very simple example queries based on a small " -"sample network that resembles a city. To be able to execute the majority of " -"the examples queries, follow the instructions below." -msgstr "" -"Dokumentationen innehåller mycket enkla exempel på frågor som baseras på ett " -"litet exempelnätverk som liknar en stad. Följ instruktionerna nedan för att " -"kunna utföra de flesta av exempelfrågorna." +msgid "The documentation provides very simple example queries based on a small sample network that resembles a city. To be able to execute the majority of the examples queries, follow the instructions below." +msgstr "Dokumentationen innehåller mycket enkla exempel på frågor som baseras på ett litet exempelnätverk som liknar en stad. Följ instruktionerna nedan för att kunna utföra de flesta av exempelfrågorna." msgid "Main graph" msgstr "Huvudgraf" @@ -20783,32 +15557,14 @@ msgstr "En graf består av en uppsättning kanter och en uppsättning hörn." msgid "The following city is to be inserted into the database:" msgstr "Följande stad ska läggas in i databasen:" -msgid "" -"Information known at this point is the geometry of the edges, cost values, " -"capacity values, category values and some locations that are not in the " -"graph." -msgstr "" -"Information som är känd vid denna tidpunkt är geometrin för kanterna, " -"kostnadsvärden, kapacitetsvärden, kategorivärden och vissa platser som inte " -"finns i grafen." +msgid "Information known at this point is the geometry of the edges, cost values, capacity values, category values and some locations that are not in the graph." +msgstr "Information som är känd vid denna tidpunkt är geometrin för kanterna, kostnadsvärden, kapacitetsvärden, kategorivärden och vissa platser som inte finns i grafen." -msgid "" -"The process to have working topology starts by inserting the edges. After " -"that everything else is calculated." -msgstr "" -"Processen för att få en fungerande topologi börjar med att lägga in " -"kanterna. Efter det beräknas allt annat." +msgid "The process to have working topology starts by inserting the edges. After that everything else is calculated." +msgstr "Processen för att få en fungerande topologi börjar med att lägga in kanterna. Efter det beräknas allt annat." -msgid "" -"The database design for the documentation of pgRouting, keeps in the same " -"row 2 segments, one in the direction of the geometry and the second in the " -"opposite direction. Therefore some information has the ``reverse_`` prefix " -"which corresponds to the segment on the opposite direction of the geometry." -msgstr "" -"Databasdesignen för dokumentationen av pgRouting, håller i samma rad 2 " -"segment, ett i geometrins riktning och det andra i motsatt riktning. Därför " -"har viss information prefixet ``reverse_`` som motsvarar segmentet i " -"geometrins motsatta riktning." +msgid "The database design for the documentation of pgRouting, keeps in the same row 2 segments, one in the direction of the geometry and the second in the opposite direction. Therefore some information has the ``reverse_`` prefix which corresponds to the segment on the opposite direction of the geometry." +msgstr "Databasdesignen för dokumentationen av pgRouting, håller i samma rad 2 segment, ett i geometrins riktning och det andra i motsatt riktning. Därför har viss information prefixet ``reverse_`` som motsvarar segmentet i geometrins motsatta riktning." msgid "Identifier of the starting vertex of the geometry ``geom``." msgstr "Identifierare av startpunkten för geometrin ``geom``." @@ -20837,22 +15593,14 @@ msgstr "``reverse_category``" msgid ":math:`x` coordinate of the starting vertex of the geometry." msgstr ":math:`x` coordinate of the starting vertex of the geometry." -msgid "" -"For convenience it is saved on the table but can be calculated as " -"``ST_X(ST_StartPoint(geom))``." -msgstr "" -"För enkelhetens skull sparas den i tabellen, men kan beräknas som " -"``ST_X(ST_StartPoint(geom))``." +msgid "For convenience it is saved on the table but can be calculated as ``ST_X(ST_StartPoint(geom))``." +msgstr "För enkelhetens skull sparas den i tabellen, men kan beräknas som ``ST_X(ST_StartPoint(geom))``." msgid ":math:`y` coordinate of the ending vertex of the geometry." msgstr ":math:`y` coordinate of the ending vertex of the geometry." -msgid "" -"For convenience it is saved on the table but can be calculated as " -"``ST_Y(ST_EndPoint(geom))``." -msgstr "" -"För enkelhetens skull sparas den i tabellen, men kan beräknas som " -"``ST_Y(ST_EndPoint(geom))``." +msgid "For convenience it is saved on the table but can be calculated as ``ST_Y(ST_EndPoint(geom))``." +msgstr "För enkelhetens skull sparas den i tabellen, men kan beräknas som ``ST_Y(ST_EndPoint(geom))``." msgid "The geometry of the segments." msgstr "Segmentens geometri." @@ -20860,27 +15608,17 @@ msgstr "Segmentens geometri." msgid "Starting on PostgreSQL 12::" msgstr "Börjar på PostgreSQL 12::" -msgid "" -"Optionally indexes on different columns can be created. The recommendation " -"is to have" -msgstr "" -"Eventuellt kan index på olika kolumner skapas. Rekommendationen är att ha" +msgid "Optionally indexes on different columns can be created. The recommendation is to have" +msgstr "Eventuellt kan index på olika kolumner skapas. Rekommendationen är att ha" msgid "``id`` indexed." msgstr "``id`` indexerad." -msgid "" -"``source`` and ``target`` columns indexed to speed up pgRouting queries." -msgstr "" -"kolumnerna ``källa`` och ``mål`` indexerade för att snabba upp pgRouting-" -"frågor." +msgid "``source`` and ``target`` columns indexed to speed up pgRouting queries." +msgstr "kolumnerna ``källa`` och ``mål`` indexerade för att snabba upp pgRouting-frågor." -msgid "" -"``geom`` indexed to speed up geometry processes that might be needed in the " -"front end." -msgstr "" -"``geom`` indexerad för att påskynda geometriska processer som kan behövas i " -"frontend." +msgid "``geom`` indexed to speed up geometry processes that might be needed in the front end." +msgstr "``geom`` indexerad för att påskynda geometriska processer som kan behövas i frontend." msgid "For this small example the indexes are skipped, except for ``id``" msgstr "I det här lilla exemplet hoppas indexen över, utom för ``id``" @@ -20891,31 +15629,17 @@ msgstr "Data om kanter" msgid "Inserting into the database the information of the edges:" msgstr "Lägga in informationen om kanterna i databasen:" -msgid "" -"Negative values on the cost, capacity and category means that the edge do " -"not exist." -msgstr "" -"Negativa värden på kostnad, kapacitet och kategori innebär att kanten inte " -"existerar." +msgid "Negative values on the cost, capacity and category means that the edge do not exist." +msgstr "Negativa värden på kostnad, kapacitet och kategori innebär att kanten inte existerar." msgid "Vertices" msgstr "Hörn" -msgid "" -"The vertex information is calculated based on the identifier of the edge and " -"the geometry and saved on a table. Saving all the information provided by :" -"doc:`pgr_extractVertices`:" -msgstr "" -"Vertexinformationen beräknas utifrån kantidentifieraren och geometrin och " -"sparas i en tabell. Sparar all information som tillhandahålls av :doc:" -"`pgr_extractVertices`:" +msgid "The vertex information is calculated based on the identifier of the edge and the geometry and saved on a table. Saving all the information provided by :doc:`pgr_extractVertices`:" +msgstr "Vertexinformationen beräknas utifrån kantidentifieraren och geometrin och sparas i en tabell. Sparar all information som tillhandahålls av :doc:`pgr_extractVertices`:" -msgid "" -"In this case the because the ``CREATE`` statement was not used, the " -"definition of an index on the table is needed." -msgstr "" -"I det här fallet, eftersom ``CREATE``-satsen inte användes, behövs " -"definitionen av ett index på tabellen." +msgid "In this case the because the ``CREATE`` statement was not used, the definition of an index on the table is needed." +msgstr "I det här fallet, eftersom ``CREATE``-satsen inte användes, behövs definitionen av ett index på tabellen." msgid "The structure of the table is:" msgstr "Tabellens struktur är:" @@ -20926,22 +15650,14 @@ msgstr "Data om vertikaler" msgid "The saved information of the vertices is:" msgstr "Den sparade informationen om topparna är:" -msgid "" -"Here is where adding more columns to the vertices table can be done. " -"Additional columns names and types will depend on the application." -msgstr "" -"Här kan du lägga till fler kolumner i tabellen vertices. Namn och typer på " -"ytterligare kolumner beror på tillämpningen." +msgid "Here is where adding more columns to the vertices table can be done. Additional columns names and types will depend on the application." +msgstr "Här kan du lägga till fler kolumner i tabellen vertices. Namn och typer på ytterligare kolumner beror på tillämpningen." msgid "The topology" msgstr "Topologin" -msgid "" -"This queries based on the vertices data create a topology by filling the " -"``source`` and ``target`` columns in the edges table." -msgstr "" -"Denna fråga baseras på toppdata och skapar en topologi genom att fylla i " -"kolumnerna \"källa\" och \"mål\" i tabellen \"kanter\"." +msgid "This queries based on the vertices data create a topology by filling the ``source`` and ``target`` columns in the edges table." +msgstr "Denna fråga baseras på toppdata och skapar en topologi genom att fylla i kolumnerna \"källa\" och \"mål\" i tabellen \"kanter\"." msgid "Topology data" msgstr "Topologidata" @@ -20952,19 +15668,11 @@ msgstr "Punkter utanför grafen" msgid "Support tables" msgstr "Stödbord" -msgid "" -"Many functions can be used with a combinations of ``(source, target)`` pairs " -"when wanting a route from ``source`` to ``target``." -msgstr "" -"Många funktioner kan användas med kombinationer av paren ``(källa, mål)`` " -"när man vill ha en rutt från ``källa`` till ``mål``." +msgid "Many functions can be used with a combinations of ``(source, target)`` pairs when wanting a route from ``source`` to ``target``." +msgstr "Många funktioner kan användas med kombinationer av paren ``(källa, mål)`` när man vill ha en rutt från ``källa`` till ``mål``." -msgid "" -"For convenience of this documentation, some combinations will be stored on a " -"table:" -msgstr "" -"För att underlätta denna dokumentation kommer vissa kombinationer att lagras " -"på en tabell:" +msgid "For convenience of this documentation, some combinations will be stored on a table:" +msgstr "För att underlätta denna dokumentation kommer vissa kombinationer att lagras på en tabell:" msgid "Inserting the data:" msgstr "Infoga data:" @@ -20993,11 +15701,8 @@ msgstr "Klicka på grafen för att förstora den." msgid "Directed graph with ``cost`` and ``reverse_cost``" msgstr "Riktad graf med ``kostnad`` och ``omvänd_kostnad``" -msgid "" -"When working with city networks, this is recommended for point of view of " -"vehicles." -msgstr "" -"När du arbetar med stadsnät rekommenderas detta för fordonens synvinkel." +msgid "When working with city networks, this is recommended for point of view of vehicles." +msgstr "När du arbetar med stadsnät rekommenderas detta för fordonens synvinkel." msgid "Directed, with cost and reverse_cost" msgstr "Riktad, med kostnad och omvänd_kostnad" @@ -21005,11 +15710,8 @@ msgstr "Riktad, med kostnad och omvänd_kostnad" msgid "Undirected graph with ``cost`` and ``reverse_cost``" msgstr "Oriktad graf med ``kostnad`` och ``omvända_kostnader``" -msgid "" -"When working with city networks, this is recommended for point of view of " -"pedestrians." -msgstr "" -"När du arbetar med stadsnät rekommenderas detta för fotgängarnas synvinkel." +msgid "When working with city networks, this is recommended for point of view of pedestrians." +msgstr "När du arbetar med stadsnät rekommenderas detta för fotgängarnas synvinkel." msgid "Undirected, with cost and reverse cost" msgstr "Ostyrd, med kostnad och omvänd kostnad" @@ -21032,150 +15734,71 @@ msgstr "Hämta och leverera data" msgid "Spanning Tree - Category" msgstr "Spanning Tree - Kategori" -msgid "" -"A spanning tree of an undirected graph is a tree that includes all the " -"vertices of G with the minimum possible number of edges." -msgstr "" -"Ett spännträd för en odelad graf är ett träd som innehåller alla hörn i G " -"med minsta möjliga antal kanter." +msgid "A spanning tree of an undirected graph is a tree that includes all the vertices of G with the minimum possible number of edges." +msgstr "Ett spännträd för en odelad graf är ett träd som innehåller alla hörn i G med minsta möjliga antal kanter." -msgid "" -"For a disconnected graph, there there is no single tree, but a spanning " -"forest, consisting of a spanning tree of each connected component." -msgstr "" -"För en frånkopplad graf finns det inte ett enda träd, utan en spänningsskog, " -"som består av ett spänningsträd för varje ansluten komponent." +msgid "For a disconnected graph, there there is no single tree, but a spanning forest, consisting of a spanning tree of each connected component." +msgstr "För en frånkopplad graf finns det inte ett enda träd, utan en spänningsskog, som består av ett spänningsträd för varje ansluten komponent." msgid "Characteristics:" msgstr "Kännetecken:" -msgid "" -"pgRouting community support is available through the `pgRouting website " -"`_, `documentation `_, tutorials, mailing lists and others. If you’re looking " -"for :ref:`commercial support `, find below a list of " -"companies providing pgRouting development and consulting services." -msgstr "" -"pgRouting community support är tillgängligt via `pgRouting webbplats " -"`_, `dokumentation `_, handledning, e-postlistor och andra. Om du letar efter :" -"ref:`kommersiellt stöd `, hittar du nedan en lista över " -"företag som tillhandahåller pgRouting-utveckling och konsulttjänster." +msgid "pgRouting community support is available through the `pgRouting website `_, `documentation `_, tutorials, mailing lists and others. If you’re looking for :ref:`commercial support `, find below a list of companies providing pgRouting development and consulting services." +msgstr "pgRouting community support är tillgängligt via `pgRouting webbplats `_, `dokumentation `_, handledning, e-postlistor och andra. Om du letar efter :ref:`kommersiellt stöd `, hittar du nedan en lista över företag som tillhandahåller pgRouting-utveckling och konsulttjänster." msgid "Reporting Problems" msgstr "Rapportering av problem" -msgid "" -"Bugs are reported and managed in an `issue tracker `_. Please follow these steps:" -msgstr "" -"Buggar rapporteras och hanteras i en `issue tracker `_. Vänligen följ dessa steg:" +msgid "Bugs are reported and managed in an `issue tracker `_. Please follow these steps:" +msgstr "Buggar rapporteras och hanteras i en `issue tracker `_. Vänligen följ dessa steg:" -msgid "" -"Search the tickets to see if your problem has already been reported. If so, " -"add any extra context you might have found, or at least indicate that you " -"too are having the problem. This will help us prioritize common issues." -msgstr "" -"Sök bland ärendena för att se om ditt problem redan har rapporterats. Om så " -"är fallet kan du lägga till extra sammanhang som du kan ha hittat, eller " -"åtminstone ange att du också har problemet. Detta hjälper oss att prioritera " -"vanliga problem." +msgid "Search the tickets to see if your problem has already been reported. If so, add any extra context you might have found, or at least indicate that you too are having the problem. This will help us prioritize common issues." +msgstr "Sök bland ärendena för att se om ditt problem redan har rapporterats. Om så är fallet kan du lägga till extra sammanhang som du kan ha hittat, eller åtminstone ange att du också har problemet. Detta hjälper oss att prioritera vanliga problem." -msgid "" -"If your problem is unreported, create a `new issue `__ for it." -msgstr "" -"Om ditt problem inte har rapporterats, skapa en ny fråga `__ för det." +msgid "If your problem is unreported, create a `new issue `__ for it." +msgstr "Om ditt problem inte har rapporterats, skapa en ny fråga `__ för det." -msgid "" -"In your report include explicit instructions to replicate your issue. The " -"best tickets include the exact SQL necessary to replicate a problem." -msgstr "" -"I din rapport inkluderar du uttryckliga instruktioner för att replikera ditt " -"problem. De bästa ärendena innehåller den exakta SQL som krävs för att " -"replikera ett problem." +msgid "In your report include explicit instructions to replicate your issue. The best tickets include the exact SQL necessary to replicate a problem." +msgstr "I din rapport inkluderar du uttryckliga instruktioner för att replikera ditt problem. De bästa ärendena innehåller den exakta SQL som krävs för att replikera ett problem." -msgid "" -"If you can test older versions of PostGIS for your problem, please do. On " -"your ticket, note the earliest version the problem appears." -msgstr "" -"Om du kan testa äldre versioner av PostGIS för ditt problem, vänligen gör " -"det. Notera den tidigaste versionen som problemet uppträder i ditt ärende." +msgid "If you can test older versions of PostGIS for your problem, please do. On your ticket, note the earliest version the problem appears." +msgstr "Om du kan testa äldre versioner av PostGIS för ditt problem, vänligen gör det. Notera den tidigaste versionen som problemet uppträder i ditt ärende." -msgid "" -"For the versions where you can replicate the problem, note the operating " -"system and version of pgRouting, PostGIS and PostgreSQL." -msgstr "" -"För de versioner där du kan replikera problemet, notera operativsystemet och " -"versionen av pgRouting, PostGIS och PostgreSQL." +msgid "For the versions where you can replicate the problem, note the operating system and version of pgRouting, PostGIS and PostgreSQL." +msgstr "För de versioner där du kan replikera problemet, notera operativsystemet och versionen av pgRouting, PostGIS och PostgreSQL." -msgid "" -"It is recommended to use the following wrapper on the problem to pin point " -"the step that is causing the problem." -msgstr "" -"Vi rekommenderar att du använder följande wrapper på problemet för att hitta " -"det steg som orsakar problemet." +msgid "It is recommended to use the following wrapper on the problem to pin point the step that is causing the problem." +msgstr "Vi rekommenderar att du använder följande wrapper på problemet för att hitta det steg som orsakar problemet." msgid "Mailing List, Matrix, GIS StackExchange" msgstr "Mailinglista, matris, GIS StackExchange" -msgid "" -"There are two mailing lists for pgRouting hosted on OSGeo discourse server:" +msgid "There are two mailing lists for pgRouting hosted on OSGeo discourse server:" msgstr "Det finns två e-postlistor för pgRouting som är värd på OSGeo diskurserver:" -msgid "" -"User mailing list: https://discourse.osgeo.org/c/pgrouting/pgrouting-users/" +msgid "User mailing list: https://discourse.osgeo.org/c/pgrouting/pgrouting-users/" msgstr "E-postlista för användare: https://discourse.osgeo.org/c/pgrouting/pgrouting-users/" -msgid "" -"Developer mailing list: https://discourse.osgeo.org/c/pgrouting/pgrouting-" -"dev/" -msgstr "" -"E-postlista för utvecklare: https://discourse.osgeo.org/c/pgrouting/" -"pgrouting-dev/" +msgid "Developer mailing list: https://discourse.osgeo.org/c/pgrouting/pgrouting-dev/" +msgstr "E-postlista för utvecklare: https://discourse.osgeo.org/c/pgrouting/pgrouting-dev/" msgid "Subscribe: https://discourse.osgeo.org/g/pgrouting-dev" msgstr "Prenumerera: https://discourse.osgeo.org/g/pgrouting-dev" -msgid "" -"For general questions and topics about how to use pgRouting, please write to " -"the user mailing list." -msgstr "" -"För allmänna frågor och ämnen om hur du använder pgRouting, vänligen skriv " -"till e-postlistan för användare." +msgid "For general questions and topics about how to use pgRouting, please write to the user mailing list." +msgstr "För allmänna frågor och ämnen om hur du använder pgRouting, vänligen skriv till e-postlistan för användare." -msgid "" -"If you want to chat with fellow pgRouting users and contributors, you can " -"join our matrix channel: `pgRouting matrix channel `_." +msgid "If you want to chat with fellow pgRouting users and contributors, you can join our matrix channel: `pgRouting matrix channel `_." msgstr "Om du vill chatta med andra pgRouting-användare och bidragsgivare kan du gå med i vår matriskanal: `pgRouting matriskanal `_." -msgid "" -"You can also ask at `GIS StackExchange `_ " -"and tag the question with ``pgrouting``. Find all questions tagged with " -"``pgrouting`` under https://gis.stackexchange.com/questions/tagged/pgrouting " -"or subscribe to the `pgRouting questions feed `_." -msgstr "" -"Du kan också ställa frågan på `GIS StackExchange `_ och märka frågan med ``pgrouting``. Hitta alla frågor taggade med " -"``pgrouting`` under https://gis.stackexchange.com/questions/tagged/pgrouting " -"eller prenumerera på `pgRouting questions feed `_." +msgid "You can also ask at `GIS StackExchange `_ and tag the question with ``pgrouting``. Find all questions tagged with ``pgrouting`` under https://gis.stackexchange.com/questions/tagged/pgrouting or subscribe to the `pgRouting questions feed `_." +msgstr "Du kan också ställa frågan på `GIS StackExchange `_ och märka frågan med ``pgrouting``. Hitta alla frågor taggade med ``pgrouting`` under https://gis.stackexchange.com/questions/tagged/pgrouting eller prenumerera på `pgRouting questions feed `_." msgid "Commercial Support" msgstr "Kommersiellt stöd" -msgid "" -"For users who require professional support, development and consulting " -"services, consider contacting any of the following organizations, which have " -"significantly contributed to the development of pgRouting:" -msgstr "" -"För användare som behöver professionell support, utveckling och " -"konsulttjänster kan du överväga att kontakta någon av följande " -"organisationer, som har bidragit väsentligt till utvecklingen av pgRouting:" +msgid "For users who require professional support, development and consulting services, consider contacting any of the following organizations, which have significantly contributed to the development of pgRouting:" +msgstr "För användare som behöver professionell support, utveckling och konsulttjänster kan du överväga att kontakta någon av följande organisationer, som har bidragit väsentligt till utvecklingen av pgRouting:" msgid "**Company**" msgstr "**Company**" @@ -21210,12 +15833,8 @@ msgstr "https://www.osgeo.org/service-providers/netlab/" msgid "Transformation - Family of functions" msgstr "Transformation - Familj av funktioner" -msgid "" -"This family of functions is used for transforming a given input graph :math:" -"`G(V,E)` into a new graph :math:`G'(V',E')`." -msgstr "" -"Denna familj av funktioner används för att omvandla en given indatagraf :" -"math:`G(V,E)` till en ny graf :math:`G'(V',E')`." +msgid "This family of functions is used for transforming a given input graph :math:`G(V,E)` into a new graph :math:`G'(V',E')`." +msgstr "Denna familj av funktioner används för att omvandla en given indatagraf :math:`G(V,E)` till en ny graf :math:`G'(V',E')`." msgid "Traversal - Family of functions" msgstr "Traversal - Familj av funktioner" @@ -21229,19 +15848,11 @@ msgstr "Via - Kategori" msgid "This category intends to solve the general problem:" msgstr "Denna kategori avser att lösa det allmänna problemet:" -msgid "" -"Given a graph and a list of vertices, find the shortest path between :math:" -"`vertex_i` and :math:`vertex_{i+1}` for all vertices" -msgstr "" -"Givet en graf och en lista med toppar, hitta den kortaste vägen mellan :math:" -"`vertex_i` och :math:`vertex_{i+1}` för alla toppar" +msgid "Given a graph and a list of vertices, find the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all vertices" +msgstr "Givet en graf och en lista med toppar, hitta den kortaste vägen mellan :math:`vertex_i` och :math:`vertex_{i+1}` för alla toppar" -msgid "" -"In other words, find a continuous route that visits all the vertices in the " -"order given." -msgstr "" -"Med andra ord, hitta en kontinuerlig rutt som besöker alla toppar i den " -"ordning som anges." +msgid "In other words, find a continuous route that visits all the vertices in the order given." +msgstr "Med andra ord, hitta en kontinuerlig rutt som besöker alla toppar i den ordning som anges." msgid "path" msgstr "väg" @@ -21258,12 +15869,8 @@ msgstr "är en sekvens av **vägar**" msgid "**Used in:**" msgstr "**Används i:**" -msgid "" -"Besides the compulsory parameters each function has, there are optional " -"parameters that exist due to the kind of function." -msgstr "" -"Förutom de obligatoriska parametrar som varje funktion har, finns det " -"valfria parametrar som beror på vilken typ av funktion det är." +msgid "Besides the compulsory parameters each function has, there are optional parameters that exist due to the kind of function." +msgstr "Förutom de obligatoriska parametrar som varje funktion har, finns det valfria parametrar som beror på vilken typ av funktion det är." msgid "Used in all Via functions" msgstr "Används i alla Via-funktioner" @@ -21277,46 +15884,20 @@ msgstr "withPoints - Kategori" msgid "When points are added to the graph." msgstr "När punkter läggs till i diagrammet." -msgid "" -"The **with points** category modifies the graph on the fly by adding points " -"on edges as required by the `Points SQL`_ query." -msgstr "" -"Kategorin **with points** ändrar grafen i farten genom att lägga till " -"punkter på kanterna enligt vad som krävs av SQL-frågan `Points`_." +msgid "The **with points** category modifies the graph on the fly by adding points on edges as required by the `Points SQL`_ query." +msgstr "Kategorin **with points** ändrar grafen i farten genom att lägga till punkter på kanterna enligt vad som krävs av SQL-frågan `Points`_." -msgid "" -"The functions within this category give the ability to process between " -"arbitrary points located outside the original graph." -msgstr "" -"Funktionerna inom denna kategori ger möjlighet att bearbeta mellan " -"godtyckliga punkter utanför den ursprungliga grafen." +msgid "The functions within this category give the ability to process between arbitrary points located outside the original graph." +msgstr "Funktionerna inom denna kategori ger möjlighet att bearbeta mellan godtyckliga punkter utanför den ursprungliga grafen." -msgid "" -"This category of functions was thought for routing vehicles, but might as " -"well work for some other application not involving vehicles." -msgstr "" -"Denna kategori av funktioner var tänkt för att dirigera fordon, men kan lika " -"gärna fungera för någon annan applikation som inte involverar fordon." +msgid "This category of functions was thought for routing vehicles, but might as well work for some other application not involving vehicles." +msgstr "Denna kategori av funktioner var tänkt för att dirigera fordon, men kan lika gärna fungera för någon annan applikation som inte involverar fordon." -msgid "" -"When given a point identifier ``pid`` that its being mapped to an edge with " -"an identifier ``edge_id``, with a fraction from the source to the target " -"along the edge ``fraction`` and some additional information about which side " -"of the edge the point is on ``side``, then processing from arbitrary points " -"can be done on fixed networks." -msgstr "" -"När man får en punktidentifierare ``pid`` som mappas till en kant med en " -"identifierare ``edge_id``, med en fraktion från källan till målet längs " -"kanten ``fraktion`` och lite ytterligare information om vilken sida av " -"kanten punkten ligger på ``side``, kan bearbetning från godtyckliga punkter " -"göras på fasta nätverk." +msgid "When given a point identifier ``pid`` that its being mapped to an edge with an identifier ``edge_id``, with a fraction from the source to the target along the edge ``fraction`` and some additional information about which side of the edge the point is on ``side``, then processing from arbitrary points can be done on fixed networks." +msgstr "När man får en punktidentifierare ``pid`` som mappas till en kant med en identifierare ``edge_id``, med en fraktion från källan till målet längs kanten ``fraktion`` och lite ytterligare information om vilken sida av kanten punkten ligger på ``side``, kan bearbetning från godtyckliga punkter göras på fasta nätverk." -msgid "" -"All this functions consider as many traits from the \"real world\" as " -"possible:" -msgstr "" -"Alla dessa funktioner tar hänsyn till så många egenskaper från den " -"\"verkliga världen\" som möjligt:" +msgid "All this functions consider as many traits from the \"real world\" as possible:" +msgstr "Alla dessa funktioner tar hänsyn till så många egenskaper från den \"verkliga världen\" som möjligt:" msgid "Kind of graph:" msgstr "Typ av graf:" @@ -21330,8 +15911,7 @@ msgstr "**Omdirigerad** graf" msgid "Arriving at the point:" msgstr "Anländer till punkten:" -msgid "" -"Compulsory arrival on the side of the segment where the point is located." +msgid "Compulsory arrival on the side of the segment where the point is located." msgstr "Obligatorisk ankomst på den sida av segmentet där punkten är belägen." msgid "On either side of the segment." @@ -21349,15 +15929,10 @@ msgstr "**Vänster** sida körning" msgid "Some points are:" msgstr "Några punkter är:" -msgid "" -"**Permanent**: for example the set of points of clients stored in a table in " -"the data base." -msgstr "" -"**Permanent**: t.ex. en uppsättning punkter för kunder som lagras i en " -"tabell i databasen." +msgid "**Permanent**: for example the set of points of clients stored in a table in the data base." +msgstr "**Permanent**: t.ex. en uppsättning punkter för kunder som lagras i en tabell i databasen." -msgid "" -"The graph has been modified to permanently have those points as vertices." +msgid "The graph has been modified to permanently have those points as vertices." msgstr "Grafen har ändrats så att den permanent har dessa punkter som hörn." msgid "There is a table on the database that describes the points" @@ -21369,12 +15944,8 @@ msgstr "**Temporal**: till exempel punkt som ges via en webbapplikation" msgid "The numbering of the points are handled with negative sign." msgstr "Numreringen av punkterna hanteras med negativt tecken." -msgid "" -"This sign change is to avoid confusion when there is a vertex with the same " -"identifier as the point identifier." -msgstr "" -"Denna teckenändring är till för att undvika förvirring när det finns en topp " -"med samma identifierare som punktens identifierare." +msgid "This sign change is to avoid confusion when there is a vertex with the same identifier as the point identifier." +msgstr "Denna teckenändring är till för att undvika förvirring när det finns en topp med samma identifierare som punktens identifierare." msgid "Original point identifiers are to be positive." msgstr "Ursprungliga punktidentifierare ska vara positiva." @@ -21394,14 +15965,8 @@ msgstr "negativt tecken är en punkt i `Points SQL`_" msgid "About points" msgstr "Om punkt" -msgid "" -"For this section the following city (see :doc:`sampledata`) some interesting " -"points such as restaurant, supermarket, post office, etc. will be used as " -"example." -msgstr "" -"I detta avsnitt kommer följande stad (se :doc:`sampledata`) att användas som " -"exempel: några intressanta punkter såsom restaurang, snabbköp, postkontor " -"etc." +msgid "For this section the following city (see :doc:`sampledata`) some interesting points such as restaurant, supermarket, post office, etc. will be used as example." +msgstr "I detta avsnitt kommer följande stad (se :doc:`sampledata`) att användas som exempel: några intressanta punkter såsom restaurang, snabbköp, postkontor etc." msgid "The graph is **directed**" msgstr "Grafen är **riktad**" @@ -21412,12 +15977,8 @@ msgstr "Röda pilar visar ``(källa, mål)`` för kanten i kanttabellen" msgid "Blue arrows show the ``(target, source)`` of the edge on the edge table" msgstr "Blå pilar visar ``(mål, källa)`` för kanten i kanttabellen" -msgid "" -"Each point location shows where it is located with relation of the edge " -"``(source, target)``" -msgstr "" -"Varje punktposition visar var den är belägen i förhållande till kanten " -"``(källa, mål)``" +msgid "Each point location shows where it is located with relation of the edge ``(source, target)``" +msgstr "Varje punktposition visar var den är belägen i förhållande till kanten ``(källa, mål)``" msgid "On the right for points **2** and **4**." msgstr "Till höger för punkterna **2** och **4**." @@ -21428,12 +15989,8 @@ msgstr "Till vänster för punkterna **1**, **3** och **5**." msgid "On both sides for point **6**." msgstr "På båda sidor för punkt **6**." -msgid "" -"The representation on the data base follows the `Points SQL`_ description, " -"and for this example:" -msgstr "" -"Representationen på databasen följer `Points SQL`_-beskrivningen, och för " -"detta exempel:" +msgid "The representation on the data base follows the `Points SQL`_ description, and for this example:" +msgstr "Representationen på databasen följer `Points SQL`_-beskrivningen, och för detta exempel:" msgid "Driving side" msgstr "Körning på sidan" @@ -21447,12 +16004,8 @@ msgstr "De kvadrerade topparna är de tillfälliga topparna," msgid "The temporary vertices are added according to the driving side," msgstr "De tillfälliga topparna läggs till enligt körsidan," -msgid "" -"visually showing the differences on how depending on the driving side the " -"data is interpreted." -msgstr "" -"visar visuellt skillnaderna i hur data tolkas beroende på vilken sida som " -"kör." +msgid "visually showing the differences on how depending on the driving side the data is interpreted." +msgstr "visar visuellt skillnaderna i hur data tolkas beroende på vilken sida som kör." msgid "Point **1** located on edge ``(6, 5)``" msgstr "Punkt **1** belägen på kanten ``(6, 5)``" @@ -21502,11 +16055,8 @@ msgstr "Punkt **4** belägen på kanten ``(3, 1)`` och ``(1, 3)``" msgid "Creating temporary vertices" msgstr "Skapa tillfälliga vertikaler" -msgid "" -"This section will demonstrate how a temporary vertex is created internally " -"on the graph." -msgstr "" -"I detta avsnitt visas hur ett tillfälligt toppunkt skapas internt i grafen." +msgid "This section will demonstrate how a temporary vertex is created internally on the graph." +msgstr "I detta avsnitt visas hur ett tillfälligt toppunkt skapas internt i grafen." msgid "Problem" msgstr "Problem" @@ -21532,25 +16082,17 @@ msgstr "Det påverkar bara kanten ``(16, 17)``, därför tas kanten bort." msgid "Create two new edges:" msgstr "Skapa två nya kanter:" -msgid "" -"Edge ``(16, -2)`` with cost ``0.4`` (original cost * fraction == :math:`1 * " -"0.4`)" -msgstr "" -"Kant ``(16, -2)`` med kostnad ``0.4`` (ursprunglig kostnad * fraktion == :" -"math:`1 * 0.4`)" +msgid "Edge ``(16, -2)`` with cost ``0.4`` (original cost * fraction == :math:`1 * 0.4`)" +msgstr "Kant ``(16, -2)`` med kostnad ``0.4`` (ursprunglig kostnad * fraktion == :math:`1 * 0.4`)" msgid "Edge ``(-2, 17)`` with cost ``0.6`` (the remaining cost)" msgstr "Kant ``(-2, 17)`` med kostnad ``0,6`` (den återstående kostnaden)" msgid "The total cost of the additional edges is equal to the original cost." -msgstr "" -"Den totala kostnaden för de extra kanterna är lika stor som den ursprungliga " -"kostnaden." +msgstr "Den totala kostnaden för de extra kanterna är lika stor som den ursprungliga kostnaden." -msgid "" -"If more points are on the same edge, the process is repeated recursevly." -msgstr "" -"Om fler punkter ligger på samma kant upprepas processen om och om igen." +msgid "If more points are on the same edge, the process is repeated recursevly." +msgstr "Om fler punkter ligger på samma kant upprepas processen om och om igen." msgid "On a left hand side driving network" msgstr "På en vänster sida av körfältet" @@ -21564,29 +16106,17 @@ msgstr "Påverkar inte kanten ``(16, 17)``, därför behålls kanten." msgid "It only affects the edge ``(17, 16)``, therefore the edge is removed." msgstr "Det påverkar bara kanten ``(17, 16)``, därför tas kanten bort." -msgid "" -"Work with the original edge ``(16, 17)`` as the fraction is a fraction of " -"the original:" -msgstr "" -"Arbeta med den ursprungliga kanten ``(16, 17)`` eftersom bråkdelen är en " -"bråkdel av den ursprungliga:" +msgid "Work with the original edge ``(16, 17)`` as the fraction is a fraction of the original:" +msgstr "Arbeta med den ursprungliga kanten ``(16, 17)`` eftersom bråkdelen är en bråkdel av den ursprungliga:" msgid "Flip the Edges and add them to the graph:" msgstr "Vänd på kanterna och lägg till dem i grafen:" -msgid "" -"Edge ``(17, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the " -"graph." -msgstr "" -"Kanten ``(17, -2)`` blir ``(-2, 16)`` med kostnaden ``0,4`` och läggs till i " -"grafen." +msgid "Edge ``(17, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the graph." +msgstr "Kanten ``(17, -2)`` blir ``(-2, 16)`` med kostnaden ``0,4`` och läggs till i grafen." -msgid "" -"Edge ``(-2, 16)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the " -"graph." -msgstr "" -"Kanten ``(-2, 16)`` blir ``(17, -2)`` med kostnaden ``0,6`` och läggs till i " -"grafen." +msgid "Edge ``(-2, 16)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the graph." +msgstr "Kanten ``(-2, 16)`` blir ``(17, -2)`` med kostnaden ``0,6`` och läggs till i grafen." msgid "When driving side does not matter" msgstr "När körsidan inte spelar någon roll" @@ -21594,11 +16124,8 @@ msgstr "När körsidan inte spelar någon roll" msgid "Arrival to point ``-2`` can be achieved via vertices **16** or **17**." msgstr "Ankomst till punkt ``-2`` kan uppnås via topparna **16** eller **17**." -msgid "" -"Affects the edges ``(16, 17)`` and ``(17, 16)``, therefore the edges are " -"removed." -msgstr "" -"Påverkar kanterna ``(16, 17)`` och ``(17, 16)``, därför tas kanterna bort." +msgid "Affects the edges ``(16, 17)`` and ``(17, 16)``, therefore the edges are removed." +msgstr "Påverkar kanterna ``(16, 17)`` och ``(17, 16)``, därför tas kanterna bort." msgid "Create four new edges:" msgstr "Skapa fyra nya kanter:" @@ -21612,31 +16139,17 @@ msgstr "Kanten ``(16, -2)`` läggs till i grafen." msgid "Edge ``(-2, 17)`` is added to the graph." msgstr "Kanten ``(-2, 17)`` läggs till i grafen." -msgid "" -"Edge ``(16, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the " -"graph." -msgstr "" -"Kanten ``(16, -2)`` blir ``(-2, 16)`` med kostnaden ``0,4`` och läggs till i " -"grafen." +msgid "Edge ``(16, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the graph." +msgstr "Kanten ``(16, -2)`` blir ``(-2, 16)`` med kostnaden ``0,4`` och läggs till i grafen." -msgid "" -"Edge ``(-2, 17)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the " -"graph." -msgstr "" -"Kanten ``(-2, 17)`` blir ``(17, -2)`` med kostnaden ``0,6`` och läggs till i " -"grafen." +msgid "Edge ``(-2, 17)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the graph." +msgstr "Kanten ``(-2, 17)`` blir ``(17, -2)`` med kostnaden ``0,6`` och läggs till i grafen." msgid "withPoints - Family of functions" msgstr "withPoints - Familj av funktioner" -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 "" -"Denna familj av funktioner tillhör :doc:`withPoints-category` och de " -"funktioner som ingår i dem är på ett eller annat sätt baserade på dijkstra-" -"algoritmen." +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 "Denna familj av funktioner tillhör :doc:`withPoints-category` och de funktioner som ingår i dem är på ett eller annat sätt baserade på dijkstra-algoritmen." msgid "Depending on the name:" msgstr "Beroende på namnet:" @@ -21659,6 +16172,9 @@ msgstr "pgr_withPointsDD is pgr_drivingDistance **with points**" msgid "pgr_withPointsvia is pgr_dijkstraVia **with points**" msgstr "pgr_withPointsvia is pgr_dijkstraVia **with points**" +#~ msgid "``pgr_bellmanFord - Experimental``" +#~ msgstr "``pgr_bellmanFord - Experimentell``" + #~ msgid "It is expected to terminate faster than pgr_aStar" #~ msgstr "Den förväntas avslutas snabbare än pgr_aStar" @@ -21670,9 +16186,7 @@ msgstr "pgr_withPointsvia is pgr_dijkstraVia **with points**" #~ msgstr "För användardokumentation" #, fuzzy -#~ msgid "" -#~ "The translated languages (en, es, sv, zh_Hans) HTML documentation is " -#~ "build by default" +#~ msgid "The translated languages (en, es, sv, zh_Hans) HTML documentation is build by default" #~ msgstr "För användardokumentation" #, fuzzy @@ -21683,513 +16197,250 @@ msgstr "pgr_withPointsvia is pgr_dijkstraVia **with points**" #~ msgstr "Nya experimentella funktioner" #, fuzzy -#~ msgid "" -#~ "`#2913 `__: " -#~ "pgr_DAGshortestPath" -#~ msgstr "" -#~ "`#2913 `__ " -#~ "pgr_DAGshortestPath" +#~ msgid "`#2913 `__: pgr_DAGshortestPath" +#~ msgstr "`#2913 `__ pgr_DAGshortestPath" #, fuzzy -#~ msgid "" -#~ "`#2909 `__: " -#~ "pgr_turnRestrictedPaths" -#~ msgstr "" -#~ "`#2909 `__ " -#~ "pgr_turnRestrictedPaths" - -#~ msgid "" -#~ "`#2681 `__: " -#~ "pgr_trspviaedges" -#~ msgstr "" -#~ "`#2681 `__: " -#~ "pgr_trspviaedges" - -#~ msgid "" -#~ "`#2682 `__: " -#~ "pgr_trspviavertices" -#~ msgstr "" -#~ "`#2682 `__: " -#~ "pgr_trspviavertices" +#~ msgid "`#2909 `__: pgr_turnRestrictedPaths" +#~ msgstr "`#2909 `__ pgr_turnRestrictedPaths" + +#~ msgid "`#2681 `__: pgr_trspviaedges" +#~ msgstr "`#2681 `__: pgr_trspviaedges" + +#~ msgid "`#2682 `__: pgr_trspviavertices" +#~ msgstr "`#2682 `__: pgr_trspviavertices" #, fuzzy -#~ msgid "" -#~ "`#2748 `__ " -#~ "_pgr_alphashape(text,double precision)" -#~ msgstr "" -#~ "`#2748 `__: " -#~ "pgr_alphaShape" +#~ msgid "`#2748 `__ _pgr_alphashape(text,double precision)" +#~ msgstr "`#2748 `__: pgr_alphaShape" #, fuzzy -#~ msgid "" -#~ "`#2861 `__ " -#~ "_pgr_checkverttab(text,text[],integer,text)" -#~ msgstr "" -#~ "`#2827 `__: " -#~ "pgr_createVerticesTable" +#~ msgid "`#2861 `__ _pgr_checkverttab(text,text[],integer,text)" +#~ msgstr "`#2827 `__: pgr_createVerticesTable" #, fuzzy -#~ msgid "" -#~ "`#2861 `__ " -#~ "_pgr_createindex(text,text,text,integer,text)" -#~ msgstr "" -#~ "`#2786 `__: " -#~ "pgr_contraction(edges) ny signatur" +#~ msgid "`#2861 `__ _pgr_createindex(text,text,text,integer,text)" +#~ msgstr "`#2786 `__: pgr_contraction(edges) ny signatur" #, fuzzy -#~ msgid "" -#~ "`#2861 `__ " -#~ "_pgr_createindex(text,text,text,text,integer,text)" -#~ msgstr "" -#~ "`#2786 `__: " -#~ "pgr_contraction(edges) ny signatur" +#~ msgid "`#2861 `__ _pgr_createindex(text,text,text,text,integer,text)" +#~ msgstr "`#2786 `__: pgr_contraction(edges) ny signatur" #, fuzzy -#~ msgid "" -#~ "`#2913 `__ " -#~ "_pgr_dagshortestpath(text,anyarray,anyarray,boolean,boolean)" -#~ msgstr "" -#~ "`#2913 `__ " -#~ "pgr_DAGshortestPath" +#~ msgid "`#2913 `__ _pgr_dagshortestpath(text,anyarray,anyarray,boolean,boolean)" +#~ msgstr "`#2913 `__ pgr_DAGshortestPath" #, fuzzy -#~ msgid "" -#~ "`#2913 `__ " -#~ "_pgr_dagshortestpath(text,text,boolean,boolean)" -#~ msgstr "" -#~ "`#2913 `__ " -#~ "pgr_DAGshortestPath" +#~ msgid "`#2913 `__ _pgr_dagshortestpath(text,text,boolean,boolean)" +#~ msgstr "`#2913 `__ pgr_DAGshortestPath" #, fuzzy -#~ msgid "" -#~ "`#2730 `__ " -#~ "_pgr_dijkstranear(text,anyarray,anyarray,bigint,boolean)" -#~ msgstr "" -#~ "`#2718 `__ " -#~ "pgr_dijkstra(Kombinationer)" +#~ msgid "`#2730 `__ _pgr_dijkstranear(text,anyarray,anyarray,bigint,boolean)" +#~ msgstr "`#2718 `__ pgr_dijkstra(Kombinationer)" #, fuzzy -#~ msgid "" -#~ "`#2730 `__ " -#~ "_pgr_dijkstranear(text,anyarray,bigint,bigint,boolean)" -#~ msgstr "" -#~ "`#2718 `__ " -#~ "pgr_dijkstra(Kombinationer)" +#~ msgid "`#2730 `__ _pgr_dijkstranear(text,anyarray,bigint,bigint,boolean)" +#~ msgstr "`#2718 `__ pgr_dijkstra(Kombinationer)" #, fuzzy -#~ msgid "" -#~ "`#2730 `__ " -#~ "_pgr_dijkstranear(text,bigint,anyarray,bigint,boolean)" -#~ msgstr "" -#~ "`#2718 `__ " -#~ "pgr_dijkstra(Kombinationer)" +#~ msgid "`#2730 `__ _pgr_dijkstranear(text,bigint,anyarray,bigint,boolean)" +#~ msgstr "`#2718 `__ pgr_dijkstra(Kombinationer)" #, fuzzy -#~ msgid "" -#~ "`#2735 `__ " -#~ "_pgr_drivingdistance(text,anyarray,double precision,boolean,boolean)" -#~ msgstr "" -#~ "#2735 _pgr_drivingdistance(text,valfri matris,dubbel precision,boolean," -#~ "boolean)" +#~ msgid "`#2735 `__ _pgr_drivingdistance(text,anyarray,double precision,boolean,boolean)" +#~ msgstr "#2735 _pgr_drivingdistance(text,valfri matris,dubbel precision,boolean,boolean)" #, fuzzy -#~ msgid "" -#~ "`#2861 `__ " -#~ "_pgr_endpoint(geometry)" -#~ msgstr "" -#~ "`#2886 `__: " -#~ "pgr_nodeNetwork" +#~ msgid "`#2861 `__ _pgr_endpoint(geometry)" +#~ msgstr "`#2886 `__: pgr_nodeNetwork" #, fuzzy -#~ msgid "" -#~ "`#2861 `__ " -#~ "_pgr_getcolumnname(text,text,integer,text)" -#~ msgstr "" -#~ "`#2886 `__: " -#~ "pgr_nodeNetwork" +#~ msgid "`#2861 `__ _pgr_getcolumnname(text,text,integer,text)" +#~ msgstr "`#2886 `__: pgr_nodeNetwork" #, fuzzy -#~ msgid "" -#~ "`#2861 `__ " -#~ "_pgr_getcolumnname(text,text,text,integer,text)" -#~ msgstr "" -#~ "`#2786 `__: " -#~ "pgr_contraction(edges) ny signatur" +#~ msgid "`#2861 `__ _pgr_getcolumnname(text,text,text,integer,text)" +#~ msgstr "`#2786 `__: pgr_contraction(edges) ny signatur" #, fuzzy -#~ msgid "" -#~ "`#2861 `__ " -#~ "_pgr_getcolumntype(text,text,integer,text)" -#~ msgstr "" -#~ "`#2681 `__: " -#~ "pgr_trspviaedges" +#~ msgid "`#2861 `__ _pgr_getcolumntype(text,text,integer,text)" +#~ msgstr "`#2681 `__: pgr_trspviaedges" #, fuzzy -#~ msgid "" -#~ "`#2861 `__ " -#~ "_pgr_getcolumntype(text,text,text,integer,text)" -#~ msgstr "" -#~ "`#2681 `__: " -#~ "pgr_trspviaedges" +#~ msgid "`#2861 `__ _pgr_getcolumntype(text,text,text,integer,text)" +#~ msgstr "`#2681 `__: pgr_trspviaedges" #, fuzzy -#~ msgid "" -#~ "`#2861 `__ " -#~ "_pgr_gettablename(text,integer,text)" -#~ msgstr "" -#~ "`#2886 `__: " -#~ "pgr_nodeNetwork" +#~ msgid "`#2861 `__ _pgr_gettablename(text,integer,text)" +#~ msgstr "`#2886 `__: pgr_nodeNetwork" #, fuzzy -#~ msgid "" -#~ "`#2861 `__ " -#~ "_pgr_iscolumnindexed(text,text,integer,text)" -#~ msgstr "" -#~ "`#2886 `__: " -#~ "pgr_nodeNetwork" +#~ msgid "`#2861 `__ _pgr_iscolumnindexed(text,text,integer,text)" +#~ msgstr "`#2886 `__: pgr_nodeNetwork" #, fuzzy -#~ msgid "" -#~ "`#2861 `__ " -#~ "_pgr_iscolumnindexed(text,text,text,integer,text)" -#~ msgstr "" -#~ "`#2786 `__: " -#~ "pgr_contraction(edges) ny signatur" +#~ msgid "`#2861 `__ _pgr_iscolumnindexed(text,text,text,integer,text)" +#~ msgstr "`#2786 `__: pgr_contraction(edges) ny signatur" #, fuzzy -#~ msgid "" -#~ "`#2861 `__ " -#~ "_pgr_iscolumnintable(text,text)" -#~ msgstr "" -#~ "`#2681 `__: " -#~ "pgr_trspviaedges" +#~ msgid "`#2861 `__ _pgr_iscolumnintable(text,text)" +#~ msgstr "`#2681 `__: pgr_trspviaedges" #, fuzzy -#~ msgid "" -#~ "`#2899 `__ " -#~ "_pgr_maxcardinalitymatch(text,boolean)" -#~ msgstr "" -#~ "`#2899 `__: " -#~ "pgr_maxCardinalityMatch" +#~ msgid "`#2899 `__ _pgr_maxcardinalitymatch(text,boolean)" +#~ msgstr "`#2899 `__: pgr_maxCardinalityMatch" #, fuzzy -#~ msgid "" -#~ "`#2861 `__ " -#~ "_pgr_startpoint(geometry)" -#~ msgstr "" -#~ "`#2681 `__: " -#~ "pgr_trspviaedges" +#~ msgid "`#2861 `__ _pgr_startpoint(geometry)" +#~ msgstr "`#2681 `__: pgr_trspviaedges" #, fuzzy -#~ msgid "" -#~ "`#2682 `__ " -#~ "_pgr_trspviavertices(text,integer[],boolean,boolean,text)" -#~ msgstr "" -#~ "`#2682 `__: " -#~ "pgr_trspviavertices" +#~ msgid "`#2682 `__ _pgr_trspviavertices(text,integer[],boolean,boolean,text)" +#~ msgstr "`#2682 `__: pgr_trspviavertices" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "_pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean," -#~ "character,boolean)" -#~ msgstr "" -#~ "#2919 _pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean," -#~ "boolean,character,boolean)" +#~ msgid "`#2919 `__ _pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +#~ msgstr "#2919 _pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "_pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character," -#~ "boolean)" -#~ msgstr "" -#~ "#2919 _pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean," -#~ "tecken,boolean)" +#~ msgid "`#2919 `__ _pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +#~ msgstr "#2919 _pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,tecken,boolean)" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "_pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" -#~ msgstr "" -#~ "`#2701 `__ " -#~ "pgr_trsp_withPoints" +#~ msgid "`#2919 `__ _pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" +#~ msgstr "`#2701 `__ pgr_trsp_withPoints" #, fuzzy -#~ msgid "" -#~ "`#2901 `__ " -#~ "_pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer," -#~ "integer,double precision,double precision,double precision,boolean)" -#~ msgstr "" -#~ "#2901 _pgr_tspeuclidean(text,bigint,bigint,dubbel precision,heltal,heltal," -#~ "heltal,dubbel precision,dubbel precision,dubbel precision,boolean)" +#~ msgid "`#2901 `__ _pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +#~ msgstr "#2901 _pgr_tspeuclidean(text,bigint,bigint,dubbel precision,heltal,heltal,heltal,dubbel precision,dubbel precision,dubbel precision,boolean)" #, fuzzy -#~ msgid "" -#~ "`#2861 `__ " -#~ "_pgr_versionless(text,text)" -#~ msgstr "" -#~ "`#2681 `__: " -#~ "pgr_trspviaedges" +#~ msgid "`#2861 `__ _pgr_versionless(text,text)" +#~ msgstr "`#2681 `__: pgr_trspviaedges" #, fuzzy -#~ msgid "" -#~ "`#2890 `__ " -#~ "_pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -#~ "boolean,boolean)" -#~ msgstr "" -#~ "#2890 _pgr_withpointsdd(text,text,valfri matris,dubbel precision,boolean," -#~ "tecken,boolean,boolean)" +#~ msgid "`#2890 `__ _pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +#~ msgstr "#2890 _pgr_withpointsdd(text,text,valfri matris,dubbel precision,boolean,tecken,boolean,boolean)" #, fuzzy -#~ msgid "" -#~ "`#2895 `__ " -#~ "_pgr_withpointsksp(text,text,anyarray,anyarray,integer,character,boolean," -#~ "boolean,boolean,boolean)" -#~ msgstr "" -#~ "#2895 _pgr_withpointsksp(text,text,anyarray,anyarray,integer,character," -#~ "boolean,boolean,boolean,boolean,boolean)" +#~ msgid "`#2895 `__ _pgr_withpointsksp(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean)" +#~ msgstr "#2895 _pgr_withpointsksp(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean,boolean)" #, fuzzy -#~ msgid "" -#~ "`#2895 `__ " -#~ "_pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean," -#~ "character,boolean)" -#~ msgstr "" -#~ "#2895 _pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean," -#~ "character,boolean)" +#~ msgid "`#2895 `__ _pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +#~ msgstr "#2895 _pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" #, fuzzy -#~ msgid "" -#~ "`#2895 `__ " -#~ "_pgr_withpointsksp(text,text,text,integer,character,boolean,boolean," -#~ "boolean)" -#~ msgstr "" -#~ "#2895 _pgr_withpointsksp(text,text,text,heltal,tecken,boolean,boolean," -#~ "boolean)" +#~ msgid "`#2895 `__ _pgr_withpointsksp(text,text,text,integer,character,boolean,boolean,boolean)" +#~ msgstr "#2895 _pgr_withpointsksp(text,text,text,heltal,tecken,boolean,boolean,boolean)" #, fuzzy -#~ msgid "" -#~ "`#2741 `__ " -#~ "_pgr_withpointsvia(text,bigint[],double precision[],boolean)" -#~ msgstr "" -#~ "`#2700 `__ " -#~ "pgr_withPointsVia" +#~ msgid "`#2741 `__ _pgr_withpointsvia(text,bigint[],double precision[],boolean)" +#~ msgstr "`#2700 `__ pgr_withPointsVia" #, fuzzy -#~ msgid "" -#~ "`#2741 `__ " -#~ "_pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character," -#~ "boolean)" -#~ msgstr "" -#~ "#2741 _pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean," -#~ "boolean,character,boolean)" +#~ msgid "`#2741 `__ _pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +#~ msgstr "#2741 _pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,boolean,character,boolean)" #, fuzzy -#~ msgid "" -#~ "`#2899 `__ " -#~ "pgr_maxcardinalitymatch(text,boolean)" -#~ msgstr "" -#~ "`#2899 `__: " -#~ "pgr_maxCardinalityMatch" +#~ msgid "`#2899 `__ pgr_maxcardinalitymatch(text,boolean)" +#~ msgstr "`#2899 `__: pgr_maxCardinalityMatch" #, fuzzy -#~ msgid "" -#~ "`#2681 `__ " -#~ "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" -#~ msgstr "" -#~ "`#2681 `__: " -#~ "pgr_trspviaedges" +#~ msgid "`#2681 `__ pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +#~ msgstr "`#2681 `__: pgr_trspviaedges" #, fuzzy -#~ msgid "" -#~ "`#2682 `__ " -#~ "pgr_trspviavertices(text,anyarray,boolean,boolean,text)" -#~ msgstr "" -#~ "`#2682 `__: " -#~ "pgr_trspviavertices" +#~ msgid "`#2682 `__ pgr_trspviavertices(text,anyarray,boolean,boolean,text)" +#~ msgstr "`#2682 `__: pgr_trspviavertices" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean," -#~ "character,boolean)" -#~ msgstr "" -#~ "#2919 _pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean," -#~ "boolean,character,boolean)" +#~ msgid "`#2919 `__ pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +#~ msgstr "#2919 _pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character," -#~ "boolean)" -#~ msgstr "" -#~ "#2919 _pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean," -#~ "tecken,boolean)" +#~ msgid "`#2919 `__ pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +#~ msgstr "#2919 _pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,tecken,boolean)" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character," -#~ "boolean)" -#~ msgstr "" -#~ "#2919 pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean," -#~ "character,boolean)" +#~ msgid "`#2919 `__ pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +#~ msgstr "#2919 pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character," -#~ "boolean)" -#~ msgstr "" -#~ "#2919 pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean," -#~ "character,boolean)" +#~ msgid "`#2919 `__ pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +#~ msgstr "#2919 pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character," -#~ "boolean)" -#~ msgstr "" -#~ "#2919 pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,tecken," -#~ "boolean)" +#~ msgid "`#2919 `__ pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" +#~ msgstr "#2919 pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,tecken,boolean)" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" -#~ msgstr "" -#~ "`#2701 `__ " -#~ "pgr_trsp_withPoints" +#~ msgid "`#2919 `__ pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" +#~ msgstr "`#2701 `__ pgr_trsp_withPoints" #, fuzzy -#~ msgid "" -#~ "`#2901 `__ " -#~ "pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer," -#~ "integer,double precision,double precision,double precision,boolean)" -#~ msgstr "" -#~ "#2901 _pgr_tspeuclidean(text,bigint,bigint,dubbel precision,heltal,heltal," -#~ "heltal,dubbel precision,dubbel precision,dubbel precision,boolean)" +#~ msgid "`#2901 `__ pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +#~ msgstr "#2901 _pgr_tspeuclidean(text,bigint,bigint,dubbel precision,heltal,heltal,heltal,dubbel precision,dubbel precision,dubbel precision,boolean)" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_withpointscostmatrix(text,text,anyarray,boolean,character)" -#~ msgstr "" -#~ "`#2905 `__ " -#~ "pgr_withPointsCostMatrix" +#~ msgid "`#2919 `__ pgr_withpointscostmatrix(text,text,anyarray,boolean,character)" +#~ msgstr "`#2905 `__ pgr_withPointsCostMatrix" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_withpointscost(text,text,anyarray,anyarray,boolean,character)" -#~ msgstr "" -#~ "`#2905 `__ " -#~ "pgr_withPointsCostMatrix" +#~ msgid "`#2919 `__ pgr_withpointscost(text,text,anyarray,anyarray,boolean,character)" +#~ msgstr "`#2905 `__ pgr_withPointsCostMatrix" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_withpointscost(text,text,anyarray,bigint,boolean,character)" -#~ msgstr "" -#~ "`#2905 `__ " -#~ "pgr_withPointsCostMatrix" +#~ msgid "`#2919 `__ pgr_withpointscost(text,text,anyarray,bigint,boolean,character)" +#~ msgstr "`#2905 `__ pgr_withPointsCostMatrix" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_withpointscost(text,text,bigint,anyarray,boolean,character)" -#~ msgstr "" -#~ "`#2905 `__ " -#~ "pgr_withPointsCostMatrix" +#~ msgid "`#2919 `__ pgr_withpointscost(text,text,bigint,anyarray,boolean,character)" +#~ msgstr "`#2905 `__ pgr_withPointsCostMatrix" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_withpointscost(text,text,bigint,bigint,boolean,character)" -#~ msgstr "" -#~ "`#2905 `__ " -#~ "pgr_withPointsCostMatrix" +#~ msgid "`#2919 `__ pgr_withpointscost(text,text,bigint,bigint,boolean,character)" +#~ msgstr "`#2905 `__ pgr_withPointsCostMatrix" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_withpointscost(text,text,text,boolean,character)" -#~ msgstr "" -#~ "`#2905 `__ " -#~ "pgr_withPointsCostMatrix" +#~ msgid "`#2919 `__ pgr_withpointscost(text,text,text,boolean,character)" +#~ msgstr "`#2905 `__ pgr_withPointsCostMatrix" #, fuzzy -#~ msgid "" -#~ "`#2890 `__ " -#~ "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -#~ "boolean,boolean)" -#~ msgstr "" -#~ "#2890 _pgr_withpointsdd(text,text,valfri matris,dubbel precision,boolean," -#~ "tecken,boolean,boolean)" +#~ msgid "`#2890 `__ pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +#~ msgstr "#2890 _pgr_withpointsdd(text,text,valfri matris,dubbel precision,boolean,tecken,boolean,boolean)" #, fuzzy -#~ msgid "" -#~ "`#2890 `__ " -#~ "pgr_withpointsdd(text,text,bigint,double precision,boolean,character," -#~ "boolean)" -#~ msgstr "" -#~ "#2890 pgr_withpointsdd(text,text,bigint,dubbel precision,boolean,tecken," -#~ "boolean)" +#~ msgid "`#2890 `__ pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +#~ msgstr "#2890 pgr_withpointsdd(text,text,bigint,dubbel precision,boolean,tecken,boolean)" #, fuzzy -#~ msgid "" -#~ "`#2895 `__ " -#~ "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean," -#~ "character,boolean)" -#~ msgstr "" -#~ "#2895 _pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean," -#~ "character,boolean)" +#~ msgid "`#2895 `__ pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +#~ msgstr "#2895 _pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_withpoints(text,text,anyarray,anyarray,boolean,character,boolean)" -#~ msgstr "" -#~ "#2919 pgr_withpoints(text,text,valfri matris,valfri matris,boolean,tecken," -#~ "boolean)" +#~ msgid "`#2919 `__ pgr_withpoints(text,text,anyarray,anyarray,boolean,character,boolean)" +#~ msgstr "#2919 pgr_withpoints(text,text,valfri matris,valfri matris,boolean,tecken,boolean)" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)" -#~ msgstr "" -#~ "#2919 pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)" +#~ msgid "`#2919 `__ pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)" +#~ msgstr "#2919 pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_withpoints(text,text,bigint,anyarray,boolean,character,boolean)" -#~ msgstr "" -#~ "#2919 pgr_withpoints(text,text,bigint,anyarray,boolean,tecken,boolean)" +#~ msgid "`#2919 `__ pgr_withpoints(text,text,bigint,anyarray,boolean,character,boolean)" +#~ msgstr "#2919 pgr_withpoints(text,text,bigint,anyarray,boolean,tecken,boolean)" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_withpoints(text,text,bigint,bigint,boolean,character,boolean)" -#~ msgstr "" -#~ "#2919 pgr_withpoints(text,text,bigint,bigint,boolean,tecken,boolean)" +#~ msgid "`#2919 `__ pgr_withpoints(text,text,bigint,bigint,boolean,character,boolean)" +#~ msgstr "#2919 pgr_withpoints(text,text,bigint,bigint,boolean,tecken,boolean)" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_withpoints(text,text,text,boolean,character,boolean)" -#~ msgstr "" -#~ "`#2905 `__ " -#~ "pgr_withPointsCost" +#~ msgid "`#2919 `__ pgr_withpoints(text,text,text,boolean,character,boolean)" +#~ msgstr "`#2905 `__ pgr_withPointsCost" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character," -#~ "boolean)" -#~ msgstr "" -#~ "#2919 pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean," -#~ "boolean,character,boolean)" +#~ msgid "`#2919 `__ pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +#~ msgstr "#2919 pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,boolean,character,boolean)" #~ msgid "_pgr_drivingdistance => _pgr_drivingdistancev4" #~ msgstr "_pgr_drivingdistance => _pgr_drivingdistancev4" @@ -22210,48 +16461,24 @@ msgstr "pgr_withPointsvia is pgr_dijkstraVia **with points**" #~ msgstr "_pgr_withpointsvia => _pgr_withpointsvia_v4" #, fuzzy -#~ msgid "" -#~ "`#2748 `__ " -#~ "_pgr_alphashape" -#~ msgstr "" -#~ "`#2748 `__: " -#~ "pgr_alphaShape" +#~ msgid "`#2748 `__ _pgr_alphashape" +#~ msgstr "`#2748 `__: pgr_alphaShape" #, fuzzy -#~ msgid "" -#~ "`#2913 `__ " -#~ "_pgr_dagshortestpath" -#~ msgstr "" -#~ "`#2913 `__ " -#~ "pgr_DAGshortestPath" - -#~ msgid "" -#~ "The ``pgr_aStarCost`` function summarizes of the cost of the shortest " -#~ "path using the A* algorithm." -#~ msgstr "" -#~ "Funktionen ``pgr_aStarCost`` sammanfattar kostnaden för den kortaste " -#~ "vägen med hjälp av A*-algoritmen." - -#~ msgid "" -#~ "The results are equivalent to the union of the results of the " -#~ "pgr_bdAStar(One to One) on the:" -#~ msgstr "" -#~ "Resultaten motsvarar sammanslagningen av resultaten av pgr_bdAStar(One to " -#~ "One) på:" - -#~ msgid "" -#~ "The ``pgr_bdAstarCost`` function summarizes of the cost of the shortest " -#~ "path using the bidirectional A* algorithm." -#~ msgstr "" -#~ "Funktionen ``pgr_bdAstarCost`` sammanfattar kostnaden för den kortaste " -#~ "vägen med hjälp av den dubbelriktade A*-algoritmen." - -#~ msgid "" -#~ "``pgr_bdAstarCostMatrix`` - Calculates the a cost matrix using :doc:" -#~ "`pgr_aStar`." -#~ msgstr "" -#~ "``pgr_bdAstarCostMatrix`` - Beräknar en kostnadsmatris med hjälp av :doc:" -#~ "`pgr_aStar`." +#~ msgid "`#2913 `__ _pgr_dagshortestpath" +#~ msgstr "`#2913 `__ pgr_DAGshortestPath" + +#~ msgid "The ``pgr_aStarCost`` function summarizes of the cost of the shortest path using the A* algorithm." +#~ msgstr "Funktionen ``pgr_aStarCost`` sammanfattar kostnaden för den kortaste vägen med hjälp av A*-algoritmen." + +#~ msgid "The results are equivalent to the union of the results of the pgr_bdAStar(One to One) on the:" +#~ msgstr "Resultaten motsvarar sammanslagningen av resultaten av pgr_bdAStar(One to One) på:" + +#~ msgid "The ``pgr_bdAstarCost`` function summarizes of the cost of the shortest path using the bidirectional A* algorithm." +#~ msgstr "Funktionen ``pgr_bdAstarCost`` sammanfattar kostnaden för den kortaste vägen med hjälp av den dubbelriktade A*-algoritmen." + +#~ msgid "``pgr_bdAstarCostMatrix`` - Calculates the a cost matrix using :doc:`pgr_aStar`." +#~ msgstr "``pgr_bdAstarCostMatrix`` - Beräknar en kostnadsmatris med hjälp av :doc:`pgr_aStar`." #~ msgid "Using internally the :doc:`pgr_bdAstar` algorithm" #~ msgstr "Intern användning av :doc:`pgr_bdAstar`-algoritmen" @@ -22259,30 +16486,11 @@ msgstr "pgr_withPointsvia is pgr_dijkstraVia **with points**" #~ msgid "Signature change on pgr_bdDijsktra(One to One)" #~ msgstr "Ändring av signatur på pgr_bdDijsktra(One to One)" -#~ msgid "" -#~ "The ``pgr_bdDijkstraCost`` function summarizes of the cost of the " -#~ "shortest path using the bidirectional Dijkstra Algorithm." -#~ msgstr "" -#~ "Funktionen ``pgr_bdDijkstraCost`` sammanfattar kostnaden för den kortaste " -#~ "vägen med hjälp av den dubbelriktade Dijkstra-algoritmen." - -#~ msgid "" -#~ "It is well-known that the shortest paths between a single source and all " -#~ "other vertices can be found using Breadth First Search in :math:`O(|E|)` " -#~ "in an unweighted graph, i.e. the distance is the minimal number of edges " -#~ "that you need to traverse from the source to another vertex. We can " -#~ "interpret such a graph also as a weighted graph, where every edge has the " -#~ "weight :math:`1`. If not all edges in graph have the same weight, that we " -#~ "need a more general algorithm, like Dijkstra's Algorithm which runs in :" -#~ "math:`O(|E|log|V|)` time." -#~ msgstr "" -#~ "Det är välkänt att de kortaste vägarna mellan en enda källa och alla " -#~ "andra toppar kan hittas med hjälp av Breadth First Search på :math:`O(|" -#~ "E|)` i en oviktad graf, dvs. avståndet är det minsta antalet kanter som " -#~ "du behöver korsa från källan till en annan topp. Vi kan också tolka en " -#~ "sådan graf som en viktad graf, där varje kant har vikten :math:`1`. Om " -#~ "inte alla kanter i grafen har samma vikt behöver vi en mer allmän " -#~ "algoritm, som Dijkstras algoritm, som går på :math:`O(|E|log|V|)` tid." +#~ msgid "The ``pgr_bdDijkstraCost`` function summarizes of the cost of the shortest path using the bidirectional Dijkstra Algorithm." +#~ msgstr "Funktionen ``pgr_bdDijkstraCost`` sammanfattar kostnaden för den kortaste vägen med hjälp av den dubbelriktade Dijkstra-algoritmen." + +#~ msgid "It is well-known that the shortest paths between a single source and all other vertices can be found using Breadth First Search in :math:`O(|E|)` in an unweighted graph, i.e. the distance is the minimal number of edges that you need to traverse from the source to another vertex. We can interpret such a graph also as a weighted graph, where every edge has the weight :math:`1`. If not all edges in graph have the same weight, that we need a more general algorithm, like Dijkstra's Algorithm which runs in :math:`O(|E|log|V|)` time." +#~ msgstr "Det är välkänt att de kortaste vägarna mellan en enda källa och alla andra toppar kan hittas med hjälp av Breadth First Search på :math:`O(|E|)` i en oviktad graf, dvs. avståndet är det minsta antalet kanter som du behöver korsa från källan till en annan topp. Vi kan också tolka en sådan graf som en viktad graf, där varje kant har vikten :math:`1`. Om inte alla kanter i grafen har samma vikt behöver vi en mer allmän algoritm, som Dijkstras algoritm, som går på :math:`O(|E|log|V|)` tid." #~ msgid "New experimental function" #~ msgstr "Ny experimentell funktion" @@ -22296,29 +16504,19 @@ msgstr "pgr_withPointsvia is pgr_dijkstraVia **with points**" #~ msgid "``pgr_dijkstraNearCost`` - Proposed" #~ msgstr "``pgr_dijkstraNearCost`` - Förslag" -#~ msgid "" -#~ "Boost `floyd-Warshall `_" -#~ msgstr "" -#~ "Boost `floyd-Warshall `_" +#~ msgid "Boost `floyd-Warshall `_" +#~ msgstr "Boost `floyd-Warshall `_" #, fuzzy -#~ msgid "" -#~ "``pgr_kingOrdering`` — Returns the King ordering of an undirected graphs" -#~ msgstr "" -#~ "``pgr_cuthillMckeeOrdering`` - Returnerar den omvända Cuthill-Mckee-" -#~ "ordningen för en ostyrd graf" +#~ msgid "``pgr_kingOrdering`` — Returns the King ordering of an undirected graphs" +#~ msgstr "``pgr_cuthillMckeeOrdering`` - Returnerar den omvända Cuthill-Mckee-ordningen för en ostyrd graf" #~ msgid "|boost| graph inside." #~ msgstr "|boost| graf inuti." #, fuzzy -#~ msgid "" -#~ "``pgr_sloanOrdering`` — Returns the sloan ordering of an undirected graph" -#~ msgstr "" -#~ "``pgr_cuthillMckeeOrdering`` - Returnerar den omvända Cuthill-Mckee-" -#~ "ordningen för en ostyrd graf" +#~ msgid "``pgr_sloanOrdering`` — Returns the sloan ordering of an undirected graph" +#~ msgstr "``pgr_cuthillMckeeOrdering`` - Returnerar den omvända Cuthill-Mckee-ordningen för en ostyrd graf" #, fuzzy #~ msgid "|Boost| Boost Graph inside" @@ -22332,8 +16530,7 @@ msgstr "pgr_withPointsvia is pgr_dijkstraVia **with points**" #~ msgstr "Dessutom finns det 2 kategorier under denna familj" #~ msgid "They will likely officially be part of the next mayor release:" -#~ msgstr "" -#~ "De kommer sannolikt officiellt att vara en del av nästa borgmästarutgåva:" +#~ msgstr "De kommer sannolikt officiellt att vara en del av nästa borgmästarutgåva:" #~ msgid "The functions make use of ANY-INTEGER and ANY-NUMERICAL" #~ msgstr "Funktionerna använder sig av ANY-INTEGER och ANY-NUMERICAL" @@ -22368,306 +16565,134 @@ msgstr "pgr_withPointsvia is pgr_dijkstraVia **with points**" #~ msgid "Might depend on a deprecated function of pgRouting" #~ msgstr "Kan vara beroende av en föråldrad funktion i pgRouting" -#~ msgid "" -#~ "To see all issues & pull requests closed by this release see the `Git " -#~ "closed milestone for 4.0.0 `__" -#~ msgstr "" -#~ "För att se alla problem och pull requests som stängts av den här utgåvan, " -#~ "se `Git stängd milstolpe för 4.0.0 `__" - -#~ msgid "" -#~ "`#2701 `__ pgr_trsp" -#~ msgstr "" -#~ "`#2701 `__ pgr_trsp" - -#~ msgid "" -#~ "`#2701 `__ pgr_trspVia" -#~ msgstr "" -#~ "`#2701 `__ pgr_trspVia" - -#~ msgid "" -#~ "`#2701 `__ " -#~ "pgr_trspVia_withPoints" -#~ msgstr "" -#~ "`#2701 `__ " -#~ "pgr_trspVia_withPoints" - -#~ msgid "" -#~ "`#2701 `__ " -#~ "pgr_trsp_withPoints" -#~ msgstr "" -#~ "`#2701 `__ " -#~ "pgr_trsp_withPoints" - -#~ msgid "" -#~ "`#2700 `__ " -#~ "pgr_withPoints" -#~ msgstr "" -#~ "`#2700 `__ " -#~ "pgr_withPoints" - -#~ msgid "" -#~ "`#2700 `__ " -#~ "pgr_withPointsCost" -#~ msgstr "" -#~ "`#2700 `__ " -#~ "pgr_medPointsCost" - -#~ msgid "" -#~ "`#2700 `__ " -#~ "pgr_withPointsCostMatrix" -#~ msgstr "" -#~ "`#2700 `__ " -#~ "pgr_withPointsCostMatrix" - -#~ msgid "" -#~ "`#2700 `__ " -#~ "pgr_withPointsDD" -#~ msgstr "" -#~ "`#2700 `__ " -#~ "pgr_medPointsDD" - -#~ msgid "" -#~ "`#2700 `__ " -#~ "pgr_withPointsKSP" -#~ msgstr "" -#~ "`#2700 `__ " -#~ "pgr_withPointsKSP" - -#~ msgid "" -#~ "`#2700 `__ " -#~ "pgr_withPointsVia" -#~ msgstr "" -#~ "`#2700 `__ " -#~ "pgr_withPointsVia" - -#~ msgid "" -#~ "`#2718 `__ " -#~ "pgr_aStar(Combinations)" -#~ msgstr "" -#~ "`#2718 `__ " -#~ "pgr_aStar(Kombinationer)" - -#~ msgid "" -#~ "`#2718 `__ " -#~ "pgr_aStarCost(Combinations)" -#~ msgstr "" -#~ "`#2718 `__ " -#~ "pgr_aStarCost(Kombinationer)" - -#~ msgid "" -#~ "`#2718 `__ " -#~ "pgr_bdAstar(Combinations)" -#~ msgstr "" -#~ "`#2718 `__ " -#~ "pgr_bdAstar(Kombinationer)" - -#~ msgid "" -#~ "`#2718 `__ " -#~ "pgr_bdAstarCost(Combinations)" -#~ msgstr "" -#~ "`#2718 `__ " -#~ "pgr_bdAstarCost(Kombinationer)" - -#~ msgid "" -#~ "`#2718 `__ " -#~ "pgr_bdDijkstra(Combinations)" -#~ msgstr "" -#~ "`#2718 `__ " -#~ "pgr_bdDijkstra(Kombinationer)" - -#~ msgid "" -#~ "`#2718 `__ " -#~ "pgr_bdDijkstraCost(Combinations)" -#~ msgstr "" -#~ "`#2718 `__ " -#~ "pgr_bdDijkstraCost(Kombinationer)" - -#~ msgid "" -#~ "`#2718 `__ " -#~ "pgr_dijkstra(Combinations)" -#~ msgstr "" -#~ "`#2718 `__ " -#~ "pgr_dijkstra(Kombinationer)" - -#~ msgid "" -#~ "`#2718 `__ " -#~ "pgr_dijkstraCost(Combinations)" -#~ msgstr "" -#~ "`#2718 `__ " -#~ "pgr_dijkstraCost(Kombinationer)" - -#~ msgid "" -#~ "`#2718 `__ " -#~ "pgr_KSP(All signatures)" -#~ msgstr "" -#~ "`#2718 `__ " -#~ "pgr_KSP(Alla signaturer)" - -#~ msgid "" -#~ "`#2718 `__ " -#~ "pgr_boykovKolmogorov(Combinations)" -#~ msgstr "" -#~ "`#2718 `__ " -#~ "pgr_boykovKolmogorov(Kombinationer)" - -#~ msgid "" -#~ "`#2718 `__ " -#~ "pgr_edmondsKarp(Combinations)" -#~ msgstr "" -#~ "`#2718 `__ " -#~ "pgr_edmondsKarp(Kombinationer)" - -#~ msgid "" -#~ "`#2718 `__ " -#~ "pgr_maxFlow(Combinations)" -#~ msgstr "" -#~ "`#2718 `__ " -#~ "pgr_maxFlow(Kombinationer)" - -#~ msgid "" -#~ "`#2718 `__ " -#~ "pgr_pushRelabel(Combinations)" -#~ msgstr "" -#~ "`#2718 `__ " -#~ "pgr_pushRelabel(Kombinationer)" - -#~ msgid "" -#~ "`#2904 `__ " -#~ "Standardize output columns of functions with different output columns " -#~ "within overloads" -#~ msgstr "" -#~ "`#2904 `__ " -#~ "Standardisera utdatakolumner för funktioner med olika utdatakolumner inom " -#~ "överbelastningar" - -#~ msgid "" -#~ "`#2905 `__ " -#~ "pgr_withPoints" -#~ msgstr "" -#~ "`#2905 `__ " -#~ "pgr_withPoints" - -#~ msgid "" -#~ "`#2906 `__ " -#~ "pgr_bdDijkstra" -#~ msgstr "" -#~ "`#2906 `__ " -#~ "pgr_bdDijkstra" - -#~ msgid "" -#~ "`#2907 `__ " -#~ "pgr_bellmanFord" -#~ msgstr "" -#~ "`#2907 `__ " -#~ "pgr_bellmanFord" - -#~ msgid "" -#~ "`#2908 `__ " -#~ "pgr_binaryBreadthFirstSearch" -#~ msgstr "" -#~ "`#2908 `__ " -#~ "pgr_binaryBreadthFirstSearch" - -#~ msgid "" -#~ "`#2910 `__ " -#~ "pgr_edwardMoore" -#~ msgstr "" -#~ "`#2910 `__ " -#~ "pgr_edwardMoore" - -#~ msgid "" -#~ "`#2913 `__ " -#~ "pgr_DAGshortestPath" -#~ msgstr "" -#~ "`#2913 `__ " -#~ "pgr_DAGshortestPath" - -#~ msgid "" -#~ "`#2905 `__ " -#~ "pgr_withPointsCost" -#~ msgstr "" -#~ "`#2905 `__ " -#~ "pgr_withPointsCost" - -#~ msgid "" -#~ "`#2905 `__ " -#~ "pgr_withPointsCostMatrix" -#~ msgstr "" -#~ "`#2905 `__ " -#~ "pgr_withPointsCostMatrix" - -#~ msgid "" -#~ "`#2909 `__ " -#~ "pgr_edgeDisjointPaths" -#~ msgstr "" -#~ "`#2909 `__ " -#~ "pgr_edgeDisjointPaths" - -#~ msgid "" -#~ "`#2909 `__ " -#~ "pgr_turnRestrictedPaths" -#~ msgstr "" -#~ "`#2909 `__ " -#~ "pgr_turnRestrictedPaths" - -#~ msgid "" -#~ "`#2924 `__ " -#~ "pgr_edgeColoring" -#~ msgstr "" -#~ "`#2924 `__ " -#~ "pgr_edgeColoring" - -#~ msgid "" -#~ "`#2924 `__ " -#~ "pgr_bipartite" -#~ msgstr "" -#~ "`#2924 `__ " -#~ "pgr_bipartite" - -#~ msgid "" -#~ "`#2927 `__ " -#~ "pgr_sequentialVertexColoring" -#~ msgstr "" -#~ "`#2927 `__ " -#~ "pgr_sequentialVertexColoring" - -#~ msgid "" -#~ "`#2931 `__ " -#~ "pgr_breadthFirstSearch" -#~ msgstr "" -#~ "`#2931 `__ " -#~ "pgr_breadthFirstSearch" - -#~ msgid "" -#~ "`#2931 `__ " -#~ "pgr_depthFirstSearch" -#~ msgstr "" -#~ "`#2931 `__ " -#~ "pgr_depthFirstSearch" - -#~ msgid "" -#~ "`#2934 `__ " -#~ "pgr_topologicalSort" -#~ msgstr "" -#~ "`#2934 `__ " -#~ "pgr_topologicalSort" - -#~ msgid "" -#~ "`#2934 `__ " -#~ "pgr_transitiveClosure" -#~ msgstr "" -#~ "`#2934 `__ " -#~ "pgr_transitiveClosure" - -#~ msgid "" -#~ "`#2751 `__: " -#~ "pgr_createTopology" -#~ msgstr "" -#~ "`#2751 `__: " -#~ "pgr_createTopology" +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 4.0.0 `__" +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 4.0.0 `__" + +#~ msgid "`#2701 `__ pgr_trsp" +#~ msgstr "`#2701 `__ pgr_trsp" + +#~ msgid "`#2701 `__ pgr_trspVia" +#~ msgstr "`#2701 `__ pgr_trspVia" + +#~ msgid "`#2701 `__ pgr_trspVia_withPoints" +#~ msgstr "`#2701 `__ pgr_trspVia_withPoints" + +#~ msgid "`#2701 `__ pgr_trsp_withPoints" +#~ msgstr "`#2701 `__ pgr_trsp_withPoints" + +#~ msgid "`#2700 `__ pgr_withPoints" +#~ msgstr "`#2700 `__ pgr_withPoints" + +#~ msgid "`#2700 `__ pgr_withPointsCost" +#~ msgstr "`#2700 `__ pgr_medPointsCost" + +#~ msgid "`#2700 `__ pgr_withPointsCostMatrix" +#~ msgstr "`#2700 `__ pgr_withPointsCostMatrix" + +#~ msgid "`#2700 `__ pgr_withPointsDD" +#~ msgstr "`#2700 `__ pgr_medPointsDD" + +#~ msgid "`#2700 `__ pgr_withPointsKSP" +#~ msgstr "`#2700 `__ pgr_withPointsKSP" + +#~ msgid "`#2700 `__ pgr_withPointsVia" +#~ msgstr "`#2700 `__ pgr_withPointsVia" + +#~ msgid "`#2718 `__ pgr_aStar(Combinations)" +#~ msgstr "`#2718 `__ pgr_aStar(Kombinationer)" + +#~ msgid "`#2718 `__ pgr_aStarCost(Combinations)" +#~ msgstr "`#2718 `__ pgr_aStarCost(Kombinationer)" + +#~ msgid "`#2718 `__ pgr_bdAstar(Combinations)" +#~ msgstr "`#2718 `__ pgr_bdAstar(Kombinationer)" + +#~ msgid "`#2718 `__ pgr_bdAstarCost(Combinations)" +#~ msgstr "`#2718 `__ pgr_bdAstarCost(Kombinationer)" + +#~ msgid "`#2718 `__ pgr_bdDijkstra(Combinations)" +#~ msgstr "`#2718 `__ pgr_bdDijkstra(Kombinationer)" + +#~ msgid "`#2718 `__ pgr_bdDijkstraCost(Combinations)" +#~ msgstr "`#2718 `__ pgr_bdDijkstraCost(Kombinationer)" + +#~ msgid "`#2718 `__ pgr_dijkstra(Combinations)" +#~ msgstr "`#2718 `__ pgr_dijkstra(Kombinationer)" + +#~ msgid "`#2718 `__ pgr_dijkstraCost(Combinations)" +#~ msgstr "`#2718 `__ pgr_dijkstraCost(Kombinationer)" + +#~ msgid "`#2718 `__ pgr_KSP(All signatures)" +#~ msgstr "`#2718 `__ pgr_KSP(Alla signaturer)" + +#~ msgid "`#2718 `__ pgr_boykovKolmogorov(Combinations)" +#~ msgstr "`#2718 `__ pgr_boykovKolmogorov(Kombinationer)" + +#~ msgid "`#2718 `__ pgr_edmondsKarp(Combinations)" +#~ msgstr "`#2718 `__ pgr_edmondsKarp(Kombinationer)" + +#~ msgid "`#2718 `__ pgr_maxFlow(Combinations)" +#~ msgstr "`#2718 `__ pgr_maxFlow(Kombinationer)" + +#~ msgid "`#2718 `__ pgr_pushRelabel(Combinations)" +#~ msgstr "`#2718 `__ pgr_pushRelabel(Kombinationer)" + +#~ msgid "`#2904 `__ Standardize output columns of functions with different output columns within overloads" +#~ msgstr "`#2904 `__ Standardisera utdatakolumner för funktioner med olika utdatakolumner inom överbelastningar" + +#~ msgid "`#2905 `__ pgr_withPoints" +#~ msgstr "`#2905 `__ pgr_withPoints" + +#~ msgid "`#2906 `__ pgr_bdDijkstra" +#~ msgstr "`#2906 `__ pgr_bdDijkstra" + +#~ msgid "`#2907 `__ pgr_bellmanFord" +#~ msgstr "`#2907 `__ pgr_bellmanFord" + +#~ msgid "`#2908 `__ pgr_binaryBreadthFirstSearch" +#~ msgstr "`#2908 `__ pgr_binaryBreadthFirstSearch" + +#~ msgid "`#2910 `__ pgr_edwardMoore" +#~ msgstr "`#2910 `__ pgr_edwardMoore" + +#~ msgid "`#2913 `__ pgr_DAGshortestPath" +#~ msgstr "`#2913 `__ pgr_DAGshortestPath" + +#~ msgid "`#2905 `__ pgr_withPointsCost" +#~ msgstr "`#2905 `__ pgr_withPointsCost" + +#~ msgid "`#2905 `__ pgr_withPointsCostMatrix" +#~ msgstr "`#2905 `__ pgr_withPointsCostMatrix" + +#~ msgid "`#2909 `__ pgr_edgeDisjointPaths" +#~ msgstr "`#2909 `__ pgr_edgeDisjointPaths" + +#~ msgid "`#2909 `__ pgr_turnRestrictedPaths" +#~ msgstr "`#2909 `__ pgr_turnRestrictedPaths" + +#~ msgid "`#2924 `__ pgr_edgeColoring" +#~ msgstr "`#2924 `__ pgr_edgeColoring" + +#~ msgid "`#2924 `__ pgr_bipartite" +#~ msgstr "`#2924 `__ pgr_bipartite" + +#~ msgid "`#2927 `__ pgr_sequentialVertexColoring" +#~ msgstr "`#2927 `__ pgr_sequentialVertexColoring" + +#~ msgid "`#2931 `__ pgr_breadthFirstSearch" +#~ msgstr "`#2931 `__ pgr_breadthFirstSearch" + +#~ msgid "`#2931 `__ pgr_depthFirstSearch" +#~ msgstr "`#2931 `__ pgr_depthFirstSearch" + +#~ msgid "`#2934 `__ pgr_topologicalSort" +#~ msgstr "`#2934 `__ pgr_topologicalSort" + +#~ msgid "`#2934 `__ pgr_transitiveClosure" +#~ msgstr "`#2934 `__ pgr_transitiveClosure" + +#~ msgid "`#2751 `__: pgr_createTopology" +#~ msgstr "`#2751 `__: pgr_createTopology" #~ msgid "#2748 _pgr_alphashape(text,double precision)" #~ msgstr "#2748 _pgr_alphashape(text,dubbel precision)" @@ -22696,17 +16721,11 @@ msgstr "pgr_withPointsvia is pgr_dijkstraVia **with points**" #~ msgid "#2730 _pgr_dijkstranear(text,bigint,anyarray,bigint,boolean)" #~ msgstr "#2730 _pgr_dijkstranear(text,bigint,anyarray,bigint,boolean)" -#~ msgid "" -#~ "#2730 _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" -#~ msgstr "" -#~ "#2730 _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" +#~ msgid "#2730 _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" +#~ msgstr "#2730 _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" -#~ msgid "" -#~ "#2730 _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint," -#~ "boolean)" -#~ msgstr "" -#~ "#2730 _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint," -#~ "boolean)" +#~ msgid "#2730 _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" +#~ msgstr "#2730 _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" #~ msgid "#2730 _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" #~ msgstr "#2730 _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" @@ -22714,11 +16733,8 @@ msgstr "pgr_withPointsvia is pgr_dijkstraVia **with points**" #~ msgid "#2730 _pgr_dijkstra(text,text,boolean,boolean,boolean)" #~ msgstr "#2730 _pgr_dijkstra(text,text,boolean,boolean,boolean)" -#~ msgid "" -#~ "#2735 _pgr_drivingdistance(text,anyarray,double precision,boolean,boolean)" -#~ msgstr "" -#~ "#2735 _pgr_drivingdistance(text,valfri matris,dubbel precision,boolean," -#~ "boolean)" +#~ msgid "#2735 _pgr_drivingdistance(text,anyarray,double precision,boolean,boolean)" +#~ msgstr "#2735 _pgr_drivingdistance(text,valfri matris,dubbel precision,boolean,boolean)" #~ msgid "#2861 _pgr_endpoint(geometry)" #~ msgstr "#2861 _pgr_slutpunkt(geometri)" @@ -22750,11 +16766,8 @@ msgstr "pgr_withPointsvia is pgr_dijkstraVia **with points**" #~ msgid "#2745 _pgr_kruskal(text,anyarray,text,bigint,double precision)" #~ msgstr "#2745 _pgr_kruskal(text,valfri matris,text,bigint,dubbel precision)" -#~ msgid "" -#~ "#2897 _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean)" -#~ msgstr "" -#~ "#2897 _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean," -#~ "boolean)" +#~ msgid "#2897 _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean)" +#~ msgstr "#2897 _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean,boolean)" #~ msgid "#2897 _pgr_ksp(text,bigint,bigint,integer,boolean,boolean)" #~ msgstr "#2897 _pgr_ksp(text,bigint,bigint,integer,boolean,boolean)" @@ -22783,12 +16796,8 @@ msgstr "pgr_withPointsvia is pgr_dijkstraVia **with points**" #~ msgid "#2861 _pgr_startpoint(geometry)" #~ msgstr "#2861 _pgr_startpunkt(geometri)" -#~ msgid "" -#~ "#2683 _pgr_trsp(text,integer,double precision,integer,double precision," -#~ "boolean,boolean,text)" -#~ msgstr "" -#~ "#2683 _pgr_trsp(text,heltal,dubbel precision,heltal,dubbel precision," -#~ "boolean,boolean,text)" +#~ msgid "#2683 _pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +#~ msgstr "#2683 _pgr_trsp(text,heltal,dubbel precision,heltal,dubbel precision,boolean,boolean,text)" #~ msgid "#2683 _pgr_trsp(text,text,anyarray,anyarray,boolean)" #~ msgstr "#2683 _pgr_trsp(text,text,valfri matris,valfri matris,boolean)" @@ -22805,80 +16814,41 @@ msgstr "pgr_withPointsvia is pgr_dijkstraVia **with points**" #~ msgid "#2682 _pgr_trspviavertices(text,integer[],boolean,boolean,text)" #~ msgstr "#2682 _pgr_trspviavertices(text,heltal[],boolean,boolean,text)" -#~ msgid "" -#~ "#2919 _pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean," -#~ "boolean,character,boolean)" -#~ msgstr "" -#~ "#2919 _pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean," -#~ "boolean,character,boolean)" - -#~ msgid "" -#~ "#2919 _pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean," -#~ "character,boolean)" -#~ msgstr "" -#~ "#2919 _pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean," -#~ "tecken,boolean)" - -#~ msgid "" -#~ "#2919 _pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" -#~ msgstr "" -#~ "#2919 _pgr_trsp_withpoints(text,text,text,text,boolean,tecken,boolean)" - -#~ msgid "" -#~ "#2901 _pgr_tspeuclidean(text,bigint,bigint,double precision,integer," -#~ "integer,integer,double precision,double precision,double precision," -#~ "boolean)" -#~ msgstr "" -#~ "#2901 _pgr_tspeuclidean(text,bigint,bigint,dubbel precision,heltal,heltal," -#~ "heltal,dubbel precision,dubbel precision,dubbel precision,boolean)" - -#~ msgid "" -#~ "#2901 _pgr_tsp(text,bigint,bigint,double precision,integer,integer," -#~ "integer,double precision,double precision,double precision,boolean)" -#~ msgstr "" -#~ "#2901 _pgr_tsp(text,bigint,bigint,dubbel precision,heltal,heltal,heltal," -#~ "dubbel precision,dubbel precision,dubbel precision,boolean)" +#~ msgid "#2919 _pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +#~ msgstr "#2919 _pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" + +#~ msgid "#2919 _pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +#~ msgstr "#2919 _pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,tecken,boolean)" + +#~ msgid "#2919 _pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" +#~ msgstr "#2919 _pgr_trsp_withpoints(text,text,text,text,boolean,tecken,boolean)" + +#~ msgid "#2901 _pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +#~ msgstr "#2901 _pgr_tspeuclidean(text,bigint,bigint,dubbel precision,heltal,heltal,heltal,dubbel precision,dubbel precision,dubbel precision,boolean)" + +#~ msgid "#2901 _pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +#~ msgstr "#2901 _pgr_tsp(text,bigint,bigint,dubbel precision,heltal,heltal,heltal,dubbel precision,dubbel precision,dubbel precision,boolean)" #~ msgid "#2861 _pgr_versionless(text,text)" #~ msgstr "#2861 _pgr_versionless(text,text)" -#~ msgid "" -#~ "#2890 _pgr_withpointsdd(text,text,anyarray,double precision,boolean," -#~ "character,boolean,boolean)" -#~ msgstr "" -#~ "#2890 _pgr_withpointsdd(text,text,valfri matris,dubbel precision,boolean," -#~ "tecken,boolean,boolean)" - -#~ msgid "" -#~ "#2895 _pgr_withpointsksp(text,text,anyarray,anyarray,integer,character," -#~ "boolean,boolean,boolean,boolean)" -#~ msgstr "" -#~ "#2895 _pgr_withpointsksp(text,text,anyarray,anyarray,integer,character," -#~ "boolean,boolean,boolean,boolean,boolean)" - -#~ msgid "" -#~ "#2895 _pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean," -#~ "character,boolean)" -#~ msgstr "" -#~ "#2895 _pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean," -#~ "character,boolean)" - -#~ msgid "" -#~ "#2895 _pgr_withpointsksp(text,text,text,integer,character,boolean,boolean," -#~ "boolean)" -#~ msgstr "" -#~ "#2895 _pgr_withpointsksp(text,text,text,heltal,tecken,boolean,boolean," -#~ "boolean)" +#~ msgid "#2890 _pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +#~ msgstr "#2890 _pgr_withpointsdd(text,text,valfri matris,dubbel precision,boolean,tecken,boolean,boolean)" + +#~ msgid "#2895 _pgr_withpointsksp(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean)" +#~ msgstr "#2895 _pgr_withpointsksp(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean,boolean)" + +#~ msgid "#2895 _pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +#~ msgstr "#2895 _pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" + +#~ msgid "#2895 _pgr_withpointsksp(text,text,text,integer,character,boolean,boolean,boolean)" +#~ msgstr "#2895 _pgr_withpointsksp(text,text,text,heltal,tecken,boolean,boolean,boolean)" #~ msgid "#2741 _pgr_withpointsvia(text,bigint[],double precision[],boolean)" #~ msgstr "#2741 _pgr_withpointsvia(text,bigint[],dubbel precision[],boolean)" -#~ msgid "" -#~ "#2741 _pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean," -#~ "character,boolean)" -#~ msgstr "" -#~ "#2741 _pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean," -#~ "boolean,character,boolean)" +#~ msgid "#2741 _pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +#~ msgstr "#2741 _pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,boolean,character,boolean)" #~ msgid "#2683 _trsp(text,text,anyarray,anyarray,boolean)" #~ msgstr "#2683 _trsp(text,text,valfri matris,valfri matris,boolean)" @@ -22892,149 +16862,80 @@ msgstr "pgr_withPointsvia is pgr_dijkstraVia **with points**" #~ msgid "#2748 pgr_alphashape(geometry,double precision)" #~ msgstr "#2748 pgr_alphashape(geometri,dubbel precision)" -#~ msgid "" -#~ "#2752 pgr_analyzegraph(text,double precision,text,text,text,text,text)" -#~ msgstr "" -#~ "#2752 pgr_analyzegraph(text,dubbel precision,text,text,text,text,text," -#~ "text)" +#~ msgid "#2752 pgr_analyzegraph(text,double precision,text,text,text,text,text)" +#~ msgstr "#2752 pgr_analyzegraph(text,dubbel precision,text,text,text,text,text,text)" -#~ msgid "" -#~ "#2755 pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text," -#~ "text,text)" -#~ msgstr "" -#~ "#2755 pgr_analyzeoneway(text,text[],text[],text[],text[],text[],boolean," -#~ "text,text,text)" +#~ msgid "#2755 pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)" +#~ msgstr "#2755 pgr_analyzeoneway(text,text[],text[],text[],text[],text[],boolean,text,text,text)" #~ msgid "#2798 pgr_contraction(text,bigint[],integer,bigint[],boolean)" #~ msgstr "#2798 pgr_contraction(text,bigint[],integer,bigint[],boolean)" -#~ msgid "" -#~ "#2751 pgr_createtopology(text,double precision,text,text,text,text,text," -#~ "boolean)" -#~ msgstr "" -#~ "#2751 pgr_createtopology(text,dubbel precision,text,text,text,text,text," -#~ "text,boolean)" +#~ msgid "#2751 pgr_createtopology(text,double precision,text,text,text,text,text,boolean)" +#~ msgstr "#2751 pgr_createtopology(text,dubbel precision,text,text,text,text,text,text,boolean)" #~ msgid "#2827 pgr_createverticestable(text,text,text,text,text)" #~ msgstr "#2827 pgr_createverticestable(text,text,text,text,text,text)" -#~ msgid "" -#~ "#2888 pgr_findcloseedges(text,geometry,double precision,integer,boolean," -#~ "boolean)" -#~ msgstr "" -#~ "#2888 pgr_findcloseedges(text,geometry,dubbel precision,heltal,boolean," -#~ "boolean)" +#~ msgid "#2888 pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" +#~ msgstr "#2888 pgr_findcloseedges(text,geometry,dubbel precision,heltal,boolean,boolean)" -#~ msgid "" -#~ "#2888 pgr_findcloseedges(text,geometry[],double precision,integer,boolean," -#~ "boolean)" -#~ msgstr "" -#~ "#2888 pgr_findcloseedges(text,geometry[],dubbel precision,heltal,boolean," -#~ "boolean)" +#~ msgid "#2888 pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" +#~ msgstr "#2888 pgr_findcloseedges(text,geometry[],dubbel precision,heltal,boolean,boolean)" #~ msgid "#2899 pgr_maxcardinalitymatch(text,boolean)" #~ msgstr "#2899 pgr_maxcardinalitymatch(text,boolean)" -#~ msgid "" -#~ "#2886 pgr_nodenetwork(text,double precision,text,text,text,text,boolean)" -#~ msgstr "" -#~ "#2886 pgr_nodenetwork(text,dubbel precision,text,text,text,text,text," -#~ "boolean)" +#~ msgid "#2886 pgr_nodenetwork(text,double precision,text,text,text,text,boolean)" +#~ msgstr "#2886 pgr_nodenetwork(text,dubbel precision,text,text,text,text,text,boolean)" -#~ msgid "" -#~ "#2683 pgr_trsp(text,integer,double precision,integer,double precision," -#~ "boolean,boolean,text)" -#~ msgstr "" -#~ "#2683 pgr_trsp(text,heltal,dubbel precision,heltal,dubbel precision," -#~ "boolean,boolean,text)" +#~ msgid "#2683 pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +#~ msgstr "#2683 pgr_trsp(text,heltal,dubbel precision,heltal,dubbel precision,boolean,boolean,text)" #~ msgid "#2683 pgr_trsp(text,integer,integer,boolean,boolean,text)" #~ msgstr "#2683 pgr_trsp(text,heltal,heltal,boolean,boolean,text)" -#~ msgid "" -#~ "#2681 pgr_trspviaedges(text,integer[],double precision[],boolean,boolean," -#~ "text)" -#~ msgstr "" -#~ "#2681 pgr_trspviaedges(text,heltal[],dubbel precision[],boolean,boolean," -#~ "text)" +#~ msgid "#2681 pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +#~ msgstr "#2681 pgr_trspviaedges(text,heltal[],dubbel precision[],boolean,boolean,text)" #~ msgid "#2682 pgr_trspviavertices(text,anyarray,boolean,boolean,text)" #~ msgstr "#2682 pgr_trspviavertices(text,valfri matris,boolean,boolean,text)" -#~ msgid "" -#~ "#2919 pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean," -#~ "boolean,character,boolean)" -#~ msgstr "" -#~ "#2919 pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean," -#~ "boolean,boolean,character,boolean)" - -#~ msgid "" -#~ "#2919 pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean," -#~ "character,boolean)" -#~ msgstr "" -#~ "#2919 pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean," -#~ "character,boolean)" - -#~ msgid "" -#~ "#2919 pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean," -#~ "character,boolean)" -#~ msgstr "" -#~ "#2919 pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean," -#~ "character,boolean)" - -#~ msgid "" -#~ "#2919 pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean," -#~ "character,boolean)" -#~ msgstr "" -#~ "#2919 pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean," -#~ "character,boolean)" - -#~ msgid "" -#~ "#2919 pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character," -#~ "boolean)" -#~ msgstr "" -#~ "#2919 pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,tecken," -#~ "boolean)" - -#~ msgid "" -#~ "#2919 pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" -#~ msgstr "" -#~ "#2919 pgr_trsp_withpoints(text,text,text,text,boolean,tecken,boolean)" - -#~ msgid "" -#~ "#2901 pgr_tspeuclidean(text,bigint,bigint,double precision,integer," -#~ "integer,integer,double precision,double precision,double precision," -#~ "boolean)" -#~ msgstr "" -#~ "#2901 pgr_tspeuclidean(text,bigint,bigint,dubbel precision,heltal,heltal," -#~ "heltal,dubbel precision,dubbel precision,dubbel precision,boolean)" - -#~ msgid "" -#~ "#2901 pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer," -#~ "double precision,double precision,double precision,boolean)" -#~ msgstr "" -#~ "#2901 pgr_tsp(text,bigint,bigint,dubbel precision,heltal,heltal,heltal," -#~ "dubbel precision,dubbel precision,dubbel precision,boolean)" +#~ msgid "#2919 pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +#~ msgstr "#2919 pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,boolean,character,boolean)" + +#~ msgid "#2919 pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +#~ msgstr "#2919 pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" + +#~ msgid "#2919 pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +#~ msgstr "#2919 pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" + +#~ msgid "#2919 pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +#~ msgstr "#2919 pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" + +#~ msgid "#2919 pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" +#~ msgstr "#2919 pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,tecken,boolean)" + +#~ msgid "#2919 pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" +#~ msgstr "#2919 pgr_trsp_withpoints(text,text,text,text,boolean,tecken,boolean)" + +#~ msgid "#2901 pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +#~ msgstr "#2901 pgr_tspeuclidean(text,bigint,bigint,dubbel precision,heltal,heltal,heltal,dubbel precision,dubbel precision,dubbel precision,boolean)" + +#~ msgid "#2901 pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +#~ msgstr "#2901 pgr_tsp(text,bigint,bigint,dubbel precision,heltal,heltal,heltal,dubbel precision,dubbel precision,dubbel precision,boolean)" #~ msgid "#2919 pgr_withpointscostmatrix(text,text,anyarray,boolean,character)" -#~ msgstr "" -#~ "#2919 pgr_withpointscostmatrix(text,text,anyarray,boolean,character)" +#~ msgstr "#2919 pgr_withpointscostmatrix(text,text,anyarray,boolean,character)" -#~ msgid "" -#~ "#2919 pgr_withpointscost(text,text,anyarray,anyarray,boolean,character)" -#~ msgstr "" -#~ "#2919 pgr_withpointscost(text,text,valfri matris,valfri matris,boolean," -#~ "tecken)" +#~ msgid "#2919 pgr_withpointscost(text,text,anyarray,anyarray,boolean,character)" +#~ msgstr "#2919 pgr_withpointscost(text,text,valfri matris,valfri matris,boolean,tecken)" -#~ msgid "" -#~ "#2919 pgr_withpointscost(text,text,anyarray,bigint,boolean,character)" -#~ msgstr "" -#~ "#2919 pgr_withpointscost(text,text,anyarray,bigint,boolean,character)" +#~ msgid "#2919 pgr_withpointscost(text,text,anyarray,bigint,boolean,character)" +#~ msgstr "#2919 pgr_withpointscost(text,text,anyarray,bigint,boolean,character)" -#~ msgid "" -#~ "#2919 pgr_withpointscost(text,text,bigint,anyarray,boolean,character)" -#~ msgstr "" -#~ "#2919 pgr_withpointscost(text,text,bigint,anyarray,boolean,character)" +#~ msgid "#2919 pgr_withpointscost(text,text,bigint,anyarray,boolean,character)" +#~ msgstr "#2919 pgr_withpointscost(text,text,bigint,anyarray,boolean,character)" #~ msgid "#2919 pgr_withpointscost(text,text,bigint,bigint,boolean,character)" #~ msgstr "#2919 pgr_withpointscost(text,text,bigint,bigint,boolean,character)" @@ -23042,58 +16943,32 @@ msgstr "pgr_withPointsvia is pgr_dijkstraVia **with points**" #~ msgid "#2919 pgr_withpointscost(text,text,text,boolean,character)" #~ msgstr "#2919 pgr_withpointscost(text,text,text,boolean,tecken)" -#~ msgid "" -#~ "#2890 pgr_withpointsdd(text,text,anyarray,double precision,boolean," -#~ "character,boolean,boolean)" -#~ msgstr "" -#~ "#2890 pgr_withpointsdd(text,text,valfri matris,dubbel precision,boolean," -#~ "tecken,boolean,boolean)" - -#~ msgid "" -#~ "#2890 pgr_withpointsdd(text,text,bigint,double precision,boolean," -#~ "character,boolean)" -#~ msgstr "" -#~ "#2890 pgr_withpointsdd(text,text,bigint,dubbel precision,boolean,tecken," -#~ "boolean)" - -#~ msgid "" -#~ "#2895 pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean," -#~ "character,boolean)" -#~ msgstr "" -#~ "#2895 pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean," -#~ "character,boolean)" - -#~ msgid "" -#~ "#2919 pgr_withpoints(text,text,anyarray,anyarray,boolean,character," -#~ "boolean)" -#~ msgstr "" -#~ "#2919 pgr_withpoints(text,text,valfri matris,valfri matris,boolean,tecken," -#~ "boolean)" - -#~ msgid "" -#~ "#2919 pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)" -#~ msgstr "" -#~ "#2919 pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)" - -#~ msgid "" -#~ "#2919 pgr_withpoints(text,text,bigint,anyarray,boolean,character,boolean)" -#~ msgstr "" -#~ "#2919 pgr_withpoints(text,text,bigint,anyarray,boolean,tecken,boolean)" - -#~ msgid "" -#~ "#2919 pgr_withpoints(text,text,bigint,bigint,boolean,character,boolean)" -#~ msgstr "" -#~ "#2919 pgr_withpoints(text,text,bigint,bigint,boolean,tecken,boolean)" +#~ msgid "#2890 pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +#~ msgstr "#2890 pgr_withpointsdd(text,text,valfri matris,dubbel precision,boolean,tecken,boolean,boolean)" + +#~ msgid "#2890 pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +#~ msgstr "#2890 pgr_withpointsdd(text,text,bigint,dubbel precision,boolean,tecken,boolean)" + +#~ msgid "#2895 pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +#~ msgstr "#2895 pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" + +#~ msgid "#2919 pgr_withpoints(text,text,anyarray,anyarray,boolean,character,boolean)" +#~ msgstr "#2919 pgr_withpoints(text,text,valfri matris,valfri matris,boolean,tecken,boolean)" + +#~ msgid "#2919 pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)" +#~ msgstr "#2919 pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)" + +#~ msgid "#2919 pgr_withpoints(text,text,bigint,anyarray,boolean,character,boolean)" +#~ msgstr "#2919 pgr_withpoints(text,text,bigint,anyarray,boolean,tecken,boolean)" + +#~ msgid "#2919 pgr_withpoints(text,text,bigint,bigint,boolean,character,boolean)" +#~ msgstr "#2919 pgr_withpoints(text,text,bigint,bigint,boolean,tecken,boolean)" #~ msgid "#2919 pgr_withpoints(text,text,text,boolean,character,boolean)" #~ msgstr "#2919 pgr_withpoints(text,text,text,boolean,tecken,boolean)" -#~ msgid "" -#~ "#2919 pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean," -#~ "character,boolean)" -#~ msgstr "" -#~ "#2919 pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean," -#~ "boolean,character,boolean)" +#~ msgid "#2919 pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +#~ msgstr "#2919 pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,boolean,character,boolean)" #~ msgid "#2683 _trsp" #~ msgstr "#2683 _trsp" @@ -23110,12 +16985,8 @@ msgstr "pgr_withPointsvia is pgr_dijkstraVia **with points**" #~ msgid "Validity of **driving side** parameter" #~ msgstr "Giltighet för parametern **förarsida**" -#~ msgid "" -#~ "**driving side** parameter is unnamed compulsory, and valid values differ " -#~ "for directed and undirected graphs." -#~ msgstr "" -#~ "*parametern *driving side** är obligatorisk utan namn och giltiga värden " -#~ "skiljer sig åt för riktade och oriktade grafer." +#~ msgid "**driving side** parameter is unnamed compulsory, and valid values differ for directed and undirected graphs." +#~ msgstr "*parametern *driving side** är obligatorisk utan namn och giltiga värden skiljer sig åt för riktade och oriktade grafer." #~ msgid "Does not have a default value." #~ msgstr "Har inget förinställt värde." @@ -23123,19 +16994,11 @@ msgstr "pgr_withPointsvia is pgr_dijkstraVia **with points**" #~ msgid "Using an invalid value throws an ``ERROR``." #~ msgstr "Om du använder ett ogiltigt värde får du ett ``ERROR``." -#~ msgid "" -#~ "And ``driving side`` parameter changed from named optional to unnamed " -#~ "compulsory **driving side** and its validity differ for directed and " -#~ "undirected graphs." -#~ msgstr "" -#~ "Parametern ``driving side`` ändrades från namngiven valfri till icke " -#~ "namngiven obligatorisk **driving side** och dess giltighet skiljer sig åt " -#~ "för riktade och oriktade grafer." +#~ msgid "And ``driving side`` parameter changed from named optional to unnamed compulsory **driving side** and its validity differ for directed and undirected graphs." +#~ msgstr "Parametern ``driving side`` ändrades från namngiven valfri till icke namngiven obligatorisk **driving side** och dess giltighet skiljer sig åt för riktade och oriktade grafer." -#~ msgid "" -#~ "pgr_dijkstra(`Kanter SQL`_, **start vids**, **end vids**, [``directed``])" -#~ msgstr "" -#~ "pgr_dijkstra(`Kanter SQL`_, **start vids**, **end vids**, [``directed``])" +#~ msgid "pgr_dijkstra(`Kanter SQL`_, **start vids**, **end vids**, [``directed``])" +#~ msgstr "pgr_dijkstra(`Kanter SQL`_, **start vids**, **end vids**, [``directed``])" #~ msgid ":ref:`install-short`" #~ msgstr ":ref:`install-short`" @@ -23158,14 +17021,8 @@ msgstr "pgr_withPointsvia is pgr_dijkstraVia **with points**" #~ msgid ":ref:`install_testing`" #~ msgstr ":ref:`install_testing`" -#~ msgid "" -#~ "To use pgRouting PostGIS needs to be installed, please read the " -#~ "information about installation in this `Install Guide `__" -#~ msgstr "" -#~ "För att använda pgRouting måste PostGIS installeras, läs informationen om " -#~ "installation i denna `Installationsguide `__" +#~ msgid "To use pgRouting PostGIS needs to be installed, please read the information about installation in this `Install Guide `__" +#~ msgstr "För att använda pgRouting måste PostGIS installeras, läs informationen om installation i denna `Installationsguide `__" #~ msgid "Postgresql version = Supported versions by PostgreSQL" #~ msgstr "Postgresql-version = Versioner som stöds av PostgreSQL" @@ -23200,12 +17057,8 @@ msgstr "pgr_withPointsvia is pgr_dijkstraVia **with points**" #~ msgid "To exit psql console" #~ msgstr "Så här avslutar du psql-konsolen" -#~ msgid "" -#~ "Entering psql console directly without switching roles can be done by the " -#~ "following commands" -#~ msgstr "" -#~ "Du kan gå in i psql-konsolen direkt utan att byta roll med följande " -#~ "kommandon" +#~ msgid "Entering psql console directly without switching roles can be done by the following commands" +#~ msgstr "Du kan gå in i psql-konsolen direkt utan att byta roll med följande kommandon" #~ msgid "Then use the above given method to exit out of the psql console" #~ msgstr "Använd sedan ovanstående metod för att avsluta psql-konsolen" @@ -23222,31 +17075,14 @@ msgstr "pgr_withPointsvia is pgr_dijkstraVia **with points**" #~ msgid "Creating PostgreSQL role" #~ msgstr "Skapa PostgreSQL-roll" -#~ 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 "" -#~ "Standardrollen som tillhandahålls av PostgreSQL är postgres. För att " -#~ "skapa nya roller kan du använda ovanstående kommandon. Prompten kommer " -#~ "att be användaren att skriva namnet på rollen och sedan ge bekräftelse. " -#~ "Fortsätt med stegen så kommer du att lyckas skapa PostgreSQL-rollen " -#~ "framgångsrikt." - -#~ msgid "" -#~ "To add password to the role or change previously created password of the " -#~ "role use the following commands" -#~ msgstr "" -#~ "Använd följande kommandon om du vill lägga till ett lösenord för rollen " -#~ "eller ändra ett tidigare skapat lösenord för rollen" - -#~ msgid "" -#~ "To get additional details on the flags associated with ``createuser`` " -#~ "below given command can be used" -#~ msgstr "" -#~ "För att få ytterligare information om de flaggor som är associerade med " -#~ "``createuser`` kan nedanstående kommando användas" +#~ 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 "Standardrollen som tillhandahålls av PostgreSQL är postgres. För att skapa nya roller kan du använda ovanstående kommandon. Prompten kommer att be användaren att skriva namnet på rollen och sedan ge bekräftelse. Fortsätt med stegen så kommer du att lyckas skapa PostgreSQL-rollen framgångsrikt." + +#~ msgid "To add password to the role or change previously created password of the role use the following commands" +#~ msgstr "Använd följande kommandon om du vill lägga till ett lösenord för rollen eller ändra ett tidigare skapat lösenord för rollen" + +#~ msgid "To get additional details on the flags associated with ``createuser`` below given command can be used" +#~ msgstr "För att få ytterligare information om de flaggor som är associerade med ``createuser`` kan nedanstående kommando användas" #~ msgid "Creating Database in PostgreSQL" #~ msgstr "Skapa databas i PostgreSQL" @@ -23278,8 +17114,7 @@ msgstr "pgr_withPointsvia is pgr_dijkstraVia **with points**" #~ msgid "The following instructions start from *path/to/pgrouting/build*" #~ msgstr "Följande instruktioner startar från *stig/till/pgrouting/build*" -#~ msgid "" -#~ "The sql signatures are configured and build in the ``cmake`` command." +#~ msgid "The sql signatures are configured and build in the ``cmake`` command." #~ msgstr "Sql-signaturerna konfigureras och byggs i kommandot ``cmake``." #~ msgid "MinGW on Windows" @@ -23288,11 +17123,8 @@ msgstr "pgr_withPointsvia is pgr_dijkstraVia **with points**" #~ msgid "The following instructions start from *path/to/pgrouting*" #~ msgstr "Följande instruktioner börjar från *väg/till/grouting*" -#~ msgid "" -#~ "To remove the build when the configuration changes, use the following " -#~ "code:" -#~ msgstr "" -#~ "Använd följande kod för att ta bort build när konfigurationen ändras:" +#~ msgid "To remove the build when the configuration changes, use the following code:" +#~ msgstr "Använd följande kod för att ta bort build när konfigurationen ändras:" #~ msgid "and start the build process as mentioned previously." #~ msgstr "och starta byggprocessen som tidigare nämnts." @@ -23306,68 +17138,26 @@ msgstr "pgr_withPointsvia is pgr_dijkstraVia **with points**" #~ msgid "Aurélie Bousquet, Regina Obe, Vicky Vergara" #~ msgstr "Aurélie Bousquet, Regina Obe, Vicky Vergara" -#~ msgid "" -#~ "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio " -#~ "Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, " -#~ "Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, " -#~ "Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, " -#~ "Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic " -#~ "Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, " -#~ "Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko " -#~ "Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, " -#~ "Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, " -#~ "Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, " -#~ "Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, " -#~ "Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan " -#~ "Jain, Virginia Vergara, Yige Huang" -#~ msgstr "" -#~ "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio " -#~ "Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, " -#~ "Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, " -#~ "Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, " -#~ "Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic " -#~ "Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, " -#~ "Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko " -#~ "Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, " -#~ "Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, " -#~ "Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, " -#~ "Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, " -#~ "Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan " -#~ "Jain, Virginia Vergara, Yige Huang" +#~ msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" +#~ msgstr "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" #~ msgid "New **experimental** function" #~ msgstr "Ny **experimentell** funktion" -#~ msgid "" -#~ "pgr_dijkstraNear(`Kanter SQL`_, **start vids**, **end vid**, " -#~ "[**options**])" -#~ msgstr "" -#~ "pgr_dijkstraNear(`Kanter SQL`_, **start vids**, **end vid**, " -#~ "[**options**])" +#~ msgid "pgr_dijkstraNear(`Kanter SQL`_, **start vids**, **end vid**, [**options**])" +#~ msgstr "pgr_dijkstraNear(`Kanter SQL`_, **start vids**, **end vid**, [**options**])" -#~ msgid "" -#~ "pgr_dijkstraNear(`Kanter SQL`_, **start vids**, **end vids**, " -#~ "[**options**])" -#~ msgstr "" -#~ "pgr_dijkstraNear(`Kanter SQL`_, **start vids**, **end vids**, " -#~ "[**options**])" +#~ msgid "pgr_dijkstraNear(`Kanter SQL`_, **start vids**, **end vids**, [**options**])" +#~ msgstr "pgr_dijkstraNear(`Kanter SQL`_, **start vids**, **end vids**, [**options**])" #~ msgid "``pgr_dijkstraVia`` - Proposed" #~ msgstr "``pgr_dijkstraVia`` - Förslag" -#~ msgid "" -#~ "``pgr_johnson`` - Returns the sum of the costs of the shortest path for " -#~ "each pair of nodes in the graph using Floyd-Warshall algorithm." -#~ msgstr "" -#~ "``pgr_johnson`` - Returnerar summan av kostnaderna för den kortaste vägen " -#~ "för varje par av noder i grafen med hjälp av Floyd-Warshall-algoritmen." +#~ msgid "``pgr_johnson`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Floyd-Warshall algorithm." +#~ msgstr "``pgr_johnson`` - Returnerar summan av kostnaderna för den kortaste vägen för varje par av noder i grafen med hjälp av Floyd-Warshall-algoritmen." -#~ msgid "" -#~ "pgr_trspVia_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, " -#~ "**via vertices**, **driving side** [**options**])" -#~ msgstr "" -#~ "pgr_trspVia_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, " -#~ "**via vertices**, **driving side** [**options**])" +#~ msgid "pgr_trspVia_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, **driving side** [**options**])" +#~ msgstr "pgr_trspVia_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, **driving side** [**options**])" #~ msgid "**driving side**" #~ msgstr "**körning på sidan**" @@ -23381,158 +17171,74 @@ msgstr "pgr_withPointsvia is pgr_dijkstraVia **with points**" #~ msgid "[``b``, ``B``] for both (only for undirected graph)" #~ msgstr "[``b``, ``B``] för båda (endast för oriktad graf)" -#~ msgid "" -#~ "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, " -#~ "**start vid**, **end vid**, [**options**])" -#~ msgstr "" -#~ "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, " -#~ "**start vid**, **end vid**, [**options**])" - -#~ msgid "" -#~ "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, " -#~ "**start vid**, **end vids**, [**options**])" -#~ msgstr "" -#~ "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, " -#~ "**start vid**, **end vids**, [**options**])" - -#~ msgid "" -#~ "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, " -#~ "**start vids**, **end vid**, [**options**])" -#~ msgstr "" -#~ "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, " -#~ "**start vids**, **end vid**, [**options**])" - -#~ msgid "" -#~ "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, " -#~ "**start vids**, **end vids**, [**options**])" -#~ msgstr "" -#~ "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, " -#~ "**start vids**, **end vids**, [**options**])" - -#~ msgid "" -#~ "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Combinations " -#~ "SQL`_, `Points SQL`_, [**options**])" -#~ msgstr "" -#~ "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Combinations " -#~ "SQL`_, `Points SQL`_, [**options**])" +#~ msgid "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vid**, [**options**])" +#~ msgstr "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vid**, [**options**])" + +#~ msgid "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**options**])" +#~ msgstr "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**options**])" + +#~ msgid "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vid**, [**options**])" +#~ msgstr "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vid**, [**options**])" + +#~ msgid "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vids**, [**options**])" +#~ msgstr "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vids**, [**options**])" + +#~ msgid "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Combinations SQL`_, `Points SQL`_, [**options**])" +#~ msgstr "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Combinations SQL`_, `Points SQL`_, [**options**])" #~ msgid "**options:** ``[directed, driving_side, details]``" #~ msgstr "**options:** ``[directed, driving_side, details]``" -#~ msgid "" -#~ "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, " -#~ "**start vid**, **end vids**, **driving side** [**options**])" -#~ msgstr "" -#~ "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, " -#~ "**start vid**, **end vids**, **driving side** [**options**])" - -#~ msgid "" -#~ "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vid**, " -#~ "**driving side** [**options**])" -#~ msgstr "" -#~ "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vid**, " -#~ "**driving side** [**options**])" - -#~ msgid "" -#~ "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vids**, " -#~ "**driving side** [**options**])" -#~ msgstr "" -#~ "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vids**, " -#~ "**driving side** [**options**])" - -#~ msgid "" -#~ "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vid**, " -#~ "**driving side** [**options**])" -#~ msgstr "" -#~ "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vid**, " -#~ "**driving side** [**options**])" - -#~ msgid "" -#~ "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, **start vids**, **end " -#~ "vids**, **driving side** [**options**])" -#~ msgstr "" -#~ "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, **start vids**, **end " -#~ "vids**, **driving side** [**options**])" - -#~ msgid "" -#~ "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, `Combinations SQL`_, " -#~ "**driving side** [**options**])" -#~ msgstr "" -#~ "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, `Combinations SQL`_, " -#~ "**driving side** [**options**])" - -#~ msgid "" -#~ "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, **start vid**, **end " -#~ "vid**, **driving side** [**options**])" -#~ msgstr "" -#~ "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, **start vid**, **end " -#~ "vid**, **driving side** [**options**])" - -#~ msgid "" -#~ "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, **start vid**, **end " -#~ "vids**, **driving side** [**options**])" -#~ msgstr "" -#~ "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, **start vid**, **end " -#~ "vids**, **driving side** [**options**])" - -#~ msgid "" -#~ "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, **start vids**, **end " -#~ "vid**, **driving side** [**options**])" -#~ msgstr "" -#~ "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, **start vids**, **end " -#~ "vid**, **driving side** [**options**])" - -#~ msgid "" -#~ "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, **start vids**, **end " -#~ "vids**, **driving side** [**options**])" -#~ msgstr "" -#~ "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, **start vids**, **end " -#~ "vids**, **driving side** [**options**])" - -#~ msgid "" -#~ "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, `Combinations SQL`_, " -#~ "**driving side** [**options**])" -#~ msgstr "" -#~ "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, `Combinations SQL`_, " -#~ "**driving side** [**options**])" - -#~ msgid "" -#~ "pgr_withPointsCostMatrix(`Kanter SQL`_, `Points SQL`_, **start vids**, " -#~ "**driving side** [**options**])" -#~ msgstr "" -#~ "pgr_withPointsCostMatrix(`Kanter SQL`_, `Points SQL`_, **start vids**, " -#~ "**driving side** [**options**])" +#~ msgid "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, **driving side** [**options**])" +#~ msgstr "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, **driving side** [**options**])" + +#~ msgid "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vid**, **driving side** [**options**])" +#~ msgstr "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vid**, **driving side** [**options**])" + +#~ msgid "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vids**, **driving side** [**options**])" +#~ msgstr "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vids**, **driving side** [**options**])" + +#~ msgid "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vid**, **driving side** [**options**])" +#~ msgstr "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vid**, **driving side** [**options**])" + +#~ msgid "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vids**, **driving side** [**options**])" +#~ msgstr "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vids**, **driving side** [**options**])" + +#~ msgid "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, `Combinations SQL`_, **driving side** [**options**])" +#~ msgstr "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, `Combinations SQL`_, **driving side** [**options**])" + +#~ msgid "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vid**, **driving side** [**options**])" +#~ msgstr "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vid**, **driving side** [**options**])" + +#~ msgid "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vids**, **driving side** [**options**])" +#~ msgstr "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vids**, **driving side** [**options**])" + +#~ msgid "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vid**, **driving side** [**options**])" +#~ msgstr "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vid**, **driving side** [**options**])" + +#~ msgid "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vids**, **driving side** [**options**])" +#~ msgstr "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vids**, **driving side** [**options**])" + +#~ msgid "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, `Combinations SQL`_, **driving side** [**options**])" +#~ msgstr "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, `Combinations SQL`_, **driving side** [**options**])" + +#~ msgid "pgr_withPointsCostMatrix(`Kanter SQL`_, `Points SQL`_, **start vids**, **driving side** [**options**])" +#~ msgstr "pgr_withPointsCostMatrix(`Kanter SQL`_, `Points SQL`_, **start vids**, **driving side** [**options**])" #~ msgid "Using the default ``driving_side`` value" #~ msgstr "Använda standardvärdet för ``driving_side``" -#~ msgid "" -#~ "pgr_withPointsDD(`Kanter SQL`_, `Points SQL`_, **root vid**, " -#~ "**distance**, **driving side**, [**options A**])" -#~ msgstr "" -#~ "pgr_withPointsDD(`Kanter SQL`_, `Points SQL`_, **root vid**, " -#~ "**distance**, **driving side**, [**options A**])" - -#~ msgid "" -#~ "pgr_withPointsDD(`Kanter SQL`_, `Points SQL`_, **root vids**, " -#~ "**distance**, **driving side**, [**options B**])" -#~ msgstr "" -#~ "pgr_withPointsDD(`Kanter SQL`_, `Points SQL`_, **root vids**, " -#~ "**distance**, **driving side**, [**options B**])" - -#~ msgid "" -#~ "pgr_withPointsDD(`Kanter SQL`_, `Points SQL`_, **root vid**, " -#~ "**distance**, **driving side**, [**options**])" -#~ msgstr "" -#~ "pgr_withPointsDD(`Kanter SQL`_, `Points SQL`_, **root vid**, " -#~ "**distance**, **driving side**, [**options**])" - -#~ msgid "" -#~ "pgr_withPointsDD(`Kanter SQL`_, `Points SQL`_, **root vids**, " -#~ "**distance**, **driving side**, [**options**])" -#~ msgstr "" -#~ "pgr_withPointsDD(`Kanter SQL`_, `Points SQL`_, **root vids**, " -#~ "**distance**, **driving side**, [**options**])" +#~ msgid "pgr_withPointsDD(`Kanter SQL`_, `Points SQL`_, **root vid**, **distance**, **driving side**, [**options A**])" +#~ msgstr "pgr_withPointsDD(`Kanter SQL`_, `Points SQL`_, **root vid**, **distance**, **driving side**, [**options A**])" + +#~ msgid "pgr_withPointsDD(`Kanter SQL`_, `Points SQL`_, **root vids**, **distance**, **driving side**, [**options B**])" +#~ msgstr "pgr_withPointsDD(`Kanter SQL`_, `Points SQL`_, **root vids**, **distance**, **driving side**, [**options B**])" + +#~ msgid "pgr_withPointsDD(`Kanter SQL`_, `Points SQL`_, **root vid**, **distance**, **driving side**, [**options**])" +#~ msgstr "pgr_withPointsDD(`Kanter SQL`_, `Points SQL`_, **root vid**, **distance**, **driving side**, [**options**])" + +#~ msgid "pgr_withPointsDD(`Kanter SQL`_, `Points SQL`_, **root vids**, **distance**, **driving side**, [**options**])" +#~ msgstr "pgr_withPointsDD(`Kanter SQL`_, `Points SQL`_, **root vids**, **distance**, **driving side**, [**options**])" #~ msgid "``r``, ``R`` for right driving side," #~ msgstr "``R``, ``R`` för höger körsida," @@ -23552,919 +17258,328 @@ msgstr "pgr_withPointsvia is pgr_dijkstraVia **with points**" #~ msgid "In undirected graphs: [``b``, ``B``]." #~ msgstr "I oriktade grafer: [``b``, ``B``]." -#~ msgid "" -#~ "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, **start vid**, **end " -#~ "vid**, **K**, **driving_side**, [**options**])" -#~ msgstr "" -#~ "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, **start vid**, **end " -#~ "vid**, **K**, **driving_side**, [**options**])" - -#~ msgid "" -#~ "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, **start vid**, **end " -#~ "vids**, **K**, **driving_side**, [**options**])" -#~ msgstr "" -#~ "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, **start vid**, **end " -#~ "vids**, **K**, **driving_side**, [**options**])" - -#~ msgid "" -#~ "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, **start vids**, **end " -#~ "vid**, **K**, **driving_side**, [**options**])" -#~ msgstr "" -#~ "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, **start vids**, **end " -#~ "vid**, **K**, **driving_side**, [**options**])" - -#~ msgid "" -#~ "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, **start vids**, **end " -#~ "vids**, **K**, **driving_side**, [**options**])" -#~ msgstr "" -#~ "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, **start vids**, **end " -#~ "vids**, **K**, **driving_side**, [**options**])" - -#~ msgid "" -#~ "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, `Combinations SQL`_, " -#~ "**K**, **driving_side**, [**options**])" -#~ msgstr "" -#~ "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, `Combinations SQL`_, " -#~ "**K**, **driving_side**, [**options**])" - -#~ msgid "" -#~ "pgr_withPointsVia(`Kanter SQL`_, `Points SQL`_, **via vertices**, " -#~ "**driving side** [**options**])" -#~ msgstr "" -#~ "pgr_withPointsVia(`Kanter SQL`_, `Points SQL`_, **via vertices**, " -#~ "**driving side** [**options**])" - -#~ msgid "" -#~ "To see all issues & pull requests closed by this release see the `Git " -#~ "closed milestone for 3.8.0 `__" -#~ msgstr "" -#~ "För att se alla problem och pull requests som stängts av den här utgåvan, " -#~ "se `Git stängd milstolpe för 3.8.0 `__" - -#~ msgid "" -#~ "Other enhancements: `#2869 `__" -#~ msgstr "" -#~ "Andra förbättringar: `#2869 `__" - -#~ msgid "" -#~ "To see all issues & pull requests closed by this release see the `Git " -#~ "closed milestone for 3.7.3 `__" -#~ msgstr "" -#~ "För att se alla problem och pull requests som stängts av den här utgåvan, " -#~ "se `Git stängd milstolpe för 3.7.3 `__" - -#~ msgid "" -#~ "`#2731 `__ Build " -#~ "Failure on Ubuntu 22" -#~ msgstr "" -#~ "`#2731 `__ Byggfel på " -#~ "Ubuntu 22" - -#~ msgid "" -#~ "To see all issues & pull requests closed by this release see the `Git " -#~ "closed milestone for 3.7.2 `__" -#~ msgstr "" -#~ "För att se alla problem och pull requests som stängts av den här utgåvan, " -#~ "se `Git-stängd milstolpe för 3.7.2 `__" - -#~ msgid "" -#~ "`#2713 `__ cmake " -#~ "missing some policies and min version" -#~ msgstr "" -#~ "`#2713 `__ cmake saknar " -#~ "vissa policyer och min-version" - -#~ msgid "" -#~ "`#2707 `__ Build " -#~ "failure in pgRouting 3.7.1 on Alpine" -#~ msgstr "" -#~ "`#2707 `__ Byggfel i " -#~ "pgRouting 3.7.1 på Alpine" - -#~ msgid "" -#~ "`#2706 `__ winnie " -#~ "crashing on pgr_betweennessCentrality" -#~ msgstr "" -#~ "`#2706 `__ winnie " -#~ "kraschar på pgr_betweennessCentrality" - -#~ msgid "" -#~ "To see all issues & pull requests closed by this release see the `Git " -#~ "closed milestone for 3.7.1 `__" -#~ msgstr "" -#~ "För att se alla problem och pull requests som stängts av den här utgåvan, " -#~ "se `Git-stängd milstolpe för 3.7.1 `__" - -#~ msgid "" -#~ "`#2680 `__ fails to " -#~ "compile under mingw64 gcc 13.2" -#~ msgstr "" -#~ "`#2680 `__ kan inte " -#~ "kompileras under mingw64 gcc 13.2" - -#~ msgid "" -#~ "`#2689 `__ When point " -#~ "is a vertex, the withPoints family do not return results." -#~ msgstr "" -#~ "`#2689 `__ När punkten " -#~ "är en vertex ger inte withPoints-familjen några resultat." - -#~ msgid "" -#~ "To see all issues & pull requests closed by this release see the `Git " -#~ "closed milestone for 3.7.0 `__" -#~ msgstr "" -#~ "För att se alla problem och pull requests som stängts av den här utgåvan, " -#~ "se `Git stängd milstolpe för 3.7.0 `__" - -#~ msgid "" -#~ "`#2656 `__ Stop support " -#~ "of PostgreSQL12 on pgrouting v3.7" -#~ msgstr "" -#~ "`#2656 `__ Stoppa stöd " -#~ "för PostgreSQL12 på pgrouting v3.7" - -#~ msgid "" -#~ "`#2605 `__ Standardize " -#~ "spanning tree functions output" -#~ msgstr "" -#~ "`#2605 `__ " -#~ "Standardisera utdata för funktioner för spänningsträd" - -#~ msgid "" -#~ "`#2635 `__ " -#~ "pgr_LineGraph ignores directed flag and use negative values for " -#~ "identifiers." -#~ msgstr "" -#~ "`#2635 `__ " -#~ "pgr_LineGraph ignorerar directed flag och använder negativa värden för " -#~ "identifierare." - -#~ msgid "" -#~ "`#2599 `__ Driving " -#~ "distance cleanup" -#~ msgstr "" -#~ "`#2599 `__ Körsträcka " -#~ "uppstädning" - -#~ msgid "" -#~ "`#2607 `__ Read " -#~ "postgresql data on C++" -#~ msgstr "" -#~ "`#2607 `__ Läsa " -#~ "postgresql-data på C++" - -#~ msgid "" -#~ "`#2614 `__ Clang tidy " -#~ "does not work" -#~ msgstr "" -#~ "`#2614 `__ Clang tidy " -#~ "fungerar inte" - -#~ msgid "" -#~ "To see all issues & pull requests closed by this release see the `Git " -#~ "closed milestone for 3.6.3 `__" -#~ msgstr "" -#~ "För att se alla problem och pull requests som stängts av den här utgåvan, " -#~ "se `Git stängd milstolpe för 3.6.3 `__" - -#~ msgid "" -#~ "To see all issues & pull requests closed by this release see the `Git " -#~ "closed milestone for 3.6.2 `__" -#~ msgstr "" -#~ "För att se alla problem och pull requests som stängts av den här utgåvan, " -#~ "se `Git-stängd milstolpe för 3.6.2 `__" - -#~ msgid "" -#~ "To see all issues & pull requests closed by this release see the `Git " -#~ "closed milestone for 3.6.1 `_" -#~ msgstr "" -#~ "För att se alla problem och pull requests som stängts av denna release, " -#~ "se `Git stängd milstolpe för 3.6.1 `_" - -#~ msgid "" -#~ "`#2588 `__ pgrouting " -#~ "3.6.0 fails to build on OSX" -#~ msgstr "" -#~ "`#2588 `__ pgrouting " -#~ "3.6.0 går inte att bygga under OSX" - -#~ msgid "" -#~ "To see all issues & pull requests closed by this release see the `Git " -#~ "closed milestone for 3.6.0 `_" -#~ msgstr "" -#~ "För att se alla problem och pull requests som stängts av den här utgåvan, " -#~ "se `Git stängd milstolpe för 3.6.0 `_" - -#~ msgid "" -#~ "`#2516 `__ Standardize " -#~ "output pgr_aStar" -#~ msgstr "" -#~ "`#2516 `__ " -#~ "Standardisera utdata pgr_aStar" - -#~ msgid "" -#~ "`#2523 `__ Standardize " -#~ "output pgr_bdAstar" -#~ msgstr "" -#~ "`#2523 `__ " -#~ "Standardisera utdata pgr_bdAstar" - -#~ msgid "" -#~ "`#2547 `__ Standardize " -#~ "output and modifying signature pgr_KSP" -#~ msgstr "" -#~ "`#2547 `__ " -#~ "Standardisera utdata och ändra signatur pgr_KSP" - -#~ msgid "" -#~ "`#2548 `__ Standardize " -#~ "output pgr_drivingDistance" -#~ msgstr "" -#~ "`#2548 `__ " -#~ "Standardisera utdata pgr_drivingDistance" - -#~ msgid "" -#~ "`#2544 `__ Standardize " -#~ "output and modifying signature pgr_withPointsDD" -#~ msgstr "" -#~ "`#2544 `__ " -#~ "Standardisera utdata och ändra signaturen pgr_withPointsDD" - -#~ msgid "" -#~ "`#2546 `__ Standardize " -#~ "output and modifying signature pgr_withPointsKSP" -#~ msgstr "" -#~ "`#2546 `__ " -#~ "Standardisera utdata och ändra signaturen pgr_withPointsKSP" - -#~ msgid "" -#~ "`#2504 `__ To C++ pg " -#~ "data get, fetch and check." -#~ msgstr "" -#~ "`#2504 `__ Till C++ pg-" -#~ "data hämta, hämta och kontrollera." - -#~ msgid "" -#~ "`#2505 `__ Using " -#~ "namespace." -#~ msgstr "" -#~ "`#2505 `__ Använder " -#~ "namnområde." - -#~ msgid "" -#~ "`#2512 `__ [Dijkstra] " -#~ "Removing duplicate code on Dijkstra." -#~ msgstr "" -#~ "`#2512 `__ [Dijkstra] " -#~ "Borttagning av duplicerad kod på Dijkstra." - -#~ msgid "" -#~ "`#2517 `__ Astar code " -#~ "simplification." -#~ msgstr "" -#~ "`#2517 `__ Förenkling " -#~ "av Astar-koden." - -#~ msgid "" -#~ "`#2521 `__ Dijkstra " -#~ "code simplification." -#~ msgstr "" -#~ "`#2521 `__ Dijkstra " -#~ "kodförenkling." - -#~ msgid "" -#~ "`#2522 `__ bdAstar code " -#~ "simplification." -#~ msgstr "" -#~ "`#2522 `__ bdAstar " -#~ "kodförenkling." - -#~ msgid "" -#~ "`#2490 `__ Automatic " -#~ "page history links." -#~ msgstr "" -#~ "`#2490 `__ Automatiska " -#~ "länkar till sidans historik." - -#~ msgid "" -#~ "`#2555 `__ Standardize " -#~ "deprecated messages" -#~ msgstr "" -#~ "`#2555 `__ " -#~ "Standardisera föråldrade meddelanden" - -#~ msgid "" -#~ "To see all issues & pull requests closed by this release see the `Git " -#~ "closed milestone for 3.5.1 `_" -#~ msgstr "" -#~ "För att se alla problem och pull requests som stängts av den här " -#~ "versionen, se `Git stängd milstolpe för 3.5.1 `_" - -#~ msgid "" -#~ "`#2565 `__ " -#~ "pgr_lengauerTarjanDominatorTree triggers an assertion" -#~ msgstr "" -#~ "`#2565 `__ " -#~ "pgr_lengauerTarjanDominatorTree utlöser ett påstående" - -#~ msgid "" -#~ "`#2561 `__ Not use " -#~ "wildcards on SQL" -#~ msgstr "" -#~ "`#2561 `__ Använd " -#~ "inte jokertecken i SQL" - -#~ msgid "" -#~ "`#2559 `__ pgtap test " -#~ "using sampledata" -#~ msgstr "" -#~ "`#2559 `__ pgtap-test " -#~ "med sampledata" - -#~ msgid "" -#~ "To see all issues & pull requests closed by this release see the `Git " -#~ "closed milestone for 3.5.0 `_" -#~ msgstr "" -#~ "För att se alla problem och pull requests som stängts av denna release, " -#~ "se `Git stängd milstolpe för 3.5.0 `_" - -#~ msgid "" -#~ "To see all issues & pull requests closed by this release see the `Git " -#~ "closed milestone for 3.4.2 `_" -#~ msgstr "" -#~ "För att se alla problem och pull requests som stängts av denna release, " -#~ "se `Git stängd milstolpe för 3.4.2 `_" - -#~ msgid "" -#~ "To see all issues & pull requests closed by this release see the `Git " -#~ "closed milestone for 3.4.1 `_" -#~ msgstr "" -#~ "För att se alla problem och pull requests som stängts av denna release, " -#~ "se `Git stängd milstolpe för 3.4.1 `_" - -#~ msgid "" -#~ "To see all issues & pull requests closed by this release see the `Git " -#~ "closed milestone for 3.4.0 `_" -#~ msgstr "" -#~ "För att se alla problem och pull requests som stängts av denna release, " -#~ "se `Git stängd milstolpe för 3.4.0 `_" - -#~ msgid "" -#~ "To see all issues & pull requests closed by this release see the `Git " -#~ "closed milestone for 3.3.4 `_" -#~ msgstr "" -#~ "För att se alla problem och pull requests som stängts av denna release, " -#~ "se `Git stängd milstolpe för 3.3.4 `_" - -#~ msgid "" -#~ "To see all issues & pull requests closed by this release see the `Git " -#~ "closed milestone for 3.3.3 `_" -#~ msgstr "" -#~ "För att se alla problem och pull requests som stängts av denna release, " -#~ "se `Git stängd milstolpe för 3.3.3 `_" - -#~ msgid "" -#~ "To see all issues & pull requests closed by this release see the `Git " -#~ "closed milestone for 3.3.2 `_" -#~ msgstr "" -#~ "För att se alla problem och pull requests som stängts av denna release, " -#~ "se `Git stängd milstolpe för 3.3.2 `_" - -#~ msgid "" -#~ "To see all issues & pull requests closed by this release see the `Git " -#~ "closed milestone for 3.3.1 `_ on Github." -#~ msgstr "" -#~ "För att se alla problem och pull requests som stängts av den här utgåvan, " -#~ "se `Git stängd milstolpe för 3.3.1 `_ på " -#~ "Github." - -#~ msgid "" -#~ "To see all issues & pull requests closed by this release see the `Git " -#~ "closed milestone for 3.3.0 `_ on Github." -#~ msgstr "" -#~ "För att se alla problem och pull requests som stängts av den här utgåvan, " -#~ "se `Git stängd milstolpe för 3.3.0 `_ på " -#~ "Github." - -#~ msgid "" -#~ "To see all issues & pull requests closed by this release see the `Git " -#~ "closed milestone for 3.2.2 `_ on Github." -#~ msgstr "" -#~ "För att se alla problem och pull requests som stängts av den här utgåvan, " -#~ "se `Git stängd milstolpe för 3.2.2 `_ på " -#~ "Github." - -#~ msgid "" -#~ "To see all issues & pull requests closed by this release see the `Git " -#~ "closed milestone for 3.2.1 `_ on Github." -#~ msgstr "" -#~ "För att se alla problem och pull requests som stängts av den här utgåvan, " -#~ "se `Git stängd milstolpe för 3.2.1 `_ på " -#~ "Github." - -#~ msgid "" -#~ "To see all issues & pull requests closed by this release see the `Git " -#~ "closed milestone for 3.2.0 `_ on Github." -#~ msgstr "" -#~ "För att se alla problem och pull requests som stängts av den här utgåvan, " -#~ "se `Git stängd milstolpe för 3.2.0 `_ på " -#~ "Github." - -#~ msgid "" -#~ "To see all issues & pull requests closed by this release see the `Git " -#~ "closed milestone for 3.1.4 `_ on Github." -#~ msgstr "" -#~ "För att se alla problem och pull requests som stängts av den här utgåvan, " -#~ "se `Git stängd milstolpe för 3.1.4 `_ på " -#~ "Github." - -#~ msgid "" -#~ "To see all issues & pull requests closed by this release see the `Git " -#~ "closed milestone for 3.1.3 `_ on Github." -#~ msgstr "" -#~ "För att se alla problem och pull requests som stängts av den här utgåvan, " -#~ "se `Git stängd milstolpe för 3.1.3 `_ på " -#~ "Github." - -#~ msgid "" -#~ "To see all issues & pull requests closed by this release see the `Git " -#~ "closed milestone for 3.1.2 `_ on Github." -#~ msgstr "" -#~ "För att se alla problem och pull requests som stängts av den här utgåvan, " -#~ "se `Git stängd milstolpe för 3.1.2 `_ på " -#~ "Github." - -#~ msgid "" -#~ "To see all issues & pull requests closed by this release see the `Git " -#~ "closed milestone for 3.1.1 `_ on Github." -#~ msgstr "" -#~ "För att se alla problem och pull requests som stängts av den här utgåvan, " -#~ "se `Git stängd milstolpe för 3.1.1 `_ på " -#~ "Github." - -#~ msgid "" -#~ "To see all issues & pull requests closed by this release see the `Git " -#~ "closed milestone for 3.1.0 `_ on Github." -#~ msgstr "" -#~ "För att se alla problem och pull requests som stängts av den här utgåvan, " -#~ "se `Git stängd milstolpe för 3.1.0 `_ på " -#~ "Github." - -#~ msgid "" -#~ "To see all issues & pull requests closed by this release see the `Git " -#~ "closed milestone for 3.0.6 `_ on Github." -#~ msgstr "" -#~ "För att se alla problem och pull requests som stängts av den här utgåvan, " -#~ "se `Git stängd milstolpe för 3.0.6 `_ på " -#~ "Github." - -#~ msgid "" -#~ "To see all issues & pull requests closed by this release see the `Git " -#~ "closed milestone for 3.0.5 `_ on Github." -#~ msgstr "" -#~ "För att se alla problem och pull requests som stängts av den här utgåvan, " -#~ "se `Git stängd milstolpe för 3.0.5 `_ på " -#~ "Github." - -#~ msgid "" -#~ "To see all issues & pull requests closed by this release see the `Git " -#~ "closed milestone for 3.0.4 `_ on Github." -#~ msgstr "" -#~ "För att se alla problem och pull requests som stängts av den här utgåvan, " -#~ "se `Git stängd milstolpe för 3.0.4 `_ på " -#~ "Github." - -#~ msgid "" -#~ "To see all issues & pull requests closed by this release see the `Git " -#~ "closed milestone for 3.0.2 `_ on Github." -#~ msgstr "" -#~ "För att se alla problem och pull requests som stängts av den här utgåvan, " -#~ "se `Git stängd milstolpe för 3.0.2 `_ på " -#~ "Github." - -#~ msgid "" -#~ "To see all issues & pull requests closed by this release see the `Git " -#~ "closed milestone for 3.0.1 `_ on Github." -#~ msgstr "" -#~ "För att se alla problem och pull requests som stängts av den här utgåvan, " -#~ "se `Git stängd milstolpe för 3.0.1 `_ på " -#~ "Github." - -#~ msgid "" -#~ "To see all issues & pull requests closed by this release see the `Git " -#~ "closed milestone for 3.0.0 `_ on Github." -#~ msgstr "" -#~ "För att se alla problem och pull requests som stängts av den här utgåvan, " -#~ "se `Git stängd milstolpe för 3.0.0 `_ på " -#~ "Github." - -#~ msgid "" -#~ "To see the issues closed by this release see the `Git closed milestone " -#~ "for 2.6.3 `_ on Github." -#~ msgstr "" -#~ "För att se de problem som stängdes med den här utgåvan, se `Git-stängd " -#~ "milstolpe för 2.6.3 `_ på Github." - -#~ msgid "" -#~ "`#1219 `__ Implicit " -#~ "cast for via_path integer to text" -#~ msgstr "" -#~ "`#1219 `__ Implicit " -#~ "kast för via_path integer till text" - -#~ msgid "" -#~ "`#1193 `__ Fixed " -#~ "pgr_pointsAsPolygon breaking when comparing strings in WHERE clause" -#~ msgstr "" -#~ "`#1193 `__ Fixat att " -#~ "pgr_pointsAsPolygon gick sönder när strängar jämfördes i WHERE-satsen" - -#~ msgid "" -#~ "`#1185 `__ Improve " -#~ "FindPostgreSQL.cmake" -#~ msgstr "" -#~ "`#1185 `__ Förbättra " -#~ "FindPostgreSQL.cmake" - -#~ msgid "" -#~ "To see the issues closed by this release see the `Git closed milestone " -#~ "for 2.6.2 `_ on Github." -#~ msgstr "" -#~ "För att se de problem som stängdes med den här utgåvan, se `Git-stängd " -#~ "milstolpe för 2.6.2 `_ på Github." - -#~ msgid "" -#~ "`#1152 `__ Fixes " -#~ "driving distance when vertex is not part of the graph" -#~ msgstr "" -#~ "`#1152 `__ Korrigerar " -#~ "körsträcka när toppunkten inte är en del av grafen" - -#~ msgid "" -#~ "`#1098 `__ Fixes " -#~ "windows test" -#~ msgstr "" -#~ "`#1098 `__ Åtgärdar " -#~ "Windows-test" - -#~ msgid "" -#~ "`#1165 `__ Fixes " -#~ "build for python3 and perl5" -#~ msgstr "" -#~ "`#1165 `__ Fixar " -#~ "byggsätt för python3 och perl5" - -#~ msgid "" -#~ "To see the issues closed by this release see the `Git closed milestone " -#~ "for 2.6.1 `_ on Github." -#~ msgstr "" -#~ "För att se de problem som stängdes med den här utgåvan, se `Git-stängd " -#~ "milstolpe för 2.6.1 `_ på Github." - -#~ msgid "" -#~ "To see the issues closed by this release see the `Git closed milestone " -#~ "for 2.6.0 `_ on Github." -#~ msgstr "" -#~ "För att se de problem som stängdes med den här utgåvan, se `Git-stängd " -#~ "milstolpe för 2.6.0 `_ på Github." - -#~ msgid "" -#~ "To see the issues closed by this release see the `Git closed milestone " -#~ "for 2.5.5 `_ on Github." -#~ msgstr "" -#~ "För att se de problem som stängdes med den här utgåvan, se `Git-stängd " -#~ "milstolpe för 2.5.5 `_ på Github." - -#~ msgid "" -#~ "To see the issues closed by this release see the `Git closed milestone " -#~ "for 2.5.4 `_ on Github." -#~ msgstr "" -#~ "För att se de problem som stängdes med den här utgåvan, se `Git-stängd " -#~ "milstolpe för 2.5.4 `_ på Github." - -#~ msgid "" -#~ "To see the issues closed by this release see the `Git closed milestone " -#~ "for 2.5.3 `_ on Github." -#~ msgstr "" -#~ "För att se de problem som stängdes med den här utgåvan, se `Git-stängd " -#~ "milstolpe för 2.5.3 `_ på Github." - -#~ msgid "" -#~ "To see the issues closed by this release see the `Git closed milestone " -#~ "for 2.5.2 `_ on Github." -#~ msgstr "" -#~ "För att se de problem som stängdes med den här utgåvan, se `Git-stängd " -#~ "milstolpe för 2.5.2 `_ på Github." - -#~ msgid "" -#~ "To see the issues closed by this release see the `Git closed milestone " -#~ "for 2.5.1 `_ on Github." -#~ msgstr "" -#~ "För att se de problem som stängdes med den här utgåvan, se `Git-stängd " -#~ "milstolpe för 2.5.1 `_ på Github." - -#~ msgid "" -#~ "To see the issues closed by this release see the `Git closed issues for " -#~ "2.5.0 `_ on Github." -#~ msgstr "" -#~ "För att se de problem som stängdes av den här utgåvan, se `Git stängda " -#~ "problem för 2.5.0 `_ på Github." - -#~ msgid "" -#~ "To see the issues closed by this release see the `Git closed milestone " -#~ "for 2.4.2 `_ on Github." -#~ msgstr "" -#~ "För att se de problem som stängdes med den här utgåvan, se `Git-stängd " -#~ "milstolpe för 2.4.2 `_ på Github." - -#~ msgid "" -#~ "To see the issues closed by this release see the `Git closed milestone " -#~ "for 2.4.1 `_ on Github." -#~ msgstr "" -#~ "För att se de problem som stängdes med den här utgåvan, se `Git-stängd " -#~ "milstolpe för 2.4.1 `_ på Github." - -#~ msgid "" -#~ "To see the issues closed by this release see the `Git closed issues for " -#~ "2.4.0 `_ on Github." -#~ msgstr "" -#~ "För att se de problem som stängdes av den här utgåvan, se `Git stängda " -#~ "problem för 2.4.0 `_ på Github." - -#~ msgid "" -#~ "To see the issues closed by this release see the `Git closed issues for " -#~ "2.3.2 `_ on Github." -#~ msgstr "" -#~ "För att se de problem som stängts av denna utgåva, se `Git stängda " -#~ "problem för 2.3.2 `_ på Github." - -#~ msgid "" -#~ "To see the issues closed by this release see the `Git closed issues for " -#~ "2.3.1 `_ on Github." -#~ msgstr "" -#~ "För att se de problem som stängts av denna utgåva, se `Git stängda " -#~ "problem för 2.3.1 `_ på Github." - -#~ msgid "" -#~ "To see the issues closed by this release see the `Git closed issues for " -#~ "2.3.0 `_ on Github." -#~ msgstr "" -#~ "För att se de problem som stängdes av den här utgåvan, se `Git stängda " -#~ "problem för 2.3.0 `_ på Github." - -#~ msgid "" -#~ "To see the issues closed by this release see the `Git closed issues for " -#~ "2.2.4 `_ on Github." -#~ msgstr "" -#~ "För att se de problem som stängts av denna utgåva, se `Git stängda " -#~ "problem för 2.2.4 `_ på Github." - -#~ msgid "" -#~ "To see the issues closed by this release see the `Git closed issues for " -#~ "2.2.3 `_ on Github." -#~ msgstr "" -#~ "För att se de problem som stängts av denna utgåva, se `Git stängda " -#~ "problem för 2.2.3 `_ på Github." - -#~ msgid "" -#~ "To see the issues closed by this release see the `Git closed issues for " -#~ "2.2.2 `_ on Github." -#~ msgstr "" -#~ "För att se de problem som stängts av denna utgåva, se `Git stängda " -#~ "problem för 2.2.2 `_ på Github." - -#~ msgid "" -#~ "To see the issues closed by this release see the `Git closed issues for " -#~ "2.2.1 `_ on Github." -#~ msgstr "" -#~ "För att se de problem som stängts av denna utgåva, se `Git stängda " -#~ "problem för 2.2.1 `_ på Github." - -#~ msgid "" -#~ "To see the issues closed by this release see the `Git closed issues for " -#~ "2.2.0 `_ on Github." -#~ msgstr "" -#~ "För att se de problem som stängdes av denna utgåva, se `Git stängda " -#~ "problem för 2.2.0 `_ på Github." - -#~ msgid "" -#~ "To see the issues closed by this release see the `Git closed issues for " -#~ "2.1.0 `_ on Github." -#~ msgstr "" -#~ "För att se de problem som stängdes av denna utgåva, se `Git stängda " -#~ "problem för 2.1.0 `_ på Github." - -#~ msgid "" -#~ "To see the issues closed by this release see the `Git closed issues for " -#~ "2.0.0 `_ on Github." -#~ msgstr "" -#~ "För att se de problem som stängdes av den här utgåvan, se `Git stängda " -#~ "problem för 2.0.0 `_ på Github." +#~ msgid "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, **driving_side**, [**options**])" +#~ msgstr "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, **driving_side**, [**options**])" + +#~ msgid "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, **driving_side**, [**options**])" +#~ msgstr "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, **driving_side**, [**options**])" + +#~ msgid "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, **driving_side**, [**options**])" +#~ msgstr "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, **driving_side**, [**options**])" + +#~ msgid "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, **driving_side**, [**options**])" +#~ msgstr "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, **driving_side**, [**options**])" + +#~ msgid "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, **driving_side**, [**options**])" +#~ msgstr "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, **driving_side**, [**options**])" + +#~ msgid "pgr_withPointsVia(`Kanter SQL`_, `Points SQL`_, **via vertices**, **driving side** [**options**])" +#~ msgstr "pgr_withPointsVia(`Kanter SQL`_, `Points SQL`_, **via vertices**, **driving side** [**options**])" + +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.8.0 `__" +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.8.0 `__" + +#~ msgid "Other enhancements: `#2869 `__" +#~ msgstr "Andra förbättringar: `#2869 `__" + +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.7.3 `__" +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.7.3 `__" + +#~ msgid "`#2731 `__ Build Failure on Ubuntu 22" +#~ msgstr "`#2731 `__ Byggfel på Ubuntu 22" + +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.7.2 `__" +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git-stängd milstolpe för 3.7.2 `__" + +#~ msgid "`#2713 `__ cmake missing some policies and min version" +#~ msgstr "`#2713 `__ cmake saknar vissa policyer och min-version" + +#~ msgid "`#2707 `__ Build failure in pgRouting 3.7.1 on Alpine" +#~ msgstr "`#2707 `__ Byggfel i pgRouting 3.7.1 på Alpine" + +#~ msgid "`#2706 `__ winnie crashing on pgr_betweennessCentrality" +#~ msgstr "`#2706 `__ winnie kraschar på pgr_betweennessCentrality" + +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.7.1 `__" +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git-stängd milstolpe för 3.7.1 `__" + +#~ msgid "`#2680 `__ fails to compile under mingw64 gcc 13.2" +#~ msgstr "`#2680 `__ kan inte kompileras under mingw64 gcc 13.2" + +#~ msgid "`#2689 `__ When point is a vertex, the withPoints family do not return results." +#~ msgstr "`#2689 `__ När punkten är en vertex ger inte withPoints-familjen några resultat." + +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.7.0 `__" +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.7.0 `__" + +#~ msgid "`#2656 `__ Stop support of PostgreSQL12 on pgrouting v3.7" +#~ msgstr "`#2656 `__ Stoppa stöd för PostgreSQL12 på pgrouting v3.7" + +#~ msgid "`#2605 `__ Standardize spanning tree functions output" +#~ msgstr "`#2605 `__ Standardisera utdata för funktioner för spänningsträd" + +#~ msgid "`#2635 `__ pgr_LineGraph ignores directed flag and use negative values for identifiers." +#~ msgstr "`#2635 `__ pgr_LineGraph ignorerar directed flag och använder negativa värden för identifierare." + +#~ msgid "`#2599 `__ Driving distance cleanup" +#~ msgstr "`#2599 `__ Körsträcka uppstädning" + +#~ msgid "`#2607 `__ Read postgresql data on C++" +#~ msgstr "`#2607 `__ Läsa postgresql-data på C++" + +#~ msgid "`#2614 `__ Clang tidy does not work" +#~ msgstr "`#2614 `__ Clang tidy fungerar inte" + +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.6.3 `__" +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.6.3 `__" + +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.6.2 `__" +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git-stängd milstolpe för 3.6.2 `__" + +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.6.1 `_" +#~ msgstr "För att se alla problem och pull requests som stängts av denna release, se `Git stängd milstolpe för 3.6.1 `_" + +#~ msgid "`#2588 `__ pgrouting 3.6.0 fails to build on OSX" +#~ msgstr "`#2588 `__ pgrouting 3.6.0 går inte att bygga under OSX" + +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.6.0 `_" +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.6.0 `_" + +#~ msgid "`#2516 `__ Standardize output pgr_aStar" +#~ msgstr "`#2516 `__ Standardisera utdata pgr_aStar" + +#~ msgid "`#2523 `__ Standardize output pgr_bdAstar" +#~ msgstr "`#2523 `__ Standardisera utdata pgr_bdAstar" + +#~ msgid "`#2547 `__ Standardize output and modifying signature pgr_KSP" +#~ msgstr "`#2547 `__ Standardisera utdata och ändra signatur pgr_KSP" + +#~ msgid "`#2548 `__ Standardize output pgr_drivingDistance" +#~ msgstr "`#2548 `__ Standardisera utdata pgr_drivingDistance" + +#~ msgid "`#2544 `__ Standardize output and modifying signature pgr_withPointsDD" +#~ msgstr "`#2544 `__ Standardisera utdata och ändra signaturen pgr_withPointsDD" + +#~ msgid "`#2546 `__ Standardize output and modifying signature pgr_withPointsKSP" +#~ msgstr "`#2546 `__ Standardisera utdata och ändra signaturen pgr_withPointsKSP" + +#~ msgid "`#2504 `__ To C++ pg data get, fetch and check." +#~ msgstr "`#2504 `__ Till C++ pg-data hämta, hämta och kontrollera." + +#~ msgid "`#2505 `__ Using namespace." +#~ msgstr "`#2505 `__ Använder namnområde." + +#~ msgid "`#2512 `__ [Dijkstra] Removing duplicate code on Dijkstra." +#~ msgstr "`#2512 `__ [Dijkstra] Borttagning av duplicerad kod på Dijkstra." + +#~ msgid "`#2517 `__ Astar code simplification." +#~ msgstr "`#2517 `__ Förenkling av Astar-koden." + +#~ msgid "`#2521 `__ Dijkstra code simplification." +#~ msgstr "`#2521 `__ Dijkstra kodförenkling." + +#~ msgid "`#2522 `__ bdAstar code simplification." +#~ msgstr "`#2522 `__ bdAstar kodförenkling." + +#~ msgid "`#2490 `__ Automatic page history links." +#~ msgstr "`#2490 `__ Automatiska länkar till sidans historik." + +#~ msgid "`#2555 `__ Standardize deprecated messages" +#~ msgstr "`#2555 `__ Standardisera föråldrade meddelanden" + +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.5.1 `_" +#~ msgstr "För att se alla problem och pull requests som stängts av den här versionen, se `Git stängd milstolpe för 3.5.1 `_" + +#~ msgid "`#2565 `__ pgr_lengauerTarjanDominatorTree triggers an assertion" +#~ msgstr "`#2565 `__ pgr_lengauerTarjanDominatorTree utlöser ett påstående" + +#~ msgid "`#2561 `__ Not use wildcards on SQL" +#~ msgstr "`#2561 `__ Använd inte jokertecken i SQL" + +#~ msgid "`#2559 `__ pgtap test using sampledata" +#~ msgstr "`#2559 `__ pgtap-test med sampledata" + +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.5.0 `_" +#~ msgstr "För att se alla problem och pull requests som stängts av denna release, se `Git stängd milstolpe för 3.5.0 `_" + +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.4.2 `_" +#~ msgstr "För att se alla problem och pull requests som stängts av denna release, se `Git stängd milstolpe för 3.4.2 `_" + +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.4.1 `_" +#~ msgstr "För att se alla problem och pull requests som stängts av denna release, se `Git stängd milstolpe för 3.4.1 `_" + +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.4.0 `_" +#~ msgstr "För att se alla problem och pull requests som stängts av denna release, se `Git stängd milstolpe för 3.4.0 `_" + +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.3.4 `_" +#~ msgstr "För att se alla problem och pull requests som stängts av denna release, se `Git stängd milstolpe för 3.3.4 `_" + +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.3.3 `_" +#~ msgstr "För att se alla problem och pull requests som stängts av denna release, se `Git stängd milstolpe för 3.3.3 `_" + +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.3.2 `_" +#~ msgstr "För att se alla problem och pull requests som stängts av denna release, se `Git stängd milstolpe för 3.3.2 `_" + +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.3.1 `_ on Github." +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.3.1 `_ på Github." + +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.3.0 `_ on Github." +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.3.0 `_ på Github." + +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.2.2 `_ on Github." +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.2.2 `_ på Github." + +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.2.1 `_ on Github." +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.2.1 `_ på Github." + +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.2.0 `_ on Github." +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.2.0 `_ på Github." + +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.1.4 `_ on Github." +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.1.4 `_ på Github." + +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.1.3 `_ on Github." +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.1.3 `_ på Github." + +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.1.2 `_ on Github." +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.1.2 `_ på Github." + +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.1.1 `_ on Github." +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.1.1 `_ på Github." + +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.1.0 `_ on Github." +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.1.0 `_ på Github." + +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.0.6 `_ on Github." +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.0.6 `_ på Github." + +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.0.5 `_ on Github." +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.0.5 `_ på Github." + +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.0.4 `_ on Github." +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.0.4 `_ på Github." + +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.0.2 `_ on Github." +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.0.2 `_ på Github." + +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.0.1 `_ on Github." +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.0.1 `_ på Github." + +#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.0.0 `_ on Github." +#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.0.0 `_ på Github." + +#~ msgid "To see the issues closed by this release see the `Git closed milestone for 2.6.3 `_ on Github." +#~ msgstr "För att se de problem som stängdes med den här utgåvan, se `Git-stängd milstolpe för 2.6.3 `_ på Github." + +#~ msgid "`#1219 `__ Implicit cast for via_path integer to text" +#~ msgstr "`#1219 `__ Implicit kast för via_path integer till text" + +#~ msgid "`#1193 `__ Fixed pgr_pointsAsPolygon breaking when comparing strings in WHERE clause" +#~ msgstr "`#1193 `__ Fixat att pgr_pointsAsPolygon gick sönder när strängar jämfördes i WHERE-satsen" + +#~ msgid "`#1185 `__ Improve FindPostgreSQL.cmake" +#~ msgstr "`#1185 `__ Förbättra FindPostgreSQL.cmake" + +#~ msgid "To see the issues closed by this release see the `Git closed milestone for 2.6.2 `_ on Github." +#~ msgstr "För att se de problem som stängdes med den här utgåvan, se `Git-stängd milstolpe för 2.6.2 `_ på Github." + +#~ msgid "`#1152 `__ Fixes driving distance when vertex is not part of the graph" +#~ msgstr "`#1152 `__ Korrigerar körsträcka när toppunkten inte är en del av grafen" + +#~ msgid "`#1098 `__ Fixes windows test" +#~ msgstr "`#1098 `__ Åtgärdar Windows-test" + +#~ msgid "`#1165 `__ Fixes build for python3 and perl5" +#~ msgstr "`#1165 `__ Fixar byggsätt för python3 och perl5" + +#~ msgid "To see the issues closed by this release see the `Git closed milestone for 2.6.1 `_ on Github." +#~ msgstr "För att se de problem som stängdes med den här utgåvan, se `Git-stängd milstolpe för 2.6.1 `_ på Github." + +#~ msgid "To see the issues closed by this release see the `Git closed milestone for 2.6.0 `_ on Github." +#~ msgstr "För att se de problem som stängdes med den här utgåvan, se `Git-stängd milstolpe för 2.6.0 `_ på Github." + +#~ msgid "To see the issues closed by this release see the `Git closed milestone for 2.5.5 `_ on Github." +#~ msgstr "För att se de problem som stängdes med den här utgåvan, se `Git-stängd milstolpe för 2.5.5 `_ på Github." + +#~ msgid "To see the issues closed by this release see the `Git closed milestone for 2.5.4 `_ on Github." +#~ msgstr "För att se de problem som stängdes med den här utgåvan, se `Git-stängd milstolpe för 2.5.4 `_ på Github." + +#~ msgid "To see the issues closed by this release see the `Git closed milestone for 2.5.3 `_ on Github." +#~ msgstr "För att se de problem som stängdes med den här utgåvan, se `Git-stängd milstolpe för 2.5.3 `_ på Github." + +#~ msgid "To see the issues closed by this release see the `Git closed milestone for 2.5.2 `_ on Github." +#~ msgstr "För att se de problem som stängdes med den här utgåvan, se `Git-stängd milstolpe för 2.5.2 `_ på Github." + +#~ msgid "To see the issues closed by this release see the `Git closed milestone for 2.5.1 `_ on Github." +#~ msgstr "För att se de problem som stängdes med den här utgåvan, se `Git-stängd milstolpe för 2.5.1 `_ på Github." + +#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.5.0 `_ on Github." +#~ msgstr "För att se de problem som stängdes av den här utgåvan, se `Git stängda problem för 2.5.0 `_ på Github." + +#~ msgid "To see the issues closed by this release see the `Git closed milestone for 2.4.2 `_ on Github." +#~ msgstr "För att se de problem som stängdes med den här utgåvan, se `Git-stängd milstolpe för 2.4.2 `_ på Github." + +#~ msgid "To see the issues closed by this release see the `Git closed milestone for 2.4.1 `_ on Github." +#~ msgstr "För att se de problem som stängdes med den här utgåvan, se `Git-stängd milstolpe för 2.4.1 `_ på Github." + +#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.4.0 `_ on Github." +#~ msgstr "För att se de problem som stängdes av den här utgåvan, se `Git stängda problem för 2.4.0 `_ på Github." + +#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.3.2 `_ on Github." +#~ msgstr "För att se de problem som stängts av denna utgåva, se `Git stängda problem för 2.3.2 `_ på Github." + +#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.3.1 `_ on Github." +#~ msgstr "För att se de problem som stängts av denna utgåva, se `Git stängda problem för 2.3.1 `_ på Github." + +#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.3.0 `_ on Github." +#~ msgstr "För att se de problem som stängdes av den här utgåvan, se `Git stängda problem för 2.3.0 `_ på Github." + +#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.2.4 `_ on Github." +#~ msgstr "För att se de problem som stängts av denna utgåva, se `Git stängda problem för 2.2.4 `_ på Github." + +#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.2.3 `_ on Github." +#~ msgstr "För att se de problem som stängts av denna utgåva, se `Git stängda problem för 2.2.3 `_ på Github." + +#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.2.2 `_ on Github." +#~ msgstr "För att se de problem som stängts av denna utgåva, se `Git stängda problem för 2.2.2 `_ på Github." + +#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.2.1 `_ on Github." +#~ msgstr "För att se de problem som stängts av denna utgåva, se `Git stängda problem för 2.2.1 `_ på Github." + +#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.2.0 `_ on Github." +#~ msgstr "För att se de problem som stängdes av denna utgåva, se `Git stängda problem för 2.2.0 `_ på Github." + +#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.1.0 `_ on Github." +#~ msgstr "För att se de problem som stängdes av denna utgåva, se `Git stängda problem för 2.1.0 `_ på Github." + +#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.0.0 `_ on Github." +#~ msgstr "För att se de problem som stängdes av den här utgåvan, se `Git stängda problem för 2.0.0 `_ på Github." #~ msgid "Mailing List and GIS StackExchange" #~ msgstr "Mailinglista och GIS StackExchange" -#~ msgid "" -#~ "There are two mailing lists for pgRouting hosted on OSGeo mailing list " -#~ "server:" -#~ msgstr "" -#~ "Det finns två e-postlistor för pgRouting som finns på OSGeo mailing list " -#~ "server:" +#~ msgid "There are two mailing lists for pgRouting hosted on OSGeo mailing list server:" +#~ msgstr "Det finns två e-postlistor för pgRouting som finns på OSGeo mailing list server:" -#~ msgid "" -#~ "User mailing list: https://lists.osgeo.org/mailman/listinfo/pgrouting-" -#~ "users" -#~ msgstr "" -#~ "E-postlista för användare: https://lists.osgeo.org/mailman/listinfo/" -#~ "pgrouting-users" +#~ msgid "User mailing list: https://lists.osgeo.org/mailman/listinfo/pgrouting-users" +#~ msgstr "E-postlista för användare: https://lists.osgeo.org/mailman/listinfo/pgrouting-users" #, fuzzy #~ msgid "Regina Obe, Saloni kumari, Vicky Vergara" #~ msgstr "Aurélie Bousquet, Regina Obe, Vicky Vergara" #, fuzzy -#~ msgid "" -#~ "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio " -#~ "Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, " -#~ "Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, " -#~ "Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, " -#~ "Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic " -#~ "Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, " -#~ "Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko " -#~ "Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, " -#~ "Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, " -#~ "Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, " -#~ "Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen " -#~ "Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit " -#~ "Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" -#~ msgstr "" -#~ "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio " -#~ "Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, " -#~ "Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, " -#~ "Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, " -#~ "Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic " -#~ "Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, " -#~ "Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko " -#~ "Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, " -#~ "Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, " -#~ "Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, " -#~ "Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, " -#~ "Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan " -#~ "Jain, Virginia Vergara, Yige Huang" +#~ msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" +#~ msgstr "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" #, fuzzy -#~ msgid "" -#~ ":doc:`pgr_kingOrdering` - Returns the King ordering of an undirected " -#~ "graphs acyclic graph." -#~ msgstr "" -#~ ":doc:`pgr_cuthillMckeeOrdering` - Return reverse Cuthill-McKee ordering " -#~ "of an undirected graph." +#~ msgid ":doc:`pgr_kingOrdering` - Returns the King ordering of an undirected graphs acyclic graph." +#~ msgstr ":doc:`pgr_cuthillMckeeOrdering` - Return reverse Cuthill-McKee ordering of an undirected graph." #, fuzzy #~ msgid "Fan Wu Regina Obe, Saloni kumari, Vicky Vergara" #~ msgstr "Aurélie Bousquet, Regina Obe, Vicky Vergara" #, fuzzy -#~ msgid "" -#~ "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio " -#~ "Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, " -#~ "Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, " -#~ "Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, " -#~ "Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, " -#~ "Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu " -#~ "Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, " -#~ "Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, " -#~ "Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, " -#~ "Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, " -#~ "Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen " -#~ "Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit " -#~ "Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" -#~ msgstr "" -#~ "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio " -#~ "Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, " -#~ "Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, " -#~ "Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, " -#~ "Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic " -#~ "Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, " -#~ "Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko " -#~ "Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, " -#~ "Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, " -#~ "Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, " -#~ "Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, " -#~ "Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan " -#~ "Jain, Virginia Vergara, Yige Huang" +#~ msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" +#~ msgstr "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" diff --git a/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po b/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po index f01a1582d5..02f2b197c2 100644 --- a/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po @@ -12,11 +12,10 @@ msgid "" msgstr "" "Project-Id-Version: pgRouting v4.1\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2025-10-08 19:15+0000\n" +"POT-Creation-Date: 2025-12-05 23:37+0000\n" "PO-Revision-Date: 2025-09-22 16:28+0000\n" "Last-Translator: Celia Virginia Vergara Castillo \n" -"Language-Team: Chinese (Simplified) \n" +"Language-Team: Chinese (Simplified) \n" "Language: zh_Hans\n" "MIME-Version: 1.0\n" "Content-Type: text/plain; charset=UTF-8\n" @@ -87,9 +86,7 @@ msgstr "``BIGINT``" msgid "Identifier of the root vertex of the tree." msgstr "树的根顶点的标识符。" -msgid "" -"When value is :math:`0` then gets the spanning forest starting in aleatory " -"nodes for each tree in the forest." +msgid "When value is :math:`0` then gets the spanning forest starting in aleatory nodes for each tree in the forest." msgstr "当值为 :math:`0` 时，则获取从森林中每棵树的随机节点开始的生成森林。" msgid "**root vids**" @@ -188,9 +185,7 @@ msgstr "-1" msgid "Weight of the edge (``target``, ``source``)" msgstr "边(``target``, ``source``)的权重" -msgid "" -"When negative: edge (``target``, ``source``) does not exist, therefore it's " -"not part of the graph." +msgid "When negative: edge (``target``, ``source``) does not exist, therefore it's not part of the graph." msgstr "当为负时：edge (``target``, ``source``) 不存在，因此它不是图的一部分。" msgid "``SMALLINT``, ``INTEGER``, ``BIGINT``" @@ -259,31 +254,17 @@ msgstr "从 ``start_vid`` 到 ``node`` 的总成本。" msgid "See Also" msgstr "另请参阅" -msgid "" -"`Boost: Prim's algorithm `__" -msgstr "" -"`Boost: Prim算法 `__" +msgid "`Boost: Prim's algorithm `__" +msgstr "`Boost: Prim算法 `__" -msgid "" -"`Boost: Kruskal's algorithm `__" -msgstr "" -"`Boost: Kruskal算法 `__" +msgid "`Boost: Kruskal's algorithm `__" +msgstr "`Boost: Kruskal算法 `__" -msgid "" -"`Wikipedia: Prim's algorithm `__" -msgstr "" -"`维基百科: Prim算法 `__" +msgid "`Wikipedia: Prim's algorithm `__" +msgstr "`维基百科: Prim算法 `__" -msgid "" -"`Wikipedia: Kruskal's algorithm `__" -msgstr "" -"`维基百科: Kruskal算法 `__" +msgid "`Wikipedia: Kruskal's algorithm `__" +msgstr "`维基百科: Kruskal算法 `__" msgid "Indices and tables" msgstr "索引和表格" @@ -329,8 +310,7 @@ msgstr "pgTap 测试已经完成。 但可能需要更多。" msgid "Documentation might need refinement." msgstr "文档可能需要完善。" -msgid "" -":doc:`pgr_depthFirstSearch` - Depth first search traversal of the graph." +msgid ":doc:`pgr_depthFirstSearch` - Depth first search traversal of the graph." msgstr ":doc:`pgr_depthFirstSearch` - 图的深度优先搜索遍历。" msgid "In general:" @@ -361,8 +341,7 @@ msgstr ":doc:`pgr_trspVia` - 有限制的通过顶点路由。" msgid ":doc:`pgr_trsp_withPoints` - Vertex/Point routing with restrictions." msgstr ":doc:`pgr_trsp_withPoints` - 有限制的顶点/点路由。" -msgid "" -":doc:`pgr_trspVia_withPoints` - Via Vertex/point routing with restrictions." +msgid ":doc:`pgr_trspVia_withPoints` - Via Vertex/point routing with restrictions." msgstr ":doc:`pgr_trspVia_withPoints` - 通过有限制的顶点/点路由。" #, fuzzy @@ -409,27 +388,14 @@ msgstr ":doc:`pgr_turnRestrictedPath` - 有限制的路由。" msgid "Introduction" msgstr "介绍" -msgid "" -"Road restrictions are a sequence of road segments that can not be taken in a " -"sequential manner. Some restrictions are implicit on a directed graph, for " -"example, one way roads where the wrong way edge is not even inserted on the " -"graph. But normally on turns like no left turn or no right turn, hence the " -"name turn restrictions, there are sometimes restrictions." -msgstr "" -"道路限制是一系列不能按顺序采取的路段。 有向图上隐含了一些限制，例如单向道路，" -"其中错误的边甚至不会插入到图上。 但通常在转弯时如不许左转或不许右转，因此得名" -"转弯限制，这儿是一些常见限制。" +msgid "Road restrictions are a sequence of road segments that can not be taken in a sequential manner. Some restrictions are implicit on a directed graph, for example, one way roads where the wrong way edge is not even inserted on the graph. But normally on turns like no left turn or no right turn, hence the name turn restrictions, there are sometimes restrictions." +msgstr "道路限制是一系列不能按顺序采取的路段。 有向图上隐含了一些限制，例如单向道路，其中错误的边甚至不会插入到图上。 但通常在转弯时如不许左转或不许右转，因此得名转弯限制，这儿是一些常见限制。" msgid "TRSP algorithm" msgstr "TRSP算法" -msgid "" -"The internal TRSP algorithm performs a lookahead over the dijkstra algorithm " -"in order to find out if the attempted path has a restriction. This allows " -"the algorithm to pass twice on the same vertex." -msgstr "" -"内部 TRSP 算法对 dijkstra 算法执行前瞻，以查明尝试的路径是否有限制。 这允许算" -"法在同一顶点上传递两次。" +msgid "The internal TRSP algorithm performs a lookahead over the dijkstra algorithm in order to find out if the attempted path has a restriction. This allows the algorithm to pass twice on the same vertex." +msgstr "内部 TRSP 算法对 dijkstra 算法执行前瞻，以查明尝试的路径是否有限制。 这允许算法在同一顶点上传递两次。" msgid "`Edges SQL`_ query as described." msgstr "`Edges SQL`_ 按描述查询。" @@ -452,14 +418,10 @@ msgstr "将要访问的有序顶点标识符数组。" msgid "Restrictions" msgstr "限制" -msgid "" -"On road networks, there are restrictions such as left or right turn " -"restrictions, no U turn restrictions." +msgid "On road networks, there are restrictions such as left or right turn restrictions, no U turn restrictions." msgstr "在道路网络上，有左转或右转限制等限制，没有掉头限制。" -msgid "" -"A restriction is a sequence of edges, called path and that path is to be " -"avoided." +msgid "A restriction is a sequence of edges, called path and that path is to be avoided." msgstr "限制是一系列边，称为路径，并且要避免该路径。" msgid "**Restrictions on the road network**" @@ -468,13 +430,8 @@ msgstr "**道路网络的限制**" msgid "These restrictions are represented on a table as follows:" msgstr "这些限制在表格中表示如下：" -msgid "" -"The table has an identifier, which maybe is needed for the administration of " -"the restrictions, but the algorithms do not need that information. If given " -"it will be ignored." -msgstr "" -"该表有一个标识符，这可能是管理限制所需要的，但算法不需要该信息。 如果给出，它" -"将被忽略。" +msgid "The table has an identifier, which maybe is needed for the administration of the restrictions, but the algorithms do not need that information. If given it will be ignored." +msgstr "该表有一个标识符，这可能是管理限制所需要的，但算法不需要该信息。 如果给出，它将被忽略。" msgid "Restrictions SQL" msgstr "Restrictions SQL" @@ -485,13 +442,8 @@ msgstr "``path``" msgid "``ARRAY`` [**ANY-INTEGER**]" msgstr "``ARRAY`` [**ANY-INTEGER**]" -msgid "" -"Sequence of edge identifiers that form a path that is not allowed to be " -"taken. - Empty arrays or ``NULL`` arrays are ignored. - Arrays that have a " -"``NULL`` element will raise an exception." -msgstr "" -"形成不允许采用的路径的边缘标识符序列。 - 空数组或 ``NULL`` 数组将被忽略。 - " -"具有 ``NULL`` 元素的数组将引发异常。" +msgid "Sequence of edge identifiers that form a path that is not allowed to be taken. - Empty arrays or ``NULL`` arrays are ignored. - Arrays that have a ``NULL`` element will raise an exception." +msgstr "形成不允许采用的路径的边缘标识符序列。 - 空数组或 ``NULL`` 数组将被忽略。 - 具有 ``NULL`` 元素的数组将引发异常。" msgid "``Cost``" msgstr "``Cost``" @@ -520,31 +472,17 @@ msgstr "问题定义" msgid "The travelling salesperson problem (TSP) asks the following question:" msgstr "旅行推销员问题 (TSP) 提出以下问题：" -msgid "" -"*Given a list of cities and the distances between each pair of cities, which " -"is the shortest possible route that visits each city exactly once and " -"returns to the origin city?*" -msgstr "" -"*给定一个城市列表以及每对城市之间的距离，哪条是访问每个城市一次并返回出发城市" -"的最短路线？*" +msgid "*Given a list of cities and the distances between each pair of cities, which is the shortest possible route that visits each city exactly once and returns to the origin city?*" +msgstr "*给定一个城市列表以及每对城市之间的距离，哪条是访问每个城市一次并返回出发城市的最短路线？*" msgid "Origin" msgstr "起源" -msgid "" -"The traveling sales person problem was studied in the 18th century by " -"mathematicians **Sir William Rowam Hamilton** and **Thomas Penyngton " -"Kirkman**." -msgstr "" -"旅行推销员问题由数学家 **William Rowam Hamilton 爵士** 和 **Thomas Penyngton " -"Kirkman** 于 18 世纪研究。" +msgid "The traveling sales person problem was studied in the 18th century by mathematicians **Sir William Rowam Hamilton** and **Thomas Penyngton Kirkman**." +msgstr "旅行推销员问题由数学家 **William Rowam Hamilton 爵士** 和 **Thomas Penyngton Kirkman** 于 18 世纪研究。" -msgid "" -"A discussion about the work of Hamilton & Kirkman can be found in the book " -"**Graph Theory (Biggs et al. 1976)**." -msgstr "" -"关于 Hamilton 和 Kirkman 工作的讨论，可以在 **《图论》（Biggs 等，1976年）** " -"一书中找到。" +msgid "A discussion about the work of Hamilton & Kirkman can be found in the book **Graph Theory (Biggs et al. 1976)**." +msgstr "关于 Hamilton 和 Kirkman 工作的讨论，可以在 **《图论》（Biggs 等，1976年）** 一书中找到。" msgid "ISBN-13: 978-0198539162" msgstr "ISBN-13: 978-0198539162" @@ -552,19 +490,8 @@ msgstr "ISBN-13: 978-0198539162" msgid "ISBN-10: 0198539169" msgstr "ISBN-10: 0198539169" -msgid "" -"It is believed that the general form of the TSP have been first studied by " -"Kalr Menger in Vienna and Harvard. The problem was later promoted by " -"Hassler, Whitney & Merrill at Princeton. A detailed description about the " -"connection between Menger & Whitney, and the development of the TSP can be " -"found in `On the history of combinatorial optimization (till 1960) `__" -msgstr "" -"人们认为旅行推销员问题（TSP）的一般形式最早由维也纳和哈佛的卡尔·门格尔（Karl " -"Menger）研究。后来，普林斯顿的哈斯勒、惠特尼和梅里尔（Hassler, Whitney & " -"Merrill）进一步推动了这个问题。关于门格尔和惠特尼之间的联系以及TSP的发展，可" -"以在 `组合优化的历史(直到1960年) `__" +msgid "It is believed that the general form of the TSP have been first studied by Kalr Menger in Vienna and Harvard. The problem was later promoted by Hassler, Whitney & Merrill at Princeton. A detailed description about the connection between Menger & Whitney, and the development of the TSP can be found in `On the history of combinatorial optimization (till 1960) `__" +msgstr "人们认为旅行推销员问题（TSP）的一般形式最早由维也纳和哈佛的卡尔·门格尔（Karl Menger）研究。后来，普林斯顿的哈斯勒、惠特尼和梅里尔（Hassler, Whitney & Merrill）进一步推动了这个问题。关于门格尔和惠特尼之间的联系以及TSP的发展，可以在 `组合优化的历史(直到1960年) `__" msgid "To calculate the number of different tours through :math:`n` cities:" msgstr "计算经过 : math:`n` 城市的不同旅行次数：" @@ -581,9 +508,7 @@ msgstr "第三个城市的 :math:`n-2` 选项等。" msgid "Multiplying these together we get :math:`(n-1)! = (n-1) (n-2) . . 1`." msgstr "相乘得到 :math:`(n-1)！= (n-1) (n-2) ..1`." -msgid "" -"Now since the travel costs do not depend on the direction taken around the " -"tour:" +msgid "Now since the travel costs do not depend on the direction taken around the tour:" msgstr "现在，由于旅行成本不取决于旅行的方向：" msgid "this number by 2" @@ -602,9 +527,7 @@ msgid "Metric Algorithm is used" msgstr "使用度量算法" #, fuzzy -msgid "" -"Implementation generates solutions that *are twice as long as the optimal " -"tour in the worst case*:" +msgid "Implementation generates solutions that *are twice as long as the optimal tour in the worst case*:" msgstr "*在最坏的情况下，实施产生的解决方案的时间是最佳旅行的两倍* ：" msgid "Graph characteristics for best performance:" @@ -622,9 +545,7 @@ msgstr "图中，边上的旅行成本服从三角不等式。" msgid "The traveling costs are symmetric:" msgstr "旅行费用是对称的：" -msgid "" -"Traveling costs from ``u`` to ``v`` are just as much as traveling from ``v`` " -"to ``u``" +msgid "Traveling costs from ``u`` to ``v`` are just as much as traveling from ``v`` to ``u``" msgstr "从 ``u`` 到 ``v`` 的旅行费用与从 ``v`` 到 ``u`` 的旅行费用相同" msgid "TSP optional parameters" @@ -648,35 +569,23 @@ msgstr "``end_id``" msgid "Last visiting vertex before returning to ``start_vid``." msgstr "返回 ``start_vid`` 之前最后访问的顶点。" -msgid "" -"When ``0`` any vertex can become the last visiting vertex before returning " -"to ``start_id``." -msgstr "" -"当为 ``0`` 时，任何顶点都可以成为返回 ``start_id`` 之前最后访问的顶点。" +msgid "When ``0`` any vertex can become the last visiting vertex before returning to ``start_id``." +msgstr "当为 ``0`` 时，任何顶点都可以成为返回 ``start_id`` 之前最后访问的顶点。" -msgid "" -"When ``NOT 0`` and ``start_id = 0`` then it is the first and last vertex" +msgid "When ``NOT 0`` and ``start_id = 0`` then it is the first and last vertex" msgstr "当 ``NOT 0`` 且 ``start_id = 0`` 时，它是第一个和最后一个顶点" msgid "References" msgstr "参考" -msgid "" -"`Boost: metric TSP approx `__" -msgstr "" -"`Boost: 度量旅行商问题近似算法 `__" +msgid "`Boost: metric TSP approx `__" +msgstr "`Boost: 度量旅行商问题近似算法 `__" msgid "`University of Waterloo TSP `__" msgstr "`滑铁卢大学TSP研究 `__" -msgid "" -"`Wikipedia: Traveling Salesman Problem `__" -msgstr "" -"`维基百科：旅行商问题 `__" +msgid "`Wikipedia: Traveling Salesman Problem `__" +msgstr "`维基百科：旅行商问题 `__" msgid "Vehicle Routing Functions - Category" msgstr "车辆路径规划函数 - 分类" @@ -687,8 +596,7 @@ msgstr "取货和送货问题" msgid ":doc:`pgr_pickDeliver` - Pickup & Delivery using a Cost Matrix" msgstr ":doc:`pgr_pickDeliver` - 使用成本矩阵的取货&送货" -msgid "" -":doc:`pgr_pickDeliverEuclidean` - Pickup & Delivery with Euclidean distances" +msgid ":doc:`pgr_pickDeliverEuclidean` - Pickup & Delivery with Euclidean distances" msgstr ":doc:`pgr_pickDeliverEuclidean` - 使用欧几里得距离的取货&送货" msgid "Distribution problem" @@ -700,9 +608,7 @@ msgstr ":doc:`pgr_vrpOneDepot` - 从单个仓库分发订单" msgid "Contents" msgstr "内容" -msgid "" -"Vehicle Routing Problems `VRP` are **NP-hard** optimization problem, it " -"generalises the travelling salesman problem (TSP)." +msgid "Vehicle Routing Problems `VRP` are **NP-hard** optimization problem, it generalises the travelling salesman problem (TSP)." msgstr "车辆路径问题 `VRP` 是 **NP-hard** 优化问题，它推广了旅行商问题 (TSP)。" msgid "The objective of the VRP is to minimize the total route cost." @@ -714,24 +620,14 @@ msgstr "VRP 问题有多种变体，" msgid "**pgRouting does not try to implement all variants.**" msgstr "**pgRouting 并不尝试实现所有变体。**" -msgid "" -"Capacitated Vehicle Routing Problem `CVRP` where The vehicles have limited " -"carrying capacity of the goods." +msgid "Capacitated Vehicle Routing Problem `CVRP` where The vehicles have limited carrying capacity of the goods." msgstr "容量车辆路径问题 `CVRP` 其中车辆的货物承载能力有限。" -msgid "" -"Vehicle Routing Problem with Time Windows `VRPTW` where the locations have " -"time windows within which the vehicle's visits must be made." -msgstr "" -"具有时间窗口的车辆路由问题 `VRPTW`，其中位置具有车辆必须访问的时间窗口。" +msgid "Vehicle Routing Problem with Time Windows `VRPTW` where the locations have time windows within which the vehicle's visits must be made." +msgstr "具有时间窗口的车辆路由问题 `VRPTW`，其中位置具有车辆必须访问的时间窗口。" -msgid "" -"Vehicle Routing Problem with Pickup and Delivery `VRPPD` where a number of " -"goods need to be moved from certain pickup locations to other delivery " -"locations." -msgstr "" -"取货和送货的车辆路径问题 `VRPPD` ，其中大量货物需要从某些取货地点移动到其他送" -"货地点。" +msgid "Vehicle Routing Problem with Pickup and Delivery `VRPPD` where a number of goods need to be moved from certain pickup locations to other delivery locations." +msgstr "取货和送货的车辆路径问题 `VRPPD` ，其中大量货物需要从某些取货地点移动到其他送货地点。" msgid "Limitations" msgstr "局限性" @@ -751,9 +647,7 @@ msgstr "等待时间越短越好。" msgid "Pick & Delivery" msgstr "取货 & 送货" -msgid "" -"Problem: `CVRPPDTW` Capacitated Pick and Delivery Vehicle Routing problem " -"with Time Windows" +msgid "Problem: `CVRPPDTW` Capacitated Pick and Delivery Vehicle Routing problem with Time Windows" msgstr "问题： `CVRPPDTW` 具有时间窗口的有能力分拣和送货车辆路径问题" msgid "Times are relative to `0`" @@ -783,9 +677,7 @@ msgstr "有提货和送货地点的开放和关闭时间。" msgid "Have pickup and delivery duration service times." msgstr "有取货和送货持续时间的服务时间。" -msgid "" -"have a demand request for moving goods from the pickup location to the " -"delivery location." +msgid "have a demand request for moving goods from the pickup location to the delivery location." msgstr "有将货物从取货地点移动到交货地点的需求请求。" msgid "Time based calculations:" @@ -875,12 +767,10 @@ msgstr "``3`` 推迟订单。" msgid "``4`` Optimize insert." msgstr "``4`` 优化插入。" -msgid "" -"``5`` Push back order that allows more orders to be inserted at the back" +msgid "``5`` Push back order that allows more orders to be inserted at the back" msgstr "``5`` 推迟订单，允许在后面插入更多订单" -msgid "" -"``6`` Push front order that allows more orders to be inserted at the front" +msgid "``6`` Push front order that allows more orders to be inserted at the front" msgstr "``6`` 提前订单，允许在前面插入更多订单" msgid "Orders SQL" @@ -943,32 +833,23 @@ msgstr "[``d_service``]" msgid "The duration of the unloading at the delivery location." msgstr "在交货地点卸货的持续时间。" -msgid "" -"For :doc:`pgr_pickDeliver` the pickup and delivery identifiers of the " -"locations are needed:" +msgid "For :doc:`pgr_pickDeliver` the pickup and delivery identifiers of the locations are needed:" msgstr "对于 :doc:`pgr_pickDeliver` ，需要位置的取货和送货标识符：" msgid "``p_node_id``" msgstr "``p_node_id``" -msgid "" -"The node identifier of the pickup, must match a vertex identifier in the " -"`Matrix SQL`_." +msgid "The node identifier of the pickup, must match a vertex identifier in the `Matrix SQL`_." msgstr "取货的节点标识符必须与 `Matrix SQL`_ 中的顶点标识符匹配。" msgid "``d_node_id``" msgstr "``d_node_id``" -msgid "" -"The node identifier of the delivery, must match a vertex identifier in the " -"`Matrix SQL`_." +msgid "The node identifier of the delivery, must match a vertex identifier in the `Matrix SQL`_." 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)` 值：" +msgid "For :doc:`pgr_pickDeliverEuclidean` the :math:`(x, y)` values of the locations are needed:" +msgstr "对于 :doc:`pgr_pickDeliverEuclidean` ，这需要位置的 :math:`(x, y)` 值：" msgid "``p_x``" msgstr "``p_x``" @@ -1057,25 +938,19 @@ msgstr "在结束位置加载的持续时间。" msgid "When missing: A duration in ``start_service`` is used." msgstr "缺失时：使用 ``start_service`` 中的持续时间。" -msgid "" -"For :doc:`pgr_pickDeliver` the starting and ending identifiers of the " -"locations are needed:" +msgid "For :doc:`pgr_pickDeliver` the starting and ending identifiers of the locations are needed:" msgstr "对于 :doc:`pgr_pickDeliver` ，需要位置的开始和结束标识符：" msgid "``start_node_id``" msgstr "``start_node_id``" -msgid "" -"The node identifier of the start location, must match a vertex identifier in " -"the `Matrix SQL`_." +msgid "The node identifier of the start location, must match a vertex identifier in the `Matrix SQL`_." msgstr "起始位置的节点标识符必须与 `Matrix SQL`_ 中的顶点标识符匹配。" msgid "[``end_node_id``]" msgstr "[``end_node_id``]" -msgid "" -"The node identifier of the end location, must match a vertex identifier in " -"the `Matrix SQL`_." +msgid "The node identifier of the end location, must match a vertex identifier in the `Matrix SQL`_." msgstr "结束位置的节点标识符必须与 `Matrix SQL`_ 中的顶点标识符匹配。" msgid "When missing: ``end_node_id`` is used." @@ -1135,9 +1010,7 @@ msgstr "从 **1** 开始的顺序值。" msgid "``vehicle_seq``" msgstr "``vehicle_seq``" -msgid "" -"Sequential value starting from **1** for current vehicles. The :math:`n_{th}" -"` vehicle in the solution." +msgid "Sequential value starting from **1** for current vehicles. The :math:`n_{th}` vehicle in the solution." msgstr "当前车辆从 **1** 开始的顺序值。 解决方案中的第 :math:`n_{th}` 辆车。" msgid "Value :math:`-2` indicates it is the summary row." @@ -1155,8 +1028,7 @@ msgstr "当前车辆标识符。" msgid "Summary row has the **total capacity violations**." msgstr "摘要行显示 **违规数总容量** 。" -msgid "" -"A capacity violation happens when overloading or underloading a vehicle." +msgid "A capacity violation happens when overloading or underloading a vehicle." msgstr "当车辆超载或欠载时，就会发生容量违规。" msgid "``stop_seq``" @@ -1165,17 +1037,13 @@ msgstr "``stop_seq``" msgid "INTEGER" msgstr "INTEGER" -msgid "" -"Sequential value starting from **1** for the stops made by the current " -"vehicle. The :math:`m_{th}` stop of the current vehicle." -msgstr "" -"当前车辆停止的顺序值，从 **1** 开始。 当前第 :math:`m_{th}` 车辆的停止。" +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}` 车辆的停止。" msgid "Summary row has the **total time windows violations**." msgstr "摘要行有 **违规时间窗口总数** 。" -msgid "" -"A time window violation happens when arriving after the location has closed." +msgid "A time window violation happens when arriving after the location has closed." msgstr "在该地点关闭后到达时，会发生时间窗口违规。" msgid "``stop_type``" @@ -1205,8 +1073,7 @@ msgstr "``order_id``" msgid "Pickup-Delivery order pair identifier." msgstr "取货-送货订单对标识符。" -msgid "" -"Value :math:`-1`: When no order is involved on the current stop location." +msgid "Value :math:`-1`: When no order is involved on the current stop location." msgstr "值 :math:`-1`: 当前停留位置没有订单参与。" msgid "``cargo``" @@ -1278,12 +1145,8 @@ msgstr "结束位置有当前车辆使用的 **总时间** 。" msgid "Summary row has the **total solution time**:" msgstr "摘要行包含 **总解决问题时间** ：" -msgid "" -":math:`total\\ traveling\\ time + total\\ waiting\\ time + total\\ service\\ " -"time`." -msgstr "" -":math:`total\\ traveling\\ time + total\\ waiting\\ time + total\\ service\\ " -"time`。" +msgid ":math:`total\\ traveling\\ time + total\\ waiting\\ time + total\\ service\\ time`." +msgstr ":math:`total\\ traveling\\ time + total\\ waiting\\ time + total\\ service\\ time`。" msgid "Summary Row" msgstr "摘要行" @@ -1312,12 +1175,8 @@ msgstr "**总服务时间** ：" msgid "Handling Parameters" msgstr "处理参数" -msgid "" -"To define a problem, several considerations have to be done, to get " -"consistent results. This section gives an insight of how parameters are to " -"be considered." -msgstr "" -"要定义问题，必须考虑多种因素才能获得一致的结果。 本节深入了解如何考虑参数。" +msgid "To define a problem, several considerations have to be done, to get consistent results. This section gives an insight of how parameters are to be considered." +msgstr "要定义问题，必须考虑多种因素才能获得一致的结果。 本节深入了解如何考虑参数。" msgid "`Capacity and Demand Units Handling`_" msgstr "`容量和需求单位处理`_" @@ -1352,38 +1211,23 @@ msgstr "车辆内可容纳的箱子数量。" msgid "Number of seats in the vehicle" msgstr "车内座位数" -msgid "" -"The `demand` request of the pickup-deliver orders must use the same units as " -"the units used in the vehicle's `capacity`." -msgstr "" -"取货-送货订单的 `需求` 请求必须使用与车辆 `容量` 中使用的单位相同的单位。" +msgid "The `demand` request of the pickup-deliver orders must use the same units as the units used in the vehicle's `capacity`." +msgstr "取货-送货订单的 `需求` 请求必须使用与车辆 `容量` 中使用的单位相同的单位。" -msgid "" -"To handle problems like: 10 (equal dimension) boxes of apples and 5 kg of " -"feathers that are to be transported (not packed in boxes)." +msgid "To handle problems like: 10 (equal dimension) boxes of apples and 5 kg of feathers that are to be transported (not packed in boxes)." msgstr "处理以下问题：10 箱（尺寸相等）苹果和 5 千克羽毛的运输（不装箱）。" -msgid "" -"If the vehicle's **capacity** is measured in `boxes`, a conversion of `kg of " -"feathers` to `number of boxes` is needed." -msgstr "" -"如果车辆的 **容量** 以 `箱子` 来衡量，则需要将 `羽毛的千克` 换算为 `箱子的数" -"量`。" +msgid "If the vehicle's **capacity** is measured in `boxes`, a conversion of `kg of feathers` to `number of boxes` is needed." +msgstr "如果车辆的 **容量** 以 `箱子` 来衡量，则需要将 `羽毛的千克` 换算为 `箱子的数量`。" -msgid "" -"If the vehicle's **capacity** is measured in `kg`, a conversion of `box of " -"apples` to `kg` is needed." +msgid "If the vehicle's **capacity** is measured in `kg`, a conversion of `box of apples` to `kg` is needed." msgstr "如果车辆的 **容量** 以 `kg` 为单位，则需要将 `一箱苹果` 换算为 `kg` 。" msgid "Showing how the 2 possible conversions can be done" msgstr "显示如何完成两种可能的转换" -msgid "" -"Let: - :math:`f\\_boxes`: number of boxes needed for `1` kg of feathers. - :" -"math:`a\\_weight`: weight of `1` box of apples." -msgstr "" -"设：- :math:`f\\_boxes`： `1` 公斤羽毛所需的箱子数量。- :math:`a\\_weight`： " -"`1` 箱子苹果的重量。" +msgid "Let: - :math:`f\\_boxes`: number of boxes needed for `1` kg of feathers. - :math:`a\\_weight`: weight of `1` box of apples." +msgstr "设：- :math:`f\\_boxes`： `1` 公斤羽毛所需的箱子数量。- :math:`a\\_weight`： `1` 箱子苹果的重量。" msgid "Capacity Units" msgstr "容量单位" @@ -1436,18 +1280,11 @@ msgstr "所有标识符都是给定矩阵的索引。" msgid "Time Handling" msgstr "时间处理" -msgid "" -"The times are relative to **0**. All time units have to be converted to a " -"**0** reference and the same time units." -msgstr "" -"时间是相对于 **0** 的。所有时间单位都必须转换为 **0** 参考和相同的时间单位。" +msgid "The times are relative to **0**. All time units have to be converted to a **0** reference and the same time units." +msgstr "时间是相对于 **0** 的。所有时间单位都必须转换为 **0** 参考和相同的时间单位。" -msgid "" -"Suppose that a vehicle's driver starts the shift at 9:00 am and ends the " -"shift at 4:30 pm and the service time duration is 10 minutes with 30 seconds." -msgstr "" -"假设车辆驾驶员上午 9:00 开始换班，下午 4:30 结束换班，服务时间为 10 分钟 30 " -"秒。" +msgid "Suppose that a vehicle's driver starts the shift at 9:00 am and ends the shift at 4:30 pm and the service time duration is 10 minutes with 30 seconds." +msgstr "假设车辆驾驶员上午 9:00 开始换班，下午 4:30 结束换班，服务时间为 10 分钟 30 秒。" msgid "Meaning of 0" msgstr "0的含义" @@ -1503,9 +1340,7 @@ msgstr ":math:`7.5*60 = 540`" msgid "Factor handling" msgstr "因素处理" -msgid "" -"``factor`` acts as a multiplier to convert from distance values to time " -"units the matrix values or the euclidean values." +msgid "``factor`` acts as a multiplier to convert from distance values to time units the matrix values or the euclidean values." msgstr "``因子`` 充当乘数，将距离值转换为时间单位、矩阵值或欧几里得值。" msgid "When the values are already in the desired time units" @@ -1523,13 +1358,8 @@ msgstr "当 ``因子`` < 1 时，行程时间会变慢" msgid "For the :doc:`pgr_pickDeliverEuclidean`:" msgstr "用于 :doc:`pgr_pickDeliverEuclidean`:" -msgid "" -"Working with time units in seconds, and x/y in lat/lon: Factor: would depend " -"on the location of the points and on the average velocity say 25m/s is the " -"velocity." -msgstr "" -"使用以秒为单位的时间单位，以及以纬度/经度为单位的 x/y： 因子：取决于点的位置" -"和平均速度，例如 25m/s 是速度。" +msgid "Working with time units in seconds, and x/y in lat/lon: Factor: would depend on the location of the points and on the average velocity say 25m/s is the velocity." +msgstr "使用以秒为单位的时间单位，以及以纬度/经度为单位的 x/y： 因子：取决于点的位置和平均速度，例如 25m/s 是速度。" msgid "Latitude" msgstr "纬度" @@ -1558,12 +1388,8 @@ msgstr "4452 s" msgid "For the :doc:`pgr_pickDeliver`:" 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`" +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`" msgid "v" msgstr "v" @@ -1583,14 +1409,10 @@ msgstr "t" msgid "Time" msgstr "时间" -msgid "" -"For the following equivalences :math:`10m/s \\approx 600m/min \\approx 36 km/" -"hr`" +msgid "For the following equivalences :math:`10m/s \\approx 600m/min \\approx 36 km/hr`" msgstr "对于以下等价 :math:`10m/s \\approx 600m/min \\approx 36 km/hr`" -msgid "" -"Working with time units in seconds and the matrix been in meters: For a " -"1000m length value on the matrix:" +msgid "Working with time units in seconds and the matrix been in meters: For a 1000m length value on the matrix:" msgstr "处理时间单位（秒）与距离矩阵（米）的换算：当矩阵中长度为 1000 米时：" msgid "Units" @@ -1653,13 +1475,8 @@ msgstr ":doc:`sampledata`" msgid "A* - Family of functions" msgstr "A* - 函数族" -msgid "" -"The A* (pronounced \"A Star\") algorithm is based on Dijkstra's algorithm " -"with a heuristic that allow it to solve most shortest path problems by " -"evaluation only a sub-set of the overall graph." -msgstr "" -"A*（发音为“A星”）算法基于 Dijkstra 算法，其启发式算法使其能够通过仅评估整个图" -"的子集来解决大多数最短路径问题。" +msgid "The A* (pronounced \"A Star\") algorithm is based on Dijkstra's algorithm with a heuristic that allow it to solve most shortest path problems by evaluation only a sub-set of the overall graph." +msgstr "A*（发音为“A星”）算法基于 Dijkstra 算法，其启发式算法使其能够通过仅评估整个图的子集来解决大多数最短路径问题。" msgid ":doc:`pgr_aStar` - A* algorithm for the shortest path." msgstr ":doc:`pgr_aStar` - A* 最短路径算法。" @@ -1754,12 +1571,8 @@ msgstr "``epsilon``" msgid "For less restricted results. :math:`epsilon >= 1`." msgstr "对于限制较少的结果。 :math:`epsilon >= 1` 。" -msgid "" -"See :ref:`heuristics ` available and :ref:`factor " -"` handling." -msgstr "" -"查看可用的 :ref:`heuristics ` 和 :ref:`factor " -"` 处理。" +msgid "See :ref:`heuristics ` available and :ref:`factor ` handling." +msgstr "查看可用的 :ref:`heuristics ` 和 :ref:`factor ` 处理。" msgid "Advanced documentation" msgstr "高级文档" @@ -1776,22 +1589,14 @@ msgstr "其中 :math:`\\Delta x = x_1 - x_0` 和 :math:`\\Delta y = y_1 - y_0`" msgid "Analysis 1" msgstr "分析1" -msgid "" -"Working with cost/reverse_cost as length in degrees, x/y in lat/lon: Factor " -"= 1 (no need to change units)" -msgstr "" -"使用 cost/reverse_cost 作为长度（以度为单位），x/y 以纬度/经度为单位：因子 = " -"1（无需更改单位）" +msgid "Working with cost/reverse_cost as length in degrees, x/y in lat/lon: Factor = 1 (no need to change units)" +msgstr "使用 cost/reverse_cost 作为长度（以度为单位），x/y 以纬度/经度为单位：因子 = 1（无需更改单位）" msgid "Analysis 2" msgstr "分析2" -msgid "" -"Working with cost/reverse_cost as length in meters, x/y in lat/lon: Factor = " -"would depend on the location of the points:" -msgstr "" -"使用 cost/reverse_cost 作为以米为单位的长度，以纬度/经度为单位的 x/y： " -"Factor = 将取决于点的位置：" +msgid "Working with cost/reverse_cost as length in meters, x/y in lat/lon: Factor = would depend on the location of the points:" +msgstr "使用 cost/reverse_cost 作为以米为单位的长度，以纬度/经度为单位的 x/y： Factor = 将取决于点的位置：" msgid "1 longitude degree is 78846.81 m" msgstr "1 经度为 78846.81 米" @@ -1808,21 +1613,14 @@ msgstr "111319" msgid "Analysis 3" msgstr "分析3" -msgid "" -"Working with cost/reverse_cost as time in seconds, x/y in lat/lon: Factor: " -"would depend on the location of the points and on the average speed say 25m/" -"s is the speed." -msgstr "" -"使用 cost/reverse_cost 作为以秒为单位的时间，以 lat/lon 为单位的 x/y： 因子：" -"取决于点的位置和平均速度，例如 25m/s 是速度。" +msgid "Working with cost/reverse_cost as time in seconds, x/y in lat/lon: Factor: would depend on the location of the points and on the average speed say 25m/s is the speed." +msgstr "使用 cost/reverse_cost 作为以秒为单位的时间，以 lat/lon 为单位的 x/y： 因子：取决于点的位置和平均速度，例如 25m/s 是速度。" msgid ":doc:`bdAstar-family`" msgstr ":doc:`bdAstar-family`" -msgid "" -"`Boost: A* search `__" -msgstr "" -"`Boost: A* search `__" +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" @@ -1845,26 +1643,16 @@ msgstr "主要特点是：" msgid "It does not return a path." msgstr "它不返回路径。" -msgid "" -"Returns the sum of the costs of the shortest path for each pair of nodes in " -"the graph." +msgid "Returns the sum of the costs of the shortest path for each pair of nodes in the graph." 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` 矩阵，其中无穷大值。 表示没有路径的顶点之" -"间的距离。" +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` 矩阵，其中无穷大值。 表示没有路径的顶点之间的距离。" -msgid "" -"We return only the non infinity values in form of a set of `(start_vid, " -"end_vid, agg_cost)`." +msgid "We return only the non infinity values in form of a set of `(start_vid, end_vid, agg_cost)`." msgstr "我们仅以一组 `(start_vid, end_vid, agg_cost)` 的形式返回非无穷大值。" -msgid "" -"Let be the case the values returned are stored in a table, so the unique " -"index would be the pair: `(start_vid, end_vid)`." +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 the undirected graph, the results are symmetric." @@ -1936,13 +1724,8 @@ msgstr "测试" msgid "One" msgstr "1" -msgid "" -"This test is not with a bounding box The density of the passed graph is " -"extremely low. For each 30 tests were executed to get the average The " -"tested query is:" -msgstr "" -"该测试没有使用边界框，通过的图形密度极低。 对于每个 执行 30 次测试以获" -"得平均值， 测试的查询是：" +msgid "This test is not with a bounding box The density of the passed graph is extremely low. For each 30 tests were executed to get the average The tested query is:" +msgstr "该测试没有使用边界框，通过的图形密度极低。 对于每个 执行 30 次测试以获得平均值， 测试的查询是：" msgid "The results of this tests are presented as:" msgstr "该测试的结果如下：" @@ -2283,13 +2066,8 @@ msgstr "6.51" msgid "Two" msgstr "2" -msgid "" -"This test is with a bounding box The density of the passed graph higher than " -"of the Test One. For each 30 tests were executed to get the average " -"The tested edge query is:" -msgstr "" -"该测试带有边界框。通过的图形的密度高于测试一的密度。 对于每个 执行 30 " -"次测试以获得平均值，测试的边缘查询为：" +msgid "This test is with a bounding box The density of the passed graph higher than of the Test One. For each 30 tests were executed to get the average The tested edge query is:" +msgstr "该测试带有边界框。通过的图形的密度高于测试一的密度。 对于每个 执行 30 次测试以获得平均值，测试的边缘查询为：" msgid "The tested queries" msgstr "测试的查询" @@ -2591,51 +2369,29 @@ msgstr ":doc:`pgr_johnson`" msgid ":doc:`pgr_floydWarshall`" msgstr ":doc:`pgr_floydWarshall`" -msgid "" -"Boost `floyd-Warshall `__" -msgstr "" -"Boost `弗洛伊德算法 `__" +msgid "Boost `floyd-Warshall `__" +msgstr "Boost `弗洛伊德算法 `__" msgid "Bidirectional A* - Family of functions" msgstr "双向A* - 函数族" -msgid "" -"The bidirectional A* (pronounced \"A Star\") algorithm is based on the A* " -"algorithm." +msgid "The bidirectional A* (pronounced \"A Star\") algorithm is based on the A* algorithm." msgstr "双向A*（发音为\"A星\"）算法基于A*算法。" msgid ":doc:`pgr_bdAstar` - Bidirectional A* algorithm for obtaining paths." msgstr ":doc:`pgr_bdAstar` - 获取路径的双向A*算法。" -msgid "" -":doc:`pgr_bdAstarCost` - Bidirectional A* algorithm to calculate the cost of " -"the paths." +msgid ":doc:`pgr_bdAstarCost` - Bidirectional A* algorithm to calculate the cost of the paths." msgstr ":doc:`pgr_bdAstarCost` - 双向 A* 算法计算路径成本。" -msgid "" -":doc:`pgr_bdAstarCostMatrix` - Bidirectional A* algorithm to calculate a " -"cost matrix of paths." +msgid ":doc:`pgr_bdAstarCostMatrix` - Bidirectional A* algorithm to calculate a cost matrix of paths." msgstr ":doc:`pgr_bdAstarCostMatrix` - 用于计算路径成本矩阵的双向 A* 算法。" -msgid "" -"Based on A* algorithm, the bidirectional search finds a shortest path from a " -"starting vertex (``start_vid``) to an ending vertex (``end_vid``). It runs " -"two simultaneous searches: one forward from the ``start_vid``, and one " -"backward from the ``end_vid``, stopping when the two meet in the middle. " -"This implementation can be used with a directed graph and an undirected " -"graph." -msgstr "" -"基于A*算法，双向搜索找到从起始顶点(``start_vid``)到结束顶点(``end_vid``)的最" -"短路径。 它同时运行两项搜索：一项从 ``start_vid`` 向前搜索，一项从 " -"``end_vid`` 向后搜索，当两者在中间相遇时停止。 该实现可以与有向图和无向图一起" -"使用。" +msgid "Based on A* algorithm, the bidirectional search finds a shortest path from a starting vertex (``start_vid``) to an ending vertex (``end_vid``). It runs two simultaneous searches: one forward from the ``start_vid``, and one backward from the ``end_vid``, stopping when the two meet in the middle. This implementation can be used with a directed graph and an undirected graph." +msgstr "基于A*算法，双向搜索找到从起始顶点(``start_vid``)到结束顶点(``end_vid``)的最短路径。 它同时运行两项搜索：一项从 ``start_vid`` 向前搜索，一项从 ``end_vid`` 向后搜索，当两者在中间相遇时停止。 该实现可以与有向图和无向图一起使用。" #, fuzzy -msgid "" -"For large graphs where there is a path between the starting vertex and " -"ending vertex:" +msgid "For large graphs where there is a path between the starting vertex and ending vertex:" msgstr "对于起始顶点和结束顶点之间存在路径的大型图:" #, fuzzy @@ -2648,44 +2404,28 @@ msgstr ":doc:`aStar-family`" msgid "Bidirectional Dijkstra - Family of functions" msgstr "双向 Dijkstra - 函数族" -msgid "" -":doc:`pgr_bdDijkstra` - Bidirectional Dijkstra algorithm for the shortest " -"paths." +msgid ":doc:`pgr_bdDijkstra` - Bidirectional Dijkstra algorithm for the shortest paths." msgstr ":doc:`pgr_bdDijkstra` - 最短路径的双向 Dijkstra 算法。" -msgid "" -":doc:`pgr_bdDijkstraCost` - Bidirectional Dijkstra to calculate the cost of " -"the shortest paths" +msgid ":doc:`pgr_bdDijkstraCost` - Bidirectional Dijkstra to calculate the cost of the shortest paths" msgstr ":doc:`pgr_bdDijkstraCost` - 双向 Dijkstra 计算最短路径的成本" -msgid "" -":doc:`pgr_bdDijkstraCostMatrix` - Bidirectional Dijkstra algorithm to create " -"a matrix of costs of the shortest paths." -msgstr "" -":doc:`pgr_bdDijkstraCostMatrix` - 创建最短路径成本矩阵的双向 Dijkstra 算法。" +msgid ":doc:`pgr_bdDijkstraCostMatrix` - Bidirectional Dijkstra algorithm to create a matrix of costs of the shortest paths." +msgstr ":doc:`pgr_bdDijkstraCostMatrix` - 创建最短路径成本矩阵的双向 Dijkstra 算法。" msgid "Synopsis" msgstr "概要" -msgid "" -"Based on Dijkstra's algorithm, the bidirectional search finds a shortest " -"path a starting vertex to an ending vertex." +msgid "Based on Dijkstra's algorithm, the bidirectional search finds a shortest path a starting vertex to an ending vertex." msgstr "基于 Dijkstra 算法，双向搜索找到起始顶点到结束顶点的最短路径。" -msgid "" -"It runs two simultaneous searches: one forward from the source, and one " -"backward from the target, stopping when the two meet in the middle." -msgstr "" -"它同时运行两项搜索：一项从源向前搜索，一项从目标向后搜索，当两者在中间相遇时" -"停止。" +msgid "It runs two simultaneous searches: one forward from the source, and one backward from the target, stopping when the two meet in the middle." +msgstr "它同时运行两项搜索：一项从源向前搜索，一项从目标向后搜索，当两者在中间相遇时停止。" -msgid "" -"This implementation can be used with a directed graph and an undirected " -"graph." +msgid "This implementation can be used with a directed graph and an undirected graph." msgstr "该实现可以与有向图和无向图一起使用。" -msgid "" -"A negative value on a cost column is interpreted as the edge does not exist." +msgid "A negative value on a cost column is interpreted as the edge does not exist." msgstr "成本列上的负值被解释为边不存在。" msgid "When there is no path:" @@ -2694,31 +2434,22 @@ msgstr "当没有路径时：" msgid "When the starting vertex and ending vertex are the same." msgstr "当起始顶点和结束顶点相同时。" -msgid "" -"The **aggregate cost** of the non included values :math:`(v, v)` is :math:`0`" +msgid "The **aggregate cost** of the non included values :math:`(v, v)` is :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 " -"path:" +msgid "When the starting vertex and ending vertex are the different and there is no path:" msgstr "当起始顶点和结束顶点不同且不存在路径时：" -msgid "" -"The **aggregate cost** the non included values :math:`(u, v)` is :math:" -"`\\infty`" +msgid "The **aggregate cost** the non included values :math:`(u, v)` is :math:`\\infty`" msgstr "未包含值 :math:`(u, v)` 的 **aggregate cost** 是 :math:`\\infty`" -msgid "" -"For optimization purposes, any duplicated value in the starting vertices or " -"on the ending vertices are ignored." +msgid "For optimization purposes, any duplicated value in the starting vertices or on the ending vertices are ignored." msgstr "出于优化目的，起始顶点或结束顶点中的任何重复值都将被忽略。" msgid "Running time (worse case scenario): :math:`O((V \\log V + E))`" msgstr "运行时间（最坏情况）： :math:`O((V \\log V + E))`" -msgid "" -"For large graphs where there is a path bewtween the starting vertex and " -"ending vertex:" +msgid "For large graphs where there is a path bewtween the starting vertex and ending vertex:" msgstr "对于起始顶点和结束顶点之间存在路径的大型图:" #, fuzzy @@ -2727,8 +2458,7 @@ msgstr "预计终止速度比 pgr_dijkstra 更快" #, fuzzy msgid "`Boost `__" -msgstr "" -"`Boost: `__" +msgstr "`Boost: `__" #, fuzzy msgid "Chinese Postman Problem - Family of functions" @@ -2752,25 +2482,19 @@ msgstr "运行时间： :math:`O(E * (E + V * logV))`" msgid "Graph must be connected." msgstr "图必须是连通的。" -msgid "" -"An Edges SQL that represents a **directed** graph with the following columns" +msgid "An Edges SQL that represents a **directed** graph with the following columns" msgstr "表示具有以下列的有向图的 Edges SQL" msgid "Coloring - Family of functions" msgstr "着色 - 函数族" -msgid "" -":doc:`pgr_sequentialVertexColoring` - Vertex coloring algorithm using greedy " -"approach." +msgid ":doc:`pgr_sequentialVertexColoring` - Vertex coloring algorithm using greedy approach." msgstr ":doc:`pgr_sequentialVertexColoring` - 顶点着色算法采用贪心法。" -msgid "" -":doc:`pgr_bipartite` - Bipartite graph algorithm using a DFS-based coloring " -"approach." +msgid ":doc:`pgr_bipartite` - Bipartite graph algorithm using a DFS-based coloring approach." msgstr ":doc:`pgr_bipartite` - 使用基于 DFS 的着色方法的二分图算法。" -msgid "" -":doc:`pgr_edgeColoring` - Edge Coloring algorithm using Vizing's theorem." +msgid ":doc:`pgr_edgeColoring` - Edge Coloring algorithm using Vizing's theorem." msgstr ":doc:`pgr_edgeColoring` - 使用 Vizing 定理的边缘着色算法。" #, fuzzy @@ -2800,30 +2524,22 @@ msgstr "边的标识符。" msgid "Color of the node." msgstr "边的几何形状。" -msgid "" -"`Boost: `__" -msgstr "" -"`Boost: `__" +msgid "`Boost: `__" +msgstr "`Boost: `__" msgid "Components - Family of functions" msgstr "分量 - 函数族" -msgid "" -":doc:`pgr_connectedComponents` - Connected components of an undirected graph." +msgid ":doc:`pgr_connectedComponents` - Connected components of an undirected graph." msgstr ":doc:`pgr_connectedComponents` - 无向图的连通分量。" -msgid "" -":doc:`pgr_strongComponents` - Strongly connected components of a directed " -"graph." +msgid ":doc:`pgr_strongComponents` - Strongly connected components of a directed graph." msgstr ":doc:`pgr_strongComponents` - 有向图的强连通分量。" -msgid "" -":doc:`pgr_biconnectedComponents` - Biconnected components of an undirected " -"graph." +msgid ":doc:`pgr_biconnectedComponents` - Biconnected components of an undirected graph." msgstr ":doc:`pgr_biconnectedComponents` - 无向图的双连通分量。" -msgid "" -":doc:`pgr_articulationPoints` - Articulation points of an undirected graph." +msgid ":doc:`pgr_articulationPoints` - Articulation points of an undirected graph." msgstr ":doc:`pgr_articulationPoints` - 无向图的铰接点。" msgid ":doc:`pgr_bridges` - Bridges of an undirected graph." @@ -2847,25 +2563,11 @@ msgstr ":doc:`pgr_contractionLinear`" msgid ":doc:`pgr_contractionHierarchies`" msgstr ":doc:`pgr_contractionHierarchies`" -msgid "" -"In large graphs, like road graphs or electric networks, graph contraction " -"can be used to speed up some graph algorithms. Contraction can reduce the " -"size of the graph by removing some of the vertices and edges and adding " -"edges that represent a sequence of original edges (the original ones can be " -"kept in some methods). In this way, it decreases the total time and space " -"used by graph algorithms, particularly those searching for an optimal path." -msgstr "" -"在大型图中，如道路图或电力网络，图收缩可以用来加速一些图算法。收缩通过移除部" -"分顶点和边，并添加表示原始边序列的边来减小图的大小（在某些方法中可以保留原始" -"边）。通过这种方式，它减少了图算法使用的总时间和空间，特别是那些寻找最优路径" -"的算法。" +msgid "In large graphs, like road graphs or electric networks, graph contraction can be used to speed up some graph algorithms. Contraction can reduce the size of the graph by removing some of the vertices and edges and adding edges that represent a sequence of original edges (the original ones can be kept in some methods). In this way, it decreases the total time and space used by graph algorithms, particularly those searching for an optimal path." +msgstr "在大型图中，如道路图或电力网络，图收缩可以用来加速一些图算法。收缩通过移除部分顶点和边，并添加表示原始边序列的边来减小图的大小（在某些方法中可以保留原始边）。通过这种方式，它减少了图算法使用的总时间和空间，特别是那些寻找最优路径的算法。" -msgid "" -"This implementation gives a flexible framework for adding contraction " -"algorithms in the future. Currently, it supports three algorithms." -msgstr "" -"这种实现方式提供了一个灵活的框架，以便将来添加收缩算法。目前，它支持三种算" -"法。" +msgid "This implementation gives a flexible framework for adding contraction algorithms in the future. Currently, it supports three algorithms." +msgstr "这种实现方式提供了一个灵活的框架，以便将来添加收缩算法。目前，它支持三种算法。" msgid "Dead end contraction" msgstr "死端收缩" @@ -2876,22 +2578,14 @@ msgstr "线性收缩" msgid "Contraction hierarchies" msgstr "收缩等级" -msgid "" -"The two first ones can be combined through a iterative procedure, via the " -"``pgr_contraction`` method. The third one is implemented on its own." -msgstr "" -"前两项可以通过 ``pgr_contraction`` 方法，通过迭代程序进行组合。第三种方法是独" -"立实现的。" +msgid "The two first ones can be combined through a iterative procedure, via the ``pgr_contraction`` method. The third one is implemented on its own." +msgstr "前两项可以通过 ``pgr_contraction`` 方法，通过迭代程序进行组合。第三种方法是独立实现的。" msgid "All functions allow the user to forbid contraction on a set of nodes." 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 "https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/lecture16.pdf" +msgstr "https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/lecture16.pdf" msgid "https://ae.iti.kit.edu/download/diploma_thesis_geisberger.pdf" msgstr "https://ae.iti.kit.edu/download/diploma_thesis_geisberger.pdf" @@ -2923,27 +2617,19 @@ msgstr ":doc:`pgr_withPointsCost`" msgid "Each function works as part of the family it belongs to." msgstr "每个函数都是其所属家族的一部分。" -msgid "" -"Returns the sum of the costs of the shortest path of each pair combination " -"of nodes requested." +msgid "Returns the sum of the costs of the shortest path of each pair combination of nodes requested." msgstr "返回所请求的每对节点组合的最短路径的成本总和。" -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 "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 "" -"Depending on the function and its parameters, the results can be symmetric." +msgid "Depending on the function and its parameters, the results can be symmetric." msgstr "根据函数及其参数，结果可能是对称的。" -msgid "" -"The **aggregate cost** of :math:`(u, v)` is the same as for :math:`(v, u)`." +msgid "The **aggregate cost** of :math:`(u, v)` is the same as for :math:`(v, u)`." msgstr ":math:`(u, v)` 的 **总成本** 与 :math:`(v, u)` 的相同。" -msgid "" -"Any duplicated value in the start or end vertex identifiers are ignored." +msgid "Any duplicated value in the start or end vertex identifiers are ignored." msgstr "起始或结束顶点标识符中的任何重复值都将被忽略。" msgid "The returned values are ordered:" @@ -2973,23 +2659,16 @@ msgstr ":doc:`pgr_bdDijkstraCostMatrix`" msgid ":doc:`pgr_withPointsCostMatrix`" msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "" -":doc:`TSP-family` needs as input a symmetric cost matrix and no edge `(u, " -"v)` must value :math:`\\infty`." -msgstr "" -":doc:`TSP-family` 需要一个对称成本矩阵作为输入，并且没有边 `(u, v)` 必须值" -"为 :math:`\\infty`。" +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 "" -"This collection of functions will return a cost matrix in form of a table." +msgid "This collection of functions will return a cost matrix in form of a table." msgstr "该函数集合将以表格形式返回成本矩阵。" msgid "Can be used as input to :doc:`pgr_TSP`." msgstr "可用作 :doc:`pgr_TSP` 的输入。" -msgid "" -"Use directly when the resulting matrix is symmetric and there is no :math:" -"`\\infty` value." +msgid "Use directly when the resulting matrix is symmetric and there is no :math:`\\infty` value." msgstr "当得到的矩阵是对称且没有 :math:`\\infty` 值时直接使用。" msgid "It will be the users responsibility to make the matrix symmetric." @@ -3001,36 +2680,28 @@ msgstr "通过使用非对称值的几何平均或调和平均。" msgid "By using max or min the non symmetric values." msgstr "通过使用 max 或 min 非对称值。" -msgid "" -"By setting the upper triangle to be the mirror image of the lower triangle." +msgid "By setting the upper triangle to be the mirror image of the lower triangle." msgstr "通过将上三角形设置为下三角形的镜像。" -msgid "" -"By setting the lower triangle to be the mirror image of the upper triangle." +msgid "By setting the lower triangle to be the mirror image of the upper triangle." msgstr "通过将下三角形设置为上三角形的镜像。" msgid "It is also the users responsibility to fix an :math:`\\infty` value." msgstr "确定 :math:`\\infty` 值也是用户的责任。" -msgid "" -"Returns the sum of the costs of the shortest path for pair combination of " -"nodes in the graph." +msgid "Returns the sum of the costs of the shortest path for pair combination of nodes in the graph." msgstr "返回图中节点对组合的最短路径的成本总和。" -msgid "" -"When the starting vertex and ending vertex are the same, there is no path." +msgid "When the starting vertex and ending vertex are the same, there is no path." msgstr "当起始顶点和结束顶点相同时，就没有路径。" msgid "The aggregate cost in the non included values `(v, v)` is `0`." msgstr "未包含值 `(v, v)` 中的总成本为 `0` 。" -msgid "" -"When the starting vertex and ending vertex are the different and there is no " -"path." +msgid "When the starting vertex and ending vertex are the different and there is no path." msgstr "当起始顶点和结束顶点不同且不存在路径时。" -msgid "" -"The aggregate cost in the non included values `(u, v)` is :math:`\\infty`." +msgid "The aggregate cost in the non included values `(u, v)` is :math:`\\infty`." msgstr "未包含值 `(u, v)` 中的总成本为 :math:`\\infty` 。" msgid "Let be the case the values returned are stored in a table:" @@ -3078,16 +2749,13 @@ msgstr "**value**" msgid "Identifier of the point." msgstr "点的标识符。" -msgid "" -"Use with positive value, as internally will be converted to negative value" +msgid "Use with positive value, as internally will be converted to negative value" msgstr "使用正值，因为内部将转换为负值" msgid "If column is present, it can not be NULL." msgstr "如果列存在，则它不能为 NULL。" -msgid "" -"If column is not present, a sequential negative **value** will be given " -"automatically." +msgid "If column is not present, a sequential negative **value** will be given automatically." msgstr "如果列不存在，将自动给出连续的负 **值** 。" msgid "``edge_id``" @@ -3100,9 +2768,7 @@ msgid "``fraction``" msgstr "``fraction``" #, fuzzy -msgid "" -"Value in <0,1> that indicates the relative position from the first end point " -"of the edge." +msgid "Value in <0,1> that indicates the relative position from the first end point of the edge." msgstr "<0,1> 中的值指示距边缘第一个端点的相对位置。" msgid "``side``" @@ -3138,18 +2804,13 @@ msgstr ":doc:`pgr_dijkstra` - Dijkstra 最短路径算法。" msgid ":doc:`pgr_dijkstraCost` - Get the aggregate cost of the shortest paths." msgstr ":doc:`pgr_dijkstraCost` - 获取最短路径的总成本。" -msgid "" -":doc:`pgr_dijkstraCostMatrix` - Use pgr_dijkstra to create a costs matrix." +msgid ":doc:`pgr_dijkstraCostMatrix` - Use pgr_dijkstra to create a costs matrix." msgstr ":doc:`pgr_dijkstraCostMatrix` - 使用 pgr_dijkstra 创建成本矩阵。" -msgid "" -":doc:`pgr_drivingDistance` - Use pgr_dijkstra to calculate catchament " -"information." +msgid ":doc:`pgr_drivingDistance` - Use pgr_dijkstra to calculate catchament information." msgstr ":doc:`pgr_drivingDistance` - 使用 pgr_dijkstra 计算流域信息。" -msgid "" -":doc:`pgr_KSP` - Use Yen algorithm with pgr_dijkstra to get the K shortest " -"paths." +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 ":doc:`pgr_dijkstraVia` - Get a route of a sequence of vertices." @@ -3161,16 +2822,8 @@ msgstr ":doc:`pgr_dijkstraNear` - 获取到最近顶点的路线。" msgid ":doc:`pgr_dijkstraNearCost` - Get the cost to the nearest vertex." msgstr ":doc:`pgr_dijkstraNearCost` - 获取最近顶点的成本。" -msgid "" -"Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra " -"in 1956. It is a graph search algorithm that solves the shortest path " -"problem for a graph with non-negative edge path costs, producing a shortest " -"path from a starting vertex to an ending vertex. This implementation can be " -"used with a directed graph and an undirected graph." -msgstr "" -"Dijkstra算法，由荷兰计算机科学家Edsger Dijkstra于1956年提出。它是一种图搜索算" -"法，解决具有非负边路径成本的图的最短路径问题，产生从起始顶点到结束顶点的最短" -"路径。 该实现可以与有向图和无向图一起使用。" +msgid "Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956. It is a graph search algorithm that solves the shortest path problem for a graph with non-negative edge path costs, producing a shortest path from a starting vertex to an ending vertex. This implementation can be used with a directed graph and an undirected graph." +msgstr "Dijkstra算法，由荷兰计算机科学家Edsger Dijkstra于1956年提出。它是一种图搜索算法，解决具有非负边路径成本的图的最短路径问题，产生从起始顶点到结束顶点的最短路径。 该实现可以与有向图和无向图一起使用。" msgid "Running time: :math:`O(| start\\ vids | * (V \\log V + E))`" msgstr "运行时间： :math:`O(| start\\ vids | * (V \\log V + E))`" @@ -3220,11 +2873,8 @@ msgstr "给出以下查询：" msgid "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" -msgid "" -"where :math:`sql = \\{(id_i, source_i, target_i, cost_i, reverse\\_cost_i)\\}" -"`" -msgstr "" -"其中 :math:`sql =\\{(id_i, source_i, target_i, cost_i, reverse\\_cost_i)\\}`" +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 "and" msgstr "和" @@ -3253,22 +2903,8 @@ 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 ":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 "无向图" @@ -3277,31 +2913,10 @@ msgid "The weighted undirected graph, :math:`G_u(V,E)`, is defined 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}}`" +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 ":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 "问题" @@ -3315,22 +2930,14 @@ 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 ":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 ":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 "其中：" @@ -3350,51 +2957,28 @@ 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:`\\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:`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 ":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 "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:`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." +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." @@ -3403,8 +2987,7 @@ msgstr "如果没有路径，则结果集为空。" msgid "Driving Distance - Category" msgstr "驾驶距离 - 类别" -msgid "" -":doc:`pgr_drivingDistance` - Driving Distance based on Dijkstra's algorithm" +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" @@ -3419,9 +3002,7 @@ 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." +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." @@ -3436,9 +3017,7 @@ 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." +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." @@ -3504,22 +3083,16 @@ msgstr ":doc:`contraction-family`" msgid ":doc:`transformation-family`" msgstr ":doc:`transformation-family`" -msgid "" -":doc:`pgr_lineGraphFull` - Transformation algorithm for generating a Line " -"Graph out of each vertex in the input graph." -msgstr "" -":doc:`pgr_lineGraphFull` - 用于从输入图中的每个顶点生成线图的变换算法。" +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." +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." +msgid ":doc:`pgr_binaryBreadthFirstSearch` - Breath first search traversal of the graph." msgstr ":doc:`pgr_binaryBreadthFirstSearch` - 图的广度优先搜索遍历。" msgid ":doc:`components-family`" @@ -3528,34 +3101,24 @@ 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:`pgr_cuthillMckeeOrdering` - Return reverse Cuthill-McKee ordering of an undirected graph." +msgstr ":doc:`pgr_cuthillMckeeOrdering` - 返回无向图的反向 Cuthill-McKee 排序。" -msgid "" -":doc:`pgr_topologicalSort` - Linear ordering of the vertices for directed " -"acyclic graph." +msgid ":doc:`pgr_topologicalSort` - Linear ordering of the vertices for directed acyclic graph." msgstr ":doc:`pgr_topologicalSort` - 有向无环图的顶点线性排序。" #, fuzzy -msgid "" -":doc:`pgr_sloanOrdering` - Returns the sloan ordering of an undirected graph." -msgstr "" -":doc:`pgr_cuthillMckeeOrdering` - 返回无向图的反向 Cuthill-McKee 排序。" +msgid ":doc:`pgr_sloanOrdering` - Returns the sloan ordering of an undirected graph." +msgstr ":doc:`pgr_cuthillMckeeOrdering` - 返回无向图的反向 Cuthill-McKee 排序。" #, fuzzy -msgid "" -":doc:`pgr_kingOrdering` - Returns the King ordering of an undirected graph." +msgid ":doc:`pgr_kingOrdering` - Returns the King ordering of an undirected graph." msgstr "``pgr_cuthillMckeeOrdering`` — 返回无向图的反向 Cuthill-Mckee 排序" msgid ":doc:`metrics-family`" msgstr ":doc:`metrics-family`" -msgid "" -":doc:`pgr_betweennessCentrality` - Calculates relative betweenness " -"centrality using Brandes Algorithm" +msgid ":doc:`pgr_betweennessCentrality` - Calculates relative betweenness centrality using Brandes Algorithm" msgstr ":doc:`pgr_betweennessCentrality` - 使用布兰德斯算法计算相对介度中心性" #, fuzzy @@ -3607,37 +3170,25 @@ 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." +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." +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." +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." +msgid ":doc:`pgr_pushRelabel` - Push and relabel algorithm with details of flow on edges." msgstr ":doc:`pgr_pushRelabel` - 推送和重新标记算法以及边流量的详细信息。" msgid "Applications" msgstr "Applications" -msgid "" -":doc:`pgr_edgeDisjointPaths` - Calculates edge disjoint paths between two " -"groups of vertices." +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." +msgid ":doc:`pgr_maxCardinalityMatch` - Calculates a maximum cardinality matching in a graph." msgstr ":doc:`pgr_maxCardinalityMatch` - 计算图中的最大基数匹配。" msgid "Flow Functions General Information" @@ -3649,9 +3200,7 @@ 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." +msgid "When the maximum flow is 0 then there is no flow and **EMPTY SET** is returned." msgstr "当最大流量为0时则没有流量并返回 **EMPTY SET** 。" msgid "There is no flow when source has the same value as target." @@ -3675,13 +3224,8 @@ 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 "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 "通过聚合来自源的传出流量" @@ -3689,14 +3233,8 @@ 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 ":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 "容量边缘" @@ -3770,8 +3308,7 @@ msgstr "沿 (``start_vid``, ``end_vid``)方向流经边缘。" msgid "**residual_capacity**" msgstr "**residual_capacity**" -msgid "" -"Residual capacity of the edge in the direction (``start_vid``, ``end_vid``)." +msgid "Residual capacity of the edge in the direction (``start_vid``, ``end_vid``)." msgstr "(``start_vid``, ``end_vid``)方向上边缘的剩余容量。" msgid "For :doc:`pgr_maxFlowMinCost`" @@ -3792,9 +3329,7 @@ msgstr "方向 (source, target)上边缘的剩余容量。" msgid "**cost**" msgstr "**cost**" -msgid "" -"The cost of sending this flow through the edge in the direction (source, " -"target)." +msgid "The cost of sending this flow through the edge in the direction (source, target)." msgstr "在方向 (source, target)上通过边缘发送此流的成本。" msgid "**agg_cost**" @@ -3806,37 +3341,20 @@ msgstr "总成本。" msgid "Advanced Documentation" msgstr "高级文档" -msgid "" -"A flow network is a directed graph where each edge has a capacity and a " -"flow. The flow through an edge must not exceed the capacity of the edge. " -"Additionally, the incoming and outgoing flow of a node must be equal except " -"for source which only has outgoing flow, and the destination(sink) which " -"only has incoming flow." -msgstr "" -"流网络是一个有向图，其中每条边都有容量和流量。通过一条边的流量不能超过边的容" -"量。此外，节点的流入流出必须相等，除了源节点只有流出流量，以及目标（汇点）节" -"点只有流入流量。" +msgid "A flow network is a directed graph where each edge has a capacity and a flow. The flow through an edge must not exceed the capacity of the edge. Additionally, the incoming and outgoing flow of a node must be equal except for source which only has outgoing flow, and the destination(sink) which only has incoming flow." +msgstr "流网络是一个有向图，其中每条边都有容量和流量。通过一条边的流量不能超过边的容量。此外，节点的流入流出必须相等，除了源节点只有流出流量，以及目标（汇点）节点只有流入流量。" -msgid "" -"Maximum flow algorithms calculate the maximum flow through the graph and the " -"flow of each edge." +msgid "Maximum flow algorithms calculate the maximum flow through the graph and the flow of each edge." msgstr "最大流量算法计算通过图的最大流量以及每条边的流量。" -msgid "" -"The maximum flow through the graph is guaranteed to be the same with all " -"implementations, but the actual flow through each edge may vary." -msgstr "" -"所有实现中通过图表的最大流量保证相同，但通过每条边的实际流量可能会有所不同。" +msgid "The maximum flow through the graph is guaranteed to be the same with all implementations, but the actual flow through each edge may vary." +msgstr "所有实现中通过图表的最大流量保证相同，但通过每条边的实际流量可能会有所不同。" msgid "pgr_maxFlow :math:`(edges\\_sql, source\\_vertex, sink\\_vertex)`" msgstr "pgr_maxFlow :math:`(edges\\_sql, source\\_vertex, sink\\_vertex)`" -msgid "" -"where :math:`edges\\_sql = \\{(id_i, source_i, target_i, capacity_i, " -"reverse\\_capacity_i)\\}`" -msgstr "" -"其中 :math:`edges\\_sql = \\{(id_i, source_i, target_i, capacity_i, " -"reverse\\_capacity_i)\\}`" +msgid "where :math:`edges\\_sql = \\{(id_i, source_i, target_i, capacity_i, reverse\\_capacity_i)\\}`" +msgstr "其中 :math:`edges\\_sql = \\{(id_i, source_i, target_i, capacity_i, reverse\\_capacity_i)\\}`" msgid "Graph definition" msgstr "图定义" @@ -3847,29 +3365,11 @@ msgstr "加权有向图， :math:`G(V,E)` 定义为：" msgid "the set of vertices :math:`V`" msgstr "顶点集 :math:`V`" -msgid "" -":math:`source\\_vertex \\cup sink\\_vertex \\bigcup source_i \\bigcup " -"target_i`" -msgstr "" -":math:`source\\_vertex \\cup sink\\_vertex \\bigcup source_i \\bigcup " -"target_i`" +msgid ":math:`source\\_vertex \\cup sink\\_vertex \\bigcup source_i \\bigcup target_i`" +msgstr ":math:`source\\_vertex \\cup sink\\_vertex \\bigcup source_i \\bigcup target_i`" -msgid "" -":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, capacity_i) " -"\\text{ when } capacity > 0 \\} & \\quad \\text{ if } reverse\\_capacity = " -"\\varnothing \\\\ \\text{ } & \\quad \\text{ } \\\\ \\{(source_i, target_i, " -"capacity_i) \\text{ when } capacity > 0 \\} & \\text{ } \\\\ \\cup " -"\\{(target_i, source_i, reverse\\_capacity_i) \\text{ when } " -"reverse\\_capacity_i > 0)\\} & \\quad \\text{ if } reverse\\_capacity \\neq " -"\\varnothing \\\\ \\end{cases}`" -msgstr "" -":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, capacity_i) " -"\\text{ when } capacity > 0 \\} & \\quad \\text{ if } reverse\\_capacity = " -"\\varnothing \\\\ \\text{ } & \\quad \\text{ } \\\\ \\{(source_i, target_i, " -"capacity_i) \\text{ when } capacity > 0 \\} & \\text{ } \\\\ \\cup " -"\\{(target_i, source_i, reverse\\_capacity_i) \\text{ when } " -"reverse\\_capacity_i > 0)\\} & \\quad \\text{ if } reverse\\_capacity \\neq " -"\\varnothing \\\\ \\end{cases}`" +msgid ":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, capacity_i) \\text{ when } capacity > 0 \\} & \\quad \\text{ if } reverse\\_capacity = \\varnothing \\\\ \\text{ } & \\quad \\text{ } \\\\ \\{(source_i, target_i, capacity_i) \\text{ when } capacity > 0 \\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_capacity_i) \\text{ when } reverse\\_capacity_i > 0)\\} & \\quad \\text{ if } reverse\\_capacity \\neq \\varnothing \\\\ \\end{cases}`" +msgstr ":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, capacity_i) \\text{ when } capacity > 0 \\} & \\quad \\text{ if } reverse\\_capacity = \\varnothing \\\\ \\text{ } & \\quad \\text{ } \\\\ \\{(source_i, target_i, capacity_i) \\text{ when } capacity > 0 \\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_capacity_i) \\text{ when } reverse\\_capacity_i > 0)\\} & \\quad \\text{ if } reverse\\_capacity \\neq \\varnothing \\\\ \\end{cases}`" msgid "Maximum flow problem" msgstr "最大流量问题" @@ -3886,21 +3386,11 @@ msgstr ":math:`sink\\_vertex \\in V` the sink vertex" msgid ":math:`pgr\\_maxFlow(edges\\_sql, source, sink) = \\boldsymbol{\\Phi}`" msgstr ":math:`pgr\\_maxFlow(edges\\_sql, source, sink) = \\boldsymbol{\\Phi}`" -msgid "" -":math:`\\boldsymbol{\\Phi} = {(id_i, edge\\_id_i, source_i, target_i, " -"flow_i, residual\\_capacity_i)}`" -msgstr "" -":math:`\\boldsymbol{\\Phi} = {(id_i, edge\\_id_i, source_i, target_i, " -"flow_i, residual\\_capacity_i)}`" +msgid ":math:`\\boldsymbol{\\Phi} = {(id_i, edge\\_id_i, source_i, target_i, flow_i, residual\\_capacity_i)}`" +msgstr ":math:`\\boldsymbol{\\Phi} = {(id_i, edge\\_id_i, source_i, target_i, flow_i, residual\\_capacity_i)}`" -msgid "" -":math:`\\boldsymbol{\\Phi}` is a subset of the original edges with their " -"residual capacity and flow. The maximum flow through the graph can be " -"obtained by aggregating on the source or sink and summing the flow from/to " -"it. In particular:" -msgstr "" -":math:`\\boldsymbol{\\Phi}` 是原始边及其剩余容量和流量的子集。 通过图的最大流" -"量可以通过在源或汇上聚合并对来自/到它的流量求和来获得。 尤其：" +msgid ":math:`\\boldsymbol{\\Phi}` is a subset of the original edges with their residual capacity and flow. The maximum flow through the graph can be obtained by aggregating on the source or sink and summing the flow from/to it. In particular:" +msgstr ":math:`\\boldsymbol{\\Phi}` 是原始边及其剩余容量和流量的子集。 通过图的最大流量可以通过在源或汇上聚合并对来自/到它的流量求和来获得。 尤其：" msgid ":math:`id_i = i`" msgstr ":math:`id_i = i`" @@ -3914,13 +3404,8 @@ msgstr ":math:`residual\\_capacity_i = capacity_i - flow_i`" msgid "https://en.wikipedia.org/wiki/Maximum_flow_problem" msgstr "https://en.wikipedia.org/wiki/Maximum_flow_problem" -msgid "" -"pgRouting extends the `PostGIS `__/`PostgreSQL `__ geospatial database to provide geospatial routing and " -"other network analysis functionality." -msgstr "" -"pgRouting 扩展了 `PostGIS `__/`PostgreSQL `__ 地理空间数据库，以提供地理空间路由和其他网络分析功能。" +msgid "pgRouting extends the `PostGIS `__/`PostgreSQL `__ geospatial database to provide geospatial routing and other network analysis functionality." +msgstr "pgRouting 扩展了 `PostGIS `__/`PostgreSQL `__ 地理空间数据库，以提供地理空间路由和其他网络分析功能。" msgid "This is the manual for pgRouting |release|." msgstr "这是pgRouting |release| 手册 。" @@ -3928,18 +3413,8 @@ msgstr "这是pgRouting |release| 手册 。" msgid "Creative Commons Attribution-Share Alike 3.0 License" msgstr "知识共享署名 - 相同方式共享 3.0 许可证" -msgid "" -"The pgRouting Manual is licensed under a `Creative Commons Attribution-Share " -"Alike 3.0 License `_. Feel " -"free to use this material any way you like, but we ask that you attribute " -"credit to the pgRouting Project and wherever possible, a link back to " -"https://pgrouting.org. For other licenses used in pgRouting see the :ref:" -"`license` page." -msgstr "" -"pgRouting 手册根据 `Creative Commons Attribution-Share Alike 3.0 License " -"`_ 。 您可以随意使用本材料，" -"但我们要求您将功劳归功于 pgRouting 项目，并尽可能提供返回 https://pgrouting." -"org 的链接。 有关 pgRouting 中使用的其他许可证，请参阅 :ref:`license` 。" +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 手册根据 `Creative Commons Attribution-Share Alike 3.0 License `_ 。 您可以随意使用本材料，但我们要求您将功劳归功于 pgRouting 项目，并尽可能提供返回 https://pgrouting.org 的链接。 有关 pgRouting 中使用的其他许可证，请参阅 :ref:`license` 。" msgid "General" msgstr "常规" @@ -3971,9 +3446,7 @@ msgstr ":doc:`pgr_kruskal`" msgid ":doc:`pgr_kruskalDD`" msgstr ":doc:`pgr_kruskalDD`" -msgid "" -":doc:`pgr_degree` - Returns a set of vertices and corresponding count of " -"incident edges to the vertex." +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`" @@ -3998,9 +3471,7 @@ msgstr ":doc:`pgr_full_version`" msgid ":doc:`utilities-family`" msgstr ":doc:`metrics-family`" -msgid "" -":doc:`pgr_extractVertices` - Extracts vertex information based on the edge " -"table information." +msgid ":doc:`pgr_extractVertices` - Extracts vertex information based on the edge table information." msgstr ":doc:`pgr_extractVertices` - 根据边表信息提取顶点信息。" msgid ":doc:`pgr_findCloseEdges` - Finds close edges of points on the fly" @@ -4009,9 +3480,7 @@ msgstr ":doc:`pgr_findCloseEdges` - 动态查找最近道路边线" msgid ":doc:`pgr_separateCrossing` - Breaks geometries that cross each other." msgstr ":doc:`pgr_separateCrossing` - 断开相互交叉的几何图形。" -msgid "" -":doc:`pgr_separateTouching` - Breaks geometries that (almost) touch each " -"other." +msgid ":doc:`pgr_separateTouching` - Breaks geometries that (almost) touch each other." msgstr ":doc:`pgr_separateTouching` - 断开相互（接近）接触的几何图形。" msgid ":doc:`withPoints-family`" @@ -4080,19 +3549,16 @@ msgstr ":doc:`experimental`" msgid ":doc:`release_notes`" msgstr ":doc:`release_notes`" +msgid "pgRouting 4.0" +msgstr "pgRouting 4.0" + #, fuzzy msgid "pgRouting 4.0.0-alpha1 Release Notes" msgstr "pgRouting 4.0.0 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 4.0.0 `__" -msgstr "" -"查看本版本已关闭的所有议题和拉取请求,请访问： `GitHub 4.0.0版本里程碑关闭列" -"表 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.0 `__" +msgstr "查看本版本已关闭的所有议题和拉取请求,请访问： `GitHub 4.0.0版本里程碑关闭列表 `__" msgid "Build" msgstr "构建" @@ -4100,8 +3566,7 @@ msgstr "构建" msgid "C++ standard is std17" msgstr "" -msgid "" -"Using this standard, all supported toolchains across our CI matrix will work." +msgid "Using this standard, all supported toolchains across our CI matrix will work." msgstr "" msgid "The code is not yet modified to use std17:" @@ -4141,9 +3606,7 @@ msgid "The HTML documentation is built by default" msgstr "用于用户文档" #, fuzzy -msgid "" -"The translated languages (en, es, sv, zh_Hans) HTML documentation are built " -"by default" +msgid "The translated languages (en, es, sv, zh_Hans) HTML documentation are built by default" msgstr "用于用户文档" msgid "`WITH-DOC` is not used anymore" @@ -4367,12 +3830,8 @@ msgstr "pgr_trsp" msgid "pgr_trsp(text,integer,integer,boolean,boolean,text)" msgstr "pgr_trsp(text,integer,integer,boolean,boolean,text)" -msgid "" -"pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean,text)" -msgstr "" -"pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean,text)" +msgid "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" +msgstr "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" msgid "pgr_trspVia" msgstr "pgr_trspVia" @@ -4393,17 +3852,11 @@ msgid "Valid values depend on kind of graph" msgstr "有效值因有向图和无向图而异：" #, fuzzy -msgid "" -"pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean," -"character,boolean)" -msgstr "" -"pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," -"boolean)``" +msgid "pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" -msgid "" -"pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" -msgstr "" -"pgr_trspviaedges(text,integer[],double precision[],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_trsp_withPoints" msgstr "pgr_trsp_withPoints" @@ -4413,37 +3866,24 @@ msgid "**Driving side** parameter is positional unnamed and compulsory." msgstr "``driving_side`` 参数以前被命名为可选，现在是强制性的未命名参数。" #, fuzzy -msgid "" -"pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character," -"boolean)" -msgstr "" -"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" +msgid "pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" #, fuzzy -msgid "" -"pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" -msgstr "" -"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" +msgid "pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" #, fuzzy -msgid "" -"pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" -msgstr "" -"pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," -"boolean)``" +msgid "pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" #, fuzzy -msgid "" -"pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" -msgstr "" -"pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgid "pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" #, fuzzy msgid "pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" -msgstr "" -"pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" msgid "pgr_TSP" msgstr "pgr_TSP" @@ -4457,24 +3897,16 @@ msgid "Only for undirected graphs" msgstr "在无向图上：" #, fuzzy -msgid "" -"pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double " -"precision,double precision,double precision,boolean)" -msgstr "" -"pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean,text)" +msgid "pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgstr "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" #, fuzzy msgid "pgr_TSPeuclidean" msgstr "``pgr_TSPeuclidean``" #, fuzzy -msgid "" -"pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, " -"integer,double precision,double precision,double precision,boolean)" -msgstr "" -"pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean,text)" +msgid "pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, integer,double precision,double precision,double precision,boolean)" +msgstr "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" msgid "pgr_turnRestrictedPath" msgstr "pgr_turnRestrictedPath" @@ -4488,30 +3920,23 @@ msgstr "pgr_withPoints" #, fuzzy msgid "pgr_withpoints(text,text,anyarray,anyarray,boolean,character,boolean)" -msgstr "" -"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" #, fuzzy msgid "pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)" -msgstr "" -"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" #, fuzzy msgid "pgr_withpoints(text,text,bigint,anyarray,boolean,character,boolean)" -msgstr "" -"pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" #, fuzzy msgid "pgr_withpoints(text,text,bigint,bigint,boolean,character,boolean)" -msgstr "" -"pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" #, fuzzy msgid "pgr_withpoints(text,text,text,boolean,character,boolean)" -msgstr "" -"pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" msgid "pgr_withPointsCost" msgstr "pgr_withPointsCost" @@ -4538,257 +3963,151 @@ msgstr "_pgr_trsp(text,text,bigint,anyarray,boolean)" #, fuzzy msgid "pgr_withpointscost(text,text,bigint,bigint,boolean,character)" -msgstr "" -"pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," -"boolean)``" +msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" #, fuzzy msgid "pgr_withpointscost(text,text,text,boolean,character)" -msgstr "" -"pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" msgid "pgr_withPointsCostMatrix" msgstr "pgr_withPointsCostMatrix" #, fuzzy msgid "pgr_withpointscostmatrix(text,text,anyarray,boolean,character)" -msgstr "" -"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" msgid "pgr_withPointsDD" msgstr "pgr_withPointsDD" -msgid "" -"pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" -msgstr "" -"pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgid "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" -msgid "" -"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" -msgstr "" -"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" +msgid "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" msgid "pgr_withPointsKSP" msgstr "pgr_withPointsKSP" #, fuzzy -msgid "" -"pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character," -"boolean)" -msgstr "" -"pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," -"boolean)``" +msgid "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" msgid "pgr_withPointsVia" msgstr "pgr_withPointsVia" #, fuzzy -msgid "" -"pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character," -"boolean)" -msgstr "" -"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" +msgid "pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" msgid "Functions promoted to official" msgstr "正式版功能函数" #, fuzzy -msgid "" -"`#2701 `__: pgr_trsp" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2701 `__: pgr_trsp" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2701 `__: pgr_trspVia" -msgstr "" -"`#2681 `__: " -"pgr_trspviaedges" +msgid "`#2701 `__: pgr_trspVia" +msgstr "`#2681 `__: pgr_trspviaedges" #, fuzzy -msgid "" -"`#2701 `__: " -"pgr_trspVia_withPoints" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2701 `__: pgr_trspVia_withPoints" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2701 `__: " -"pgr_trsp_withPoints" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2701 `__: pgr_trsp_withPoints" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2700 `__: " -"pgr_withPoints" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2700 `__: pgr_withPoints" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2700 `__: " -"pgr_withPointsCost" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2700 `__: pgr_withPointsCost" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2700 `__: " -"pgr_withPointsCostMatrix" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2700 `__: pgr_withPointsCostMatrix" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2700 `__: " -"pgr_withPointsDD" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2700 `__: pgr_withPointsDD" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2700 `__: " -"pgr_withPointsKSP" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2700 `__: pgr_withPointsKSP" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2700 `__: " -"pgr_withPointsVia" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2700 `__: pgr_withPointsVia" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2983 `__: " -"pgr_dijkstraNear" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2983 `__: pgr_dijkstraNear" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2983 `__: " -"pgr_dijkstraNearCost" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2983 `__: pgr_dijkstraNearCost" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2983 `__: " -"pgr_dijkstraVia" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2983 `__: pgr_dijkstraVia" +msgstr "`#2683 `__: pgr_trsp" msgid "Signatures promoted to official" msgstr "正式版函数签名" #, fuzzy -msgid "" -"`#2718 `__: " -"pgr_aStar(Combinations)" -msgstr "" -"`#2798 `__: " -"pgr_contraction" +msgid "`#2718 `__: pgr_aStar(Combinations)" +msgstr "`#2798 `__: pgr_contraction" #, fuzzy -msgid "" -"`#2718 `__: " -"pgr_aStarCost(Combinations)" -msgstr "" -"`#2798 `__: " -"pgr_contraction" +msgid "`#2718 `__: pgr_aStarCost(Combinations)" +msgstr "`#2798 `__: pgr_contraction" #, fuzzy -msgid "" -"`#2718 `__: " -"pgr_bdAstar(Combinations)" -msgstr "" -"`#2798 `__: " -"pgr_contraction" +msgid "`#2718 `__: pgr_bdAstar(Combinations)" +msgstr "`#2798 `__: pgr_contraction" #, fuzzy -msgid "" -"`#2718 `__: " -"pgr_bdAstarCost(Combinations)" -msgstr "" -"`#2798 `__: " -"pgr_contraction" +msgid "`#2718 `__: pgr_bdAstarCost(Combinations)" +msgstr "`#2798 `__: pgr_contraction" #, fuzzy -msgid "" -"`#2718 `__: " -"pgr_bdDijkstra(Combinations)" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2718 `__: pgr_bdDijkstra(Combinations)" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2718 `__: " -"pgr_bdDijkstraCost(Combinations)" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2718 `__: pgr_bdDijkstraCost(Combinations)" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2718 `__: " -"pgr_dijkstra(Combinations)" -msgstr "" -"`#2798 `__: " -"pgr_contraction" +msgid "`#2718 `__: pgr_dijkstra(Combinations)" +msgstr "`#2798 `__: pgr_contraction" #, fuzzy -msgid "" -"`#2718 `__: " -"pgr_dijkstraCost(Combinations)" -msgstr "" -"`#2798 `__: " -"pgr_contraction" +msgid "`#2718 `__: pgr_dijkstraCost(Combinations)" +msgstr "`#2798 `__: pgr_contraction" #, fuzzy -msgid "" -"`#2718 `__: pgr_KSP(All " -"signatures)" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2718 `__: pgr_KSP(All signatures)" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2718 `__: " -"pgr_boykovKolmogorov(Combinations)" -msgstr "" -"`#2798 `__: " -"pgr_contraction" +msgid "`#2718 `__: pgr_boykovKolmogorov(Combinations)" +msgstr "`#2798 `__: pgr_contraction" #, fuzzy -msgid "" -"`#2718 `__: " -"pgr_edmondsKarp(Combinations)" -msgstr "" -"`#2798 `__: " -"pgr_contraction" +msgid "`#2718 `__: pgr_edmondsKarp(Combinations)" +msgstr "`#2798 `__: pgr_contraction" #, fuzzy -msgid "" -"`#2718 `__: " -"pgr_maxFlow(Combinations)" -msgstr "" -"`#2798 `__: " -"pgr_contraction" +msgid "`#2718 `__: pgr_maxFlow(Combinations)" +msgstr "`#2798 `__: pgr_contraction" #, fuzzy -msgid "" -"`#2718 `__: " -"pgr_pushRelabel(Combinations)" -msgstr "" -"`#2798 `__: " -"pgr_contraction" +msgid "`#2718 `__: pgr_pushRelabel(Combinations)" +msgstr "`#2798 `__: pgr_contraction" #, fuzzy msgid "New experimental functions." @@ -4798,38 +4117,26 @@ msgid "Metrics" msgstr "Metrics" #, fuzzy -msgid "" -"`#2951 `__: pgr_bandwidth" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2951 `__: pgr_bandwidth" +msgstr "`#2683 `__: pgr_trsp" msgid "Ordering" msgstr "排序" #, fuzzy -msgid "" -"`#2954 `__: " -"pgr_kingOrdering" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2954 `__: pgr_kingOrdering" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2955 `__: " -"pgr_sloanOrdering" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2955 `__: pgr_sloanOrdering" +msgstr "`#2683 `__: pgr_trsp" msgid "SQL signatures and output standardization" msgstr "" #, fuzzy -msgid "" -"`#2904 `__: Standardize " -"output columns of functions with different output" -msgstr "" -"`#2057 `__: trspViaEdges " -"列的顺序不同" +msgid "`#2904 `__: Standardize output columns of functions with different output" +msgstr "`#2057 `__: trspViaEdges 列的顺序不同" #, fuzzy msgid "columns within overloads" @@ -4840,1008 +4147,552 @@ msgid "Standardized to |short-generic-result|" msgstr "将输出列标准化为 |short-generic-result|" #, fuzzy -msgid "" -"`#2905 `__: " -"pgr_withPoints" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2905 `__: pgr_withPoints" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2906 `__: " -"pgr_bdDijkstra" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2906 `__: pgr_bdDijkstra" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2907 `__: " -"pgr_bellmanFord" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2907 `__: pgr_bellmanFord" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2908 `__: " -"pgr_binaryBreadthFirstSearch" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2908 `__: pgr_binaryBreadthFirstSearch" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2910 `__: " -"pgr_edwardMoore" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2910 `__: pgr_edwardMoore" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2913 `__: " -"pgr_dagShortestPath" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2913 `__: pgr_dagShortestPath" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy msgid "Standardized to |matrix-result|" msgstr "输出列是 |ksp-result|" #, fuzzy -msgid "" -"`#2905 `__: " -"pgr_withPointsCost" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2905 `__: pgr_withPointsCost" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2905 `__: " -"pgr_withPointsCostMatrix" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2905 `__: pgr_withPointsCostMatrix" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy msgid "Standardized to |generic-result|" msgstr "将输出列标准化为 |short-generic-result|" #, fuzzy -msgid "" -"`#2909 `__: " -"pgr_edgeDisjointPaths" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2909 `__: pgr_edgeDisjointPaths" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2909 `__: " -"pgr_turnRestrictedPath" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2909 `__: pgr_turnRestrictedPath" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy msgid "Standardized to |result_edge_color|" msgstr "返回集合 |result-edge-color|" #, fuzzy -msgid "" -"`#2924 `__: " -"pgr_edgeColoring" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2924 `__: pgr_edgeColoring" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy msgid "Standardized to |result_node_color|" msgstr "返回集合 |result-node-color|" #, fuzzy -msgid "" -"`#2924 `__: pgr_bipartite" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2924 `__: pgr_bipartite" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2927 `__: " -"pgr_sequentialVertexColoring" -msgstr "" -"`#2202 `__: " -"pgr_sequentialVertexColoring 变为提议状态" +msgid "`#2927 `__: pgr_sequentialVertexColoring" +msgstr "`#2202 `__: pgr_sequentialVertexColoring 变为提议状态" #, fuzzy msgid "Standardized to |result-spantree|" msgstr "将输出列标准化为 |result-spantree|" #, fuzzy -msgid "" -"`#2931 `__: " -"pgr_breadthFirstSearch" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2931 `__: pgr_breadthFirstSearch" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2931 `__: " -"pgr_depthFirstSearch" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2931 `__: pgr_depthFirstSearch" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy msgid "Standardized to |result_node_order|" msgstr "返回集合 |result-node-color|" #, fuzzy -msgid "" -"`#2934 `__: " -"pgr_topologicalSort" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2934 `__: pgr_topologicalSort" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy msgid "Standardized to |result-closure|" msgstr "将输出列标准化为 |result-spantree|" #, fuzzy -msgid "" -"`#2934 `__: " -"pgr_transitiveClosure" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2934 `__: pgr_transitiveClosure" +msgstr "`#2683 `__: pgr_trsp" msgid "Removal of SQL deprecated signatures" msgstr "移除已弃用的 SQL 函数签名" -msgid "" -"`#2798 `__: " -"pgr_contraction" -msgstr "" -"`#2798 `__: " -"pgr_contraction" +msgid "`#2798 `__: pgr_contraction" +msgstr "`#2798 `__: pgr_contraction" -msgid "" -"`#2683 `__: pgr_trsp" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2683 `__: pgr_trsp" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2683 `__: pgr_trspVia" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2683 `__: pgr_trspVia" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2888 `__: " -"pgr_findCloseEdges" -msgstr "" -"`#2850 `__:重写 " -"pgr_nodeNetwork" +msgid "`#2888 `__: pgr_findCloseEdges" +msgstr "`#2850 `__:重写 pgr_nodeNetwork" #, fuzzy -msgid "" -"pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" -msgstr "" -"pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +msgid "pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" +msgstr "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" #, fuzzy -msgid "" -"pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" -msgstr "" -"pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +msgid "pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" +msgstr "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" #, fuzzy -msgid "" -"`#2890 `__: " -"pgr_withPointsDD" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2890 `__: pgr_withPointsDD" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2895 `__: " -"pgr_withPointsKSP" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2895 `__: pgr_withPointsKSP" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2899 `__: " -"pgr_maxCardinalityMatch" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2899 `__: pgr_maxCardinalityMatch" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy msgid "`#2901 `__: pgr_TSP" -msgstr "" -"`#2683 `__: pgr_trsp" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2901 `__: " -"pgr_TSPeuclidean" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2901 `__: pgr_TSPeuclidean" +msgstr "`#2683 `__: pgr_trsp" msgid "Removal of SQL deprecated functions" msgstr "移除已弃用的SQL函数" #, fuzzy -msgid "" -"`#2681 `__: " -"pgr_trspViaedges" -msgstr "" -"`#2681 `__: " -"pgr_trspviaedges" +msgid "`#2681 `__: pgr_trspViaedges" +msgstr "`#2681 `__: pgr_trspviaedges" #, fuzzy -msgid "" -"`#2682 `__: " -"pgr_trspViaVertices" -msgstr "" -"`#2682 `__: " -"pgr_trspviavertices" +msgid "`#2682 `__: pgr_trspViaVertices" +msgstr "`#2682 `__: pgr_trspviavertices" -msgid "" -"`#2748 `__: " -"pgr_alphaShape" -msgstr "" -"`#2748 `__: " -"pgr_alphaShape" +msgid "`#2748 `__: pgr_alphaShape" +msgstr "`#2748 `__: pgr_alphaShape" #, fuzzy -msgid "" -"`#2751 `__: " -"pgr_createTopology" -msgstr "" -"`#2751 `__: " -"pgr_createTopology" +msgid "`#2751 `__: pgr_createTopology" +msgstr "`#2751 `__: pgr_createTopology" -msgid "" -"`#2752 `__: " -"pgr_analyzeGraph" -msgstr "" -"`#2752 `__: " -"pgr_analyzeGraph" +msgid "`#2752 `__: pgr_analyzeGraph" +msgstr "`#2752 `__: pgr_analyzeGraph" -msgid "" -"`#2755 `__: " -"pgr_analyzeOneWay" -msgstr "" -"`#2755 `__: " -"pgr_analyzeOneWay" +msgid "`#2755 `__: pgr_analyzeOneWay" +msgstr "`#2755 `__: pgr_analyzeOneWay" -msgid "" -"`#2827 `__: " -"pgr_createVerticesTable" -msgstr "" -"`#2827 `__: " -"pgr_createVerticesTable" +msgid "`#2827 `__: pgr_createVerticesTable" +msgstr "`#2827 `__: pgr_createVerticesTable" #, fuzzy -msgid "" -"`#2886 `__: " -"pgr_nodeNetwork" -msgstr "" -"`#2850 `__:重写 " -"pgr_nodeNetwork" +msgid "`#2886 `__: pgr_nodeNetwork" +msgstr "`#2850 `__:重写 pgr_nodeNetwork" #, fuzzy msgid "Removal of SQL deprecated internal functions" msgstr "移除已弃用的SQL内部函数" #, fuzzy -msgid "" -"`#2748 `__ " -"_pgr_alphaShape(text,double precision)" -msgstr "" -"`#2748 `__: " -"pgr_alphaShape" +msgid "`#2748 `__ _pgr_alphaShape(text,double precision)" +msgstr "`#2748 `__: pgr_alphaShape" #, fuzzy -msgid "" -"`#2861 `__ " -"_pgr_checkVertTab(text,text[],integer,text)" -msgstr "" -"`#2827 `__: " -"pgr_createVerticesTable" +msgid "`#2861 `__ _pgr_checkVertTab(text,text[],integer,text)" +msgstr "`#2827 `__: pgr_createVerticesTable" #, fuzzy -msgid "" -"`#2861 `__ " -"_pgr_createIndex(text,text,text,integer,text)" -msgstr "" -"`#2786 `__:" -"pgr_contraction(edges) 新签名" +msgid "`#2861 `__ _pgr_createIndex(text,text,text,integer,text)" +msgstr "`#2786 `__:pgr_contraction(edges) 新签名" #, fuzzy -msgid "" -"`#2861 `__ " -"_pgr_createIndex(text,text,text,text,integer,text)" -msgstr "" -"`#2786 `__:" -"pgr_contraction(edges) 新签名" +msgid "`#2861 `__ _pgr_createIndex(text,text,text,text,integer,text)" +msgstr "`#2786 `__:pgr_contraction(edges) 新签名" #, fuzzy -msgid "" -"`#2913 `__ " -"_pgr_dagShortestPath(text,anyarray,anyarray,boolean,boolean)" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2913 `__ _pgr_dagShortestPath(text,anyarray,anyarray,boolean,boolean)" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2913 `__ " -"_pgr_dagShortestPath(text,text,boolean,boolean)" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2913 `__ _pgr_dagShortestPath(text,text,boolean,boolean)" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2730 `__ " -"_pgr_dijkstraNear(text,anyarray,anyarray,bigint,boolean)" -msgstr "" -"`#2798 `__: " -"pgr_contraction" +msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,anyarray,bigint,boolean)" +msgstr "`#2798 `__: pgr_contraction" #, fuzzy -msgid "" -"`#2730 `__ " -"_pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)" -msgstr "" -"`#2798 `__: " -"pgr_contraction" +msgid "`#2730 `__ _pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)" +msgstr "`#2798 `__: pgr_contraction" #, fuzzy -msgid "" -"`#2730 `__ " -"_pgr_dijkstraNear(text,bigint,anyarray,bigint,boolean)" -msgstr "" -"`#2798 `__: " -"pgr_contraction" +msgid "`#2730 `__ _pgr_dijkstraNear(text,bigint,anyarray,bigint,boolean)" +msgstr "`#2798 `__: pgr_contraction" #, fuzzy -msgid "" -"`#2730 `__ " -"_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" +msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" msgstr "_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" #, fuzzy -msgid "" -"`#2730 `__ " -"_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" +msgid "`#2730 `__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)" msgstr "_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" #, fuzzy -msgid "" -"`#2730 `__ " -"_pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" -msgstr "" -"`#2798 `__: " -"pgr_contraction" +msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)" +msgstr "`#2798 `__: pgr_contraction" #, fuzzy -msgid "" -"`#2730 `__ " -"_pgr_dijkstra(text,text,boolean,boolean,boolean)" -msgstr "" -"`#2798 `__: " -"pgr_contraction" +msgid "`#2730 `__ _pgr_dijkstra(text,text,boolean,boolean,boolean)" +msgstr "`#2798 `__: pgr_contraction" #, fuzzy -msgid "" -"`#2735 `__ " -"_pgr_drivingDistance(text,anyarray,double precision,boolean,boolean)" +msgid "`#2735 `__ _pgr_drivingDistance(text,anyarray,double precision,boolean,boolean)" msgstr "_pgr_drivingdistance(text,anyarray,double precision,boolean,boolean)" #, fuzzy -msgid "" -"`#2861 `__ " -"_pgr_endPoint(geometry)" -msgstr "" -"`#2850 `__:重写 " -"pgr_nodeNetwork" +msgid "`#2861 `__ _pgr_endPoint(geometry)" +msgstr "`#2850 `__:重写 pgr_nodeNetwork" #, fuzzy -msgid "" -"`#2861 `__ " -"__pgr_getColumnName(text,text,integer,text)" -msgstr "" -"`#2850 `__:重写 " -"pgr_nodeNetwork" +msgid "`#2861 `__ __pgr_getColumnName(text,text,integer,text)" +msgstr "`#2850 `__:重写 pgr_nodeNetwork" #, fuzzy -msgid "" -"`#2861 `__ " -"__pgr_getColumnName(text,text,text,integer,text)" -msgstr "" -"`#2786 `__:" -"pgr_contraction(edges) 新签名" +msgid "`#2861 `__ __pgr_getColumnName(text,text,text,integer,text)" +msgstr "`#2786 `__:pgr_contraction(edges) 新签名" #, fuzzy -msgid "" -"`#2861 `__ " -"__pgr_getColumnType(text,text,integer,text)" -msgstr "" -"`#2681 `__: " -"pgr_trspviaedges" +msgid "`#2861 `__ __pgr_getColumnType(text,text,integer,text)" +msgstr "`#2681 `__: pgr_trspviaedges" #, fuzzy -msgid "" -"`#2861 `__ " -"__pgr_getColumnType(text,text,text,integer,text)" -msgstr "" -"`#2681 `__: " -"pgr_trspviaedges" +msgid "`#2861 `__ __pgr_getColumnType(text,text,text,integer,text)" +msgstr "`#2681 `__: pgr_trspviaedges" #, fuzzy -msgid "" -"`#2861 `__ " -"__pgr_getTableName(text,integer,text)" -msgstr "" -"`#2850 `__:重写 " -"pgr_nodeNetwork" +msgid "`#2861 `__ __pgr_getTableName(text,integer,text)" +msgstr "`#2850 `__:重写 pgr_nodeNetwork" #, fuzzy -msgid "" -"`#2861 `__ " -"_pgr_isColumnIndexed(text,text,integer,text)" -msgstr "" -"`#2850 `__:重写 " -"pgr_nodeNetwork" +msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,integer,text)" +msgstr "`#2850 `__:重写 pgr_nodeNetwork" #, fuzzy -msgid "" -"`#2861 `__ " -"_pgr_isColumnIndexed(text,text,text,integer,text)" -msgstr "" -"`#2786 `__:" -"pgr_contraction(edges) 新签名" +msgid "`#2861 `__ _pgr_isColumnIndexed(text,text,text,integer,text)" +msgstr "`#2786 `__:pgr_contraction(edges) 新签名" #, fuzzy -msgid "" -"`#2861 `__ " -"_pgr_isColumnIntable(text,text)" -msgstr "" -"`#2681 `__: " -"pgr_trspviaedges" +msgid "`#2861 `__ _pgr_isColumnIntable(text,text)" +msgstr "`#2681 `__: pgr_trspviaedges" #, fuzzy -msgid "" -"`#2745 `__ " -"_pgr_kruskal(text,anyarray,text,bigint,double precision)" -msgstr "" -"`#2087 `__: " -"pgr_extractVertices 变为提议状态" +msgid "`#2745 `__ _pgr_kruskal(text,anyarray,text,bigint,double precision)" +msgstr "`#2087 `__: pgr_extractVertices 变为提议状态" #, fuzzy -msgid "" -"`#2897 `__ _pgr_ksp(text," -"anyarray,anyarray,integer,boolean,boolean,boolean)" +msgid "`#2897 `__ _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean)" msgstr "_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" #, fuzzy -msgid "" -"`#2897 `__ _pgr_ksp(text," -"bigint,bigint,integer,boolean,boolean)" -msgstr "" -"`#2827 `__: " -"pgr_createVerticesTable" +msgid "`#2897 `__ _pgr_ksp(text,bigint,bigint,integer,boolean,boolean)" +msgstr "`#2827 `__: pgr_createVerticesTable" #, fuzzy -msgid "" -"`#2897 `__ _pgr_ksp(text," -"text,integer,boolean,boolean)" -msgstr "" -"`#2827 `__: " -"pgr_createVerticesTable" +msgid "`#2897 `__ _pgr_ksp(text,text,integer,boolean,boolean)" +msgstr "`#2827 `__: pgr_createVerticesTable" #, fuzzy -msgid "" -"`#2899 `__ " -"_pgr_maxCardinalityMatch(text,boolean)" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2899 `__ _pgr_maxCardinalityMatch(text,boolean)" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2861 `__ " -"_pgr_msg(integer,text,text)" -msgstr "" -"`#2681 `__: " -"pgr_trspviaedges" +msgid "`#2861 `__ _pgr_msg(integer,text,text)" +msgstr "`#2681 `__: pgr_trspviaedges" #, fuzzy -msgid "" -"`#2861 `__ " -"_pgr_onerror(boolean,integer,text,text,text,text)" -msgstr "" -"`#2827 `__: " -"pgr_createVerticesTable" +msgid "`#2861 `__ _pgr_onerror(boolean,integer,text,text,text,text)" +msgstr "`#2827 `__: pgr_createVerticesTable" #, fuzzy -msgid "" -"`#2861 `__ " -"_pgr_pointtoid(geometry,double precision,text,integer)" -msgstr "" -"`#2786 `__:" -"pgr_contraction(edges) 新签名" +msgid "`#2861 `__ _pgr_pointtoid(geometry,double precision,text,integer)" +msgstr "`#2786 `__:pgr_contraction(edges) 新签名" #, fuzzy -msgid "" -"`#2743 `__ " -"_pgr_prim(text,anyarray,text,bigint,double precision)" -msgstr "" -"`#2087 `__: " -"pgr_extractVertices 变为提议状态" +msgid "`#2743 `__ _pgr_prim(text,anyarray,text,bigint,double precision)" +msgstr "`#2087 `__: pgr_extractVertices 变为提议状态" #, fuzzy -msgid "" -"`#2861 `__ " -"_pgr_quote_ident(text)" -msgstr "" -"`#2850 `__:重写 " -"pgr_nodeNetwork" +msgid "`#2861 `__ _pgr_quote_ident(text)" +msgstr "`#2850 `__:重写 pgr_nodeNetwork" #, fuzzy -msgid "" -"`#2861 `__ " -"_pgr_startPoint(geometry)" -msgstr "" -"`#2681 `__: " -"pgr_trspviaedges" +msgid "`#2861 `__ _pgr_startPoint(geometry)" +msgstr "`#2681 `__: pgr_trspviaedges" #, fuzzy -msgid "" -"`#2683 `__ " -"_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 "`#2683 `__ _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)" #, fuzzy -msgid "" -"`#2683 `__ " -"_pgr_trsp(text,text,anyarray,anyarray,boolean)" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,anyarray,boolean)" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2683 `__ " -"_pgr_trsp(text,text,anyarray,bigint,boolean)" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2683 `__ _pgr_trsp(text,text,anyarray,bigint,boolean)" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2683 `__ " -"_pgr_trsp(text,text,bigint,anyarray,boolean)" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2683 `__ _pgr_trsp(text,text,bigint,anyarray,boolean)" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2683 `__ " -"_pgr_trsp(text,text,bigint,bigint,boolean)" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2683 `__ _pgr_trsp(text,text,bigint,bigint,boolean)" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2682 `__ " -"_pgr_trspViaVertices(text,integer[],boolean,boolean,text)" -msgstr "" -"`#2682 `__: " -"pgr_trspviavertices" +msgid "`#2682 `__ _pgr_trspViaVertices(text,integer[],boolean,boolean,text)" +msgstr "`#2682 `__: pgr_trspviavertices" #, fuzzy -msgid "" -"`#2919 `__ " -"_pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean," -"character,boolean)" -msgstr "" -"pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," -"boolean)``" +msgid "`#2919 `__ _pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" #, fuzzy -msgid "" -"`#2919 `__ " -"_pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character," -"boolean)" -msgstr "" -"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" +msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" #, fuzzy -msgid "" -"`#2919 `__ " -"_pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2919 `__ _pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2901 `__ " -"_pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer," -"integer,double precision,double precision,double precision,boolean)" -msgstr "" -"_pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean,text)" +msgid "`#2901 `__ _pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgstr "_pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" #, fuzzy -msgid "" -"`#2901 `__ _pgr_tsp(text," -"bigint,bigint,double precision,integer,integer,integer,double precision," -"double precision,double precision,boolean)" -msgstr "" -"_pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean,text)" +msgid "`#2901 `__ _pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgstr "_pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" #, fuzzy -msgid "" -"`#2861 `__ " -"_pgr_versionLess(text,text)" -msgstr "" -"`#2681 `__: " -"pgr_trspviaedges" +msgid "`#2861 `__ _pgr_versionLess(text,text)" +msgstr "`#2681 `__: pgr_trspviaedges" #, fuzzy -msgid "" -"`#2890 `__ " -"_pgr_withPointsDD(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" -msgstr "" -"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" +msgid "`#2890 `__ _pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" #, fuzzy -msgid "" -"`#2895 `__ " -"_pgr_withPointsKSP(text,text,anyarray,anyarray,integer,character,boolean," -"boolean,boolean,boolean)" -msgstr "" -"pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," -"boolean)``" +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean)" +msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" #, fuzzy -msgid "" -"`#2895 `__ " -"_pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character," -"boolean)" -msgstr "" -"pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," -"boolean)``" +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" #, fuzzy -msgid "" -"`#2895 `__ " -"_pgr_withPointsKSP(text,text,text,integer,character,boolean,boolean,boolean)" -msgstr "" -"pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," -"boolean)``" +msgid "`#2895 `__ _pgr_withPointsKSP(text,text,text,integer,character,boolean,boolean,boolean)" +msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" #, fuzzy -msgid "" -"`#2741 `__ " -"_pgr_withPointsVia(text,bigint[],double precision[],boolean)" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2741 `__ _pgr_withPointsVia(text,bigint[],double precision[],boolean)" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2741 `__ " -"_pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character," -"boolean)" -msgstr "" -"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" +msgid "`#2741 `__ _pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" #, fuzzy -msgid "" -"`#2683 `__ _trsp(text," -"text,anyarray,anyarray,boolean)" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2683 `__ _trsp(text,text,anyarray,anyarray,boolean)" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2683 `__ _v4trsp(text," -"text,anyarray,anyarray,boolean)" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2683 `__ _v4trsp(text,text,anyarray,anyarray,boolean)" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2683 `__ _v4trsp(text," -"text,text,boolean)" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2683 `__ _v4trsp(text,text,text,boolean)" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy msgid "Summary of functions and signatures no longer on pgrouting" msgstr "为 pgRouting 添加功能" #, fuzzy -msgid "" -"`#2748 `__ " -"pgr_alphashape(geometry,double precision)" -msgstr "" -"`#2748 `__: " -"pgr_alphaShape" +msgid "`#2748 `__ pgr_alphashape(geometry,double precision)" +msgstr "`#2748 `__: pgr_alphaShape" #, fuzzy -msgid "" -"`#2752 `__ " -"pgr_analyzegraph(text,double precision,text,text,text,text,text)" -msgstr "" -"`#2752 `__: " -"pgr_analyzeGraph" +msgid "`#2752 `__ pgr_analyzegraph(text,double precision,text,text,text,text,text)" +msgstr "`#2752 `__: pgr_analyzeGraph" #, fuzzy -msgid "" -"`#2755 `__ " -"pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)" +msgid "`#2755 `__ pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)" msgstr "_pgr_createindex(text,text,text,text,integer,text)" #, fuzzy -msgid "" -"`#2798 `__ " -"pgr_contraction(text,bigint[],integer,bigint[],boolean)" -msgstr "" -"`#2798 `__: " -"pgr_contraction" +msgid "`#2798 `__ pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgstr "`#2798 `__: pgr_contraction" #, fuzzy -msgid "" -"`#2751 `__ " -"pgr_createtopology(text,double precision,text,text,text,text,text,boolean)" +msgid "`#2751 `__ pgr_createtopology(text,double precision,text,text,text,text,text,boolean)" msgstr "_pgr_createindex(text,text,text,text,integer,text)" #, fuzzy -msgid "" -"`#2827 `__ " -"pgr_createverticestable(text,text,text,text,text)" -msgstr "" -"`#2827 `__: " -"pgr_createVerticesTable" +msgid "`#2827 `__ pgr_createverticestable(text,text,text,text,text)" +msgstr "`#2827 `__: pgr_createVerticesTable" #, fuzzy -msgid "" -"`#2888 `__ " -"pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" -msgstr "" -"pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +msgid "`#2888 `__ pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)" +msgstr "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" #, fuzzy -msgid "" -"`#2888 `__ " -"pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" -msgstr "" -"pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +msgid "`#2888 `__ pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)" +msgstr "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" #, fuzzy -msgid "" -"`#2899 `__ " -"pgr_maxCardinalityMatch(text,boolean)" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2899 `__ pgr_maxCardinalityMatch(text,boolean)" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2886 `__ " -"pgr_nodenetwork(text,double precision,text,text,text,text,boolean)" -msgstr "" -"`#2850 `__:重写 " -"pgr_nodeNetwork" +msgid "`#2886 `__ pgr_nodenetwork(text,double precision,text,text,text,text,boolean)" +msgstr "`#2850 `__:重写 pgr_nodeNetwork" #, fuzzy -msgid "" -"`#2683 `__ 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 "`#2683 `__ 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)" #, fuzzy -msgid "" -"`#2683 `__ pgr_trsp(text," -"integer,integer,boolean,boolean,text)" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2683 `__ pgr_trsp(text,integer,integer,boolean,boolean,text)" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2681 `__ " -"pgr_trspViaedges(text,integer[],double precision[],boolean,boolean,text)" -msgstr "" -"`#2681 `__: " -"pgr_trspviaedges" +msgid "`#2681 `__ pgr_trspViaedges(text,integer[],double precision[],boolean,boolean,text)" +msgstr "`#2681 `__: pgr_trspviaedges" #, fuzzy -msgid "" -"`#2682 `__ " -"pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" -msgstr "" -"`#2682 `__: " -"pgr_trspviavertices" +msgid "`#2682 `__ pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" +msgstr "`#2682 `__: pgr_trspviavertices" #, fuzzy -msgid "" -"`#2919 `__ " -"pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean," -"character,boolean)" -msgstr "" -"pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," -"boolean)``" +msgid "`#2919 `__ pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" #, fuzzy -msgid "" -"`#2919 `__ " -"pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character," -"boolean)" -msgstr "" -"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" #, fuzzy -msgid "" -"`#2919 `__ " -"pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)" -msgstr "" -"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" #, fuzzy -msgid "" -"`#2919 `__ " -"pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)" -msgstr "" -"pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," -"boolean)``" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" #, fuzzy -msgid "" -"`#2919 `__ " -"pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)" -msgstr "" -"pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" #, fuzzy -msgid "" -"`#2919 `__ " -"pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2919 `__ pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2901 `__ " -"pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer," -"double precision,double precision,double precision,boolean)" -msgstr "" -"_pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean,text)" +msgid "`#2901 `__ pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgstr "_pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" #, fuzzy -msgid "" -"`#2901 `__ pgr_tsp(text," -"bigint,bigint,double precision,integer,integer,integer,double precision," -"double precision,double precision,boolean)" -msgstr "" -"_pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean,text)" +msgid "`#2901 `__ pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +msgstr "_pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" #, fuzzy -msgid "" -"`#2919 `__ " -"pgr_withPointsCostMatrix(text,text,anyarray,boolean,character)" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2919 `__ pgr_withPointsCostMatrix(text,text,anyarray,boolean,character)" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,anyarray,anyarray,boolean,character)" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,anyarray,boolean,character)" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,anyarray,bigint,boolean,character)" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2919 `__ pgr_withPointsCost(text,text,anyarray,bigint,boolean,character)" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,bigint,anyarray,boolean,character)" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,anyarray,boolean,character)" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,bigint,bigint,boolean,character)" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2919 `__ pgr_withPointsCost(text,text,bigint,bigint,boolean,character)" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2919 `__ " -"pgr_withPointsCost(text,text,text,boolean,character)" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2919 `__ pgr_withPointsCost(text,text,text,boolean,character)" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2890 `__ " -"pgr_withPointsDD(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" -msgstr "" -"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" +msgid "`#2890 `__ pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" #, fuzzy -msgid "" -"`#2890 `__ " -"pgr_withPointsDD(text,text,bigint,double precision,boolean,character,boolean)" -msgstr "" -"pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgid "`#2890 `__ pgr_withPointsDD(text,text,bigint,double precision,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" #, fuzzy -msgid "" -"`#2895 `__ " -"pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character," -"boolean)" -msgstr "" -"pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," -"boolean)``" +msgid "`#2895 `__ pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" #, fuzzy -msgid "" -"`#2919 `__ " -"pgr_withPoints(text,text,anyarray,anyarray,boolean,character,boolean)" -msgstr "" -"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" +msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,anyarray,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" #, fuzzy -msgid "" -"`#2919 `__ " -"pgr_withPoints(text,text,anyarray,bigint,boolean,character,boolean)" -msgstr "" -"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" +msgid "`#2919 `__ pgr_withPoints(text,text,anyarray,bigint,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" #, fuzzy -msgid "" -"`#2919 `__ " -"pgr_withPoints(text,text,bigint,anyarray,boolean,character,boolean)" -msgstr "" -"pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgid "`#2919 `__ pgr_withPoints(text,text,bigint,anyarray,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" #, fuzzy -msgid "" -"`#2919 `__ " -"pgr_withPoints(text,text,bigint,bigint,boolean,character,boolean)" -msgstr "" -"pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +msgid "`#2919 `__ pgr_withPoints(text,text,bigint,bigint,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" #, fuzzy -msgid "" -"`#2919 `__ " -"pgr_withPoints(text,text,text,boolean,character,boolean)" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2919 `__ pgr_withPoints(text,text,text,boolean,character,boolean)" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2919 `__ " -"pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character," -"boolean)" -msgstr "" -"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)" +msgid "`#2919 `__ pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" #, fuzzy msgid "Code enhancements" @@ -5907,28 +4758,19 @@ msgstr "遗留代码中内部 C/C++ 函数" #, fuzzy msgid "`#2683 `__ _trsp" -msgstr "" -"`#2683 `__: pgr_trsp" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy msgid "`#2683 `__ _v4trsp" -msgstr "" -"`#2683 `__: pgr_trsp" +msgstr "`#2683 `__: pgr_trsp" #, fuzzy -msgid "" -"`#2748 `__ " -"_pgr_alphaShape" -msgstr "" -"`#2748 `__: " -"pgr_alphaShape" +msgid "`#2748 `__ _pgr_alphaShape" +msgstr "`#2748 `__: pgr_alphaShape" #, fuzzy -msgid "" -"`#2913 `__ " -"_pgr_dagShortestPath" -msgstr "" -"`#2683 `__: pgr_trsp" +msgid "`#2913 `__ _pgr_dagShortestPath" +msgstr "`#2683 `__: pgr_trsp" msgid "All releases" msgstr "所有版本" @@ -5936,13 +4778,8 @@ msgstr "所有版本" msgid "Kruskal - Family of functions" msgstr "Kruskal - 函数族" -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 "Kruskal's algorithm is a greedy minimum spanning tree algorithm that in each cycle finds and adds the edge of the least possible weight that connects any two trees in the forest." +msgstr "克鲁斯卡尔算法是一种贪婪的最小生成树算法，它在每个循环中查找并添加连接森林中任意两棵树的最小可能权重的边。" msgid "**The main Characteristics are:**" msgstr "**主要特点是：**" @@ -5959,9 +4796,7 @@ msgstr "Metrics - 功能系列" msgid "Migration guide" msgstr "迁移指南" -msgid "" -"Several functions are having changes on the signatures, and/or have been " -"replaced by new functions." +msgid "Several functions are having changes on the signatures, and/or have been replaced by new functions." msgstr "多个函数的签名发生了变化，和/或已被新函数取代。" msgid "Results can be different because of the changes." @@ -5974,9 +4809,7 @@ msgstr "所有已弃用函数将在下一个主版本 4.0.0 中被移除" msgid "Migration to standardized columns" msgstr "限制迁移" -msgid "" -"There has been an effort to standardize function output columns names and " -"types." +msgid "There has been an effort to standardize function output columns names and types." msgstr "" #, fuzzy @@ -6083,14 +4916,10 @@ msgstr "`迁移限制`_" msgid "Migration of cost functions" msgstr "限制迁移" -msgid "" -"The standardized :ref:`pgRouting-concepts:Result columns for cost functions` " -"are |matrix-result|" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for cost functions` are |matrix-result|" msgstr "" -msgid "" -"The following functions need to be migrated when they are being used in an " -"application." +msgid "The following functions need to be migrated when they are being used in an application." msgstr "" #, fuzzy @@ -6143,18 +4972,14 @@ msgstr "组合" msgid "Breaking change" msgstr "重大变更：" -msgid "" -"If using ``pgr_withPointsCost``: column names must be changed after updating " -"pgRouting" +msgid "If using ``pgr_withPointsCost``: column names must be changed after updating pgRouting" msgstr "" #, fuzzy msgid "New output columns are |matrix-result|" msgstr "输出列是 |ksp-result|" -msgid "" -"To get the old version column names: rename ``start_vid`` to ``start_pid`` " -"and ``end_vid`` to ``end_pid``." +msgid "To get the old version column names: rename ``start_vid`` to ``start_pid`` and ``end_vid`` to ``end_pid``." msgstr "" msgid "Examples" @@ -6169,12 +4994,8 @@ msgid "Using ``pgr_withPointsCost``" msgstr "``pgr_withPointsCost``" #, fuzzy -msgid "" -"Migrating `this v3.8 `__ example." -msgstr "" -"使用 `这个 `__ 示例。" +msgid "Migrating `this v3.8 `__ example." +msgstr "使用 `这个 `__ 示例。" msgid "from" msgstr "从" @@ -6187,57 +5008,39 @@ msgid "Examples for One to Many for cost functions" msgstr "成本函数结果列" #, fuzzy -msgid "" -"Migrating `this v3.8 `__ example." -msgstr "" -"使用 `这个 `__ 示例。" +msgid "Migrating `this v3.8 `__ example." +msgstr "使用 `这个 `__ 示例。" #, fuzzy msgid "Examples for Many to One for cost functions" msgstr "成本函数结果列" #, fuzzy -msgid "" -"Migrating `this v3.8 `__ example." -msgstr "" -"使用 `这个 `__ 示例。" +msgid "Migrating `this v3.8 `__ example." +msgstr "使用 `这个 `__ 示例。" #, fuzzy msgid "Examples for Many to Many for cost functions" msgstr "成本函数结果列" #, fuzzy -msgid "" -"Migrating `this v3.8 `__ example." -msgstr "" -"使用 `这个 `__ 示例。" +msgid "Migrating `this v3.8 `__ example." +msgstr "使用 `这个 `__ 示例。" #, fuzzy msgid "Examples for Combinations for cost functions" msgstr "成本函数结果列" #, fuzzy -msgid "" -"Migrating `this v3.8 `__ example." -msgstr "" -"使用 `这个 `__ 示例。" +msgid "Migrating `this v3.8 `__ example." +msgstr "使用 `这个 `__ 示例。" #, fuzzy msgid "Migration of multiple paths functions" msgstr "限制迁移" #, fuzzy -msgid "" -"The standardized :ref:`pgRouting-concepts:Result columns for single path " -"functions` are |nksp-result|" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |nksp-result|" msgstr "将输出列标准化为 |short-generic-result|" msgid "``pgr_KSP``" @@ -6271,12 +5074,8 @@ msgstr "结果列的重大变化" msgid "One to One example using ``pgr_KSP``" msgstr "" -msgid "" -"Using `this `__ " -"example." -msgstr "" -"使用 `这个 `__ 示" -"例。" +msgid "Using `this `__ example." +msgstr "使用 `这个 `__ 示例。" #, fuzzy msgid "Migration of |result-disjoint|" @@ -6297,13 +5096,9 @@ msgstr "然后按 ``end_vid``" msgid "One to One example using ``pgr_edgeDisjointPaths``" msgstr "``pgr_edgeDisjointPaths``" -#, fuzzy -msgid "" -"Migrating `this v3.8 `__ example." -msgstr "" -"使用 `这个 `__ 示例。" +#, fuzzy +msgid "Migrating `this v3.8 `__ example." +msgstr "使用 `这个 `__ 示例。" #, fuzzy msgid "Before updating pgRouting enumerate the columns: |ksp-result|" @@ -6314,9 +5109,7 @@ msgid "Migration of single path functions" msgstr "限制迁移" #, fuzzy -msgid "" -"The standardized :ref:`pgRouting-concepts:Result columns for single path " -"functions` are |short-generic-result|" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |short-generic-result|" msgstr "将输出列标准化为 |short-generic-result|" msgid "``pgr_dijkstra``" @@ -6362,9 +5155,7 @@ msgstr "|ksp-result|" msgid "Migration of |old-generic-result|" msgstr "返回 |old-generic-result| 的集合" -msgid "" -"Before updating pgRouting, enumerate the corresponding columns of the " -"signature" +msgid "Before updating pgRouting, enumerate the corresponding columns of the signature" msgstr "" #, fuzzy @@ -6390,9 +5181,7 @@ msgstr "从 ``start_vid`` 到 ``end_vid`` 的总成本。" msgid "``end_vid`` to ``end_pid``" msgstr "``end_vid`` 升序" -msgid "" -"If using ``pgr_withPoints``: column names must be changed after updating " -"pgRouting" +msgid "If using ``pgr_withPoints``: column names must be changed after updating pgRouting" msgstr "" #, fuzzy @@ -6416,12 +5205,8 @@ msgid "Using ``pgr_aStar``" msgstr "``pgr_aStar``" #, fuzzy -msgid "" -"Migrating `this v3.5 `__ example." -msgstr "" -"使用 `这个 `__ 示例。" +msgid "Migrating `this v3.5 `__ example." +msgstr "使用 `这个 `__ 示例。" msgid "Before updating pgRouting enumerate the columns: |result-1-1|" msgstr "" @@ -6431,24 +5216,16 @@ msgid "Using ``pgr_bdDijkstra``" msgstr "``pgr_bdDijkstra``" #, fuzzy -msgid "" -"Migrating `this v3.8 `__ example." -msgstr "" -"使用 `这个 `__ 示例。" +msgid "Migrating `this v3.8 `__ example." +msgstr "使用 `这个 `__ 示例。" #, fuzzy msgid "Using ``pgr_DAGshortestPath``" msgstr "``pgr_bdAstar``" #, fuzzy -msgid "" -"Migrating `this v3.8 `__ example." -msgstr "" -"使用 `这个 `__ 示例。" +msgid "Migrating `this v3.8 `__ example." +msgstr "使用 `这个 `__ 示例。" msgid "This applies to all signatures of ``pgr_DAGshortestPath``" msgstr "" @@ -6462,12 +5239,8 @@ msgid "Using ``pgr_bdAstar``" msgstr "``pgr_bdAstar``" #, fuzzy -msgid "" -"Migrating `this v3.5 `__ example." -msgstr "" -"使用 `这个 `__ 示例。" +msgid "Migrating `this v3.5 `__ example." +msgstr "使用 `这个 `__ 示例。" msgid "Before updating pgRouting enumerate the columns: |result-1-m|" msgstr "" @@ -6477,20 +5250,14 @@ msgid "Using ``pgr_withPoints``" msgstr "使用 :doc:`pgr_withPoints`" #, fuzzy -msgid "" -"Migrating `this v3.8 `__ example." -msgstr "" -"使用 `这个 `__ 示例。" +msgid "Migrating `this v3.8 `__ example." +msgstr "使用 `这个 `__ 示例。" msgid "|pid-1-m|" msgstr "" #, fuzzy -msgid "" -"To get the old signature column names: filter out the column ``start_vid`` " -"and rename ``end_vid`` to ``end_pid``." +msgid "To get the old signature column names: filter out the column ``start_vid`` and rename ``end_vid`` to ``end_pid``." msgstr "``start_vid`` 和 ``end_vid`` 列不存在。" #, fuzzy @@ -6498,12 +5265,8 @@ msgid "Examples for Many to One with one route result" msgstr "使用示例（无结果输出）" #, fuzzy -msgid "" -"Migrating `this v3.8 `__ example." -msgstr "" -"使用 `这个 `__ 示例。" +msgid "Migrating `this v3.8 `__ example." +msgstr "使用 `这个 `__ 示例。" msgid "Before updating pgRouting enumerate the columns: |result-m-1|" msgstr "" @@ -6513,23 +5276,15 @@ msgid "Using ``pgr_dijkstra``" msgstr "``pgr_dijkstra``" #, fuzzy -msgid "" -"Migrating `this v3.4 `__ example." -msgstr "" -"使用 `这个 `__ 示例。" +msgid "Migrating `this v3.4 `__ example." +msgstr "使用 `这个 `__ 示例。" msgid "Examples for Many to Many with one route result" msgstr "" #, fuzzy -msgid "" -"Migrating `this v3.8 `__ example." -msgstr "" -"使用 `这个 `__ 示例。" +msgid "Migrating `this v3.8 `__ example." +msgstr "使用 `这个 `__ 示例。" msgid "|pid-m-m|" msgstr "" @@ -6538,20 +5293,14 @@ msgid "Examples for combinations with one route result" msgstr "" #, fuzzy -msgid "" -"Migrating `this v3.8 `this `__ example." -msgstr "" -"使用 `这个 `__ 示例。" +msgid "Migrating `this v3.8 `this `__ example." +msgstr "使用 `这个 `__ 示例。" #, fuzzy msgid "Migration of spanning tree functions" msgstr "生成树函数的结果列" -msgid "" -"The standardized :ref:`pgRouting-concepts:Result columns for spanning tree " -"functions` are |result-spantree|" +msgid "The standardized :ref:`pgRouting-concepts:Result columns for spanning tree functions` are |result-spantree|" msgstr "" msgid "``pgr_drivingDistance``" @@ -6624,12 +5373,8 @@ msgid "Single vertex example using ``pgr_kruskalDD``" msgstr "``pgr_kruskalDD``" #, fuzzy -msgid "" -"Migrating `this v3.6 `__ example." -msgstr "" -"与 `this `__ 示例比较。" +msgid "Migrating `this v3.6 `__ example." +msgstr "与 `this `__ 示例比较。" msgid "Before updating pgRouting enumerate the columns: |result-bfs|." msgstr "" @@ -6639,12 +5384,8 @@ msgid "Multiple vertices example using ``pgr_kruskalDFS``" msgstr "``pgr_kruskalDFS``" #, fuzzy -msgid "" -"Migrating `this v3.6 `__ example." -msgstr "" -"与 `this `__ 示例比较。" +msgid "Migrating `this v3.6 `__ example." +msgstr "与 `this `__ 示例比较。" #, fuzzy msgid "Migration from |result-dij-dd|" @@ -6685,12 +5426,8 @@ msgid "Single vertex example using ``pgr_drivingDistance``" msgstr "``pgr_drivingDistance``" #, fuzzy -msgid "" -"Migrating `this v3.5 `__ example." -msgstr "" -"使用 `这个 `__ 示例。" +msgid "Migrating `this v3.5 `__ example." +msgstr "使用 `这个 `__ 示例。" #, fuzzy msgid "Before updating pgRouting, enumerate |result-1-1-no-seq| columns" @@ -6701,16 +5438,10 @@ msgid "Multiple vertices example using ``pgr_drivingDistance``" msgstr "``pgr_drivingDistance``" #, fuzzy -msgid "" -"Migrating `this v3.5 `__ example." -msgstr "" -"使用 `这个 `__ 示例。" +msgid "Migrating `this v3.5 `__ example." +msgstr "使用 `这个 `__ 示例。" -msgid "" -"To get the old version column names |result-dij-dd-m|: filter out the column " -"``pred`` and ``depth`` and rename ``start_vid`` to ``from_v``." +msgid "To get the old version column names |result-dij-dd-m|: filter out the column ``pred`` and ``depth`` and rename ``start_vid`` to ``from_v``." msgstr "" #, fuzzy @@ -6725,12 +5456,8 @@ msgid "Enumerate |result-1-1-no-seq| columns" msgstr "输出列为 |result-1-1-no-seq|" #, fuzzy -msgid "" -"Use an unnamed valid value for **driving side** after the **distance** " -"parameter." -msgstr "" -"要进行迁移，请在 **distance** 参数之后使用一个未命名的有效值作为 **行驶方向" -"** ：" +msgid "Use an unnamed valid value for **driving side** after the **distance** parameter." +msgstr "要进行迁移，请在 **distance** 参数之后使用一个未命名的有效值作为 **行驶方向** ：" #, fuzzy msgid "Enumerate |result-m-1-no-seq| columns" @@ -6741,9 +5468,7 @@ msgid "Default value of **driving side** parameter" msgstr "右驾驶侧" #, fuzzy -msgid "" -"**driving side** parameter is unnamed, and valid values differ for directed " -"and undirected graphs." +msgid "**driving side** parameter is unnamed, and valid values differ for directed and undirected graphs." msgstr "**driving side** 参数是未命名的强制参数，有向图和无向图的有效值不同。" msgid "In directed graph: valid values are [``r``, ``R``, ``l``, ``L``]" @@ -6765,24 +5490,16 @@ msgid "Single vertex example using ``pgr_withPointsDD``" msgstr "``pgr_withPointsDD``" #, fuzzy -msgid "" -"Migrating `this v3.5 `__ example." -msgstr "" -"使用 `这个 `__ 示例。" +msgid "Migrating `this v3.5 `__ example." +msgstr "使用 `这个 `__ 示例。" #, fuzzy msgid "Multiple vertices example using ``pgr_withPointsDD``" msgstr "``pgr_withPointsDD``" #, fuzzy -msgid "" -"Migrating `this v3.5 `__ example." -msgstr "" -"使用 `这个 `__ 示例。" +msgid "Migrating `this v3.5 `__ example." +msgstr "使用 `这个 `__ 示例。" #, fuzzy msgid "Migration of output column name change" @@ -6932,12 +5649,8 @@ msgstr "PostGIS 提供两种生成 alphaShape 的方法。" msgid "If you have SFCGAL, which you can install using" msgstr "如果你有 SFCGAL，可以通过以下方式安装" -msgid "" -"Since PostGIS 3.5+ use `CG_AlphaShape `__" -msgstr "" -"自 PostGIS 3.5 起，请使用 `CG_AlphaShape `__ 函数" +msgid "Since PostGIS 3.5+ use `CG_AlphaShape `__" +msgstr "自 PostGIS 3.5 起，请使用 `CG_AlphaShape `__ 函数" msgid "For PostGIS 3.5+ use the old name ``ST_AlphaShape``" msgstr "对于 PostGIS 3.5+ 版本，请继续使用旧函数名 ``ST_AlphaShape``" @@ -6955,9 +5668,7 @@ msgstr "" msgid "Migration of ``pgr_nodeNetwork``" msgstr "迁移 ``pgr_bdAstar``" -msgid "" -"**Before Deprecation:** A table with `_nodded` was created. with " -"split edges." +msgid "**Before Deprecation:** A table with `_nodded` was created. with split edges." msgstr "" #, fuzzy @@ -6974,74 +5685,38 @@ msgstr "迁移 ``pgr_createTopology``" msgid "A table with `_vertices_pgr` was created." msgstr "创建了一个包含 `_vertices_pgr` 的表。" -msgid "" -"**After Deprecation:** The user is responsible to create the complete " -"topology." +msgid "**After Deprecation:** The user is responsible to create the complete topology." msgstr "**弃用后：** 用户需自行构建完整拓扑。" msgid "Build a routing topology" msgstr "构建路由拓扑" -msgid "" -"The basic information to use the majority of the pgRouting functions ``id, " -"source, target, cost, [reverse_cost]`` is what in pgRouting is called the " -"routing topology." -msgstr "" -"使用大多数 pgRouting 函数的基本信息 ``id, source, target, cost, " -"[reverse_cost]`` 在 pgRouting 中被称为路由拓扑。" +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 "" -"``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 "``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 "" -"When the data comes with geometries and there is no routing topology, then " -"this step is needed." +msgid "When the data comes with geometries and there is no routing topology, then this step is needed." msgstr "当数据带有几何图形并且没有路由拓扑时，则需要此步骤。" -msgid "" -"All the start and end vertices of the geometries need an identifier that is " -"to be stored in a ``source`` and ``target`` columns of the table of the " -"data. Likewise, ``cost`` and ``reverse_cost`` need to have the value of " -"traversing the edge in both directions." -msgstr "" -"几何图的所有开始和结束顶点都需要一个标识符，该标识符将存储在数据表的 " -"``source`` 列和 ``target`` 列中。 同样， ``cost`` 和 ``reverse_cost`` 需要具" -"有在两个方向上遍历边的值。" +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 "几何图的所有开始和结束顶点都需要一个标识符，该标识符将存储在数据表的 ``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 `__ ）" +msgid "If the columns do not exist they need to be added to the table in question. (see `ALTER TABLE `__)" +msgstr "如果这些列不存在，则需要将它们添加到相关表中。 （参见 `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 "" -"函数 :doc:`pgr_extractVertices` 用于根据边标识符和图边的几何形状创建顶点表。" +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 "函数 :doc:`pgr_extractVertices` 用于根据边标识符和图边的几何形状创建顶点表。" -msgid "" -"Finally using the data stored on the vertices tables the ``source`` and " -"``target`` are filled up." +msgid "Finally using the data stored on the vertices tables the ``source`` and ``target`` are filled up." msgstr "最后使用存储在顶点表上的数据填充 ``source`` 和 ``target`` 。" msgid "Migration of ``pgr_createVerticesTable``" msgstr "迁移 ``pgr_createVerticesTable``" -msgid "" -"**After Deprecation:** The user is responsible to create the vertices table, " -"indexes, etc. They may use :doc:`pgr_extractVertices` for that purpose." -msgstr "" -"**弃用后：** 用户需自行创建顶点表、索引等结构，可调用 :doc:" -"`pgr_extractVertices` 函数实现该功能。" +msgid "**After Deprecation:** The user is responsible to create the vertices table, indexes, etc. They may use :doc:`pgr_extractVertices` for that purpose." +msgstr "**弃用后：** 用户需自行创建顶点表、索引等结构，可调用 :doc:`pgr_extractVertices` 函数实现该功能。" msgid "Migration of ``pgr_analyzeOneWay``" msgstr "迁移 ``pgr_analyzeOneWay``" @@ -7058,18 +5733,11 @@ msgstr "方向性问题已根据预设规则代码完成计算。" msgid "Dead ends." msgstr "死胡同。" -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 "A routing problem can arise when from a vertex there is only a way on or a way out but not both:" +msgstr "当某个节点仅存在单向通行路径（仅有进入或仅有离开的边线）时，将导致路由问题：" -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 "" -"通过保存或直接调用 :doc:`pgr_extractVertices` 获取断头路信息，并判断相邻边线" -"是否为单行道。" +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 "通过保存或直接调用 :doc:`pgr_extractVertices` 获取断头路信息，并判断相邻边线是否为单行道。" msgid "In this example :doc:`pgr_extractVertices` has already been applied." msgstr "在本例中 :doc:`pgr_extractVertices` 已经应用。" @@ -7077,13 +5745,8 @@ msgstr "在本例中 :doc:`pgr_extractVertices` 已经应用。" msgid "Bridges." msgstr "桥梁。" -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 "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 "To determine if the bridges are or not one way." msgstr "判断桥梁是否为单行道。" @@ -7139,9 +5802,7 @@ msgstr "迁移。" msgid "Components." msgstr "组件。" -msgid "" -"Instead of counting only isolated segments, determine all the components of " -"the graph." +msgid "Instead of counting only isolated segments, determine all the components of the graph." msgstr "不仅统计孤立线段，还要识别图中的所有连通子图（组件）。" msgid "Depending of the final application requirements use:" @@ -7159,38 +5820,23 @@ msgstr ":doc:`pgr_biconnectedComponents`" msgid "For example:" msgstr "示例：" -msgid "" -"Instead of counting the dead ends, determine all the dead ends of the graph " -"using :doc:`pgr_degree`." +msgid "Instead of counting the dead ends, determine all the dead ends of the graph using :doc:`pgr_degree`." msgstr "使用 :doc:`pgr_degree` 确定图形的所有死角，而不是计算死角。" msgid "Potential gaps near dead ends." msgstr "断头路附近的潜在缺口。" -msgid "" -"Instead of counting potential gaps between geometries, determine the " -"geometric gaps in the graph using :doc:`pgr_findCloseEdges`." -msgstr "" -"使用 :doc:`pgr_findCloseEdges` 来确定图形中的几何间隙，而不是计算几何图形之间" -"的潜在间隙。" +msgid "Instead of counting potential gaps between geometries, determine the geometric gaps in the graph using :doc:`pgr_findCloseEdges`." +msgstr "使用 :doc:`pgr_findCloseEdges` 来确定图形中的几何间隙，而不是计算几何图形之间的潜在间隙。" msgid "Topological relationships." msgstr "拓扑关系。" -msgid "" -"Instead of counting intersections, determine topological relationships " -"between geometries." +msgid "Instead of counting intersections, determine topological relationships between geometries." msgstr "确定几何图形之间的拓扑关系，而不是计算交叉点。" -msgid "" -"Several PostGIS functions can be used: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." -msgstr "" -"可以使用几个 PostGIS 函数： `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, 等。" +msgid "Several PostGIS functions can be used: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." +msgstr "可以使用几个 PostGIS 函数： `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, 等。" msgid "Migration of ``pgr_trsp`` (Vertices)" msgstr "迁移 ``pgr_trsp`` (顶点）" @@ -7291,12 +5937,8 @@ msgstr "" msgid "Migration of ``pgr_withPointsKSP``" msgstr "迁移 ``pgr_withPointsKSP``" -msgid "" -"Starting from `v3.6.0 `__ :" -"doc:`pgr_withPointsKSP` result columns are being standardized." -msgstr "" -"从 `v3.6.0 `__ :doc:" -"`pgr_withPointsKSP` 开始对结果列进行标准化。" +msgid "Starting from `v3.6.0 `__ :doc:`pgr_withPointsKSP` result columns are being standardized." +msgstr "从 `v3.6.0 `__ :doc:`pgr_withPointsKSP` 开始对结果列进行标准化。" msgid "|ksp-result|" msgstr "|ksp-result|" @@ -7306,12 +5948,8 @@ msgid "|generic-result|" msgstr "|nksp-result|" #, fuzzy -msgid "" -"And ``driving side`` parameter changed from named optional to unnamed " -"**driving side** and its validity differ for directed and undirected graphs." -msgstr "" -"而且 ``driving side`` 参数从命名的可选参数变为未命名的必选参数 **行驶方向**，" -"其有效性对于有向图和无向图有所不同。" +msgid "And ``driving side`` parameter changed from named optional to unnamed **driving side** and its validity differ for directed and undirected graphs." +msgstr "而且 ``driving side`` 参数从命名的可选参数变为未命名的必选参数 **行驶方向**，其有效性对于有向图和无向图有所不同。" msgid "``pgr_withPointsKSP`` (`One to One`)" msgstr "``pgr_withPointsKSP`` (`One to One`)" @@ -7335,12 +5973,8 @@ msgstr "注意附加结果列的存在。" msgid "New output columns are |generic-result|" msgstr "新的输出列是 |nksp-result|" -msgid "" -"Using `this `__ example." -msgstr "" -"使用 `这个 `__ 示例。" +msgid "Using `this `__ example." +msgstr "使用 `这个 `__ 示例。" msgid "``start_vid`` contains the **start vid** parameter value." msgstr "``start_vid`` 包含 **起始 vid** 参数值。" @@ -7348,9 +5982,7 @@ msgstr "``start_vid`` 包含 **起始 vid** 参数值。" msgid "``end_vid`` contains the **end vid** parameter value." msgstr "``end_vid`` 包含 **结束 vid** 参数值。" -msgid "" -"If needed filter out the additional columns, for example, to return the " -"original columns:" +msgid "If needed filter out the additional columns, for example, to return the original columns:" msgstr "如果需要，过滤掉附加列，例如，返回原始列：" msgid "Use ``pgr_withPoints`` when there are no restrictions." @@ -7368,14 +6000,10 @@ msgstr "使用 :doc:`pgr_trsp_withPoints` 替代。" msgid "Migration of ``pgr_maxCardinalityMatch``" msgstr "迁移 ``pgr_maxCardinalityMatch``" -msgid "" -":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, therefore " -"the ``directed`` flag has been removed." -msgstr "" -":doc:`pgr_maxCardinalityMatch` 仅适用于无向图，因此 ``有向`` 标志已被删除。" +msgid ":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, therefore the ``directed`` flag has been removed." +msgstr ":doc:`pgr_maxCardinalityMatch` 仅适用于无向图，因此 ``有向`` 标志已被删除。" -msgid "" -"Starting from `v3.4.0 `__" +msgid "Starting from `v3.4.0 `__" msgstr "开始于 `v3.4.0 `__" msgid "Signature to be migrated:" @@ -7405,27 +6033,19 @@ msgstr "可选的 ``directed`` 标志被删除。" msgid "Before migration" msgstr "迁移前" -msgid "" -"Columns used are ``going`` and ``coming`` to represent the existence of an " -"edge." +msgid "Columns used are ``going`` and ``coming`` to represent the existence of an edge." msgstr "所使用的列是 ``going`` 和 ``coming`` ，用于表示边的存在。" -msgid "" -"Flag ``directed`` was used to indicate if it was for a **directed** or " -"**undirected** graph." +msgid "Flag ``directed`` was used to indicate if it was for a **directed** or **undirected** graph." msgstr "``directed`` 标志用于指示是 **有向** 图还是 **无向** 图。" msgid "The flag ``directed`` is ignored." msgstr "``directed`` 标志被忽略。" -msgid "" -"Regardless of it's value it gives the result considering the graph as " -"**undirected**." +msgid "Regardless of it's value it gives the result considering the graph as **undirected**." msgstr "无论它的值如何，它都会给出将图视为 **无向** 的结果。" -msgid "" -"Use the columns ``cost`` and ``reverse_cost`` to represent the existence of " -"an edge." +msgid "Use the columns ``cost`` and ``reverse_cost`` to represent the existence of an edge." msgstr "使用 ``cost`` 和 ``reverse_cost`` 列来表示边的存在。" msgid "Do not use the flag ``directed``." @@ -7485,9 +6105,7 @@ msgstr "旧限制已满" msgid "Old restrictions contents" msgstr "旧限制内容" -msgid "" -"The restriction with ``rid = 2`` is representing :math:`3 \\rightarrow 5 " -"\\rightarrow9`" +msgid "The restriction with ``rid = 2`` is representing :math:`3 \\rightarrow 5 \\rightarrow9`" msgstr "``rid = 2`` 的限制表示的是路径 :math:`3 \\rightarrow 5 \\rightarrow9`" msgid ":math:`3\\rightarrow5`" @@ -7541,17 +6159,13 @@ msgstr "添加限制" msgid "Restrictions data" msgstr "限制数据" -msgid "" -"The restriction with ``rid = 2`` represents the path :math:`3 \\rightarrow5 " -"\\rightarrow9`." -msgstr "" -"``rid = 2`` 的限制表示的是路径 :math:`3 \\rightarrow5 \\rightarrow9` 。" +msgid "The restriction with ``rid = 2`` represents the path :math:`3 \\rightarrow5 \\rightarrow9`." +msgstr "``rid = 2`` 的限制表示的是路径 :math:`3 \\rightarrow5 \\rightarrow9` 。" msgid "By inspection the path is clear." msgstr "通过检查，路径是清晰的。" -msgid "" -"To transform the old restrictions table to the new restrictions structure," +msgid "To transform the old restrictions table to the new restrictions structure," msgstr "要将旧的限制表转换为新的限制结构，" msgid "Create a new table with the new restrictions structure." @@ -7560,12 +6174,8 @@ msgstr "使用新的限制结构创建一个新表。" msgid "In this migration guide ``new_restrictions`` is been used." msgstr "在此迁移指南中使用了 ``new_restrictions`` 。" -msgid "" -"For this migration pgRouting supplies an auxiliary function for reversal of " -"an array ``_pgr_array_reverse`` needed for the migration." -msgstr "" -"为了进行这次迁移，pgRouting 提供了一个用于反转数组的辅助函数 ``_ " -"pgr_array_reverse`` ，这在迁移过程中是必需的。" +msgid "For this migration pgRouting supplies an auxiliary function for reversal of an array ``_pgr_array_reverse`` needed for the migration." +msgstr "为了进行这次迁移，pgRouting 提供了一个用于反转数组的辅助函数 ``_ pgr_array_reverse`` ，这在迁移过程中是必需的。" msgid "``_pgr_array_reverse``:" msgstr "``_pgr_array_reverse``:" @@ -7592,9 +6202,7 @@ msgstr "排序 - 函数族" msgid "pgRouting Concepts" msgstr "pgRouting 概念" -msgid "" -"This is a simple guide that go through some of the steps for getting started " -"with pgRouting. This guide covers:" +msgid "This is a simple guide that go through some of the steps for getting started with pgRouting. This guide covers:" msgstr "这是一个简单的指南，介绍了 pgRouting 入门的一些步骤。 本指南涵盖：" msgid "Graphs" @@ -7627,10 +6235,8 @@ msgstr ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V) \\}`" msgid "Directed simple graph" msgstr "有向simple图" -msgid "" -":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" -msgstr "" -":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" +msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" +msgstr ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" msgid "Graphs:" msgstr "图：" @@ -7638,13 +6244,10 @@ msgstr "图：" msgid "Do not have geometries." msgstr "没有几何图形。" -msgid "" -"Some graph theory problems require graphs to have weights, called **cost** " -"in pgRouting." +msgid "Some graph theory problems require graphs to have weights, called **cost** in pgRouting." msgstr "一些图论问题需要图具有权重，在 pgRouting 中称为 **成本** 。" -msgid "" -"In pgRouting there are several ways to represent a graph on the database:" +msgid "In pgRouting there are several ways to represent a graph on the database:" msgstr "在 pgRouting 中，有多种方法来表示数据库上的图：" msgid "With ``cost``" @@ -7659,9 +6262,7 @@ msgstr "使用 ``cost`` 和 ``reverse_cost``" msgid "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)" msgstr "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)" -msgid "" -"Identifier of the edge. Requirement to use the database in a consistent. " -"manner." +msgid "Identifier of the edge. Requirement to use the database in a consistent. manner." msgstr "边的标识符。要求在数据库中以一致的方式使用。" msgid "Identifier of a vertex." @@ -7670,22 +6271,17 @@ msgstr "顶点的标识符。" msgid "Weight of the edge (``source``, ``target``):" msgstr "边 (``source``, ``target``)的权重：" -msgid "" -"When negative the edge (``source``, ``target``) do not exist on the graph." +msgid "When negative the edge (``source``, ``target``) do not exist on the graph." msgstr "当为负时，图上不存在edge (``source``, ``target``)。" msgid "``cost`` must exist in the query." msgstr "查询中必须存在 ``cost`` 。" -msgid "" -"When negative the edge (``target``, ``source``) do not exist on the graph." +msgid "When negative the edge (``target``, ``source``) do not exist on the graph." msgstr "当为负时，图上不存在边(``target``, ``source``)。" -msgid "" -"The decision of the graph to be **directed** or **undirected** is done when " -"executing a pgRouting algorithm." -msgstr "" -"图是 **有向** 图还是 **无向** 图的决定是在执行 pgRouting 算法时完成的。" +msgid "The decision of the graph to be **directed** or **undirected** is done when executing a pgRouting algorithm." +msgstr "图是 **有向** 图还是 **无向** 图的决定是在执行 pgRouting 算法时完成的。" msgid "Graph with ``cost``" msgstr "``cost`` 图" @@ -7699,12 +6295,8 @@ msgstr "通过查询获取图数据" msgid "``SELECT id, source, target, cost FROM edges``" msgstr "``SELECT id, source, target, cost FROM edges``" -msgid "" -":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} " -"\\ge 0 \\}`" -msgstr "" -":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} " -"\\ge 0 \\}`" +msgid ":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} \\ge 0 \\}`" +msgstr ":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} \\ge 0 \\}`" msgid "Edges where ``cost`` is non negative are part of the graph." msgstr "``cost`` 非负的边是图的一部分。" @@ -7715,12 +6307,8 @@ msgstr ":math:`V = \\{source_{id} \\cup target_{id}\\}`" msgid "All vertices in ``source`` and ``target`` are part of the graph." msgstr "``source`` 和 ``target`` 中的所有顶点都是图的一部分。" -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 "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 "For the following data:" msgstr "对于以下数据：" @@ -7731,24 +6319,13 @@ msgstr "边 :math:`2` (:math:`1 \\rightarrow 3`) 不是图的一部分。" msgid "The data is representing the following graph:" msgstr "数据代表下图：" -msgid "" -"In an undirected graph the edge :math:`(source_{id}, target_{id}, " -"cost_{id})` does not have directionality: :math:`source_{id} \\frac{\\;\\;\\;" -"\\;\\;}{} target_{id}`" -msgstr "" -"在无向图中，边 :math:`(source_{id}, target_{id}, cost_{id})` 没有方向性：:" -"math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`" +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 "" -"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 "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 "" -"Edge :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) is not part of the " -"graph." +msgid "Edge :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) is not part of the graph." msgstr "边 :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) 不是图的一部分。" msgid "Graph with ``cost`` and ``reverse_cost``" @@ -7760,30 +6337,14 @@ msgstr "``SELECT id, source, target, cost, reverse_cost FROM edges``" msgid "The set of edges :math:`E`:" msgstr "边的集合 :math:`E` ：" -msgid "" -":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, " -"cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & " -"{\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } " -"reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" -msgstr "" -":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, " -"cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & " -"{\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } " -"reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" +msgid ":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & {\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" +msgstr ":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & {\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" -msgid "" -"Edges :math:`(source \\rightarrow target)` where ``cost`` is non negative " -"are part of the graph." -msgstr "" -"边 :math:`(source \\rightarrow target)` 中的 ``cost`` 是非负数的都属于图的一" -"部分。" +msgid "Edges :math:`(source \\rightarrow target)` where ``cost`` is non negative are part of the graph." +msgstr "边 :math:`(source \\rightarrow target)` 中的 ``cost`` 是非负数的都属于图的一部分。" -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 "Edges :math:`(target \\rightarrow source)` where ``reverse_cost`` is non negative are part of the graph." +msgstr "边 :math:`(target \\rightarrow source)` 中的 ``reverse_cost`` 是非负数的都属于图的一部分。" msgid "The set of vertices :math:`V`:" msgstr "顶点集 :math:`V` ：" @@ -7791,19 +6352,11 @@ msgstr "顶点集 :math:`V` ：" msgid "In a directed graph both edges have directionality" msgstr "在有向图中，两条边都有方向性" -msgid "" -"edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:" -"`source_{id} \\rightarrow target_{id}`" -msgstr "" -"边 :math:`(source_{id}, target_{id}, cost_{id})` 具有方向性： :math:" -"`source_{id} \\rightarrow target_{id}`" +msgid "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 "" -"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 "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 "Edges not part of the graph:" msgstr "边不是图的一部分：" @@ -7817,19 +6370,11 @@ msgstr ":math:`3` (:math:`3\\rightarrow 2`)" msgid "In a directed graph both edges do not have directionality" 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}`" +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 "" -"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 "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 "In terms of a directed graph is like having four edges:" msgstr "就有向图而言，就像有四个边：" @@ -7849,23 +6394,14 @@ msgstr ":math:`3` (:math:`3 \\frac{\\;\\;\\;\\;\\;}{} 2`)" msgid "Graphs without geometries" msgstr "没有几何信息的图" -msgid "" -"Personal relationships, genealogy, file dependency problems can be solved " -"using pgRouting. Those problems, normally, do not come with geometries " -"associated with the graph." -msgstr "" -"使用 pgRouting 可以解决个人关系、家谱和文件依赖性问题。这些问题通常不会与图形" -"相关的几何图形一起出现。" +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 "Wiki example" msgstr "维基示例" -msgid "" -"Solve the example problem taken from `wikipedia `__):" -msgstr "" -"解决来自 `维基百科 `__):" +msgid "Solve the example problem taken from `wikipedia `__):" +msgstr "解决来自 `维基百科 `__):" msgid "Problem is to find the shortest path from :math:`1` to :math:`5`." msgstr "问题是找到从 :math:`1` 到 :math:`5` 的最短路径。" @@ -7873,8 +6409,7 @@ msgstr "问题是找到从 :math:`1` 到 :math:`5` 的最短路径。" msgid "Is an undirected graph." msgstr "是一个无向图。" -msgid "" -"Although visually looks like to have geometries, the drawing is not to scale." +msgid "Although visually looks like to have geometries, the drawing is not to scale." msgstr "虽然视觉上看起来有几何形状，但该图并不是按比例绘制的。" msgid "No geometries associated to the vertices or edges" @@ -7886,14 +6421,8 @@ msgstr "有6个顶点 :math:`\\{1,2,3,4,5,6\\}`" msgid "Has 9 edges:" msgstr "有九个边：" -msgid "" -":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\" -"\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & " -"(5,6,9) \\} \\end{align} \\end{split}`" -msgstr "" -":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\" -"\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & " -"(5,6,9) \\} \\end{align} \\end{split}`" +msgid ":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & (5,6,9) \\} \\end{align} \\end{split}`" +msgstr ":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & (5,6,9) \\} \\end{align} \\end{split}`" msgid "The graph can be represented in many ways for example:" msgstr "该图可以用多种方式表示，例如：" @@ -7901,17 +6430,13 @@ msgstr "该图可以用多种方式表示，例如：" msgid "Prepare the database" msgstr "准备数据库" -msgid "" -"Create a database for the example, access the database and install " -"pgRouting: ::" +msgid "Create a database for the example, access the database and install pgRouting: ::" msgstr "为示例创建一个数据库，访问数据库并安装 pgRouting： ::" msgid "Create a table" msgstr "创建表" -msgid "" -"The basic elements needed to perform basic routing on an undirected graph " -"are:" +msgid "The basic elements needed to perform basic routing on an undirected graph are:" msgstr "在无向图上执行基本路由所需的基本元素是：" msgid "SMALLINT, INTEGER, BIGINT, REAL, FLOAT" @@ -7929,12 +6454,8 @@ msgstr "寻找最短路径" msgid "To solve this example :doc:`pgr_dijkstra` is used:" msgstr "为了解决这个例子，使用了 :doc:`pgr_dijkstra`：" -msgid "" -"To go from :math:`1` to :math:`5` the path goes thru the following " -"vertices: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" -msgstr "" -"从 :math:`1` 到 :math:`5` 的路径要经过以下顶点： :math:`1 \\rightarrow 3 " -"\\rightarrow 6 \\rightarrow 5`" +msgid "To go from :math:`1` to :math:`5` the path goes thru the following vertices: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" +msgstr "从 :math:`1` 到 :math:`5` 的路径要经过以下顶点： :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`" msgid "Vertex information" msgstr "顶点信息" @@ -7948,16 +6469,13 @@ msgstr "具有几何图形的图" msgid "Create a routing Database" msgstr "创建路由数据库" -msgid "" -"The first step is to create a database and load pgRouting in the database." +msgid "The first step is to create a database and load pgRouting in the database." msgstr "第一步是创建数据库并在数据库中加载 pgRouting。" msgid "Typically create a database for each project." msgstr "通常为每个项目创建一个数据库。" -msgid "" -"Once having the database to work in, load your data and build the routing " -"application in that database." +msgid "Once having the database to work in, load your data and build the routing application in that database." msgstr "一旦数据库可以工作，加载数据并在该数据库中构建路由应用程序。" msgid "Load Data" @@ -7975,12 +6493,8 @@ msgstr "`没有几何形状的图`_" msgid ":doc:`sampledata`: a small graph used in the documentation examples" msgstr ":doc:`sampledata`: 文档示例中使用的小图形" -msgid "" -"Using `osm2pgrouting `__" -msgstr "" -"使用 `osm2pgrouting `__" +msgid "Using `osm2pgrouting `__" +msgstr "使用 `osm2pgrouting `__" msgid "There are various open source tools that can help, like:" msgstr "有多种开源工具可以提供帮助，例如：" @@ -8003,23 +6517,14 @@ msgstr "osm2pgsql" msgid "load OSM data into postgresql" msgstr "将OSM数据加载到postgresql中" -msgid "" -"Please note that these tools will **not** import the data in a structure " -"compatible with pgRouting and when this happens the topology needs to be " -"adjusted." -msgstr "" -"请注意，这些工具 **不会** 导入与 pgRouting 兼容的结构中的数据，当发生这种情况" -"时，需要调整拓扑。" +msgid "Please note that these tools will **not** import the data in a structure compatible with pgRouting and when this happens the topology needs to be adjusted." +msgstr "请注意，这些工具 **不会** 导入与 pgRouting 兼容的结构中的数据，当发生这种情况时，需要调整拓扑。" msgid "Breakup a segments on each segment-segment intersection" msgstr "在每个线段-线段交叉点上分解线段" -msgid "" -"When missing, add columns and assign values to ``source``, ``target``, " -"``cost``, ``reverse_cost``." -msgstr "" -"如果缺少，请添加列并为 ``source``, ``target``, ``cost``, ``reverse_cost`` 分" -"配值。" +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 "连接断开的图。" @@ -8042,29 +6547,14 @@ msgstr "简而言之：" msgid "Prepare the graph" msgstr "准备图" -msgid "" -"What and how to prepare the graph, will depend on the application and/or on " -"the quality of the data and/or on how close the information is to have a " -"topology usable by pgRouting and/or some other factors not mentioned." -msgstr "" -"准备什么以及如何准备图将取决于应用程序和/或数据质量和/或信息与 pgRouting 可用" -"的拓扑的接近程度和/或未提及的一些其他因素。" +msgid "What and how to prepare the graph, will depend on the application and/or on the quality of the data and/or on how close the information is to have a topology usable by pgRouting and/or some other factors not mentioned." +msgstr "准备什么以及如何准备图将取决于应用程序和/或数据质量和/或信息与 pgRouting 可用的拓扑的接近程度和/或未提及的一些其他因素。" -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." -msgstr "" -"准备图的步骤涉及使用 `PostGIS `__ 进行几何操作，其他一" -"些步骤涉及诸如 :doc:`pgr_contraction` 之类的图操作来收缩图。" +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." +msgstr "准备图的步骤涉及使用 `PostGIS `__ 进行几何操作，其他一些步骤涉及诸如 :doc:`pgr_contraction` 之类的图操作来收缩图。" -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 "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 "The use of indexes on the database design in general:" msgstr "数据库设计上索引的使用一般：" @@ -8075,38 +6565,22 @@ msgstr "对几何图形进行索引。" msgid "Have the identifiers columns indexed." msgstr "对标识符列建立索引。" -msgid "" -"Please consult the `PostgreSQL `__ " -"documentation and the `PostGIS `__ documentation." -msgstr "" -"请查阅 `PostgreSQL `__ 文档和 `PostGIS " -"`__ 文档。" +msgid "Please consult the `PostgreSQL `__ documentation and the `PostGIS `__ documentation." +msgstr "请查阅 `PostgreSQL `__ 文档和 `PostGIS `__ 文档。" -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`` 的示例。" +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`` 的示例。" msgid "Adjust costs" msgstr "调整成本" -msgid "" -"For this example the ``cost`` and ``reverse_cost`` values are going to be " -"the double of the length of the geometry." +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 "Update costs to length of geometry" msgstr "将成本更新为几何形状的长度" -msgid "" -"Suppose that ``cost`` and ``reverse_cost`` columns in the sample data " -"represent:" +msgid "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" @@ -8121,9 +6595,7 @@ msgstr "使用该信息更新几何形状的长度：" msgid "Which gives the following results:" msgstr "给出以下结果：" -msgid "" -"Note that to be able to follow the documentation examples, everything is " -"based on the original graph." +msgid "Note that to be able to follow the documentation examples, everything is based on the original graph." msgstr "请注意，为了能够遵循文档示例，一切都基于原始图。" msgid "Returning to the original data:" @@ -8174,9 +6646,7 @@ msgstr "图太大，需要收缩。" msgid "A sub graph is needed for the application." msgstr "该应用程序需要一个子图。" -msgid "" -"and many other problems that the pgRouting user, that is the application " -"developer might encounter." +msgid "and many other problems that the pgRouting user, that is the application developer might encounter." msgstr "以及 pgRouting 用户（即应用程序开发人员）可能遇到的许多其他问题。" msgid "Crossing edges" @@ -8185,21 +6655,16 @@ msgstr "交叉边" msgid "To get the crossing edges:" msgstr "要获取交叉边：" -msgid "" -"That information is correct, for example, when in terms of vehicles, is it a " -"tunnel or bridge crossing over another road." +msgid "That information is correct, for example, when in terms of vehicles, is it a tunnel or bridge crossing over another road." msgstr "这些信息是正确的，例如，就车辆而言，是隧道还是横跨另一条道路的桥梁。" msgid "It might be incorrect, for example:" msgstr "它可能是不正确的，例如：" -msgid "" -"When it is actually an intersection of roads, where vehicles can make turns." +msgid "When it is actually an intersection of roads, where vehicles can make turns." msgstr "当它实际上是道路交叉口时，车辆可以转弯。" -msgid "" -"When in terms of electrical lines, the electrical line is able to switch " -"roads even on a tunnel or bridge." +msgid "When in terms of electrical lines, the electrical line is able to switch roads even on a tunnel or bridge." msgstr "在电力线路方面，电力线能够在隧道或桥梁上甚至切换道路。" msgid "When it is incorrect, it needs fixing:" @@ -8208,54 +6673,31 @@ msgstr "当不正确时，需要修复：" msgid "For vehicles and pedestrians" 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 " -"`__ 中完成修复并再次导入数据。" +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 "" -"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 "In general when the data comes from a supplier that has the data prepared for routing vehicles, and there is a problem, the data is to be fixed from the supplier" +msgstr "一般来说，当数据来自为车辆路线准备数据的供应商时，并且出现问题时，需要从供应商处修复数据" msgid "For very specific applications" msgstr "对于非常具体的应用" -msgid "" -"The data is correct when from the point of view of routing vehicles or " -"pedestrians." +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 "Once analyzed one by one the crossings, for the ones that need a local fix, the edges need to be `split `__." +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 "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 "Fixing an intersection" msgstr "修复交叉路口" -msgid "" -"In this example the original edge table will be used to store the additional " -"geometries." +msgid "In this example the original edge table will be used to store the additional geometries." msgstr "在此示例中，原始边线表将用于存储新增的几何图形。" msgid "An example use without results" @@ -8279,21 +6721,14 @@ msgstr "用于控制路段来源的附加列。" msgid "Adding new segments." msgstr "添加新线段。" -msgid "" -"Calling :doc:`pgr_separateCrossing` and adding the new segments to the edges " -"table." +msgid "Calling :doc:`pgr_separateCrossing` and adding the new segments to the edges table." msgstr "调用 :doc:`pgr_separateCrossing` 并将新的线段添加到边缘表中。" msgid "Update other values" msgstr "更新其他数值" -msgid "" -"In this example only ``cost`` and ``reverse_cost`` are updated, where they " -"are based on the length of the geometry and the directionality is kept using " -"the ``sign`` function." -msgstr "" -"在此示例中，仅更新了 ``cost`` 和 ``reverse_cost`` 列，其值基于几何长度并通过 " -"``sign`` 函数保持方向性。" +msgid "In this example only ``cost`` and ``reverse_cost`` are updated, where they are based on the length of the geometry and the directionality is kept using the ``sign`` function." +msgstr "在此示例中，仅更新了 ``cost`` 和 ``reverse_cost`` 列，其值基于几何长度并通过 ``sign`` 函数保持方向性。" msgid "Update the topology" msgstr "更新拓扑结构" @@ -8322,12 +6757,8 @@ msgstr "信息的有效性取决于应用情况。" msgid "Maybe there is a small barrier for vehicles but not for pedestrians." msgstr "也许对车辆有一个小障碍，但对行人却没有。" -msgid "" -"Once analyzed one by one the touchings, for the ones that need a local fix, " -"the edges need to be `split `__." -msgstr "" -"逐条分析接触边后，需局部修复的边线应通过 `split `__ 。" +msgid "Once analyzed one by one the touchings, for the ones that need a local fix, the edges need to be `split `__." +msgstr "逐条分析接触边后，需局部修复的边线应通过 `split `__ 。" msgid "Fixing a gap" msgstr "弥补差距" @@ -8341,9 +6772,7 @@ msgstr "分析路网的断点情况。" msgid "The analysis tell us that the network has a gap." msgstr "分析表明该路网存在断点。" -msgid "" -"Calling :doc:`pgr_separateTouching` and adding the new segments to the edges " -"table." +msgid "Calling :doc:`pgr_separateTouching` and adding the new segments to the edges table." msgstr "调用 :doc:`pgr_separateTouching` 并将新的线段添加到边缘表中。" msgid "Routing from :math:`1` to :math:`2` gives a solution." @@ -8370,30 +6799,20 @@ msgstr "从边上的顶点到最近的顶点" msgid "This solution requires the edge to be split." msgstr "该解决方案需要将边缘分割。" -msgid "" -"In this example :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` " -"will be used." -msgstr "" -"在这个例子中，将使用 :doc:`pgr_separateCrossing` 和 :doc:" -"`pgr_separateTouching` 。" +msgid "In this example :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` will be used." +msgstr "在这个例子中，将使用 :doc:`pgr_separateCrossing` 和 :doc:`pgr_separateTouching` 。" msgid "Get the connectivity" msgstr "获取连接性" -msgid "" -"In this example: the edges table will need an additional column and the " -"vertex table will be rebuilt completely." +msgid "In this example: the edges table will need an additional column and the vertex table will be rebuilt completely." msgstr "在本例中：边表需要增加一列，顶点表将完全重建。" msgid "Insert new edges" msgstr "插入新边线" -msgid "" -"Using :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` insert the " -"results into the edges table." -msgstr "" -"使用 :doc:`pgr_separateCrossing` 和 :doc:`pgr_separateTouching` 将结果插入边" -"缘表。" +msgid "Using :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` insert the results into the edges table." +msgstr "使用 :doc:`pgr_separateCrossing` 和 :doc:`pgr_separateTouching` 将结果插入边缘表。" msgid "Create the vertices table" msgstr "创建顶点表" @@ -8407,25 +6826,14 @@ msgstr "图的收缩" msgid "The graph can be reduced in size using :doc:`contraction-family`" msgstr "可以使用 :doc:`contraction-family` 来减小图形的大小" -msgid "" -"When to contract will depend on the size of the graph, processing times, " -"correctness of the data, on the final application, or any other factor not " -"mentioned." -msgstr "" -"何时收缩将取决于图的大小、处理时间、数据的正确性、最终应用程序或任何其他未提" -"及的因素。" +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 "何时收缩将取决于图的大小、处理时间、数据的正确性、最终应用程序或任何其他未提及的因素。" -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." +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 "确定收缩是否有用的一个相当好的方法是根据死端的数量和/或线性边的数量。" -msgid "" -"A complete method on how to contract and how to use the contracted graph is " -"described on :doc:`contraction-family`" -msgstr "" -"有关如何收缩以及如何使用收缩图的完整方法在 :doc:`contraction-family` 中进行了" -"描述" +msgid "A complete method on how to contract and how to use the contracted graph is described on :doc:`contraction-family`" +msgstr "有关如何收缩以及如何使用收缩图的完整方法在 :doc:`contraction-family` 中进行了描述" msgid "To get the dead ends:" msgstr "获取死端：" @@ -8433,8 +6841,7 @@ msgstr "获取死端：" msgid "A dead end happens when" msgstr "死端（Dead End）的形成条件" -msgid "" -"The vertex is the limit of a cul-de-sac, a no-through road or a no-exit road." +msgid "The vertex is the limit of a cul-de-sac, a no-through road or a no-exit road." msgstr "死端顶点（Dead End Vertex）的拓扑定义。" msgid "The vertex is on the limit of the imported graph." @@ -8443,9 +6850,7 @@ msgstr "该顶点位于导入图形的边界处。" msgid "If a larger graph is imported then the vertex might not be a dead end" msgstr "如果导入了更大的图，则该顶点可能不会是死端" -msgid "" -"Node :math:`4`, is a dead end on the query, even that it visually looks like " -"an end point of 3 edges." +msgid "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 "Is node :math:`4` a dead end or not?" @@ -8460,30 +6865,20 @@ msgstr "有这么小的路边吗：" msgid "That does not allow a vehicle to use that visual intersection?" msgstr "这不允许车辆使用该视觉交叉路口？" -msgid "" -"Is the application for pedestrians and therefore the pedestrian can easily " -"walk on the small curb?" +msgid "Is the application for pedestrians and therefore the pedestrian can easily walk on the small curb?" msgstr "是否适用于行人，因此行人可以轻松地在小路边行走？" -msgid "" -"Is the application for the electricity and the electrical lines than can " -"easily be extended on top of the small curb?" +msgid "Is the application for the electricity and the electrical lines than can easily be extended on top of the small curb?" msgstr "电力和电线的应用是否可以轻松地延伸到小路边顶部？" -msgid "" -"Is there a big cliff and from eagles view look like the dead end is close to " -"the segment?" +msgid "Is there a big cliff and from eagles view look like the dead end is close to the segment?" msgstr "是否有一个大悬崖，从鹰的角度看，死胡同靠近该路段？" msgid "Depending on the answer, modification of the data might be needed." msgstr "根据分析结果，可能需要对数据进行修改。" -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 "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 "Linear edges" msgstr "线性边" @@ -8491,26 +6886,16 @@ msgstr "线性边" msgid "To get the linear edges:" msgstr "要获得线性边：" -msgid "" -"These linear vertices are correct, for example, when those the vertices are " -"speed bumps, stop signals and the application is taking them into account." -msgstr "" -"当这些顶点表示减速带、停止信号，并且应用程序将其纳入考虑时，这些线性顶点是正" -"确的。" +msgid "These linear vertices are correct, for example, when those the vertices are speed bumps, stop signals and the application is taking them into account." +msgstr "当这些顶点表示减速带、停止信号，并且应用程序将其纳入考虑时，这些线性顶点是正确的。" -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 "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 "Function's structure" msgstr "函数的结构" -msgid "" -"Once the graph preparation work has been done above, it is time to use a" +msgid "Once the graph preparation work has been done above, it is time to use a" msgstr "完成上述图准备工作后，就可以使用" msgid "The general form of a pgRouting function call is:" @@ -8520,35 +6905,25 @@ msgid "\\ \\" msgstr "\\ \\" msgid "pgr_(`Inner queries`_, **parameters**, [ ``Optional parameters``)" -msgstr "" -"pgr_(`Inner queries`_ , **parameters**, [``Optional parameters``)" +msgstr "pgr_(`Inner queries`_ , **parameters**, [``Optional parameters``)" -msgid "" -"`Inner queries`_: Are compulsory parameters that are ``TEXT`` strings " -"containing SQL queries." +msgid "`Inner queries`_: Are compulsory parameters that are ``TEXT`` strings containing SQL queries." msgstr "`Inner queries`_ ：是强制参数，是包含 SQL 查询的 ``TEXT`` 字符串。" -msgid "" -"**parameters**: Additional compulsory parameters needed by the function." +msgid "**parameters**: Additional compulsory parameters needed by the function." msgstr "**parameters**：函数需要的附加强制参数。" -msgid "" -"``Optional parameters``: Are non compulsory **named** parameters that have a " -"default value when omitted." +msgid "``Optional parameters``: Are non compulsory **named** parameters that have a default value when omitted." msgstr "``Optional parameters`` ：是非强制命名参数，省略时具有默认值。" -msgid "" -"The compulsory parameters are positional parameters, the optional parameters " -"are named parameters." +msgid "The compulsory parameters are positional parameters, the optional parameters are named parameters." msgstr "强制参数是位置参数，可选参数是命名参数。" msgid "For example, for this :doc:`pgr_dijkstra` signature:" msgstr "例如，对于这个 :doc:`pgr_dijkstra` 签名：" -msgid "" -"pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "" -"pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgid "`Edges SQL`_:" msgstr "`Edges SQL`_:" @@ -8562,9 +6937,7 @@ msgstr "这是强制性的。" msgid "It is an inner query." msgstr "这是一个内部查询。" -msgid "" -"It has no name, so **Edges SQL** gives an idea of what kind of inner query " -"needs to be used" +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 "**start vid**:" @@ -8573,17 +6946,13 @@ msgstr "**start vid**:" msgid "Is the second parameter." msgstr "是第二个参数。" -msgid "" -"It has no name, so **start vid** gives an idea of what the second " -"parameter's value should contain." +msgid "It has no name, so **start vid** gives an idea of what the second parameter's value should contain." msgstr "它没有名称，因此 **start vid** 给出了第二个参数的值应包含的内容。" msgid "Is the third parameter." msgstr "是第三个参数。" -msgid "" -"It has no name, so **end vid** gives an idea of what the third parameter's " -"value should contain" +msgid "It has no name, so **end vid** gives an idea of what the third parameter's value should contain" msgstr "它没有名称，因此 **end vid** 给出了第三个参数的值应包含的内容" msgid "Is the fourth parameter." @@ -8595,9 +6964,7 @@ msgstr "是可选的。" msgid "It has a name." msgstr "它有一个名字。" -msgid "" -"The full description of the parameters are found on the `Parameters`_ " -"section of each function." +msgid "The full description of the parameters are found on the `Parameters`_ section of each function." msgstr "参数的完整描述可以在每个函数的 `Parameters`_ 部分找到。" msgid "Function's overloads" @@ -8630,9 +6997,7 @@ msgstr "**一**: **ANY-INTEGER**" msgid "**Many**: ``ARRAY`` [**ANY-INTEGER**]" msgstr "**Many**: ``ARRAY`` [**ANY-INTEGER**]" -msgid "" -"Depending of the function the overloads may vary. But the concept of " -"parameter type change remains the same." +msgid "Depending of the function the overloads may vary. But the concept of parameter type change remains the same." msgstr "根据函数的不同，重载可能会有所不同。 但参数类型改变的概念保持不变。" msgid "When routing from:" @@ -8665,14 +7030,8 @@ msgstr "用户可以根据需要定义组合。" msgid "Needs a `Combinations SQL`_" msgstr "需要 `Combinations SQL`_" -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 "" -"有几种有效的内部查询类型，返回的列也取决于函数。哪种类型的内部查询将取决于函" -"数的要求。为了简化类型的种类，使用了 **ANY-INTEGER** 和 **ANY-NUMERICAL** 。" +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 "有几种有效的内部查询类型，返回的列也取决于函数。哪种类型的内部查询将取决于函数的要求。为了简化类型的种类，使用了 **ANY-INTEGER** 和 **ANY-NUMERICAL** 。" msgid "Edges SQL for" msgstr "边 SQL" @@ -8686,9 +7045,7 @@ msgstr "一般没有 ``id``" msgid "General with (X,Y)" msgstr "通常带有（X,Y)" -msgid "" -"When negative: edge (``source``, ``target``) does not exist, therefore it's " -"not part of the graph." +msgid "When negative: edge (``source``, ``target``) does not exist, therefore it's not part of the graph." msgstr "当为负时：edge (``source``, ``target``)不存在，因此它不是图的一部分。" msgid "Weight of the edge (``target``, ``source``)," @@ -8733,24 +7090,14 @@ msgstr "结合签名使用" msgid "Points SQL for" msgstr "用于Points SQL" -msgid "" -"The main parameter of the majority of the pgRouting functions is a query " -"that selects the edges of the graph." +msgid "The main parameter of the majority of the pgRouting functions is a query that selects the edges of the graph." msgstr "大多数 pgRouting 函数的主要参数是选择图的边的查询。" -msgid "" -"Depending on the family or category of a function it will have additional " -"parameters, some of them are compulsory and some are optional." -msgstr "" -"根据函数的族或类别，它将具有附加参数，其中一些是强制性的，一些是可选的。" +msgid "Depending on the family or category of a function it will have additional parameters, some of them are compulsory and some are optional." +msgstr "根据函数的族或类别，它将具有附加参数，其中一些是强制性的，一些是可选的。" -msgid "" -"The compulsory parameters are nameless and must be given in the required " -"order. The optional parameters are named parameters and will have a default " -"value." -msgstr "" -"强制参数是无名的，并且必须按要求的顺序给出。 可选参数是命名参数，并且具有默认" -"值。" +msgid "The compulsory parameters are nameless and must be given in the required order. The optional parameters are named parameters and will have a default value." +msgstr "强制参数是无名的，并且必须按要求的顺序给出。 可选参数是命名参数，并且具有默认值。" msgid "Parameters for the Via functions" msgstr "Via 函数的参数" @@ -8779,21 +7126,11 @@ msgstr "当 ``false`` 忽略丢失的路径时，返回找到的所有路径" msgid "``U_turn_on_edge``" msgstr "``U_turn_on_edge``" -msgid "" -"When ``true`` departing from a visited vertex will not try to avoid using " -"the edge used to reach it. In other words, U turn using the edge with same " -"identifier is allowed." -msgstr "" -"当 为 ``true`` 时，从已访问的顶点出发，不会试图避免使用用于到达它的边。换句话" -"说，允许使用具有相同标识符的边来进行掉头。" +msgid "When ``true`` departing from a visited vertex will not try to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is allowed." +msgstr "当 为 ``true`` 时，从已访问的顶点出发，不会试图避免使用用于到达它的边。换句话说，允许使用具有相同标识符的边来进行掉头。" -msgid "" -"When ``false`` when a departing from a visited vertex tries to avoid using " -"the edge used to reach it. In other words, U turn using the edge with same " -"identifier is used when no other path is found." -msgstr "" -"当为 ``false`` 时，从已访问的顶点出发，尝试避免使用用于到达它的边。换句话说，" -"只有在找不到其他路径时才使用具有相同标识符的边来进行掉头。" +msgid "When ``false`` when a departing from a visited vertex tries to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is used when no other path is found." +msgstr "当为 ``false`` 时，从已访问的顶点出发，尝试避免使用用于到达它的边。换句话说，只有在找不到其他路径时才使用具有相同标识符的边来进行掉头。" msgid "For the TRSP functions" msgstr "对于 TRSP 函数" @@ -8801,8 +7138,7 @@ msgstr "对于 TRSP 函数" msgid "Array of identifiers of destination vertices." msgstr "目标顶点的标识符数组。" -msgid "" -"There are several kinds of columns returned are depending of the function." +msgid "There are several kinds of columns returned are depending of the function." msgstr "根据函数的不同，返回的列有多种。" #, fuzzy @@ -8810,9 +7146,7 @@ msgid "Result columns for single path functions" msgstr "生成树函数的结果列" #, fuzzy -msgid "" -"Used in functions that return one path solution per departure and " -"destination." +msgid "Used in functions that return one path solution per departure and destination." msgstr "在返回一个路径解的函数中使用" msgid ":doc:`pgr_dijkstraNear`" @@ -8825,8 +7159,7 @@ msgstr "返回集合 |short-generic-result|" msgid "``path_seq``" msgstr "``path_seq``" -msgid "" -"Relative position in the path. Has value **1** for the beginning of a path." +msgid "Relative position in the path. Has value **1** for the beginning of a path." msgstr "路径中的相对位置。 路径开头的值为 **1** 。" msgid "Identifier of the starting vertex of the current path." @@ -8838,22 +7171,14 @@ msgstr "当前路径结束顶点的标识符。" msgid "Identifier of the node in the path from ``start_vid`` to ``end_vid``." msgstr "从 ``start_vid`` 到 ``end_vid`` 路径中节点的标识符。" -msgid "" -"Identifier of the edge used to go from ``node`` to the next node in the path " -"sequence. **-1** for the last node of the path." -msgstr "" -"用于从路径序列中的 ``node`` 到下一个节点的边的标识符。 **-1** 表示路径的最后" -"一个节点。" +msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence. **-1** for the last node of the path." +msgstr "用于从路径序列中的 ``node`` 到下一个节点的边的标识符。 **-1** 表示路径的最后一个节点。" -msgid "" -"Cost to traverse from ``node`` using ``edge`` to the next node in the path " -"sequence." +msgid "Cost to traverse from ``node`` using ``edge`` to the next node in the path sequence." msgstr "从使用 ``edge`` 的 ``node`` 遍历到路径序列中的下一个节点的成本。" #, fuzzy -msgid "" -"When ``start_vid`` or ``end_vid`` columns have negative values, the " -"identifier is for a Point." +msgid "When ``start_vid`` or ``end_vid`` columns have negative values, the identifier is for a Point." msgstr "当 start_vid 或 end_vid 列具有负值时，标识符用于点。" #, fuzzy @@ -8861,9 +7186,7 @@ msgid "Result columns for multiple paths functions" msgstr "生成树函数的结果列" #, fuzzy -msgid "" -"Used in functions that return many paths solutions per departure and " -"destination." +msgid "Used in functions that return many paths solutions per departure and destination." msgstr "在返回一个路径解的函数中使用" #, fuzzy @@ -8883,8 +7206,7 @@ msgstr "``path_id``" msgid "Path identifier." msgstr "路径标识符。" -msgid "" -"Has value **1** for the first of a path from ``start_vid`` to ``end_vid``." +msgid "Has value **1** for the first of a path from ``start_vid`` to ``end_vid``." msgstr "从 ``start_vid`` 到 ``end_vid`` 的第一个路径的值为 **1** 。" msgid "Result columns for cost functions" @@ -8894,9 +7216,7 @@ msgstr "成本函数结果列" msgid "Used by:" msgstr "用于：" -msgid "" -"When start_vid or end_vid columns have negative values, the identifier is " -"for a Point." +msgid "When start_vid or end_vid columns have negative values, the identifier is for a Point." msgstr "当 start_vid 或 end_vid 列具有负值时，标识符用于点。" msgid "Result columns for flow functions" @@ -8925,16 +7245,11 @@ msgstr "性能技巧" msgid "For the Routing functions" msgstr "对于路由功能" -msgid "" -"To get faster results bound the queries to an area of interest of routing." +msgid "To get faster results bound the queries to an area of interest of routing." msgstr "为了获得更快的结果，将查询绑定到路由感兴趣的区域。" -msgid "" -"In this example Use an inner query SQL that does not include some edges in " -"the routing function and is within the area of the results." -msgstr "" -"在此示例中，使用内部查询 SQL，该 SQL 不包括路由函数中的某些边并且位于结果区域" -"内。" +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 "Given this area:" msgstr "针对该区域：" @@ -8948,39 +7263,25 @@ msgstr "如何贡献" msgid "Wiki" msgstr "维基" -msgid "" -"Edit an existing `pgRouting Wiki `__ page." -msgstr "" -"编辑现有的 `pgRouting 维基 `__ " -"页面。" +msgid "Edit an existing `pgRouting Wiki `__ page." +msgstr "编辑现有的 `pgRouting 维基 `__ 页面。" msgid "Or create a new Wiki page" msgstr "或者创建一个新的维基 页面" -msgid "" -"Create a page on the `pgRouting Wiki `__" -msgstr "" -"在 `pgRouting 维基 `__ 上创建页" -"面" +msgid "Create a page on the `pgRouting Wiki `__" +msgstr "在 `pgRouting 维基 `__ 上创建页面" msgid "Give the title an appropriate name" msgstr "给标题起一个合适的名称" -msgid "" -"`Example `__" -msgstr "" -"`示例 `__" +msgid "`Example `__" +msgstr "`示例 `__" msgid "Adding Functionality to pgRouting" msgstr "为 pgRouting 添加功能" -msgid "" -"Consult the `developer's documentation `__" +msgid "Consult the `developer's documentation `__" msgstr "查阅 `开发者文档 `__" #, fuzzy @@ -8990,24 +7291,12 @@ msgstr "另请参阅" msgid "Installation" msgstr "安装" -msgid "" -"Instructions for downloading and installing binaries for different operating " -"systems, additional notes and corrections not included in this documentation " -"can be found in `Installation wiki `__" -msgstr "" -"有关下载和安装适用于不同操作系统的二进制文件的说明、本文档中未包含的其他注释" -"和更正，可以在 `安装维基 `__ 中找到" +msgid "Instructions for downloading and installing binaries for different operating systems, additional notes and corrections not included in this documentation can be found in `Installation wiki `__" +msgstr "有关下载和安装适用于不同操作系统的二进制文件的说明、本文档中未包含的其他注释和更正，可以在 `安装维基 `__ 中找到" #, fuzzy -msgid "" -"To use pgRouting, PostGIS needs to be installed, please read the information " -"about installation in this `Install Guide `__" -msgstr "" -"使用pgRouting需要安装PostGIS，请阅读本 `安装指南 `__ 中有关安装的信息" +msgid "To use pgRouting, PostGIS needs to be installed, please read the information about installation in this `Install Guide `__" +msgstr "使用pgRouting需要安装PostGIS，请阅读本 `安装指南 `__ 中有关安装的信息" msgid "Short Version" msgstr "简洁版本" @@ -9018,29 +7307,20 @@ msgstr "解压 tar 压缩文件" msgid "To compile assuming you have all the dependencies in your search path:" msgstr "假设您的搜索路径中有所有依赖项，则进行编译：" -msgid "" -"Once pgRouting is installed, it needs to be enabled in each individual " -"database you want to use it in." +msgid "Once pgRouting is installed, it needs to be enabled in each individual database you want to use it in." msgstr "安装 pgRouting 后，需要在您想要使用它的每个数据库中启用它。" msgid "Get the sources" msgstr "获取源码" -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 "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 "To download this release:" msgstr "要下载此版本：" -msgid "" -"Go to :ref:`install-short` for more instructions on extracting tar ball and " -"compiling pgRouting." -msgstr "" -"转到 :ref:`install-short` 以获取有关提取 tar 包和编译 pgRouting 的更多说明。" +msgid "Go to :ref:`install-short` for more instructions on extracting tar ball and compiling pgRouting." +msgstr "转到 :ref:`install-short` 以获取有关提取 tar 包和编译 pgRouting 的更多说明。" msgid "git" msgstr "git" @@ -9048,13 +7328,8 @@ msgstr "git" msgid "To download the repository" msgstr "下载存储库" -msgid "" -"Go to :ref:`install-short` for more instructions on compiling pgRouting " -"(there is no tar ball involved while downloading pgRouting repository from " -"GitHub)." -msgstr "" -"请参阅 :ref:`install-short` 获取有关编译 pgRouting 的更多说明（从 GitHub 下" -"载 pgRouting 存储库时不涉及 tar 文件）。" +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 "在数据库中启用和升级" @@ -9062,32 +7337,21 @@ msgstr "在数据库中启用和升级" msgid "Enabling the database" 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 "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 "" -"Checking PostGIS and pgRouting version after enabling them in the database." +msgid "Checking PostGIS and pgRouting version after enabling them in the database." msgstr "在数据库中启用 PostGIS 和 pgRouting 后检查它们的版本。" msgid "Upgrading the database" msgstr "升级数据库" -msgid "" -"To upgrade pgRouting in the database to version 4.0.0 use the following " -"command:" +#, fuzzy +msgid "To upgrade pgRouting in the database to version 4.1.0 use the following command:" msgstr "要将数据库中的 pgRouting 升级到 4.0.0 版本，请使用以下命令：" -msgid "" -"More information can be found in https://www.postgresql.org/docs/current/sql-" -"createextension.html" -msgstr "" -"更多信息可以在 https://www.postgresql.org/docs/current/sql-createextension." -"html 中找到" +msgid "More information can be found in https://www.postgresql.org/docs/current/sql-createextension.html" +msgstr "更多信息可以在 https://www.postgresql.org/docs/current/sql-createextension.html 中找到" msgid "Dependencies" msgstr "依赖" @@ -9095,23 +7359,16 @@ msgstr "依赖" msgid "Compilation Dependencies" msgstr "编译依赖" -msgid "" -"To be able to compile pgRouting, make sure that the following dependencies " -"are met:" +msgid "To be able to compile pgRouting, make sure that the following dependencies are met:" msgstr "为了能够编译 pgRouting，请确保满足以下依赖项：" msgid "C and C++0x compilers" msgstr "C 和 C++0x编译器" -msgid "" -"Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with C++03 " -"or C++11 standard support" -msgstr "" -"使用 Boost 1.56 到 Boost 1.74 进行编译需要具有 C++03 或 C++ 11 标准支持的 C +" -"+编译器" +msgid "Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with C++03 or C++11 standard support" +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" +msgid "Compiling with Boost 1.75 requires C++ Compiler with C++14 standard support" msgstr "使用 Boost 1.75 进行编译需要具有 C++ 14 标准支持的 C++ 编译器" #, fuzzy @@ -9189,14 +7446,10 @@ msgstr "构建目录与源目录不同" msgid "Configuring The Documentation" msgstr "配置文档" -msgid "" -"User and developers documentation are not build if prerequisites are not " -"found." +msgid "User and developers documentation are not build if prerequisites are not found." msgstr "" -msgid "" -"Most of the effort of the documentation has been on the HTML files. Some " -"variables for building documentation:" +msgid "Most of the effort of the documentation has been on the HTML files. Some variables for building documentation:" msgstr "文档的大部分工作都集中在 HTML 文件上。 构建文档的一些变量：" msgid "Variable" @@ -9278,9 +7531,7 @@ msgstr "使用 ``make`` 构建代码和文档" msgid "The following instructions start from ``path/to/pgrouting/build``" msgstr "以下说明从 *path/to/pgrouting/build* 开始" -msgid "" -"We have tested on several platforms, For installing or reinstalling all the " -"steps are needed." +msgid "We have tested on several platforms, For installing or reinstalling all the steps are needed." msgstr "我们已经在多个平台上进行了测试，安装或重新安装需要所有步骤。" msgid "Linux" @@ -9296,31 +7547,11 @@ msgstr "测试" msgid "Currently there is no :code:`make test` and testing is done as follows" msgstr "目前没有 :code:`make test` ，测试如下" -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 `__ 和广大用户社区的支持和维护。" +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 `__ 和广大用户社区的支持和维护。" -msgid "" -"pgRouting is part of `OSGeo Community Projects `__ from the `OSGeo Foundation `__ and included on `OSGeoLive `__." -msgstr "" -"pgRouting 是 `OSGeo Community Projects `__ 的一部分，隶属于 `OSGeo Foundation `__ ，并被包含在 `OSGeoLive `__ 。" +msgid "pgRouting is part of `OSGeo Community Projects `__ from the `OSGeo Foundation `__ and included on `OSGeoLive `__." +msgstr "pgRouting 是 `OSGeo Community Projects `__ 的一部分，隶属于 `OSGeo Foundation `__ ，并被包含在 `OSGeoLive `__ 。" msgid "Licensing" msgstr "许可" @@ -9334,40 +7565,25 @@ msgstr "**许可**" msgid "GNU General Public License v2.0 or later" msgstr "GNU 通用公共许可证 v2.0 或更高版本" -msgid "" -"Most features of pgRouting are available under `GNU General Public License " -"v2.0 or later `_." -msgstr "" -"pgRouting 的大多数功能都可以在 `GNU General Public License v2.0 or later " -"`_ 。" +msgid "Most features of pgRouting are available under `GNU General Public License v2.0 or later `_." +msgstr "pgRouting 的大多数功能都可以在 `GNU General Public License v2.0 or later `_ 。" msgid "Boost Software License - Version 1.0" msgstr "Boost 软件许可证 - 版本 1.0" -msgid "" -"Some Boost extensions are available under `Boost Software License - Version " -"1.0 `_." -msgstr "" -"一些 Boost 扩展可根据 `Boost Software License - Version 1.0 `_ 。" +msgid "Some Boost extensions are available under `Boost Software License - Version 1.0 `_." +msgstr "一些 Boost 扩展可根据 `Boost Software License - Version 1.0 `_ 。" msgid "MIT-X License" msgstr "MIT-X License" -msgid "" -"Some code contributed by iMaptools.com is available under MIT-X license." +msgid "Some code contributed by iMaptools.com is available under MIT-X license." msgstr "iMaptools.com 贡献的一些代码可在 MIT-X 许可证下使用。" -msgid "" -"The pgRouting Manual is licensed under a `Creative Commons Attribution-Share " -"Alike 3.0 License `_." -msgstr "" -"pgRouting 手册根据 `知识共享署名-相同方式共享 3.0 许可证获得许可 `_ 。" +msgid "The pgRouting Manual is licensed under a `Creative Commons Attribution-Share Alike 3.0 License `_." +msgstr "pgRouting 手册根据 `知识共享署名-相同方式共享 3.0 许可证获得许可 `_ 。" -msgid "" -"In general license information should be included in the header of each " -"source file." +msgid "In general license information should be included in the header of each source file." msgstr "一般来说，许可证信息应包含在每个源文件的标头中。" msgid "Contributors" @@ -9384,13 +7600,8 @@ msgstr "本次 v3.8.x 版本发布的个人贡献者（按字母顺序排列）" msgid "Bipasha Gayary, Fan Wu, Regina Obe, Saloni kumari, Vicky Vergara" msgstr "Aurélie Bousquet, Regina Obe, Vicky Vergara" -msgid "" -"And all the people that give us a little of their time making comments, " -"finding issues, making pull requests etc. in any of our products: " -"osm2pgrouting, pgRouting, pgRoutingLayer, workshop." -msgstr "" -"还有所有为我们的产品（osm2pgrouting、pgRouting、pgRoutingLayer、workshop）提" -"供意见、发现问题、提出拉取请求等帮助的开发者。" +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 "Translators (in alphabetical order)" msgstr "翻译（按字母顺序排列）" @@ -9416,11 +7627,8 @@ msgstr "" msgid "Corporate Sponsors in this release (in alphabetical order)" msgstr "本次发布中的企业赞助商（按字母顺序排列）" -msgid "" -"These are corporate entities that have contributed developer time, hosting, " -"or direct monetary funding to the pgRouting project:" -msgstr "" -"这些是为 pgRouting 项目贡献了开发人员时间、托管或直接提供资金的公司实体：" +msgid "These are corporate entities that have contributed developer time, hosting, or direct monetary funding to the pgRouting project:" +msgstr "这些是为 pgRouting 项目贡献了开发人员时间、托管或直接提供资金的公司实体：" msgid "`OSGeo `__" msgstr "`OSGeo `__" @@ -9444,33 +7652,8 @@ msgid "Individuals (in alphabetical order)" msgstr "个人贡献者（按字母排序）" #, fuzzy -msgid "" -"Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio " -"Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf " -"Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, " -"Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, " -"Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, " -"Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu " -"Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko " -"Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim " -"Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish " -"Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni " -"Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen " -"Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, " -"Vidhan Jain, Virginia Vergara, Yige Huang" -msgstr "" -"Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio " -"Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf " -"Hossain, Ashish Kumar, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, " -"Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, " -"Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, " -"Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, " -"Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin " -"Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul " -"Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith " -"Reddy, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, " -"Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, " -"Virginia Vergara, Yige Huang" +msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang" +msgstr "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, 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 "Corporate Sponsors (in alphabetical order)" msgstr "企业赞助商（按字母顺序排列）" @@ -9514,17 +7697,11 @@ msgstr "Versaterm Inc." msgid "More Information" 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 "The latest software, documentation and news items are available at the pgRouting web site https://pgrouting.org." +msgstr "最新的软件、文档和新闻可在 pgRouting 网站 https://pgrouting.org 上获取。" -msgid "" -"PostgreSQL database server at the PostgreSQL main site https://www." -"postgresql.org." -msgstr "" -"PostgreSQL 数据库服务器位于 PostgreSQL 主站点 https://www.postgresql.org。" +msgid "PostgreSQL database server at the PostgreSQL main site https://www.postgresql.org." +msgstr "PostgreSQL 数据库服务器位于 PostgreSQL 主站点 https://www.postgresql.org。" msgid "PostGIS extension at the PostGIS project web site https://postgis.net." msgstr "PostGIS 项目网站 https://postgis.net 上的 PostGIS 扩展。" @@ -9586,9 +7763,7 @@ msgstr "版本2.0.0" msgid "Official function." msgstr "官方函数。" -msgid "" -"The K shortest path routing algorithm based on Yen's algorithm. \"K\" is the " -"number of shortest paths desired." +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 "|Boost| Boost Graph Inside" @@ -9604,23 +7779,16 @@ msgid "Summary" msgstr "总结" msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vid**, **K**, [**options**])" -msgstr "" -"pgr_KSP(`Edges SQL`_, **start vid**, **end vid**, **K**, [**options**])" +msgstr "pgr_KSP(`Edges SQL`_, **start vid**, **end vid**, **K**, [**options**])" -msgid "" -"pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" -msgstr "" -"pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" +msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" +msgstr "pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" -msgid "" -"pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" -msgstr "" -"pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" +msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" +msgstr "pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" -msgid "" -"pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" -msgstr "" -"pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" +msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" +msgstr "pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" msgid "pgr_KSP(`Edges SQL`_, `Combinations SQL`_, **K**, [**options**])" msgstr "pgr_KSP(`Edges SQL`_, `Combinations SQL`_, **K**, [**options**])" @@ -9640,22 +7808,14 @@ msgstr "示例" msgid "Get 2 paths from :math:`6` to :math:`17` on a directed graph." msgstr "在有向图上获取从 :math:`6` 到 :math:`17` 的 2 条路径。" -msgid "" -"Get 2 paths from vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a " -"directed graph." +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 "" -"Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a " -"directed graph." +msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph." msgstr "在有向图中得到从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`17` 的2条路经。" -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条路" -"经。" +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条路经。" msgid "Using a combinations table on an directed graph" msgstr "在有向图上使用组合表" @@ -9687,12 +7847,8 @@ msgstr "当 ``false`` 时返回最多 K 条路径。" msgid "When ``true`` all the calculated paths while processing are returned." msgstr "当 ``true`` 时，返回处理时的所有计算路径。" -msgid "" -"Roughly, when the shortest path has ``N`` edges, the heap will contain about " -"than ``N * K`` paths for small value of ``K`` and ``K > 5``." -msgstr "" -"粗略地说，当最短路径有 ``N`` 个边时，对于 ``K`` 值较小且 ``K > 5`` ，堆将包含" -"大约 ``N * K`` 条路径。" +msgid "Roughly, when the shortest path has ``N`` edges, the heap will contain about than ``N * K`` paths for small value of ``K`` and ``K > 5``." +msgstr "粗略地说，当最短路径有 ``N`` 个边时，对于 ``K`` 值较小且 ``K > 5`` ，堆将包含大约 ``N * K`` 条路径。" msgid "Additional Examples" msgstr "其他示例" @@ -9706,9 +7862,7 @@ msgstr "还获取堆中的路径。" msgid "Get 2 paths using combinations table on an undirected graph" msgstr "使用无向图上的组合表获取 2 条路径" -msgid "" -"Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a " -"undirected graph." +msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a undirected graph." msgstr "在无向图中获取从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`17` 的2条路径。" msgid "https://en.wikipedia.org/wiki/K_shortest_path_routing" @@ -9726,26 +7880,14 @@ msgstr "可用性：" msgid "Version 3.2.1" msgstr "版本3.2.1" -msgid "" -"Metric Algorithm from `Boost library `__" -msgstr "" -"`Boost库 `__ 中" -"的度量算法" +msgid "Metric Algorithm from `Boost library `__" +msgstr "`Boost库 `__ 中的度量算法" msgid "Simulated Annealing Algorithm no longer supported" msgstr "Simulated Annealing算法不再受支持" -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 "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 "Version 2.3.0" msgstr "版本2.3.0" @@ -9757,12 +7899,8 @@ msgstr "" msgid "Negative costs are ignored." msgstr ":math:`0` 值被忽略" -msgid "" -"Can be Used with :doc:`costMatrix-category` functions preferably with " -"`directed => false`." -msgstr "" -"可以与 :doc:`costMatrix-category` 函数一起使用，最好使用 `directed => " -"false`。" +msgid "Can be Used with :doc:`costMatrix-category` functions preferably with `directed => false`." +msgstr "可以与 :doc:`costMatrix-category` 函数一起使用，最好使用 `directed => false`。" msgid "With ``directed => false``" msgstr "使用 ``directed => false``" @@ -9782,66 +7920,43 @@ msgstr "所有边上的旅行成本都遵循三角不等式。" msgid "When ``start_vid = 0 OR end_vid = 0``" msgstr "当 ``start_vid = 0 OR end_vid = 0``" -msgid "" -"The solutions generated are guaranteed to be *twice as long as the optimal " -"tour in the worst case*" +msgid "The solutions generated are guaranteed to be *twice as long as the optimal tour in the worst case*" msgstr "生成的解在最坏情况下保证 *不超过最优路径长度的两倍*" 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 "" -"It is **not guaranteed** that the solution will be, in the worst case, twice " -"as long as the optimal tour, due to the fact that `end_vid` is forced to be " -"in a fixed position." -msgstr "" -"由于 `end_vid` 被限制在固定位置，因此**无法保证**在最坏情况下，生成的解长度最" -"多为最优路线长度的两倍。" +msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour, due to the fact that `end_vid` is forced to be in a fixed position." +msgstr "由于 `end_vid` 被限制在固定位置，因此**无法保证**在最坏情况下，生成的解长度最多为最优路线长度的两倍。" msgid "With ``directed => true``" msgstr "当 ``directed => true``" -msgid "" -"It is **not guaranteed** that the solution will be, in the worst case, twice " -"as long as the optimal tour" +msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour" msgstr "**无法保证** 该解在最坏情况下不超过最优路径长度的两倍" msgid "is directed" msgstr "有向" -msgid "" -"some (or all) traveling costs on edges might not obey the triangle " -"inequality." +msgid "some (or all) traveling costs on edges might not obey the triangle inequality." msgstr "某些（或全部）边上的旅行成本可能不满足三角不等式。" -msgid "" -"As an undirected graph is required, the directed graph is transformed as " -"follows:" +msgid "As an undirected graph is required, the directed graph is transformed as follows:" msgstr "由于需要无向图，有向图变换如下：" -msgid "" -"edges `(u, v)` and `(v, u)` is considered to be the same edge (denoted `(u, " -"v)`" +msgid "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 "" -"边 `(u, v)` 的所有实例的 ``agg_cost`` 最小值将被视为边 `(u, v)` 的 " -"``agg_cost``" +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``" -msgid "" -"Some (or all) traveling costs on edges will still might not obey the " -"triangle inequality." +msgid "Some (or all) traveling costs on edges will still might not obey the triangle inequality." msgstr "边上的一些（或全部）旅行成本仍然可能不遵守三角不等式。" -msgid "" -"When the data does not come from an undirected graph or its not fully " -"connected:" +msgid "When the data does not come from an undirected graph or its not fully connected:" msgstr "" #, fuzzy @@ -9852,20 +7967,13 @@ msgstr "缺失值将使用 dijkstra 算法计算。" msgid "When the graph has more than one component:" msgstr "当图不连通时" -msgid "" -"``start_vid`` or ``end_vid`` are defined and are on the same component: the " -"TSP tour will happen on that component." +msgid "``start_vid`` or ``end_vid`` are defined and are on the same component: the TSP tour will happen on that component." msgstr "" -msgid "" -"``start_vid`` or ``end_vid`` are defined and are not on the same component: " -"the TSP tour will propose a tour that has both components where connecting " -"costs are estimated." +msgid "``start_vid`` or ``end_vid`` are defined and are not on the same component: the TSP tour will propose a tour that has both components where connecting costs are estimated." msgstr "" -msgid "" -"``start_vid`` or ``end_vid`` are not defined: the starting point could be on " -"any component and will include data only from that component." +msgid "``start_vid`` or ``end_vid`` are not defined: the starting point could be on any component and will include data only from that component." msgstr "" msgid "One cycle attempt to remove crossing edges is done to the TSP results." @@ -9880,11 +7988,8 @@ msgstr "返回 |tsp-result| 的集合" msgid "Using :doc:`pgr_dijkstraCostMatrix` to generate the matrix information" msgstr "使用 :doc:`pgr_dijkstraCostMatrix` 生成矩阵信息" -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 "**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 "`Matrix SQL`_ as described below" msgstr "`Matrix SQL`_ 如下所述" @@ -9910,9 +8015,7 @@ msgstr "**node**" msgid "Identifier of the node/coordinate/point." msgstr "节点/坐标/点的标识符。" -msgid "" -"Cost to traverse from the current ``node`` to the next ``node`` in the path " -"sequence." +msgid "Cost to traverse from the current ``node`` to the next ``node`` in the path sequence." msgstr "从路径序列中的当前 ``node`` 遍历到下一个 ``node`` 的成本。" msgid "``0`` for the last row in the tour sequence." @@ -9936,23 +8039,16 @@ msgstr "使用兴趣点（POI）生成非对称矩阵的步骤如下。" msgid "To generate an asymmetric matrix:" msgstr "生成非对称矩阵：" -msgid "" -"**Line 4** The ``side`` information of ``pointsOfInterset`` is ignored by " -"not including it in the query" -msgstr "" -"**Line 4** 通过未在查询中包括 ``pointsOfInterset`` 中的 ``side`` 信息而被忽略" +msgid "**Line 4** The ``side`` information of ``pointsOfInterset`` is ignored by not including it in the query" +msgstr "**Line 4** 通过未在查询中包括 ``pointsOfInterset`` 中的 ``side`` 信息而被忽略" msgid "**Line 6** Generating an asymmetric matrix with ``directed => true``" msgstr "**Line 6** 行 生成非对称矩阵， ``directed => true``" -msgid "" -":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered as " -"the ``agg_cost``" +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 "" -"The solution that can be larger than *twice as long as the optimal tour* " -"because:" +msgid "The solution that can be larger than *twice as long as the optimal tour* because:" msgstr "该解决方案的长度可能是*最佳行程的两倍以上*，因为：" msgid "Triangle inequality might not be satisfied." @@ -9964,17 +8060,11 @@ 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." +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 "" -"对于 :math:`17 \\rightarrow 10` 的成本值在矩阵中不存在，但使用的值是从 :math:" -"`10 \\rightarrow 17` 中获取的。" +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 "``pgr_TSPeuclidean``" msgstr "``pgr_TSPeuclidean``" @@ -9982,12 +8072,8 @@ msgstr "``pgr_TSPeuclidean``" msgid "``pgr_TSPeuclidean`` - Approximation using *metric* algorithm." msgstr "``pgr_TSPeuclidean`` - 使用 *metric* 算法进行近似计算。" -msgid "" -"Using `Boost: metric TSP approx `__" -msgstr "" -"使用 `Boost: metric TSP approx `__" +msgid "Using `Boost: metric TSP approx `__" +msgstr "使用 `Boost: metric TSP approx `__" msgid "Name change from pgr_eucledianTSP" msgstr "pgr_eucledianTSP 的名称更改" @@ -9998,17 +8084,13 @@ msgstr "新官方函数说明。" msgid "Results change depending on input order of the `Coordinates SQL`_" msgstr "" -msgid "" -"Any duplicated identifier will be ignored. The coordinates that will be kept " -"is arbitrarily." +msgid "Any duplicated identifier will be ignored. The coordinates that will be kept is arbitrarily." msgstr "任何重复的标识符都会被忽略，保留的坐标是任意选择的。" -msgid "" -"The coordinates are quite similar for the same identifier, for example ::" +msgid "The coordinates are quite similar for the same identifier, for example ::" msgstr "对于相同的标识符，坐标非常相似，例如 ::" -msgid "" -"The coordinates are quite different for the same identifier, for example ::" +msgid "The coordinates are quite different for the same identifier, for example ::" msgstr "对于相同的标识符，坐标有很大不同，例如::" msgid "pgr_TSPeuclidean(`Coordinates SQL`_, ``[start_id, end_id]``)" @@ -10041,15 +8123,8 @@ msgstr "坐标的Y值。" msgid "Test 29 cities of Western Sahara" msgstr "测试西撒哈拉29个城市" -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 个城市的数据集 `Western Sahara dataset " -"`__ 进行性能测试" +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 个城市的数据集 `Western Sahara dataset `__ 进行性能测试" msgid "Creating a table for the data and storing the data" msgstr "创建数据表并存储数据" @@ -10060,9 +8135,7 @@ msgstr "添加几何图形（用于视觉目的）" msgid "Total tour cost" msgstr "旅游总费用" -msgid "" -"Getting a total cost of the tour, compare the value with the length of an " -"optimal tour is 27603, given on the dataset" +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 "Getting a geometry of the tour" @@ -10071,14 +8144,8 @@ msgstr "获取游览的几何形状" msgid "Visual results" msgstr "视觉效果" -msgid "" -"Visually, The first image is the `optimal solution `__ and the second image is the solution " -"obtained with ``pgr_TSPeuclidean``." -msgstr "" -"从视觉上比较，第一个图展示了 `最优解 `__ ，而第二个图展示了使用 ``pgr_TSPeuclidean`` 所得到的" -"解。" +msgid "Visually, The first image is the `optimal solution `__ and the second image is the solution obtained with ``pgr_TSPeuclidean``." +msgstr "从视觉上比较，第一个图展示了 `最优解 `__ ，而第二个图展示了使用 ``pgr_TSPeuclidean`` 所得到的解。" msgid "``pgr_aStar`` — Shortest path using the A* algorithm." msgstr "``pgr_aStar`` — 使用 A* 算法的最短路径。" @@ -10116,9 +8183,7 @@ msgstr "pgr_aStar(Many to Many)" msgid "Signature change on pgr_aStar(One to One)" msgstr "pgr_aStar(One to One) 函数签名变更" -msgid "" -"The results are equivalent to the union of the results of the `pgr_aStar(` " -"`One to One`_ `)` on the:" +msgid "The results are equivalent to the union of the results of the `pgr_aStar(` `One to One`_ `)` on the:" msgstr "结果相当于 `pgr_aStar(` `One to One`_ `)` 结果的并集：" msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" @@ -10145,36 +8210,19 @@ msgstr "返回集合 |short-generic-result|" msgid "Optional parameters are `named parameters` and have a default value." msgstr "可选参数是`命名参数` 并具有默认值。" -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 "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 "" -"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 "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 "" -"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 "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 "" -"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 "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 "" -"Using a combinations table on a **directed** graph with factor :math:`0.5`." +msgid "Using a combinations table on a **directed** graph with factor :math:`0.5`." msgstr "在 **有向** 图上使用组合表，且使用factor :math:`0.5`。" msgid "Example 1" @@ -10198,8 +8246,7 @@ msgstr "手动指定的顶点组合。" msgid "``pgr_aStarCost``" msgstr "``pgr_aStarCost``" -msgid "" -"``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." +msgid "``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." msgstr "``pgr_aStarCost`` - 使用 A* 算法计算最短路径的总成本。" msgid "pgr_aStarCost(Combinations)" @@ -10209,14 +8256,10 @@ msgid "New proposed function." msgstr "新提议的函数。" #, fuzzy -msgid "" -"The ``pgr_aStarCost`` function summarizes the cost of the shortest path " -"using the A* algorithm." +msgid "The ``pgr_aStarCost`` function summarizes the cost of the shortest path using the A* algorithm." msgstr "``pgr_aStarCost`` 函数通过 A* 算法汇总最短路径的成本。" -msgid "" -"Let be the case the values returned are stored in a table, so the unique " -"index would be the pair: `(start_vid, end_vid)`" +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." @@ -10235,17 +8278,13 @@ msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" msgstr "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "" -"pgr_aStarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "" -"pgr_aStarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgid "" -"pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "" -"pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +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**])" @@ -10259,9 +8298,7 @@ msgstr "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [options])" msgid "``pgr_aStarCostMatrix``" msgstr "``pgr_aStarCostMatrix``" -msgid "" -"``pgr_aStarCostMatrix`` - Calculates the a cost matrix using :doc:" -"`pgr_aStar`." +msgid "``pgr_aStarCostMatrix`` - Calculates the a cost matrix using :doc:`pgr_aStar`." msgstr "``pgr_aStarCostMatrix`` - 使用 :doc:`pgr_aStar` 计算成本矩阵。" msgid "Using internally the :doc:`pgr_aStar` algorithm" @@ -10294,12 +8331,8 @@ msgstr "当图 **无向** 时，成本矩阵是对称的" msgid "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" msgstr "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" -msgid "" -"Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an " -"**undirected** graph using heuristic :math:`2`" -msgstr "" -"在 **无向** 图上，使用heuristic :math:`2`，对顶点 :math:`\\{5, 6, 10, 15\\}` " -"创建对称的成本矩阵" +msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph using heuristic :math:`2`" +msgstr "在 **无向** 图上，使用heuristic :math:`2`，对顶点 :math:`\\{5, 6, 10, 15\\}` 创建对称的成本矩阵" msgid "Use with :doc:`pgr_TSP`" msgstr "使用 :doc:`pgr_TSP`" @@ -10307,9 +8340,7 @@ msgstr "使用 :doc:`pgr_TSP`" msgid "``pgr_articulationPoints``" msgstr "``pgr_articulationPoints``" -msgid "" -"``pgr_articulationPoints`` - Return the articulation points of an undirected " -"graph." +msgid "``pgr_articulationPoints`` - Return the articulation points of an undirected graph." msgstr "``pgr_articulationPoints`` - 返回无向图的连接点。" msgid "Result columns change: ``seq`` is removed" @@ -10318,14 +8349,8 @@ msgstr "结果列更改：删除了 ``seq``" msgid "Version 2.5.0" msgstr "版本2.5.0" -msgid "" -"Those vertices that belong to more than one biconnected component are called " -"articulation points or, equivalently, cut vertices. Articulation points are " -"vertices whose removal would increase the number of connected components in " -"the graph. This implementation can only be used with an undirected graph." -msgstr "" -"那些属于多于一个双连通分量的顶点被称为关节点，或者等效地称为割点。关节点是指" -"那些如果被移除，会增加图中连接分量数量的顶点。这个实现仅适用于无向图。" +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 "Works for **undirected** graphs." msgstr "适用于 **无向** 图。" @@ -10351,19 +8376,11 @@ msgstr "红色节点是关节点。" msgid "Identifier of the vertex." msgstr "顶点的标识符。" -msgid "" -"`Boost: Biconnected components & articulation points `__" -msgstr "" -"`Boost: 双连通分量与割点 `__" +msgid "`Boost: Biconnected components & articulation points `__" +msgstr "`Boost: 双连通分量与割点 `__" -msgid "" -"wikipedia: `Biconnected component `__" -msgstr "" -"维基百科: `双连通分量 `__" +msgid "wikipedia: `Biconnected component `__" +msgstr "维基百科: `双连通分量 `__" #, fuzzy msgid "``pgr_bandwidth`` - Experimental" @@ -10372,14 +8389,10 @@ msgstr "``pgr_bipartite`` - 实验性" msgid "``pgr_bandwidth`` - Calculates the bandwidth of the graph" msgstr "" -msgid "" -"Bandwidth measures how \"spread out\" the connections are in a graph when " -"vertices are arranged in a linear order (like numbering them 1, 2, 3, etc.)." +msgid "Bandwidth measures how \"spread out\" the connections are in a graph when vertices are arranged in a linear order (like numbering them 1, 2, 3, etc.)." msgstr "" -msgid "" -"For each edge in the graph, calculate the distance between the vertex " -"numbers it connects" +msgid "For each edge in the graph, calculate the distance between the vertex numbers it connects" msgstr "" msgid "The bandwidth is the maximum of all these distances" @@ -10425,11 +8438,8 @@ msgid "Undirected graph with edges after optimization." msgstr "在有向图中，两条边都有方向性" #, fuzzy -msgid "" -"`Boost: bandwidth `_" -msgstr "" -"`Boost: 是否为二分图 `__" +msgid "`Boost: bandwidth `_" +msgstr "`Boost: 是否为二分图 `__" msgid "``pgr_bdAstar``" msgstr "``pgr_bdAstar``" @@ -10462,9 +8472,7 @@ msgid "Signature change on pgr_bdAstar(One to One)" msgstr "pgr_bdAstar(One to One) 函数签名变更" #, fuzzy -msgid "" -"The results are equivalent to the union of the results of pgr_bdAStar(One to " -"One) on the:" +msgid "The results are equivalent to the union of the results of pgr_bdAStar(One to One) on the:" msgstr "结果等效于以下情形中 pgr_bdAStar(One to One) 结果的并集：" msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" @@ -10485,39 +8493,27 @@ msgstr "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgid "``pgr_bdAstarCost``" msgstr "``pgr_bdAstarCost``" -msgid "" -"``pgr_bdAstarCost`` - Total cost of the shortest path using the " -"bidirectional A* algorithm." +msgid "``pgr_bdAstarCost`` - Total cost of the shortest path using the bidirectional A* algorithm." msgstr "``pgr_bdAstarCost`` - 使用双向 A* 算法计算的最短路径的总成本。" msgid "pgr_bdAstarCost(Combinations)" msgstr "pgr_bdAstarCost(组合)" #, fuzzy -msgid "" -"The ``pgr_bdAstarCost`` function summarizes the cost of the shortest path " -"using the bidirectional A* algorithm." +msgid "The ``pgr_bdAstarCost`` function summarizes the cost of the shortest path using the bidirectional A* algorithm." msgstr "``pgr_bdAstarCost`` 函数通过双向 A* 算法汇总最短路径的成本。" -msgid "" -"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgstr "" -"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgstr "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgid "" -"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "" -"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgid "" -"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "" -"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgid "" -"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "" -"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +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**])" @@ -10526,9 +8522,7 @@ msgid "``pgr_bdAstarCostMatrix``" msgstr "``pgr_bdAstarCostMatrix``" #, fuzzy -msgid "" -"``pgr_bdAstarCostMatrix`` - Calculates the cost matrix using :doc:" -"`pgr_bdAstar`." +msgid "``pgr_bdAstarCostMatrix`` - Calculates the cost matrix using :doc:`pgr_bdAstar`." msgstr "``pgr_bdAstarCostMatrix`` - 使用 :doc:`pgr_aStar` 计算成本矩阵。" #, fuzzy @@ -10538,9 +8532,7 @@ msgstr "内部使用 :doc:`pgr_bdAstar` 算法" msgid "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" msgstr "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" -msgid "" -"``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra " -"algorithm." +msgid "``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra algorithm." msgstr "``pgr_bdDijkstra`` — 返回使用双向 Dijkstra 算法计算的最短路径。" msgid "pgr_bdDijkstra(Combinations)" @@ -10559,25 +8551,17 @@ msgstr "pgr_bdDijkstra(Many to Many)" msgid "Signature change on pgr_bdDijkstra(One to One)" msgstr "函数的签名变更 pgr_bdDijsktra(One to One)" -msgid "" -"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "" -"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgid "" -"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "" -"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgid "" -"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "" -"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgid "" -"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "" -"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" @@ -10585,18 +8569,13 @@ msgstr "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgid "From vertex :math:`6` to vertex :math:`10` on a **directed** graph" msgstr "在 **有向** 图上从顶点 :math:`6` 到顶点 :math:`10`" -msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed** " -"graph" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed** graph" msgstr "在 **有向** 图上从顶点 :math:`6` 到顶点 :math:`\\{10, 17\\}`" -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** graph" +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** graph" msgstr "在 **有向** 图上从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`17`" -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an " -"**undirected** graph" +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an **undirected** graph" msgstr "在 **无向** 图上从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`\\{10, 17\\}`" msgid "Using a combinations table on an **undirected** graph" @@ -10608,45 +8587,27 @@ msgstr "https://en.wikipedia.org/wiki/Bidirectional_search" msgid "``pgr_bdDijkstraCost``" msgstr "``pgr_bdDijkstraCost``" -msgid "" -"``pgr_bdDijkstraCost`` — Returns the shortest path's cost using " -"Bidirectional Dijkstra algorithm." -msgstr "" -"``pgr_bdDijkstraCost`` — 返回使用双向 Dijkstra 算法计算最短路径的成本。" +msgid "``pgr_bdDijkstraCost`` — Returns the shortest path's cost using Bidirectional Dijkstra algorithm." +msgstr "``pgr_bdDijkstraCost`` — 返回使用双向 Dijkstra 算法计算最短路径的成本。" msgid "pgr_bdDijkstraCost(Combinations)" msgstr "pgr_bdDijkstraCost(组合)" #, fuzzy -msgid "" -"The ``pgr_bdDijkstraCost`` function summarizes the cost of the shortest path " -"using the bidirectional Dijkstra Algorithm." -msgstr "" -"``pgr_bdDijkstraCost`` 函数通过双向 Dijkstra 算法汇总最短路径的成本值。" +msgid "The ``pgr_bdDijkstraCost`` function summarizes the cost of the shortest path using the bidirectional Dijkstra Algorithm." +msgstr "``pgr_bdDijkstraCost`` 函数通过双向 Dijkstra 算法汇总最短路径的成本值。" -msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" -msgstr "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" +msgstr "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" -msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , " -"[``directed``])" -msgstr "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , " -"[``directed``])" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , [``directed``])" +msgstr "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , [``directed``])" -msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" -msgstr "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" +msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [ ``directed``])" msgstr "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [ ``directed``])" @@ -10657,29 +8618,23 @@ msgstr "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgid "``pgr_bdDijkstraCostMatrix``" msgstr "``pgr_bdDijkstraCostMatrix``" -msgid "" -"``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using :doc:" -"`pgr_bdDijkstra`." -msgstr "" -"``pgr_bdDijkstraCostMatrix`` - 使用 :doc:`pgr_bdDijkstra` 计算成本矩阵。" +msgid "``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_bdDijkstra`." +msgstr "``pgr_bdDijkstraCostMatrix`` - 使用 :doc:`pgr_bdDijkstra` 计算成本矩阵。" -msgid "" -"Using bidirectional Dijkstra algorithm, calculate and return a cost matrix." +msgid "Using bidirectional Dijkstra algorithm, calculate and return a cost matrix." msgstr "使用双向Dijkstra算法，计算并返回成本矩阵。" msgid "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" msgstr "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" -msgid "" -"Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an " -"**undirected** graph" -msgstr "" -"在一个 **无向** 图上的顶点集合 :math:`\\{5, 6, 10, 15\\}` 的对称成本矩阵" +msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph" +msgstr "在一个 **无向** 图上的顶点集合 :math:`\\{5, 6, 10, 15\\}` 的对称成本矩阵" msgid "Use with :doc:`pgr_TSP`." msgstr "与 :doc:`pgr_TSP` 一起使用。" -msgid "``pgr_bellmanFord - Experimental``" +#, fuzzy +msgid "``pgr_bellmanFord`` - Experimental" msgstr "``pgr_bellmanFord - 实验性``" msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm." @@ -10688,111 +8643,63 @@ msgstr "``pgr_bellmanFord`` — 使用 Bellman-Ford 算法计算的最短路径 msgid "pgr_bellmanFord(Combinations)" msgstr "pgr_bellmanFord(组合)" -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 "" -"Bellman-Ford算法以Richard Bellman和Lester Ford的名字命名，他们分别于1958年和" -"1956年首次发表了这个算法。它是一种图搜索算法，用于计算从起始顶点 " -"(``start_vid``) 到终点顶点 (``end_vid``) 的最短路径，其中一些边的权重可以为负" -"数。尽管它更加通用，但比Dijkstra算法更慢。这个实现可以用于有向图和无向图。" +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 "Bellman-Ford算法以Richard Bellman和Lester Ford的名字命名，他们分别于1958年和1956年首次发表了这个算法。它是一种图搜索算法，用于计算从起始顶点 (``start_vid``) 到终点顶点 (``end_vid``) 的最短路径，其中一些边的权重可以为负数。尽管它更加通用，但比Dijkstra算法更慢。这个实现可以用于有向图和无向图。" -msgid "" -"Process is valid for edges with both positive and negative edge weights." +msgid "Process is valid for edges with both positive and negative edge weights." msgstr "该过程对于具有正边权重和负边权重的边都有效。" -msgid "" -"When the start vertex and the end vertex are the same, there is no path. The " -"agg_cost would be :math:`0`." -msgstr "" -"当起始顶点和结束顶点相同时，不存在路径。聚合成本（agg_cost）将为 :math:`0`。" +msgid "When the start vertex and the end vertex are the same, there is no path. The agg_cost would be :math:`0`." +msgstr "当起始顶点和结束顶点相同时，不存在路径。聚合成本（agg_cost）将为 :math:`0`。" -msgid "" -"When the start vertex and the end vertex are different, and there exists a " -"path between them without having a *negative cycle*. The agg_cost would be " -"some finite value denoting the shortest distance between them." -msgstr "" -"当起始顶点和结束顶点不同，并且它们之间存在路径且不存在*负循环*时。 agg_cost " -"将是某个有限值，表示它们之间的最短距离。" +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 "" -"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 "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 "" -"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 "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 "" -"For optimization purposes, any duplicated value in the `start_vids` or " -"`end_vids` are ignored." +msgid "For optimization purposes, any duplicated value in the `start_vids` or `end_vids` are ignored." msgstr "出于优化目的，`start_vids`或 `end_vids` 中的任何重复值都将被忽略。" msgid "Running time: :math:`O(| start\\_vids | * ( V * E))`" msgstr "运行时间： :math:`O(| start\\_vids | * ( V * E))`" -msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "" -"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "" -"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "" -"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "" -"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgid "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])" #, fuzzy -msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph" msgstr "在 **有向** 图上从顶点 :math:`6` 到顶点 :math:`\\{10, 17\\}`" #, fuzzy -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph" +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph" msgstr "在 **有向** 图上从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`17`" #, fuzzy -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an " -"undirected graph" +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an undirected graph" msgstr "在 **无向** 图上从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`\\{10, 17\\}`" #, fuzzy msgid "Using a combinations table on an undirected graph" msgstr "在无向图上使用组合表。" -msgid "" -"`Boost: Bellman Ford `__" -msgstr "" -"`Boost: Belman Ford `__" +msgid "`Boost: Bellman Ford `__" +msgstr "`Boost: Belman Ford `__" msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" msgstr "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" @@ -10800,35 +8707,20 @@ msgstr "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" msgid "``pgr_betweennessCentrality`` - Experimental" msgstr "``pgr_betweennessCentrality`` - 实验性" -msgid "" -"``pgr_betweennessCentrality`` - Calculates the relative betweenness " -"centrality using Brandes Algorithm" +msgid "``pgr_betweennessCentrality`` - Calculates the relative betweenness centrality using Brandes Algorithm" msgstr "``pgr_betweennessCentrality`` - 使用布兰德斯算法计算相对中心度" msgid "Version 3.7.0" msgstr "版本 3.7.0" -msgid "" -"The Brandes Algorithm takes advantage of the sparse graphs for evaluating " -"the betweenness centrality score of all vertices." +msgid "The Brandes Algorithm takes advantage of the sparse graphs for evaluating the betweenness centrality score of all vertices." msgstr "Brandes 算法利用稀疏图来评估所有顶点的中心度得分。" -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 "" -"Betweenness centrality（介数中心性）衡量的是一个顶点在所有其他顶点对之间的最" -"短路径中的重要性。具有较高介数中心性得分的顶点，通常能够对网络产生显著的影" -"响，因为它们控制了通过它们的最短路径。" +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 "Betweenness centrality（介数中心性）衡量的是一个顶点在所有其他顶点对之间的最短路径中的重要性。具有较高介数中心性得分的顶点，通常能够对网络产生显著的影响，因为它们控制了通过它们的最短路径。" -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 "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 "This implementation work for both directed and undirected graphs." msgstr "该实现适用于directed 和undirected。" @@ -10860,9 +8752,7 @@ msgstr "介数中心性值位于括号内。" msgid "The leaf vertices have betweenness centrality :math:`0`." msgstr "叶子节点的介数中心性为 :math:`0`。" -msgid "" -"Betweenness centrality of vertex :math:`6` is higher than of vertex :math:" -"`10`." +msgid "Betweenness centrality of vertex :math:`6` is higher than of vertex :math:`10`." msgstr "顶点 :math:`6` 的间隔中心度高于顶点 :math:`10` 的间隔中心度。" msgid "Removing vertex :math:`6` will create three graph components." @@ -10877,23 +8767,16 @@ msgstr "``vid``" msgid "``centrality``" msgstr "``capacity``" -msgid "" -"Relative betweenness centrality score of the vertex (will be in range [0,1])" +msgid "Relative betweenness centrality score of the vertex (will be in range [0,1])" msgstr "该节点的相对介数中心性得分（范围为 [0,1]）" -msgid "" -"`Boost: betweenness centrality `_" -msgstr "" -"`Boost: 介数中心性 `_" +msgid "`Boost: betweenness centrality `_" +msgstr "`Boost: 介数中心性 `_" msgid "``pgr_biconnectedComponents``" msgstr "``pgr_biconnectedComponents``" -msgid "" -"``pgr_biconnectedComponents`` — Biconnected components of an undirected " -"graph." +msgid "``pgr_biconnectedComponents`` — Biconnected components of an undirected graph." msgstr "``pgr_biconnectedComponents`` — 无向图的双连通分量。" msgid "Result columns change:" @@ -10905,17 +8788,8 @@ msgstr "``n_seq`` 被删除" msgid "``seq`` changed type to ``BIGINT``" msgstr "``seq`` 将类型更改为 ``BIGINT``" -msgid "" -"The biconnected components of an undirected graph are the maximal subsets of " -"vertices such that the removal of a vertex from particular component will " -"not disconnect the component. Unlike connected components, vertices may " -"belong to multiple biconnected components. Vertices can be present in " -"multiple biconnected components, but each edge can only be contained in a " -"single biconnected component." -msgstr "" -"无向图的双连通分量是顶点的最大子集，因此从特定分量中删除顶点不会断开该分量。 " -"与连接组件不同，顶点可以属于多个双连接组件。 顶点可以存在于多个双连通分量中，" -"但每条边只能包含在单个双连通分量中。" +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 "无向图的双连通分量是顶点的最大子集，因此从特定分量中删除顶点不会断开该分量。 与连接组件不同，顶点可以属于多个双连接组件。 顶点可以存在于多个双连通分量中，但每条边只能包含在单个双连通分量中。" msgid "Components are described by edges." msgstr "组件由边描述。" @@ -10950,133 +8824,63 @@ msgstr "属于该 ``component`` 的边的标识符。" msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" msgstr "``pgr_binaryBreadthFirstSearch`` - 实验性" -msgid "" -"``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary " -"graph." +msgid "``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary graph." msgstr "``pgr_binaryBreadthFirstSearch`` — 返回二进制图中的最短路径。" -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'." +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_binaryBreadthFirstSearch(Combinations)" msgstr "pgr_binaryBreadthFirstSearch(组合)" #, fuzzy -msgid "" -"It is well-known that the shortest paths between a single source and all " -"other vertices can be found using Breadth First Search in :math:`O(|E|)` in " -"an unweighted graph, i.e. the distance is the minimal number of edges that " -"you need to traverse from the source to another vertex. We can interpret " -"such a graph also as a weighted graph, where every edge has the weight :math:" -"`1`. If not all edges in graph have the same weight, then we a more general " -"algorithm is needed, like Dijkstra's Algorithm which runs in :math:`O(|E|log|" -"V|)` time." -msgstr "" -"众所周知，在无权重图中，使用广度优先搜索（Breadth First Search）可以在 :math:" -"`O(|E|)` 内找到单个源点与所有其他顶点之间的最短路径，也就是说，距离是指从源点" -"到另一个顶点所需的最少边数。我们也可以把这样的图解释为加权图，其中每条边的权" -"重为 :math:`1`。如果图中不是所有边的权重都相同，我们就需要一种更通用的算法，" -"比如 Dijkstra 算法，它的运行时间为 :math:`O(|E|log|V||)`。" +msgid "It is well-known that the shortest paths between a single source and all other vertices can be found using Breadth First Search in :math:`O(|E|)` in an unweighted graph, i.e. the distance is the minimal number of edges that you need to traverse from the source to another vertex. We can interpret such a graph also as a weighted graph, where every edge has the weight :math:`1`. If not all edges in graph have the same weight, then we a more general algorithm is needed, like Dijkstra's Algorithm which runs in :math:`O(|E|log|V|)` time." +msgstr "众所周知，在无权重图中，使用广度优先搜索（Breadth First Search）可以在 :math:`O(|E|)` 内找到单个源点与所有其他顶点之间的最短路径，也就是说，距离是指从源点到另一个顶点所需的最少边数。我们也可以把这样的图解释为加权图，其中每条边的权重为 :math:`1`。如果图中不是所有边的权重都相同，我们就需要一种更通用的算法，比如 Dijkstra 算法，它的运行时间为 :math:`O(|E|log|V||)`。" -msgid "" -"However if the weights are more constrained, we can use a faster algorithm. " -"This algorithm, termed as 'Binary Breadth First Search' as well as '0-1 " -"BFS', is a variation of the standard Breadth First Search problem to solve " -"the SSSP (single-source shortest path) problem in :math:`O(|E|)`, if the " -"weights of each edge belongs to the set {0,X}, where 'X' is any non-negative " -"real integer." -msgstr "" -"然而，如果权重受到更多限制，我们可以使用一种更快的算法。这个算法被称为'二进制" -"广度优先搜索'，也称为'0-1 BFS'，它是标准广度优先搜索问题的一种变体，用于解决" -"单源最短路径（SSSP）问题，当每条边的权重属于集合{0，X}，其中'X'是任意非负实数" -"时，其时间复杂度为 :math:`O(|E|)`。" +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 "" -"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 "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 "Running time: :math:`O(| start\\_vids | * |E|)`" msgstr "运行时间： :math:`O(| start\\_vids | * |E|)`" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, " -"[``directed``])" -msgstr "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, " -"[``directed``])" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, " -"[``directed``])" -msgstr "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, " -"[``directed``])" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, " -"[``directed``])" -msgstr "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, " -"[``directed``])" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgid "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" -msgstr "" -"pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" +msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "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_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgid "" -"**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :" -"math:`1``)" -msgstr "" -"**注意:** 使用 :doc:`sampledata` 网络，因为所有权重都相同 (即为 :math:`1`)" +msgid "**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :math:`1``)" +msgstr "**注意:** 使用 :doc:`sampledata` 网络，因为所有权重都相同 (即为 :math:`1`)" -msgid "" -"`Boost: Breadth First Search `__" -msgstr "" -"`Boost: 广度优先搜索 `__" +msgid "`Boost: Breadth First Search `__" +msgstr "`Boost: 广度优先搜索 `__" msgid "https://cp-algorithms.com/graph/01_bfs.html" msgstr "https://cp-algorithms.com/graph/01_bfs.html" -msgid "" -"https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" -msgstr "" -"https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" +msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" +msgstr "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" msgid "``pgr_bipartite`` - Experimental" msgstr "``pgr_bipartite`` - 实验性" -msgid "" -"``pgr_bipartite`` — Disjoint sets of vertices such that no two vertices " -"within the same set are adjacent." +msgid "``pgr_bipartite`` — Disjoint sets of vertices such that no two vertices within the same set are adjacent." msgstr "``pgr_bipartite`` - 不相邻的顶点集合，同一集合中没有两个顶点相邻。" -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 "A bipartite graph is a graph with two sets of vertices which are connected to each other, but not within themselves. A bipartite graph is possible if the graph coloring is possible using two colors such that vertices in a set are colored with the same color." +msgstr "二方图是指有两组顶点的图，这两组顶点相互连接，但内部没有连接。如果可以使用两种颜色对图形着色，从而使一个集合中的顶点着色为相同的颜色，那么就可能是一个二方图。" msgid "The algorithm works in undirected graph only." msgstr "该算法只适用于无向图。" @@ -11084,13 +8888,8 @@ msgstr "该算法只适用于无向图。" msgid "The returned values are not ordered." msgstr "返回值没有排序。" -msgid "" -"The algorithm checks graph is bipartite or not. If it is bipartite then it " -"returns the node along with two colors `0` and `1` which represents two " -"different sets." -msgstr "" -"该算法检查图是否是二分图。 如果它是二分的，那么它返回节点以及代表两个不同集合" -"的两种颜色 `0` 和`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." +msgstr "该算法检查图是否是二分图。 如果它是二分的，那么它返回节点以及代表两个不同集合的两种颜色 `0` 和`1`。" msgid "If graph is not bipartite then algorithm returns empty set." msgstr "如果图不是两部分的，那么算法会返回空集。" @@ -11107,39 +8906,23 @@ msgstr "附加示例" msgid "The odd length cyclic graph can not be bipartite." msgstr "奇长循环图不可能是两部分的。" -msgid "" -"The edge :math:`5 \\rightarrow 1` will make subgraph with vertices :math:" -"`\\{1, 3, 7, 6, 5\\}` an odd length cyclic graph, as the cycle has 5 " -"vertices." -msgstr "" -"边 :math:`5 \\rightarrow 1` 将使顶点为 :math:`\\{1, 3, 7, 6, 5\\}` 的子图成为" -"奇数长度的循环图，因为循环有 5 个顶点。" +msgid "The edge :math:`5 \\rightarrow 1` will make subgraph with vertices :math:`\\{1, 3, 7, 6, 5\\}` an odd length cyclic graph, as the cycle has 5 vertices." +msgstr "边 :math:`5 \\rightarrow 1` 将使顶点为 :math:`\\{1, 3, 7, 6, 5\\}` 的子图成为奇数长度的循环图，因为循环有 5 个顶点。" msgid "Edges in blue represent odd length cycle subgraph." msgstr "蓝色边代表奇数长度循环子图。" -msgid "" -"`Boost: is_bipartite `__" -msgstr "" -"`Boost: 是否为二分图 `__" +msgid "`Boost: is_bipartite `__" +msgstr "`Boost: 是否为二分图 `__" -msgid "" -"`Wikipedia: bipartite graph `__" +msgid "`Wikipedia: bipartite graph `__" msgstr "`维基百科：二分图 `__" msgid "``pgr_boykovKolmogorov``" msgstr "``pgr_boykovKolmogorov``" -msgid "" -"``pgr_boykovKolmogorov`` — Calculates the flow on the graph edges that " -"maximizes the flow from the sources to the targets using Boykov Kolmogorov " -"algorithm." -msgstr "" -"`pgr_boykovKolmogorov`` - 使用 Boykov Kolmogorov 算法计算图边的流量，使从源到" -"目标的流量最大。" +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 算法计算图边的流量，使从源到目标的流量最大。" msgid "pgr_boykovKolmogorov(Combinations)" msgstr "pgr_boykovKolmogorov (组合)" @@ -11180,47 +8963,32 @@ msgstr "从顶点 :math:`11` 到顶点 :math:`\\{5, 10, 12\\}`" msgid "From vertices :math:`\\{11, 3, 17\\}` to vertex :math:`12`" msgstr "从顶点 :math:`\\{11, 3, 17\\}` 到顶点 :math:`12`" -msgid "" -"From vertices :math:`\\{11, 3, 17\\}` to vertices :math:`\\{5, 10, 12\\}`" +msgid "From vertices :math:`\\{11, 3, 17\\}` to vertices :math:`\\{5, 10, 12\\}`" msgstr "从顶点 :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\\}` 的结果。" +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\\}` 的结果。" -msgid "" -"`Boost: Boykov Kolmogorov max flow `__" -msgstr "" -"`Boost: Boykov-Kolmogorov 最大流算法 `__" +msgid "`Boost: Boykov Kolmogorov max flow `__" +msgstr "`Boost: Boykov-Kolmogorov 最大流算法 `__" msgid "``pgr_breadthFirstSearch`` - Experimental" msgstr "``pgr_breadthFirstSearch`` - 实验性" -msgid "" -"``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth " -"First Search algorithm." +msgid "``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth First Search algorithm." msgstr "``pgr_breadthFirstSearch`` — 使用广度优先搜索算法返回遍历顺序。" #, fuzzy msgid "Version 4.0.0:" msgstr "Version 4.0.0" -msgid "" -"Provides the Breadth First Search traversal order from a root vertex to a " -"particular depth." +msgid "Provides the Breadth First Search traversal order from a root vertex to a particular depth." msgstr "提供从根顶点到特定深度的广度优先搜索遍历顺序。" msgid "The implementation will work on any type of graph." msgstr "该实现适用于任何类型的图。" -msgid "" -"Provides the Breadth First Search traversal order from a source node to a " -"target depth level." +msgid "Provides the Breadth First Search traversal order from a source node to a target depth level." msgstr "提供从源节点到目标深度级别的广度优先搜索遍历顺序。" msgid "Running time: :math:`O(E + V)`" @@ -11235,18 +9003,11 @@ msgstr "pgr_breadthFirstSearch(`Edges SQL`_, **root vids**, [**options**])" msgid "**options:** ``[max_depth, directed]``" msgstr "**options:** ``[max_depth, directed]``" -msgid "" -"From root vertex :math:`6` on a **directed** graph with edges in ascending " -"order of ``id``" -msgstr "" -"从根顶点 :math:`6` 开始，该顶点位于一个 **有向** 图中，其边按 ``id`` 升序排列" +msgid "From root vertex :math:`6` on a **directed** graph with edges in ascending order of ``id``" +msgstr "从根顶点 :math:`6` 开始，该顶点位于一个 **有向** 图中，其边按 ``id`` 升序排列" -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`` 升序排列" +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`` 升序排列" msgid "DFS optional parameters" msgstr "DFS 可选参数" @@ -11260,11 +9021,8 @@ msgstr "与 `单个顶点`_ 相同，边按 ``id`` 降序排列。" msgid "The resulting traversal is different." msgstr "由此产生的遍历是不同的。" -msgid "" -"The left image shows the result with ascending order of ids and the right " -"image shows with descending order of the edge identifiers." -msgstr "" -"左图显示的是按 ID 升序排列的结果，右图显示的是按边缘标识符降序排列的结果。" +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 "|ascending| |descending|" msgstr "|ascending| |descending|" @@ -11275,12 +9033,8 @@ msgstr "升序" msgid "descending" msgstr "降序" -msgid "" -"`Wikipedia: Breadth First Search algorithm `__" -msgstr "" -"`维基百科：广度优先搜索算法 `__" +msgid "`Wikipedia: Breadth First Search algorithm `__" +msgstr "`维基百科：广度优先搜索算法 `__" msgid "``pgr_bridges``" msgstr "``pgr_bridges``" @@ -11288,13 +9042,8 @@ msgstr "``pgr_bridges``" msgid "``pgr_bridges`` - Return the bridges of an undirected graph." msgstr "``pgr_bridges`` - 返回无向图的桥。" -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 "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 "``edge`` ascending" msgstr "``edge`` 升序" @@ -11317,22 +9066,14 @@ msgstr "作为桥的边的标识符。" msgid "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" msgstr "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" -msgid "" -"`Boost: Connected components `__" -msgstr "" -"`Boost: 已连接的组件 `__" - +msgid "`Boost: Connected components `__" +msgstr "`Boost: 已连接的组件 `__" + msgid "``pgr_chinesePostman`` - Experimental" msgstr "``pgr_chinesePostman`` - 实验性" -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 "``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 "Returns ``EMPTY SET`` on a disconnected graph" msgstr "在一个不连通的图上返回 ``EMPTY SET``" @@ -11349,12 +9090,8 @@ msgstr "返回集合 ``(seq, node, edge, cost, agg_cost)``" msgid "Sequential value starting from ``1``" msgstr "从 ``1`` 开始的顺序值" -msgid "" -"Identifier of the edge used to go from ``node`` to the next node in the path " -"sequence. ``-1`` for the last node of the path." -msgstr "" -"用于从路径序列中的 ``node`` 到下一个节点的边的标识符。 ``-1`` 表示路径的最后" -"一个节点。" +msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence. ``-1`` for the last node of the path." +msgstr "用于从路径序列中的 ``node`` 到下一个节点的边的标识符。 ``-1`` 表示路径的最后一个节点。" msgid "Aggregate cost from ``start_v`` to ``node``." msgstr "从 ``start_v`` 到 ``node`` 的总成本。" @@ -11362,13 +9099,8 @@ msgstr "从 ``start_v`` 到 ``node`` 的总成本。" msgid "``pgr_chinesePostmanCost`` - Experimental" msgstr "``pgr_chinesePostmanCost`` - 实验性" -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 "``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 "Return value when the graph if disconnected" msgstr "当图是不连通的时候返回的数值" @@ -11388,16 +9120,10 @@ msgstr "一个回路路径的最小成本。" msgid "``pgr_connectedComponents``" msgstr "``pgr_connectedComponents``" -msgid "" -"``pgr_connectedComponents`` — Connected components of an undirected graph " -"using a DFS-based approach." -msgstr "" -"``pgr_connectedComponents`` — 使用基于深度优先搜索（DFS）的方法计算无向图的连" -"通分量。" +msgid "``pgr_connectedComponents`` — Connected components of an undirected graph using a DFS-based approach." +msgstr "``pgr_connectedComponents`` — 使用基于深度优先搜索（DFS）的方法计算无向图的连通分量。" -msgid "" -"A connected component of an undirected graph is a set of vertices that are " -"all reachable from each other." +msgid "A connected component of an undirected graph is a set of vertices that are all reachable from each other." msgstr "无向图的连通部分是指相互之间均可到达的顶点集合。" msgid "Components are described by vertices" @@ -11424,19 +9150,13 @@ msgstr "属于该 ``组件`` 的顶点的标识符。" msgid "Connecting disconnected components" msgstr "连接不连通的组件" -msgid "" -"wikipedia: `Connected component `__" -msgstr "" -"维基百科: `连通分量 `__" +msgid "wikipedia: `Connected component `__" +msgstr "维基百科: `连通分量 `__" msgid "``pgr_contraction``" msgstr "``pgr_contraction``" -msgid "" -"``pgr_contraction`` — Performs graph contraction and returns the contracted " -"vertices and edges." +msgid "``pgr_contraction`` — Performs graph contraction and returns the contracted vertices and edges." msgstr "``pgr_contraction`` — 执行图收缩操作并返回收缩后的顶点和边。" msgid "Version 3.8.0" @@ -11445,18 +9165,13 @@ msgstr "Version 3.8.0" msgid "New signature:" msgstr "新签名：" -msgid "" -"Previously compulsory parameter **Contraction order** is now optional with " -"name ``methods``." -msgstr "" -"之前必需的参数 **Contraction order** 现在已变为可选参数，并更名为 " -"``methods`` 。" +msgid "Previously compulsory parameter **Contraction order** is now optional with name ``methods``." +msgstr "之前必需的参数 **Contraction order** 现在已变为可选参数，并更名为 ``methods`` 。" msgid "New name and order of optional parameters." msgstr "可选参数的新名称和顺序。" -msgid "" -"Deprecated signature pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgid "Deprecated signature pgr_contraction(text,bigint[],integer,bigint[],boolean)" msgstr "已弃用签名 pgr_contraction(text,bigint[],integer,bigint[],boolean)" msgid "Name change from ``pgr_contractGraph``" @@ -11465,13 +9180,8 @@ msgstr "``pgr_contractGraph`` 的名称更改" msgid "Bug fixes" msgstr "Bug修复" -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 "" -"收缩通过移除部分顶点和边来减小图的大小，例如，可以添加代表原始边序列的边，从" -"而减少图算法所用的总时间和空间。" +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 "收缩通过移除部分顶点和边来减小图的大小，例如，可以添加代表原始边序列的边，从而减少图算法所用的总时间和空间。" msgid "Does not return the full contracted graph." msgstr "不返回完整的收缩图。" @@ -11497,9 +9207,7 @@ msgstr "列 ``id`` 升序排列。" msgid "column ``id`` with negative numbers descending when its a new edge." msgstr "列 ``id`` 中的负数，当它是一条新边时，负数依次递减。" -msgid "" -"Currently there are two types of contraction methods included in this " -"function:" +msgid "Currently there are two types of contraction methods included in this function:" msgstr "目前，该功能包含两种收缩方法：" msgid "Dead End Contraction. See :doc:`pgr_contractionDeadEnd`." @@ -11598,9 +9306,7 @@ msgstr "当 ``type`` = **'e'** 时。" msgid "Decreasing sequence starting from **-1**." msgstr "从 **-1** 开始递减序列。" -msgid "" -"Representing a pseudo `id` as is not incorporated in the set of original " -"edges." +msgid "Representing a pseudo `id` as is not incorporated in the set of original edges." msgstr "表示未包含在原始边集中的伪`id` 。" msgid "``contracted_vertices``" @@ -11612,22 +9318,13 @@ msgstr "收缩顶点标识符数组。" msgid "When ``type`` = **'v'**: :math:`-1`" msgstr "当 ``type`` = **'v'**: :math:`-1` 时" -msgid "" -"When ``type`` = **'e'**: Identifier of the source vertex of the current edge " -"(``source``, ``target``)." -msgstr "" -"当 ``type`` = **'e'** 时：当前边 (``source``, ``target``) 的source顶点标识" -"符。" +msgid "When ``type`` = **'e'**: Identifier of the source vertex of the current edge (``source``, ``target``)." +msgstr "当 ``type`` = **'e'** 时：当前边 (``source``, ``target``) 的source顶点标识符。" -msgid "" -"When ``type`` = **'e'**: Identifier of the target vertex of the current edge " -"(``source``, ``target``)." -msgstr "" -"当 ``type`` = **'e'** 时：当前边 (``source``, ``target``) 的target 顶点标识" -"符。" +msgid "When ``type`` = **'e'**: Identifier of the target vertex of the current edge (``source``, ``target``)." +msgstr "当 ``type`` = **'e'** 时：当前边 (``source``, ``target``) 的target 顶点标识符。" -msgid "" -"When ``type`` = **'e'**: Weight of the current edge (``source``, ``target``)." +msgid "When ``type`` = **'e'**: Weight of the current edge (``source``, ``target``)." msgstr "当 ``type`` = **'e'** 时：当前边 (``source``, ``target``) 的权重。" msgid "Only dead end contraction" @@ -11639,14 +9336,8 @@ msgstr "仅线性收缩" msgid "The cycle" msgstr "循环" -msgid "" -"Contracting a graph can be done with more than one operation. The order of " -"the operations affect the resulting contracted graph, after applying one " -"operation, the set of vertices that can be contracted by another operation " -"changes." -msgstr "" -"对图进行收缩可通过多次操作实现，操作顺序会影响最终收缩图的结果——每执行一次操" -"作后，可被后续操作收缩的顶点集合将发生变化。" +msgid "Contracting a graph can be done with more than one operation. The order of the operations affect the resulting contracted graph, after applying one operation, the set of vertices that can be contracted by another operation changes." +msgstr "对图进行收缩可通过多次操作实现，操作顺序会影响最终收缩图的结果——每执行一次操作后，可被后续操作收缩的顶点集合将发生变化。" msgid "This implementation cycles ``cycles`` times through the ``methods`` ." msgstr "这种实现方式在 ``methods`` 中循环 ``cycles`` 次。" @@ -11654,9 +9345,7 @@ msgstr "这种实现方式在 ``methods`` 中循环 ``cycles`` 次。" msgid "Contracting sample data" msgstr "收缩示例数据" -msgid "" -"In this section, building and using a contracted graph will be shown by " -"example." +msgid "In this section, building and using a contracted graph will be shown by example." msgstr "在本节中，将通过示例展示构建和使用收缩图。" msgid "The :doc:`sampledata` for an undirected graph is used" @@ -11671,18 +9360,11 @@ msgstr "数据库中图的构建" msgid "The original graph:" msgstr "原始图：" -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 "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 "" -"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 "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 "After doing the dead end contraction operation:" msgstr "进行死端收缩操作后：" @@ -11696,9 +9378,7 @@ msgstr "在数据库上创建收缩图的过程：" msgid "Add additional columns" msgstr "添加附加列" -msgid "" -"Adding extra columns to the edges and vertices tables. In this documentation " -"the following will be used:" +msgid "Adding extra columns to the edges and vertices tables. In this documentation the following will be used:" msgstr "在边表和顶点表中添加额外列。在本文档中将使用以下内容：" msgid "Column." @@ -11713,13 +9393,10 @@ msgstr "``is_contracted``" msgid "On the vertex table" msgstr "在顶点表上" -msgid "" -"when ``true`` the vertex is contracted, its not part of the contracted graph." +msgid "when ``true`` the vertex is contracted, its not part of the contracted graph." msgstr "当 ``true`` 时，顶点收缩，它不是收缩图的一部分。" -msgid "" -"when ``false`` the vertex is not contracted, its part of the contracted " -"graph." +msgid "when ``false`` the vertex is not contracted, its part of the contracted graph." msgstr "当 ``false`` 时，顶点不收缩，它是收缩图的一部分。" msgid "``is_new``" @@ -11728,14 +9405,10 @@ msgstr "``is_new``" msgid "On the edge table" msgstr "在边表上" -msgid "" -"when ``true`` the edge was generated by the contraction algorithm. its part " -"of the contracted graph." +msgid "when ``true`` the edge was generated by the contraction algorithm. its part of the contracted graph." msgstr "当 ``true`` 时，边缘由收缩算法生成。 它是收缩图的一部分。" -msgid "" -"when ``false`` the edge is an original edge, might be or not part of the " -"contracted graph." +msgid "when ``false`` the edge is an original edge, might be or not part of the contracted graph." msgstr "当 ``false`` 时，边是原始边，可能是也可能不是收缩图的一部分。" msgid "Store contraction information" @@ -11747,13 +9420,10 @@ msgstr "将收缩结果存储至数据表。" msgid "Update the edges and vertices tables" msgstr "更新边线与顶点表" -msgid "" -"Use ``is_contracted`` column to indicate the vertices that are contracted." +msgid "Use ``is_contracted`` column to indicate the vertices that are contracted." msgstr "使用 ``is_contracted`` 列来指示收缩的顶点。" -msgid "" -"Fill ``contracted_vertices`` with the information from the results that " -"belong to the vertices." +msgid "Fill ``contracted_vertices`` with the information from the results that belong to the vertices." msgstr "将属于顶点的结果信息填充至 ``contracted_vertices`` 表中。" msgid "Insert the new edges generated by pgr_contraction." @@ -11774,18 +9444,10 @@ msgstr "视觉效果：" msgid "Using the contracted graph" msgstr "使用收缩图" -msgid "" -"Depending on the final application the graph is to be prepared. In this " -"example the final application will be to calculate the cost from two " -"vertices in the original graph by using the contracted graph with " -"``pgr_dijkstraCost``" -msgstr "" -"根据最终应用的需求，图需要进行预处理。在本示例中，最终应用是使用收缩图通过 " -"``pgr_dijkstraCost`` 计算原始图中两个顶点之间的成本" +msgid "Depending on the final application the graph is to be prepared. In this example the final application will be to calculate the cost from two vertices in the original graph by using the contracted graph with ``pgr_dijkstraCost``" +msgstr "根据最终应用的需求，图需要进行预处理。在本示例中，最终应用是使用收缩图通过 ``pgr_dijkstraCost`` 计算原始图中两个顶点之间的成本" -msgid "" -"There are three cases when calculating the shortest path between a given " -"source and target in a contracted graph:" +msgid "There are three cases when calculating the shortest path between a given source and target in a contracted graph:" msgstr "计算收缩图中给定源和目标之间的最短路径时，存在三种情况：" msgid "Case 1: Both source and target belong to the contracted graph." @@ -11806,22 +9468,17 @@ msgstr "创建收缩图的视图（或表）：" msgid "Create the function that will use the contracted graph." msgstr "创建使用收缩图的函数。" -msgid "" -"Case 2: Source and/or target belong to an edge that has contracted vertices." +msgid "Case 2: Source and/or target belong to an edge that has contracted vertices." msgstr "情况 2：源点和/或目标点位于含收缩顶点的边线上。" -msgid "" -"Case 3: Source and/or target belong to a vertex that has been contracted." +msgid "Case 3: Source and/or target belong to a vertex that has been contracted." msgstr "情况 3：源点和/或目标点属于已被收缩的顶点。" msgid "``pgr_contractionDeadEnd`` - Proposed" msgstr "``pgr_contractionDeadEnd`` - 提议中" -msgid "" -"``pgr_contractionDeadEnd`` — Performs graph contraction and returns the " -"contracted vertices and edges." -msgstr "" -"``pgr_contractionDeadEnd`` — 执行图收缩操作，并返回收缩后的顶点集与边线集。" +msgid "``pgr_contractionDeadEnd`` — Performs graph contraction and returns the contracted vertices and edges." +msgstr "``pgr_contractionDeadEnd`` — 执行图收缩操作，并返回收缩后的顶点集与边线集。" msgid "A node is considered a dead end node when:" msgstr "在下列情况下，节点被视为断头节点：" @@ -11838,8 +9495,7 @@ msgstr "在有向图上：" msgid "When there is only one adjacent vertex or" msgstr "当只有一个相邻顶点或" -msgid "" -"When all edges are incoming regardless of the number of adjacent vertices." +msgid "When all edges are incoming regardless of the number of adjacent vertices." msgstr "无论相邻顶点的数量多少，所有边都是进入的。" msgid "pgr_contractionDeadEnd(`Edges SQL`_, [**options**])" @@ -11890,8 +9546,7 @@ msgstr "有向图上的死端顶点" msgid "The green nodes are dead end nodes" msgstr "绿色节点为断头节点" -msgid "" -"The blue nodes have an unlimited number of incoming and/or outgoing edges." +msgid "The blue nodes have an unlimited number of incoming and/or outgoing edges." msgstr "蓝色节点具有无限数量的传入和/或传出边缘。" msgid "Node" @@ -11954,41 +9609,25 @@ msgstr ":math:`1,2,3,4,5`" msgid "Many adjacent nodes." msgstr "许多相邻节点。" -msgid "" -"Has more than one adjacent node and some edges are incoming and some are " -"outgoing." +msgid "Has more than one adjacent node and some edges are incoming and some are outgoing." msgstr "有一个以上的相邻节点，有些边是入边，有些是出边。" -msgid "" -"From above, nodes :math:`\\{6, 7, 9\\}` are dead ends because the total " -"number of adjacent vertices is one." -msgstr "" -"从上面可以看出，节点 :math:`\\{6, 7, 9\\}` 是断头节点，因为其邻接顶点的数量" -"为 1。" +msgid "From above, nodes :math:`\\{6, 7, 9\\}` are dead ends because the total number of adjacent vertices is one." +msgstr "从上面可以看出，节点 :math:`\\{6, 7, 9\\}` 是断头节点，因为其邻接顶点的数量为 1。" -msgid "" -"When there are more than one adjacent vertex, all edges need to be all " -"incoming edges otherwise it is not a dead end." +msgid "When there are more than one adjacent vertex, all edges need to be all incoming edges otherwise it is not a dead end." msgstr "当有多个相邻顶点时，所有的边都必须是所有进入的边，否则就不是死胡同。" msgid "Step by step dead end contraction" msgstr "逐步断头节点收缩" -msgid "" -"The dead end contraction will stop until there are no more dead end nodes. " -"For example, from the following graph where :math:`3` is the dead end node:" -msgstr "" -"断头节点收缩将持续执行，直至图中不再存在断头节点。例如下图中 :math:`3` 为断头" -"节点时的处理流程：" +msgid "The dead end contraction will stop until there are no more dead end nodes. For example, from the following graph where :math:`3` is the dead end node:" +msgstr "断头节点收缩将持续执行，直至图中不再存在断头节点。例如下图中 :math:`3` 为断头节点时的处理流程：" -msgid "" -"After contracting :math:`3`, node :math:`2` is now a dead end node and is " -"contracted:" +msgid "After contracting :math:`3`, node :math:`2` is now a dead end node and is contracted:" msgstr "在收缩 :math:`3` 后，节点 :math:`2` 变成了断头节点，并被继续收缩：" -msgid "" -"After contracting :math:`2`, stop. Node :math:`1` has the information of " -"nodes that were contracted." +msgid "After contracting :math:`2`, stop. Node :math:`1` has the information of nodes that were contracted." msgstr "收缩 :math:`2` 后，停止。节点 :math:`1` 包含已收缩节点的信息。" msgid "Creating the contracted graph" @@ -12018,98 +9657,35 @@ msgstr "当出发地和目的地均不在收缩图中时使用" msgid "``pgr_contractionHierarchies`` - Experimental" msgstr "``pgr_contractionHierarchies`` - 实验性" -msgid "" -"``pgr_contractionHierarchies`` — Performs graph contraction according to the " -"contraction hierarchies method and returns the contracted vertices and " -"shortcut edges created." -msgstr "" -"``pgr_contractionHierarchies`` — 根据收缩层级方法执行图收缩，并返回收缩后的顶" -"点和生成的快捷边。" +msgid "``pgr_contractionHierarchies`` — Performs graph contraction according to the contraction hierarchies method and returns the contracted vertices and shortcut edges created." +msgstr "``pgr_contractionHierarchies`` — 根据收缩层级方法执行图收缩，并返回收缩后的顶点和生成的快捷边。" -msgid "" -"The contraction hierarchies method builds, from an initial order of the " -"vertices, a hierarchical order, giving priority to some vertices during the " -"processing of label fixing of shortest paths algorithms. Furthermore, the " -"contraction hierarchies algorithm adds shortcut edges in the graph, that " -"helps the shortest paths algorithm to follow the created hierarchical graph " -"structure." -msgstr "" -"收缩层次法是从顶点的初始顺序出发建立层次顺序的，在最短路径算法的标签固定处理" -"过程中优先考虑某些顶点。此外，收缩层次算法还能在图中添加捷径边，帮助最短路径" -"算法遵循所创建的层次图结构。" +msgid "The contraction hierarchies method builds, from an initial order of the vertices, a hierarchical order, giving priority to some vertices during the processing of label fixing of shortest paths algorithms. Furthermore, the contraction hierarchies algorithm adds shortcut edges in the graph, that helps the shortest paths algorithm to follow the created hierarchical graph structure." +msgstr "收缩层次法是从顶点的初始顺序出发建立层次顺序的，在最短路径算法的标签固定处理过程中优先考虑某些顶点。此外，收缩层次算法还能在图中添加捷径边，帮助最短路径算法遵循所创建的层次图结构。" -msgid "" -"The idea of the hierarchy is to put at a high priority level vertices that " -"belong to the long distance network (highways for example in a road network) " -"and to a low level of priority nodes that belong to the short distance " -"network (arterials or secondary roads for example in road networks)." -msgstr "" -"层次结构的原理是将属于长距离网络（例如公路网络中的高速公路）的顶点置于高优先" -"级，而将属于短距离网络（例如公路网络中的主干道或次干路）的节点置于低优先级。" +msgid "The idea of the hierarchy is to put at a high priority level vertices that belong to the long distance network (highways for example in a road network) and to a low level of priority nodes that belong to the short distance network (arterials or secondary roads for example in road networks)." +msgstr "层次结构的原理是将属于长距离网络（例如公路网络中的高速公路）的顶点置于高优先级，而将属于短距离网络（例如公路网络中的主干道或次干路）的节点置于低优先级。" -msgid "" -"The contraction hierarchies algorithm makes the assumption that there is " -"already a valuable vertices order that is used to initialize the contraction " -"process. As in most cases there is no valuable initial node ordering, we use " -"the order given by vertices ID. Then, the contraction process is made on the " -"basis of this first order to give the final hierarchy." -msgstr "" -"收缩层次结构算法的假设是，已经存在一个有价值的顶点顺序，用于初始化收缩过程。" -"由于大多数情况下没有有价值的初始节点排序，因此我们使用顶点 ID 给出的顺序。然" -"后，在这个首序的基础上进行收缩处理，得到最终的层次结构。" +msgid "The contraction hierarchies algorithm makes the assumption that there is already a valuable vertices order that is used to initialize the contraction process. As in most cases there is no valuable initial node ordering, we use the order given by vertices ID. Then, the contraction process is made on the basis of this first order to give the final hierarchy." +msgstr "收缩层次结构算法的假设是，已经存在一个有价值的顶点顺序，用于初始化收缩过程。由于大多数情况下没有有价值的初始节点排序，因此我们使用顶点 ID 给出的顺序。然后，在这个首序的基础上进行收缩处理，得到最终的层次结构。" -msgid "" -"The basic idea is to keep the vertices in a priority queue sorted by some " -"estimate of how attractive is their contraction. The implemented case uses " -"the metric called *edge difference*, which corresponds to the difference " -"between the number of shortcuts produced by a vertex contraction and the " -"number of incident edges in the graph before contraction (``#shortcuts - " -"#incident edges``)." -msgstr "" -"其基本原理是将顶点按其收缩吸引力的估计值排序，保留在优先队列中。实施案例中使" -"用的度量称为 *边差* ，相当于顶点收缩产生的捷径数量与收缩前图中附带边的数量之" -"差 (``#shortcuts - #incident edges``)." +msgid "The basic idea is to keep the vertices in a priority queue sorted by some estimate of how attractive is their contraction. The implemented case uses the metric called *edge difference*, which corresponds to the difference between the number of shortcuts produced by a vertex contraction and the number of incident edges in the graph before contraction (``#shortcuts - #incident edges``)." +msgstr "其基本原理是将顶点按其收缩吸引力的估计值排序，保留在优先队列中。实施案例中使用的度量称为 *边差* ，相当于顶点收缩产生的捷径数量与收缩前图中附带边的数量之差 (``#shortcuts - #incident edges``)." -msgid "" -"Finally, the aim is to reduce the explored part of the graph, when using a " -"bidirectional Dijkstra-like algorithm. The vertices order is used to feed " -"the oriented search. The search is made without losing optimality." -msgstr "" -"最后，在使用类似 Dijkstra 的双向算法时，目的是减少图中已探索的部分。顶点顺序" -"用于为定向搜索提供信息。搜索过程不会失去最优性。" +msgid "Finally, the aim is to reduce the explored part of the graph, when using a bidirectional Dijkstra-like algorithm. The vertices order is used to feed the oriented search. The search is made without losing optimality." +msgstr "最后，在使用类似 Dijkstra 的双向算法时，目的是减少图中已探索的部分。顶点顺序用于为定向搜索提供信息。搜索过程不会失去最优性。" -msgid "" -"Finding an optimal vertices ordering for contraction is a difficult problem. " -"Nevertheless, very simple local heuristics work quite well, according to " -"Geisberger et al. [2]. The principle here is to a priori estimate the value " -"of the *edge difference* and to contract the node at the top of the queue " -"only if the new value of the metric keeps it at the top of the queue. " -"Otherwise, it is reinserted in the queue, at its right place corresponding " -"to the new metric value." -msgstr "" -"为收缩寻找最佳顶点排序是一个难题。然而，根据 Geisberger 等人的研究 [2]，非常" -"简单的局部启发式方法就能很好地解决这个问题。这种方法的原理是先验地估算 *边差" -"* 的值，只有当新的度量值使位于队列顶端的节点保持在队列顶端时，才对其进行收" -"缩。否则，它就会被重新插入队列，位于与新度量值相对应的正确位置。" +msgid "Finding an optimal vertices ordering for contraction is a difficult problem. Nevertheless, very simple local heuristics work quite well, according to Geisberger et al. [2]. The principle here is to a priori estimate the value of the *edge difference* and to contract the node at the top of the queue only if the new value of the metric keeps it at the top of the queue. Otherwise, it is reinserted in the queue, at its right place corresponding to the new metric value." +msgstr "为收缩寻找最佳顶点排序是一个难题。然而，根据 Geisberger 等人的研究 [2]，非常简单的局部启发式方法就能很好地解决这个问题。这种方法的原理是先验地估算 *边差* 的值，只有当新的度量值使位于队列顶端的节点保持在队列顶端时，才对其进行收缩。否则，它就会被重新插入队列，位于与新度量值相对应的正确位置。" msgid "The process is done on graphs having only edges with positive costs." msgstr "这个过程是在只有边的成本为正值的图形上完成的。" -msgid "" -"It is necessary to remember that there are no deleted vertices with this " -"function. At the end, the graph keeps every vertex it had, but has some " -"added edges, corresponding to shortcuts. The vertices which have been " -"contracted, to build the shortcut edges, are kept and hierarchically ordered." -msgstr "" -"需要注意的是，此函数不会删除任何顶点。最终图中保留了原有的所有顶点，但新增了" -"一些对应于快捷边的边。为构建这些快捷边而收缩的顶点也会被保留，并按层级顺序排" -"列。" +msgid "It is necessary to remember that there are no deleted vertices with this function. At the end, the graph keeps every vertex it had, but has some added edges, corresponding to shortcuts. The vertices which have been contracted, to build the shortcut edges, are kept and hierarchically ordered." +msgstr "需要注意的是，此函数不会删除任何顶点。最终图中保留了原有的所有顶点，但新增了一些对应于快捷边的边。为构建这些快捷边而收缩的顶点也会被保留，并按层级顺序排列。" -msgid "" -"As for the other contraction methods, it does not return the full contracted " -"graph, only the changes. They are here of two types:" -msgstr "" -"至于其他收缩方法，它不会返回完整的收缩图，只会返回变化。它们有两种类型：" +msgid "As for the other contraction methods, it does not return the full contracted graph, only the changes. They are here of two types:" +msgstr "至于其他收缩方法，它不会返回完整的收缩图，只会返回变化。它们有两种类型：" msgid "added shortcut edges, with negative identifiers;" msgstr "增加了带有负标识符的快捷边;" @@ -12117,8 +9693,7 @@ msgstr "增加了带有负标识符的快捷边;" msgid "contracted nodes with an order." msgstr "带有顺序的收缩节点。" -msgid "" -"The ``pgr_contractionHierarchies`` function has the following signature:" +msgid "The ``pgr_contractionHierarchies`` function has the following signature:" msgstr "``pgr_contractionHierarchies`` 函数具有以下签名：" msgid "pgr_contractionHierarchies(`Edges SQL`_, [**options**])" @@ -12133,9 +9708,7 @@ msgstr "收缩层级的可选参数" msgid "True if the graph is directed, False otherwise." msgstr "如果图是有向的，则为 True，否则为 False。" -msgid "" -"The function returns many rows (one per vertex and one per shortcut edge " -"created). The columns of the rows are:" +msgid "The function returns many rows (one per vertex and one per shortcut edge created). The columns of the rows are:" msgstr "该函数返回多行（每个顶点一行，每创建一条快捷边一行）。行的列数为：" msgid "Type of the ``id``." @@ -12156,47 +9729,26 @@ msgstr "``vertex_order``" msgid "On an undirected graph" msgstr "在无向图上" -msgid "" -"The following query shows the original data involved in the contraction " -"operation on an undirected graph." +msgid "The following query shows the original data involved in the contraction operation on an undirected graph." msgstr "下面的查询显示了在无向图上进行收缩操作所涉及的原始数据。" msgid "building contraction hierarchies on the whole graph" msgstr "在整个图形上建立收缩层次结构" -msgid "" -"The results do not represent the contracted graph. They represent the " -"changes done to the graph after applying the contraction algorithm and give " -"the vertex order built by the algorithm, by ordering vertices according to " -"the *edge difference* metric. As a consequence, vertices are all represented " -"in the result (except of course forbidden ones). Only shortcut built by the " -"algorithm are represented in the result." -msgstr "" -"结果并不代表收缩后的图形。它们代表的是应用收缩算法后对图所做的改变，并根据 *" -"边差* 度量对顶点进行排序，从而给出算法建立的顶点顺序。因此，结果中包含了所有" -"顶点（当然禁止的顶点除外）。结果中只显示算法建立的捷径。" +msgid "The results do not represent the contracted graph. They represent the changes done to the graph after applying the contraction algorithm and give the vertex order built by the algorithm, by ordering vertices according to the *edge difference* metric. As a consequence, vertices are all represented in the result (except of course forbidden ones). Only shortcut built by the algorithm are represented in the result." +msgstr "结果并不代表收缩后的图形。它们代表的是应用收缩算法后对图所做的改变，并根据 *边差* 度量对顶点进行排序，从而给出算法建立的顶点顺序。因此，结果中包含了所有顶点（当然禁止的顶点除外）。结果中只显示算法建立的捷径。" -msgid "" -"After computing the contraction hierarchies, an order is now given to the " -"vertices," +msgid "After computing the contraction hierarchies, an order is now given to the vertices," msgstr "计算完收缩层次后，现在要给顶点排序，" -msgid "" -"in order to be used with a specific Dijkstra algorithm (implementation " -"coming in a future version), which speeds up the search." -msgstr "" -"是为了与一种特定的 Dijkstra 算法（在未来版本中实现）配合使用，从而加快搜索速" -"度。" +msgid "in order to be used with a specific Dijkstra algorithm (implementation coming in a future version), which speeds up the search." +msgstr "是为了与一种特定的 Dijkstra 算法（在未来版本中实现）配合使用，从而加快搜索速度。" msgid "We obtain the contracted graph above:" msgstr "我们得到了上面的收缩图：" -msgid "" -"We can see without surprise that the vertices belonging to the shortcuts " -"have a tendency to have a high priority level in the resulting vertices " -"order." -msgstr "" -"我们可以毫不意外地看到，属于捷径的顶点在结果顶点顺序中往往具有较高的优先级。" +msgid "We can see without surprise that the vertices belonging to the shortcuts have a tendency to have a high priority level in the resulting vertices order." +msgstr "我们可以毫不意外地看到，属于捷径的顶点在结果顶点顺序中往往具有较高的优先级。" msgid "On an undirected graph with forbidden vertices" msgstr "在有禁止顶点的无向图上" @@ -12210,33 +9762,14 @@ msgstr "收缩过程步骤详情" msgid "Shortcut building process" msgstr "快捷构建过程" -msgid "" -"A vertex ``v`` is contracted by adding shortcuts replacing former paths of " -"the form ``(u, v, w)`` by an edge ``(u, w)``. The shortcut ``(u, w)`` is " -"only needed when ``(u, v, w)`` is the only shortest path between ``u`` and " -"``w``." -msgstr "" -"顶点 ``v`` 通过添加快捷边来进行收缩，替换形式为 ``(u, v, w)`` 的原路径为一条" -"边 ``(u, w)`` 。仅当 ``(u, v, w)`` 是 ``u`` 和 ``w`` 之间唯一的最短路径时，才" -"需要快捷边 ``(u, w)`` 。" +msgid "A vertex ``v`` is contracted by adding shortcuts replacing former paths of the form ``(u, v, w)`` by an edge ``(u, w)``. The shortcut ``(u, w)`` is only needed when ``(u, v, w)`` is the only shortest path between ``u`` and ``w``." +msgstr "顶点 ``v`` 通过添加快捷边来进行收缩，替换形式为 ``(u, v, w)`` 的原路径为一条边 ``(u, w)`` 。仅当 ``(u, v, w)`` 是 ``u`` 和 ``w`` 之间唯一的最短路径时，才需要快捷边 ``(u, w)`` 。" -msgid "" -"When all shortcuts have been added for a given vertex ``v``, the incident " -"edges of ``v`` are removed and another vertex is contracted with the " -"remaining graph." -msgstr "" -"当为给定顶点 ``v`` 添加完所有快捷边后， ``v`` 的相关边会被移除，接着对剩余图" -"中的另一个顶点进行收缩。" +msgid "When all shortcuts have been added for a given vertex ``v``, the incident edges of ``v`` are removed and another vertex is contracted with the remaining graph." +msgstr "当为给定顶点 ``v`` 添加完所有快捷边后， ``v`` 的相关边会被移除，接着对剩余图中的另一个顶点进行收缩。" -msgid "" -"The procedure is destructive for the graph and a copy is made to be able to " -"manipulate it again as a whole. The contraction process adds all discovered " -"shortcuts to the edge set ``E`` and attributes a metric to each contracted " -"vertex. This metric is giving what is called the *contraction hierarchy*." -msgstr "" -"这个过程对图形是破坏性的，我们会制作一个副本，以便再次对其进行整体操作。收缩" -"过程会将所有发现的捷径添加到边集 ``E`` 中，并为每个收缩顶点赋予一个度量值。这" -"个度量值就是所谓的 *收缩层次* 。" +msgid "The procedure is destructive for the graph and a copy is made to be able to manipulate it again as a whole. The contraction process adds all discovered shortcuts to the edge set ``E`` and attributes a metric to each contracted vertex. This metric is giving what is called the *contraction hierarchy*." +msgstr "这个过程对图形是破坏性的，我们会制作一个副本，以便再次对其进行整体操作。收缩过程会将所有发现的捷径添加到边集 ``E`` 中，并为每个收缩顶点赋予一个度量值。这个度量值就是所谓的 *收缩层次* 。" msgid "Initialize the queue with a first vertices order" msgstr "用初始顶点顺序初始化队列" @@ -12277,64 +9810,29 @@ msgstr ":math:`\\{r, u\\}`" msgid "Adjacent edges are removed." msgstr "相邻边被移除。" -msgid "" -"Shortcuts are built from predecessors of ``v`` to successors of ``v`` if and " -"only if the path through ``v`` corresponds to the only shortest path between " -"the predecessor and the successor of ``v`` in the graph. The *edge " -"difference* metric here takes the value of -2." -msgstr "" -"只有当通过 ``v`` 的路径是 ``v`` 的前驱和后继之间唯一的最短路径时，才会从 " -"``v`` 的前驱到后继构建快捷边。这里的 *边差* 度量值为-2。" +msgid "Shortcuts are built from predecessors of ``v`` to successors of ``v`` if and only if the path through ``v`` corresponds to the only shortest path between the predecessor and the successor of ``v`` in the graph. The *edge difference* metric here takes the value of -2." +msgstr "只有当通过 ``v`` 的路径是 ``v`` 的前驱和后继之间唯一的最短路径时，才会从 ``v`` 的前驱到后继构建快捷边。这里的 *边差* 度量值为-2。" -msgid "" -"Then the following vertex is contracted. The process goes on until each node " -"of the graph has been contracted. At the end, there are no more edges in the " -"graph, which has been destroyed by the process." -msgstr "" -"然后收缩下面的顶点。这个过程一直持续到图中的每个节点都被收缩为止。最后，图中" -"就不再有边了，这个过程也就结束了。" +msgid "Then the following vertex is contracted. The process goes on until each node of the graph has been contracted. At the end, there are no more edges in the graph, which has been destroyed by the process." +msgstr "然后收缩下面的顶点。这个过程一直持续到图中的每个节点都被收缩为止。最后，图中就不再有边了，这个过程也就结束了。" -msgid "" -"This first contraction will give a vertices order, given by ordering them in " -"ascending order on the metric (edge difference). A total vertices order is " -"built. If ``u < v``, then ``u`` is less important than ``v``. The algorithm " -"keeps the vertices into a queue in this order." -msgstr "" -"第一次收缩将给出一个顶点顺序，根据度量（边差值）按升序排列。这样就得到了一个" -"总的顶点顺序。如果 ``u < v`` ，那么 ``u`` 就比 ``v`` 重要。算法会按此顺序将顶" -"点保存到队列中。" +msgid "This first contraction will give a vertices order, given by ordering them in ascending order on the metric (edge difference). A total vertices order is built. If ``u < v``, then ``u`` is less important than ``v``. The algorithm keeps the vertices into a queue in this order." +msgstr "第一次收缩将给出一个顶点顺序，根据度量（边差值）按升序排列。这样就得到了一个总的顶点顺序。如果 ``u < v`` ，那么 ``u`` 就比 ``v`` 重要。算法会按此顺序将顶点保存到队列中。" -msgid "" -"A hierarchy will now be constructed by contracting again the vertices in " -"this order." +msgid "A hierarchy will now be constructed by contracting again the vertices in this order." msgstr "现在，我们将按照这个顺序再次收缩顶点，从而构建一个层次结构。" msgid "Build the final vertex order" msgstr "构建最终顶点顺序" -msgid "" -"Once the first order built, the algorithm uses it to browse the graph once " -"again. For each vertex taken in the queue, the algorithm simulates " -"contraction and calculates its edge difference. If the computed value is " -"greater than the one of the next vertex to be contracted, then the algorithm " -"puts it back in the queue (heuristic approach). Otherwise it contracts it " -"permanently." -msgstr "" -"一旦建立了第一顺序，算法就会利用它再次浏览图形。对于队列中的每个顶点，算法都" -"会模拟收缩并计算其边差。如果计算出的值大于下一个要收缩的顶点的值，算法就会把" -"它放回队列（启发式方法）。否则，该顶点将永久收缩。" +msgid "Once the first order built, the algorithm uses it to browse the graph once again. For each vertex taken in the queue, the algorithm simulates contraction and calculates its edge difference. If the computed value is greater than the one of the next vertex to be contracted, then the algorithm puts it back in the queue (heuristic approach). Otherwise it contracts it permanently." +msgstr "一旦建立了第一顺序，算法就会利用它再次浏览图形。对于队列中的每个顶点，算法都会模拟收缩并计算其边差。如果计算出的值大于下一个要收缩的顶点的值，算法就会把它放回队列（启发式方法）。否则，该顶点将永久收缩。" msgid "Add shortcuts to the initial graph" msgstr "向初始图形添加快捷边" -msgid "" -"At the end, the algorithm takes the initial graph (before edges deletions) " -"and adds the shortcut edges to it. It gives you the contracted graph, ready " -"to use with a specialized Dijkstra algorithm, which takes into account the " -"order of the nodes in the hierarchy." -msgstr "" -"最后，算法会使用初始图形（删除边之前）并添加快捷边。这样就得到了收缩后的图" -"形，可以使用专门的 Dijkstra 算法，该算法会考虑层次结构中节点的顺序。" +msgid "At the end, the algorithm takes the initial graph (before edges deletions) and adds the shortcut edges to it. It gives you the contracted graph, ready to use with a specialized Dijkstra algorithm, which takes into account the order of the nodes in the hierarchy." +msgstr "最后，算法会使用初始图形（删除边之前）并添加快捷边。这样就得到了收缩后的图形，可以使用专门的 Dijkstra 算法，该算法会考虑层次结构中节点的顺序。" msgid "Use the contraction" msgstr "使用缩略语" @@ -12345,8 +9843,7 @@ msgstr "构建收缩" msgid "Add shortcuts and hierarchy in the existing tables" msgstr "在现有表中添加快捷边和层级" -msgid "" -"Add new columns in the `vertices` and `edges` tables to store the results:" +msgid "Add new columns in the `vertices` and `edges` tables to store the results:" msgstr "在 `vertices` 和 `edges` 表中添加新列来存储结果：" msgid "Update and insert the results in the two tables." @@ -12355,19 +9852,13 @@ msgstr "更新并插入结果到两个表中。" msgid "Use a Dijkstra shortest path algorithm on it" msgstr "对其使用 Dijkstra 最短路径算法" -msgid "" -"Then you can use any Dijkstra-like algorithm, waiting for the adapted one " -"which will take into account the built vertices hierarchy. For example:" -msgstr "" -"然后，你可以使用任何类似Dijkstra的算法，等待适应的算法，它将考虑构建的顶点层" -"级。例如：" +msgid "Then you can use any Dijkstra-like algorithm, waiting for the adapted one which will take into account the built vertices hierarchy. For example:" +msgstr "然后，你可以使用任何类似Dijkstra的算法，等待适应的算法，它将考虑构建的顶点层级。例如：" msgid "``pgr_contractionLinear`` - Proposed" msgstr "``pgr_contractionLinear`` - 提议中" -msgid "" -"``pgr_contractionLinear`` — Performs graph contraction and returns the " -"contracted vertices and edges." +msgid "``pgr_contractionLinear`` — Performs graph contraction and returns the contracted vertices and edges." msgstr "``pgr_contractionLinear`` — 执行图收缩并返回收缩后的顶点和边线。" msgid "pgr_contractionLinear(`Edges SQL`_, [**options**])" @@ -12376,9 +9867,7 @@ msgstr "pgr_contractionLinear(`Edges SQL`_, [**options**])" msgid "Linear contraction on an undirected graph." msgstr "无向图上的线性收缩。" -msgid "" -"The green nodes are linear nodes and will not be part of the contracted " -"graph." +msgid "The green nodes are linear nodes and will not be part of the contracted graph." msgstr "绿色节点为线性节点，不属于收缩图的一部分。" msgid "All edges adjacent will not be part of the contracted graph." @@ -12390,9 +9879,7 @@ msgstr "红线将成为收缩图的新边线。" msgid "**contraction Order**" msgstr "**contraction Order**" -msgid "" -"Number of times the contraction operations on ``contraction_order`` will be " -"performed." +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" @@ -12413,14 +9900,10 @@ msgstr "线性不对称" msgid "Graph where linearity is not symmetrical." msgstr "线性不对称的图形。" -msgid "" -"When the graph is processed as a directed graph, linearity is not " -"symmetrical, therefore the graph can not be contracted." +msgid "When the graph is processed as a directed graph, linearity is not symmetrical, therefore the graph can not be contracted." msgstr "当图形作为有向图处理时，线性并不对称，因此图形无法收缩。" -msgid "" -"When the same graph is processed as an undirected graph, linearity is " -"symmetrical, therefore the graph can be contracted." +msgid "When the same graph is processed as an undirected graph, linearity is symmetrical, therefore the graph can be contracted." msgstr "当把同一图形作为无向图处理时，线性是对称的，因此图形可以收缩。" msgid "The three edges can be replaced by one undirected edge" @@ -12456,9 +9939,7 @@ msgstr "四条边线可替换为一条无向边。" msgid "Step by step linear contraction" msgstr "逐步线性收缩" -msgid "" -"The linear contraction will stop when there are no more linear edges. For " -"example from the following graph there are linear edges" +msgid "The linear contraction will stop when there are no more linear edges. For example from the following graph there are linear edges" msgstr "线性收缩将在没有更多线性边时停止。例如，在下图中存在线性边" msgid "Contracting vertex :math:`3`," @@ -12467,14 +9948,10 @@ msgstr "收缩顶点 :math:`3`," msgid "The vertex :math:`3` is removed from the graph" msgstr "顶点 :math:`3` 已从图中移除" -msgid "" -"The edges :math:`2 \\rightarrow 3` and :math:`w \\rightarrow z` are removed " -"from the graph." -msgstr "" -"边线 :math:`2 \\rightarrow 3` 和 :math:`w \\rightarrow z` 已从图中移除。" +msgid "The edges :math:`2 \\rightarrow 3` and :math:`w \\rightarrow z` are removed from the graph." +msgstr "边线 :math:`2 \\rightarrow 3` 和 :math:`w \\rightarrow z` 已从图中移除。" -msgid "" -"A new edge :math:`2 \\rightarrow 4` is inserted represented with red color." +msgid "A new edge :math:`2 \\rightarrow 4` is inserted represented with red color." msgstr "插入一条新边 :math:`2 \\rightarrow 4` ，用红色表示。" msgid "Contracting vertex :math:`2`:" @@ -12483,18 +9960,13 @@ msgstr "收缩顶点 :math:`2`：" msgid "The vertex :math:`2` is removed from the graph" msgstr "顶点 :math:`2` 已从图形中移除" -msgid "" -"The edges :math:`1 \\rightarrow 2` and :math:`2 \\rightarrow 3` are removed " -"from the graph." +msgid "The edges :math:`1 \\rightarrow 2` and :math:`2 \\rightarrow 3` are removed from the graph." msgstr "从图中删除边 :math:`1 \\rightarrow 2` 和 :math:`2 \\rightarrow 3` 。" -msgid "" -"A new edge :math:`1 \\rightarrow 3` is inserted represented with red color." +msgid "A new edge :math:`1 \\rightarrow 3` is inserted represented with red color." msgstr "插入一条新边 :math:`1\\rightarrow 3` ，用红色表示。" -msgid "" -"Edge :math:`1 \\rightarrow 3` has the information of cost and the nodes that " -"were contracted." +msgid "Edge :math:`1 \\rightarrow 3` has the information of cost and the nodes that were contracted." msgstr "边线 :math:`1 \\rightarrow 3` 包含成本值及被收缩节点信息。" msgid "Create the contracted graph." @@ -12503,37 +9975,22 @@ msgstr "创建收缩图。" msgid "``pgr_cuthillMckeeOrdering`` - Experimental" msgstr "pgr_cuthillMckeeOrdering`` - 实验性" -msgid "" -"``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of " -"an undirected graphs" +msgid "``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of an undirected graphs" msgstr "``pgr_cuthillMckeeOrdering`` — 返回无向图的反向 Cuthill-Mckee 排序" msgid "Version 3.4.0" msgstr "版本 3.4.0" -msgid "" -"In numerical linear algebra, the Cuthill-McKee algorithm (CM), named after " -"Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse " -"matrix that has a symmetric sparsity pattern into a band matrix form with a " -"small bandwidth." -msgstr "" -"在数值线性代数中，Cuthill-McKee 算法（CM）以 Elizabeth Cuthill 和 James " -"McKee 的名字命名，是一种将具有对称稀疏性模式的稀疏矩阵置换为带宽较小的带状矩" -"阵形式的算法。" +msgid "In numerical linear algebra, the Cuthill-McKee algorithm (CM), named after Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse matrix that has a symmetric sparsity pattern into a band matrix form with a small bandwidth." +msgstr "在数值线性代数中，Cuthill-McKee 算法（CM）以 Elizabeth Cuthill 和 James McKee 的名字命名，是一种将具有对称稀疏性模式的稀疏矩阵置换为带宽较小的带状矩阵形式的算法。" -msgid "" -"The vertices are basically assigned a breadth-first search order, except " -"that at each step, the adjacent vertices are placed in the queue in order of " -"increasing degree." -msgstr "" -"顶点的搜索顺序基本上是广度优先，只不过在每一步中，相邻的顶点会按照度数递增的" -"顺序排列在队列中。" +msgid "The vertices are basically assigned a breadth-first search order, except that at each step, the adjacent vertices are placed in the queue in order of increasing degree." +msgstr "顶点的搜索顺序基本上是广度优先，只不过在每一步中，相邻的顶点会按照度数递增的顺序排列在队列中。" msgid "The implementation is for **undirected** graphs." msgstr "该实现适用于 **无向** 图。" -msgid "" -"The bandwidth minimization problems are considered NP-complete problems." +msgid "The bandwidth minimization problems are considered NP-complete problems." msgstr "带宽最小化问题被认为是NP完全问题。" msgid "The running time complexity is: :math:`O(m log(m)|V|)`" @@ -12563,59 +10020,31 @@ msgstr "从1开始的顺序序列。" msgid "New ordering in reverse order." msgstr "新的逆序排列。" -msgid "" -"`Boost: Cuthill-McKee Ordering `__" -msgstr "" -"`Boost: Cuthill-McKee 排序 `__" +msgid "`Boost: Cuthill-McKee Ordering `__" +msgstr "`Boost: Cuthill-McKee 排序 `__" -msgid "" -"`Wikipedia: Cuthill-McKee Ordering `__" -msgstr "" -"`Wikipedia: Cuthill-McKee 排序 `__" +msgid "`Wikipedia: Cuthill-McKee Ordering `__" +msgstr "`Wikipedia: Cuthill-McKee 排序 `__" msgid "``pgr_dagShortestPath`` - Experimental" msgstr "``pgr_dagShortestPath`` - 实验性" -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）中的最短路径。特别是使用 " -"Boost.Graph 实现的 DAG 最短路径算法。" +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）中的最短路径。特别是使用 Boost.Graph 实现的 DAG 最短路径算法。" msgid "pgr_dagShortestPath(Combinations)" msgstr "pgr_dagShortestPath(组合)" -msgid "" -"Shortest Path for Directed Acyclic Graph(DAG) is a graph search algorithm " -"that solves the shortest path problem for weighted directed acyclic graph, " -"producing a shortest path from a starting vertex (``start_vid``) to an " -"ending vertex (``end_vid``)." -msgstr "" -"有向无环图（DAG）的最短路径是一种图搜索算法，用于解决加权有向无环图的最短路径" -"问题，找到从起始顶点 (``start_vid``) 到结束顶点 (``end_vid``) 的最短路径。" +msgid "Shortest Path for Directed Acyclic Graph(DAG) is a graph search algorithm that solves the shortest path problem for weighted directed acyclic graph, producing a shortest path from a starting vertex (``start_vid``) to an ending vertex (``end_vid``)." +msgstr "有向无环图（DAG）的最短路径是一种图搜索算法，用于解决加权有向无环图的最短路径问题，找到从起始顶点 (``start_vid``) 到结束顶点 (``end_vid``) 的最短路径。" -msgid "" -"This implementation can only be used with a **directed** graph with no " -"cycles i.e. directed acyclic graph." +msgid "This implementation can only be used with a **directed** graph with no cycles i.e. directed acyclic graph." msgstr "这个实现只能用于 **有向** 图，且没有循环，即有向无环图。" -msgid "" -"The algorithm relies on topological sorting the dag to impose a linear " -"ordering on the vertices, and thus is more efficient for DAG's than either " -"the Dijkstra or Bellman-Ford algorithm." -msgstr "" -"该算法依靠对 DAG 进行拓扑排序来对顶点进行线性排序，因此比 Dijkstra 或 " -"Bellman-Ford 算法更有效率。" +msgid "The algorithm relies on topological sorting the dag to impose a linear ordering on the vertices, and thus is more efficient for DAG's than either the Dijkstra or Bellman-Ford algorithm." +msgstr "该算法依靠对 DAG 进行拓扑排序来对顶点进行线性排序，因此比 Dijkstra 或 Bellman-Ford 算法更有效率。" -msgid "" -"Process is valid for weighted directed acyclic graphs only. otherwise it " -"will throw warnings." +msgid "Process is valid for weighted directed acyclic graphs only. otherwise it will throw warnings." msgstr "该过程仅对加权有向无环图有效。 否则它会抛出警告。" msgid "The `agg_cost` the non included values `(v, v)` is `0`" @@ -12651,11 +10080,8 @@ msgstr "从顶点 :math:`5` 到顶点 :math:`\\{7, 11\\}`" msgid "From vertices :math:`\\{5, 10\\}` to vertex :math:`11`" 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\\}`" +msgid "From vertices :math:`\\{5, 15\\}` to vertices :math:`\\{11, 17\\}` on an **undirected** graph" +msgstr "在 **无向** 图上，从顶点 :math:`\\{5, 15\\} ` 到顶点 :math:`\\{11, 17\\}`" msgid "Return columns" msgstr "返回列" @@ -12663,12 +10089,8 @@ msgstr "返回列" msgid "Making **start_vids** the same as **end_vids**" msgstr "使 **start_vids** 与 **end_vids** 相同" -msgid "" -"`Boost: DAG shortest paths `__" -msgstr "" -"`Boost: DAG最短路径DAG 最短路径 `__" +msgid "`Boost: DAG shortest paths `__" +msgstr "`Boost: DAG最短路径DAG 最短路径 `__" msgid "https://en.wikipedia.org/wiki/Topological_sorting" msgstr "https://en.wikipedia.org/wiki/Topological_sorting" @@ -12676,9 +10098,7 @@ msgstr "https://en.wikipedia.org/wiki/Topological_sorting" msgid "``pgr_degree``" msgstr "``pgr_degree``" -msgid "" -"``pgr_degree`` — For each vertex in an undirected graph, return the count of " -"edges incident to the vertex." +msgid "``pgr_degree`` — For each vertex in an undirected graph, return the count of edges incident to the vertex." msgstr "``pgr_degree`` —对于无向图中的每个顶点，返回与该顶点关联的边的计数。" msgid "Error messages adjustment." @@ -12690,9 +10110,7 @@ msgstr "只有 Edges SQL 的新签名。" msgid "Calculates the degree of the vertices of an undirected graph" msgstr "计算无向图顶点的度数" -msgid "" -"The degree (or valency) of a vertex of a graph is the number of edges that " -"are incident to the vertex." +msgid "The degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex." msgstr "图中顶点的度（或称为顶点的连接度）是指与该顶点相关联的边数。" msgid "A loop contributes 2 to a vertex's degree." @@ -12704,19 +10122,13 @@ msgstr "度数为 0 的顶点称为孤立顶点。" msgid "Isolated vertex is not part of the result" msgstr "孤立顶点不包含在结果中" -msgid "" -"Vertex not participating on the subgraph is considered and isolated vertex." +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 "" -"可以执行 ``dryrun`` ，用于获取答案的代码将显示在 PostgreSQL 的 ``NOTICE`` 。" +msgid "There can be a ``dryrun`` execution and the code used to get the answer will be shown in a PostgreSQL ``NOTICE``." +msgstr "可以执行 ``dryrun`` ，用于获取答案的代码将显示在 PostgreSQL 的 ``NOTICE`` 。" -msgid "" -"The code can be used as base code for the particular application " -"requirements." +msgid "The code can be used as base code for the particular application requirements." msgstr "该代码可用作满足特定应用要求的基础代码。" msgid "No ordering is performed." @@ -12749,12 +10161,8 @@ msgstr "提取顶点信息" msgid "``pgr_degree`` can use :doc:`pgr_extractVertices` embedded in the call." msgstr "``pgr_degree`` 可以使用 :doc:`pgr_extractVertices` 嵌入调用。" -msgid "" -"For decent size networks, it is best to prepare your vertices table before " -"hand and use it on ``pgr_degree`` calls. (See `Using a vertex table`_)" -msgstr "" -"对于适当规模的网络，最好事先准备好顶点表，并在调用 ``pgr_degree`` 时使用。 " -"(请参阅 `Using a vertex table`_)" +msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls. (See `Using a vertex table`_)" +msgstr "对于适当规模的网络，最好事先准备好顶点表，并在调用 ``pgr_degree`` 时使用。 (请参阅 `Using a vertex table`_)" msgid "Calculate the degree of the nodes:" msgstr "计算节点的度数：" @@ -12783,9 +10191,7 @@ msgstr "Vertex SQL" msgid "``in_edges``" msgstr "``in_edges``" -msgid "" -"Array of identifiers of the edges that have the vertex ``id`` as *first end " -"point*." +msgid "Array of identifiers of the edges that have the vertex ``id`` as *first end point*." msgstr "以顶点 ``id`` 作为 *第一个端点* 的边的标识符数组。" msgid "When missing, ``out_edges`` must exist." @@ -12794,9 +10200,7 @@ msgstr "当缺失时， ``out_edges`` 必须存在。" msgid "``out_edges``" msgstr "``out_edges``" -msgid "" -"Array of identifiers of the edges that have the vertex ``id`` as *second end " -"point*." +msgid "Array of identifiers of the edges that have the vertex ``id`` as *second end point*." msgstr "以顶点 ``id`` 作为 *第二个端点* 的边的标识符数组。" msgid "When missing, ``in_edges`` must exist." @@ -12827,8 +10231,7 @@ msgid "For the following is a subgraph of the :doc:`sampledata`:" msgstr "下面是 :doc:`sampledata` 的子图：" msgid ":math:`E = \\{(1, 5 \\leftrightarrow 6), (1, 6 \\leftrightarrow 10)\\}`" -msgstr "" -":math:`E = \\{(1, 5 \\leftrightarrow 6), (1, 6 \\leftrightarrow 10)\\}`" +msgstr ":math:`E = \\{(1, 5 \\leftrightarrow 6), (1, 6 \\leftrightarrow 10)\\}`" msgid ":math:`V = \\{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17\\}`" msgstr ":math:`V = \\{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17\\}`" @@ -12845,9 +10248,7 @@ msgstr "它们的度数不会在输出结果中显示。" msgid "Using a vertex table" msgstr "使用顶点表" -msgid "" -"For decent size networks, it is best to prepare your vertices table before " -"hand and use it on ``pgr_degree`` calls." +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`` 时使用。" msgid "Extract the vertex information and save into a table:" @@ -12856,28 +10257,17 @@ msgstr "提取顶点信息并保存到表格中：" msgid "Dry run execution" msgstr "模拟执行" -msgid "" -"To get the query generated used to get the vertex information, use ``dryrun " -"=> true``." +msgid "To get the query generated used to get the vertex information, use ``dryrun => true``." msgstr "要获取用于生成顶点信息的查询，请使用 ``dryrun => true`` 。" -msgid "" -"The results can be used as base code to make a refinement based on the " -"backend development needs." +msgid "The results can be used as base code to make a refinement based on the backend development needs." msgstr "结果可作为基础代码，根据后台开发需要进行改进。" msgid "Finding dead ends" msgstr "查找断头节点" -msgid "" -"If there is a vertices table already built using ``pgr_extractVertices`` and " -"want the degree of the whole graph rather than a subset, it can be forgo " -"using ``pgr_degree`` and work with the ``in_edges`` and ``out_edges`` " -"columns directly." -msgstr "" -"如果已经使用 ``pgr_extractVertices`` 构建了顶点表，并且想要获取整个图的度数，" -"而不是子集的度数，则可以跳过使用 ``pgr_degree`` ，直接操作 ``in_edges`` 和 " -"``out_edges`` 列。" +msgid "If there is a vertices table already built using ``pgr_extractVertices`` and want the degree of the whole graph rather than a subset, it can be forgo using ``pgr_degree`` and work with the ``in_edges`` and ``out_edges`` columns directly." +msgstr "如果已经使用 ``pgr_extractVertices`` 构建了顶点表，并且想要获取整个图的度数，而不是子集的度数，则可以跳过使用 ``pgr_degree`` ，直接操作 ``in_edges`` 和 ``out_edges`` 列。" msgid "The degree of a dead end is 1." msgstr "断头节点的度数为 1。" @@ -12888,8 +10278,7 @@ msgstr "查找线性顶点" msgid "The degree of a linear vertex is 2." msgstr "线性顶点的阶数为 2。" -msgid "" -"If there is a vertices table already built using the ``pgr_extractVertices``" +msgid "If there is a vertices table already built using the ``pgr_extractVertices``" msgstr "若已使用 ``pgr_extractVertices`` 构建顶点表" msgid ":doc:`pgr_extractVertices`" @@ -12898,48 +10287,28 @@ msgstr ":doc:`pgr_extractVertices`" msgid "``pgr_depthFirstSearch`` - Proposed" msgstr "``pgr_depthFirstSearch`` - 提议中" -msgid "" -"``pgr_depthFirstSearch`` — Returns a depth first search traversal of the " -"graph. The graph can be directed or undirected." -msgstr "" -"``pgr_depthFirstSearch`` — 返回图的深度优先搜索遍历。 该图可以是有向图或无向" -"图。" +msgid "``pgr_depthFirstSearch`` — Returns a depth first search traversal of the graph. The graph can be directed or undirected." +msgstr "``pgr_depthFirstSearch`` — 返回图的深度优先搜索遍历。 该图可以是有向图或无向图。" msgid "Version 3.3.0" msgstr "版本 3.3.0" -msgid "" -"Depth First Search algorithm is a traversal algorithm which starts from a " -"root vertex, goes as deep as possible, and backtracks once a vertex is " -"reached with no adjacent vertices or with all visited adjacent vertices. The " -"traversal continues until all the vertices reachable from the root vertex " -"are visited." -msgstr "" -"深度优先搜索算法是一种遍历算法，从根顶点开始，尽可能深入探索，一旦到达一个没" -"有相邻顶点或所有相邻顶点都已访问的顶点，就会回溯。遍历会一直持续，直到从根顶" -"点可达的所有顶点都被访问。" +msgid "Depth First Search algorithm is a traversal algorithm which starts from a root vertex, goes as deep as possible, and backtracks once a vertex is reached with no adjacent vertices or with all visited adjacent vertices. The traversal continues until all the vertices reachable from the root vertex are visited." +msgstr "深度优先搜索算法是一种遍历算法，从根顶点开始，尽可能深入探索，一旦到达一个没有相邻顶点或所有相邻顶点都已访问的顶点，就会回溯。遍历会一直持续，直到从根顶点可达的所有顶点都被访问。" -msgid "" -"The implementation works for both **directed** and **undirected** graphs." +msgid "The implementation works for both **directed** and **undirected** graphs." msgstr "该实现适用于 **有向** 图和 **无向** 图。" -msgid "" -"Provides the Depth First Search traversal order from a root vertex or from a " -"set of root vertices." +msgid "Provides the Depth First Search traversal order from a root vertex or from a set of root vertices." msgstr "提供从根顶点或一组根顶点开始的深度优先搜索遍历顺序。" -msgid "" -"An optional non-negative maximum depth parameter to limit the results up to " -"a particular depth." +msgid "An optional non-negative maximum depth parameter to limit the results up to a particular depth." msgstr "可选的非负最大深度参数，用于限制结果的深度到特定的深度。" -msgid "" -"For optimization purposes, any duplicated values in the `Root vids` are " -"ignored." +msgid "For optimization purposes, any duplicated values in the `Root vids` are ignored." msgstr "为了优化的目的，`Root vids` 中的任何重复值都会被忽略。" -msgid "" -"It does not produce the shortest path from a root vertex to a target vertex." +msgid "It does not produce the shortest path from a root vertex to a target vertex." msgstr "它不会生成从根顶点到目标顶点的最短路径。" msgid "The aggregate cost of traversal is not guaranteed to be minimal." @@ -12963,26 +10332,14 @@ msgstr "**options:** ``[directed, max_depth]``" msgid "Same as `Single vertex`_ but with edges in descending order of ``id``." msgstr "与 `单个顶点`_ 相同，但边按 ``id`` 降序排列。" -msgid "" -"`Boost: Depth First Search `__" -msgstr "" -"`Boost: 深度优先搜索 `__" +msgid "`Boost: Depth First Search `__" +msgstr "`Boost: 深度优先搜索 `__" -msgid "" -"`Boost: Undirected DFS `__" -msgstr "" -"`Boost: 非定向 DFS `__" +msgid "`Boost: Undirected DFS `__" +msgstr "`Boost: 非定向 DFS `__" -msgid "" -"`Wikipedia: Depth First Search algorithm `__" -msgstr "" -"`维基百科：深度优先搜索算法 `__" +msgid "`Wikipedia: Depth First Search algorithm `__" +msgstr "`维基百科：深度优先搜索算法 `__" msgid "``pgr_dijkstra`` — Shortest path using Dijkstra algorithm." msgstr "``pgr_dijkstra`` - 使用 Dijkstra 算法计算的最短路径。" @@ -13024,8 +10381,7 @@ msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "" -"pgr_dijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" @@ -13033,12 +10389,10 @@ msgstr "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgid "pgr_dijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "pgr_dijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**" +msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**" msgstr "在 **有向** 图上，从顶点 :math:`6` 到顶点 :math:`\\{10, 17\\}`" -msgid "" -"The examples of this section are based on the :doc:`sampledata` network." +msgid "The examples of this section are based on the :doc:`sampledata` network." msgstr "本节的示例基于 :doc:`sampledata` 网络。" msgid "For **directed** graphs with ``cost`` and ``reverse_cost`` columns" @@ -13080,10 +10434,8 @@ msgstr "路径 :math:`\\{6, 12\\}\\rightarrow\\{10, 7\\}`" msgid "8) Using `Combinations`_ to get the solution of examples 1 to 3" msgstr "8) 使用 `组合`_ 来获取示例1到3的解决方案" -msgid "" -"Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" -msgstr "" -"路径 :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" +msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" +msgstr "路径 :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" msgid "For **undirected** graphs with ``cost`` and ``reverse_cost`` columns" msgstr "对于带有 ``cost`` 和 ``reverse_cost`` 列的 **无向** 图" @@ -13178,8 +10530,7 @@ msgstr "32) 使用 `组合`_ 来获取示例25到27的解决方案" msgid "Equvalences between signatures" msgstr "签名之间的等价性" -msgid "" -"The following examples find the path for :math:`\\{6\\}\\rightarrow\\{10\\}`" +msgid "The following examples find the path for :math:`\\{6\\}\\rightarrow\\{10\\}`" msgstr "下面的示例可以找到 :math:`\\{6}\\rightarrow\\{10\\}` 的路径" msgid "33) Using `One to One`_" @@ -13197,12 +10548,8 @@ msgstr "36) 使用 `Many to Many`_" msgid "37) Using `Combinations`_" msgstr "37) 使用 `组合`_" -msgid "" -"`Boost: Dijkstra shortest paths `__" -msgstr "" -"`Boost: Dijkstra最短路径Dijkstra 最短路径 `__" +msgid "`Boost: Dijkstra shortest paths `__" +msgstr "`Boost: Dijkstra最短路径Dijkstra 最短路径 `__" msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgstr "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" @@ -13210,38 +10557,26 @@ msgstr "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgid "``pgr_dijkstraCost``" msgstr "``pgr_dijkstraCost``" -msgid "" -"``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra " -"algorithm." +msgid "``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra algorithm." msgstr "`pgr_dijkstraCost`` - 使用 Dijkstra 算法计算最短路径的总成本。" msgid "pgr_dijkstraCost(Combinations)" msgstr "pgr_dijkstraCost(Combinations)" -msgid "" -"The ``pgr_dijkstraCost`` function summarizes of the cost of the shortest " -"path using Dijkstra Algorithm." +msgid "The ``pgr_dijkstraCost`` function summarizes of the cost of the shortest path using Dijkstra Algorithm." msgstr "``pgr_dijkstraCost`` 使用 Dijkstra 算法计算出的最短路径的代价。" -msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "" -"pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "" -"pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "" -"pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "" -"pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgid "pgr_dijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "pgr_dijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" @@ -13249,9 +10584,7 @@ msgstr "pgr_dijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgid "``pgr_dijkstraCostMatrix``" msgstr "``pgr_dijkstraCostMatrix``" -msgid "" -"``pgr_dijkstraCostMatrix`` - Calculates a cost matrix using :doc:" -"`pgr_dijkstra`." +msgid "``pgr_dijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_dijkstra`." msgstr "``pgr_dijkstraCostMatrix`` - 使用 :doc:`pgr_dijkstra` 计算成本矩阵。" msgid "Using Dijkstra algorithm, calculate and return a cost matrix." @@ -13264,18 +10597,11 @@ msgstr "pgr_dijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" msgid "``pgr_dijkstraNear``" msgstr "pgr_dijkstraNear" -msgid "" -"``pgr_dijkstraNear`` — Using Dijkstra's algorithm, finds the route that " -"leads to the nearest vertex." +msgid "``pgr_dijkstraNear`` — Using Dijkstra's algorithm, finds the route that leads to the nearest vertex." msgstr "``pgr_dijkstraNear`` - 使用 Dijkstra 算法，找到通往最近顶点的路径。" -msgid "" -"Given a graph, a starting vertex and a set of ending vertices, this function " -"finds the shortest path from the starting vertex to the nearest ending " -"vertex." -msgstr "" -"给定一个图、一个起始顶点和一组终止顶点，该函数会找出从起始顶点到最近的终止顶" -"点的最短路径。" +msgid "Given a graph, a starting vertex and a set of ending vertices, this function finds the shortest path from the starting vertex to the nearest ending vertex." +msgstr "给定一个图、一个起始顶点和一组终止顶点，该函数会找出从起始顶点到最近的终止顶点的最短路径。" msgid "Uses Dijkstra algorithm." msgstr "使用 Dijkstra 算法。" @@ -13322,20 +10648,14 @@ msgstr "Many to Many: :math:`drt * |Starting vids|`" msgid "Combinations: :math:`drt * |Starting vids|`" msgstr "组合： :math:`drt * |Starting vids|`" -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" -msgstr "" -"pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" +msgstr "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" -msgstr "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" +msgstr "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" -msgstr "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" +msgstr "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options B**])" msgstr "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options B**])" @@ -13346,10 +10666,8 @@ msgstr "**options A:** ``[directed, cap]``" msgid "**options B:** ``[directed, cap, global]``" msgstr "**options B:** ``[directed, cap, global]``" -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgstr "" -"pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgid "**options:** ``[directed, cap]``" msgstr "**options:** ``[directed, cap]``" @@ -13360,8 +10678,7 @@ msgstr "从顶点 :math:`6` 乘车出发，找到最近的地铁站。" msgid "Using a **directed** graph for car routing." msgstr "使用 **有向** 图进行汽车路线规划。" -msgid "" -"The subway stations are on the following vertices :math:`\\{1, 10, 11\\}`" +msgid "The subway stations are on the following vertices :math:`\\{1, 10, 11\\}`" msgstr "地铁站位于以下顶点上 :math:`\\{1, 10, 11\\}`" msgid "The defaults used:" @@ -13376,14 +10693,10 @@ msgstr "`cap => 1`" msgid "The result shows that station at vertex :math:`11` is the nearest." msgstr "结果显示，位于顶点 :math:`11` 的站最近。" -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgstr "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" -msgid "" -"Departing on a car from a subway station find the nearest **two** stations " -"to vertex :math:`2`" +msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`2`" msgstr "从地铁站开车出发，找到距离顶点 :math:`2` 最近的 **两个** 车站" msgid "On line `4`: using the positional parameter: `directed` set to ``true``" @@ -13392,15 +10705,11 @@ msgstr "第 `4` 行：使用位置参数： `directed` 设置为 ``true``" msgid "In line `5`: using named parameter `cap => 2`" msgstr "第 `5` 行：使用命名参数 `cap => 2`" -msgid "" -"The result shows that station at vertex :math:`10` is the nearest and the " -"next best is :math:`11`." +msgid "The result shows that station at vertex :math:`10` is the nearest and the next best is :math:`11`." msgstr "结果显示，位于顶点 :math:`10` 的站点最近，其次是 :math:`11`。" -msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])" -msgstr "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgid "**options:** ``[directed, cap, global]``" msgstr "**options:** ``[directed, cap, global]``" @@ -13423,23 +10732,16 @@ msgstr "第 `4` 行：使用命名参数：`directed => false`" msgid "`global => true`" msgstr "`global => true`" -msgid "" -"For a pedestrian the best connection is to get on/off is at vertex :math:" -"`15` of the first subway line and at vertex :math:`10` of the second subway " -"line." -msgstr "" -"对于行人来说，上下车的最佳连接点是第一条地铁线的顶点 :math:`15` 和第二条地铁" -"线的顶点 :math:`10`。" +msgid "For a pedestrian the best connection is to get on/off is at vertex :math:`15` of the first subway line and at vertex :math:`10` of the second subway line." +msgstr "对于行人来说，上下车的最佳连接点是第一条地铁线的顶点 :math:`15` 和第二条地铁线的顶点 :math:`10`。" -msgid "" -"Only `one` route is returned because `global` is ``true`` and `cap` is ``1``" +msgid "Only `one` route is returned because `global` is ``true`` and `cap` is ``1``" msgstr "只返回 `一条` 路由，因为 `global` 为 ``true`` 且 `cap` 为 ``1``" msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgid "" -"Find the best car connection between all the stations of two subway lines" +msgid "Find the best car connection between all the stations of two subway lines" msgstr "查找两条地铁线所有站点之间的最佳汽车连接线路" msgid "The first subway line stations stops are at :math:`\\{1, 10, 11\\}`" @@ -13451,19 +10753,11 @@ msgstr "地铁二号线站点位于 :math:`\\{15, 16\\}`" msgid "The combinations contents:" msgstr "组合内容：" -msgid "" -"lines `3~4` sets the start vertices to be from the first subway line and the " -"ending vertices to be from the second subway line" -msgstr "" -"行 `3~4` 将起始顶点设置为第一条地铁线上的顶点，将终点顶点设置为第二条地铁线上" -"的顶点" +msgid "lines `3~4` sets the start vertices to be from the first subway line and the ending vertices to be from the second subway line" +msgstr "行 `3~4` 将起始顶点设置为第一条地铁线上的顶点，将终点顶点设置为第二条地铁线上的顶点" -msgid "" -"lines `6~7` sets the start vertices to be from the first subway line and the " -"ending vertices to be from the first subway line" -msgstr "" -"行 `6~7` 将起始顶点设置为第一条地铁线上的顶点，将终点顶点设置为第一条地铁线上" -"的顶点" +msgid "lines `6~7` sets the start vertices to be from the first subway line and the ending vertices to be from the first subway line" +msgstr "行 `6~7` 将起始顶点设置为第一条地铁线上的顶点，将终点顶点设置为第一条地铁线上的顶点" msgid "On line `8`: using the named parameter is `global => false`" msgstr "第 `8` 行：使用名为 `global => false` 的参数" @@ -13471,41 +10765,22 @@ msgstr "第 `8` 行：使用名为 `global => false` 的参数" msgid "From the results:" msgstr "从结果来看：" -msgid "" -"making a connection from the first subway line :math:`\\{1, 10, 11\\}` to " -"the second :math:`\\{15, 16\\}`:" -msgstr "" -"将第一条地铁线 :math:`{1, 10, 11\\}` 连接到第二条地铁线 :math:`{15, 16\\}`：" +msgid "making a connection from the first subway line :math:`\\{1, 10, 11\\}` to the second :math:`\\{15, 16\\}`:" +msgstr "将第一条地铁线 :math:`{1, 10, 11\\}` 连接到第二条地铁线 :math:`{15, 16\\}`：" -msgid "" -"The best connections from all the stations from the first line are: :math:" -"`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" -msgstr "" -"从第一条线路的所有站点出发的最佳连接是： :math:`{(1 \\rightarrow 16) (10 " -"\\rightarrow 16) (11 \\rightarrow 16)}`" +msgid "The best connections from all the stations from the first line are: :math:`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" +msgstr "从第一条线路的所有站点出发的最佳连接是： :math:`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" -msgid "" -"The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` " -"(lines: `11` and `12`)" -msgstr "" -"最好的方法是 :math:`(11/rightarrow 16)`，成本是 :math:`1` （行：`11` 和`12`）" +msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `11` and `12`)" +msgstr "最好的方法是 :math:`(11/rightarrow 16)`，成本是 :math:`1` （行：`11` 和`12`）" -msgid "" -"making a connection from the second subway line :math:`\\{15, 16\\}` to the " -"first :math:`\\{1, 10, 11\\}`:" -msgstr "" -"将第二条地铁线 :math:`{15, 16\\}` 连接到第一条地铁线 :math:`{1, 10, 11\\}`：" +msgid "making a connection from the second subway line :math:`\\{15, 16\\}` to the first :math:`\\{1, 10, 11\\}`:" +msgstr "将第二条地铁线 :math:`{15, 16\\}` 连接到第一条地铁线 :math:`{1, 10, 11\\}`：" -msgid "" -"The best connections from all the stations from the second line are: :math:" -"`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" -msgstr "" -"从二号线所有站点出发的最佳连接是： :math:`{(15 ／rightarrow 10) (16 ／" -"rightarrow 11)}`" +msgid "The best connections from all the stations from the second line are: :math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" +msgstr "从二号线所有站点出发的最佳连接是： :math:`{(15 ／rightarrow 10) (16 ／rightarrow 11)}`" -msgid "" -"Both are equally good as they have the same cost. (lines: `13` and `14` and " -"lines: `15` and `16`)" +msgid "Both are equally good as they have the same cost. (lines: `13` and `14` and lines: `15` and `16`)" msgstr "由于成本相同，两者同样好。(行：`13` 和 `14` ，行：`15` 和 `16`)" msgid "Dijkstra optional parameters" @@ -13536,72 +10811,40 @@ msgstr "维基百科：https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgid "``pgr_dijkstraNearCost``" msgstr "pgr_dijkstraNearCost" -msgid "" -"``pgr_dijkstraNearCost`` — Using dijkstra algorithm, finds the route that " -"leads to the nearest vertex." +msgid "``pgr_dijkstraNearCost`` — Using dijkstra algorithm, finds the route that leads to the nearest vertex." msgstr "`pgr_dijkstraNearCost`` - 使用 dijkstra 算法，找到通往最近顶点的路径。" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options " -"A**])" -msgstr "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options " -"A**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" +msgstr "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options " -"A**])" -msgstr "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options " -"A**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" +msgstr "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options " -"B**])" -msgstr "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options " -"B**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" +msgstr "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" -msgstr "" -"pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" +msgstr "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, " -"[**options**])" -msgstr "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, " -"[**options**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgstr "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, " -"[**options**])" -msgstr "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgstr "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" -msgid "" -"Departing on a car from a subway station find the nearest **two** stations " -"to vertex :math:`6`" +msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`6`" msgstr "从地铁站开车出发找到距离顶点 :math:`6` 最近的 **两个** 车站" -msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, " -"[**options**])" -msgstr "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, " -"[**options**])" +msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgstr "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgid "" -"The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` " -"(lines: `1`)" +msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `1`)" msgstr "最好的方法是 :math:`(11/rightarrow 16)`，成本是 :math:`1` (lines: `1`)" -msgid "" -"Both are equally good as they have the same cost. (lines: `12` and `13`)" +msgid "Both are equally good as they have the same cost. (lines: `12` and `13`)" msgstr "由于成本相同，两者同样好。(行：`12` and `13`)" #, fuzzy @@ -13611,13 +10854,8 @@ msgstr "``pgr_dijkstra``" msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices." msgstr "``pgr_dijkstraVia`` - 经过顶点列表的路径。" -msgid "" -"Given a list of vertices and a graph, this function is equivalent to finding " -"the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :" -"math:`i < size\\_of(via\\;vertices)`." -msgstr "" -"给定一个顶点列表和一个图，该函数等价于为所有 :math:`i < size\\_of(via\\;" -"vertices)`的 :math:`vertex_i` 和 :math:`vertex_{i+1}` 之间找到最短路径。" +msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)`." +msgstr "给定一个顶点列表和一个图，该函数等价于为所有 :math:`i < size\\_of(via\\;vertices)`的 :math:`vertex_i` 和 :math:`vertex_{i+1}` 之间找到最短路径。" msgid "Route" msgstr "路线" @@ -13643,11 +10881,8 @@ msgstr "**options:** ``[directed, strict, U_turn_on_edge]``" msgid "Returns set of |via-result|" msgstr "返回 |via-result| 的集合" -msgid "" -"Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order " -"on an directed graph." -msgstr "" -"在一个directed graph中，找到按顺序访问顶点 :math:`\\ {5, 1, 8\\}` 的路径。" +msgid "Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order on an directed graph." +msgstr "在一个directed graph中，找到按顺序访问顶点 :math:`\\ {5, 1, 8\\}` 的路径。" msgid "Via optional parameters" msgstr "Via可选参数" @@ -13658,9 +10893,7 @@ msgstr "为 ``true`` 时，从访问过的顶点出发时不会试图避开" msgid "Identifier of a path. Has value **1** for the first path." msgstr "路径的标识符。 第一条路径的值为 **1**。" -msgid "" -"Identifier of the edge used to go from ``node`` to the next node in the path " -"sequence." +msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence." msgstr "用于从路径序列中的 ``node`` 到下一个节点的边的标识符。" msgid "-1 for the last node of the path." @@ -13672,18 +10905,11 @@ msgstr "路由的最后一个节点为 -2。" msgid "``route_agg_cost``" msgstr "``route_agg_cost``" -msgid "" -"Total cost from ``start_vid`` of ``seq = 1`` to ``end_vid`` of the current " -"``seq``." -msgstr "" -"从 ``seq = 1`` 的 ``start_vid`` 到当前 ``seq`` 的 ``end_vid`` 的总费用。" +msgid "Total cost from ``start_vid`` of ``seq = 1`` to ``end_vid`` of the current ``seq``." +msgstr "从 ``seq = 1`` 的 ``start_vid`` 到当前 ``seq`` 的 ``end_vid`` 的总费用。" -msgid "" -"All this examples are about the route that visits the vertices :math:`\\{5, " -"7, 1, 8, 15\\}` in that order on a **directed** graph." -msgstr "" -"所有这些示例都是关于在 **有向** 图上按顺序访问顶点 :math:`\\{5, 7, 1, 8, " -"15\\}` 的路径。" +msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a **directed** graph." +msgstr "所有这些示例都是关于在 **有向** 图上按顺序访问顶点 :math:`\\{5, 7, 1, 8, 15\\}` 的路径。" msgid "The main query" msgstr "主查询" @@ -13709,8 +10935,7 @@ msgstr ":doc:`via-category`。" msgid ":doc:`dijkstra-family`." msgstr ":doc:`dijkstra-family`。" -msgid "" -"``pgr_drivingDistance`` - Returns the driving distance from a start node." +msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." msgstr "``pgr_drivingDistance`` - 返回起始节点的行驶距离。" msgid "pgr_drivingDistance(Single vertex)" @@ -13740,23 +10965,14 @@ msgstr "新签名：" msgid "pgr_drivingDistance(multiple vertices)" msgstr "pgr_drivingDistance(多个顶点)" -msgid "" -"Using the Dijkstra algorithm, extracts all the nodes that have costs less " -"than or equal to the value ``distance``. The edges extracted will conform to " -"the corresponding spanning tree." -msgstr "" -"使用 Dijkstra 算法，提取成本小于或等于 ``distance`` 值的所有节点。提取的边将" -"符合相应的生成树。" +msgid "Using the Dijkstra algorithm, extracts all the nodes that have costs less than or equal to the value ``distance``. The edges extracted will conform to the corresponding spanning tree." +msgstr "使用 Dijkstra 算法，提取成本小于或等于 ``distance`` 值的所有节点。提取的边将符合相应的生成树。" -msgid "" -"pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" -msgstr "" -"pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" +msgid "pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" +msgstr "pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" -msgid "" -"pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" -msgstr "" -"pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" +msgid "pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" +msgstr "pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" msgid "**options:** [directed, equicost]" msgstr "**options:** [directed, equicost]" @@ -13770,11 +10986,8 @@ msgstr "从顶点 :math:`11` 到 :math:`3.0` 的距离" msgid "Multiple Vertices" msgstr "多个顶点" -msgid "" -"From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` with equi-" -"cost on a directed graph" -msgstr "" -"从顶点 :math:`{11, 16\\}` 出发，距离为 :math:`3.0` 且有向图上的成本相等" +msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` with equi-cost on a directed graph" +msgstr "从顶点 :math:`{11, 16\\}` 出发，距离为 :math:`3.0` 且有向图上的成本相等" msgid "Driving distance optional parameters" msgstr "行驶距离可选参数" @@ -13782,40 +10995,26 @@ msgstr "行驶距离可选参数" msgid "``equicost``" msgstr "``equicost``" -msgid "" -"When ``true`` the node will only appear in the closest ``start_vid`` list. " -"Tie brakes are arbitrary." -msgstr "" -"``true`` 时，节点只会出现在最近的 ``start_vid`` 列表中。绑定制动是任意的。" +msgid "When ``true`` the node will only appear in the closest ``start_vid`` list. Tie brakes are arbitrary." +msgstr "``true`` 时，节点只会出现在最近的 ``start_vid`` 列表中。绑定制动是任意的。" -msgid "" -"When ``false`` which resembles several calls using the single vertex " -"signature." +msgid "When ``false`` which resembles several calls using the single vertex signature." msgstr "``false`` 时，类似于使用单个顶点签名的多次调用。" msgid "end-before" msgstr "" -msgid "" -"From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` on an " -"undirected graph" +msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` on an undirected graph" msgstr "在无向图上，从顶点 :math:`{11, 16\\}` 开始的距离为 :math:`3.0`" msgid "``pgr_edgeColoring`` - Experimental" msgstr "``pgr_edgeColoring`` - 实验性" -msgid "" -"``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free " -"graphs" +msgid "``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free graphs" msgstr "``pgr_edgeColoring`` - 返回无向图和无环图的边着色" -msgid "" -"Edge Coloring is an algorithm used for coloring of the edges for the " -"vertices in the graph. It is an assignment of colors to the edges of the " -"graph so that no two adjacent edges have the same color." -msgstr "" -"边着色是一种用于为图形中顶点的边着色的算法。它为图中的边分配颜色，使相邻的两" -"条边没有相同的颜色。" +msgid "Edge Coloring is an algorithm used for coloring of the edges for the vertices in the graph. It is an assignment of colors to the edges of the graph so that no two adjacent edges have the same color." +msgstr "边着色是一种用于为图形中顶点的边着色的算法。它为图中的边分配颜色，使相邻的两条边没有相同的颜色。" msgid "The implementation is for **undirected** and **loop-free** graphs" msgstr "针对 **无向** 和 **无环** 图实施" @@ -13826,29 +11025,17 @@ msgstr "无环" msgid "no self-loops and no parallel edges." msgstr "无自循环，无平行边。" -msgid "" -"Provides the color to be assigned to all the edges present in the graph." +msgid "Provides the color to be assigned to all the edges present in the graph." msgstr "指定要分配给图中所有边的颜色。" -msgid "" -"At most :math:`\\Delta + 1` colors are used, where :math:`\\Delta` is the " -"degree of the graph." +msgid "At most :math:`\\Delta + 1` colors are used, where :math:`\\Delta` is the degree of the graph." msgstr "最多使用 :math:`\\Delta + 1` 种颜色，其中 :math:`\\Delta` 是图的度数。" -msgid "" -"This is optimal for some graphs, and by Vizing's theorem it uses at most one " -"color more than the optimal for all others." -msgstr "" -"这对于某些图是最优的，根据Vizing定理，对于所有其他图，它使用的颜色最多比最优" -"解多一种。" +msgid "This is optimal for some graphs, and by Vizing's theorem it uses at most one color more than the optimal for all others." +msgstr "这对于某些图是最优的，根据Vizing定理，对于所有其他图，它使用的颜色最多比最优解多一种。" -msgid "" -"the chromatic number :math:`x'(G)` (minimum number of colors needed for " -"proper edge coloring of graph) is equal to the degree :math:`\\Delta + 1` of " -"the graph, (:math:`x'(G) = \\Delta`)" -msgstr "" -"色数（chromatic number） :math:`x'(G)`（用于图的适当边着色所需的最小颜色数）" -"等于图的度 :math:`\\Delta + 1`（ :math:`x'(G) = \\Delta`）" +msgid "the chromatic number :math:`x'(G)` (minimum number of colors needed for proper edge coloring of graph) is equal to the degree :math:`\\Delta + 1` of the graph, (:math:`x'(G) = \\Delta`)" +msgstr "色数（chromatic number） :math:`x'(G)`（用于图的适当边着色所需的最小颜色数）等于图的度 :math:`\\Delta + 1`（ :math:`x'(G) = \\Delta`）" msgid "The algorithm tries to assign the least possible color to every edge." msgstr "该算法尝试为每条边分配尽可能少的颜色。" @@ -13856,8 +11043,7 @@ msgstr "该算法尝试为每条边分配尽可能少的颜色。" msgid "Does not always produce optimal coloring." msgstr "并不总是产生最佳的着色。" -msgid "" -"The returned rows are ordered in ascending order of the edge identifier." +msgid "The returned rows are ordered in ascending order of the edge identifier." msgstr "返回的行按边标识符升序排列。" msgid "Efficient graph coloring is an NP-Hard problem, and therefore:" @@ -13878,27 +11064,19 @@ msgstr "pgr_edgeColoring(`Edges SQL`_)" msgid "Graph coloring of pgRouting :doc:`sampledata`" msgstr "pgRouting :doc:`sampledata` 的图形着色" -msgid "" -"`Boost: Edge Coloring `__" -msgstr "" -"`Boost: 边着色 `__" +msgid "`Boost: Edge Coloring `__" +msgstr "`Boost: 边着色 `__" -msgid "" -"`Wikipedia: Graph coloring `__" +msgid "`Wikipedia: Graph coloring `__" msgstr "`维基百科：图着色 `__" -msgid "" -"``pgr_edgeDisjointPaths`` — Calculates edge disjoint paths between two " -"groups of vertices." +msgid "``pgr_edgeDisjointPaths`` — Calculates edge disjoint paths between two groups of vertices." msgstr "``pgr_edgeDisjointPaths`` - 计算两组顶点之间的边不相交路径。" msgid "pgr_edgeDisjointPaths(Combinations)" msgstr "pgr_edgeDisjointPaths(组合)" -msgid "" -"Calculates the edge disjoint paths between two groups of vertices. Utilizes " -"underlying maximum flow algorithms to calculate the paths." +msgid "Calculates the edge disjoint paths between two groups of vertices. Utilizes underlying maximum flow algorithms to calculate the paths." msgstr "计算两组顶点之间的边不相交路径。 利用底层最大流量算法来计算路径。" msgid "The main characterics are:" @@ -13907,9 +11085,7 @@ msgstr "主要特点是：" msgid "Calculates the edge disjoint paths between any two groups of vertices." msgstr "计算任意两组顶点之间的边相交路径。" -msgid "" -"Returns EMPTY SET when source and destination are the same, or cannot be " -"reached." +msgid "Returns EMPTY SET when source and destination are the same, or cannot be reached." msgstr "当源和目标相同或无法到达时，返回 EMPTY SET。" msgid "The graph can be directed or undirected." @@ -13918,46 +11094,23 @@ msgstr "图可以是有向或无向的。" msgid "Uses :doc:`pgr_boykovKolmogorov` to calculate the paths." msgstr "使用 :doc:`pgr_boykovKolmogorov` 计算路径。" -msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, " -"[``directed``])" -msgstr "" -"pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, " -"[``directed``])" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vids**, " -"[``directed``])" -msgstr "" -"pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vids**, " -"[``directed``])" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vid**, " -"[``directed``])" -msgstr "" -"pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, " -"[``directed``])" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" -msgstr "" -"pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgid "" -"pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgstr "" -"pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" -msgid "" -"Using a combinations table, equivalent to calculating result from vertices :" -"math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}` on an undirected " -"graph." -msgstr "" -"使用组合表，相当于计算无向图上从顶点 :math:`\\{5, 6\\}` 到顶点 :math:`\\{10, " -"15, 14\\}` 的结果。" +msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}` on an undirected graph." +msgstr "使用组合表，相当于计算无向图上从顶点 :math:`\\{5, 6\\}` 到顶点 :math:`\\{10, 15, 14\\}` 的结果。" msgid "Manually assigned vertex combinations on an undirected graph." msgstr "在无向图上手动分配顶点组合。" @@ -13965,12 +11118,8 @@ msgstr "在无向图上手动分配顶点组合。" msgid "``pgr_edmondsKarp``" msgstr "``pgr_edmondsKarp``" -msgid "" -"``pgr_edmondsKarp`` — Calculates the flow on the graph edges that maximizes " -"the flow from the sources to the targets using Edmonds Karp Algorithm." -msgstr "" -"``pgr_edmondsKarp`` — 使用 Edmonds Karp 算法计算图边上的流量，以最大化从源到" -"目标的流量。" +msgid "``pgr_edmondsKarp`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Edmonds Karp Algorithm." +msgstr "``pgr_edmondsKarp`` — 使用 Edmonds Karp 算法计算图边上的流量，以最大化从源到目标的流量。" msgid "pgr_edmondsKarp(Combinations)" msgstr "pgr_edmondsKarp(组合)" @@ -13996,12 +11145,8 @@ msgstr "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vids**)" msgid "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" msgstr "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" -msgid "" -"`Boost: Edmonds Karp max flow `__" -msgstr "" -"`Boost: Edmonds Karp max flow `__" +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" @@ -14009,44 +11154,22 @@ msgstr "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" msgid "``pgr_edwardMoore`` - Experimental" msgstr "``pgr_edwardMoore`` - 实验性" -msgid "" -"``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore algorithm." +msgid "``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore algorithm." msgstr "`pgr_edwardMoore`` - 使用 Edward-Moore 算法返回最短路径。" -msgid "" -"Edward Moore’s Algorithm is an improvement of the Bellman-Ford Algorithm. It " -"can compute the shortest paths from a single source vertex to all other " -"vertices in a weighted directed graph. The main difference between Edward " -"Moore's Algorithm and Bellman Ford's Algorithm lies in the run time." -msgstr "" -"Edward Moore算法是Bellman-Ford算法的改进。 它可以计算加权有向图中从单个源顶点" -"到所有其他顶点的最短路径。 Edward Moore算法和Bellman-Ford算法之间的主要区别在" -"于运行时间。" +msgid "Edward Moore’s Algorithm is an improvement of the Bellman-Ford Algorithm. It can compute the shortest paths from a single source vertex to all other vertices in a weighted directed graph. The main difference between Edward Moore's Algorithm and Bellman Ford's Algorithm lies in the run time." +msgstr "Edward Moore算法是Bellman-Ford算法的改进。 它可以计算加权有向图中从单个源顶点到所有其他顶点的最短路径。 Edward Moore算法和Bellman-Ford算法之间的主要区别在于运行时间。" -msgid "" -"The worst-case running time of the algorithm is :math:`O(| V | * | E |)` " -"similar to the time complexity of Bellman-Ford algorithm. However, " -"experiments suggest that this algorithm has an average running time " -"complexity of :math:`O( | E | )` for random graphs. This is significantly " -"faster in terms of computation speed." -msgstr "" -"该算法的最坏运行时间为 :math:`O(| V | * | E |)` ，类似于Bellman-Ford算法的时" -"间复杂度。然而，实验表明，对于随机图，该算法的平均运行时间复杂度为 :math:" -"`O( | E | )`。这在计算速度上明显更快。" +msgid "The worst-case running time of the algorithm is :math:`O(| V | * | E |)` similar to the time complexity of Bellman-Ford algorithm. However, experiments suggest that this algorithm has an average running time complexity of :math:`O( | E | )` for random graphs. This is significantly faster in terms of computation speed." +msgstr "该算法的最坏运行时间为 :math:`O(| V | * | E |)` ，类似于Bellman-Ford算法的时间复杂度。然而，实验表明，对于随机图，该算法的平均运行时间复杂度为 :math:`O( | E | )`。这在计算速度上明显更快。" -msgid "" -"Thus, the algorithm is at-best, significantly faster than Bellman-Ford " -"algorithm and is at-worst,as good as Bellman-Ford algorithm" -msgstr "" -"因此，该算法在最好的情况下，明显快于 Bellman-Ford 算法，在最差的情况下，与 " -"Bellman-Ford 算法一样好" +msgid "Thus, the algorithm is at-best, significantly faster than Bellman-Ford algorithm and is at-worst,as good as Bellman-Ford algorithm" +msgstr "因此，该算法在最好的情况下，明显快于 Bellman-Ford 算法，在最差的情况下，与 Bellman-Ford 算法一样好" msgid "The `agg_cost` the non included values `(v, v)` is :math:`0`" msgstr "未包含值 `(v, v)` 的 `agg_cost` 为 :math:`0`" -msgid "" -"For optimization purposes, any duplicated value in the `start vids` or `end " -"vids` are ignored." +msgid "For optimization purposes, any duplicated value in the `start vids` or `end vids` are ignored." msgstr "出于优化目的， `start vids` 或`end vids`中的任何重复值都将被忽略。" msgid "Running time:" @@ -14058,25 +11181,17 @@ msgstr "最坏的情况： :math:`O(| V | * | E |)`" msgid "Average case: :math:`O( | E | )`" msgstr "平均情况： :math:`O( | E | )`" -msgid "" -"pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgstr "" -"pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" -msgid "" -"pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgstr "" -"pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" -msgid "" -"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgstr "" -"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" -msgid "" -"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" -msgstr "" -"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgid "pgr_edwardMoore(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "pgr_edwardMoore(`Edges SQL`_, `Combinations SQL`_, [``directed``])" @@ -14093,14 +11208,10 @@ msgstr "``pgr_extractVertices``" msgid "``pgr_extractVertices`` — Extracts the vertices information" msgstr "``pgr_extractVertices`` — 提取顶点信息" -msgid "" -"This is an auxiliary function for extracting the vertex information of the " -"set of edges of a graph." +msgid "This is an auxiliary function for extracting the vertex information of the set of edges of a graph." msgstr "这是一个用于提取图的边集的顶点信息的辅助函数。" -msgid "" -"When the edge identifier is given, then it will also calculate the in and " -"out edges" +msgid "When the edge identifier is given, then it will also calculate the in and out edges" msgstr "当给出边标识符时，它也会计算出入边" msgid "pgr_extractVertices(`Edges SQL`_, [``dryrun``])" @@ -14124,12 +11235,8 @@ msgstr "``LINESTRING``" msgid "Geometry of the edge." msgstr "边的几何形状。" -msgid "" -"This inner query takes precedence over the next two inner query, therefore " -"other columns are ignored when ``geom`` column appears." -msgstr "" -"该内部查询优先于接下来的两个内部查询，因此当 ``geom`` 列出现时，其他列将被忽" -"略。" +msgid "This inner query takes precedence over the next two inner query, therefore other columns are ignored when ``geom`` column appears." +msgstr "该内部查询优先于接下来的两个内部查询，因此当 ``geom`` 列出现时，其他列将被忽略。" msgid "Ignored columns:" msgstr "忽略的列：" @@ -14143,9 +11250,7 @@ msgstr "``endpoint``" msgid "When vertex geometry is known" msgstr "当顶点几何形状已知时" -msgid "" -"To use this inner query the column ``geom`` should not be part of the set of " -"columns." +msgid "To use this inner query the column ``geom`` should not be part of the set of columns." msgstr "要使用此内部查询，列 ``geom`` 不应成为列集的一部分。" msgid "``POINT``" @@ -14157,22 +11262,14 @@ msgstr "起始顶点的 POINT 几何图形。" msgid "POINT geometry of the ending vertex." msgstr "结束顶点POINT的几何图形。" -msgid "" -"This inner query takes precedence over the next inner query, therefore other " -"columns are ignored when ``startpoint`` and ``endpoint`` columns appears." -msgstr "" -"此内部查询优先于下一个内部查询，因此当出现 ``startpoint`` 和 ``endpoint`` 列" -"时，其他列将被忽略。" +msgid "This inner query takes precedence over the next inner query, therefore other columns are ignored when ``startpoint`` and ``endpoint`` columns appears." +msgstr "此内部查询优先于下一个内部查询，因此当出现 ``startpoint`` 和 ``endpoint`` 列时，其他列将被忽略。" msgid "When identifiers of vertices are known" msgstr "当顶点的标识符已知时" -msgid "" -"To use this inner query the columns ``geom``, ``startpoint`` and " -"``endpoint`` should not be part of the set of columns." -msgstr "" -"要使用此内部查询，列 ``geom`` 、 ``startpoint`` 和 ``endpoint`` 不应成为列集" -"的一部分。" +msgid "To use this inner query the columns ``geom``, ``startpoint`` and ``endpoint`` should not be part of the set of columns." +msgstr "要使用此内部查询，列 ``geom`` 、 ``startpoint`` 和 ``endpoint`` 不应成为列集的一部分。" msgid "``NULL`` When the ``id`` is not part of the inner query" msgstr "``NULL`` 当 ``id`` 不是内部查询的一部分时" @@ -14186,9 +11283,7 @@ msgstr "``NULL`` 当没有提供几何图形时" msgid "Geometry of the point" msgstr "点几何" -msgid "" -"To get the query generated used to get the vertex information, use ``dryrun :" -"= true``." +msgid "To get the query generated used to get the vertex information, use ``dryrun := true``." msgstr "要获取用于生成顶点信息的查询，请使用 ``dryrun := true`` 。" msgid "Create a routing topology" @@ -14200,10 +11295,8 @@ msgstr "确保数据库没有 ``vertices_table``" msgid "Clean up the columns of the routing topology to be created" msgstr "清理要创建的路由拓扑的列" -msgid "" -"When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, )``" -msgstr "" -"当 ``LINESTRING`` 具有 SRID 时，请使用 ``geom::geometry(POINT, )``" +msgid "When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, )``" +msgstr "当 ``LINESTRING`` 具有 SRID 时，请使用 ``geom::geometry(POINT, )``" msgid "For big edge tables that are been prepared," msgstr "对于已经准备好的大型边表，" @@ -14241,33 +11334,23 @@ msgstr "``pgr_findCloseEdges`` - 查找点几何图形的闭合边。" msgid "``partial`` option is removed." msgstr "``partial`` 选项已被移除。" -msgid "" -"``pgr_findCloseEdges`` - An utility function that finds the closest edge to " -"a point geometry." -msgstr "" -"``pgr_findCloseEdges`` - 一个用于查找距离点状geometry最近边的工具函数。" +msgid "``pgr_findCloseEdges`` - An utility function that finds the closest edge to a point geometry." +msgstr "``pgr_findCloseEdges`` - 一个用于查找距离点状geometry最近边的工具函数。" -msgid "" -"The geometries must be in the same coordinate system (have the same SRID)." +msgid "The geometries must be in the same coordinate system (have the same SRID)." msgstr "几何图形必须位于同一坐标系中（具有相同的 SRID）。" -msgid "" -"The code to do the calculations can be obtained for further specific " -"adjustments needed by the application." +msgid "The code to do the calculations can be obtained for further specific adjustments needed by the application." msgstr "可以获取计算代码，以便根据应用需要进行进一步的具体调整。" msgid "``EMPTY SET`` is returned on dryrun executions" msgstr "空结果集 ``EMPTY SET`` 会在试运行中返回" -msgid "" -"pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" -msgstr "" -"pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" +msgid "pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" +msgstr "pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" -msgid "" -"pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" -msgstr "" -"pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" +msgid "pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" +msgstr "pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" msgid "**options:** ``[cap, dryrun]``" msgstr "**options:** ``[cap, dryrun]``" @@ -14317,12 +11400,8 @@ msgstr "限制输出行数" msgid "When ``false`` calculations are performed." msgstr "当为 ``false`` 时，执行计算。" -msgid "" -"When ``true`` calculations are not performed and the query to do the " -"calculations is exposed in a PostgreSQL ``NOTICE``." -msgstr "" -"当为 ``true`` 时，不执行计算，并在 PostgreSQL 的 ``NOTICE`` 中显示执行计算的" -"查询。" +msgid "When ``true`` calculations are not performed and the query to do the calculations is exposed in a PostgreSQL ``NOTICE``." +msgstr "当为 ``true`` 时，不执行计算，并在 PostgreSQL 的 ``NOTICE`` 中显示执行计算的查询。" msgid "``geometry``" msgstr "``geometry``" @@ -14333,9 +11412,7 @@ msgstr "边的 ``LINESTRING`` 几何。" msgid "When :math:`cap = 1`, it is the closest edge." msgstr "当 :math:`cap = 1` 时，它是最近的边。" -msgid "" -"Value in <0,1> that indicates the relative position from the first end-point " -"of the edge." +msgid "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:" @@ -14359,12 +11436,8 @@ msgstr "点到边线的距离。" msgid "Original ``POINT`` geometry." msgstr "原始的 ``POINT`` 几何形状。" -msgid "" -"``LINESTRING`` geometry that connects the original **point** to the closest " -"point of the edge with identifier ``edge_id``" -msgstr "" -"连接原始 **point** 和具有标识符 ``edge_id`` 的边的最近点的 ``LINESTRING`` 几" -"何体" +msgid "``LINESTRING`` geometry that connects the original **point** to the closest point of the edge with identifier ``edge_id``" +msgstr "连接原始 **point** 和具有标识符 ``edge_id`` 的边的最近点的 ``LINESTRING`` 几何体" msgid "One point in an edge" msgstr "边线上的一个点" @@ -14375,11 +11448,8 @@ msgstr "绿色节点为原始点。" msgid "``geom`` has the value of the original point." msgstr "``geom`` 包含原始点的坐标值。" -msgid "" -"The geometry ``edge`` is a line that connects the original point with the " -"edge :math:`sp \\rightarrow ep` edge." -msgstr "" -"几何图形 ``edge`` 是连接原始点与边线 :math:`sp \\rightarrow ep` 的线段。" +msgid "The geometry ``edge`` is a line that connects the original point with the edge :math:`sp \\rightarrow ep` edge." +msgstr "几何图形 ``edge`` 是连接原始点与边线 :math:`sp \\rightarrow ep` 的线段。" msgid "The point is located at the left of the edge." msgstr "该点位于边线的左侧。" @@ -14399,9 +11469,7 @@ msgstr "``dryrun => true``" msgid "Generates a PostgreSQL ``NOTICE`` with the code used." msgstr "生成一个包含用于计算所有列的代码的 PostgreSQL ``NOTICE`` 。" -msgid "" -"The generated code can be used as a starting base code for additional " -"requirements, like taking into consideration the SRID." +msgid "The generated code can be used as a starting base code for additional requirements, like taking into consideration the SRID." msgstr "生成的代码可用作满足其他要求（如考虑 SRID）的起始基础代码。" msgid "Many points in an edge" @@ -14410,18 +11478,11 @@ msgstr "一条边上有许多点" msgid "The green nodes are the **original points**" msgstr "绿色节点为 **原始点**" -msgid "" -"The geometry ``geom``, marked as **g1** and **g2** are the **original " -"points**" +msgid "The geometry ``geom``, marked as **g1** and **g2** are the **original points**" msgstr "标为 **g1** 和 **g2** 的几何体 ``geom`` 是 **原始点**" -msgid "" -"The geometry ``edge``, marked as **edge1** and **edge2** is a line that " -"connects the **original point** with the closest point on the :math:`sp " -"\\rightarrow ep` edge." -msgstr "" -"标为 **edge1** 和 **edge2** 的几何图形 ``edge`` 是一条连接 ** 原始点** 和 :" -"math:`sp \\rightarrow ep` 边上最近点的线。" +msgid "The geometry ``edge``, marked as **edge1** and **edge2** is a line that connects the **original point** with the closest point on the :math:`sp \\rightarrow ep` edge." +msgstr "标为 **edge1** 和 **edge2** 的几何图形 ``edge`` 是一条连接 ** 原始点** 和 :math:`sp \\rightarrow ep` 边上最近点的线。" msgid "Many points dry run execution" msgstr "多点模拟执行" @@ -14429,8 +11490,7 @@ msgstr "多点模拟执行" msgid "Do not process query" msgstr "不处理查询" -msgid "" -"Generate a PostgreSQL ``NOTICE`` with the code used to calculate all columns" +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" @@ -14448,22 +11508,13 @@ msgstr "处理图外的点。" msgid "Points of interest" msgstr "兴趣点" -msgid "" -"Some times the applications work \"on the fly\" starting from a location " -"that is not a vertex in the graph. Those locations, in pgRrouting are called " -"points of interest." -msgstr "" -"有时应用程序会“即时执行”，从不是图中顶点的位置开始。在pgRouting中，这些位置被" -"称为兴趣点。" +msgid "Some times the applications work \"on the fly\" starting from a location that is not a vertex in the graph. Those locations, in pgRrouting are called points of interest." +msgstr "有时应用程序会“即时执行”，从不是图中顶点的位置开始。在pgRouting中，这些位置被称为兴趣点。" -msgid "" -"The information needed in the points of interest is ``pid``, ``edge_id``, " -"``side``, ``fraction``." +msgid "The information needed in the points of interest is ``pid``, ``edge_id``, ``side``, ``fraction``." msgstr "兴趣点所需的信息包括 ``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." +msgid "On this documentation there will be some 6 fixed points of interest and they will be stored on a table." msgstr "在这份文档中，将有6个固定的兴趣点，并且它们将被存储在一个表中。" msgid "A unique identifier." @@ -14484,9 +11535,7 @@ msgstr "点的几何形状。" msgid "The distance between ``geom`` and the segment ``edge_id``." msgstr "``geom`` 与边线 ``edge_id`` 之间的距离。" -msgid "" -"A segment that connects the ``geom`` of the point to the closest point on " -"the segment ``edge_id``." +msgid "A segment that connects the ``geom`` of the point to the closest point on the segment ``edge_id``." msgstr "一个连接点的 ``geom`` 到边 ``edge_id`` 上最近点的线段。" msgid "``newPoint``" @@ -14504,9 +11553,7 @@ msgstr "插入兴趣点。" 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." +msgid "Any other additional modification: In this manual, point :math:`6` can be reached from both sides." msgstr "任何其他额外的修改：在本手册中，可从两侧到达点 :math:`6`。" msgid "The points of interest:" @@ -14515,22 +11562,11 @@ msgstr "兴趣点：" msgid "``pgr_floydWarshall``" msgstr "``pgr_floydWarshall``" -msgid "" -"``pgr_floydWarshall`` - Returns the sum of the costs of the shortest path " -"for each pair of nodes in the graph using Floyd-Warshall algorithm." -msgstr "" -"``pgr_floydWarshall`` - 使用 Floyd-Warshall 算法返回图中每对节点的最短路径成" -"本之和。" +msgid "``pgr_floydWarshall`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Floyd-Warshall algorithm." +msgstr "``pgr_floydWarshall`` - 使用 Floyd-Warshall 算法返回图中每对节点的最短路径成本之和。" -msgid "" -"The Floyd-Warshall algorithm, also known as Floyd's algorithm, is a good " -"choice to calculate the sum of the costs of the shortest path for each pair " -"of nodes in the graph, for *dense graphs*. We use Boost's implementation " -"which runs in :math:`\\Theta(V^3)` time," -msgstr "" -"Floyd-Warshall算法，也被称为 Floyd算法，是计算图中每一对节点间最短路径的路径" -"成本总和的一种良好选择，适用于*密集图*。我们使用Boost的实现，其运行时间为： :" -"math:`\\Theta(V^3)`，" +msgid "The Floyd-Warshall algorithm, also known as Floyd's algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *dense graphs*. We use Boost's implementation which runs in :math:`\\Theta(V^3)` time," +msgstr "Floyd-Warshall算法，也被称为 Floyd算法，是计算图中每一对节点间最短路径的路径成本总和的一种良好选择，适用于*密集图*。我们使用Boost的实现，其运行时间为： :math:`\\Theta(V^3)`，" msgid "pgr_floydWarshall(`Edges SQL`_, [``directed``])" msgstr "pgr_floydWarshall(`Edges SQL`_, [``directed``])" @@ -14539,18 +11575,13 @@ msgid "For a directed subgraph with edges :math:`\\{1, 2, 3, 4\\}`." msgstr "对于有边 :math:`\\{1, 2, 3, 4\\}` 的有向子图。" #, fuzzy -msgid "" -"Boost `Floyd-Warshall `_" -msgstr "" -"Boost `弗洛伊德-沃沙尔算法 `_" +msgid "Boost `Floyd-Warshall `_" +msgstr "Boost `弗洛伊德-沃沙尔算法 `_" msgid "``pgr_full_version``" msgstr "``pgr_full_version``" -msgid "" -"``pgr_full_version`` — Get the details of pgRouting version information." +msgid "``pgr_full_version`` — Get the details of pgRouting version information." msgstr "``pgr_full_version`` — 获取pgRouting版本信息的详细信息。" msgid "Get complete details of pgRouting version information" @@ -14622,36 +11653,14 @@ msgstr "pgRouting 构建的 Git 哈希" msgid "``pgr_hawickCircuits`` - Experimental" msgstr "``pgr_hawickCircuits`` - 实验性" -msgid "" -"``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits " -"algorithm." +msgid "``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits algorithm." msgstr "``pgr_hawickCircuits`` — 使用 Hawick 电路算法返回电路列表。" -msgid "" -"Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. " -"James. This algorithm solves the problem of detecting and enumerating " -"circuits in graphs. It is capable of circuit enumeration in graphs with " -"directed-arcs, multiple-arcs and self-arcs with a memory efficient and high-" -"performance im-plementation. It is an extension of Johnson's Algorithm of " -"finding all the elementary circuits of a directed graph." -msgstr "" -"Hawick Circuit 算法由 Ken Hawick 和 Health A. James 于 2008 年发表。 该算法解" -"决了图中电路的检测和枚举问题。 它能够在具有有向弧、多弧和自弧的图中进行电路枚" -"举，并具有内存高效和高性能的实现。 它是寻找有向图所有基本电路的约翰逊算法的扩" -"展。" +msgid "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. James. This algorithm solves the problem of detecting and enumerating circuits in graphs. It is capable of circuit enumeration in graphs with directed-arcs, multiple-arcs and self-arcs with a memory efficient and high-performance im-plementation. It is an extension of Johnson's Algorithm of finding all the elementary circuits of a directed graph." +msgstr "Hawick Circuit 算法由 Ken Hawick 和 Health A. James 于 2008 年发表。 该算法解决了图中电路的检测和枚举问题。 它能够在具有有向弧、多弧和自弧的图中进行电路枚举，并具有内存高效和高性能的实现。 它是寻找有向图所有基本电路的约翰逊算法的扩展。" -msgid "" -"There are 2 variations defined in the Boost Graph Library. Here, we have " -"implemented only 2nd as it serves the most suitable and practical usecase. " -"In this variation we get the circuits after filtering out the circuits " -"caused by parallel edges. Parallel edge circuits have more use cases when " -"you want to count the no. of circuits.Maybe in future, we will also " -"implemenent this variation." -msgstr "" -"Boost Graph Library 中定义了 2 个变体。 在这里，我们只实现了第二个，因为它服" -"务于最合适和最实用的用例。 在这个变体中，我们在过滤掉由平行边缘引起的电路后得" -"到电路。 当您想要计算数量时，并行边缘电路有更多用例。 也许将来我们也会实现这" -"种变化。" +msgid "There are 2 variations defined in the Boost Graph Library. Here, we have implemented only 2nd as it serves the most suitable and practical usecase. In this variation we get the circuits after filtering out the circuits caused by parallel edges. Parallel edge circuits have more use cases when you want to count the no. of circuits.Maybe in future, we will also implemenent this variation." +msgstr "Boost Graph Library 中定义了 2 个变体。 在这里，我们只实现了第二个，因为它服务于最合适和最实用的用例。 在这个变体中，我们在过滤掉由平行边缘引起的电路后得到电路。 当您想要计算数量时，并行边缘电路有更多用例。 也许将来我们也会实现这种变化。" msgid "The algorithm implementation works only for directed graph" msgstr "该算法实现仅适用于有向图" @@ -14677,8 +11686,7 @@ msgstr "pgRouting :doc:`sampledata` 中存在的电路" msgid "Id of the circuit starting from ``1``" msgstr "电路id从 ``1`` 开始" -msgid "" -"Relative position in the path. Has value ``0`` for beginning of the path" +msgid "Relative position in the path. Has value ``0`` for beginning of the path" msgstr "在路径中的相对位置。数值 ``0`` 表示路径的起点" msgid "Identifier of the starting vertex of the circuit." @@ -14690,38 +11698,22 @@ msgstr "电路结束顶点的标识符。" msgid "Identifier of the node in the path from a vid to next vid." msgstr "从 vid 到下一个 vid 的路径中节点的标识符。" -msgid "" -"`Boost: Hawick Circuit Algorithm `__" -msgstr "" -"`Boost：Hawick 电路算法 `__" +msgid "`Boost: Hawick Circuit Algorithm `__" +msgstr "`Boost：Hawick 电路算法 `__" msgid "``pgr_isPlanar`` - Experimental" msgstr "``pgr_isPlanar`` - 实验性" -msgid "" -"``pgr_isPlanar`` — Returns a boolean depending upon the planarity of the " -"graph." +msgid "``pgr_isPlanar`` — Returns a boolean depending upon the planarity of the graph." msgstr "``pgr_isPlanar`` — 根据图的平面性返回布尔值。" -msgid "" -"A graph is planar if it can be drawn in two-dimensional space with no two of " -"its edges crossing. Such a drawing of a planar graph is called a plane " -"drawing. Every planar graph also admits a straight-line drawing, which is a " -"plane drawing where each edge is represented by a line segment. When a graph " -"has :math:`K_5` or :math:`K_{3, 3}` as subgraph then the graph is not planar." -msgstr "" -"如果一个图可以在二维空间中绘制，使得它的任意两条边都不相交，那么这个图就是平" -"面图。这种平面图的绘制称为平面绘图。每个平面图也可以表示为一个直线绘图，即在" -"平面绘图中，每条边都由一条线段表示。当一个图包含 :math:`K_5` 或 :math:`K_{3, " -"3}` 作为子图时，这个图就不是平面图。" +msgid "A graph is planar if it can be drawn in two-dimensional space with no two of its edges crossing. Such a drawing of a planar graph is called a plane drawing. Every planar graph also admits a straight-line drawing, which is a plane drawing where each edge is represented by a line segment. When a graph has :math:`K_5` or :math:`K_{3, 3}` as subgraph then the graph is not planar." +msgstr "如果一个图可以在二维空间中绘制，使得它的任意两条边都不相交，那么这个图就是平面图。这种平面图的绘制称为平面绘图。每个平面图也可以表示为一个直线绘图，即在平面绘图中，每条边都由一条线段表示。当一个图包含 :math:`K_5` 或 :math:`K_{3, 3}` 作为子图时，这个图就不是平面图。" msgid "This implementation use the Boyer-Myrvold Planarity Testing." msgstr "此实施使用 Boyer-Myrvold 平面度测试。" -msgid "" -"It will return a boolean value depending upon the planarity of the graph." +msgid "It will return a boolean value depending upon the planarity of the graph." msgstr "它将根据图形的平面性返回一个布尔值。" msgid "Applicable only for **undirected** graphs." @@ -14751,86 +11743,50 @@ msgstr "当图形是平面时为 `true`。" msgid "`false` when the graph is not planar." msgstr "当图形不是平面时为 `false`。" -msgid "" -"The following edges will make the subgraph with vertices {10, 15, 11, 16, " -"13} a :math:`K_1` graph." -msgstr "" -"以下边将构成具有顶点 {10, 15, 11, 16, 13} 的子图，这个子图是一个 :math:`K_1` " -"图。" +msgid "The following edges will make the subgraph with vertices {10, 15, 11, 16, 13} a :math:`K_1` graph." +msgstr "以下边将构成具有顶点 {10, 15, 11, 16, 13} 的子图，这个子图是一个 :math:`K_1` 图。" -msgid "" -"The new graph is not planar because it has a :math:`K_5` subgraph. Edges in " -"blue represent :math:`K_5` subgraph." -msgstr "" -"新图不是平面图，因为它具有一个 :math:`K_5` 子图。蓝色的边代表 :math:`K_5` 子" -"图。" +msgid "The new graph is not planar because it has a :math:`K_5` subgraph. Edges in blue represent :math:`K_5` subgraph." +msgstr "新图不是平面图，因为它具有一个 :math:`K_5` 子图。蓝色的边代表 :math:`K_5` 子图。" -msgid "" -"`Boost: Boyer Myrvold `__" -msgstr "" -"`Boost: Boyer-Myrvold 算法 `__" +msgid "`Boost: Boyer Myrvold `__" +msgstr "`Boost: Boyer-Myrvold 算法 `__" msgid "``pgr_johnson``" msgstr "``pgr_johnson``" #, fuzzy -msgid "" -"``pgr_johnson`` - Returns the sum of the costs of the shortest path for each " -"pair of nodes in the graph using Johnson algorithm." -msgstr "" -"``pgr_johnson`` - 使用 Jhonson 算法返回图中每对节点的最短路径成本之和。" +msgid "``pgr_johnson`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Johnson algorithm." +msgstr "``pgr_johnson`` - 使用 Jhonson 算法返回图中每对节点的最短路径成本之和。" -msgid "" -"The Johnson algorithm, is a good choice to calculate the sum of the costs of " -"the shortest path for each pair of nodes in the graph, for *sparse graphs*. " -"It uses the Boost's implementation which runs in :math:`O(V E \\log V)` time," -msgstr "" -"Johnson 算法是计算图中每对节点的最短路径总成本的一个良好选择，特别适用于*稀疏" -"图*。它使用 Boost 实现，运行时间为 :math:`O(V E \\log V)` ，" +msgid "The Johnson algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *sparse graphs*. It uses the Boost's implementation which runs in :math:`O(V E \\log V)` time," +msgstr "Johnson 算法是计算图中每对节点的最短路径总成本的一个良好选择，特别适用于*稀疏图*。它使用 Boost 实现，运行时间为 :math:`O(V E \\log V)` ，" msgid "pgr johnson(`Edges SQL`_, [``directed``])" msgstr "pgr johnson(`Edges SQL`_, [``directed``])" -msgid "" -"Boost `Johnson `_" -msgstr "" -"Boost `Johnson 算法 `_" +msgid "Boost `Johnson `_" +msgstr "Boost `Johnson 算法 `_" #, fuzzy msgid "``pgr_kingOrdering`` - Experimental" msgstr "``pgr_edgeColoring`` - 实验性" #, fuzzy -msgid "" -"``pgr_kingOrdering`` — Returns the King ordering of an undirected graph." +msgid "``pgr_kingOrdering`` — Returns the King ordering of an undirected graph." msgstr "``pgr_cuthillMckeeOrdering`` — 返回无向图的反向 Cuthill-Mckee 排序" -msgid "" -"In numerical linear algebra and graph theory, the King ordering algorithm is " -"a heuristic designed to reorder the vertices of a graph so as to reduce its " -"bandwidth." +msgid "In numerical linear algebra and graph theory, the King ordering algorithm is a heuristic designed to reorder the vertices of a graph so as to reduce its bandwidth." msgstr "" -msgid "" -"The method follows a breadth-first search (BFS) traversal, but with a " -"refinement: at each step, the unvisited neighbors of the current vertex are " -"inserted into the queue in ascending order of their pseudo-degree, where the " -"pseudo-degree of a vertex is the number of edges connecting it to yet-" -"unvisited vertices. This prioritization often yields a smaller bandwidth " -"compared to simpler BFS orderings." +msgid "The method follows a breadth-first search (BFS) traversal, but with a refinement: at each step, the unvisited neighbors of the current vertex are inserted into the queue in ascending order of their pseudo-degree, where the pseudo-degree of a vertex is the number of edges connecting it to yet-unvisited vertices. This prioritization often yields a smaller bandwidth compared to simpler BFS orderings." msgstr "" #, fuzzy msgid "The implementation targets undirected graphs." msgstr "该实现适用于 **无向** 图。" -msgid "" -"Bandwidth minimization is an NP-complete problem; King ordering provides a " -"practical local minimization approach." +msgid "Bandwidth minimization is an NP-complete problem; King ordering provides a practical local minimization approach." msgstr "" #, fuzzy @@ -14850,22 +11806,16 @@ msgid "pgr_kingOrdering(`Edges SQL`_)" msgstr "pgr_edgeColoring(`Edges SQL`_)" #, fuzzy -msgid "" -"`Boost: King Ordering `__" -msgstr "" -"`Boost: 边着色 `__" +msgid "`Boost: King Ordering `__" +msgstr "`Boost: 边着色 `__" msgid "``pgr_kruskal``" msgstr "``pgr_kruskal``" -msgid "" -"``pgr_kruskal`` — Minimum spanning tree of a graph using Kruskal's algorithm." +msgid "``pgr_kruskal`` — Minimum spanning tree of a graph using Kruskal's algorithm." msgstr "``pgr_kruskal`` — 使用 Kruskal 算法的图的最小生成树。" -msgid "" -"This algorithm finds the minimum spanning forest in a possibly disconnected " -"graph using Kruskal's algorithm." +msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Kruskal's algorithm." msgstr "该算法使用 Kruskal 算法在可能断开的图中找到最小生成森林。" msgid "EMPTY SET is returned when there are no edges in the graph." @@ -14880,19 +11830,14 @@ msgstr "返回 |result-mst| 的集合" msgid "Minimum spanning forest" msgstr "最小生成森林" -msgid "" -"``pgr_kruskalBFS`` — Kruskal's algorithm for Minimum Spanning Tree with " -"breadth First Search ordering." +msgid "``pgr_kruskalBFS`` — Kruskal's algorithm for Minimum Spanning Tree with 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." -msgstr "" -"访问并提取使用 Kruskal 算法创建的最小生成树的呼吸优先搜索排序中的节点信息。" +msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." +msgstr "访问并提取使用 Kruskal 算法创建的最小生成树的呼吸优先搜索排序中的节点信息。" msgid "Returned tree nodes from a root vertex are on Breath First Search order" msgstr "从根顶点返回的树节点遵循广度优先搜索顺序" @@ -14909,21 +11854,14 @@ msgstr "pgr_kruskalBFS(`Edges SQL`_, **root vids**, [``max_depth``])" msgid "The Minimum Spanning Tree having as root vertex :math:`6`" msgstr "以根顶点为 :math:`6` 的最小生成树" -msgid "" -"The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:" -"`depth \\leq 3`" +msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`depth \\leq 3`" msgstr "以顶点 :math:`\\{9, 6\\}` 为起点， :math:`depth \\leq 3` 的最小生成树" msgid "``pgr_kruskalDD`` — Catchament nodes using Kruskal's algorithm." msgstr "``pgr_kruskalDD`` — 使用 Kruskal 算法的汇流节点。" -msgid "" -"Using Kruskal's algorithm, extracts the nodes that have aggregate costs less " -"than or equal to a **distance** from a **root** vertex (or vertices) within " -"the calculated minimum spanning tree." -msgstr "" -"使用 Kruskal 算法，在计算的最小生成树中提取总成本小于或等于距 **根** 顶点（或" -"多个顶点） **距离** 的节点。" +msgid "Using Kruskal's algorithm, extracts the nodes that have aggregate costs less than or equal to a **distance** from a **root** vertex (or vertices) within the calculated minimum spanning tree." +msgstr "使用 Kruskal 算法，在计算的最小生成树中提取总成本小于或等于距 **根** 顶点（或多个顶点） **距离** 的节点。" msgid "Returned tree nodes from a root vertex are on Depth First Search order." msgstr "从根顶点返回的树节点遵循深度优先搜索顺序。" @@ -14937,29 +11875,17 @@ msgstr "pgr_kruskalDD(`Edges SQL`_, **root vid**, **distance**)" msgid "pgr_kruskalDD(`Edges SQL`_, **root vids**, **distance**)" msgstr "pgr_kruskalDD(`Edges SQL`_, **root vids**, **distance**)" -msgid "" -"The Minimum Spanning Tree starting on vertex :math:`6` with :math:`distance " -"\\leq 3.5`" -msgstr "" -"以顶点 :math:`6` 为起点的，总成本小于或等于 :math:`distance \\leq 3.5` 的最小" -"生成树" +msgid "The Minimum Spanning Tree starting on vertex :math:`6` with :math:`distance \\leq 3.5`" +msgstr "以顶点 :math:`6` 为起点的，总成本小于或等于 :math:`distance \\leq 3.5` 的最小生成树" -msgid "" -"The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:" -"`distance \\leq 3.5`" -msgstr "" -"以顶点 :math:`\\{9, 6\\}` 为起点， :math:`distance \\leq 3.5` 的最小生成树" +msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`distance \\leq 3.5`" +msgstr "以顶点 :math:`\\{9, 6\\}` 为起点， :math:`distance \\leq 3.5` 的最小生成树" -msgid "" -"``pgr_kruskalDFS`` — Kruskal's algorithm for Minimum Spanning Tree with " -"Depth First Search ordering." +msgid "``pgr_kruskalDFS`` — Kruskal's algorithm for Minimum Spanning Tree with Depth First Search ordering." msgstr "``pgr_kruskalDFS`` — 具有深度优先搜索排序的最小生成树 Kruskal 算法。" -msgid "" -"Visits and extracts the nodes information in Depth First Search ordering of " -"the Minimum Spanning Tree created using Kruskal's algorithm." -msgstr "" -"访问并提取使用 Kruskal 算法创建的最小生成树的深度优先搜索顺序中的节点信息。" +msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." +msgstr "访问并提取使用 Kruskal 算法创建的最小生成树的深度优先搜索顺序中的节点信息。" msgid "Returned tree nodes from a root vertex are on Depth First Search order" msgstr "从根顶点返回的树节点按深度优先搜索顺序" @@ -14973,18 +11899,11 @@ msgstr "pgr_kruskalDFS(`Edges SQL`_, **root vids**, [``max_depth``])" msgid "``pgr_lengauerTarjanDominatorTree`` - Experimental" msgstr "``pgr_lengauerTarjanDominatorTree`` - 实验性" -msgid "" -"``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all " -"vertices." +msgid "``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all vertices." msgstr "``pgr_lengauerTarjanDominatorTree`` — 返回所有顶点的直接支配者。" -msgid "" -"The algorithm calculates the *immediate dominator* of each vertex called " -"**idom**, once **idom** of each vertex is calculated then by making every " -"**idom** of each vertex as its parent, the dominator tree can be built." -msgstr "" -"该算法计算每个顶点的*immediate dominator*，称为**idom**，一旦计算出每个顶点的" -"**idom**，就可以将每个顶点的**idom**作为其父节点，从而构建支配者树。" +msgid "The algorithm calculates the *immediate dominator* of each vertex called **idom**, once **idom** of each vertex is calculated then by making every **idom** of each vertex as its parent, the dominator tree can be built." +msgstr "该算法计算每个顶点的*immediate dominator*，称为**idom**，一旦计算出每个顶点的**idom**，就可以将每个顶点的**idom**作为其父节点，从而构建支配者树。" msgid "The algorithm works in directed graph only." msgstr "该算法仅适用于有向图。" @@ -14992,8 +11911,7 @@ msgstr "该算法仅适用于有向图。" msgid "The algorithm returns *idom* of each vertex." msgstr "该算法返回每个顶点的* idom*。" -msgid "" -"If the *root vertex* not present in the graph then it returns empty set." +msgid "If the *root vertex* not present in the graph then it returns empty set." msgstr "如果图中不存在*根顶点*，则返回空集。" msgid "Running time: :math:`O((V+E)log(V+E))`" @@ -15032,57 +11950,38 @@ msgstr "顶点的直接支配者。" msgid "Dominator tree of another component." msgstr "另一个组件的支配树。" -msgid "" -"`Boost: Lengauer-Tarjan dominator `__" -msgstr "" -"`Boost: Lengauer-Tarjan 支配者算法 `__" +msgid "`Boost: Lengauer-Tarjan dominator `__" +msgstr "`Boost: Lengauer-Tarjan 支配者算法 `__" -msgid "" -"`Wikipedia: dominator tree `__" -msgstr "" -"`维基百科:支配树 `__" +msgid "`Wikipedia: dominator tree `__" +msgstr "`维基百科:支配树 `__" msgid "``pgr_lineGraph`` - Proposed" msgstr "``pgr_lineGraph`` - 提议中" -msgid "" -"``pgr_lineGraph`` — Transforms the given graph into its corresponding edge-" -"based graph." +msgid "``pgr_lineGraph`` — Transforms the given graph into its corresponding edge-based graph." msgstr "``pgr_lineGraph`` — 将给定图转换为其相应的基于边的图。" 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:" +msgid "Given a graph :math:`G`, its line graph :math:`L(G)` is a graph such that:" msgstr "给定一个图 :math:`G`，其线图 :math:`L(G)` 是一个图，满足以下条件：" msgid "Each vertex of :math:`L(G)` represents an edge of :math:`G`." msgstr ":math:`L(G)` 的每个顶点代表 :math:`G` 的一条边。" -msgid "" -"Two vertices of :math:`L(G)` are adjacent if and only if their corresponding " -"edges share a common endpoint in :math:`G`" -msgstr "" -":math:`L(G)` 的两个顶点相邻，当且仅当它们对应的边在 :math:`G` 中共享一个共同" -"端点时" +msgid "Two vertices of :math:`L(G)` are adjacent if and only if their corresponding edges share a common endpoint in :math:`G`" +msgstr ":math:`L(G)` 的两个顶点相邻，当且仅当它们对应的边在 :math:`G` 中共享一个共同端点时" -msgid "" -"The ``cost`` and ``reverse_cost`` columns of the result represent existence " -"of the edge." +msgid "The ``cost`` and ``reverse_cost`` columns of the result represent existence of the edge." msgstr "结果中的 ``cost`` 和 ``reverse_cost`` 列表示边的存在性。" msgid "When the graph is directed the result is directed." msgstr "当图形是有向的，结果也是有向的。" -msgid "" -"To get the complete Line Graph use unique identifiers on the double way " -"edges (See `Additional Examples`_)." -msgstr "" -"要获取完整的线图，请在双向边上使用唯一标识符 (See `Additional Examples`_)." +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 "当图无向时，成本矩阵是对称的。" @@ -15111,37 +12010,25 @@ msgstr "为负时：目标是原始图中的反向边。" msgid "Weight of the edge (``source``, ``target``)." msgstr "边 (``source``, ``target``) 的权重。" -msgid "" -"When `negative`: edge (``source``, ``target``) does not exist, therefore " -"it’s not part of the graph." +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``)的权重。" -msgid "" -"When `negative`: edge (``target``, ``source``) does not exist, therefore " -"it’s not part of the graph." +msgid "When `negative`: edge (``target``, ``source``) does not exist, therefore it’s not part of the graph." msgstr "当为负时：边(``target``, ``source``)不存在，因此它不是图的一部分。" msgid "Given the following directed graph" 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 ":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 "用共享边标识符定向表示" -msgid "" -"For the simplicity, the design of the edges table on the database, has the " -"edge's identifiers are represented with 3 digits:" +msgid "For the simplicity, the design of the edges table on the database, has the edge's identifiers are represented with 3 digits:" msgstr "为了简化数据库中边表的设计，边的标识符采用3位数字表示：" msgid "hundreds" @@ -15165,31 +12052,20 @@ msgstr "目标顶点" msgid "In this image," msgstr "在这张图片中，" -msgid "" -"Single or double head arrows represent one edge (row) on the edges table." +msgid "Single or double head arrows represent one edge (row) on the edges table." msgstr "单向或双向箭头表示边表中的一条边（行）。" msgid "The numbers in the yellow shadow are the edge identifiers." msgstr "黄色阴影中的数字是边缘标识符。" -msgid "" -"Two pair of edges share the same identifier when the ``reverse_cost`` column " -"is used." +msgid "Two pair of edges share the same identifier when the ``reverse_cost`` column is used." msgstr "当使用 ``reverse_cost`` 列时，两个边对会共享相同的标识符。" -msgid "" -"Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with one " -"edge row with :math:`id=203`." -msgstr "" -"边 :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` 用一条边行表示，标识符其 :" -"math:`id=203` 。" +msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with one edge row with :math:`id=203`." +msgstr "边 :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` 用一条边行表示，标识符其 :math:`id=203` 。" -msgid "" -"Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with one " -"edge row with :math:`id=304`." -msgstr "" -"边 :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` 用一条边的行表示，标识符为 :" -"math:`id=304` 。" +msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with one edge row with :math:`id=304`." +msgstr "边 :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` 用一条边的行表示，标识符为 :math:`id=304` 。" msgid "The graph can be created as follows:" msgstr "图表的创建过程如下：" @@ -15200,15 +12076,13 @@ msgstr "用共享边表示的有向图的线图" msgid "The result is a directed graph." msgstr "结果就是一个有向图。" -msgid "" -"For :math:`seq=4` from :math:`203 \\leftrightarrow 304` represent two edges" +msgid "For :math:`seq=4` from :math:`203 \\leftrightarrow 304` represent two edges" msgstr "对于 :math:`seq=4` ，从:math:`203 \\leftrightarrow 304` 表示两条边" msgid "For all the other values of ``seq`` represent one edge." msgstr "所有其他的 ``seq`` 值都代表一条边。" -msgid "" -"The ``cost`` and ``reverse_cost`` values represent the existence of the edge." +msgid "The ``cost`` and ``reverse_cost`` values represent the existence of the edge." msgstr "``cost`` 和 ``reverse_cost`` 的值表示边的存在。" msgid "When positive: the edge exists." @@ -15226,97 +12100,61 @@ msgstr "单头箭头代表边表中的一条边（行）。" msgid "There are no double head arrows" msgstr "没有双向头箭" -msgid "" -"Two pair of edges share the same ending nodes and the ``reverse_cost`` " -"column is not used." +msgid "Two pair of edges share the same ending nodes and the ``reverse_cost`` column is not used." 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:`{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` 。" +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` 。" msgid "Line Graph of a directed graph represented with unique edges" msgstr "用唯一边表示的有向图的线图" -msgid "" -"For :math:`seq=7` from :math:`203 \\leftrightarrow 302` represent two edges." +msgid "For :math:`seq=7` from :math:`203 \\leftrightarrow 302` represent two edges." msgstr "对于 :math:`seq=7` 从 :math:`203 \\leftrightarrow 302` 代表两条边。" -msgid "" -"For :math:`seq=8` from :math:`304 \\leftrightarrow 403` represent two edges." +msgid "For :math:`seq=8` from :math:`304 \\leftrightarrow 403` represent two edges." msgstr "对于 :math:`seq=8` ，从 :math:`304 \\leftrightarrow 403` 表示两条边。" msgid "wikipedia: `Line Graph `__" msgstr "维基百科: `Line Graph `__" -msgid "" -"mathworld: `Line Graph `__" -msgstr "" -"MathWorld在线数学资源: `Line Graph `__" +msgid "mathworld: `Line Graph `__" +msgstr "MathWorld在线数学资源: `Line Graph `__" msgid "``pgr_lineGraphFull`` - Experimental" msgstr "``pgr_lineGraphFull`` - 实验性" -msgid "" -"``pgr_lineGraphFull`` — Transforms a given graph into a new graph where all " -"of the vertices from the original graph are converted to line graphs." -msgstr "" -"``pgr_lineGraphFull`` — 将给定图转换为新图，其中原始图的所有顶点都转换为线" -"图。" +msgid "``pgr_lineGraphFull`` — Transforms a given graph into a new graph where all of the vertices from the original graph are converted to line graphs." +msgstr "``pgr_lineGraphFull`` — 将给定图转换为新图，其中原始图的所有顶点都转换为线图。" msgid "Version 2.6.0" msgstr "版本2.6.0" -msgid "" -"``pgr_lineGraphFull``, converts original directed graph to a directed line " -"graph by converting each vertex to a complete graph and keeping all the " -"original edges. The new connecting edges have a cost 0 and go between the " -"adjacent original edges, respecting the directionality." -msgstr "" -"``pgr_lineGraphFull``, 通过将每个顶点转换为完全图并保留所有原始边，将原始有向" -"图转换为有向线图。 新的连接边的成本为 0，并位于相邻的原始边之间，尊重方向性。" +msgid "``pgr_lineGraphFull``, converts original directed graph to a directed line graph by converting each vertex to a complete graph and keeping all the original edges. The new connecting edges have a cost 0 and go between the adjacent original edges, respecting the directionality." +msgstr "``pgr_lineGraphFull``, 通过将每个顶点转换为完全图并保留所有原始边，将原始有向图转换为有向线图。 新的连接边的成本为 0，并位于相邻的原始边之间，尊重方向性。" -msgid "" -"A possible application of the resulting graph is **\"routing with two edge " -"restrictions\"**:" +msgid "A possible application of the resulting graph is **\"routing with two edge restrictions\"**:" msgstr "结果图的一个可能的应用是 **\"具有两个边限制的路由\"**：" -msgid "" -"Setting a cost of using the vertex when routing between edges on the " -"connecting edge" +msgid "Setting a cost of using the vertex when routing between edges on the connecting edge" msgstr "设置在连接边上的边之间布线时使用顶点的成本" msgid "Forbid the routing between two edges by removing the connecting edge" msgstr "通过删除连接边来禁止两条边之间的布线" -msgid "" -"This is possible because each of the intersections (vertices) in the " -"original graph are now complete graphs that have a new edge for each " -"possible turn across that intersection." -msgstr "" -"这是可能的，因为原始图中的每个交叉点（顶点）现在都是完整的图，对于穿过该交叉" -"点的每个可能的转弯都有一条新边。" +msgid "This is possible because each of the intersections (vertices) in the original graph are now complete graphs that have a new edge for each possible turn across that intersection." +msgstr "这是可能的，因为原始图中的每个交叉点（顶点）现在都是完整的图，对于穿过该交叉点的每个可能的转弯都有一条新边。" msgid "This function is for **directed** graphs." msgstr "该函数适用于 **有向** 图。" -msgid "" -"Results are undefined when a negative vertex id is used in the input graph." +msgid "Results are undefined when a negative vertex id is used in the input graph." msgstr "当输入图中使用负顶点 id 时，结果是不确定的。" -msgid "" -"Results are undefined when a duplicated edge id is used in the input graph." +msgid "Results are undefined when a duplicated edge id is used in the input graph." msgstr "当输入图中使用重复的边 id 时，结果是不确定的。" msgid "Running time: TBD" @@ -15331,17 +12169,13 @@ msgstr "返回 |result-linegf| 的集合" msgid "Full line graph of subgraph of edges :math:`\\{4, 7, 8, 10\\}`" msgstr "边 :math:`\\{4, 7, 8, 10\\}` 子图的全线图" -msgid "" -"The examples include the subgraph including edges 4, 7, 8, and 10 with " -"``reverse_cost``." +msgid "The examples include the subgraph including edges 4, 7, 8, and 10 with ``reverse_cost``." msgstr "示例包含边线 4、7、8 和 10 构成的子图，且包含 ``reverse_cost`` 。" msgid "The data" msgstr "数据" -msgid "" -"This example displays how this graph transformation works to create " -"additional edges for each possible turn in a graph." +msgid "This example displays how this graph transformation works to create additional edges for each possible turn in a graph." msgstr "此示例显示此图形转换如何为图形中的每个可能的转弯创建附加边。" msgid "|first|" @@ -15359,44 +12193,22 @@ msgstr "|second|" msgid "second" msgstr "第二" -msgid "" -"In the transformed graph, all of the edges from the original graph are still " -"present (yellow), but we now have additional edges for every turn that could " -"be made across vertex 7 (orange)." -msgstr "" -"在转换后的图中，原始图中的所有边仍然存在（黄色），但现在我们为跨顶点 7 的每个" -"转弯提供了额外的边（橙色）。" +msgid "In the transformed graph, all of the edges from the original graph are still present (yellow), but we now have additional edges for every turn that could be made across vertex 7 (orange)." +msgstr "在转换后的图中，原始图中的所有边仍然存在（黄色），但现在我们为跨顶点 7 的每个转弯提供了额外的边（橙色）。" msgid "Creating table that identifies transformed vertices" msgstr "创建标识变换顶点的表" -msgid "" -"The vertices in the transformed graph are each created by splitting up the " -"vertices in the original graph. Unless a vertex in the original graph is a " -"leaf vertex, it will generate more than one vertex in the transformed graph. " -"One of the newly created vertices in the transformed graph will be given the " -"same vertex identifier as the vertex that it was created from in the " -"original graph, but the rest of the newly created vertices will have " -"negative vertex ids." -msgstr "" -"变换后的图中的每个顶点都是通过分割原始图中的顶点而创建的。 除非原始图中的某个" -"顶点是叶顶点，否则它将在变换后的图中生成多个顶点。 转换后的图中新创建的顶点之" -"一将被赋予与原始图中创建它的顶点相同的顶点标识符，但新创建的其余顶点将具有负" -"顶点 id。" +msgid "The vertices in the transformed graph are each created by splitting up the vertices in the original graph. Unless a vertex in the original graph is a leaf vertex, it will generate more than one vertex in the transformed graph. One of the newly created vertices in the transformed graph will be given the same vertex identifier as the vertex that it was created from in the original graph, but the rest of the newly created vertices will have negative vertex ids." +msgstr "变换后的图中的每个顶点都是通过分割原始图中的顶点而创建的。 除非原始图中的某个顶点是叶顶点，否则它将在变换后的图中生成多个顶点。 转换后的图中新创建的顶点之一将被赋予与原始图中创建它的顶点相同的顶点标识符，但新创建的其余顶点将具有负顶点 id。" -msgid "" -"Following is an example of how to generate a table that maps the ids of the " -"newly created vertices with the original vertex that they were created from" -msgstr "" -"以下是如何生成一个表的示例，该表将新创建的顶点的 id 与创建它们的原始顶点进行" -"映射" +msgid "Following is an example of how to generate a table that maps the ids of the newly created vertices with the original vertex that they were created from" +msgstr "以下是如何生成一个表的示例，该表将新创建的顶点的 id 与创建它们的原始顶点进行映射" msgid "Store edge results" msgstr "存储边结果" -msgid "" -"The first step is to store the results of the ``pgr_lineGraphFull`` call " -"into a table" +msgid "The first step is to store the results of the ``pgr_lineGraphFull`` call into a table" msgstr "第一步是将 ``pgr_lineGraphFull`` 调用的结果存储到表中" msgid "Create the mapping table" @@ -15417,9 +12229,7 @@ msgstr "正的顶点标识符是原始标识符" msgid "Inspecting the vertices map" msgstr "检查顶点图" -msgid "" -"The self loops happen when there is no cost traveling to the ``target`` and " -"the source has an original value." +msgid "The self loops happen when there is no cost traveling to the ``target`` and the source has an original value." msgstr "当从源点到 ``target`` 没有旅行成本，并且源点具有原始值时，会出现自环。" msgid "Updating values from self loops" @@ -15434,24 +12244,17 @@ msgstr "从内部自我循环更新" msgid "Adding a soft restriction" msgstr "添加软限制" -msgid "" -"A soft restriction going from vertex 6 to vertex 3 using edges 4 -> 7 is " -"wanted." +msgid "A soft restriction going from vertex 6 to vertex 3 using edges 4 -> 7 is wanted." msgstr "需要使用边 4 -> 7 从顶点 6 到顶点 3 的软限制。" msgid "Identifying the restriction" msgstr "识别限制条件" -msgid "" -"Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where the " -"cost will be increased" +msgid "Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where the cost will be increased" msgstr "运行 :doc:`pgr_dijkstraNear` 时，成本将会增加的地方是边 8，其成本为 0" -msgid "" -"The edge to be altered is ``WHERE cost = 0 AND seq != 1 AND edge != -1`` " -"from the previous query:" -msgstr "" -"要更改的边是上一个查询中的 ``WHERE cost = 0 AND seq != 1 AND edge != -1`` ：" +msgid "The edge to be altered is ``WHERE cost = 0 AND seq != 1 AND edge != -1`` from the previous query:" +msgstr "要更改的边是上一个查询中的 ``WHERE cost = 0 AND seq != 1 AND edge != -1`` ：" msgid "Adding a value to the restriction" msgstr "向限制添加值" @@ -15468,8 +12271,7 @@ msgstr "现在，该路线不使用边 8，而是在叶顶点上进行 U 形转 msgid "Simplifying leaf vertices" msgstr "简化叶顶点" -msgid "" -"In this example, there is no additional cost for traversing a leaf vertex." +msgid "In this example, there is no additional cost for traversing a leaf vertex." msgstr "在这个例子中，遍历叶顶点没有额外的成本。" msgid "Using the vertex map give the leaf verices their original value." @@ -15490,9 +12292,7 @@ msgstr "叶节点的自循环为" msgid "Which can be removed" msgstr "哪些可以删除" -msgid "" -"Routing can be done now using the original vertices id using :doc:" -"`pgr_dijkstra`" +msgid "Routing can be done now using the original vertices id using :doc:`pgr_dijkstra`" msgstr "现在可以使用 :doc:`pgr_dijkstra` 使用原始顶点 id 来完成路由" msgid "Complete routing graph" @@ -15501,9 +12301,7 @@ msgstr "完整的路由图" msgid "Add edges from the original graph" msgstr "从原始图中添加边" -msgid "" -"Add all the edges that are not involved in the line graph process to the new " -"table" +msgid "Add all the edges that are not involved in the line graph process to the new table" msgstr "将所有不参与折线图过程的边添加到新表中" msgid "Some administrative tasks to get new identifiers for the edges" @@ -15515,9 +12313,7 @@ msgstr "添加新计算的边" msgid "Using the routing graph" msgstr "使用路由图" -msgid "" -"When using this method for routing with soft restrictions there will be " -"uturns" +msgid "When using this method for routing with soft restrictions there will be uturns" msgstr "当使用这种方法进行具有软限制的路由时，将会出现 uturn" msgid "Routing from :math:`5` to :math:`1`" @@ -15535,27 +12331,13 @@ msgstr "``pgr_makeConnected`` - 实验性" msgid "``pgr_makeConnected`` — Set of edges that will connect the graph." msgstr "``pgr_makeConnected`` — 连接图的边集。" -msgid "" -"Adds the minimum number of edges needed to make the input graph connected. " -"The algorithm first identifies all of the connected components in the graph, " -"then adds edges to connect those components together in a path. For example, " -"if a graph contains three connected components A, B, and C, make_connected " -"will add two edges. The two edges added might consist of one connecting a " -"vertex in A with a vertex in B and one connecting a vertex in B with a " -"vertex in C." -msgstr "" -"添加使输入图连接所需的最小边数。 该算法首先识别图中的所有连接组件，然后添加边" -"以将这些组件在路径中连接在一起。 例如，如果一个图包含三个连通分量 A、B 和 C，" -"则 make_connected 将添加两条边。 添加的两条边可能包括一条连接 A 中的顶点与 B " -"中的顶点的边，以及一条连接 B 中的顶点与 C 中的顶点的边。" +msgid "Adds the minimum number of edges needed to make the input graph connected. The algorithm first identifies all of the connected components in the graph, then adds edges to connect those components together in a path. For example, if a graph contains three connected components A, B, and C, make_connected will add two edges. The two edges added might consist of one connecting a vertex in A with a vertex in B and one connecting a vertex in B with a vertex in C." +msgstr "添加使输入图连接所需的最小边数。 该算法首先识别图中的所有连接组件，然后添加边以将这些组件在路径中连接在一起。 例如，如果一个图包含三个连通分量 A、B 和 C，则 make_connected 将添加两条边。 添加的两条边可能包括一条连接 A 中的顶点与 B 中的顶点的边，以及一条连接 B 中的顶点与 C 中的顶点的边。" -msgid "" -"It will give a minimum list of all edges which are needed in the graph to " -"make connect it." +msgid "It will give a minimum list of all edges which are needed in the graph to make connect it." msgstr "它将给出图中连接它所需的所有边的最小列表。" -msgid "" -"The algorithm does not considers geometric topology in the calculations." +msgid "The algorithm does not considers geometric topology in the calculations." msgstr "该算法在计算中不考虑遍历成本。" msgid "pgr_makeConnected(`Edges SQL`_)" @@ -15567,19 +12349,13 @@ msgstr "返回结果 |result-component-make|" msgid "List of edges that are needed to connect the graph." msgstr "连接图形所需的边线列表。" -msgid "" -"`Boost: make connected `__" -msgstr "" -"`Boost: 使图连通 `__" +msgid "`Boost: make connected `__" +msgstr "`Boost: 使图连通 `__" msgid "``pgr_maxCardinalityMatch``" msgstr "``pgr_maxCardinalityMatch``" -msgid "" -"``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a " -"graph." +msgid "``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a graph." msgstr "``pgr_maxCardinalityMatch`` — 计算图中的最大基数匹配。." msgid "pgr_maxCardinalityMatch(text) returns only ``edge`` column." @@ -15594,14 +12370,10 @@ msgstr "使用时 directed => ``false`` 。" msgid "Renamed from ``pgr_maximumCardinalityMatching``" msgstr "从 ``pgr_maximumCardinalityMatching`` 重命名" -msgid "" -"A matching or independent edge set in a graph is a set of edges without " -"common vertices." +msgid "A matching or independent edge set in a graph is a set of edges without common vertices." msgstr "图中的匹配或独立边集是一组没有公共顶点的边。" -msgid "" -"A maximum matching is a matching that contains the largest possible number " -"of edges." +msgid "A maximum matching is a matching that contains the largest possible number of edges." msgstr "最大匹配是包含尽可能多的边的匹配。" msgid "There may be many maximum matchings." @@ -15622,29 +12394,20 @@ msgstr "pgr_maxCardinalityMatch(`Edges SQL`_)" msgid "Using all edges." msgstr "使用所有边。" -msgid "" -"SQL query, which should return a set of rows with the following columns:" +msgid "SQL query, which should return a set of rows with the following columns:" msgstr "SQL 查询，应返回一组包含以下列的行：" -msgid "" -"A positive value represents the existence of the edge (``source``, " -"``target``)." +msgid "A positive value represents the existence of the edge (``source``, ``target``)." msgstr "正值表示存在边 (``source``, ``target``) 。" -msgid "" -"A positive value represents the existence of the edge (``target``, " -"``source``)" +msgid "A positive value represents the existence of the edge (``target``, ``source``)" msgstr "正值表示存在边 (``target``, ``source``)" msgid "Identifier of the edge in the original query." msgstr "原始查询中边的标识符。" -msgid "" -"`Boost: maximum_matching `__" -msgstr "" -"`Boost: 最大匹配 `__" +msgid "`Boost: maximum_matching `__" +msgstr "`Boost: 最大匹配 `__" msgid "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" msgstr "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" @@ -15655,11 +12418,8 @@ msgstr "https://en.wikipedia.org/wiki/Ackermann_function" msgid "``pgr_maxFlow``" msgstr "``pgr_maxFlow``" -msgid "" -"``pgr_maxFlow`` — Calculates the maximum flow in a directed graph from the " -"source(s) to the targets(s) using the Push Relabel algorithm." -msgstr "" -"``pgr_maxFlow`` — 使用 Push Relabel 算法计算有向图中从源到目标的最大流量。" +msgid "``pgr_maxFlow`` — Calculates the maximum flow in a directed graph from the source(s) to the targets(s) using the Push Relabel algorithm." +msgstr "``pgr_maxFlow`` — 使用 Push Relabel 算法计算有向图中从源到目标的最大流量。" msgid "pgr_maxFlow(Combinations)" msgstr "pgr_maxFlow(组合)" @@ -15667,8 +12427,7 @@ msgstr "pgr_maxFlow(组合)" msgid "Calculates the maximum flow from the sources to the targets." msgstr "计算从源头到目标的最大流量。" -msgid "" -"When the maximum flow is **0** then there is no flow and **0** is returned." +msgid "When the maximum flow is **0** then there is no flow and **0** is returned." msgstr "当最大流量为 **0** 时则没有流量，返回 **0** 。" msgid "Uses the :doc:`pgr_pushRelabel ` algorithm." @@ -15698,24 +12457,16 @@ msgstr "返回 ``BIGINT``" msgid "Maximum flow possible from the source(s) to the target(s)" msgstr "从 source(s)到 target(s)的可能最大流量" -msgid "" -"`Boost: push relabel max flow `__" -msgstr "" -"`Boost: 推-重标最大流算法 `__" +msgid "`Boost: push relabel max flow `__" +msgstr "`Boost: 推-重标最大流算法 `__" -msgid "" -"https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" -msgstr "" -"https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" +msgid "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" +msgstr "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" msgid "``pgr_maxFlowMinCost`` - Experimental" msgstr "``pgr_maxFlowMinCost`` - 实验性" -msgid "" -"``pgr_maxFlowMinCost`` — Calculates the edges that minimizes the total cost " -"of the maximum flow on a graph" +msgid "``pgr_maxFlowMinCost`` — Calculates the edges that minimizes the total cost of the maximum flow on a graph" msgstr "``pgr_maxFlowMinCost`` — 计算图上最大流的总成本最小化的边" msgid "pgr_maxFlowMinCost(Combinations)" @@ -15743,12 +12494,8 @@ msgstr "运行时间： :math:`O(U * (E + V * logV))`" msgid "where :math:`U` is the value of the max flow." msgstr "其中 :math:`U` 是最大流量的值。" -msgid "" -":math:`U` is upper bound on number of iterations. In many real world cases " -"number of iterations is much smaller than :math:`U`." -msgstr "" -":math:`U`是迭代次数的上限。 在许多现实世界的情况下，迭代次数远小于 :math:" -"`U` 。" +msgid ":math:`U` is upper bound on number of iterations. In many real world cases number of iterations is much smaller than :math:`U`." +msgstr ":math:`U`是迭代次数的上限。 在许多现实世界的情况下，迭代次数远小于 :math:`U` 。" msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vid**)" msgstr "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vid**)" @@ -15771,9 +12518,7 @@ msgstr "返回 |result-flow-mincost| 的集合" msgid "``pgr_maxFlowMinCost_Cost`` - Experimental" msgstr "``pgr_maxFlowMinCost_Cost`` - 实验性" -msgid "" -"``pgr_maxFlowMinCost_Cost`` — Calculates the minimum total cost of the " -"maximum flow on a graph" +msgid "``pgr_maxFlowMinCost_Cost`` — Calculates the minimum total cost of the maximum flow on a graph" msgstr "``pgr_maxFlowMinCost_Cost`` — 计算图上最大流量的最小总成本" msgid "pgr_maxFlowMinCost_Cost(Combinations)" @@ -15815,9 +12560,7 @@ msgstr "``pgr_pickDeliver`` - 实验性" msgid "``pgr_pickDeliver`` - Pickup and delivery Vehicle Routing Problem" msgstr "``pgr_pickDeliver`` - 接送车辆路径问题" -msgid "" -"Problem: Distribute and optimize the pickup-delivery pairs into a fleet of " -"vehicles." +msgid "Problem: Distribute and optimize the pickup-delivery pairs into a fleet of vehicles." msgstr "问题：将取货-送货对分配并优化到车队中。" msgid "Optimization problem is NP-hard." @@ -15874,18 +12617,14 @@ msgstr "如果存在违反时间窗口的取货-送货对" msgid "The speed, max_cycles, ma_capacity have illegal values" msgstr "speed、max_cycles、ma_capacity 具有非法值" -msgid "" -"Six different initial will be optimized - the best solution found will be " -"result" +msgid "Six different initial will be optimized - the best solution found will be result" msgstr "将优化六个不同的初始值 - 找到的最佳解决方案将是结果" msgid "Signature" msgstr "标识" -msgid "" -"pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" -msgstr "" -"pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" +msgid "pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" +msgstr "pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" msgid "**options:** ``[factor, max_cycles, initial_sol]``" msgstr "**options:** ``[factor, max_cycles, initial_sol]``" @@ -15929,8 +12668,7 @@ msgstr "[end_node_id, end_open, end_close, end_service]" msgid "``pgr_pickDeliverEuclidean`` - Experimental" msgstr "``pgr_pickDeliverEuclidean`` - 实验性" -msgid "" -"``pgr_pickDeliverEuclidean`` - Pickup and delivery Vehicle Routing Problem" +msgid "``pgr_pickDeliverEuclidean`` - Pickup and delivery Vehicle Routing Problem" msgstr "``pgr_pickDeliverEuclidean`` - 取货和送货车辆路径问题" msgid "Replaces ``pgr_gsoc_vrppdtw``" @@ -15970,8 +12708,7 @@ msgid "the best solution found will be result" msgstr "找到的最佳解决方案将作为结果" msgid "pgr_pickDeliverEuclidean(`Orders SQL`_, `Vehicles SQL`_, [**options**])" -msgstr "" -"pgr_pickDeliverEuclidean(`Orders SQL`_, `Vehicles SQL`_, [**options**])" +msgstr "pgr_pickDeliverEuclidean(`Orders SQL`_, `Vehicles SQL`_, [**options**])" msgid "p_x, p_y, p_open, p_close, [p_service,]" msgstr "p_x, p_y, p_open, p_close, [p_service,]" @@ -15985,12 +12722,8 @@ msgstr "start_x, start_y, start_open, start_close [, start_service, ]" msgid "[ end_x, end_y, end_open, end_close, end_service ]" msgstr "[ end_x, end_y, end_open, end_close, end_service ]" -msgid "" -"This data example **lc101** is from data published at https://www.sintef.no/" -"projectweb/top/pdptw/li-lim-benchmark/" -msgstr "" -"此数据示例 **lc101** 来自 https://www.sintef.no/projectweb/top/pdptw/li-lim-" -"benchmark/ 上发布的数据" +msgid "This data example **lc101** is from data published at https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/" +msgstr "此数据示例 **lc101** 来自 https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/ 上发布的数据" msgid "There are 25 vehicles in the problem all with the same characteristics." msgstr "问题中有 25 辆具有相同特征的汽车。" @@ -15998,9 +12731,7 @@ msgstr "问题中有 25 辆具有相同特征的汽车。" msgid "The original orders" msgstr "原始订单" -msgid "" -"The data comes in different rows for the pickup and the delivery of the same " -"order." +msgid "The data comes in different rows for the pickup and the delivery of the same order." msgstr "对于同一订单的取货和配送，数据位于不同的行中。" msgid "The original data needs to be converted to an appropriate table:" @@ -16009,13 +12740,8 @@ msgstr "需要将原始数据转换为适当的表格：" msgid "The query" msgstr "查询" -msgid "" -"Showing only the relevant information to compare with the best solution " -"information published on https://www.sintef.no/projectweb/top/pdptw/100-" -"customers/" -msgstr "" -"仅显示相关信息，以便与 https://www.sintef.no/projectweb/top/pdptw/100-" -"customers/ 上发布的最佳解决方案信息进行比较" +msgid "Showing only the relevant information to compare with the best solution information published on https://www.sintef.no/projectweb/top/pdptw/100-customers/" +msgstr "仅显示相关信息，以便与 https://www.sintef.no/projectweb/top/pdptw/100-customers/ 上发布的最佳解决方案信息进行比较" msgid "The best solution found for **lc101** is a travel time: 828.94" msgstr "找到的 **lc101** 的最佳解是行程时间：828.94" @@ -16026,13 +12752,10 @@ msgstr "此实施的行程时间：854.54" msgid "``pgr_prim``" msgstr "``pgr_prim``" -msgid "" -"``pgr_prim`` — Minimum spanning forest of a graph using Prim's algorithm." +msgid "``pgr_prim`` — Minimum spanning forest of a graph using Prim's algorithm." msgstr "``pgr_prim`` — 使用 Prim 算法的图的最小生成森林。" -msgid "" -"This algorithm finds the minimum spanning forest in a possibly disconnected " -"graph using Prim's algorithm." +msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Prim's algorithm." msgstr "该算法使用 Prim 算法在可能断开的图中找到最小生成森林。" msgid "Prim's running time: :math:`O(E * log V)`" @@ -16044,24 +12767,14 @@ msgstr "pgr_prim(`Edges SQL`_)" msgid "Minimum spanning forest of a subgraph" msgstr "子图的最小生成森林" -msgid "" -"`Boost: Prim's algorithm documentation `__" -msgstr "" -"`Boost: Prim算法文档 `__" +msgid "`Boost: Prim's algorithm documentation `__" +msgstr "`Boost: Prim算法文档 `__" -msgid "" -"``pgr_primBFS`` — Prim's algorithm for Minimum Spanning Tree with Depth " -"First Search ordering." +msgid "``pgr_primBFS`` — Prim's algorithm for Minimum Spanning Tree with Depth First Search ordering." msgstr "``pgr_primBFS`` — Prim 的深度优先搜索排序最小生成树算法。" -msgid "" -"Visits and extracts the nodes information in Breath First Search ordering of " -"the Minimum Spanning Tree created using Prims's algorithm." -msgstr "" -"访问并提取使用 Prims 算法创建的最小生成树的 Breath First Search 排序中的节点" -"信息。" +msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." +msgstr "访问并提取使用 Prims 算法创建的最小生成树的 Breath First Search 排序中的节点信息。" msgid "pgr_primBFS(`Edges SQL`_, **root vid**, [``max_depth``])" msgstr "pgr_primBFS(`Edges SQL`_, **root vid**, [``max_depth``])" @@ -16072,13 +12785,8 @@ msgstr "pgr_primBFS(`Edges SQL`_, **root vids**, [``max_depth``])" msgid "``pgr_primDD`` — Catchament nodes using Prim's algorithm." msgstr "``pgr_primDD`` — 使用 Prim 算法的集水区节点。" -msgid "" -"Using Prim's algorithm, extracts the nodes that have aggregate costs less " -"than or equal to a distance from a root vertex (or vertices) within the " -"calculated minimum spanning tree." -msgstr "" -"使用 Prim 算法，从计算出最小生成树中提取出那些与根节点（或根节点组）之间的聚" -"合成本小于或等于某个距离的节点。" +msgid "Using Prim's algorithm, extracts the nodes that have aggregate costs less than or equal to a distance from a root vertex (or vertices) within the calculated minimum spanning tree." +msgstr "使用 Prim 算法，从计算出最小生成树中提取出那些与根节点（或根节点组）之间的聚合成本小于或等于某个距离的节点。" msgid "pgr_primDD(`Edges SQL`_, **root vid**, **distance**)" msgstr "pgr_primDD(`Edges SQL`_, **root vid**, **distance**)" @@ -16086,16 +12794,11 @@ msgstr "pgr_primDD(`Edges SQL`_, **root vid**, **distance**)" msgid "pgr_primDD(`Edges SQL`_, **root vids**, **distance**)" msgstr "pgr_primDD(`Edges SQL`_, **root vids**, **distance**)" -msgid "" -"``pgr_primDFS`` — Prim algorithm for Minimum Spanning Tree with Depth First " -"Search ordering." +msgid "``pgr_primDFS`` — Prim algorithm for Minimum Spanning Tree with Depth First Search ordering." msgstr "``pgr_primDFS`` — 具有深度优先搜索排序的最小生成树的 Prim 算法。" -msgid "" -"Visits and extracts the nodes information in Depth First Search ordering of " -"the Minimum Spanning Tree created using Prims's algorithm." -msgstr "" -"访问并提取使用 Prims 算法创建的最小生成树的深度优先搜索顺序中的节点信息。" +msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Prims's algorithm." +msgstr "访问并提取使用 Prims 算法创建的最小生成树的深度优先搜索顺序中的节点信息。" msgid "pgr_primDFS(`Edges SQL`_, **root vid**, [``max_depth``])" msgstr "pgr_primDFS(`Edges SQL`_, **root vid**, [``max_depth``])" @@ -16106,12 +12809,8 @@ msgstr "pgr_primDFS(`Edges SQL`_, **root vids**, [``max_depth``])" msgid "``pgr_pushRelabel``" msgstr "``pgr_pushRelabel``" -msgid "" -"``pgr_pushRelabel`` — Calculates the flow on the graph edges that maximizes " -"the flow from the sources to the targets using Push Relabel Algorithm." -msgstr "" -"``pgr_pushRelabel`` — 使用 Push Relabel 算法计算图边上的流量，以最大化从源到" -"目标的流量。" +msgid "``pgr_pushRelabel`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Push Relabel Algorithm." +msgstr "``pgr_pushRelabel`` — 使用 Push Relabel 算法计算图边上的流量，以最大化从源到目标的流量。" msgid "pgr_pushRelabel(Combinations)" msgstr "pgr_pushRelabel(组合)" @@ -16137,9 +12836,7 @@ msgstr "pgr_pushRelabel(`Edges SQL`_, `Combinations SQL`_)" msgid "``pgr_separateCrossing``" msgstr "``pgr_separateCrossing``" -msgid "" -"``pgr_separateCrossing`` - From crossing geometries generates geometries " -"that do not cross." +msgid "``pgr_separateCrossing`` - From crossing geometries generates geometries that do not cross." msgstr "``pgr_separateCrossing`` - 从交叉几何图形生成不交叉的几何图形。" msgid "Proposed function." @@ -16169,30 +12866,17 @@ msgstr "在 ST_Split 前使用 ST_Snap" msgid "Get the code for further refinement." msgstr "获取进一步完善的代码。" -msgid "" -"When there are special details that need to be taken care of because of the " -"final application or the quality of the data, the code can be obtained On a " -"PostgreSQL ``NOTICE`` using the ``dryrun`` flag." -msgstr "" -"当由于最终应用或数据质量需要特别处理时，可以通过在 PostgreSQL 中使用 " -"``NOTICE`` 和 ``dryrun`` 标志来获取代码。" +msgid "When there are special details that need to be taken care of because of the final application or the quality of the data, the code can be obtained On a PostgreSQL ``NOTICE`` using the ``dryrun`` flag." +msgstr "当由于最终应用或数据质量需要特别处理时，可以通过在 PostgreSQL 中使用 ``NOTICE`` 和 ``dryrun`` 标志来获取代码。" msgid "``pgr_separateTouching``" msgstr "``pgr_separateTouching``" -msgid "" -"``pgr_separateTouching`` - From touching geometries generates geometries " -"that are properly connected at endpoints" -msgstr "" -"``pgr_separateTouching`` - 将相互接触的几何图形转换为端点正确连接的几何图形" +msgid "``pgr_separateTouching`` - From touching geometries generates geometries that are properly connected at endpoints" +msgstr "``pgr_separateTouching`` - 将相互接触的几何图形转换为端点正确连接的几何图形" -msgid "" -"This is an auxiliary function for processing geometries that touch but don't " -"share exact endpoints, splitting them at their intersection points to " -"improve network connectivity." -msgstr "" -"此辅助函数用于处理几何图形相互接触但未共享端点的情况，通过在相交点处分割图形" -"来增强网络连通性。" +msgid "This is an auxiliary function for processing geometries that touch but don't share exact endpoints, splitting them at their intersection points to improve network connectivity." +msgstr "此辅助函数用于处理几何图形相互接触但未共享端点的情况，通过在相交点处分割图形来增强网络连通性。" msgid "pgr_separateTouching(`Edges SQL`_, [``tolerance``, ``dryrun``])" msgstr "pgr_separateTouching(`Edges SQL`_, [``tolerance``, ``dryrun``])" @@ -16200,24 +12884,16 @@ msgstr "pgr_separateTouching(`Edges SQL`_, [``tolerance``, ``dryrun``])" msgid "``pgr_sequentialVertexColoring`` - Proposed" msgstr "``pgr_sequentialVertexColoring`` - 提议中" -msgid "" -"``pgr_sequentialVertexColoring`` — Returns the vertex coloring of an " -"undirected graph, using greedy approach." +msgid "``pgr_sequentialVertexColoring`` — Returns the vertex coloring of an undirected graph, using greedy approach." msgstr "``pgr_sequentialVertexColoring`` — 使用贪婪方法返回无向图的顶点着色。" -msgid "" -"Sequential vertex coloring algorithm is a graph coloring algorithm in which " -"color identifiers are assigned to the vertices of a graph in a sequential " -"manner, such that no edge connects two identically colored vertices." -msgstr "" -"顺序顶点着色算法是一种图着色算法，其中颜色标识符以顺序方式分配给图的顶点，使" -"得没有边连接两个相同颜色的顶点。" +msgid "Sequential vertex coloring algorithm is a graph coloring algorithm in which color identifiers are assigned to the vertices of a graph in a sequential manner, such that no edge connects two identically colored vertices." +msgstr "顺序顶点着色算法是一种图着色算法，其中颜色标识符以顺序方式分配给图的顶点，使得没有边连接两个相同颜色的顶点。" msgid "The implementation is applicable only for **undirected** graphs." msgstr "该实现仅适用于 **无向** 图。" -msgid "" -"Provides the color to be assigned to all the vertices present in the graph." +msgid "Provides the color to be assigned to all the vertices present in the graph." msgstr "提供要分配给图中存在的所有顶点的颜色。" msgid "Color identifiers values are in the Range :math:`[1, |V|]`" @@ -16226,15 +12902,8 @@ msgstr "颜色标识符值在范围 :math:`[1, |V|]` 内" msgid "The algorithm tries to assign the least possible color to every vertex." msgstr "该算法尝试为每个顶点分配尽可能少的颜色。" -msgid "" -"Efficient graph coloring is an NP-Hard problem, and therefore, this " -"algorithm does not always produce optimal coloring. It follows a greedy " -"strategy by iterating through all the vertices sequentially, and assigning " -"the smallest possible color that is not used by its neighbors, to each " -"vertex." -msgstr "" -"高效的图着色是一个 NP 困难问题，因此，该算法并不总是产生最佳着色。 它遵循贪婪" -"策略，依次迭代所有顶点，并将其邻居未使用的最小可能颜色分配给每个顶点。" +msgid "Efficient graph coloring is an NP-Hard problem, and therefore, this algorithm does not always produce optimal coloring. It follows a greedy strategy by iterating through all the vertices sequentially, and assigning the smallest possible color that is not used by its neighbors, to each vertex." +msgstr "高效的图着色是一个 NP 困难问题，因此，该算法并不总是产生最佳着色。 它遵循贪婪策略，依次迭代所有顶点，并将其邻居未使用的最小可能颜色分配给每个顶点。" msgid "The returned rows are ordered in ascending order of the vertex value." msgstr "返回的行按顶点值的升序排列。" @@ -16251,48 +12920,33 @@ msgstr ":math:`k` 是使用的颜色数量。" msgid "pgr_sequentialVertexColoring(`Edges SQL`_)" msgstr "pgr_sequentialVertexColoring(`Edges SQL`_)" -msgid "" -"`Boost: Sequential Vertex Coloring `__" -msgstr "" -"`Boost: 顺序顶点着色 `__" +msgid "`Boost: Sequential Vertex Coloring `__" +msgstr "`Boost: 顺序顶点着色 `__" #, fuzzy msgid "``pgr_sloanOrdering`` - Experimental" msgstr "``pgr_edgeColoring`` - 实验性" #, fuzzy -msgid "" -"``pgr_sloanOrdering`` — Returns the Sloan ordering of an undirected graph" +msgid "``pgr_sloanOrdering`` — Returns the Sloan ordering of an undirected graph" msgstr "``pgr_cuthillMckeeOrdering`` — 返回无向图的反向 Cuthill-Mckee 排序" -msgid "" -"The Sloan ordering algorithm reorders the vertices of a graph to reduce " -"bandwidth, profile, and wavefront properties, which is particularly useful " -"for sparse matrix computations and finite element analysis." +msgid "The Sloan ordering algorithm reorders the vertices of a graph to reduce bandwidth, profile, and wavefront properties, which is particularly useful for sparse matrix computations and finite element analysis." msgstr "" msgid "Finds a pseudoperipheral vertex pair to determine good starting points" msgstr "" -msgid "" -"Uses a priority-based algorithm that balances vertex degree and distance " -"from the start vertex." +msgid "Uses a priority-based algorithm that balances vertex degree and distance from the start vertex." msgstr "" -msgid "" -"Aims to minimize bandwidth (maximum difference between connected vertex " -"indices." +msgid "Aims to minimize bandwidth (maximum difference between connected vertex indices." msgstr "" -msgid "" -"Typically produces better orderings than simple breadth-first approaches." +msgid "Typically produces better orderings than simple breadth-first approaches." msgstr "" -msgid "" -"Time complexity: :math:`O(V² + E)` where V is the number of vertices and E " -"is the number of edges." +msgid "Time complexity: :math:`O(V² + E)` where V is the number of vertices and E is the number of edges." msgstr "" #, fuzzy @@ -16310,11 +12964,8 @@ msgid "Sloan ordering of Original graph from Boost example (vertices 0-9)." msgstr "" #, fuzzy -msgid "" -"`Boost: Sloan Ordering `__" -msgstr "" -"`Boost: 边着色 `__" +msgid "`Boost: Sloan Ordering `__" +msgstr "`Boost: 边着色 `__" msgid "``pgr_stoerWagner`` - Experimental" msgstr "``pgr_stoerWagner`` - 实验性" @@ -16325,32 +12976,11 @@ msgstr "``pgr_stoerWagner`` — 使用 stoerWagner 算法对图进行最小分 msgid "Version 3.0" msgstr "版本3.0" -msgid "" -"In graph theory, the Stoer–Wagner algorithm is a recursive algorithm to " -"solve the minimum cut problem in undirected weighted graphs with non-" -"negative weights. The essential idea of this algorithm is to shrink the " -"graph by merging the most intensive vertices, until the graph only contains " -"two combined vertex sets. At each phase, the algorithm finds the minimum s-t " -"cut for two vertices s and t chosen as its will. Then the algorithm shrinks " -"the edge between s and t to search for non s-t cuts. The minimum cut found " -"in all phases will be the minimum weighted cut of the graph." -msgstr "" -"在图论中，Stoer-Wagner 算法是一种递归算法，用于解决具有非负权重的无向带权图中" -"的最小割问题。 该算法的基本思想是通过合并最密集的顶点来收缩图，直到图仅包含两" -"个组合的顶点集。 在每个阶段，算法都会找到任意选择的两个顶点 s 和 t 的最小 s-" -"t 割。 然后算法缩小 s 和 t 之间的缘以搜索非 s-t 切割。 在所有阶段中找到的最小" -"割将是图的最小加权割。" +msgid "In graph theory, the Stoer–Wagner algorithm is a recursive algorithm to solve the minimum cut problem in undirected weighted graphs with non-negative weights. The essential idea of this algorithm is to shrink the graph by merging the most intensive vertices, until the graph only contains two combined vertex sets. At each phase, the algorithm finds the minimum s-t cut for two vertices s and t chosen as its will. Then the algorithm shrinks the edge between s and t to search for non s-t cuts. The minimum cut found in all phases will be the minimum weighted cut of the graph." +msgstr "在图论中，Stoer-Wagner 算法是一种递归算法，用于解决具有非负权重的无向带权图中的最小割问题。 该算法的基本思想是通过合并最密集的顶点来收缩图，直到图仅包含两个组合的顶点集。 在每个阶段，算法都会找到任意选择的两个顶点 s 和 t 的最小 s-t 割。 然后算法缩小 s 和 t 之间的缘以搜索非 s-t 切割。 在所有阶段中找到的最小割将是图的最小加权割。" -msgid "" -"A cut is a partition of the vertices of a graph into two disjoint subsets. A " -"minimum cut is a cut for which the size or weight of the cut is not larger " -"than the size of any other cut. For an unweighted graph, the minimum cut " -"would simply be the cut with the least edges. For a weighted graph, the sum " -"of all edges' weight on the cut determines whether it is a minimum cut." -msgstr "" -"割是将图的顶点划分为两个不相交的子集。 最小切割是指切割的尺寸或重量不大于任何" -"其他切割的尺寸的切割。 对于未加权的图，最小割只是具有最少边的割。 对于加权" -"图，割线上所有边的权重之和决定了它是否是最小割。" +msgid "A cut is a partition of the vertices of a graph into two disjoint subsets. A minimum cut is a cut for which the size or weight of the cut is not larger than the size of any other cut. For an unweighted graph, the minimum cut would simply be the cut with the least edges. For a weighted graph, the sum of all edges' weight on the cut determines whether it is a minimum cut." +msgstr "割是将图的顶点划分为两个不相交的子集。 最小切割是指切割的尺寸或重量不大于任何其他切割的尺寸的切割。 对于未加权的图，最小割只是具有最少边的割。 对于加权图，割线上所有边的权重之和决定了它是否是最小割。" msgid "Sum of the weights of all edges between the two sets is mincut." msgstr "两组之间所有边的权重之和是最小割。" @@ -16367,12 +12997,8 @@ msgstr "当图中没有边时，则返回 EMPTY SET。" msgid "When the graph is unconnected then EMPTY SET is return." msgstr "当图形未连接时，则返回 EMPTY SET。" -msgid "" -"Sometimes a graph has multiple min-cuts, but all have the same weight. The " -"this function determines exactly one of the min-cuts as well as its weight." -msgstr "" -"有时一个图有多个最小割，但都具有相同的权重。 该函数准确地确定最小切割之一及其" -"权重。" +msgid "Sometimes a graph has multiple min-cuts, but all have the same weight. The this function determines exactly one of the min-cuts as well as its weight." +msgstr "有时一个图有多个最小割，但都具有相同的权重。 该函数准确地确定最小切割之一及其权重。" msgid "Running time: :math:`O(V*E + V^2*log V)`." msgstr "运行时间： :math:`O(V*E + V^2*log V)`。" @@ -16410,12 +13036,8 @@ msgstr "边的最小割" msgid "Using :doc:`pgr_connectedComponents`" msgstr "使用 :doc:`pgr_connectedComponents`" -msgid "" -"`Boost: Stoer Wagner min cut `__" -msgstr "" -"`Boost: Stoer-Wagner 最小割算法 `__" +msgid "`Boost: Stoer Wagner min cut `__" +msgstr "`Boost: 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,16 +13045,10 @@ msgstr "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" msgid "``pgr_strongComponents``" msgstr "``pgr_strongComponents``" -msgid "" -"``pgr_strongComponents`` — Strongly connected components of a directed graph " -"using Tarjan's algorithm based on DFS." -msgstr "" -"``pgr_strongComponents`` — 使用基于 DFS 的 Tarjan 算法构建有向图的强连通分" -"量。" +msgid "``pgr_strongComponents`` — Strongly connected components of a directed graph using Tarjan's algorithm based on DFS." +msgstr "``pgr_strongComponents`` — 使用基于 DFS 的 Tarjan 算法构建有向图的强连通分量。" -msgid "" -"A strongly connected component of a directed graph is a set of vertices that " -"are all reachable from each other." +msgid "A strongly connected component of a directed graph is a set of vertices that are all reachable from each other." msgstr "有向图的强连接组件是一组彼此可达的顶点。" msgid "Works for **directed** graphs." @@ -16447,43 +13063,25 @@ msgstr "pgr_strongComponents(`Edges SQL`_)" msgid "The strong components of the graph" msgstr "图的重要组成部分" -msgid "" -"`Boost: Strong components `__" -msgstr "" -"`Boost: 强连通分量 `__" +msgid "`Boost: Strong components `__" +msgstr "`Boost: 强连通分量 `__" -msgid "" -"wikipedia: `Strongly connected component `__" -msgstr "" -"维基百科: `强连通分量 `__" +msgid "wikipedia: `Strongly connected component `__" +msgstr "维基百科: `强连通分量 `__" msgid "``pgr_topologicalSort`` - Experimental" msgstr "``pgr_topologicalSort`` - 实验性" -msgid "" -"``pgr_topologicalSort`` — Linear ordering of the vertices for directed " -"acyclic graphs (DAG)." +msgid "``pgr_topologicalSort`` — Linear ordering of the vertices for directed acyclic graphs (DAG)." msgstr "``pgr_topologicalSort`` — 有向无环图 (DAG) 的顶点的线性排序。" -msgid "" -"The topological sort algorithm creates a linear ordering of the vertices " -"such that if edge :math:`(u,v)` appears in the graph, then :math:`v` comes " -"before :math:`u` in the ordering." -msgstr "" -"拓扑排序算法创建了一个顶点的线性排序，使得如果图中存在边 :math:`(u,v)`，则在" -"排序中 :math:`v` 出现在 :math:`u` 之前。" +msgid "The topological sort algorithm creates a linear ordering of the vertices such that if edge :math:`(u,v)` appears in the graph, then :math:`v` comes before :math:`u` in the ordering." +msgstr "拓扑排序算法创建了一个顶点的线性排序，使得如果图中存在边 :math:`(u,v)`，则在排序中 :math:`v` 出现在 :math:`u` 之前。" -msgid "" -"Process is valid for directed acyclic graphs only. otherwise it will throw " -"warnings." +msgid "Process is valid for directed acyclic graphs only. otherwise it will throw warnings." msgstr "该过程仅对有向无环图有效。 否则它会抛出警告。" -msgid "" -"For optimization purposes, if there are more than one answer, the function" +msgid "For optimization purposes, if there are more than one answer, the function" msgstr "出于优化目的，如果有多个答案，则该函数" msgid "will return one of them." @@ -16513,22 +13111,16 @@ msgstr "对单向段进行拓扑排序" msgid "Graph is not a DAG" msgstr "图不是 DAG" -msgid "" -"`Boost: topological sort `__" -msgstr "" -"`Boost: 拓扑排序 `__" +msgid "`Boost: topological sort `__" +msgstr "`Boost: 拓扑排序 `__" msgid "``pgr_transitiveClosure`` - Experimental" msgstr "``pgr_transitiveClosure`` - 实验性" -msgid "" -"``pgr_transitiveClosure`` — Transitive closure graph of a directed graph." +msgid "``pgr_transitiveClosure`` — Transitive closure graph of a directed graph." msgstr "``pgr_transitiveClosure`` — 有向图的传递闭包图。" -msgid "" -"Transforms the input directed graph into the transitive closure of the graph." +msgid "Transforms the input directed graph into the transitive closure of the graph." msgstr "将输入有向图转换为图的传递闭包。" msgid "Process is valid for directed graphs." @@ -16537,12 +13129,8 @@ msgstr "过程对于有向图有效。" msgid "The transitive closure of an undirected graph produces a cluster graph" msgstr "无向图的传递闭包产生簇图" -msgid "" -"Reachability between vertices on an undirected graph happens when they " -"belong to the same connected component. (see :doc:`pgr_connectedComponents`)" -msgstr "" -"当无向图上的顶点属于同一连通分量时，就会发生它们之间的可达性。（参阅 :doc:" -"`pgr_connectedComponents`）" +msgid "Reachability between vertices on an undirected graph happens when they belong to the same connected component. (see :doc:`pgr_connectedComponents`)" +msgstr "当无向图上的顶点属于同一连通分量时，就会发生它们之间的可达性。（参阅 :doc:`pgr_connectedComponents`）" msgid "The returned values are not ordered" msgstr "返回值未排序" @@ -16577,12 +13165,8 @@ msgstr "边目标的标识符" msgid "Identifiers of the vertices that are reachable from vertex v." msgstr "从顶点 v 可到达的顶点的标识符。" -msgid "" -"`Boost: transitive closure `__" -msgstr "" -"`Boost: 传递闭包 `__" +msgid "`Boost: transitive closure `__" +msgstr "`Boost: 传递闭包 `__" msgid "https://en.wikipedia.org/wiki/Transitive_closure" msgstr "https://en.wikipedia.org/wiki/Transitive_closure" @@ -16623,16 +13207,10 @@ msgstr "pgr_trspViaVertices" msgid "pgr_trspViaEdges" msgstr "pgr_trspViaEdges" -msgid "" -"Turn restricted shortest path (TRSP) is an algorithm that receives turn " -"restrictions in form of a query like those found in real world navigable " -"road networks." -msgstr "" -"转弯限制最短路径 (TRSP) 是一种以查询形式接收转弯限制的算法，就像在现实世界的" -"可通航道路网络中发现的那样。" +msgid "Turn restricted shortest path (TRSP) is an algorithm that receives turn restrictions in form of a query like those found in real world navigable road networks." +msgstr "转弯限制最短路径 (TRSP) 是一种以查询形式接收转弯限制的算法，就像在现实世界的可通航道路网络中发现的那样。" -msgid "" -"It does no guarantee the shortest path as it might contain restriction paths." +msgid "It does no guarantee the shortest path as it might contain restriction paths." msgstr "它不保证最短路径，因为它可能包含限制路径。" msgid "The general algorithm is as follows:" @@ -16647,79 +13225,47 @@ msgstr "如果解决方案通过了限制。" msgid "Execute the **TRSP** algorithm with restrictions." msgstr "有限制地执行 **TRSP** 算法。" -msgid "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, " -"[``directed``])" -msgstr "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, " -"[``directed``])" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, [``directed``])" +msgstr "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, [``directed``])" -msgid "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vids**, " -"[``directed``])" -msgstr "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vids**, " -"[``directed``])" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vids**, [``directed``])" +msgstr "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vids**, [``directed``])" -msgid "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vid**, " -"[``directed``])" -msgstr "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vid**, " -"[``directed``])" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vid**, [``directed``])" +msgstr "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vid**, [``directed``])" -msgid "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, " -"[``directed``])" -msgstr "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, " -"[``directed``])" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, [``directed``])" +msgstr "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, [``directed``])" -msgid "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, " -"[``directed``])" -msgstr "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, " -"[``directed``])" +msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, [``directed``])" +msgstr "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, [``directed``])" msgid "From vertex :math:`6` to vertex :math:`10` on an undirected graph." msgstr "从无向图上的顶点 :math:`6` 到顶点 :math:`10`." -msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 1\\}` on an undirected graph." +msgid "From vertex :math:`6` to vertices :math:`\\{10, 1\\}` on an undirected graph." msgstr "无向图上从顶点 :math:`6` 到顶点 :math:`\\{10, 1\\}` 。" -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertex :math:`8` on a directed graph." +msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`8` on a directed graph." msgstr "有向图上从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`8`。" -msgid "" -"From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 8\\}` on an " -"undirected graph." +msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 8\\}` on an undirected graph." msgstr "无向图上从顶点 :math:`\\{6, 1\\}` 到顶点 :math:`\\{10, 8\\}`。" msgid "Using a combinations table on an undirected graph." msgstr "在无向图上使用组合表。" -msgid "" -"`Deprecated documentation `_" +msgid "`Deprecated documentation `_" msgstr "`已弃用文档 `_" msgid "``pgr_trspVia``" msgstr "``pgr_trspVia``" -msgid "" -"``pgr_trspVia`` Route that goes through a list of vertices with restrictions." +msgid "``pgr_trspVia`` Route that goes through a list of vertices with restrictions." msgstr "``pgr_trspVia`` 穿过有限制的顶点列表的路线。" -msgid "" -"Given a list of vertices and a graph, this function is equivalent to finding " -"the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :" -"math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." -msgstr "" -"给定一个顶点列表和一个图，这个函数等同于在所有 :math:`i < size\\_of(via\\;" -"vertices)` 的情况下找到从 :math:`vertex_i` 到 :math:`vertex_{i+1}` 的最短路" -"径，尽量避免使用受限路径。" +msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." +msgstr "给定一个顶点列表和一个图，这个函数等同于在所有 :math:`i < size\\_of(via\\;vertices)` 的情况下找到从 :math:`vertex_i` 到 :math:`vertex_{i+1}` 的最短路径，尽量避免使用受限路径。" msgid "The paths represents the sections of the route." msgstr "路径代表路线的各个部分。" @@ -16727,8 +13273,7 @@ msgstr "路径代表路线的各个部分。" msgid "Execute a :doc:`pgr_dijkstraVia`." msgstr "执行 :doc:`pgr_dijkstraVia`。" -msgid "" -"For the set of sub paths of the solution that pass through a restriction then" +msgid "For the set of sub paths of the solution that pass through a restriction then" msgstr "对于通过限制的解决方案的子路径集，则" msgid "Execute the **TRSP** algorithm with restrictions for the paths." @@ -16737,19 +13282,11 @@ msgstr "执行对路径有限制的 **TRSP** 算法。" msgid "**NOTE** when this is done, ``U_turn_on_edge`` flag is ignored." msgstr "**注意**，完成此操作后， ``U_turn_on_edge`` 标志将被忽略。" -msgid "" -"pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, " -"[**options**])" -msgstr "" -"pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, " -"[**options**])" +msgid "pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, [**options**])" +msgstr "pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, [**options**])" -msgid "" -"All this examples are about the route that visits the vertices :math:`\\{5, " -"7, 1, 8, 15\\}` in that order on a directed graph." -msgstr "" -"所有这些示例都是关于按有向图上的顺序访问顶点 :math:`\\{5, 7, 1, 8, 15\\}` 的" -"路线。" +msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a directed graph." +msgstr "所有这些示例都是关于按有向图上的顺序访问顶点 :math:`\\{5, 7, 1, 8, 15\\}` 的路线。" msgid "Simulation of how algorithm works." msgstr "模拟算法的工作原理。" @@ -16757,23 +13294,14 @@ msgstr "模拟算法的工作原理。" msgid "The algorithm performs a :doc:`pgr_dijkstraVia`" msgstr "该算法执行 :doc:`pgr_dijkstraVia`" -msgid "" -"Detects which of the sub paths pass through a restriction in this case is " -"for the ``path_id = 5`` from ``6`` to ``3`` because the path :math:`15 " -"\\rightarrow 1` is restricted." -msgstr "" -"检测哪些子路径通过了限制，本例中是针对 ``path_id = 5`` 从 ``6`` 到 ``3`` ，因" -"为该路径 :math:`15 \\rightarrow 1` 受到限制。" +msgid "Detects which of the sub paths pass through a restriction in this case is for the ``path_id = 5`` from ``6`` to ``3`` because the path :math:`15 \\rightarrow 1` is restricted." +msgstr "检测哪些子路径通过了限制，本例中是针对 ``path_id = 5`` 从 ``6`` 到 ``3`` ，因为该路径 :math:`15 \\rightarrow 1` 受到限制。" msgid "Executes the :doc:`pgr_trsp` algorithm for the conflicting paths." msgstr "执行 :doc:`pgr_trsp` 针对冲突路径建议的算法。" -msgid "" -"From the :doc:`pgr_dijkstraVia` result it removes the conflicting paths and " -"builds the solution with the results of the :doc:`pgr_trsp` algorithm:" -msgstr "" -"从 :doc:`pgr_dijkstraVia` 提议的结果中，它删除了冲突路径，并使用 :doc:" -"`pgr_trsp` 提议的算法的结果构建解决方案：" +msgid "From the :doc:`pgr_dijkstraVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" +msgstr "从 :doc:`pgr_dijkstraVia` 提议的结果中，它删除了冲突路径，并使用 :doc:`pgr_trsp` 提议的算法的结果构建解决方案：" msgid "Getting the same result as ``pgr_trspVia``:" msgstr "得到与 ``pgr_trspVia`` 相同的结果：" @@ -16784,23 +13312,13 @@ msgstr "示例 8" msgid "Sometimes ``U_turn_on_edge`` flag is ignored when is set to ``false``." msgstr "有时，当设置为 ``false`` 时， ``U_turn_on_edge`` 标志会被忽略。" -msgid "" -"The first step, doing a :doc:`pgr_dijkstraVia` does consider not making a U " -"turn on the same edge. But the path :math:`16 \\rightarrow 13` (Rows 4 and " -"5) is restricted and the result is using it." -msgstr "" -"第一步，进行 :doc:`pgr_dijkstraVia` 不考虑在同一边上掉头。 但路径 :math:`16 " -"\\rightarrow 13` （第 4 行和第 5 行）受到限制，结果正在使用它。" +msgid "The first step, doing a :doc:`pgr_dijkstraVia` does consider not making a U turn on the same edge. But the path :math:`16 \\rightarrow 13` (Rows 4 and 5) is restricted and the result is using it." +msgstr "第一步，进行 :doc:`pgr_dijkstraVia` 不考虑在同一边上掉头。 但路径 :math:`16 \\rightarrow 13` （第 4 行和第 5 行）受到限制，结果正在使用它。" -msgid "" -"When executing the :doc:`pgr_trsp` algorithm for the conflicting path, there " -"is no ``U_turn_on_edge`` flag." -msgstr "" -"当执行 :doc:`pgr_trsp` 针对冲突路径的算法时，没有 ``U_turn_on_edge`` 标志。" +msgid "When executing the :doc:`pgr_trsp` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." +msgstr "当执行 :doc:`pgr_trsp` 针对冲突路径的算法时，没有 ``U_turn_on_edge`` 标志。" -msgid "" -"Therefore the result ignores the ``U_turn_on_edge`` flag when set to " -"``false``." +msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``." msgstr "因此，当设置为 ``false`` 时，结果会忽略 ``U_turn_on_edge`` 标志。" msgid ":doc:`via-category`" @@ -16809,22 +13327,11 @@ msgstr ":doc:`via-category`" msgid "``pgr_trspVia_withPoints``" msgstr "``pgr_trspVia_withPoints``" -msgid "" -"``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/" -"or points with restrictions." +msgid "``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/or points with restrictions." msgstr "``pgr_trspVia_withPoints`` - 经过一系列具有限制的顶点和/或点的路线。" -msgid "" -"Given a graph, a set of restriction on the graph edges, a set of points on " -"the graphs edges and a list of vertices, this function is equivalent to " -"finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` " -"(where :math:`vertex` can be a vertex or a point on the graph) for all :math:" -"`i < size\\_of(via\\;vertices)` trying not to use restricted paths." -msgstr "" -"给定一个图、对图边的一组限制、图边上的一组点和一个顶点列表，该函数相当于查" -"找 :math:`vertex_i` 和 :math:`vertex_{i+1}` 之间的最短路径（其中 :math:" -"`vertex` 可以是图上的顶点或点） 对于所有 :math:`i < size\\_of(via\\;" -"vertices)` 尝试不使用受限路径的人。" +msgid "Given a graph, a set of restriction on the graph edges, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." +msgstr "给定一个图、对图边的一组限制、图边上的一组点和一个顶点列表，该函数相当于查找 :math:`vertex_i` 和 :math:`vertex_{i+1}` 之间的最短路径（其中 :math:`vertex` 可以是图上的顶点或点） 对于所有 :math:`i < size\\_of(via\\;vertices)` 尝试不使用受限路径的人。" msgid "is a sequence of paths" msgstr "是一系列路径" @@ -16841,8 +13348,7 @@ msgstr "顶点标识符将保持正值。" msgid "Execute a :doc:`pgr_withPointsVia`." msgstr "执行 :doc:`pgr_withPointsVia`。" -msgid "" -"For the set of paths of the solution that pass through a restriction then" +msgid "For the set of paths of the solution that pass through a restriction then" msgstr "对于通过限制的解决方案的路径集合，则" msgid "Execute the **TRSP** algorithm with restrictions for the path." @@ -16852,20 +13358,14 @@ msgid "Do not use negative values on identifiers of the inner queries." msgstr "不要在内部查询的标识符上使用负值。" #, fuzzy -msgid "" -"pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**via vertices**, [**driving side**,] [**options**])" -msgstr "" -"pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**via vertices**, [**options**])" +msgid "pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, [**driving side**,] [**options**])" +msgstr "pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, [**options**])" #, fuzzy msgid "**options:** ``[directed, strict, U_turn_on_edge, details]``" msgstr "**options:** ``[directed, strict, U_turn_on_edge]``" -msgid "" -"Find the route that visits the vertices :math:`\\{-6, 15, -5\\}` in that " -"order on an directed graph." +msgid "Find the route that visits the vertices :math:`\\{-6, 15, -5\\}` in that order on an directed graph." msgstr "在有向图上查找按顺序访问顶点 :math:`\\{-6, 15, -5\\}` 的路线。" msgid "When positive it is considered a vertex identifier" @@ -16878,9 +13378,7 @@ msgstr "当负数时，它被认为是一个点标识符" msgid "[**driving side**]" msgstr "**driving side**" -msgid "" -"Value in [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] indicating if the " -"driving side is:" +msgid "Value in [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] indicating if the driving side is:" msgstr "值在 [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] 中表示驾驶的一侧是：" #, fuzzy @@ -16926,15 +13424,11 @@ msgstr "" msgid "When ``true`` the results will include the points that are in the path." msgstr "如果为 ``true`` ，结果将包括路径中的点。" -msgid "" -"When ``false`` the results will not include the points that are in the path." +msgid "When ``false`` the results will not include the points that are in the path." msgstr "如果为 ``false`` ，结果将不包括路径中的点。" -msgid "" -"When ``start_vid``, ``end_vid`` and ``node`` columns have negative values, " -"the identifier is for a Point." -msgstr "" -"当 ``start_vid`` 、 ``end_vid`` 和 ``node`` 列具有负值时，该标识符用于Point。" +msgid "When ``start_vid``, ``end_vid`` and ``node`` columns have negative values, the identifier is for a Point." +msgstr "当 ``start_vid`` 、 ``end_vid`` 和 ``node`` 列具有负值时，该标识符用于Point。" msgid "Use ``pgr_findCloseEdges`` for points on the fly" msgstr "对动态点使用 ``pgr_findCloseEdges``" @@ -16942,37 +13436,23 @@ msgstr "对动态点使用 ``pgr_findCloseEdges``" msgid "Using :doc:`pgr_findCloseEdges`:" msgstr "使用 :doc:`pgr_findCloseEdges`:" -msgid "" -"Visit from vertex :math:`1` to the two locations on the graph of point " -"`(2.9, 1.8)` in order of closeness to the graph." -msgstr "" -"从顶点 :math:`1` 开始，按照距离图形最近的顺序访问点 `(2.9, 1.8)` 上的两个位" -"置。" +msgid "Visit from vertex :math:`1` to the two locations on the graph of point `(2.9, 1.8)` in order of closeness to the graph." +msgstr "从顶点 :math:`1` 开始，按照距离图形最近的顺序访问点 `(2.9, 1.8)` 上的两个位置。" -msgid "" -"Point :math:`-1` corresponds to the closest edge from point `(2.9, 1.8)`." +msgid "Point :math:`-1` corresponds to the closest edge from point `(2.9, 1.8)`." msgstr "点 :math:`-1`对应于距离点`(2.9, 1.8)` 最近的边。" -msgid "" -"Point :math:`-2` corresponds to the next close edge from point `(2.9, 1.8)`." +msgid "Point :math:`-2` corresponds to the next close edge from point `(2.9, 1.8)`." msgstr "点 :math:`-2`对应于点`(2.9, 1.8)` 的下一个闭合边。" -msgid "" -"Point :math:`-2` is visited on the route to from vertex :math:`1` to Point :" -"math:`-1` (See row where :math:`seq = 4`)." -msgstr "" -"点 :math:`-2`在从顶点 :math:`1` 到点 :math:`-1` 的路线上被访问（参见行 ，其" -"中:math:`seq = 4`）。" +msgid "Point :math:`-2` is visited on the route to from vertex :math:`1` to Point :math:`-1` (See row where :math:`seq = 4`)." +msgstr "点 :math:`-2`在从顶点 :math:`1` 到点 :math:`-1` 的路线上被访问（参见行 ，其中:math:`seq = 4`）。" msgid "Usage variations" msgstr "用法变化" -msgid "" -"All this examples are about the route that visits the vertices :math:`\\{-6, " -"7, -4, 8, -2\\}` in that order on a directed graph." -msgstr "" -"所有这些示例都是关于按有向图上的顺序访问顶点 :math:`\\{-6, 7, -4, 8, -2\\}` " -"的路线。" +msgid "All this examples are about the route that visits the vertices :math:`\\{-6, 7, -4, 8, -2\\}` in that order on a directed graph." +msgstr "所有这些示例都是关于按有向图上的顺序访问顶点 :math:`\\{-6, 7, -4, 8, -2\\}` 的路线。" msgid "Status of \"passes in front\" or \"visits\" of the nodes and points." msgstr "节点、点的\"通过\"或\"访问\"状态。" @@ -16980,52 +13460,26 @@ msgstr "节点、点的\"通过\"或\"访问\"状态。" msgid "The algorithm performs a :doc:`pgr_withPointsVia`" msgstr "该算法执行 :doc:`pgr_withPointsVia`" -msgid "" -"Detects which of the paths pass through a restriction in this case is for " -"the ``path_id = 1`` from ``-6`` to ``15`` because the path :math:`9 " -"\\rightarrow 16` is restricted." -msgstr "" -"检测哪些路径通过了限制，在本例中是针对从 ``-6`` 到 ``15`` 的 ``path_id = " -"1`` ，因为路径 :math:`9 \\rightarrow 16` 受到限制。" +msgid "Detects which of the paths pass through a restriction in this case is for the ``path_id = 1`` from ``-6`` to ``15`` because the path :math:`9 \\rightarrow 16` is restricted." +msgstr "检测哪些路径通过了限制，在本例中是针对从 ``-6`` 到 ``15`` 的 ``path_id = 1`` ，因为路径 :math:`9 \\rightarrow 16` 受到限制。" -msgid "" -"Executes the :ref:`TRSP-family:TRSP algorithm` for the conflicting paths." +msgid "Executes the :ref:`TRSP-family:TRSP algorithm` for the conflicting paths." msgstr "对冲突路径执行 :ref:`TRSP-family:TRSP algorithm`。" -msgid "" -"From the :doc:`pgr_withPointsVia` result it removes the conflicting paths " -"and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" -msgstr "" -"从 :doc:`pgr_withPointsVia` 的结果中移除冲突的路径，并使用 :doc:`pgr_trsp` 算" -"法的结果构建解决方案：" +msgid "From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" +msgstr "从 :doc:`pgr_withPointsVia` 的结果中移除冲突的路径，并使用 :doc:`pgr_trsp` 算法的结果构建解决方案：" msgid "Getting the same result as ``pgr_trspVia_withPoints``:" msgstr "得到与 ``pgr_trspVia_withPoints`` 相同的结果：" -msgid "" -"The first step, doing a :doc:`pgr_withPointsVia` does consider not making a " -"U turn on the same edge. But the path :math:`9 \\rightarrow 16` (Rows 4 and " -"5) is restricted and the result is using it." -msgstr "" -"第一步，执行 :doc:`pgr_withPointsVia` 不考虑在同一条边上进行掉头。但是路径 :" -"math:`9 \\rightarrow 16` （第4行和第5行）受到限制，结果中使用了它。" +msgid "The first step, doing a :doc:`pgr_withPointsVia` does consider not making a U turn on the same edge. But the path :math:`9 \\rightarrow 16` (Rows 4 and 5) is restricted and the result is using it." +msgstr "第一步，执行 :doc:`pgr_withPointsVia` 不考虑在同一条边上进行掉头。但是路径 :math:`9 \\rightarrow 16` （第4行和第5行）受到限制，结果中使用了它。" -msgid "" -"When executing the :doc:`pgr_trsp_withPoints` algorithm for the conflicting " -"path, there is no ``U_turn_on_edge`` flag." -msgstr "" -"当执行 :doc:`pgr_trsp_withPoints` 针对冲突路径的算法时，没有 " -"``U_turn_on_edge`` 标志。" +msgid "When executing the :doc:`pgr_trsp_withPoints` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag." +msgstr "当执行 :doc:`pgr_trsp_withPoints` 针对冲突路径的算法时，没有 ``U_turn_on_edge`` 标志。" -msgid "" -"Therefore the result ignores the ``U_turn_on_edge`` flag when set to " -"``false``. From the :doc:`pgr_withPointsVia` result it removes the " -"conflicting paths and builds the solution with the results of the :doc:" -"`pgr_trsp` algorithm. In this case a U turn is been done using the same edge." -msgstr "" -"因此，当设置为 ``false`` 时，结果会忽略 ``U_turn_on_edge`` 标志。 从 :doc:" -"`pgr_withPointsVia` 结果中，它删除了冲突路径，并使用 :doc:`pgr_trsp` 算法的结" -"果构建解决方案。 在这种情况下，使用相同的边缘完成 U 形转弯。" +msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``. From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm. In this case a U turn is been done using the same edge." +msgstr "因此，当设置为 ``false`` 时，结果会忽略 ``U_turn_on_edge`` 标志。 从 :doc:`pgr_withPointsVia` 结果中，它删除了冲突路径，并使用 :doc:`pgr_trsp` 算法的结果构建解决方案。 在这种情况下，使用相同的边缘完成 U 形转弯。" msgid "``pgr_trsp_withPoints``" msgstr "``pgr_trsp_withPoints``" @@ -17034,12 +13488,8 @@ msgid "``pgr_trsp_withPoints`` Routing Vertex/Point with restrictions." msgstr "``pgr_trsp_withPoints`` 有限制的路由顶点/点。" #, fuzzy -msgid "" -"Modify the graph to include points defined by `Points SQL`_. Consider the " -"invalid paths on `Restrictions SQL`_. Using Dijkstra algorithm, find the " -"shortest path." -msgstr "" -"修改图形，使其包含由 points_sql 定义的点。使用 Dijkstra 算法找出最短路径" +msgid "Modify the graph to include points defined by `Points SQL`_. Consider the invalid paths on `Restrictions SQL`_. Using Dijkstra algorithm, find the shortest path." +msgstr "修改图形，使其包含由 points_sql 定义的点。使用 Dijkstra 算法找出最短路径" msgid "Vertices of the graph are:" msgstr "图的顶点是：" @@ -17057,110 +13507,66 @@ msgid "The `agg_cost` in the non included values `(u, v)` is :math:`\\infty`" msgstr "非包含值 `(u, v)` 中的 `agg_cost` 为 :math:`\\infty`" #, fuzzy -msgid "" -"For optimization purposes, any duplicated value in the input arrays of " -"**start vids** or **end vids** or are ignored." +msgid "For optimization purposes, any duplicated value in the input arrays of **start vids** or **end vids** or are ignored." msgstr "出于优化目的， `start vids` 或`end vids`中的任何重复值都将被忽略。" msgid "Running time: :math:`O(|start\\_vids|\\times(V \\log V + E))`" msgstr "运行时间： :math:`O(|start\\_vids|\\times(V \\log V + E))`" #, fuzzy -msgid "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**start vid**, **end vid**, [**driving side**,] [**options**])" -msgstr "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**start vid**, **end vids**, [**options**])" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**,] [**options**])" +msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**options**])" #, fuzzy -msgid "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**start vid**, **end vids**, [**driving side**,] [**options**])" -msgstr "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**start vid**, **end vids**, [**options**])" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**,] [**options**])" +msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**options**])" #, fuzzy -msgid "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**start vids**, **end vid**, [**driving side**,] [**options**])" -msgstr "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**start vid**, **end vids**, [**options**])" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**,] [**options**])" +msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**options**])" #, fuzzy -msgid "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**start vids**, **end vids**, [**driving side**,] [**options**])" -msgstr "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**start vid**, **end vids**, [**options**])" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**,] [**options**])" +msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**options**])" #, fuzzy -msgid "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"`Combinations SQL`_, [**driving side**,] [**options**])" -msgstr "" -"pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -"**via vertices**, [**options**])" +msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**,] [**options**])" +msgstr "pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, [**options**])" msgid "**options:** ``[directed, details]``" msgstr "**options:** ``[directed, details]``" #, fuzzy -msgid "" -"From point :math:`1` to vertex :math:`10` with right driving side in " -"directed graph. (with details)" -msgstr "" -"从点 :math:`1` 到顶点 :math:`10`，在有向图上显示左侧驾驶侧配置的详细信息。" +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (with details)" +msgstr "从点 :math:`1` 到顶点 :math:`10`，在有向图上显示左侧驾驶侧配置的详细信息。" -msgid "" -"From point :math:`1` to point :math:`3` and vertex :math:`7` on an " -"undirected graph" +msgid "From point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" msgstr "无向图上的点 :math:`1` 到点 :math:`3` 和顶点 :math:`7`" #, fuzzy -msgid "" -"From point :math:`1` and vertex :math:`6` to point :math:`3` with right " -"driving side in directed graph. (without details)" -msgstr "" -"无向图上从点 :math:`1` 和顶点 :math:`6` 到点 :math:`3`到顶点 :math:`1` 的详细" -"信息。" +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph. (without details)" +msgstr "无向图上从点 :math:`1` 和顶点 :math:`6` 到点 :math:`3`到顶点 :math:`1` 的详细信息。" #, fuzzy -msgid "" -"From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :" -"math:`1` with left side driving." +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` with left side driving." msgstr "从点 :math:`1` 和顶点 :math:`6` 到点 :math:`3` 和顶点 :math:`1`。" msgid "Two combinations" msgstr "两种组合" #, fuzzy -msgid "" -"From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to " -"point :math:`3` with right side driving. (with details)" -msgstr "" -"从点 :math:`1` 到顶点 :math:`10`，以及从顶点 :math:`6` 到点 :math:`3` ，**右" -"侧** 行驶。" +msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving. (with details)" +msgstr "从点 :math:`1` 到顶点 :math:`10`，以及从顶点 :math:`6` 到点 :math:`3` ，**右侧** 行驶。" msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_." msgstr "在 `Points SQL`_ 中使用 :doc:`pgr_findCloseEdges` 。" -msgid "" -"Find the routes from vertex :math:`1` to the two closest locations on the " -"graph of point `(2.9, 1.8)`." +msgid "Find the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." msgstr "找到从顶点 :math:`1` 到点 `(2.9, 1.8)` 图上两个最近位置的路线。" #, fuzzy -msgid "" -"All the examples are about traveling from point :math:`1` and vertex :math:" -"`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}` with " -"restrictions" -msgstr "" -"所有示例都是关于从点 :math:`1` 和顶点 :math:`5` 到点 :math:`\\{2, 3, 6\\}` 和" -"顶点 :math:`\\{10, 11\\}` 的旅行" +msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}` with restrictions" +msgstr "所有示例都是关于从点 :math:`1` 和顶点 :math:`5` 到点 :math:`\\{2, 3, 6\\}` 和顶点 :math:`\\{10, 11\\}` 的旅行" msgid "Passes in front or visits with right side driving." msgstr "从前方超车或右侧行驶来访。" @@ -17174,23 +13580,14 @@ msgstr "从前方超车或以左侧驾驶方式行驶。" msgid "``pgr_turnRestrictedPath`` - Experimental" msgstr "``pgr_turnRestrictedPath`` - 实验性" -msgid "" -"``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex - Vertex routing " -"with restrictions" -msgstr "" -"``pgr_turnRestrictedPath`` 使用 Yen 算法进行带有限制的顶点到顶点路径规划" +msgid "``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex - Vertex routing with restrictions" +msgstr "``pgr_turnRestrictedPath`` 使用 Yen 算法进行带有限制的顶点到顶点路径规划" -msgid "" -"Using Yen's algorithm to obtain K shortest paths and analyze the paths to " -"select the paths that do not use the restrictions" +msgid "Using Yen's algorithm to obtain K shortest paths and analyze the paths to select the paths that do not use the restrictions" msgstr "利用Yen算法获得K条最短路径并对路径进行分析以选择不使用限制的路径" -msgid "" -"pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, " -"**end vid**, **K**, [**options**])" -msgstr "" -"pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, " -"**end vid**, **K**, [**options**])" +msgid "pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, **K**, [**options**])" +msgstr "pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, **K**, [**options**])" msgid "**options:** ``[directed, heap_paths, stop_on_first, strict]``" msgstr "**options:** ``[directed, heap_paths, stop_on_first, strict]``" @@ -17204,8 +13601,7 @@ msgstr "特殊可选参数" msgid "``stop_on_first``" msgstr "``stop_on_first``" -msgid "" -"When ``true`` stops on first path found that dos not violate restrictions" +msgid "When ``true`` stops on first path found that dos not violate restrictions" msgstr "当 ``true`` 停止在发现不违反限制的第一条路径上时" msgid "When ``false`` returns at most K paths" @@ -17265,119 +13661,69 @@ msgstr "**TBD**" msgid "TBD" msgstr "TBD" -msgid "" -"``pgr_withPoints`` - Returns the shortest path in a graph with additional " -"temporary vertices." +msgid "``pgr_withPoints`` - Returns the shortest path in a graph with additional temporary vertices." msgstr "``pgr_withPoints`` - 返回图中带有附加临时顶点的最短路径。" msgid "pgr_withPoints(Combinations)" msgstr "pgr_withPoints（组合）" #, fuzzy -msgid "" -"Modify the graph to include points defined by `Points SQL`_. Using Dijkstra " -"algorithm, find the shortest path." -msgstr "" -"修改图形，使其包含由 points_sql 定义的点。使用 Dijkstra 算法找出最短路径" +msgid "Modify the graph to include points defined by `Points SQL`_. Using Dijkstra algorithm, find the shortest path." +msgstr "修改图形，使其包含由 points_sql 定义的点。使用 Dijkstra 算法找出最短路径" #, fuzzy -msgid "" -"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, " -"[**driving side**] [**options**])" -msgstr "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, " -"**K**, **driving_side**, [**options**])" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, **driving_side**, [**options**])" #, fuzzy -msgid "" -"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, " -"[**driving side**] [**options**])" -msgstr "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, " -"**K**, **driving_side**, [**options**])" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, **driving_side**, [**options**])" #, fuzzy -msgid "" -"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, " -"[**driving side**] [**options**])" -msgstr "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, " -"**K**, **driving_side**, [**options**])" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, **driving_side**, [**options**])" #, fuzzy -msgid "" -"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, " -"[**driving side**] [**options**])" -msgstr "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, " -"**K**, **driving_side**, [**options**])" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, **driving_side**, [**options**])" #, fuzzy -msgid "" -"pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving " -"side**] [**options**])" -msgstr "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, " -"**driving_side**, [**options**])" +msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, **driving_side**, [**options**])" #, fuzzy msgid "**options:** ``[directed, details])``" msgstr "**options:** ``[directed, details]``" #, fuzzy -msgid "" -"From point :math:`1` to vertex :math:`10` with right driving side in " -"directed graph. (without details)" -msgstr "" -"从点 :math:`1` 到顶点 :math:`10`，在有向图上显示左侧驾驶侧配置的详细信息。" +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (without details)" +msgstr "从点 :math:`1` 到顶点 :math:`10`，在有向图上显示左侧驾驶侧配置的详细信息。" -msgid "" -"Identifier of the starting vertex of the path. Negative value is for point’s " -"identifier." +msgid "Identifier of the starting vertex of the path. Negative value is for point’s identifier." msgstr "路径起始顶点的标识符。 负值用于点的标识符。" -msgid "" -"Array of identifiers of starting vertices. Negative values are for point’s " -"identifiers." +msgid "Array of identifiers of starting vertices. Negative values are for point’s identifiers." msgstr "起始顶点的标识符数组。 负值用于点的标识符。" -msgid "" -"Identifier of the ending vertex of the path. Negative value is for point’s " -"identifier." +msgid "Identifier of the ending vertex of the path. Negative value is for point’s identifier." msgstr "路径结束顶点的标识符。 负值用于点的标识符。" -msgid "" -"Array of identifiers of ending vertices. Negative values are for point’s " -"identifiers." +msgid "Array of identifiers of ending vertices. Negative values are for point’s identifiers." msgstr "结束顶点的标识符数组。 负值用于点的标识符。" -msgid "" -"All the examples are about traveling from point :math:`1` and vertex :math:" -"`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" -msgstr "" -"所有示例都是关于从点 :math:`1` 和顶点 :math:`5` 到点 :math:`\\{2, 3, 6\\}` 和" -"顶点 :math:`\\{10, 11\\}` 的旅行" +msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" +msgstr "所有示例都是关于从点 :math:`1` 和顶点 :math:`5` 到点 :math:`\\{2, 3, 6\\}` 和顶点 :math:`\\{10, 11\\}` 的旅行" -msgid "" -"``pgr_withPointsCost`` - Calculates the shortest path and returns only the " -"aggregate cost of the shortest path found, for the combination of points " -"given." -msgstr "" -"``pgr_withPointsCost`` - 计算最短路径，并只返回所给点组合的最短路径的总成本。" +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`` - 计算最短路径，并只返回所给点组合的最短路径的总成本。" msgid "pgr_withPointsCost(Combinations)" msgstr "pgr_withPointsCost（组合）" -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 算法，只返回找到的最短路" -"径的总成本。" +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 算法，只返回找到的最短路径的总成本。" -msgid "" -"Returns the sum of the costs of the shortest path for pair combination of " -"vertices in the modified graph." +msgid "Returns the sum of the costs of the shortest path for pair combination of vertices in the modified graph." msgstr "返回修改图中顶点对组合的最短路径成本之和。" #, fuzzy @@ -17390,90 +13736,52 @@ msgstr "当它属于edges_sql时为 **正**" msgid "**negative** when it belongs to the points_sql" msgstr "当它属于 points_sql时为 **负**" -msgid "" -"If the values returned are stored in a table, the unique index would be the " -"pair: `(start_vid, end_vid)`." -msgstr "" -"如果返回的值存储在表中，则唯一索引将是这一对： `(start_vid, end_vid)` 。" +msgid "If the values returned are stored in a table, 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 "对于 **无向** 图，结果是 **对称** 的。" #, fuzzy -msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, " -"[**driving side**] [**options**])" -msgstr "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, " -"**K**, **driving_side**, [**options**])" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, **driving_side**, [**options**])" #, fuzzy -msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, " -"[**driving side**] [**options**])" -msgstr "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, " -"**K**, **driving_side**, [**options**])" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, **driving_side**, [**options**])" #, fuzzy -msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, " -"[**driving side**] [**options**])" -msgstr "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, " -"**K**, **driving_side**, [**options**])" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, **driving_side**, [**options**])" #, fuzzy -msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end " -"vids**, [**driving side**] [**options**])" -msgstr "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, " -"**K**, **driving_side**, [**options**])" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, **driving_side**, [**options**])" #, fuzzy -msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, " -"[**driving side**] [**options**])" -msgstr "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, " -"**driving_side**, [**options**])" +msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, **driving_side**, [**options**])" #, fuzzy msgid "**options:** ``[directed]``" msgstr "**options:** ``[directed, cap]``" -msgid "" -"There is no **details** flag, unlike the other members of the withPoints " -"family of functions." +msgid "There is no **details** flag, unlike the other members of the withPoints family of functions." msgstr "与 withPoints 函数系列的其他成员不同，没有 **详细信息** 标志。" #, fuzzy -msgid "" -"From point :math:`1` to vertex :math:`10` with right driving side in " -"directed graph." -msgstr "" -"从点 :math:`1` 到顶点 :math:`10`，在有向图上显示左侧驾驶侧配置的详细信息。" +msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph." +msgstr "从点 :math:`1` 到顶点 :math:`10`，在有向图上显示左侧驾驶侧配置的详细信息。" #, fuzzy -msgid "" -"From point :math:`1` and vertex :math:`6` to point :math:`3` with right " -"driving side in directed graph." -msgstr "" -"无向图上从点 :math:`1` 和顶点 :math:`6` 到点 :math:`3`到顶点 :math:`1` 的详细" -"信息。" +msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph." +msgstr "无向图上从点 :math:`1` 和顶点 :math:`6` 到点 :math:`3`到顶点 :math:`1` 的详细信息。" #, fuzzy -msgid "" -"From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to " -"point :math:`3` with right side driving." -msgstr "" -"从点 :math:`1` 到顶点 :math:`10`，以及从顶点 :math:`6` 到点 :math:`3` ，**右" -"侧** 行驶。" +msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving." +msgstr "从点 :math:`1` 到顶点 :math:`10`，以及从顶点 :math:`6` 到点 :math:`3` ，**右侧** 行驶。" -msgid "" -"Find the cost of the routes from vertex :math:`1` to the two closest " -"locations on the graph of point `(2.9, 1.8)`." +msgid "Find the cost of the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`." msgstr "求从顶点 :math:`1` 到图中点 `(2.9, 1.8)` 的两个最近位置的路线成本。" msgid "Being close to the graph does not mean have a shorter route." @@ -17482,12 +13790,8 @@ msgstr "靠近图表并不意味着路线更短。" msgid "Right side driving topology" msgstr "右侧驾驶拓扑" -msgid "" -"Traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, " -"3, 6\\}` and vertices :math:`\\{10, 11\\}`" -msgstr "" -"从点 :math:`1` 和顶点 :math:`5` 出发，前往点 :math:`\\{2, 3, 6\\}` 和顶点 :" -"math:`\\{10, 11\\}`" +msgid "Traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" +msgstr "从点 :math:`1` 和顶点 :math:`5` 出发，前往点 :math:`\\{2, 3, 6\\}` 和顶点 :math:`\\{10, 11\\}`" msgid "Left side driving topology" msgstr "左侧驾驶拓扑" @@ -17495,25 +13799,15 @@ msgstr "左侧驾驶拓扑" msgid "Does not matter driving side driving topology" msgstr "与驱动端驱动拓扑无关" -msgid "" -"``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:" -"`pgr_withPoints`." -msgstr "" -"``pgr_withPointsCostMatrix`` - 使用 :doc:`pgr_withPoints` 计算成本矩阵。" +msgid "``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:`pgr_withPoints`." +msgstr "``pgr_withPointsCostMatrix`` - 使用 :doc:`pgr_withPoints` 计算成本矩阵。" #, fuzzy -msgid "" -"pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, " -"[**driving side**] [**options**])" -msgstr "" -"pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, " -"[**options**])" +msgid "pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, [**driving side**] [**options**])" +msgstr "pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, [**options**])" -msgid "" -"Cost matrix for points :math:`\\{1, 6\\}` and vertices :math:`\\{10, 11\\}` " -"on an **undirected** graph" -msgstr "" -"**无向** 图上的点 :math:`\\{1, 6\\}` 和顶点 :math:`\\{10, 11\\}` 的成本矩阵" +msgid "Cost matrix for points :math:`\\{1, 6\\}` and vertices :math:`\\{10, 11\\}` on an **undirected** graph" +msgstr "**无向** 图上的点 :math:`\\{1, 6\\}` 和顶点 :math:`\\{10, 11\\}` 的成本矩阵" msgid "Returning a **symmetrical** cost matrix" msgstr "返回 **对称** 成本矩阵" @@ -17525,15 +13819,10 @@ msgstr "在 **points_sql** 查询上使用默认 ``side`` 值" msgid "Using the default ``driving side`` value" msgstr "使用默认 ``driving_side`` 值" -msgid "" -"Find the matrix cost of the routes from vertex :math:`1` and the two closest " -"locations on the graph of point `(2.9, 1.8)`." -msgstr "" -"求从顶点 :math:`1` 到图上点 `(2.9, 1.8)` 的两个最近位置的路线的矩阵成本。" +msgid "Find the matrix cost of the routes from vertex :math:`1` and the two closest locations on the graph of point `(2.9, 1.8)`." +msgstr "求从顶点 :math:`1` 到图上点 `(2.9, 1.8)` 的两个最近位置的路线的矩阵成本。" -msgid "" -"``pgr_withPointsDD`` - Returns the driving **distance** from a starting " -"point." +msgid "``pgr_withPointsDD`` - Returns the driving **distance** from a starting point." msgstr "``pgr_withPointsDD`` - 返回从起点开始的行驶 **距离** 。" #, fuzzy @@ -17545,38 +13834,22 @@ msgstr "当 ``details`` 为 ``false`` 时：" #, fuzzy msgid "Points reached within the distance are not included." -msgstr "" -"只有那些被访问的兴趣点会被移除，也就是说，位于一定距离范围内被到达的兴趣点会" -"被包含在内" +msgstr "只有那些被访问的兴趣点会被移除，也就是说，位于一定距离范围内被到达的兴趣点会被包含在内" #, fuzzy msgid "Deprecated signatures:" msgstr "弃用签名" -msgid "" -"Modify the graph to include points and using Dijkstra algorithm, extracts " -"all the nodes and points that have costs less than or equal to the value " -"``**distance**`` from the starting point. The edges extracted will conform " -"the corresponding spanning tree." -msgstr "" -"修改图以包含点，并使用 Dijkstra 算法，提取成本小于或等于距起点 ``**距离**`` " -"值的所有节点和点。 提取的边将符合相应的生成树。" +msgid "Modify the graph to include points and using Dijkstra algorithm, extracts all the nodes and points that have costs less than or equal to the value ``**distance**`` from the starting point. The edges extracted will conform the corresponding spanning tree." +msgstr "修改图以包含点，并使用 Dijkstra 算法，提取成本小于或等于距起点 ``**距离**`` 值的所有节点和点。 提取的边将符合相应的生成树。" #, fuzzy -msgid "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, " -"[**driving side**], [**options A**])" -msgstr "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, " -"**driving side**, [**options A**])" +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options A**])" +msgstr "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, **driving side**, [**options A**])" #, fuzzy -msgid "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, " -"[**driving side**], [**options B**])" -msgstr "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, " -"**driving side**, [**options B**])" +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options B**])" +msgstr "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, **driving side**, [**options B**])" msgid "**options A:** ``[directed, details]``" msgstr "**options A:** ``[directed, details]``" @@ -17585,70 +13858,44 @@ msgid "**options B:** ``[directed, details, equicost]``" msgstr "**options B:** ``[directed, details, equicost]``" #, fuzzy -msgid "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, " -"[**driving side**], [**options**])" -msgstr "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, " -"**driving side**, [**options**])" +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options**])" +msgstr "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, **driving side**, [**options**])" -msgid "" -"Right side driving topology, from point :math:`1` within a distance of :math:" -"`3.3` with details." -msgstr "" -"右侧驾驶拓扑，从点 :math:`1` 开始，距离不超过 :math:`3.3`，并提供详细信息。" +msgid "Right side driving topology, from point :math:`1` within a distance of :math:`3.3` with details." +msgstr "右侧驾驶拓扑，从点 :math:`1` 开始，距离不超过 :math:`3.3`，并提供详细信息。" #, fuzzy -msgid "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, " -"[**driving side**], [**options**])" -msgstr "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, " -"**driving side**, [**options**])" +msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options**])" +msgstr "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, **driving side**, [**options**])" msgid "**options:** ``[directed, details, equicost]``" msgstr "**options:** ``[directed, details, equicost]``" -msgid "" -"From point :math:`1` and vertex :math:`16` within a distance of :math:`3.3` " -"with ``equicost`` on a directed graph" -msgstr "" -"从点 :math:`1` 和顶点 :math:`16` 出发，在有向图上以 ``equicost`` 模式，在距离" -"不超过 :math:`3.3` 的范围内" +msgid "From point :math:`1` and vertex :math:`16` within a distance of :math:`3.3` with ``equicost`` on a directed graph" +msgstr "从点 :math:`1` 和顶点 :math:`16` 出发，在有向图上以 ``equicost`` 模式，在距离不超过 :math:`3.3` 的范围内" msgid "Negative values represent a point" msgstr "负值代表一个点" -msgid "" -"Find the driving distance from the two closest locations on the graph of " -"point `(2.9, 1.8)`." +msgid "Find the driving distance from the two closest locations on the graph of point `(2.9, 1.8)`." msgstr "求图上点 `(2.9, 1.8)` 距离最近的两个位置的行驶距离。" -msgid "" -"Point :math:`-1` corresponds to the closest edge from point :math:`(2.9, " -"1.8)`." +msgid "Point :math:`-1` corresponds to the closest edge from point :math:`(2.9, 1.8)`." msgstr "点 :math:`-1` 对应距离点 :math:`(2.9, 1.8)` 最近的边。" -msgid "" -"Point :math:`-2` corresponds to the next close edge from point :math:`(2.9, " -"1.8)`." +msgid "Point :math:`-2` corresponds to the next close edge from point :math:`(2.9, 1.8)`." msgstr "点 :math:`-2` 对应于点 :math:`(2.9, 1.8)` 的下一条近边。" msgid "Driving side does not matter" msgstr "驾驶侧并不重要" -msgid "" -"From point :math:`1` within a distance of :math:`3.3`, does not matter " -"driving side, with details." -msgstr "" -"从点 :math:`1` 开始，在距离不超过 :math:`3.3` 的范围内，无论驾驶方向如何，提" -"供详细信息。" +msgid "From point :math:`1` within a distance of :math:`3.3`, does not matter driving side, with details." +msgstr "从点 :math:`1` 开始，在距离不超过 :math:`3.3` 的范围内，无论驾驶方向如何，提供详细信息。" msgid "``pgr_withPointsKSP``" msgstr "``pgr_withPointsKSP``" -msgid "" -"``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." +msgid "``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." msgstr "``pgr_withPointsKSP`` — Yen 使用 Dijkstra 计算 K 最短路径的算法。" msgid "pgr_withPointsKSP(One to Many)" @@ -17663,60 +13910,34 @@ msgstr "pgr_withPointsKSP(Many to Many)" msgid "pgr_withPointsKSP(Combinations)" msgstr "pgr_withPointsKSP(Combinations)" -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` 最短路径。" +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` 最短路径。" #, fuzzy -msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, " -"**K**, [**driving side**], [**options**])" -msgstr "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, " -"**K**, **driving_side**, [**options**])" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, [**driving side**], [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, **driving_side**, [**options**])" #, fuzzy -msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, " -"**K**, [**driving side**], [**options**])" -msgstr "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, " -"**K**, **driving_side**, [**options**])" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, [**driving side**], [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, **driving_side**, [**options**])" #, fuzzy -msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, " -"**K**, [**driving side**], [**options**])" -msgstr "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, " -"**K**, **driving_side**, [**options**])" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, [**driving side**], [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, **driving_side**, [**options**])" #, fuzzy -msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, " -"**K**, [**driving side**], [**options**])" -msgstr "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, " -"**K**, **driving_side**, [**options**])" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, [**driving side**], [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, **driving_side**, [**options**])" #, fuzzy -msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, " -"[**driving side**], [**options**])" -msgstr "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, " -"**driving_side**, [**options**])" +msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, [**driving side**], [**options**])" +msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, **driving_side**, [**options**])" msgid "**options:** ``[directed, heap_paths, details]``" msgstr "**options:** ``[directed, heap_paths, details]``" -msgid "" -"Get 2 paths from Point :math:`1` to point :math:`2` on a directed graph with " -"**left** side driving." -msgstr "" -"在具有 **左侧** 驾驶的有向图上，从点 :math:`1` 到点 :math:`2` 获取两条路径。" +msgid "Get 2 paths from Point :math:`1` to point :math:`2` on a directed graph with **left** side driving." +msgstr "在具有 **左侧** 驾驶的有向图上，从点 :math:`1` 到点 :math:`2` 获取两条路径。" msgid "For a directed graph." msgstr "有向图。" @@ -17727,26 +13948,14 @@ msgstr "没有给出有关查询的其他点的距离的详细信息。" msgid "No heap paths are returned." msgstr "不返回堆路径。" -msgid "" -"Get 2 paths from point :math:`1` to point :math:`3` and vertex :math:`7` on " -"an undirected graph" +msgid "Get 2 paths from point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph" msgstr "在无向图上从点 :math:`1` 到点 :math:`3` 和顶点 :math:`7` 获取两条路径" -msgid "" -"Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` on a " -"**directed** graph with **right** side driving and **details** set to " -"**True**" -msgstr "" -"在具有 **右侧** 驾驶的 **有向** 图上，从点 :math:`1` 和顶点 :math:`6` 到点 :" -"math:`3` 获取一条路径，且 **details** 设置为 **True**" +msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` on a **directed** graph with **right** side driving and **details** set to **True**" +msgstr "在具有 **右侧** 驾驶的 **有向** 图上，从点 :math:`1` 和顶点 :math:`6` 到点 :math:`3` 获取一条路径，且 **details** 设置为 **True**" -msgid "" -"Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` and " -"vertex :math:`1` on a **directed** graph with **left** side driving and " -"**heap_paths** set to **True**" -msgstr "" -"在具有 **左侧** 驾驶的 **有向** 图上，从点 :math:`1` 和顶点 :math:`6` 到点 :" -"math:`3` 和顶点 :math:`1` 获取一条路径，且 **heap_paths** 设置为 **True**" +msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` on a **directed** graph with **left** side driving and **heap_paths** set to **True**" +msgstr "在具有 **左侧** 驾驶的 **有向** 图上，从点 :math:`1` 和顶点 :math:`6` 到点 :math:`3` 和顶点 :math:`1` 获取一条路径，且 **heap_paths** 设置为 **True**" msgid "Using a combinations table on an **directed** graph" msgstr "在 **有向** 图上使用组合表" @@ -17757,129 +13966,66 @@ msgstr "所需路径的数量" msgid "withPointsKSP optional parameters" msgstr "withPointsKSP可选参数" -msgid "" -"Get :math:`2` paths using left side driving topology, from vertex :math:`1` " -"to the closest location on the graph of point `(2.9, 1.8)`." -msgstr "" -"使用左侧驾驶拓扑，从顶点 :math:`1` 到离点 `(2.9, 1.8)` 最近的位置获取 :math:" -"`2` 条路径。" +msgid "Get :math:`2` paths using left side driving topology, from vertex :math:`1` to the closest location on the graph of point `(2.9, 1.8)`." +msgstr "使用左侧驾驶拓扑，从顶点 :math:`1` 到离点 `(2.9, 1.8)` 最近的位置获取 :math:`2` 条路径。" 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." -msgstr "" -"使用左侧驾驶拓扑，从点 :math:`1` 到点 :math:`3` 获取 :math:`2` 条路径，并包含" -"详细信息。" +msgid "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 "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." +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 "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)` 。" #, fuzzy -msgid "" -"pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, [**driving " -"side**] [**options**])" -msgstr "" -"pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, " -"[**options**])" +msgid "pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, [**driving side**] [**options**])" +msgstr "pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, [**options**])" #, fuzzy -msgid "" -"Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that " -"order with right driving side in directed graph.." +msgid "Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that order with right driving side in directed graph.." msgstr "在有向图上查找按顺序访问顶点 :math:`\\{-6, 15, -5\\}` 的路线。" 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 "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 "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 "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 "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 "Boost: `Prim's algorithm `__" +msgstr "Boost: `Prim算法 `__" -msgid "" -"Wikipedia: `Prim's algorithm `__" -msgstr "" -"维基百科: `Prim算法 `__" +msgid "Wikipedia: `Prim's algorithm `__" +msgstr "维基百科: `Prim算法 `__" msgid "Proposed Functions" msgstr "提议的功能" -msgid "" -":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." +msgid ":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." msgstr ":doc:`pgr_lineGraph` - 用于生成折线图的转换算法。" msgid "Reference" @@ -17888,12 +14034,8 @@ 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 "To see the full list of changes check the list of `Git commits `_ on Github." +msgstr "要查看完整的更改列表，请检查 Github 上的 `Git提交列表 `_ 。" msgid "Mayors" msgstr "主要版本" @@ -17904,9 +14046,21 @@ msgstr "pgRouting 4" msgid "Minors 4.x" msgstr "Minors 4.x" -msgid "pgRouting 4.0" +#, fuzzy +msgid "pgRouting 4.1" msgstr "pgRouting 4.0" +#, fuzzy +msgid "pgRouting 4.1.0 Release Notes" +msgstr "pgRouting 3.1.0 发布说明" + +#, fuzzy +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.1.0 `__" +msgstr "查看本版本已关闭的所有议题和拉取请求,请访问： `GitHub 4.0.0版本里程碑关闭列表 `__" + +msgid "No changes yet" +msgstr "" + msgid "pgRouting 3" msgstr "pgRouting 3" @@ -17920,14 +14074,8 @@ msgid "pgRouting 3.8.0 Release Notes" msgstr "pgRouting 3.8.0 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.8.0 `__" -msgstr "" -"查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.8.0版本里程碑关闭列" -"表 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.8.0 `__" +msgstr "查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.8.0版本里程碑关闭列表 `__" msgid "Promotion to official function of pgRouting." msgstr "升级为 pgRouting 的官方函数。" @@ -17935,43 +14083,23 @@ msgstr "升级为 pgRouting 的官方函数。" msgid "Metric" msgstr "度量" -msgid "" -"`#2760 `__: Promoted to " -"official pgr_degree in version 3.8" -msgstr "" -"`#2760 `__:pgr_degree 在 " -"3.8 版本升级为正式函数" +msgid "`#2760 `__: Promoted to official pgr_degree in version 3.8" +msgstr "`#2760 `__:pgr_degree 在 3.8 版本升级为正式函数" msgid "Utilities" msgstr "实用程序" -msgid "" -"`#2772 `__: Promoted to " -"official pgr_extractVertices in version 3.8" -msgstr "" -"`#2772 `__ :" -"pgr_extractVertices 在 3.8 版本升级为正式函数" +msgid "`#2772 `__: Promoted to official pgr_extractVertices in version 3.8" +msgstr "`#2772 `__ :pgr_extractVertices 在 3.8 版本升级为正式函数" -msgid "" -"`#2774 `__: Promoted to " -"official pgr_findCloseEdges in version 3.8" -msgstr "" -"`#2774 `__:" -"pgr_findCloseEdges 在 3.8 版本升级为正式函数" +msgid "`#2774 `__: Promoted to official pgr_findCloseEdges in version 3.8" +msgstr "`#2774 `__:pgr_findCloseEdges 在 3.8 版本升级为正式函数" -msgid "" -"`#2873 `__: Promoted to " -"official pgr_separateCrossing in version 3.8" -msgstr "" -"`#2873 `__: " -"pgr_separateCrossing 在3.8版本中被提升为官方函数" +msgid "`#2873 `__: Promoted to official pgr_separateCrossing in version 3.8" +msgstr "`#2873 `__: pgr_separateCrossing 在3.8版本中被提升为官方函数" -msgid "" -"`#2874 `__: Promoted to " -"official pgr_separateTouching in version 3.8" -msgstr "" -"`#2874 `__: " -"pgr_separateTouching 在3.8版本中被提升为官方函数" +msgid "`#2874 `__: Promoted to official pgr_separateTouching in version 3.8" +msgstr "`#2874 `__: pgr_separateTouching 在3.8版本中被提升为官方函数" msgid "Proposed functions" msgstr "提议函数" @@ -17979,60 +14107,32 @@ msgstr "提议函数" msgid "Contraction" msgstr "收缩" -msgid "" -"`#2790 `__: " -"pgr_contractionDeadEnd new contraction function" -msgstr "" -"`#2790 `__:创建新收缩函" -"数 pgr_contractionDeadEnd" +msgid "`#2790 `__: pgr_contractionDeadEnd new contraction function" +msgstr "`#2790 `__:创建新收缩函数 pgr_contractionDeadEnd" -msgid "" -"`#2791 `__: " -"pgr_contractionLinear new contraction function" -msgstr "" -"`#2791 `__:创建新收缩函" -"数 pgr_contractionLinear" +msgid "`#2791 `__: pgr_contractionLinear new contraction function" +msgstr "`#2791 `__:创建新收缩函数 pgr_contractionLinear" -msgid "" -"`#2536 `__: Support for " -"contraction hierarchies (pgr_contractionHierarchies)" -msgstr "" -"`#2536 `__: 支持收缩层级" -"(pgr_contractionHierarchies)" +msgid "`#2536 `__: Support for contraction hierarchies (pgr_contractionHierarchies)" +msgstr "`#2536 `__: 支持收缩层级(pgr_contractionHierarchies)" -msgid "" -"`#2848 `__: Create " -"pgr_separateCrossing new utility function" -msgstr "" -"`#2848 `__:创建新工具函" -"数 pgr_separateCrossing" +msgid "`#2848 `__: Create pgr_separateCrossing new utility function" +msgstr "`#2848 `__:创建新工具函数 pgr_separateCrossing" -msgid "" -"`#2849 `__: Create of " -"pgr_separateTouching new utility function" -msgstr "" -"`#2849 `__:创建新工具函" -"数 pgr_separateTouching" +msgid "`#2849 `__: Create of pgr_separateTouching new utility function" +msgstr "`#2849 `__:创建新工具函数 pgr_separateTouching" msgid "Official functions changes" msgstr "官方功能变更" -msgid "" -"`#2786 `__: " -"pgr_contraction(edges) new signature" -msgstr "" -"`#2786 `__:" -"pgr_contraction(edges) 新签名" +msgid "`#2786 `__: pgr_contraction(edges) new signature" +msgstr "`#2786 `__:pgr_contraction(edges) 新签名" msgid "C/C++ code enhancements" msgstr "C/C++ 代码增强" -msgid "" -"`#2802 `__: Code " -"reorganization on pgr_contraction" -msgstr "" -"`#2802 `__:" -"pgr_contraction 函数进行了代码重构" +msgid "`#2802 `__: Code reorganization on pgr_contraction" +msgstr "`#2802 `__:pgr_contraction 函数进行了代码重构" #, fuzzy msgid "Other enhancements:" @@ -18040,56 +14140,31 @@ msgstr "代码改进" #, fuzzy msgid "`#2869 `__:" -msgstr "" -"`#2683 `__: pgr_trsp" +msgstr "`#2683 `__: pgr_trsp" msgid "SQL code enhancements" msgstr "SQL 代码优化" -msgid "" -"`#2850 `__: Rewrite " -"pgr_nodeNetwork" -msgstr "" -"`#2850 `__:重写 " -"pgr_nodeNetwork" +msgid "`#2850 `__: Rewrite pgr_nodeNetwork" +msgstr "`#2850 `__:重写 pgr_nodeNetwork" msgid "Deprecation of SQL functions" msgstr "SQL 函数的弃用" -msgid "" -"`#2749 `__: Deprecate " -"pgr_AlphaShape in 3.8" -msgstr "" -"`#2749 `__:在 3.8 中弃用 " -"pgr_AlphaShape" +msgid "`#2749 `__: Deprecate pgr_AlphaShape in 3.8" +msgstr "`#2749 `__:在 3.8 中弃用 pgr_AlphaShape" -msgid "" -"`#2750 `__: Deprecate " -"pgr_CreateTopology in 3.8" -msgstr "" -"`#2750 `__:在 3.8 中弃用 " -"pgr_CreateTopology" +msgid "`#2750 `__: Deprecate pgr_CreateTopology in 3.8" +msgstr "`#2750 `__:在 3.8 中弃用 pgr_CreateTopology" -msgid "" -"`#2753 `__: Deprecate " -"pgr_analyzeGraph in 3.8" -msgstr "" -"`#2753 `__:在 3.8 中弃用 " -"pgr_analyzeGraph" +msgid "`#2753 `__: Deprecate pgr_analyzeGraph in 3.8" +msgstr "`#2753 `__:在 3.8 中弃用 pgr_analyzeGraph" -msgid "" -"`#2754 `__: Deprecate " -"pgr_analyzeOneWay in 3.8" -msgstr "" -"`#2754 `__:在 3.8 中弃用 " -"pgr_analyzeOneWay" +msgid "`#2754 `__: Deprecate pgr_analyzeOneWay in 3.8" +msgstr "`#2754 `__:在 3.8 中弃用 pgr_analyzeOneWay" -msgid "" -"`#2826 `__: Deprecate " -"pgr_createVerticesTable in 3.8" -msgstr "" -"`#2826 `__:在 3.8 中弃用 " -"pgr_createVerticesTable" +msgid "`#2826 `__: Deprecate pgr_createVerticesTable in 3.8" +msgstr "`#2826 `__:在 3.8 中弃用 pgr_createVerticesTable" msgid "In the deprecated functions:" msgstr "已弃用的函数中：" @@ -18107,43 +14182,23 @@ msgid "pgRouting 3.7.3 Release Notes" msgstr "pgRouting 3.7.3 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.7.3 `__" -msgstr "" -"要查看此版本关闭的所有问题和拉取请求，请参阅 `Git closed milestone for 3.7.3 " -"`__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.3 `__" +msgstr "要查看此版本关闭的所有问题和拉取请求，请参阅 `Git closed milestone for 3.7.3 `__" #, fuzzy -msgid "" -"`#2731 `__: Build " -"Failure on Ubuntu 22" -msgstr "" -"`#2731 `__ Ubuntu 22 上的构" -"建失败" +msgid "`#2731 `__: Build Failure on Ubuntu 22" +msgstr "`#2731 `__ Ubuntu 22 上的构建失败" msgid "pgRouting 3.7.2 Release Notes" msgstr "pgRouting 3.7.2 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.7.2 `__" -msgstr "" -"查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.7.2版本里程碑关闭列" -"表 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.2 `__" +msgstr "查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.7.2版本里程碑关闭列表 `__" #, fuzzy -msgid "" -"`#2713 `__: cmake " -"missing some policies and min version" -msgstr "" -"`#2713 `__ cMake 缺少一些策" -"略和最低版本要求" +msgid "`#2713 `__: cmake missing some policies and min version" +msgstr "`#2713 `__ cMake 缺少一些策略和最低版本要求" msgid "Using OLD policies: CMP0148, CMP0144, CMP0167" msgstr "使用旧版策略：CMP0148，CMP0144，CMP0167" @@ -18152,49 +14207,27 @@ msgid "Minimum cmake version 3.12" msgstr "CMake最低版本要求 3.12" #, fuzzy -msgid "" -"`#2707 `__: Build " -"failure in pgRouting 3.7.1 on Alpine" -msgstr "" -"`#2707 `__ pgRouting 3.7.1 " -"在 Alpine 上的构建失败" +msgid "`#2707 `__: Build failure in pgRouting 3.7.1 on Alpine" +msgstr "`#2707 `__ pgRouting 3.7.1 在 Alpine 上的构建失败" #, fuzzy -msgid "" -"`#2706 `__: winnie " -"crashing on pgr_betweennessCentrality" -msgstr "" -"`#2706 `__ 修复 " -"pgr_betweennessCentrality 导致 winnie 崩溃" +msgid "`#2706 `__: winnie crashing on pgr_betweennessCentrality" +msgstr "`#2706 `__ 修复 pgr_betweennessCentrality 导致 winnie 崩溃" msgid "pgRouting 3.7.1 Release Notes" msgstr "pgRouting 3.7.1 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.7.1 `__" -msgstr "" -"查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.7.1版本里程碑关闭列" -"表 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.1 `__" +msgstr "查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.7.1版本里程碑关闭列表 `__" #, fuzzy -msgid "" -"`#2680 `__: fails to " -"compile under mingw64 gcc 13.2" -msgstr "" -"`#2680 `__ 在 mingw64 gcc " -"13.2 下编译失败" +msgid "`#2680 `__: fails to compile under mingw64 gcc 13.2" +msgstr "`#2680 `__ 在 mingw64 gcc 13.2 下编译失败" #, fuzzy -msgid "" -"`#2689 `__: When point " -"is a vertex, the withPoints family do not return results." -msgstr "" -"`#2689 `__ 当 point 是顶点" -"时，withPoints 系列不返回结果。" +msgid "`#2689 `__: When point is a vertex, the withPoints family do not return results." +msgstr "`#2689 `__ 当 point 是顶点时，withPoints 系列不返回结果。" msgid "C/C++ code enhancemet" msgstr "C/C++ 代码优化" @@ -18206,25 +14239,15 @@ msgid "pgRouting 3.7.0 Release Notes" msgstr "pgRouting 3.7.0 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.7.0 `__" -msgstr "" -"查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.7.0版本里程碑关闭列" -"表 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.0 `__" +msgstr "查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.7.0版本里程碑关闭列表 `__" msgid "Support" msgstr "支持" #, fuzzy -msgid "" -"`#2656 `__: Stop support " -"of PostgreSQL12 on pgrouting v3.7" -msgstr "" -"`#2656 `__ 在 pgrouting " -"v3.7 上停止支持 PostgreSQL12" +msgid "`#2656 `__: Stop support of PostgreSQL12 on pgrouting v3.7" +msgstr "`#2656 `__ 在 pgrouting v3.7 上停止支持 PostgreSQL12" msgid "Stopping support of PostgreSQL 12" msgstr "停止支持 PostgreSQL 12" @@ -18236,12 +14259,8 @@ msgid "pgr_betweennessCentrality" msgstr "pgr_betweennessCentrality" #, fuzzy -msgid "" -"`#2605 `__: Standardize " -"spanning tree functions output" -msgstr "" -"`#2605 `__ 标准化生成树函数" -"的输出" +msgid "`#2605 `__: Standardize spanning tree functions output" +msgstr "`#2605 `__ 标准化生成树函数的输出" msgid "Functions:" msgstr "新函数:" @@ -18250,12 +14269,8 @@ msgid "Experimental promoted to proposed." msgstr "实验性提升为提议。" #, fuzzy -msgid "" -"`#2635 `__: " -"pgr_LineGraph ignores directed flag and use negative values for identifiers." -msgstr "" -"`#2635 `__ pgr_LineGraph 忽" -"略了有向标志，并使用负值作为标识符。" +msgid "`#2635 `__: pgr_LineGraph ignores directed flag and use negative values for identifiers." +msgstr "`#2635 `__ pgr_LineGraph 忽略了有向标志，并使用负值作为标识符。" msgid "``pgr_lineGraph``" msgstr "``pgr_lineGraph``" @@ -18264,27 +14279,16 @@ msgid "Code enhancement" msgstr "代码改进" #, fuzzy -msgid "" -"`#2599 `__: Driving " -"distance cleanup" -msgstr "" -"`#2599 `__ 行车距离清理" +msgid "`#2599 `__: Driving distance cleanup" +msgstr "`#2599 `__ 行车距离清理" #, fuzzy -msgid "" -"`#2607 `__: Read " -"postgresql data on C++" -msgstr "" -"`#2607 `__ 在 C++ 上读取 " -"postgresql 数据" +msgid "`#2607 `__: Read postgresql data on C++" +msgstr "`#2607 `__ 在 C++ 上读取 postgresql 数据" #, fuzzy -msgid "" -"`#2614 `__: Clang tidy " -"does not work" -msgstr "" -"`#2614 `__ Clang tidy 不工" -"作" +msgid "`#2614 `__: Clang tidy does not work" +msgstr "`#2614 `__ Clang tidy 不工作" msgid "pgRouting 3.6" msgstr "pgRouting 3.6" @@ -18293,14 +14297,8 @@ msgid "pgRouting 3.6.3 Release Notes" msgstr "pgRouting 3.6.3 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.6.3 `__" -msgstr "" -"查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.6.3版本里程碑关闭列" -"表 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.3 `__" +msgstr "查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.6.3版本里程碑关闭列表 `__" msgid "Explicit minimum requirements:" msgstr "最低要求：" @@ -18329,11 +14327,8 @@ msgstr "CI tests" msgid "Add a clang tidy test on changed files." 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 "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 "文档" @@ -18354,14 +14349,8 @@ msgid "pgRouting 3.6.2 Release Notes" msgstr "pgRouting 3.6.2 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.6.2 `__" -msgstr "" -"要查看此版本关闭的所有问题和拉取请求，请参阅 `Git closed milestone for 3.6.2 " -"`__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.2 `__" +msgstr "要查看此版本关闭的所有问题和拉取请求，请参阅 `Git closed milestone for 3.6.2 `__" msgid "Upgrade fix" msgstr "升级修复" @@ -18385,159 +14374,89 @@ msgid "pgRouting 3.6.1 Release Notes" msgstr "pgRouting 3.6.1 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.6.1 `__" -msgstr "" -"要查看此版本关闭的所有问题和拉取请求，请参阅 `3.6.1Git 关闭里程碑 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.1 `__" +msgstr "要查看此版本关闭的所有问题和拉取请求，请参阅 `3.6.1Git 关闭里程碑 `_" #, fuzzy -msgid "" -"`#2588 `__: pgrouting " -"3.6.0 fails to build on OSX" -msgstr "" -"`#2588 `__ pgrouting 3.6.0 " -"在 OSX 上构建失败" +msgid "`#2588 `__: pgrouting 3.6.0 fails to build on OSX" +msgstr "`#2588 `__ pgrouting 3.6.0 在 OSX 上构建失败" msgid "pgRouting 3.6.0 Release Notes" msgstr "pgRouting 3.6.0 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.6.0 `__" -msgstr "" -"要查看此版本关闭的所有问题和拉取请求，请访问 `Git 3.6.0 里程碑的已关闭问题和" -"拉取请求 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.0 `__" +msgstr "要查看此版本关闭的所有问题和拉取请求，请访问 `Git 3.6.0 里程碑的已关闭问题和拉取请求 `_" #, fuzzy -msgid "" -"`#2516 `__: Standardize " -"output pgr_aStar" -msgstr "" -"`#2516 `__ 标准化输出 " -"pgr_aStar" +msgid "`#2516 `__: Standardize output pgr_aStar" +msgstr "`#2516 `__ 标准化输出 pgr_aStar" msgid "Standardize output columns to |short-generic-result|" msgstr "将输出列标准化为 |short-generic-result|" #, fuzzy -msgid "" -"`#2523 `__: Standardize " -"output pgr_bdAstar" -msgstr "" -"`#2523 `__ 标准化输出 " -"pgr_bdAstar" +msgid "`#2523 `__: Standardize output pgr_bdAstar" +msgstr "`#2523 `__ 标准化输出 pgr_bdAstar" #, fuzzy -msgid "" -"`#2547 `__: Standardize " -"output and modifying signature pgr_KSP" -msgstr "" -"`#2547 `__ 标准化输出和修改" -"签名 pgr_KSP" +msgid "`#2547 `__: Standardize output and modifying signature pgr_KSP" +msgstr "`#2547 `__ 标准化输出和修改签名 pgr_KSP" #, fuzzy -msgid "" -"`#2548 `__: Standardize " -"output pgr_drivingDistance" -msgstr "" -"`#2548 `__ 标准化输出 " -"pgr_drivingDistance" +msgid "`#2548 `__: Standardize output pgr_drivingDistance" +msgstr "`#2548 `__ 标准化输出 pgr_drivingDistance" msgid "Proposed functions changes" msgstr "提议函数改变" #, fuzzy -msgid "" -"`#2544 `__: Standardize " -"output and modifying signature pgr_withPointsDD" -msgstr "" -"`#2544 `__ 标准化输出和修改" -"签名 pgr_withPointsDD" +msgid "`#2544 `__: Standardize output and modifying signature pgr_withPointsDD" +msgstr "`#2544 `__ 标准化输出和修改签名 pgr_withPointsDD" #, fuzzy -msgid "" -"`#2546 `__: Standardize " -"output and modifying signature pgr_withPointsKSP" -msgstr "" -"`#2546 `__ 标准化输出和修改" -"签名 pgr_withPointsKSP" +msgid "`#2546 `__: Standardize output and modifying signature pgr_withPointsKSP" +msgstr "`#2546 `__ 标准化输出和修改签名 pgr_withPointsKSP" #, fuzzy -msgid "" -"`#2504 `__: To C++ pg " -"data get, fetch and check." -msgstr "" -"`#2504 `__ 获取、提取和检查" -"C++ pg数据。" +msgid "`#2504 `__: To C++ pg data get, fetch and check." +msgstr "`#2504 `__ 获取、提取和检查C++ pg数据。" msgid "Stopping support for compilation with MSVC." msgstr "停止支持使用 MSVC 进行编译。" #, fuzzy -msgid "" -"`#2505 `__: Using " -"namespace." -msgstr "" -"`#2505 `__ 使用命名空间。" +msgid "`#2505 `__: Using namespace." +msgstr "`#2505 `__ 使用命名空间。" #, fuzzy -msgid "" -"`#2512 `__: [Dijkstra] " -"Removing duplicate code on Dijkstra." -msgstr "" -"`#2512 `__ [Dijkstra] 删除 " -"Dijkstra 上的重复代码。" +msgid "`#2512 `__: [Dijkstra] Removing duplicate code on Dijkstra." +msgstr "`#2512 `__ [Dijkstra] 删除 Dijkstra 上的重复代码。" #, fuzzy -msgid "" -"`#2517 `__: Astar code " -"simplification." -msgstr "" -"`#2517 `__ Astar 代码简化。" +msgid "`#2517 `__: Astar code simplification." +msgstr "`#2517 `__ Astar 代码简化。" #, fuzzy -msgid "" -"`#2521 `__: Dijkstra " -"code simplification." -msgstr "" -"`#2521 `__ Dijkstra 代码简" -"化。" +msgid "`#2521 `__: Dijkstra code simplification." +msgstr "`#2521 `__ Dijkstra 代码简化。" #, fuzzy -msgid "" -"`#2522 `__: bdAstar code " -"simplification." -msgstr "" -"`#2522 `__ bdAstar 代码简" -"化。" +msgid "`#2522 `__: bdAstar code simplification." +msgstr "`#2522 `__ bdAstar 代码简化。" #, fuzzy -msgid "" -"`#2490 `__: Automatic " -"page history links." -msgstr "" -"`#2490 `__ 自动页面历史链" -"接。" +msgid "`#2490 `__: Automatic page history links." +msgstr "`#2490 `__ 自动页面历史链接。" msgid "..rubric:: Standardize SQL" msgstr "..rubric:: 标准化 SQL" #, fuzzy -msgid "" -"`#2555 `__: Standardize " -"deprecated messages" -msgstr "" -"`#2555 `__ 过时信息标准化" +msgid "`#2555 `__: Standardize deprecated messages" +msgstr "`#2555 `__ 过时信息标准化" -msgid "" -"On new internal function: do not use named parameters and default parameters." +msgid "On new internal function: do not use named parameters and default parameters." msgstr "新内部函数：不使用命名参数和默认参数。" msgid "pgRouting 3.5" @@ -18547,14 +14466,8 @@ msgid "pgRouting 3.5.1 Release Notes" msgstr "pgRouting 3.5.1 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.5.1 `__" -msgstr "" -"要查看此版本关闭的所有问题和拉取请求，请参阅 `3.5.1 Git 关闭里程碑 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.5.1 `__" +msgstr "要查看此版本关闭的所有问题和拉取请求，请参阅 `3.5.1 Git 关闭里程碑 `_" msgid "Documentation fixes" msgstr "文档修复" @@ -18578,31 +14491,19 @@ msgid "Issue fixes" msgstr "问题修复" #, fuzzy -msgid "" -"`#2565 `__: " -"pgr_lengauerTarjanDominatorTree triggers an assertion" -msgstr "" -"`#2565 `__ " -"pgr_lengauerTarjanDominatorTree 触发了一个断言" +msgid "`#2565 `__: pgr_lengauerTarjanDominatorTree triggers an assertion" +msgstr "`#2565 `__ pgr_lengauerTarjanDominatorTree 触发了一个断言" msgid "SQL enhancements" msgstr "SQL 增强功能" #, fuzzy -msgid "" -"`#2561 `__: Not use " -"wildcards on SQL" -msgstr "" -"`#2561 `__ 在 SQL 中不使" -"用通配符" +msgid "`#2561 `__: Not use wildcards on SQL" +msgstr "`#2561 `__ 在 SQL 中不使用通配符" #, fuzzy -msgid "" -"`#2559 `__: pgtap test " -"using sampledata" -msgstr "" -"`#2559 `__ pgtap 测试使" -"用 示例数据" +msgid "`#2559 `__: pgtap test using sampledata" +msgstr "`#2559 `__ pgtap 测试使用 示例数据" msgid "Build fixes" msgstr "构建修复" @@ -18620,14 +14521,8 @@ msgid "pgRouting 3.5.0 Release Notes" msgstr "pgRouting 3.5.0 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.5.0 `__" -msgstr "" -"要查看此版本关闭的所有问题和拉取请求，请参阅 `3.5.0 Git 关闭里程碑 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.5.0 `__" +msgstr "要查看此版本关闭的所有问题和拉取请求，请参阅 `3.5.0 Git 关闭里程碑 `_" msgid "Dijkstra" msgstr "Dijkstra" @@ -18639,76 +14534,37 @@ msgid "pgRouting 3.4.2 Release Notes" msgstr "pgRouting 3.4.2 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.4.2 `__" -msgstr "" -"要查看此版本关闭的所有问题和拉取请求，请参阅 `3.4.2Git 关闭里程碑 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.4.2 `__" +msgstr "要查看此版本关闭的所有问题和拉取请求，请参阅 `3.4.2Git 关闭里程碑 `_" -msgid "" -"`#2394 `__: pgr_bdAstar " -"accumulates heuristic cost in visited node cost." -msgstr "" -"`#2394 `__: pgr_bdAstar " -"在访问的节点成本中累积了启发式成本。" +msgid "`#2394 `__: pgr_bdAstar accumulates heuristic cost in visited node cost." +msgstr "`#2394 `__: pgr_bdAstar 在访问的节点成本中累积了启发式成本。" -msgid "" -"`#2427 `__: " -"pgr_createVerticesTable & pgr_createTopology, variable should be of type " -"Record." -msgstr "" -"`#2427 `__: " -"pgr_createVerticesTable & pgr_createTopology，变量应为 Record 类型。" +msgid "`#2427 `__: pgr_createVerticesTable & pgr_createTopology, variable should be of type Record." +msgstr "`#2427 `__: pgr_createVerticesTable & pgr_createTopology，变量应为 Record 类型。" msgid "pgRouting 3.4.1 Release Notes" msgstr "pgRouting 3.4.1 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.4.1 `__" -msgstr "" -"要查看此版本关闭的所有问题和拉取请求，请参阅 `3.4.1Git 关闭里程碑 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.4.1 `__" +msgstr "要查看此版本关闭的所有问题和拉取请求，请参阅 `3.4.1Git 关闭里程碑 `_" -msgid "" -"`#2401 `__: pgRouting " -"3.4.0 do not build docs when sphinx is too low or missing" -msgstr "" -"`#2401 `__: pgRouting " -"3.4.0 在 sphinx 过低或丢失时不构建文档" +msgid "`#2401 `__: pgRouting 3.4.0 do not build docs when sphinx is too low or missing" +msgstr "`#2401 `__: pgRouting 3.4.0 在 sphinx 过低或丢失时不构建文档" -msgid "" -"`#2398 `__: v3.4.0 does " -"not upgrade from 3.3.3" -msgstr "" -"`#2398 `__: v3.4.0 不能" -"从 3.3.3 升级" +msgid "`#2398 `__: v3.4.0 does not upgrade from 3.3.3" +msgstr "`#2398 `__: v3.4.0 不能从 3.3.3 升级" msgid "pgRouting 3.4.0 Release Notes" msgstr "pgRouting 3.4.0 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.4.0 `__" -msgstr "" -"要查看此版本关闭的所有问题和拉取请求，请参阅 `3.4.0 Git 关闭里程碑 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.4.0 `__" +msgstr "要查看此版本关闭的所有问题和拉取请求，请参阅 `3.4.0 Git 关闭里程碑 `_" -msgid "" -"`#1891 `__: pgr_ksp " -"doesn't give all correct shortest path" -msgstr "" -"`#1891 `__: pgr_ksp 没有" -"给出所有正确的最短路径" +msgid "`#1891 `__: pgr_ksp doesn't give all correct shortest path" +msgstr "`#1891 `__: pgr_ksp 没有给出所有正确的最短路径" msgid "New proposed functions." msgstr "新提议函数。" @@ -18789,65 +14645,35 @@ msgid "pgRouting 3.3.5 Release Notes" msgstr "pgRouting 3.3.5 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.5 `__" -msgstr "" -"要查看此版本关闭的所有问题和拉取请求，请参阅 `3.3.4Git 关闭里程碑 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.5 `__" +msgstr "要查看此版本关闭的所有问题和拉取请求，请参阅 `3.3.4Git 关闭里程碑 `_" msgid "pgRouting 3.3.4 Release Notes" msgstr "pgRouting 3.3.4 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.4 `__" -msgstr "" -"要查看此版本关闭的所有问题和拉取请求，请参阅 `3.3.4Git 关闭里程碑 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.4 `__" +msgstr "要查看此版本关闭的所有问题和拉取请求，请参阅 `3.3.4Git 关闭里程碑 `_" -msgid "" -"`#2400 `__: pgRouting " -"3.3.3 does not build in focal" -msgstr "" -"`#2400 `__: pgRouting " -"3.3.3 在 Focal 上无法构建" +msgid "`#2400 `__: pgRouting 3.3.3 does not build in focal" +msgstr "`#2400 `__: pgRouting 3.3.3 在 Focal 上无法构建" msgid "pgRouting 3.3.3 Release Notes" msgstr "pgRouting 3.3.3 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.3 `__" -msgstr "" -"要查看此版本关闭的所有问题和拉取请求，请参阅 `3.3.3Git 关闭里程碑 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.3 `__" +msgstr "要查看此版本关闭的所有问题和拉取请求，请参阅 `3.3.3Git 关闭里程碑 `_" -msgid "" -"Ignoring optional boolean parameter, as the algorithm works only for " -"undirected graphs." +msgid "Ignoring optional boolean parameter, as the algorithm works only for undirected graphs." msgstr "忽略可选的布尔参数，因为该算法只适用于无向图。" msgid "pgRouting 3.3.2 Release Notes" msgstr "pgRouting 3.3.2 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.2 `__" -msgstr "" -"要查看此版本关闭的所有问题和拉取请求，请参阅 `3.3.2Git 关闭里程碑 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.2 `__" +msgstr "要查看此版本关闭的所有问题和拉取请求，请参阅 `3.3.2Git 关闭里程碑 `_" msgid "Revised documentation" msgstr "修订文档" @@ -18879,101 +14705,49 @@ msgstr "使用 ``pgr_extractVertices`` 创建路由拓扑" msgid "Restructure of the pgRouting concepts page." msgstr "pgRouting概念页面的重构。" -msgid "" -"`#2276 `__: " -"edgeDisjointPaths issues with start_vid and combinations" -msgstr "" -"`#2276 `__: " -"edgeDisjointPaths 与 start_vid 和组合的问题" +msgid "`#2276 `__: edgeDisjointPaths issues with start_vid and combinations" +msgstr "`#2276 `__: edgeDisjointPaths 与 start_vid 和组合的问题" -msgid "" -"`#2312 `__: " -"pgr_extractVertices error when target is not BIGINT" -msgstr "" -"`#2312 `__: 当目标不是 " -"BIGINT 时 pgr_extractVertices 错误" +msgid "`#2312 `__: pgr_extractVertices error when target is not BIGINT" +msgstr "`#2312 `__: 当目标不是 BIGINT 时 pgr_extractVertices 错误" -msgid "" -"`#2357 `__: Apply clang-" -"tidy performance-*" -msgstr "" -"`#2357 `__: 应用 clang-" -"tidy performance-*" +msgid "`#2357 `__: Apply clang-tidy performance-*" +msgstr "`#2357 `__: 应用 clang-tidy performance-*" msgid "pgRouting 3.3.1 Release Notes" msgstr "pgRouting 3.3.1 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.1 `__" -msgstr "" -"查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.7.1版本里程碑关闭列" -"表 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.1 `__" +msgstr "查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.7.1版本里程碑关闭列表 `__" -msgid "" -"`#2216 `__: Warnings " -"when using clang" -msgstr "" -"`#2216 `__: 使用 clang 时" -"发出警告" +msgid "`#2216 `__: Warnings when using clang" +msgstr "`#2216 `__: 使用 clang 时发出警告" -msgid "" -"`#2266 `__: Error " -"processing restrictions" -msgstr "" -"`#2266 `__: 处理限制时出" -"错" +msgid "`#2266 `__: Error processing restrictions" +msgstr "`#2266 `__: 处理限制时出错" msgid "pgRouting 3.3.0 Release Notes" msgstr "pgRouting 3.3.0 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.3.0 `__" -msgstr "" -"查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.8.0版本里程碑关闭列" -"表 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.0 `__" +msgstr "查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.8.0版本里程碑关闭列表 `__" -msgid "" -"`#2057 `__: trspViaEdges " -"columns in different order" -msgstr "" -"`#2057 `__: trspViaEdges " -"列的顺序不同" +msgid "`#2057 `__: trspViaEdges columns in different order" +msgstr "`#2057 `__: trspViaEdges 列的顺序不同" -msgid "" -"`#2087 `__: " -"pgr_extractVertices to proposed" -msgstr "" -"`#2087 `__: " -"pgr_extractVertices 变为提议状态" +msgid "`#2087 `__: pgr_extractVertices to proposed" +msgstr "`#2087 `__: pgr_extractVertices 变为提议状态" -msgid "" -"`#2201 `__: " -"pgr_depthFirstSearch to proposed" -msgstr "" -"`#2201 `__: " -"pgr_depthFirstSearch 变为提议状态" +msgid "`#2201 `__: pgr_depthFirstSearch to proposed" +msgstr "`#2201 `__: pgr_depthFirstSearch 变为提议状态" -msgid "" -"`#2202 `__: " -"pgr_sequentialVertexColoring to proposed" -msgstr "" -"`#2202 `__: " -"pgr_sequentialVertexColoring 变为提议状态" +msgid "`#2202 `__: pgr_sequentialVertexColoring to proposed" +msgstr "`#2202 `__: pgr_sequentialVertexColoring 变为提议状态" -msgid "" -"`#2203 `__: " -"pgr_dijkstraNear and pgr_dijkstraNearCost to proposed" -msgstr "" -"`#2203 `__: " -"pgr_dijkstraNear 和 pgr_dijkstraNearCost 变为提议状态" +msgid "`#2203 `__: pgr_dijkstraNear and pgr_dijkstraNearCost to proposed" +msgstr "`#2203 `__: pgr_dijkstraNear 和 pgr_dijkstraNearCost 变为提议状态" msgid "Coloring" msgstr "着色" @@ -19024,55 +14798,29 @@ msgid "pgRouting 3.2.2 Release Notes" msgstr "pgRouting 3.2.2 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.2.2 `__" -msgstr "" -"查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.7.2版本里程碑关闭列" -"表 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.2.2 `__" +msgstr "查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.7.2版本里程碑关闭列表 `__" -msgid "" -"`#2093 `__: Compilation " -"on Visual Studio" -msgstr "" -"`#2093 `__: 在 Visual " -"Studio 上编译" +msgid "`#2093 `__: Compilation on Visual Studio" +msgstr "`#2093 `__: 在 Visual Studio 上编译" -msgid "" -"`#2189 `__: Build error " -"on RHEL 7" -msgstr "" -"`#2189 `__: RHEL 7 上的构" -"建错误" +msgid "`#2189 `__: Build error on RHEL 7" +msgstr "`#2189 `__: RHEL 7 上的构建错误" msgid "pgRouting 3.2.1 Release Notes" msgstr "pgRouting 3.2.1 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.2.1 `__" -msgstr "" -"查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.7.1版本里程碑关闭列" -"表 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.2.1 `__" +msgstr "查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.7.1版本里程碑关闭列表 `__" -msgid "" -"`#1883 `__: " -"pgr_TSPEuclidean crashes connection on Windows" -msgstr "" -"`#1883 `__:" -"pgr_TSPEuclidean 在 Windows 上导致连接崩溃" +msgid "`#1883 `__: pgr_TSPEuclidean crashes connection on Windows" +msgstr "`#1883 `__:pgr_TSPEuclidean 在 Windows 上导致连接崩溃" msgid "The solution is to use Boost::graph::metric_tsp_approx" msgstr "解决方案是使用 Boost::graph::metric_tsp_approx" -msgid "" -"To not break user's code the optional parameters related to the TSP " -"Annaeling are ignored" +msgid "To not break user's code the optional parameters related to the TSP Annaeling are ignored" msgstr "为避免破坏用户代码，与 TSP Annaeling 有关的可选参数将被忽略" msgid "The function with the annaeling optional parameters is deprecated" @@ -19082,21 +14830,11 @@ msgid "pgRouting 3.2.0 Release Notes" msgstr "pgRouting 3.2.0 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.2.0 `__" -msgstr "" -"查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.8.0版本里程碑关闭列" -"表 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.2.0 `__" +msgstr "查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.8.0版本里程碑关闭列表 `__" -msgid "" -"`#1850 `__: Change Boost " -"min version to 1.56" -msgstr "" -"`#1850 `__: 将 Boost 最低" -"版本更改为 1.56" +msgid "`#1850 `__: Change Boost min version to 1.56" +msgstr "`#1850 `__: 将 Boost 最低版本更改为 1.56" msgid "Removing support for Boost v1.53, v1.54 & v1.55" msgstr "删除对 Boost v1.53、v1.54 和 v1.55 的支持" @@ -19129,14 +14867,8 @@ msgid "pgRouting 3.1.4 Release Notes" msgstr "pgRouting 3.1.4 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.1.4 `__" -msgstr "" -"要查看此版本关闭的所有问题和拉取请求，请参阅 `3.3.4Git 关闭里程碑 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.4 `__" +msgstr "要查看此版本关闭的所有问题和拉取请求，请参阅 `3.3.4Git 关闭里程碑 `_" msgid "Issues fixes" msgstr "问题修复" @@ -19145,144 +14877,68 @@ msgid "pgRouting 3.1.3 Release Notes" msgstr "pgRouting 3.1.3 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.1.3 `__" -msgstr "" -"要查看此版本关闭的所有问题和拉取请求，请参阅 `Git closed milestone for 3.7.3 " -"`__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.3 `__" +msgstr "要查看此版本关闭的所有问题和拉取请求，请参阅 `Git closed milestone for 3.7.3 `__" -msgid "" -"`#1825 `__: Boost " -"versions are not honored" -msgstr "" -"`#1825 `__: Boost 版本不" -"受支持" +msgid "`#1825 `__: Boost versions are not honored" +msgstr "`#1825 `__: Boost 版本不受支持" -msgid "" -"`#1849 `__: Boost 1.75.0 " -"geometry \"point_xy.hpp\" build error on macOS environment" -msgstr "" -"`#1849 `__: macOS 环境中" -"的 Boost 1.75.0 几何“point_xy.hpp”构建错误" +msgid "`#1849 `__: Boost 1.75.0 geometry \"point_xy.hpp\" build error on macOS environment" +msgstr "`#1849 `__: macOS 环境中的 Boost 1.75.0 几何“point_xy.hpp”构建错误" -msgid "" -"`#1861 `__: vrp " -"functions crash server" -msgstr "" -"`#1861 `__: vrp功能使服务" -"器崩溃" +msgid "`#1861 `__: vrp functions crash server" +msgstr "`#1861 `__: vrp功能使服务器崩溃" msgid "pgRouting 3.1.2 Release Notes" msgstr "pgRouting 3.1.2 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.1.2 `__" -msgstr "" -"查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.7.2版本里程碑关闭列" -"表 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.2 `__" +msgstr "查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.7.2版本里程碑关闭列表 `__" -msgid "" -"`#1304 `__: FreeBSD 12 " -"64-bit crashes on pgr_vrOneDepot tests Experimental Function" -msgstr "" -"`#1304 `__: FreeBSD 12 " -"64 位在 pgr_vrOneDepot 测试实验函数中崩溃" +msgid "`#1304 `__: FreeBSD 12 64-bit crashes on pgr_vrOneDepot tests Experimental Function" +msgstr "`#1304 `__: FreeBSD 12 64 位在 pgr_vrOneDepot 测试实验函数中崩溃" -msgid "" -"`#1356 `__: tools/" -"testers/pg_prove_tests.sh fails when PostgreSQL port is not passed" -msgstr "" -"`#1356 `__: tools/" -"testers/pg_prove_tests.sh 在未传递 PostgreSQL 端口时失败" +msgid "`#1356 `__: tools/testers/pg_prove_tests.sh fails when PostgreSQL port is not passed" +msgstr "`#1356 `__: tools/testers/pg_prove_tests.sh 在未传递 PostgreSQL 端口时失败" -msgid "" -"`#1725 `__: Server crash " -"on pgr_pickDeliver and pgr_vrpOneDepot on openbsd" -msgstr "" -"`#1725 `__: openbsd上的" -"pgr_pickDeliver和pgr_vrpOneDepot服务器崩溃" +msgid "`#1725 `__: Server crash on pgr_pickDeliver and pgr_vrpOneDepot on openbsd" +msgstr "`#1725 `__: openbsd上的pgr_pickDeliver和pgr_vrpOneDepot服务器崩溃" -msgid "" -"`#1760 `__: TSP server " -"crash on ubuntu 20.04 #1760" -msgstr "" -"`#1760 `__: TSP 服务器在 " -"ubuntu 20.04 上崩溃 #1760" +msgid "`#1760 `__: TSP server crash on ubuntu 20.04 #1760" +msgstr "`#1760 `__: TSP 服务器在 ubuntu 20.04 上崩溃 #1760" -msgid "" -"`#1770 `__: Remove " -"warnings when using clang compiler" -msgstr "" -"`#1770 `__: 删除使用 " -"clang 编译器时的警告" +msgid "`#1770 `__: Remove warnings when using clang compiler" +msgstr "`#1770 `__: 删除使用 clang 编译器时的警告" msgid "pgRouting 3.1.1 Release Notes" msgstr "pgRouting 3.1.1 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.1.1 `__" -msgstr "" -"查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.7.1版本里程碑关闭列" -"表 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.1 `__" +msgstr "查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.7.1版本里程碑关闭列表 `__" -msgid "" -"`#1733 `__: pgr_bdAstar " -"fails when source or target vertex does not exist in the graph" -msgstr "" -"`#1733 `__: 当图中不存在" -"源顶点或目标顶点时，pgr_bdAstar 失败" +msgid "`#1733 `__: pgr_bdAstar fails when source or target vertex does not exist in the graph" +msgstr "`#1733 `__: 当图中不存在源顶点或目标顶点时，pgr_bdAstar 失败" -msgid "" -"`#1647 `__: Linear " -"Contraction contracts self loops" -msgstr "" -"`#1647 `__: 线性收缩收缩" -"自循环" +msgid "`#1647 `__: Linear Contraction contracts self loops" +msgstr "`#1647 `__: 线性收缩收缩自循环" -msgid "" -"`#1640 `__: " -"pgr_withPoints fails when points_sql is empty" -msgstr "" -"`#1640 `__: " -"pgr_withPoints 在 points_sql 为空时失败" +msgid "`#1640 `__: pgr_withPoints fails when points_sql is empty" +msgstr "`#1640 `__: pgr_withPoints 在 points_sql 为空时失败" -msgid "" -"`#1616 `__: Path " -"evaluation on C++ not updated before the results go back to C" -msgstr "" -"`#1616 `__: C++ 上的路径" -"评估在结果返回 C 之前没有更新" +msgid "`#1616 `__: Path evaluation on C++ not updated before the results go back to C" +msgstr "`#1616 `__: C++ 上的路径评估在结果返回 C 之前没有更新" -msgid "" -"`#1300 `__: " -"pgr_chinesePostman crash on test data" -msgstr "" -"`#1300 `__:" -"pgr_chinesePostman 在测试数据上崩溃" +msgid "`#1300 `__: pgr_chinesePostman crash on test data" +msgstr "`#1300 `__:pgr_chinesePostman 在测试数据上崩溃" msgid "pgRouting 3.1.0 Release Notes" msgstr "pgRouting 3.1.0 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.1.0 `__" -msgstr "" -"查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.8.0版本里程碑关闭列" -"表 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.0 `__" +msgstr "查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.8.0版本里程碑关闭列表 `__" msgid "pgr_dijkstra(combinations)" msgstr "pgr_dijkstra(组合)" @@ -19302,28 +14958,16 @@ msgstr "pgRouting 3.0" msgid "pgRouting 3.0.6 Release Notes" msgstr "pgRouting 3.0.6 发布说明" -#, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.6 `__" -msgstr "" -"查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.8.0版本里程碑关闭列" -"表 `__" +#, fuzzy +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.6 `__" +msgstr "查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.8.0版本里程碑关闭列表 `__" msgid "pgRouting 3.0.5 Release Notes" msgstr "pgRouting 3.0.5 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.5 `__" -msgstr "" -"查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.8.0版本里程碑关闭列" -"表 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.5 `__" +msgstr "查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.8.0版本里程碑关闭列表 `__" msgid "Backport issue fixes" msgstr "回溯问题修复" @@ -19332,123 +14976,63 @@ msgid "pgRouting 3.0.4 Release Notes" msgstr "pgRouting 3.0.4 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.4 `__" -msgstr "" -"要查看此版本关闭的所有问题和拉取请求，请参阅 `3.3.4Git 关闭里程碑 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.4 `__" +msgstr "要查看此版本关闭的所有问题和拉取请求，请参阅 `3.3.4Git 关闭里程碑 `_" msgid "pgRouting 3.0.3 Release Notes" msgstr "pgRouting 3.0.3 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.3 `__" -msgstr "" -"要查看此版本关闭的所有问题和拉取请求，请参阅 `Git closed milestone for 3.7.3 " -"`__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.3 `__" +msgstr "要查看此版本关闭的所有问题和拉取请求，请参阅 `Git closed milestone for 3.7.3 `__" msgid "pgRouting 3.0.2 Release Notes" msgstr "pgRouting 3.0.2 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.2 `__" -msgstr "" -"查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.7.2版本里程碑关闭列" -"表 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.2 `__" +msgstr "查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.7.2版本里程碑关闭列表 `__" -msgid "" -"`#1378 `__: Visual " -"Studio build failing" -msgstr "" -"`#1378 `__: Visual " -"Studio 构建失败" +msgid "`#1378 `__: Visual Studio build failing" +msgstr "`#1378 `__: Visual Studio 构建失败" msgid "pgRouting 3.0.1 Release Notes" msgstr "pgRouting 3.0.1 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.1 `__" -msgstr "" -"查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.7.1版本里程碑关闭列" -"表 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.1 `__" +msgstr "查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.7.1版本里程碑关闭列表 `__" -msgid "" -"`#232 `__: Honor client " -"cancel requests in C /C++ code" -msgstr "" -"`#232 `__: 在 C /C++ 代码" -"中尊重客户端取消请求" +msgid "`#232 `__: Honor client cancel requests in C /C++ code" +msgstr "`#232 `__: 在 C /C++ 代码中尊重客户端取消请求" msgid "pgRouting 3.0.0 Release Notes" msgstr "pgRouting 3.0.0 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 3.0.0 `__" -msgstr "" -"查看本版本已关闭的所有议题和拉取请求,请访问： `GitHub 4.0.0版本里程碑关闭列" -"表 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.0 `__" +msgstr "查看本版本已关闭的所有议题和拉取请求,请访问： `GitHub 4.0.0版本里程碑关闭列表 `__" msgid "Fixed Issues" msgstr "问题修复" -msgid "" -"`#1153 `__: Renamed " -"pgr_eucledianTSP to pgr_TSPeuclidean" -msgstr "" -"`#1153 `__: 将 " -"pgr_eucledianTSP 更名为 pgr_TSPeuclidean" +msgid "`#1153 `__: Renamed pgr_eucledianTSP to pgr_TSPeuclidean" +msgstr "`#1153 `__: 将 pgr_eucledianTSP 更名为 pgr_TSPeuclidean" -msgid "" -"`#1188 `__: Removed CGAL " -"dependency" -msgstr "" -"`#1188 `__: 删除了 CGAL " -"依赖" +msgid "`#1188 `__: Removed CGAL dependency" +msgstr "`#1188 `__: 删除了 CGAL 依赖" -msgid "" -"`#1002 `__: Fixed " -"contraction issues:" -msgstr "" -"`#1002 `__: 修复收缩问" -"题：" +msgid "`#1002 `__: Fixed contraction issues:" +msgstr "`#1002 `__: 修复收缩问题：" -msgid "" -"`#1004 `__: Contracts " -"when forbidden vertices do not belong to graph" -msgstr "" -"`#1004 `__: 当禁止的顶点" -"不属于图时的收缩" +msgid "`#1004 `__: Contracts when forbidden vertices do not belong to graph" +msgstr "`#1004 `__: 当禁止的顶点不属于图时的收缩" -msgid "" -"`#1005 `__: Intermideate " -"results eliminated" -msgstr "" -"`#1005 `__: 消除中间结果" +msgid "`#1005 `__: Intermideate results eliminated" +msgstr "`#1005 `__: 消除中间结果" -msgid "" -"`#1006 `__: No loss of " -"information" -msgstr "" -"`#1006 `__: 无信息丢失" +msgid "`#1006 `__: No loss of information" +msgstr "`#1006 `__: 无信息丢失" msgid "New Functions" msgstr "新函数" @@ -19703,88 +15287,46 @@ msgid "pgRouting 2.6.3 Release Notes" msgstr "pgRouting 2.6.3 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.6.3 `__" -msgstr "" -"查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.6.3版本里程碑关闭列" -"表 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.3 `__" +msgstr "查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.6.3版本里程碑关闭列表 `__" #, fuzzy -msgid "" -"`#1219 `__: Implicit " -"cast for via_path integer to text" -msgstr "" -"`#1219 `__ via_path 整数到" -"文本的隐式转换" +msgid "`#1219 `__: Implicit cast for via_path integer to text" +msgstr "`#1219 `__ via_path 整数到文本的隐式转换" #, fuzzy -msgid "" -"`#1193 `__: Fixed " -"pgr_pointsAsPolygon breaking when comparing strings in WHERE clause" -msgstr "" -"`#1193 `__ 修复了比较 " -"WHERE 子句中的字符串时 pgr_pointsAsPolygon 中断的问题" +msgid "`#1193 `__: Fixed pgr_pointsAsPolygon breaking when comparing strings in WHERE clause" +msgstr "`#1193 `__ 修复了比较 WHERE 子句中的字符串时 pgr_pointsAsPolygon 中断的问题" #, fuzzy -msgid "" -"`#1185 `__: Improve " -"FindPostgreSQL.cmake" -msgstr "" -"`#1185 `__ 改进 " -"FindPostgreSQL.cmake" +msgid "`#1185 `__: Improve FindPostgreSQL.cmake" +msgstr "`#1185 `__ 改进 FindPostgreSQL.cmake" msgid "pgRouting 2.6.2 Release Notes" msgstr "pgRouting 2.6.2 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.6.2 `__" -msgstr "" -"要查看此版本关闭的所有问题和拉取请求，请参阅 `Git closed milestone for 3.6.2 " -"`__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.2 `__" +msgstr "要查看此版本关闭的所有问题和拉取请求，请参阅 `Git closed milestone for 3.6.2 `__" #, fuzzy -msgid "" -"`#1152 `__: Fixes " -"driving distance when vertex is not part of the graph" -msgstr "" -"`#1152 `__ 修复了顶点不属" -"于图时的行驶距离问题" +msgid "`#1152 `__: Fixes driving distance when vertex is not part of the graph" +msgstr "`#1152 `__ 修复了顶点不属于图时的行驶距离问题" #, fuzzy -msgid "" -"`#1098 `__: Fixes " -"windows test" -msgstr "" -"`#1098 `__ 修复 Windows " -"测试" +msgid "`#1098 `__: Fixes windows test" +msgstr "`#1098 `__ 修复 Windows 测试" #, fuzzy -msgid "" -"`#1165 `__: Fixes build " -"for python3 and perl5" -msgstr "" -"`#1165 `__ 修复了 " -"python3 和 perl5 的构建问题" +msgid "`#1165 `__: Fixes build for python3 and perl5" +msgstr "`#1165 `__ 修复了 python3 和 perl5 的构建问题" msgid "pgRouting 2.6.1 Release Notes" msgstr "pgRouting 2.6.1 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.6.1 `__" -msgstr "" -"要查看此版本关闭的所有问题和拉取请求，请参阅 `3.6.1Git 关闭里程碑 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.1 `__" +msgstr "要查看此版本关闭的所有问题和拉取请求，请参阅 `3.6.1Git 关闭里程碑 `_" msgid "Fixes server crash on several functions." msgstr "修复了多个函数导致服务器崩溃的问题。" @@ -19865,24 +15407,14 @@ msgid "pgRouting 2.6.0 Release Notes" msgstr "pgRouting 2.6.0 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.6.0 `__" -msgstr "" -"要查看此版本关闭的所有问题和拉取请求，请访问 `Git 3.6.0 里程碑的已关闭问题和" -"拉取请求 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.0 `__" +msgstr "要查看此版本关闭的所有问题和拉取请求，请访问 `Git 3.6.0 里程碑的已关闭问题和拉取请求 `_" msgid "pgr_lineGraphFull" msgstr "pgr_lineGraphFull" -msgid "" -"Fix 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 "Fix 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 "without restrictions" msgstr "无限制" @@ -19902,9 +15434,7 @@ msgstr "调用原始 TRSP 代码" msgid "Internal code" msgstr "内部代码" -msgid "" -"Cleaned the internal code of trsp(text,integer,integer,boolean,boolean [, " -"text])" +msgid "Cleaned the internal code of trsp(text,integer,integer,boolean,boolean [, text])" msgstr "清除了 trsp(text,integer,integer,boolean,boolean [, text]) 的内部代码" msgid "Removed the use of pointers" @@ -19923,14 +15453,8 @@ msgid "pgRouting 2.5.5 Release Notes" msgstr "pgRouting 2.5.5 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.5 `__" -msgstr "" -"要查看此版本关闭的所有问题和拉取请求，请参阅 `3.5.1 Git 关闭里程碑 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.5 `__" +msgstr "要查看此版本关闭的所有问题和拉取请求，请参阅 `3.5.1 Git 关闭里程碑 `_" msgid "Fixes driving distance when vertex is not part of the graph" msgstr "修复顶点不在图中时的行驶距离问题" @@ -19945,45 +15469,25 @@ msgid "pgRouting 2.5.4 Release Notes" msgstr "pgRouting 2.5.4 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.4 `__" -msgstr "" -"要查看此版本关闭的所有问题和拉取请求，请参阅 `3.3.4Git 关闭里程碑 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.4 `__" +msgstr "要查看此版本关闭的所有问题和拉取请求，请参阅 `3.3.4Git 关闭里程碑 `_" msgid "pgRouting 2.5.3 Release Notes" msgstr "pgRouting 2.5.3 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.3 `__" -msgstr "" -"要查看此版本关闭的所有问题和拉取请求，请参阅 `Git closed milestone for 3.7.3 " -"`__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.3 `__" +msgstr "要查看此版本关闭的所有问题和拉取请求，请参阅 `Git closed milestone for 3.7.3 `__" -msgid "" -"Fix for postgresql 11: Removed a compilation error when compiling with " -"postgreSQL" +msgid "Fix for postgresql 11: Removed a compilation error when compiling with postgreSQL" msgstr "postgresql 11 的修复：删除了与 postgreSQL 一起编译时出现的编译错误" msgid "pgRouting 2.5.2 Release Notes" msgstr "pgRouting 2.5.2 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.2 `__" -msgstr "" -"查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.7.2版本里程碑关闭列" -"表 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.2 `__" +msgstr "查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.7.2版本里程碑关闭列表 `__" msgid "Fix for postgresql 10.1: Removed a compiler condition" msgstr "postgresql 10.1 的修复：删除了一个编译器条件" @@ -19992,14 +15496,8 @@ msgid "pgRouting 2.5.1 Release Notes" msgstr "pgRouting 2.5.1 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.1 `__" -msgstr "" -"要查看此版本关闭的所有问题和拉取请求，请参阅 `3.5.1 Git 关闭里程碑 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.1 `__" +msgstr "要查看此版本关闭的所有问题和拉取请求，请参阅 `3.5.1 Git 关闭里程碑 `_" msgid "Fixed prerequisite minimum version of: cmake" msgstr "修正了 cmake 的最低版本要求" @@ -20008,14 +15506,8 @@ msgid "pgRouting 2.5.0 Release Notes" msgstr "pgRouting 2.5.0 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.5.0 `__" -msgstr "" -"要查看此版本关闭的所有问题和拉取请求，请参阅 `3.5.0 Git 关闭里程碑 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.0 `__" +msgstr "要查看此版本关闭的所有问题和拉取请求，请参阅 `3.5.0 Git 关闭里程碑 `_" msgid "enhancement:" msgstr "增强：" @@ -20078,14 +15570,8 @@ msgid "pgRouting 2.4.2 Release Notes" msgstr "pgRouting 2.4.2 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.4.2 `__" -msgstr "" -"要查看此版本关闭的所有问题和拉取请求，请参阅 `3.4.2Git 关闭里程碑 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.4.2 `__" +msgstr "要查看此版本关闭的所有问题和拉取请求，请参阅 `3.4.2Git 关闭里程碑 `_" msgid "Improvement" msgstr "改进" @@ -20096,22 +15582,15 @@ msgstr "适用于 postgreSQL 10" msgid "Fixed: Unexpected error column \"cname\"" msgstr "已修复：列 \"cname \"出现意外错误" -msgid "" -"Replace __linux__ with __GLIBC__ for glibc-specific headers and functions" +msgid "Replace __linux__ with __GLIBC__ for glibc-specific headers and functions" msgstr "将 __linux__ 替换为 __GLIBC__ 以获取 glibc 特定的标头和函数" msgid "pgRouting 2.4.1 Release Notes" msgstr "pgRouting 2.4.1 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.4.1 `__" -msgstr "" -"要查看此版本关闭的所有问题和拉取请求，请参阅 `3.4.1Git 关闭里程碑 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.4.1 `__" +msgstr "要查看此版本关闭的所有问题和拉取请求，请参阅 `3.4.1Git 关闭里程碑 `_" msgid "Fixed compiling error on macOS" msgstr "修正了 macOS 上的编译错误" @@ -20123,14 +15602,8 @@ msgid "pgRouting 2.4.0 Release Notes" msgstr "pgRouting 2.4.0 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.4.0 `__" -msgstr "" -"要查看此版本关闭的所有问题和拉取请求，请参阅 `3.4.0 Git 关闭里程碑 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.4.0 `__" +msgstr "要查看此版本关闭的所有问题和拉取请求，请参阅 `3.4.0 Git 关闭里程碑 `_" msgid "Deprecated signatures." msgstr "已废弃的签名。" @@ -20157,14 +15630,8 @@ msgid "pgRouting 2.3.2 Release Notes" msgstr "pgRouting 2.3.2 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.3.2 `__" -msgstr "" -"要查看此版本关闭的所有问题和拉取请求，请参阅 `3.3.2Git 关闭里程碑 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.3.2 `__" +msgstr "要查看此版本关闭的所有问题和拉取请求，请参阅 `3.3.2Git 关闭里程碑 `_" msgid "Fixed pgr_gsoc_vrppdtw crash when all orders fit on one truck." msgstr "修正了当所有订单都装在一辆卡车上时 pgr_gsoc_vrppdtw 崩溃的问题。" @@ -20182,14 +15649,8 @@ msgid "pgRouting 2.3.1 Release Notes" msgstr "pgRouting 2.3.1 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.3.1 `__" -msgstr "" -"查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.7.1版本里程碑关闭列" -"表 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.3.1 `__" +msgstr "查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.7.1版本里程碑关闭列表 `__" msgid "Leaks on proposed max_flow functions" msgstr "提议 max_flow 函数的泄漏问题" @@ -20204,14 +15665,8 @@ msgid "pgRouting 2.3.0 Release Notes" msgstr "pgRouting 2.3.0 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.3.0 `__" -msgstr "" -"查看本版本已关闭的所有议题和拉取请求,请访问： `GitHub 4.0.0版本里程碑关闭列" -"表 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.3.0 `__" +msgstr "查看本版本已关闭的所有议题和拉取请求,请访问： `GitHub 4.0.0版本里程碑关闭列表 `__" msgid "pgr_eucledianTSP" msgstr "pgr_eucledianTSP" @@ -20283,14 +15738,8 @@ msgid "pgRouting 2.2.4 Release Notes" msgstr "pgRouting 2.2.4 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.2.4 `__" -msgstr "" -"要查看此版本关闭的所有问题和拉取请求，请参阅 `3.3.4Git 关闭里程碑 `_" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.4 `__" +msgstr "要查看此版本关闭的所有问题和拉取请求，请参阅 `3.3.4Git 关闭里程碑 `_" msgid "Bogus uses of extern \"C\"" msgstr "无效的extern \"C\"" @@ -20305,14 +15754,8 @@ msgid "pgRouting 2.2.3 Release Notes" msgstr "pgRouting 2.2.3 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.2.3 `__" -msgstr "" -"要查看此版本关闭的所有问题和拉取请求，请参阅 `Git closed milestone for 3.7.3 " -"`__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.3 `__" +msgstr "要查看此版本关闭的所有问题和拉取请求，请参阅 `Git closed milestone for 3.7.3 `__" msgid "Fixed compatibility issues with PostgreSQL 9.6." msgstr "修复了 PostgreSQL 9.6 的兼容性问题。" @@ -20321,14 +15764,8 @@ msgid "pgRouting 2.2.2 Release Notes" msgstr "pgRouting 2.2.2 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.2.2 `__" -msgstr "" -"查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.7.2版本里程碑关闭列" -"表 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.2 `__" +msgstr "查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.7.2版本里程碑关闭列表 `__" msgid "Fixed regression error on pgr_drivingDistance" msgstr "修正了 pgr_drivingDistance 的回归错误" @@ -20337,14 +15774,8 @@ msgid "pgRouting 2.2.1 Release Notes" msgstr "pgRouting 2.2.1 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.2.1 `__" -msgstr "" -"查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.7.1版本里程碑关闭列" -"表 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.1 `__" +msgstr "查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.7.1版本里程碑关闭列表 `__" msgid "Server crash fix on pgr_alphaShape" msgstr "修复 pgr_alphaShape 使服务器崩溃问题" @@ -20356,14 +15787,8 @@ msgid "pgRouting 2.2.0 Release Notes" msgstr "pgRouting 2.2.0 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.2.0 `__" -msgstr "" -"查看本版本已关闭的所有议题和拉取请求,请访问： `GitHub 4.0.0版本里程碑关闭列" -"表 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.0 `__" +msgstr "查看本版本已关闭的所有议题和拉取请求,请访问： `GitHub 4.0.0版本里程碑关闭列表 `__" msgid "Improvements" msgstr "改进" @@ -20453,14 +15878,8 @@ msgid "pgRouting 2.1.0 Release Notes" msgstr "pgRouting 2.1.0 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.1.0 `__" -msgstr "" -"查看本版本已关闭的所有议题和拉取请求,请访问： `GitHub 4.0.0版本里程碑关闭列" -"表 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.1.0 `__" +msgstr "查看本版本已关闭的所有议题和拉取请求,请访问： `GitHub 4.0.0版本里程碑关闭列表 `__" msgid "Refactored" msgstr "重构" @@ -20468,42 +15887,28 @@ msgstr "重构" msgid "pgr_dijkstra(One to One)" msgstr "pgr_dijkstra(One to One)" -msgid "" -"pgr_alphaShape function now can generate better (multi)polygon with holes " -"and alpha parameter." -msgstr "" -"pgr_alphaShape 函数现在可以生成带有孔和 alpha 参数的更好的（多）多边形。" +msgid "pgr_alphaShape function now can generate better (multi)polygon with holes and alpha parameter." +msgstr "pgr_alphaShape 函数现在可以生成带有孔和 alpha 参数的更好的（多）多边形。" -msgid "" -"Proposed functions from Steve Woodbridge, (Classified as Convenience by the " -"author.)" +msgid "Proposed functions from Steve Woodbridge, (Classified as Convenience by the author.)" msgstr "Steve Woodbridge 提出的函数（作者分类为便利性函数。）" -msgid "" -"pgr_pointToEdgeNode - convert a point geometry to a vertex_id based on " -"closest edge." -msgstr "" -"pgr_pointToEdgeNode - 根据最近的边将点几何体转换为基于 vertex_id 的函数。" +msgid "pgr_pointToEdgeNode - convert a point geometry to a vertex_id based on closest edge." +msgstr "pgr_pointToEdgeNode - 根据最近的边将点几何体转换为基于 vertex_id 的函数。" -msgid "" -"pgr_flipEdges - flip the edges in an array of geometries so the connect end " -"to end." +msgid "pgr_flipEdges - flip the edges in an array of geometries so the connect end to end." msgstr "pgr_flipEdges - 翻转几何体数组中的边，以便它们端对端连接。" -msgid "" -"pgr_textToPoints - convert a string of x,y;x,y;... locations into point " -"geometries." +msgid "pgr_textToPoints - convert a string of x,y;x,y;... locations into point geometries." msgstr "pgr_textToPoints - 将一串 x,y;x,y;... 位置字符串转换为点几何体。" -msgid "" -"pgr_pointsToVids - convert an array of point geometries into vertex ids." +msgid "pgr_pointsToVids - convert an array of point geometries into vertex ids." msgstr "pgr_pointsToVids - 将点几何数组转换为顶点id。" msgid "pgr_pointsToDMatrix - Create a distance matrix from an array of points." msgstr "pgr_pointsToDMatrix - 从点数组创建距离矩阵。" -msgid "" -"pgr_vidsToDMatrix - Create a distance matrix from an array of vertix_id." +msgid "pgr_vidsToDMatrix - Create a distance matrix from an array of vertix_id." msgstr "pgr_vidsToDMatrix - 从 vertix_id 数组创建距离矩阵。" msgid "Added proposed functions from GSoc Projects:" @@ -20575,11 +15980,8 @@ msgstr "允许任何整数作为id" msgid "allow any-numerical on the cost/reverse_cost columns" msgstr "允许在 cost/reverse_cost 列中使用任何数值" -msgid "" -"Instead of generating many libraries: - All functions are encapsulated in " -"one library - The library has the prefix 2-1-0" -msgstr "" -"无需生成多个程序库： - 所有功能都封装在一个程序库中 - 程序库的前缀为 2-1-0" +msgid "Instead of generating many libraries: - All functions are encapsulated in one library - The library has the prefix 2-1-0" +msgstr "无需生成多个程序库： - 所有功能都封装在一个程序库中 - 程序库的前缀为 2-1-0" msgid "pgRouting 2.0" msgstr "pgRouting 2.0" @@ -20588,14 +15990,8 @@ msgid "pgRouting 2.0.1 Release Notes" msgstr "pgRouting 2.0.1 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.0.1 `__" -msgstr "" -"查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.7.1版本里程碑关闭列" -"表 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.0.1 `__" +msgstr "查看本版本已关闭的所有议题和拉取请求，请访问： `GitHub 3.7.1版本里程碑关闭列表 `__" msgid "Minor bug fixes." msgstr "小bug修复。" @@ -20607,22 +16003,11 @@ msgid "pgRouting 2.0.0 Release Notes" msgstr "pgRouting 2.0.0 发布说明" #, fuzzy -msgid "" -"To see all issues & pull requests closed by this release see the `Github " -"milestone for 2.0.0 `__" -msgstr "" -"查看本版本已关闭的所有议题和拉取请求,请访问： `GitHub 4.0.0版本里程碑关闭列" -"表 `__" +msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.0.0 `__" +msgstr "查看本版本已关闭的所有议题和拉取请求,请访问： `GitHub 4.0.0版本里程碑关闭列表 `__" -msgid "" -"With the release of pgRouting 2.0.0 the library has abandoned backwards " -"compatibility to `pgRouting 1.0`_ releases. The main Goals for this release " -"are:" -msgstr "" -"随着 pgRouting 2.0.0 的发布，该库已放弃向后兼容 `pgRouting 1.0`_ 版本。此版本" -"的主要目标是：" +msgid "With the release of pgRouting 2.0.0 the library has abandoned backwards compatibility to `pgRouting 1.0`_ releases. The main Goals for this release are:" +msgstr "随着 pgRouting 2.0.0 的发布，该库已放弃向后兼容 `pgRouting 1.0`_ 版本。此版本的主要目标是：" msgid "Major restructuring of pgRouting." msgstr "对 pgRouting 进行重大重组。" @@ -20654,21 +16039,16 @@ msgstr "并使多个开发人员更容易做出贡献。" msgid "Important Changes" msgstr "重要变更" -msgid "" -"Graph Analytics - tools for detecting and fixing connection some problems in " -"a graph" +msgid "Graph Analytics - tools for detecting and fixing connection some problems in a graph" msgstr "图分析--用于检测和修复图中某些连接问题的工具" msgid "A collection of useful utility functions" msgstr "一组有用的实用函数" -msgid "" -"Two new All Pairs Short Path algorithms (pgr_apspJohnson, pgr_apspWarshall)" +msgid "Two new All Pairs Short Path algorithms (pgr_apspJohnson, pgr_apspWarshall)" msgstr "两种新的全对最短路径算法（pgr_apspJohnson 和 pgr_apspWarshall）" -msgid "" -"Bi-directional Dijkstra and A-star search algorithms (pgr_bdAstar, " -"pgr_bdDijkstra)" +msgid "Bi-directional Dijkstra and A-star search algorithms (pgr_bdAstar, pgr_bdDijkstra)" msgstr "双向 Dijkstra 和 A-star 搜索算法 (pgr_bdAstar, pgr_bdDijkstra)" msgid "One to many nodes search (pgr_kDijkstra)" @@ -20677,11 +16057,8 @@ msgstr "一对多节点的搜索 (pgr_kDijkstra)" msgid "K alternate paths shortest path (pgr_ksp)" msgstr "K 条备选路径最短路径（pgr_ksp）" -msgid "" -"New TSP solver that simplifies the code and the build process (pgr_tsp), " -"dropped \"Gaul Library\" dependency" -msgstr "" -"新的 TSP 求解器简化了代码和构建过程（pgr_tsp），放弃了对 \"Gaul 库 \"的依赖" +msgid "New TSP solver that simplifies the code and the build process (pgr_tsp), dropped \"Gaul Library\" dependency" +msgstr "新的 TSP 求解器简化了代码和构建过程（pgr_tsp），放弃了对 \"Gaul 库 \"的依赖" msgid "Turn Restricted shortest path (pgr_trsp) that replaces Shooting Star" msgstr "取代了 Shooting Star的转向受限最短路径（pgr_trsp）" @@ -20689,22 +16066,16 @@ msgstr "取代了 Shooting Star的转向受限最短路径（pgr_trsp）" msgid "Dropped support for Shooting Star" msgstr "放弃对 Shooting Star的支持" -msgid "" -"Built a test infrastructure that is run before major code changes are " -"checked in" +msgid "Built a test infrastructure that is run before major code changes are checked in" msgstr "构建了在签入主要代码更改之前运行的测试基础架构" -msgid "" -"Tested and fixed most all of the outstanding bugs reported against 1.x that " -"existing in the 2.0-dev code base." -msgstr "" -"测试并修复了 2.0-dev 代码库中存在的几乎所有已报告的 1.x 版本中的未解决问题。" +msgid "Tested and fixed most all of the outstanding bugs reported against 1.x that existing in the 2.0-dev code base." +msgstr "测试并修复了 2.0-dev 代码库中存在的几乎所有已报告的 1.x 版本中的未解决问题。" msgid "Improved build process for Windows" msgstr "改进了 Windows 的构建过程" -msgid "" -"Automated testing on Linux and Windows platforms trigger by every commit" +msgid "Automated testing on Linux and Windows platforms trigger by every commit" msgstr "每次提交都会触发 Linux 和 Windows 平台上的自动测试" msgid "Modular library design" @@ -20743,16 +16114,8 @@ msgstr "pgRouting 1" msgid "pgRouting 1.0" msgstr "pgRouting 1.0" -msgid "" -"To see the issues closed by this release see the `Git closed issues for 1.x " -"`_ on Github. The following release notes have been copied " -"from the previous ``RELEASE_NOTES`` file and are kept as a reference." -msgstr "" -"要查看此版本关闭的问题，请参阅 Github 上的 `1.x Git 已关闭问题 `_ 。以下的发布说明已从之前的 ``RELEASE_NOTES`` 文件中复制，" -"并作为参考保留。" +msgid "To see the issues closed by this release see the `Git closed issues for 1.x `_ on Github. The following release notes have been copied from the previous ``RELEASE_NOTES`` file and are kept as a reference." +msgstr "要查看此版本关闭的问题，请参阅 Github 上的 `1.x Git 已关闭问题 `_ 。以下的发布说明已从之前的 ``RELEASE_NOTES`` 文件中复制，并作为参考保留。" msgid "Changes for release 1.05" msgstr "1.05 版的更改" @@ -20805,8 +16168,7 @@ msgstr "0.9.9 版的更改" msgid "PostgreSQL 8.2 support" msgstr "支持 PostgreSQL 8.2" -msgid "" -"Shortest path functions return empty result if they could not find any path" +msgid "Shortest path functions return empty result if they could not find any path" msgstr "如果找不到任何路径，最短路径函数会返回空结果" msgid "Changes for release 0.9.8" @@ -20827,13 +16189,8 @@ msgstr "函数族" msgid "Sample Data" msgstr "示例数据" -msgid "" -"The documentation provides very simple example queries based on a small " -"sample network that resembles a city. To be able to execute the majority of " -"the examples queries, follow the instructions below." -msgstr "" -"该文档基于一个类似城市的小型示例网络提供了非常简单的查询示例。要执行大多数示" -"例查询，请按照以下说明操作。" +msgid "The documentation provides very simple example queries based on a small sample network that resembles a city. To be able to execute the majority of the examples queries, follow the instructions below." +msgstr "该文档基于一个类似城市的小型示例网络提供了非常简单的查询示例。要执行大多数示例查询，请按照以下说明操作。" msgid "Main graph" msgstr "主图" @@ -20844,27 +16201,14 @@ msgstr "图由一组边和一组顶点组成。" msgid "The following city is to be inserted into the database:" msgstr "要在数据库中插入以下城市：" -msgid "" -"Information known at this point is the geometry of the edges, cost values, " -"capacity values, category values and some locations that are not in the " -"graph." -msgstr "" -"此时已知的信息包括边的几何形状、成本值、容量值、类别值和一些不在图中的位置。" +msgid "Information known at this point is the geometry of the edges, cost values, capacity values, category values and some locations that are not in the graph." +msgstr "此时已知的信息包括边的几何形状、成本值、容量值、类别值和一些不在图中的位置。" -msgid "" -"The process to have working topology starts by inserting the edges. After " -"that everything else is calculated." +msgid "The process to have working topology starts by inserting the edges. After that everything else is calculated." msgstr "拓扑结构的工作流程从插入边开始。然后再计算其他所有内容。" -msgid "" -"The database design for the documentation of pgRouting, keeps in the same " -"row 2 segments, one in the direction of the geometry and the second in the " -"opposite direction. Therefore some information has the ``reverse_`` prefix " -"which corresponds to the segment on the opposite direction of the geometry." -msgstr "" -"pgRouting 文档中的数据库设计将同一行中保留了两个线段，一段是几何方向的边，另" -"一段是相反方向的边。因此，一些信息带有 ``reverse_`` 前缀，表示与几何体相反方" -"向的边段。" +msgid "The database design for the documentation of pgRouting, keeps in the same row 2 segments, one in the direction of the geometry and the second in the opposite direction. Therefore some information has the ``reverse_`` prefix which corresponds to the segment on the opposite direction of the geometry." +msgstr "pgRouting 文档中的数据库设计将同一行中保留了两个线段，一段是几何方向的边，另一段是相反方向的边。因此，一些信息带有 ``reverse_`` 前缀，表示与几何体相反方向的边段。" msgid "Identifier of the starting vertex of the geometry ``geom``." msgstr "几何体 ``geom`` 的起始顶点的标识符。" @@ -20893,22 +16237,14 @@ msgstr "``reverse_category``" msgid ":math:`x` coordinate of the starting vertex of the geometry." msgstr ":math:`x` 几何图形起始顶点的坐标。" -msgid "" -"For convenience it is saved on the table but can be calculated as " -"``ST_X(ST_StartPoint(geom))``." -msgstr "" -"该值被直接保存到表中，但实际上可以通过此函数进行动态计算 " -"``ST_X(ST_StartPoint(geom))`` 。" +msgid "For convenience it is saved on the table but can be calculated as ``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` 几何图形结束顶点的坐标。" -msgid "" -"For convenience it is saved on the table but can be calculated as " -"``ST_Y(ST_EndPoint(geom))``." -msgstr "" -"该值被直接保存到表中，但实际上可以通过此函数进行动态计算 " -"``ST_Y(ST_EndPoint(geom))`` 。" +msgid "For convenience it is saved on the table but can be calculated as ``ST_Y(ST_EndPoint(geom))``." +msgstr "该值被直接保存到表中，但实际上可以通过此函数进行动态计算 ``ST_Y(ST_EndPoint(geom))`` 。" msgid "The geometry of the segments." msgstr "分段的几何形状。" @@ -20916,21 +16252,16 @@ msgstr "分段的几何形状。" msgid "Starting on PostgreSQL 12::" msgstr "从 PostgreSQL 12 开始：：" -msgid "" -"Optionally indexes on different columns can be created. The recommendation " -"is to have" +msgid "Optionally indexes on different columns can be created. The recommendation is to have" msgstr "可以选择在不同的列上创建索引。推荐创建" msgid "``id`` indexed." msgstr "``id`` 列创建索引 。" -msgid "" -"``source`` and ``target`` columns indexed to speed up pgRouting queries." +msgid "``source`` and ``target`` columns indexed to speed up pgRouting queries." msgstr "``source`` 和 ``target`` 列建立索引以加快 pgRouting 查询。" -msgid "" -"``geom`` indexed to speed up geometry processes that might be needed in the " -"front end." +msgid "``geom`` indexed to speed up geometry processes that might be needed in the front end." msgstr "``geom`` 字段建立空间索引，为加速前端可能需要的几何处理。" msgid "For this small example the indexes are skipped, except for ``id``" @@ -20942,25 +16273,16 @@ msgstr "边数据" msgid "Inserting into the database the information of the edges:" msgstr "将边的信息插入数据库：" -msgid "" -"Negative values on the cost, capacity and category means that the edge do " -"not exist." +msgid "Negative values on the cost, capacity and category means that the edge do not exist." msgstr "成本、容量和类别上的负值表示不存在边。" msgid "Vertices" msgstr "顶点" -msgid "" -"The vertex information is calculated based on the identifier of the edge and " -"the geometry and saved on a table. Saving all the information provided by :" -"doc:`pgr_extractVertices`:" -msgstr "" -"根据边的标识符和几何形状计算顶点信息并保存在表中。 保存 :doc:" -"`pgr_extractVertices` 提供的所有信息 ：" +msgid "The vertex information is calculated based on the identifier of the edge and the geometry and saved on a table. Saving all the information provided by :doc:`pgr_extractVertices`:" +msgstr "根据边的标识符和几何形状计算顶点信息并保存在表中。 保存 :doc:`pgr_extractVertices` 提供的所有信息 ：" -msgid "" -"In this case the because the ``CREATE`` statement was not used, the " -"definition of an index on the table is needed." +msgid "In this case the because the ``CREATE`` statement was not used, the definition of an index on the table is needed." msgstr "在本例中，由于未使用 ``CREATE`` 语句，因此需要在表上定义索引。" msgid "The structure of the table is:" @@ -20972,20 +16294,14 @@ msgstr "顶点数据" msgid "The saved information of the vertices is:" msgstr "保存的顶点信息为：" -msgid "" -"Here is where adding more columns to the vertices table can be done. " -"Additional columns names and types will depend on the application." +msgid "Here is where adding more columns to the vertices table can be done. Additional columns names and types will depend on the application." msgstr "这里可以为顶点表添加更多的列。附加列的名称和类型取决于应用程序。" msgid "The topology" msgstr "拓扑结构" -msgid "" -"This queries based on the vertices data create a topology by filling the " -"``source`` and ``target`` columns in the edges table." -msgstr "" -"此查询基于顶点数据，通过填充边表中的 ``source`` 列和 ``target`` 列来创建拓" -"扑。" +msgid "This queries based on the vertices data create a topology by filling the ``source`` and ``target`` columns in the edges table." +msgstr "此查询基于顶点数据，通过填充边表中的 ``source`` 列和 ``target`` 列来创建拓扑。" msgid "Topology data" msgstr "拓扑数据" @@ -20996,16 +16312,10 @@ msgstr "图之外的点" msgid "Support tables" msgstr "支持表" -msgid "" -"Many functions can be used with a combinations of ``(source, target)`` pairs " -"when wanting a route from ``source`` to ``target``." -msgstr "" -"当需要从 ``source`` 到 ``target`` 的路由时，许多函数都可以与 ``(source, " -"target)`` 对组合使用。" +msgid "Many functions can be used with a combinations of ``(source, target)`` pairs when wanting a route from ``source`` to ``target``." +msgstr "当需要从 ``source`` 到 ``target`` 的路由时，许多函数都可以与 ``(source, target)`` 对组合使用。" -msgid "" -"For convenience of this documentation, some combinations will be stored on a " -"table:" +msgid "For convenience of this documentation, some combinations will be stored on a table:" msgstr "为了方便本文档的说明，部分组合结果将存储在表中：" msgid "Inserting the data:" @@ -21035,9 +16345,7 @@ msgstr "点击图可放大。" msgid "Directed graph with ``cost`` and ``reverse_cost``" msgstr "带 ``cost`` 和 ``reverse_cost`` 的有向图" -msgid "" -"When working with city networks, this is recommended for point of view of " -"vehicles." +msgid "When working with city networks, this is recommended for point of view of vehicles." msgstr "在使用城市网络时，建议从车辆的角度考虑。" msgid "Directed, with cost and reverse_cost" @@ -21046,9 +16354,7 @@ msgstr "具有cost和reverse_cost的有向图" msgid "Undirected graph with ``cost`` and ``reverse_cost``" msgstr "具有 ``cost`` 和 ``reverse_cost`` 的无向图" -msgid "" -"When working with city networks, this is recommended for point of view of " -"pedestrians." +msgid "When working with city networks, this is recommended for point of view of pedestrians." msgstr "在使用城市网络时，建议从行人的角度考虑。" msgid "Undirected, with cost and reverse cost" @@ -21072,79 +16378,40 @@ msgstr "取货和送货数据" msgid "Spanning Tree - Category" msgstr "生成树 - 类别" -msgid "" -"A spanning tree of an undirected graph is a tree that includes all the " -"vertices of G with the minimum possible number of edges." +msgid "A spanning tree of an undirected graph is a tree that includes all the vertices of G with the minimum possible number of edges." msgstr "一个无向图的生成树是包括图 G 的所有顶点并具有可能的最小数量的边的树。" -msgid "" -"For a disconnected graph, there there is no single tree, but a spanning " -"forest, consisting of a spanning tree of each connected component." +msgid "For a disconnected graph, there there is no single tree, but a spanning forest, consisting of a spanning tree of each connected component." msgstr "对于不连通的图，不存在单棵树，而是由每个连通分量的生成树组成的生成林。" msgid "Characteristics:" msgstr "特征：" -msgid "" -"pgRouting community support is available through the `pgRouting website " -"`_, `documentation `_, tutorials, mailing lists and others. If you’re looking " -"for :ref:`commercial support `, find below a list of " -"companies providing pgRouting development and consulting services." -msgstr "" -"pgRouting 社区支持可通过 `pgRouting 网站 `_、`文档 `_、教程、邮件列表等获得。 如果您" -"正在寻求 :ref:`商业支持 `，请在下面找到提供 pgRouting 开" -"发和咨询服务的公司列表。" +msgid "pgRouting community support is available through the `pgRouting website `_, `documentation `_, tutorials, mailing lists and others. If you’re looking for :ref:`commercial support `, find below a list of companies providing pgRouting development and consulting services." +msgstr "pgRouting 社区支持可通过 `pgRouting 网站 `_、`文档 `_、教程、邮件列表等获得。 如果您正在寻求 :ref:`商业支持 `，请在下面找到提供 pgRouting 开发和咨询服务的公司列表。" msgid "Reporting Problems" msgstr "报告问题" -msgid "" -"Bugs are reported and managed in an `issue tracker `_. Please follow these steps:" -msgstr "" -"错误在 `问题跟踪器 `_ 中报告和" -"管理。 请按照以下步骤操作：" +msgid "Bugs are reported and managed in an `issue tracker `_. Please follow these steps:" +msgstr "错误在 `问题跟踪器 `_ 中报告和管理。 请按照以下步骤操作：" -msgid "" -"Search the tickets to see if your problem has already been reported. If so, " -"add any extra context you might have found, or at least indicate that you " -"too are having the problem. This will help us prioritize common issues." -msgstr "" -"搜索票证以查看您的问题是否已被报告。 如果是这样，请添加您可能发现的任何额外上" -"下文，或者至少表明您也遇到了问题。 这将帮助我们优先考虑常见问题。" +msgid "Search the tickets to see if your problem has already been reported. If so, add any extra context you might have found, or at least indicate that you too are having the problem. This will help us prioritize common issues." +msgstr "搜索票证以查看您的问题是否已被报告。 如果是这样，请添加您可能发现的任何额外上下文，或者至少表明您也遇到了问题。 这将帮助我们优先考虑常见问题。" -msgid "" -"If your problem is unreported, create a `new issue `__ for it." -msgstr "" -"如果您的问题未报告，请为其创建一个 `新问题 `__ 。" +msgid "If your problem is unreported, create a `new issue `__ for it." +msgstr "如果您的问题未报告，请为其创建一个 `新问题 `__ 。" -msgid "" -"In your report include explicit instructions to replicate your issue. The " -"best tickets include the exact SQL necessary to replicate a problem." -msgstr "" -"在您的报告中包含重现问题的明确说明。 最好的票证包含复制问题所需的确切 SQL。" +msgid "In your report include explicit instructions to replicate your issue. The best tickets include the exact SQL necessary to replicate a problem." +msgstr "在您的报告中包含重现问题的明确说明。 最好的票证包含复制问题所需的确切 SQL。" -msgid "" -"If you can test older versions of PostGIS for your problem, please do. On " -"your ticket, note the earliest version the problem appears." -msgstr "" -"如果您可以测试旧版本的 PostGIS 来解决您的问题，请这样做。 在您的票证上，记下" -"问题出现的最早版本。" +msgid "If you can test older versions of PostGIS for your problem, please do. On your ticket, note the earliest version the problem appears." +msgstr "如果您可以测试旧版本的 PostGIS 来解决您的问题，请这样做。 在您的票证上，记下问题出现的最早版本。" -msgid "" -"For the versions where you can replicate the problem, note the operating " -"system and version of pgRouting, PostGIS and PostgreSQL." -msgstr "" -"对于可以重现问题的版本，请记下操作系统以及 pgRouting、PostGIS 和 PostgreSQL " -"的版本。" +msgid "For the versions where you can replicate the problem, note the operating system and version of pgRouting, PostGIS and PostgreSQL." +msgstr "对于可以重现问题的版本，请记下操作系统以及 pgRouting、PostGIS 和 PostgreSQL 的版本。" -msgid "" -"It is recommended to use the following wrapper on the problem to pin point " -"the step that is causing the problem." +msgid "It is recommended to use the following wrapper on the problem to pin point the step that is causing the problem." msgstr "建议对问题使用以下包装器来查明导致问题的步骤。" #, fuzzy @@ -21152,58 +16419,33 @@ msgid "Mailing List, Matrix, GIS StackExchange" msgstr "邮件列表和GIS StackExchange" #, fuzzy -msgid "" -"There are two mailing lists for pgRouting hosted on OSGeo discourse server:" +msgid "There are two mailing lists for pgRouting hosted on OSGeo discourse server:" msgstr "OSGeo 邮件列表服务器上托管有两个 pgRouting 邮件列表：" #, fuzzy -msgid "" -"User mailing list: https://discourse.osgeo.org/c/pgrouting/pgrouting-users/" -msgstr "" -"开发人员邮件列表： https://discourse.osgeo.org/c/pgrouting/pgrouting-dev/" +msgid "User mailing list: https://discourse.osgeo.org/c/pgrouting/pgrouting-users/" +msgstr "开发人员邮件列表： https://discourse.osgeo.org/c/pgrouting/pgrouting-dev/" -msgid "" -"Developer mailing list: https://discourse.osgeo.org/c/pgrouting/pgrouting-" -"dev/" -msgstr "" -"开发人员邮件列表： https://discourse.osgeo.org/c/pgrouting/pgrouting-dev/" +msgid "Developer mailing list: https://discourse.osgeo.org/c/pgrouting/pgrouting-dev/" +msgstr "开发人员邮件列表： https://discourse.osgeo.org/c/pgrouting/pgrouting-dev/" msgid "Subscribe: https://discourse.osgeo.org/g/pgrouting-dev" msgstr "订阅：https://discourse.osgeo.org/g/pgrouting-dev" -msgid "" -"For general questions and topics about how to use pgRouting, please write to " -"the user mailing list." +msgid "For general questions and topics about how to use pgRouting, please write to the user mailing list." msgstr "有关如何使用 pgRouting 的一般问题和主题，请写信给用户邮件列表。" -msgid "" -"If you want to chat with fellow pgRouting users and contributors, you can " -"join our matrix channel: `pgRouting matrix channel `_." +msgid "If you want to chat with fellow pgRouting users and contributors, you can join our matrix channel: `pgRouting matrix channel `_." msgstr "" -msgid "" -"You can also ask at `GIS StackExchange `_ " -"and tag the question with ``pgrouting``. Find all questions tagged with " -"``pgrouting`` under https://gis.stackexchange.com/questions/tagged/pgrouting " -"or subscribe to the `pgRouting questions feed `_." -msgstr "" -"您还可以在 `GIS StackExchange `_ 上提问，并使" -"用 ``pgrouting`` 标签。查找所有带有 ``pgrouting`` 标签的问题，请访问 https://" -"gis.stackexchange.com/questions/tagged/pgrouting 或订阅 `pgRouting 问题订阅 " -"`_ 。" +msgid "You can also ask at `GIS StackExchange `_ and tag the question with ``pgrouting``. Find all questions tagged with ``pgrouting`` under https://gis.stackexchange.com/questions/tagged/pgrouting or subscribe to the `pgRouting questions feed `_." +msgstr "您还可以在 `GIS StackExchange `_ 上提问，并使用 ``pgrouting`` 标签。查找所有带有 ``pgrouting`` 标签的问题，请访问 https://gis.stackexchange.com/questions/tagged/pgrouting 或订阅 `pgRouting 问题订阅 `_ 。" msgid "Commercial Support" msgstr "商业支持" -msgid "" -"For users who require professional support, development and consulting " -"services, consider contacting any of the following organizations, which have " -"significantly contributed to the development of pgRouting:" -msgstr "" -"对于需要专业支持、开发和咨询服务的用户，请考虑联系以下任何一个组织，这些组织" -"对 pgRouting 的发展做出了重大贡献：" +msgid "For users who require professional support, development and consulting services, consider contacting any of the following organizations, which have significantly contributed to the development of pgRouting:" +msgstr "对于需要专业支持、开发和咨询服务的用户，请考虑联系以下任何一个组织，这些组织对 pgRouting 的发展做出了重大贡献：" msgid "**Company**" msgstr "**公司**" @@ -21238,11 +16480,8 @@ msgstr "https://www.osgeo.org/service-providers/netlab/" msgid "Transformation - Family of functions" msgstr "转换 - 函数族" -msgid "" -"This family of functions is used for transforming a given input graph :math:" -"`G(V,E)` into a new graph :math:`G'(V',E')`." -msgstr "" -"该函数族用于将给定的输入图 :math:`G(V,E)` 转换为新图 :math:`G'(V',E')`。" +msgid "This family of functions is used for transforming a given input graph :math:`G(V,E)` into a new graph :math:`G'(V',E')`." +msgstr "该函数族用于将给定的输入图 :math:`G(V,E)` 转换为新图 :math:`G'(V',E')`。" msgid "Traversal - Family of functions" msgstr "Traversal - 函数族" @@ -21256,16 +16495,10 @@ msgstr "Via - 类别" msgid "This category intends to solve the general problem:" msgstr "该类别旨在解决普遍问题：" -msgid "" -"Given a graph and a list of vertices, find the shortest path between :math:" -"`vertex_i` and :math:`vertex_{i+1}` for all vertices" -msgstr "" -"给定一个图和一个顶点列表，找到所有相邻顶点对 :math:`vertex_i` 和 :math:" -"`vertex_{i+1}` 之间的最短路径" +msgid "Given a graph and a list of vertices, find the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all vertices" +msgstr "给定一个图和一个顶点列表，找到所有相邻顶点对 :math:`vertex_i` 和 :math:`vertex_{i+1}` 之间的最短路径" -msgid "" -"In other words, find a continuous route that visits all the vertices in the " -"order given." +msgid "In other words, find a continuous route that visits all the vertices in the order given." msgstr "换句话说，寻找一条连续路径，使其按照给定顺序访问所有节点。" msgid "path" @@ -21283,9 +16516,7 @@ msgstr "是一系列 **paths**" msgid "**Used in:**" msgstr "**用于：**" -msgid "" -"Besides the compulsory parameters each function has, there are optional " -"parameters that exist due to the kind of function." +msgid "Besides the compulsory parameters each function has, there are optional parameters that exist due to the kind of function." msgstr "除了每个函数具有的强制参数之外，由于函数的种类而存在可选参数。" msgid "Used in all Via functions" @@ -21300,38 +16531,19 @@ msgstr "withPoints - 类别" msgid "When points are added to the graph." msgstr "当点添加到图中时。" -msgid "" -"The **with points** category modifies the graph on the fly by adding points " -"on edges as required by the `Points SQL`_ query." -msgstr "" -"**with points** 类别通过根据 `Points SQL`_ 查询的要求在边上添加点来动态修改图" -"形。" +msgid "The **with points** category modifies the graph on the fly by adding points on edges as required by the `Points SQL`_ query." +msgstr "**with points** 类别通过根据 `Points SQL`_ 查询的要求在边上添加点来动态修改图形。" -msgid "" -"The functions within this category give the ability to process between " -"arbitrary points located outside the original graph." +msgid "The functions within this category give the ability to process between arbitrary points located outside the original graph." msgstr "该类别中的函数能够在位于原始图之外的任意点之间进行处理。" -msgid "" -"This category of functions was thought for routing vehicles, but might as " -"well work for some other application not involving vehicles." -msgstr "" -"此类功能被认为用于路由车辆，但也可能适用于其他一些不涉及车辆的应用程序。" +msgid "This category of functions was thought for routing vehicles, but might as well work for some other application not involving vehicles." +msgstr "此类功能被认为用于路由车辆，但也可能适用于其他一些不涉及车辆的应用程序。" -msgid "" -"When given a point identifier ``pid`` that its being mapped to an edge with " -"an identifier ``edge_id``, with a fraction from the source to the target " -"along the edge ``fraction`` and some additional information about which side " -"of the edge the point is on ``side``, then processing from arbitrary points " -"can be done on fixed networks." -msgstr "" -"当给定一个点标识符 ``pid`` ，它被映射到具有标识符 ``edge_id`` 的边上，并且有" -"一个从源到目标沿边的分数 ``fraction`` ，以及关于点位于边的哪一侧的其他信息 " -"``side`` ，那么可以在固定网络上从任意点进行处理。" +msgid "When given a point identifier ``pid`` that its being mapped to an edge with an identifier ``edge_id``, with a fraction from the source to the target along the edge ``fraction`` and some additional information about which side of the edge the point is on ``side``, then processing from arbitrary points can be done on fixed networks." +msgstr "当给定一个点标识符 ``pid`` ，它被映射到具有标识符 ``edge_id`` 的边上，并且有一个从源到目标沿边的分数 ``fraction`` ，以及关于点位于边的哪一侧的其他信息 ``side`` ，那么可以在固定网络上从任意点进行处理。" -msgid "" -"All this functions consider as many traits from the \"real world\" as " -"possible:" +msgid "All this functions consider as many traits from the \"real world\" as possible:" msgstr "所有这些函数都考虑了尽可能多的“现实世界”特征：" msgid "Kind of graph:" @@ -21346,8 +16558,7 @@ msgstr "**无向** 图" msgid "Arriving at the point:" msgstr "到达点：" -msgid "" -"Compulsory arrival on the side of the segment where the point is located." +msgid "Compulsory arrival on the side of the segment where the point is located." msgstr "强制到达该点所在航段的一侧。" msgid "On either side of the segment." @@ -21365,13 +16576,10 @@ msgstr "**左侧** 驾驶" msgid "Some points are:" msgstr "一些要点是：" -msgid "" -"**Permanent**: for example the set of points of clients stored in a table in " -"the data base." +msgid "**Permanent**: for example the set of points of clients stored in a table in the data base." msgstr "**永久**：例如，存储在表中的客户端点集 数据库。" -msgid "" -"The graph has been modified to permanently have those points as vertices." +msgid "The graph has been modified to permanently have those points as vertices." msgstr "图已修改为将这些点永久用作顶点。" msgid "There is a table on the database that describes the points" @@ -21383,9 +16591,7 @@ msgstr "**时间**：例如通过 Web 应用程序给出的点" msgid "The numbering of the points are handled with negative sign." msgstr "点的编号用负号处理。" -msgid "" -"This sign change is to avoid confusion when there is a vertex with the same " -"identifier as the point identifier." +msgid "This sign change is to avoid confusion when there is a vertex with the same identifier as the point identifier." msgstr "这种符号变化是为了避免当存在与点标识符具有相同标识符的顶点时发生混淆。" msgid "Original point identifiers are to be positive." @@ -21406,13 +16612,8 @@ msgstr "负号是 `Points SQL`_ 的一个点" msgid "About points" msgstr "关于积分" -msgid "" -"For this section the following city (see :doc:`sampledata`) some interesting " -"points such as restaurant, supermarket, post office, etc. will be used as " -"example." -msgstr "" -"本节将以下列城市（参见 :doc:`sampledata`）的一些有趣的点为例，如餐馆、超市、" -"邮局等。" +msgid "For this section the following city (see :doc:`sampledata`) some interesting points such as restaurant, supermarket, post office, etc. will be used as example." +msgstr "本节将以下列城市（参见 :doc:`sampledata`）的一些有趣的点为例，如餐馆、超市、邮局等。" msgid "The graph is **directed**" msgstr "图是 **有向** 的" @@ -21423,9 +16624,7 @@ msgstr "红色箭头显示边表上的边 ``(source, target)``" msgid "Blue arrows show the ``(target, source)`` of the edge on the edge table" msgstr "蓝色箭头显示边表上的边 ``(target, source)``" -msgid "" -"Each point location shows where it is located with relation of the edge " -"``(source, target)``" +msgid "Each point location shows where it is located with relation of the edge ``(source, target)``" msgstr "每个点位置显示它与边 ``(source, target)`` 的关系" msgid "On the right for points **2** and **4**." @@ -21437,9 +16636,7 @@ msgstr "左侧为第 **1**、**3** 和 **5** 点。" msgid "On both sides for point **6**." msgstr "在两侧为第 **6** 点。" -msgid "" -"The representation on the data base follows the `Points SQL`_ description, " -"and for this example:" +msgid "The representation on the data base follows the `Points SQL`_ description, and for this example:" msgstr "数据库上的表示遵循 `Points SQL`_ 描述，对于本示例：" msgid "Driving side" @@ -21454,9 +16651,7 @@ msgstr "平方顶点是临时顶点，" msgid "The temporary vertices are added according to the driving side," msgstr "根据驾驶侧添加临时顶点，" -msgid "" -"visually showing the differences on how depending on the driving side the " -"data is interpreted." +msgid "visually showing the differences on how depending on the driving side the data is interpreted." msgstr "直观地显示不同驾驶侧数据解释方式的差异。" msgid "Point **1** located on edge ``(6, 5)``" @@ -21507,9 +16702,7 @@ msgstr "点 **4** 位于边 ``(3, 1)`` 和 ``(1, 3)``" msgid "Creating temporary vertices" msgstr "创建临时顶点" -msgid "" -"This section will demonstrate how a temporary vertex is created internally " -"on the graph." +msgid "This section will demonstrate how a temporary vertex is created internally on the graph." msgstr "本节将演示如何在图内部创建临时顶点。" msgid "Problem" @@ -21536,11 +16729,8 @@ msgstr "它只影响边 ``(16, 17)`` ，因此边被移除。" msgid "Create two new edges:" msgstr "创建两条新边：" -msgid "" -"Edge ``(16, -2)`` with cost ``0.4`` (original cost * fraction == :math:`1 * " -"0.4`)" -msgstr "" -"边 ``(16, -2)`` 的成本为 ``0.4`` （原始成本 * 分数 == :math:`1 * 0.4` ）" +msgid "Edge ``(16, -2)`` with cost ``0.4`` (original cost * fraction == :math:`1 * 0.4`)" +msgstr "边 ``(16, -2)`` 的成本为 ``0.4`` （原始成本 * 分数 == :math:`1 * 0.4` ）" msgid "Edge ``(-2, 17)`` with cost ``0.6`` (the remaining cost)" msgstr "边 ``(-2, 17)`` 的成本为``0.6`` （剩余成本）" @@ -21548,8 +16738,7 @@ msgstr "边 ``(-2, 17)`` 的成本为``0.6`` （剩余成本）" msgid "The total cost of the additional edges is equal to the original cost." msgstr "附加边的总成本等于原始成本。" -msgid "" -"If more points are on the same edge, the process is repeated recursevly." +msgid "If more points are on the same edge, the process is repeated recursevly." msgstr "如果同一条边上有更多点，则递归地重复该过程。" msgid "On a left hand side driving network" @@ -21564,22 +16753,16 @@ msgstr "不影响边 ``(16, 17)`` ，因此保留边。" msgid "It only affects the edge ``(17, 16)``, therefore the edge is removed." msgstr "它只影响边 ``(17, 16)`` ，因此边被移除。" -msgid "" -"Work with the original edge ``(16, 17)`` as the fraction is a fraction of " -"the original:" +msgid "Work with the original edge ``(16, 17)`` as the fraction is a fraction of the original:" msgstr "使用原始边 ``(16, 17)`` ，因为分数是原始边的分数：" msgid "Flip the Edges and add them to the graph:" msgstr "翻转边并将它们添加到图中：" -msgid "" -"Edge ``(17, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the " -"graph." +msgid "Edge ``(17, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the graph." msgstr "边 ``(17, -2)`` 变为 ``(-2, 16)`` ，成本为``0.4`` ，并添加到图中。" -msgid "" -"Edge ``(-2, 16)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the " -"graph." +msgid "Edge ``(-2, 16)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the graph." msgstr "边 ``(-2, 16)`` 变为 ``(17, -2)`` ，成本为 ``0.6`` ，并添加到图中。" msgid "When driving side does not matter" @@ -21588,9 +16771,7 @@ msgstr "当驾驶侧无关紧要时" msgid "Arrival to point ``-2`` can be achieved via vertices **16** or **17**." msgstr "可通过顶点 **16** 或 **17** 到达 ``-2`` 点。" -msgid "" -"Affects the edges ``(16, 17)`` and ``(17, 16)``, therefore the edges are " -"removed." +msgid "Affects the edges ``(16, 17)`` and ``(17, 16)``, therefore the edges are removed." msgstr "影响边 ``(16, 17)`` 和 ``(17, 16)`` ，因此边被移除。" msgid "Create four new edges:" @@ -21605,26 +16786,17 @@ msgstr "边 ``(16, -2)`` 被添加到图中。" msgid "Edge ``(-2, 17)`` is added to the graph." msgstr "边 ``(-2, 17)`` 被添加到图中。" -msgid "" -"Edge ``(16, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the " -"graph." +msgid "Edge ``(16, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the graph." msgstr "边 ``(16, -2)`` 变为 ``(-2, 16)`` ，成本为 0.4，并添加到图中。" -msgid "" -"Edge ``(-2, 17)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the " -"graph." +msgid "Edge ``(-2, 17)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the graph." msgstr "边 ``(-2, 17)`` 变为``(17, -2)`` ，成本为 ``0.6`` ，并添加到图中。" msgid "withPoints - Family of functions" 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`，组成它们的函数以某种方式基于 " -"dijkstra 算法。" +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`，组成它们的函数以某种方式基于 dijkstra 算法。" msgid "Depending on the name:" msgstr "取决于名称：" @@ -21658,9 +16830,7 @@ msgstr "pgr_withPointsvia 是 pgr_dijkstraVia **with points** 的版本" #~ msgstr "用于用户文档" #, fuzzy -#~ msgid "" -#~ "The translated languages (en, es, sv, zh_Hans) HTML documentation is " -#~ "build by default" +#~ msgid "The translated languages (en, es, sv, zh_Hans) HTML documentation is build by default" #~ msgstr "用于用户文档" #, fuzzy @@ -21671,499 +16841,250 @@ msgstr "pgr_withPointsvia 是 pgr_dijkstraVia **with points** 的版本" #~ msgstr "新实验性函数" #, fuzzy -#~ msgid "" -#~ "`#2913 `__: " -#~ "pgr_DAGshortestPath" -#~ msgstr "" -#~ "`#2683 `__: pgr_trsp" +#~ msgid "`#2913 `__: pgr_DAGshortestPath" +#~ msgstr "`#2683 `__: pgr_trsp" + +#, fuzzy +#~ msgid "`#2909 `__: pgr_turnRestrictedPaths" +#~ msgstr "`#2683 `__: pgr_trsp" + +#~ msgid "`#2681 `__: pgr_trspviaedges" +#~ msgstr "`#2681 `__: pgr_trspviaedges" + +#~ msgid "`#2682 `__: pgr_trspviavertices" +#~ msgstr "`#2682 `__: pgr_trspviavertices" + +#, fuzzy +#~ msgid "`#2748 `__ _pgr_alphashape(text,double precision)" +#~ msgstr "`#2748 `__: pgr_alphaShape" + +#, fuzzy +#~ msgid "`#2861 `__ _pgr_checkverttab(text,text[],integer,text)" +#~ msgstr "`#2827 `__: pgr_createVerticesTable" + +#, fuzzy +#~ msgid "`#2861 `__ _pgr_createindex(text,text,text,integer,text)" +#~ msgstr "`#2786 `__:pgr_contraction(edges) 新签名" + +#, fuzzy +#~ msgid "`#2861 `__ _pgr_createindex(text,text,text,text,integer,text)" +#~ msgstr "`#2786 `__:pgr_contraction(edges) 新签名" + +#, fuzzy +#~ msgid "`#2913 `__ _pgr_dagshortestpath(text,anyarray,anyarray,boolean,boolean)" +#~ msgstr "`#2683 `__: pgr_trsp" + +#, fuzzy +#~ msgid "`#2913 `__ _pgr_dagshortestpath(text,text,boolean,boolean)" +#~ msgstr "`#2683 `__: pgr_trsp" #, fuzzy -#~ msgid "" -#~ "`#2909 `__: " -#~ "pgr_turnRestrictedPaths" -#~ msgstr "" -#~ "`#2683 `__: pgr_trsp" +#~ msgid "`#2730 `__ _pgr_dijkstranear(text,anyarray,anyarray,bigint,boolean)" +#~ msgstr "`#2798 `__: pgr_contraction" -#~ msgid "" -#~ "`#2681 `__: " -#~ "pgr_trspviaedges" -#~ msgstr "" -#~ "`#2681 `__: " -#~ "pgr_trspviaedges" +#, fuzzy +#~ msgid "`#2730 `__ _pgr_dijkstranear(text,anyarray,bigint,bigint,boolean)" +#~ msgstr "`#2798 `__: pgr_contraction" + +#, fuzzy +#~ msgid "`#2730 `__ _pgr_dijkstranear(text,bigint,anyarray,bigint,boolean)" +#~ msgstr "`#2798 `__: pgr_contraction" + +#, fuzzy +#~ msgid "`#2735 `__ _pgr_drivingdistance(text,anyarray,double precision,boolean,boolean)" +#~ msgstr "_pgr_drivingdistance(text,anyarray,double precision,boolean,boolean)" + +#, fuzzy +#~ msgid "`#2861 `__ _pgr_endpoint(geometry)" +#~ msgstr "`#2850 `__:重写 pgr_nodeNetwork" + +#, fuzzy +#~ msgid "`#2861 `__ _pgr_getcolumnname(text,text,integer,text)" +#~ msgstr "`#2850 `__:重写 pgr_nodeNetwork" + +#, fuzzy +#~ msgid "`#2861 `__ _pgr_getcolumnname(text,text,text,integer,text)" +#~ msgstr "`#2786 `__:pgr_contraction(edges) 新签名" + +#, fuzzy +#~ msgid "`#2861 `__ _pgr_getcolumntype(text,text,integer,text)" +#~ msgstr "`#2681 `__: pgr_trspviaedges" + +#, fuzzy +#~ msgid "`#2861 `__ _pgr_getcolumntype(text,text,text,integer,text)" +#~ msgstr "`#2681 `__: pgr_trspviaedges" + +#, fuzzy +#~ msgid "`#2861 `__ _pgr_gettablename(text,integer,text)" +#~ msgstr "`#2850 `__:重写 pgr_nodeNetwork" + +#, fuzzy +#~ msgid "`#2861 `__ _pgr_iscolumnindexed(text,text,integer,text)" +#~ msgstr "`#2850 `__:重写 pgr_nodeNetwork" + +#, fuzzy +#~ msgid "`#2861 `__ _pgr_iscolumnindexed(text,text,text,integer,text)" +#~ msgstr "`#2786 `__:pgr_contraction(edges) 新签名" -#~ msgid "" -#~ "`#2682 `__: " -#~ "pgr_trspviavertices" -#~ msgstr "" -#~ "`#2682 `__: " -#~ "pgr_trspviavertices" +#, fuzzy +#~ msgid "`#2861 `__ _pgr_iscolumnintable(text,text)" +#~ msgstr "`#2681 `__: pgr_trspviaedges" #, fuzzy -#~ msgid "" -#~ "`#2748 `__ " -#~ "_pgr_alphashape(text,double precision)" -#~ msgstr "" -#~ "`#2748 `__: " -#~ "pgr_alphaShape" +#~ msgid "`#2899 `__ _pgr_maxcardinalitymatch(text,boolean)" +#~ msgstr "`#2683 `__: pgr_trsp" #, fuzzy -#~ msgid "" -#~ "`#2861 `__ " -#~ "_pgr_checkverttab(text,text[],integer,text)" -#~ msgstr "" -#~ "`#2827 `__: " -#~ "pgr_createVerticesTable" +#~ msgid "`#2861 `__ _pgr_startpoint(geometry)" +#~ msgstr "`#2681 `__: pgr_trspviaedges" #, fuzzy -#~ msgid "" -#~ "`#2861 `__ " -#~ "_pgr_createindex(text,text,text,integer,text)" -#~ msgstr "" -#~ "`#2786 `__:" -#~ "pgr_contraction(edges) 新签名" +#~ msgid "`#2682 `__ _pgr_trspviavertices(text,integer[],boolean,boolean,text)" +#~ msgstr "`#2682 `__: pgr_trspviavertices" #, fuzzy -#~ msgid "" -#~ "`#2861 `__ " -#~ "_pgr_createindex(text,text,text,text,integer,text)" -#~ msgstr "" -#~ "`#2786 `__:" -#~ "pgr_contraction(edges) 新签名" +#~ msgid "`#2919 `__ _pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +#~ msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" #, fuzzy -#~ msgid "" -#~ "`#2913 `__ " -#~ "_pgr_dagshortestpath(text,anyarray,anyarray,boolean,boolean)" -#~ msgstr "" -#~ "`#2683 `__: pgr_trsp" +#~ msgid "`#2919 `__ _pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +#~ msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" #, fuzzy -#~ msgid "" -#~ "`#2913 `__ " -#~ "_pgr_dagshortestpath(text,text,boolean,boolean)" -#~ msgstr "" -#~ "`#2683 `__: pgr_trsp" +#~ msgid "`#2919 `__ _pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" +#~ msgstr "`#2683 `__: pgr_trsp" #, fuzzy -#~ msgid "" -#~ "`#2730 `__ " -#~ "_pgr_dijkstranear(text,anyarray,anyarray,bigint,boolean)" -#~ msgstr "" -#~ "`#2798 `__: " -#~ "pgr_contraction" +#~ msgid "`#2901 `__ _pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +#~ msgstr "_pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" #, fuzzy -#~ msgid "" -#~ "`#2730 `__ " -#~ "_pgr_dijkstranear(text,anyarray,bigint,bigint,boolean)" -#~ msgstr "" -#~ "`#2798 `__: " -#~ "pgr_contraction" +#~ msgid "`#2861 `__ _pgr_versionless(text,text)" +#~ msgstr "`#2681 `__: pgr_trspviaedges" #, fuzzy -#~ msgid "" -#~ "`#2730 `__ " -#~ "_pgr_dijkstranear(text,bigint,anyarray,bigint,boolean)" -#~ msgstr "" -#~ "`#2798 `__: " -#~ "pgr_contraction" +#~ msgid "`#2890 `__ _pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +#~ msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" #, fuzzy -#~ msgid "" -#~ "`#2735 `__ " -#~ "_pgr_drivingdistance(text,anyarray,double precision,boolean,boolean)" -#~ msgstr "" -#~ "_pgr_drivingdistance(text,anyarray,double precision,boolean,boolean)" +#~ msgid "`#2895 `__ _pgr_withpointsksp(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean)" +#~ msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" #, fuzzy -#~ msgid "" -#~ "`#2861 `__ " -#~ "_pgr_endpoint(geometry)" -#~ msgstr "" -#~ "`#2850 `__:重写 " -#~ "pgr_nodeNetwork" +#~ msgid "`#2895 `__ _pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +#~ msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" #, fuzzy -#~ msgid "" -#~ "`#2861 `__ " -#~ "_pgr_getcolumnname(text,text,integer,text)" -#~ msgstr "" -#~ "`#2850 `__:重写 " -#~ "pgr_nodeNetwork" +#~ msgid "`#2895 `__ _pgr_withpointsksp(text,text,text,integer,character,boolean,boolean,boolean)" +#~ msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" #, fuzzy -#~ msgid "" -#~ "`#2861 `__ " -#~ "_pgr_getcolumnname(text,text,text,integer,text)" -#~ msgstr "" -#~ "`#2786 `__:" -#~ "pgr_contraction(edges) 新签名" +#~ msgid "`#2741 `__ _pgr_withpointsvia(text,bigint[],double precision[],boolean)" +#~ msgstr "`#2683 `__: pgr_trsp" #, fuzzy -#~ msgid "" -#~ "`#2861 `__ " -#~ "_pgr_getcolumntype(text,text,integer,text)" -#~ msgstr "" -#~ "`#2681 `__: " -#~ "pgr_trspviaedges" +#~ msgid "`#2741 `__ _pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +#~ msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" #, fuzzy -#~ msgid "" -#~ "`#2861 `__ " -#~ "_pgr_getcolumntype(text,text,text,integer,text)" -#~ msgstr "" -#~ "`#2681 `__: " -#~ "pgr_trspviaedges" +#~ msgid "`#2899 `__ pgr_maxcardinalitymatch(text,boolean)" +#~ msgstr "`#2683 `__: pgr_trsp" #, fuzzy -#~ msgid "" -#~ "`#2861 `__ " -#~ "_pgr_gettablename(text,integer,text)" -#~ msgstr "" -#~ "`#2850 `__:重写 " -#~ "pgr_nodeNetwork" +#~ msgid "`#2681 `__ pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +#~ msgstr "`#2681 `__: pgr_trspviaedges" #, fuzzy -#~ msgid "" -#~ "`#2861 `__ " -#~ "_pgr_iscolumnindexed(text,text,integer,text)" -#~ msgstr "" -#~ "`#2850 `__:重写 " -#~ "pgr_nodeNetwork" +#~ msgid "`#2682 `__ pgr_trspviavertices(text,anyarray,boolean,boolean,text)" +#~ msgstr "`#2682 `__: pgr_trspviavertices" #, fuzzy -#~ msgid "" -#~ "`#2861 `__ " -#~ "_pgr_iscolumnindexed(text,text,text,integer,text)" -#~ msgstr "" -#~ "`#2786 `__:" -#~ "pgr_contraction(edges) 新签名" - +#~ msgid "`#2919 `__ pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)" +#~ msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" + #, fuzzy -#~ msgid "" -#~ "`#2861 `__ " -#~ "_pgr_iscolumnintable(text,text)" -#~ msgstr "" -#~ "`#2681 `__: " -#~ "pgr_trspviaedges" - -#, fuzzy -#~ msgid "" -#~ "`#2899 `__ " -#~ "_pgr_maxcardinalitymatch(text,boolean)" -#~ msgstr "" -#~ "`#2683 `__: pgr_trsp" - -#, fuzzy -#~ msgid "" -#~ "`#2861 `__ " -#~ "_pgr_startpoint(geometry)" -#~ msgstr "" -#~ "`#2681 `__: " -#~ "pgr_trspviaedges" - -#, fuzzy -#~ msgid "" -#~ "`#2682 `__ " -#~ "_pgr_trspviavertices(text,integer[],boolean,boolean,text)" -#~ msgstr "" -#~ "`#2682 `__: " -#~ "pgr_trspviavertices" - -#, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "_pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean," -#~ "character,boolean)" -#~ msgstr "" -#~ "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," -#~ "boolean)``" - +#~ msgid "`#2919 `__ pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)" +#~ msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" + #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "_pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character," -#~ "boolean)" -#~ msgstr "" -#~ "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -#~ "boolean,boolean)" +#~ msgid "`#2919 `__ pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)" +#~ msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "_pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" -#~ msgstr "" -#~ "`#2683 `__: pgr_trsp" - -#, fuzzy -#~ msgid "" -#~ "`#2901 `__ " -#~ "_pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer," -#~ "integer,double precision,double precision,double precision,boolean)" -#~ msgstr "" -#~ "_pgr_trsp(text,integer,double precision,integer,double precision,boolean," -#~ "boolean,text)" - -#, fuzzy -#~ msgid "" -#~ "`#2861 `__ " -#~ "_pgr_versionless(text,text)" -#~ msgstr "" -#~ "`#2681 `__: " -#~ "pgr_trspviaedges" - -#, fuzzy -#~ msgid "" -#~ "`#2890 `__ " -#~ "_pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -#~ "boolean,boolean)" -#~ msgstr "" -#~ "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -#~ "boolean,boolean)" - -#, fuzzy -#~ msgid "" -#~ "`#2895 `__ " -#~ "_pgr_withpointsksp(text,text,anyarray,anyarray,integer,character,boolean," -#~ "boolean,boolean,boolean)" -#~ msgstr "" -#~ "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," -#~ "boolean)``" - -#, fuzzy -#~ msgid "" -#~ "`#2895 `__ " -#~ "_pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean," -#~ "character,boolean)" -#~ msgstr "" -#~ "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," -#~ "boolean)``" - -#, fuzzy -#~ msgid "" -#~ "`#2895 `__ " -#~ "_pgr_withpointsksp(text,text,text,integer,character,boolean,boolean," -#~ "boolean)" -#~ msgstr "" -#~ "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," -#~ "boolean)``" - -#, fuzzy -#~ msgid "" -#~ "`#2741 `__ " -#~ "_pgr_withpointsvia(text,bigint[],double precision[],boolean)" -#~ msgstr "" -#~ "`#2683 `__: pgr_trsp" - -#, fuzzy -#~ msgid "" -#~ "`#2741 `__ " -#~ "_pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character," -#~ "boolean)" -#~ msgstr "" -#~ "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -#~ "boolean,boolean)" - -#, fuzzy -#~ msgid "" -#~ "`#2899 `__ " -#~ "pgr_maxcardinalitymatch(text,boolean)" -#~ msgstr "" -#~ "`#2683 `__: pgr_trsp" - -#, fuzzy -#~ msgid "" -#~ "`#2681 `__ " -#~ "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" -#~ msgstr "" -#~ "`#2681 `__: " -#~ "pgr_trspviaedges" +#~ msgid "`#2919 `__ pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)" +#~ msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" -#, fuzzy -#~ msgid "" -#~ "`#2682 `__ " -#~ "pgr_trspviavertices(text,anyarray,boolean,boolean,text)" -#~ msgstr "" -#~ "`#2682 `__: " -#~ "pgr_trspviavertices" +#, fuzzy +#~ msgid "`#2919 `__ pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)" +#~ msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean," -#~ "character,boolean)" -#~ msgstr "" -#~ "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," -#~ "boolean)``" - -#, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character," -#~ "boolean)" -#~ msgstr "" -#~ "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -#~ "boolean,boolean)" - -#, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character," -#~ "boolean)" -#~ msgstr "" -#~ "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -#~ "boolean,boolean)" - -#, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character," -#~ "boolean)" -#~ msgstr "" -#~ "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," -#~ "boolean)``" - -#, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character," -#~ "boolean)" -#~ msgstr "" -#~ "pgr_withpointsdd(text,text,bigint,double precision,boolean,character," -#~ "boolean)" - -#, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" -#~ msgstr "" -#~ "`#2683 `__: pgr_trsp" +#~ msgid "`#2919 `__ pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)" +#~ msgstr "`#2683 `__: pgr_trsp" -#, fuzzy -#~ msgid "" -#~ "`#2901 `__ " -#~ "pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer," -#~ "integer,double precision,double precision,double precision,boolean)" -#~ msgstr "" -#~ "_pgr_trsp(text,integer,double precision,integer,double precision,boolean," -#~ "boolean,text)" +#, fuzzy +#~ msgid "`#2901 `__ pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)" +#~ msgstr "_pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_withpointscostmatrix(text,text,anyarray,boolean,character)" -#~ msgstr "" -#~ "`#2683 `__: pgr_trsp" +#~ msgid "`#2919 `__ pgr_withpointscostmatrix(text,text,anyarray,boolean,character)" +#~ msgstr "`#2683 `__: pgr_trsp" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_withpointscost(text,text,anyarray,anyarray,boolean,character)" -#~ msgstr "" -#~ "`#2683 `__: pgr_trsp" +#~ msgid "`#2919 `__ pgr_withpointscost(text,text,anyarray,anyarray,boolean,character)" +#~ msgstr "`#2683 `__: pgr_trsp" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_withpointscost(text,text,anyarray,bigint,boolean,character)" -#~ msgstr "" -#~ "`#2683 `__: pgr_trsp" +#~ msgid "`#2919 `__ pgr_withpointscost(text,text,anyarray,bigint,boolean,character)" +#~ msgstr "`#2683 `__: pgr_trsp" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_withpointscost(text,text,bigint,anyarray,boolean,character)" -#~ msgstr "" -#~ "`#2683 `__: pgr_trsp" +#~ msgid "`#2919 `__ pgr_withpointscost(text,text,bigint,anyarray,boolean,character)" +#~ msgstr "`#2683 `__: pgr_trsp" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_withpointscost(text,text,bigint,bigint,boolean,character)" -#~ msgstr "" -#~ "`#2683 `__: pgr_trsp" +#~ msgid "`#2919 `__ pgr_withpointscost(text,text,bigint,bigint,boolean,character)" +#~ msgstr "`#2683 `__: pgr_trsp" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_withpointscost(text,text,text,boolean,character)" -#~ msgstr "" -#~ "`#2683 `__: pgr_trsp" +#~ msgid "`#2919 `__ pgr_withpointscost(text,text,text,boolean,character)" +#~ msgstr "`#2683 `__: pgr_trsp" #, fuzzy -#~ msgid "" -#~ "`#2890 `__ " -#~ "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -#~ "boolean,boolean)" -#~ msgstr "" -#~ "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -#~ "boolean,boolean)" +#~ msgid "`#2890 `__ pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" +#~ msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" #, fuzzy -#~ msgid "" -#~ "`#2890 `__ " -#~ "pgr_withpointsdd(text,text,bigint,double precision,boolean,character," -#~ "boolean)" -#~ msgstr "" -#~ "pgr_withpointsdd(text,text,bigint,double precision,boolean,character," -#~ "boolean)" +#~ msgid "`#2890 `__ pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" +#~ msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" #, fuzzy -#~ msgid "" -#~ "`#2895 `__ " -#~ "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean," -#~ "character,boolean)" -#~ msgstr "" -#~ "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," -#~ "boolean)``" +#~ msgid "`#2895 `__ pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)" +#~ msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_withpoints(text,text,anyarray,anyarray,boolean,character,boolean)" -#~ msgstr "" -#~ "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -#~ "boolean,boolean)" +#~ msgid "`#2919 `__ pgr_withpoints(text,text,anyarray,anyarray,boolean,character,boolean)" +#~ msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)" -#~ msgstr "" -#~ "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -#~ "boolean,boolean)" +#~ msgid "`#2919 `__ pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)" +#~ msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_withpoints(text,text,bigint,anyarray,boolean,character,boolean)" -#~ msgstr "" -#~ "pgr_withpointsdd(text,text,bigint,double precision,boolean,character," -#~ "boolean)" +#~ msgid "`#2919 `__ pgr_withpoints(text,text,bigint,anyarray,boolean,character,boolean)" +#~ msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_withpoints(text,text,bigint,bigint,boolean,character,boolean)" -#~ msgstr "" -#~ "pgr_withpointsdd(text,text,bigint,double precision,boolean,character," -#~ "boolean)" +#~ msgid "`#2919 `__ pgr_withpoints(text,text,bigint,bigint,boolean,character,boolean)" +#~ msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_withpoints(text,text,text,boolean,character,boolean)" -#~ msgstr "" -#~ "`#2683 `__: pgr_trsp" +#~ msgid "`#2919 `__ pgr_withpoints(text,text,text,boolean,character,boolean)" +#~ msgstr "`#2683 `__: pgr_trsp" #, fuzzy -#~ msgid "" -#~ "`#2919 `__ " -#~ "pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character," -#~ "boolean)" -#~ msgstr "" -#~ "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -#~ "boolean,boolean)" +#~ msgid "`#2919 `__ pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)" +#~ msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" #, fuzzy #~ msgid "_pgr_drivingdistance => _pgr_drivingdistancev4" @@ -22190,38 +17111,23 @@ msgstr "pgr_withPointsvia 是 pgr_dijkstraVia **with points** 的版本" #~ msgstr "pgr_withPointsvia 是 pgr_dijkstraVia **with points** 的版本" #, fuzzy -#~ msgid "" -#~ "`#2748 `__ " -#~ "_pgr_alphashape" -#~ msgstr "" -#~ "`#2748 `__: " -#~ "pgr_alphaShape" +#~ msgid "`#2748 `__ _pgr_alphashape" +#~ msgstr "`#2748 `__: pgr_alphaShape" #, fuzzy -#~ msgid "" -#~ "`#2913 `__ " -#~ "_pgr_dagshortestpath" -#~ msgstr "" -#~ "`#2683 `__: pgr_trsp" +#~ msgid "`#2913 `__ _pgr_dagshortestpath" +#~ msgstr "`#2683 `__: pgr_trsp" -#~ msgid "" -#~ "The ``pgr_aStarCost`` function summarizes of the cost of the shortest " -#~ "path using the A* algorithm." +#~ msgid "The ``pgr_aStarCost`` function summarizes of the cost of the shortest path using the A* algorithm." #~ msgstr "``pgr_aStarCost`` 函数通过 A* 算法汇总最短路径的成本。" -#~ msgid "" -#~ "The results are equivalent to the union of the results of the " -#~ "pgr_bdAStar(One to One) on the:" +#~ msgid "The results are equivalent to the union of the results of the pgr_bdAStar(One to One) on the:" #~ msgstr "结果等效于以下情形中 pgr_bdAStar(One to One) 结果的并集：" -#~ msgid "" -#~ "The ``pgr_bdAstarCost`` function summarizes of the cost of the shortest " -#~ "path using the bidirectional A* algorithm." +#~ msgid "The ``pgr_bdAstarCost`` function summarizes of the cost of the shortest path using the bidirectional A* algorithm." #~ msgstr "``pgr_bdAstarCost`` 函数通过双向 A* 算法汇总最短路径的成本。" -#~ msgid "" -#~ "``pgr_bdAstarCostMatrix`` - Calculates the a cost matrix using :doc:" -#~ "`pgr_aStar`." +#~ msgid "``pgr_bdAstarCostMatrix`` - Calculates the a cost matrix using :doc:`pgr_aStar`." #~ msgstr "``pgr_bdAstarCostMatrix`` - 使用 :doc:`pgr_aStar` 计算成本矩阵。" #~ msgid "Using internally the :doc:`pgr_bdAstar` algorithm" @@ -22230,28 +17136,12 @@ msgstr "pgr_withPointsvia 是 pgr_dijkstraVia **with points** 的版本" #~ msgid "Signature change on pgr_bdDijsktra(One to One)" #~ msgstr "函数的签名变更 pgr_bdDijsktra(One to One)" -#~ msgid "" -#~ "The ``pgr_bdDijkstraCost`` function summarizes of the cost of the " -#~ "shortest path using the bidirectional Dijkstra Algorithm." -#~ msgstr "" -#~ "``pgr_bdDijkstraCost`` 函数通过双向 Dijkstra 算法汇总最短路径的成本值。" - -#, fuzzy -#~ msgid "" -#~ "It is well-known that the shortest paths between a single source and all " -#~ "other vertices can be found using Breadth First Search in :math:`O(|E|)` " -#~ "in an unweighted graph, i.e. the distance is the minimal number of edges " -#~ "that you need to traverse from the source to another vertex. We can " -#~ "interpret such a graph also as a weighted graph, where every edge has the " -#~ "weight :math:`1`. If not all edges in graph have the same weight, 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 "The ``pgr_bdDijkstraCost`` function summarizes of the cost of the shortest path using the bidirectional Dijkstra Algorithm." +#~ msgstr "``pgr_bdDijkstraCost`` 函数通过双向 Dijkstra 算法汇总最短路径的成本值。" + +#, fuzzy +#~ msgid "It is well-known that the shortest paths between a single source and all other vertices can be found using Breadth First Search in :math:`O(|E|)` in an unweighted graph, i.e. the distance is the minimal number of edges that you need to traverse from the source to another vertex. We can interpret such a graph also as a weighted graph, where every edge has the weight :math:`1`. If not all edges in graph have the same weight, 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||)`。" #, fuzzy #~ msgid "New experimental function" @@ -22267,24 +17157,18 @@ msgstr "pgr_withPointsvia 是 pgr_dijkstraVia **with points** 的版本" #~ msgid "``pgr_dijkstraNearCost`` - Proposed" #~ msgstr "``pgr_dijkstraNearCost`` - 提议中" -#~ msgid "" -#~ "Boost `floyd-Warshall `_" -#~ msgstr "" -#~ "Boost `弗洛伊德-沃沙尔算法 `_" +#~ msgid "Boost `floyd-Warshall `_" +#~ msgstr "Boost `弗洛伊德-沃沙尔算法 `_" #, fuzzy -#~ msgid "" -#~ "``pgr_kingOrdering`` — Returns the King ordering of an undirected graphs" +#~ msgid "``pgr_kingOrdering`` — Returns the King ordering of an undirected graphs" #~ msgstr "``pgr_cuthillMckeeOrdering`` — 返回无向图的反向 Cuthill-Mckee 排序" #~ msgid "|boost| graph inside." #~ msgstr "|boost| 图内。" #, fuzzy -#~ msgid "" -#~ "``pgr_sloanOrdering`` — Returns the sloan ordering of an undirected graph" +#~ msgid "``pgr_sloanOrdering`` — Returns the sloan ordering of an undirected graph" #~ msgstr "``pgr_cuthillMckeeOrdering`` — 返回无向图的反向 Cuthill-Mckee 排序" #, fuzzy @@ -22313,40 +17197,20 @@ msgstr "pgr_withPointsvia 是 pgr_dijkstraVia **with points** 的版本" #~ msgid "[``l``, ``L``] for left driving side (for directed graph only)" #~ msgstr "[``l``, ``L``]表示左侧驾驶（仅适用有向图）" -#~ msgid "" -#~ "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -#~ "**start vid**, **end vid**, [**options**])" -#~ msgstr "" -#~ "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -#~ "**start vid**, **end vid**, [**options**])" - -#~ msgid "" -#~ "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -#~ "**start vid**, **end vids**, [**options**])" -#~ msgstr "" -#~ "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -#~ "**start vid**, **end vids**, [**options**])" - -#~ msgid "" -#~ "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -#~ "**start vids**, **end vid**, [**options**])" -#~ msgstr "" -#~ "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -#~ "**start vids**, **end vid**, [**options**])" - -#~ msgid "" -#~ "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -#~ "**start vids**, **end vids**, [**options**])" -#~ msgstr "" -#~ "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, " -#~ "**start vids**, **end vids**, [**options**])" - -#~ msgid "" -#~ "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Combinations " -#~ "SQL`_, `Points SQL`_, [**options**])" -#~ msgstr "" -#~ "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Combinations " -#~ "SQL`_, `Points SQL`_, [**options**])" +#~ msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vid**, [**options**])" +#~ msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vid**, [**options**])" + +#~ msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**options**])" +#~ msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**options**])" + +#~ msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vid**, [**options**])" +#~ msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vid**, [**options**])" + +#~ msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vids**, [**options**])" +#~ msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vids**, [**options**])" + +#~ msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, `Points SQL`_, [**options**])" +#~ msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, `Points SQL`_, [**options**])" #~ msgid "**options:** ``[directed, driving_side, details]``" #~ msgstr "**options:** ``[directed, driving_side, details]``"