diff --git a/locale/de/LC_MESSAGES/pgrouting_doc_strings.po b/locale/de/LC_MESSAGES/pgrouting_doc_strings.po index 9949fba057c..d8167d70d24 100644 --- a/locale/de/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/de/LC_MESSAGES/pgrouting_doc_strings.po @@ -6,7 +6,7 @@ msgid "" msgstr "" "Project-Id-Version: pgRouting v4.0\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2025-01-10 14:53+0000\n" +"POT-Creation-Date: 2025-02-12 01:00+0000\n" "PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n" "Last-Translator: Automatically generated\n" "Language-Team: none\n" @@ -652,8 +652,8 @@ msgid "References" msgstr "" msgid "" -"`Boost's metric appro's metric approximation `__" +"`Boost: metric TSP approx `__" msgstr "" msgid "`University of Waterloo TSP `__" @@ -1613,7 +1613,7 @@ msgstr "" msgid "https://en.wikipedia.org/wiki/Vehicle_routing_problem" msgstr "" -msgid "The queries use the :doc:`sampledata` network." +msgid ":doc:`sampledata`" msgstr "" msgid "A* - Family of functions" @@ -1775,7 +1775,8 @@ msgstr "" msgid ":doc:`bdAstar-family`" msgstr "" -msgid "https://www.boost.org/libs/graph/doc/astar_search.html" +msgid "" +"`Boost: A* search `__" msgstr "" msgid "https://en.wikipedia.org/wiki/A*_search_algorithm" @@ -2579,7 +2580,7 @@ msgid "" "ending vertex:" msgstr "" -msgid "It is expected to terminate faster than pgr_astar" +msgid "It is expected to terminate faster than pgr_aStar" msgstr "" msgid ":doc:`aStar-family`" @@ -2726,27 +2727,7 @@ msgid "Identifier of the color of the edge." msgstr "" msgid "" -"`Boost: Sequential Vertex Coloring algorithm documentation `__" -msgstr "" - -msgid "" -"`Wikipedia: Graph coloring `__" -msgstr "" - -msgid "" -"`Boost: is_bipartite `__" -msgstr "" - -msgid "" -"`Wikipedia: bipartite graph `__" -msgstr "" - -msgid "" -"`Boost: Edge Coloring Algorithm documentation `__" +"`Boost: `__" msgstr "" msgid "Components - Family of functions" @@ -3294,9 +3275,6 @@ msgstr "" msgid "Now, the routing graph has an edge connecting with node :math:`7`." msgstr "" -msgid ":doc:`sampledata`" -msgstr "" - msgid "" "https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/" "lecture16.pdf" @@ -4383,31 +4361,180 @@ msgstr "" msgid "pgRouting 4.0.0 Release Notes" msgstr "" -msgid "Removal of deprecated functions and signatures" +msgid "" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 4.0.0 `__" +msgstr "" + +msgid "Functions promoted to official" +msgstr "" + +msgid "pgr_trsp" +msgstr "" + +msgid "pgr_trspVia" +msgstr "" + +msgid "pgr_trspVia_withPoints" +msgstr "" + +msgid "pgr_trsp_withPoints" +msgstr "" + +msgid "pgr_withPoints" +msgstr "" + +msgid "pgr_withPointsCost" +msgstr "" + +msgid "pgr_withPointsCostMatrix" +msgstr "" + +msgid "pgr_withPointsDD" +msgstr "" + +msgid "pgr_withPointsKSP" +msgstr "" + +msgid "pgr_withPointsVia" +msgstr "" + +msgid "Signatures promoted to official" +msgstr "" + +msgid "pgr_aStar(Combinations)" +msgstr "" + +msgid "pgr_aStarCost(Combinations)" +msgstr "" + +msgid "pgr_bdAstar(Combinations)" +msgstr "" + +msgid "pgr_bdAstarCost(Combinations)" +msgstr "" + +msgid "pgr_bdDijkstra(Combinations)" +msgstr "" + +msgid "pgr_bdDijkstraCost(Combinations)" +msgstr "" + +msgid "pgr_dijkstra(Combinations)" +msgstr "" + +msgid "pgr_dijkstraCost(Combinations)" +msgstr "" + +msgid "pgr_KSP(All signatures)" +msgstr "" + +msgid "pgr_boykovKolmogorov(Combinations)" +msgstr "" + +msgid "pgr_edmondsKarp(Combinations)" +msgstr "" + +msgid "pgr_maxFlow(Combinations)" +msgstr "" + +msgid "pgr_pushRelabel(Combinations)" +msgstr "" + +msgid "code enhancements:" +msgstr "" + +msgid "Removal of unused C/C++ code" +msgstr "" + +msgid "Removal of SQL deprecated functions" msgstr "" msgid "" -"``pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)``" +"pgr_trsp(text,integer,double precision,integer,double precision,boolean," +"boolean,text)" msgstr "" -msgid "``pgr_trspviavertices(text,anyarray,boolean,boolean,text)``" +msgid "pgr_trsp(text,integer,integer,boolean,boolean,text)" msgstr "" msgid "" -"``pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean,text)``" +"pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" msgstr "" -msgid "``pgr_trsp(text,integer,integer,boolean,boolean,text)``" +msgid "pgr_trspviavertices(text,anyarray,boolean,boolean,text)" msgstr "" -msgid "All releases" +msgid "Removal of SQL deprecated internal functions" msgstr "" -msgid "Kruskal - Family of functions" +msgid "_pgr_dijkstranear(text,anyarray,anyarray,bigint,boolean)" msgstr "" -msgid "Boost Graph Inside" +msgid "_pgr_dijkstranear(text,anyarray,bigint,bigint,boolean)" +msgstr "" + +msgid "_pgr_dijkstranear(text,bigint,anyarray,bigint,boolean)" +msgstr "" + +msgid "_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" +msgstr "" + +msgid "_pgr_dijkstra(text,text,boolean,boolean,boolean)" +msgstr "" + +msgid "_pgr_drivingdistance(text,anyarray,double precision,boolean,boolean)" +msgstr "" + +msgid "_pgr_kruskal(text,anyarray,text,bigint,double precision)" +msgstr "" + +msgid "_pgr_prim(text,anyarray,text,bigint,double precision)" +msgstr "" + +msgid "" +"_pgr_trsp(text,integer,double precision,integer,double precision,boolean," +"boolean,text)" +msgstr "" + +msgid "_pgr_trsp(text,text,anyarray,anyarray,boolean)" +msgstr "" + +msgid "_pgr_trsp(text,text,anyarray,bigint,boolean)" +msgstr "" + +msgid "_pgr_trsp(text,text,bigint,anyarray,boolean)" +msgstr "" + +msgid "_pgr_trsp(text,text,bigint,bigint,boolean)" +msgstr "" + +msgid "_pgr_trspviavertices(text,integer[],boolean,boolean,text)" +msgstr "" + +msgid "_pgr_withpointsvia(text,bigint[],double precision[],boolean)" +msgstr "" + +msgid "_trsp(text,text,anyarray,anyarray,boolean)" +msgstr "" + +msgid "_v4trsp(text,text,anyarray,anyarray,boolean)" +msgstr "" + +msgid "_v4trsp(text,text,text,boolean)" +msgstr "" + +msgid "Deprecation of internal C/C++ functions" +msgstr "" + +msgid "Internal C/C++ functions in legacy" +msgstr "" + +msgid "All releases" +msgstr "" + +msgid "Kruskal - Family of functions" msgstr "" msgid "" @@ -4594,7 +4721,7 @@ msgstr "" msgid "If needed add the new columns, for example:" msgstr "" -msgid "Migration of ``pgr_drivingdistance``" +msgid "Migration of ``pgr_drivingDistance``" msgstr "" msgid "" @@ -4614,10 +4741,10 @@ msgstr "" msgid "|result-spantree|" msgstr "" -msgid "``pgr_drivingdistance`` (Single vertex)" +msgid "pgr_drivingDistance(Single vertex)" msgstr "" -msgid "``pgr_drivingdistance`` (Multiple vertices)" +msgid "pgr_drivingDistance(Multiple vertices)" msgstr "" msgid "Output columns were |result-dij-dd|" @@ -5064,9 +5191,6 @@ msgstr "" msgid "`v4.0.0 `__" msgstr "" -msgid "See also" -msgstr "" - msgid ":doc:`pgr_dijkstra`" msgstr "" @@ -5109,7 +5233,7 @@ msgstr "" msgid "Use ``pgr_withPoints`` when there are no restrictions." msgstr "" -msgid "Use :doc:`pgr_withPoints` (Ont to One) instead." +msgid "Use :doc:`pgr_withPoints` (One to One) instead." msgstr "" msgid "Use ``pgr_trsp_withPoints`` when there are restrictions." @@ -7269,7 +7393,7 @@ msgstr "" msgid ":doc:`migration`" msgstr "" -msgid "pgr_KSP" +msgid "``pgr_KSP``" msgstr "" msgid "``pgr_KSP`` — Yen's algorithm for K shortest paths using Dijkstra." @@ -7278,31 +7402,37 @@ msgstr "" msgid "Availability" msgstr "" +msgid "Version 4.0.0" +msgstr "" + +msgid "All signatures promoted to official." +msgstr "" + msgid "Version 3.6.0" msgstr "" msgid "Result columns standarized to: |nksp-result|" msgstr "" -msgid "``pgr_ksp`` (One to One)" +msgid "pgr_ksp(One to One)" msgstr "" msgid "Added ``start_vid`` and ``end_vid`` result columns." msgstr "" -msgid "New overload functions:" +msgid "New proposed signatures:" msgstr "" -msgid "``pgr_ksp`` (One to Many)" +msgid "pgr_ksp(One to Many)" msgstr "" -msgid "``pgr_ksp`` (Many to One)" +msgid "pgr_ksp(Many to One)" msgstr "" -msgid "``pgr_ksp`` (Many to Many)" +msgid "pgr_ksp(Many to Many)" msgstr "" -msgid "``pgr_ksp`` (Combinations)" +msgid "pgr_ksp(Combinations)" msgstr "" msgid "Version 2.1.0" @@ -7317,7 +7447,7 @@ msgstr "" msgid "Version 2.0.0" msgstr "" -msgid "**Official** function" +msgid "Official function." msgstr "" msgid "" @@ -7325,6 +7455,12 @@ msgid "" "number of shortest paths desired." msgstr "" +msgid "|Boost| Boost Graph Inside" +msgstr "" + +msgid "Boost Graph Inside" +msgstr "" + msgid "Signatures" msgstr "" @@ -7669,6 +7805,11 @@ msgstr "" msgid "``pgr_TSPeuclidean`` - Aproximation using *metric* algorithm." msgstr "" +msgid "" +"Using `Boost: metric TSP approx `__" +msgstr "" + msgid "" "The Simulated Annealing Algorithm related parameters are ignored: " "`max_processing_time`, `tries_per_temperature`, " @@ -7682,7 +7823,7 @@ msgstr "" msgid "Name change from pgr_eucledianTSP" msgstr "" -msgid "New **Official** function" +msgid "New official function." msgstr "" msgid "" @@ -7763,56 +7904,49 @@ msgid "" "obtained with ``pgr_TSPeuclidean``." msgstr "" -msgid ":doc:`sampledata` network." -msgstr "" - msgid "``pgr_aStar``" msgstr "" msgid "``pgr_aStar`` — Shortest path using the A* algorithm." msgstr "" +msgid "Combinations signature promoted to official." +msgstr "" + msgid "Standarizing output columns to |short-generic-result|" msgstr "" -msgid "" -"``pgr_aStar`` (`One to One`_) added ``start_vid`` and ``end_vid`` columns." +msgid "pgr_aStar(One to One) added ``start_vid`` and ``end_vid`` columns." msgstr "" -msgid "``pgr_aStar`` (`One to Many`_) added ``end_vid`` column." +msgid "pgr_aStar(One to Many) added ``end_vid`` column." msgstr "" -msgid "``pgr_aStar`` (`Many to One`_) added ``start_vid`` column." +msgid "pgr_aStar(Many to One) added ``start_vid`` column." msgstr "" msgid "Version 3.2.0" msgstr "" -msgid "New **proposed** signature:" +msgid "New proposed signature:" msgstr "" -msgid "``pgr_aStar`` (`Combinations`_)" +msgid "Function promoted to official." msgstr "" msgid "Version 2.4.0" msgstr "" -msgid "New **Proposed** signatures:" -msgstr "" - -msgid "``pgr_aStar`` (`One to Many`_)" -msgstr "" - -msgid "``pgr_aStar`` (`Many to One`_)" +msgid "pgr_aStar(One to Many)" msgstr "" -msgid "``pgr_aStar`` (`Many to Many`_)" +msgid "pgr_aStar(Many to One)" msgstr "" -msgid "Signature change on ``pgr_astar`` (`One to One`_)" +msgid "pgr_aStar(Many to Many)" msgstr "" -msgid "**Official** ``pgr_aStar`` (`One to One`_)" +msgid "Signature change on pgr_aStar(One to One)" msgstr "" msgid "" @@ -7886,17 +8020,14 @@ msgstr "" msgid "Manually assigned vertex combinations." msgstr "" -msgid "pgr_aStarCost" +msgid "``pgr_aStarCost``" msgstr "" msgid "" "``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." msgstr "" -msgid "``pgr_aStarCost`` (`Combinations`_)" -msgstr "" - -msgid "New **proposed** function" +msgid "New proposed function." msgstr "" msgid "" @@ -8091,7 +8222,7 @@ msgstr "" msgid "`ST_ConcaveHull `__" msgstr "" -msgid "pgr_analyzeGraph" +msgid "``pgr_analyzeGraph``" msgstr "" msgid "``pgr_analyzeGraph`` — Analyzes the network topology." @@ -8353,9 +8484,6 @@ msgid "" "table ``othertable``. (note the use of quote_literal)" msgstr "" -msgid "The examples use the :doc:`sampledata` network." -msgstr "" - msgid ":doc:`pgr_analyzeOneWay`" msgstr "" @@ -8365,7 +8493,7 @@ msgstr "" msgid ":doc:`pgr_nodeNetwork` to create nodes to a not noded edge table." msgstr "" -msgid "pgr_analyzeOneWay" +msgid "``pgr_analyzeOneWay``" msgstr "" msgid "" @@ -8517,7 +8645,7 @@ msgstr "" msgid "Version 2.5.0" msgstr "" -msgid "New **experimental** function" +msgid "New experimental function." msgstr "" msgid "" @@ -8549,7 +8677,7 @@ msgid "Nodes in red are the articulation points." msgstr "" msgid "" -"Boost: `Biconnected components & articulation points `__" msgstr "" @@ -8564,37 +8692,30 @@ msgstr "" msgid "``pgr_bdAstar`` — Shortest path using the bidirectional A* algorithm." msgstr "" -msgid "" -"``pgr_bdAstar`` (`One to One`_) added ``start_vid`` and ``end_vid`` columns." -msgstr "" - -msgid "``pgr_bdAstar`` (`One to Many`_) added ``end_vid`` column." +msgid "pgr_bdAstar(One to One) added ``start_vid`` and ``end_vid`` columns." msgstr "" -msgid "``pgr_bdAstar`` (`Many to One`_) added ``start_vid`` column." +msgid "pgr_bdAstar(One to Many) added ``end_vid`` column." msgstr "" -msgid "``pgr_bdAstar`` (`Combinations`_)" +msgid "pgr_bdAstar(Many to One) added ``start_vid`` column." msgstr "" -msgid "``pgr_bdAstar`` (`One to Many`_)" +msgid "pgr_bdAstar(One to Many)" msgstr "" -msgid "``pgr_bdAstar`` (`Many to One`_)" +msgid "pgr_bdAstar(Many to One)" msgstr "" -msgid "``pgr_bdAstar`` (`Many to Many`_)" +msgid "pgr_bdAstar(Many to Many)" msgstr "" -msgid "Signature change on ``pgr_bdAstar`` (`One to One`_)" -msgstr "" - -msgid "**Official** ``pgr_bdAstar`` (`One to One`_)" +msgid "Signature change on pgr_bdAstar(One to One)" msgstr "" msgid "" -"The results are equivalent to the union of the results of the `pgr_bdAStar(` " -"`One to One`_ `)` on the:" +"The results are equivalent to the union of the results of the " +"pgr_bdAStar(One to One) on the:" msgstr "" msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" @@ -8612,7 +8733,7 @@ msgstr "" msgid "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" -msgid "pgr_bdAstarCost" +msgid "``pgr_bdAstarCost``" msgstr "" msgid "" @@ -8620,9 +8741,6 @@ msgid "" "bidirectional A* algorithm." msgstr "" -msgid "``pgr_bdAstarCost`` (`Combinations`_)" -msgstr "" - msgid "" "The ``pgr_bdAstarCost`` function sumarizes of the cost of the shortest path " "using the bidirectional A* algorithm." @@ -8669,25 +8787,16 @@ msgid "" "algorithm." msgstr "" -msgid "pgr_bdDijkstra(`Combinations`_)" -msgstr "" - -msgid "New **Proposed** functions:" -msgstr "" - -msgid "``pgr_bdDijkstra`` (`One to Many`_)" -msgstr "" - -msgid "``pgr_bdDijkstra`` (`Many to One`_)" +msgid "pgr_bdDijkstra(One to Many)" msgstr "" -msgid "``pgr_bdDijkstra`` (`Many to Many`_)" +msgid "pgr_bdDijkstra(Many to One)" msgstr "" -msgid "Signature change on ``pgr_bdDijsktra`` (`One to One`_)" +msgid "pgr_bdDijkstra(Many to Many)" msgstr "" -msgid "**Official** ``pgr_bdDijkstra`` (`One to One`_)" +msgid "Signature change on pgr_bdDijsktra(One to One)" msgstr "" msgid "" @@ -8741,11 +8850,6 @@ msgstr "" msgid "Using a combinations table on an **undirected** graph" msgstr "" -msgid "" -"https://www.cs.princeton.edu/courses/archive/spr06/cos423/Handouts/" -"EPP%20shortest%20path%20algorithms.pdf" -msgstr "" - msgid "https://en.wikipedia.org/wiki/Bidirectional_search" msgstr "" @@ -8757,9 +8861,6 @@ msgid "" "Bidirectional Dijkstra algorithm." msgstr "" -msgid "``pgr_bdDijkstraCost`` (`Combinations`_)" -msgstr "" - msgid "" "The ``pgr_bdDijkstraCost`` function sumarizes of the cost of the shortest " "path using the bidirectional Dijkstra Algorithm." @@ -8818,25 +8919,10 @@ msgstr "" msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm." msgstr "" -msgid "New **experimental** signature:" -msgstr "" - -msgid "``pgr_bellmanFord`` (`Combinations`_)" -msgstr "" - -msgid "New **experimental** signatures:" +msgid "New experimental signature:" msgstr "" -msgid "``pgr_bellmanFord`` (`One to One`_)" -msgstr "" - -msgid "``pgr_bellmanFord`` (`One to Many`_)" -msgstr "" - -msgid "``pgr_bellmanFord`` (`Many to One`_)" -msgstr "" - -msgid "``pgr_bellmanFord`` (`Many to Many`_)" +msgid "pgr_bellmanFord(Combinations)" msgstr "" msgid "" @@ -8911,23 +8997,25 @@ msgstr "" msgid "Using a combinations table on an **undirected** graph." msgstr "" +msgid "" +"`Boost: Bellman Ford `__" +msgstr "" + msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" msgstr "" -msgid "``pgr_betweennessCentrality``" +msgid "``pgr_betweennessCentrality`` - Experimental" msgstr "" msgid "" -"``pgr_betweennessCentrality`` - Calculates the relative betweeness " +"``pgr_betweennessCentrality`` - Calculates the relative betweenness " "centrality using Brandes Algorithm" msgstr "" msgid "Version 3.7.0" msgstr "" -msgid "New **experimental** function:" -msgstr "" - msgid "" "The Brandes Algorithm takes advantage of the sparse graphs for evaluating " "the betweenness centrality score of all vertices." @@ -8997,11 +9085,8 @@ msgid "" msgstr "" msgid "" -"Boost's `betweenness_centrality `_" -msgstr "" - -msgid "Queries use the :doc:`sampledata` network." +"`Boost: betweenness centrality `_" msgstr "" msgid "``pgr_biconnectedComponents``" @@ -9060,11 +9145,6 @@ msgstr "" msgid "Identifier of the edge that belongs to the ``component``." msgstr "" -msgid "" -"Boost: `Biconnected components `__" -msgstr "" - msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" msgstr "" @@ -9078,19 +9158,7 @@ msgid "" "negative integer, is termed as a 'binary graph'." msgstr "" -msgid "pgr_binaryBreadthFirstSearch(`Combinations`_)" -msgstr "" - -msgid "pgr_binaryBreadthFirstSearch(`One to One`_)" -msgstr "" - -msgid "pgr_binaryBreadthFirstSearch(`One to Many`_)" -msgstr "" - -msgid "pgr_binaryBreadthFirstSearch(`Many to One`_)" -msgstr "" - -msgid "pgr_binaryBreadthFirstSearch(`Many to Many`_)" +msgid "pgr_binaryBreadthFirstSearch(Combinations)" msgstr "" msgid "" @@ -9152,6 +9220,11 @@ msgid "" "math:`1``)" msgstr "" +msgid "" +"`Boost: Breadth First Search `__" +msgstr "" + msgid "https://cp-algorithms.com/graph/01_bfs.html" msgstr "" @@ -9159,7 +9232,7 @@ msgid "" "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" msgstr "" -msgid "pgr_bipartite -Experimental" +msgid "``pgr_bipartite`` - Experimental" msgstr "" msgid "" @@ -9167,9 +9240,6 @@ msgid "" "within the same set are adjacent." msgstr "" -msgid "New **experimental** signature" -msgstr "" - msgid "" "A bipartite graph is a graph with two sets of vertices which are connected " "to each other, but not within themselves. A bipartite graph is possible if " @@ -9216,28 +9286,29 @@ msgstr "" msgid "Edges in blue represent odd length cycle subgraph." msgstr "" -msgid "``pgr_boykovKolmogorov``" +msgid "" +"`Boost: is_bipartite `__" 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." +"`Wikipedia: bipartite graph `__" msgstr "" -msgid "New **proposed** signature" +msgid "``pgr_boykovKolmogorov``" msgstr "" -msgid "``pgr_boykovKolmogorov`` (`Combinations`_)" +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 "Renamed from ``pgr_maxFlowBoykovKolmogorov``" msgstr "" -msgid "**Proposed** function" -msgstr "" - -msgid "New **Experimental** function" +msgid "Function promoted to proposed." msgstr "" msgid "Running time: Polynomial" @@ -9279,7 +9350,9 @@ msgid "" "math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`." msgstr "" -msgid "https://www.boost.org/libs/graph/doc/boykov_kolmogorov_max_flow.html" +msgid "" +"`Boost: Boykov Kolmogorov max flow `__" msgstr "" msgid "``pgr_breadthFirstSearch`` - Experimental" @@ -9290,12 +9363,6 @@ msgid "" "First Search algorithm." msgstr "" -msgid "``pgr_breadthFirstSearch`` (`Single Vertex`_)" -msgstr "" - -msgid "``pgr_breadthFirstSearch`` (`Multiple Vertices`_)" -msgstr "" - msgid "" "Provides the Breadth First Search traversal order from a root vertex to a " "particular depth." @@ -9360,11 +9427,6 @@ msgstr "" msgid "descending" msgstr "" -msgid "" -"`Boost: Breadth First Search algorithm documentation `__" -msgstr "" - msgid "" "`Wikipedia: Breadth First Search algorithm `__" @@ -9403,7 +9465,9 @@ msgstr "" msgid "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" msgstr "" -msgid "**Supported versions**" +msgid "" +"`Boost: Connected components `__" msgstr "" msgid "``pgr_chinesePostman`` - Experimental" @@ -9461,7 +9525,7 @@ msgstr "" msgid "Minimum costs of a circuit path." msgstr "" -msgid "pgr_connectedComponents" +msgid "``pgr_connectedComponents``" msgstr "" msgid "" @@ -9498,11 +9562,6 @@ msgstr "" msgid "Connecting disconnected components" msgstr "" -msgid "" -"Boost: `Connected components `__" -msgstr "" - msgid "" "wikipedia: `Connected component `__" @@ -9677,7 +9736,7 @@ msgstr "" msgid "Only linear contraction" msgstr "" -msgid "pgr_createTopology" +msgid "``pgr_createTopology``" msgstr "" msgid "" @@ -9880,10 +9939,7 @@ msgid "" "to the rest of the edges." msgstr "" -msgid "The example uses the :doc:`sampledata` network." -msgstr "" - -msgid "pgr_createVerticesTable" +msgid "``pgr_createVerticesTable``" msgstr "" msgid "" @@ -10099,7 +10155,7 @@ msgid "" "Cuthill%E2%80%93McKee_algorithm>`__" msgstr "" -msgid "pgr_dagShortestPath - Experimental" +msgid "``pgr_dagShortestPath`` - Experimental" msgstr "" msgid "" @@ -10178,6 +10234,11 @@ msgstr "" msgid "Making **start_vids** the same as **end_vids**" msgstr "" +msgid "" +"`Boost: DAG shortest paths `__" +msgstr "" + msgid "https://en.wikipedia.org/wiki/Topological_sorting" msgstr "" @@ -10296,15 +10357,6 @@ msgstr "" msgid "Version 3.3.0" msgstr "" -msgid "Promoted to **proposed** function" -msgstr "" - -msgid "``pgr_depthFirstSearch`` (`Single Vertex`_)" -msgstr "" - -msgid "``pgr_depthFirstSearch`` (`Multiple Vertices`_)" -msgstr "" - msgid "" "Depth First Search algorithm is a traversal algorithm which starts from a " "root vertex, goes as deep as possible, and backtracks once a vertex is " @@ -10358,13 +10410,13 @@ msgid "Same as `Single vertex`_ but with edges in descending order of ``id``." msgstr "" msgid "" -"`Boost: Depth First Search algorithm documentation `__" +"`Boost: Depth First Search `__" msgstr "" msgid "" -"`Boost: Undirected DFS algorithm documentation `__" +"`Boost: Undirected DFS `__" msgstr "" msgid "" @@ -10381,44 +10433,31 @@ msgstr "" msgid "Version 3.5.0" msgstr "" -msgid "" -"``pgr_dijkstra`` (`One to One`_) added ``start_vid`` and ``end_vid`` columns." +msgid "pgr_dijkstra(One to One) added ``start_vid`` and ``end_vid`` columns." msgstr "" -msgid "``pgr_dijkstra`` (`One to Many`_) added ``end_vid`` column." +msgid "pgr_dijkstra(One to Many) added ``end_vid`` column." msgstr "" -msgid "``pgr_dijkstra`` (`Many to One`_) added ``start_vid`` column." +msgid "pgr_dijkstra(Many to One) added ``start_vid`` column." msgstr "" msgid "Version 3.1.0" msgstr "" -msgid "``pgr_dijkstra`` (`Combinations`_)" -msgstr "" - -msgid "**Official** functions" -msgstr "" - msgid "Version 2.2.0" msgstr "" -msgid "New **proposed** functions:" -msgstr "" - -msgid "``pgr_dijkstra`` (`One to Many`_)" -msgstr "" - -msgid "``pgr_dijkstra`` (`Many to One`_)" +msgid "pgr_dijkstra(One to Many)" msgstr "" -msgid "``pgr_dijkstra`` (`Many to Many`_)" +msgid "pgr_dijkstra(Many to One)" msgstr "" -msgid "Signature change on ``pgr_dijkstra`` (`One to One`_)" +msgid "pgr_dijkstra(Many to Many)" msgstr "" -msgid "**Official** ``pgr_dijkstra`` (`One to One`_)" +msgid "Signature change on pgr_dijkstra(One to One)" msgstr "" msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" @@ -10604,6 +10643,11 @@ msgstr "" msgid "37) Using `Combinations`_" msgstr "" +msgid "" +"`Boost: Dijkstra shortest paths `__" +msgstr "" + msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgstr "" @@ -10615,9 +10659,6 @@ msgid "" "algorithm." msgstr "" -msgid "``pgr_dijkstraCost`` (`Combinations`_)" -msgstr "" - msgid "" "The ``pgr_dijkstraCost`` function sumarizes of the cost of the shortest path " "using Dijkstra Algorithm." @@ -10903,9 +10944,6 @@ msgstr "" msgid "When ``false``: ``cap`` limit per ``Start vid`` will be returned" msgstr "" -msgid "boost: https://www.boost.org/libs/graph/doc/table_of_contents.html" -msgstr "" - msgid "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgstr "" @@ -11084,13 +11122,16 @@ msgstr "" msgid "Added ``depth`` and ``pred`` result columns." msgstr "" -msgid "Signature change pgr_drivingDistance(single vertex)" +msgid "Signature change:" msgstr "" -msgid "New **Official** pgr_drivingDistance(multiple vertices)" +msgid "pgr_drivingDistance(single vertex)" msgstr "" -msgid "Official:: pgr_drivingDistance(single vertex)" +msgid "New official signature:" +msgstr "" + +msgid "pgr_drivingDistance(multiple vertices)" msgstr "" msgid "" @@ -11145,7 +11186,7 @@ msgid "" "undirected graph" msgstr "" -msgid "pgr_edgeColoring - Experimental" +msgid "``pgr_edgeColoring`` - Experimental" msgstr "" msgid "" @@ -11219,6 +11260,15 @@ msgstr "" msgid "Graph coloring of pgRouting :doc:`sampledata`" msgstr "" +msgid "" +"`Boost: Edge Coloring `__" +msgstr "" + +msgid "" +"`Wikipedia: Graph coloring `__" +msgstr "" + msgid "``pgr_edgeDisjointPaths``" msgstr "" @@ -11227,9 +11277,6 @@ msgid "" "groups of vertices." msgstr "" -msgid "New **proposed** function:" -msgstr "" - msgid "pgr_edgeDisjointPaths(Combinations)" msgstr "" @@ -11311,9 +11358,6 @@ msgid "" "the flow from the sources to the targets using Edmonds Karp Algorithm." msgstr "" -msgid "``pgr_edmondsKarp`` (`Combinations`_)" -msgstr "" - msgid "Renamed from ``pgr_maxFlowEdmondsKarp``" msgstr "" @@ -11335,32 +11379,22 @@ msgstr "" msgid "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -msgid "https://www.boost.org/libs/graph/doc/edmonds_karp_max_flow.html" +msgid "" +"`Boost: Edmonds Karp max flow `__" msgstr "" msgid "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" msgstr "" -msgid "``pgr_edwardMoore - Experimental``" +msgid "``pgr_edwardMoore`` - Experimental" msgstr "" msgid "" "``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore algorithm." msgstr "" -msgid "``pgr_edwardMoore`` (`Combinations`_)" -msgstr "" - -msgid "``pgr_edwardMoore`` (`One to One`_)" -msgstr "" - -msgid "``pgr_edwardMoore`` (`One to Many`_)" -msgstr "" - -msgid "``pgr_edwardMoore`` (`Many to One`_)" -msgstr "" - -msgid "``pgr_edwardMoore`` (`Many to Many`_)" +msgid "pgr_edwardMoore(Combinations)" msgstr "" msgid "" @@ -11422,7 +11456,7 @@ msgstr "" msgid "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" msgstr "" -msgid "pgr_extractVertices -- Proposed" +msgid "``pgr_extractVertices`` -- Proposed" msgstr "" msgid "``pgr_extractVertices`` — Extracts the vertices information" @@ -11523,21 +11557,12 @@ msgid "" "= true``." msgstr "" -msgid "``pgr_findCloseEdges``" +msgid "``pgr_findCloseEdges`` - Proposed" msgstr "" msgid "``pgr_findCloseEdges`` - Finds the close edges to a point geometry." msgstr "" -msgid "New **proposed** signatures:" -msgstr "" - -msgid "``pgr_findCloseEdges`` (`One point`_)" -msgstr "" - -msgid "``pgr_findCloseEdges`` (`Many points`_)" -msgstr "" - msgid "" "``pgr_findCloseEdges`` - An utility function that finds the closest edge to " "a point geometry." @@ -12014,9 +12039,6 @@ msgid "" "floyd_warshall_shortest.html>`_" msgstr "" -msgid "Queries uses the :doc:`sampledata` network." -msgstr "" - msgid "``pgr_full_version``" msgstr "" @@ -12024,9 +12046,6 @@ msgid "" "``pgr_full_version`` — Get the details of pgRouting version information." msgstr "" -msgid "New **official** function" -msgstr "" - msgid "Get complete details of pgRouting version information" msgstr "" @@ -12093,7 +12112,7 @@ msgstr "" msgid "Git hash of pgRouting build" msgstr "" -msgid "``pgr_hawickCircuits - Experimental``" +msgid "``pgr_hawickCircuits`` - Experimental" msgstr "" msgid "" @@ -12101,9 +12120,6 @@ msgid "" "algorithm." msgstr "" -msgid "``pgr_hawickCircuits``" -msgstr "" - msgid "" "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. " "James. This algorithm solves the problem of detecting and enumerating " @@ -12226,7 +12242,9 @@ msgid "" "blue represent :math:`K_5` subgraph." msgstr "" -msgid "https://www.boost.org/libs/graph/doc/boyer_myrvold.html" +msgid "" +"`Boost: Boyer Myrvold `__" msgstr "" msgid "``pgr_johnson``" @@ -12359,7 +12377,7 @@ msgstr "" msgid "pgr_kruskalDFS(`Edges SQL`_, **root vids**, [``max_depth``])" msgstr "" -msgid "pgr_lengauerTarjanDominatorTree -Experimental" +msgid "``pgr_lengauerTarjanDominatorTree`` - Experimental" msgstr "" msgid "" @@ -12417,8 +12435,8 @@ msgid "Dominator tree of another component." msgstr "" msgid "" -"`Boost: Lengauer-Tarjan dominator tree algorithm `__" +"`Boost: Lengauer-Tarjan dominator `__" msgstr "" msgid "" @@ -12426,7 +12444,7 @@ msgid "" "Dominator_(graph_theory)>`__" msgstr "" -msgid "pgr_lineGraph - Proposed" +msgid "``pgr_lineGraph`` - Proposed" msgstr "" msgid "" @@ -12434,9 +12452,6 @@ msgid "" "based graph." msgstr "" -msgid "Promoted to **proposed** signature." -msgstr "" - msgid "Works for directed and undirected graphs." msgstr "" @@ -12700,8 +12715,7 @@ msgid "Full line graph of subgraph of edges :math:`\\{4, 7, 8, 10\\}`" msgstr "" msgid "" -"The examples of this section are based on the :doc:`sampledata` network. The " -"examples include the subgraph including edges 4, 7, 8, and 10 with " +"The examples include the subgraph including edges 4, 7, 8, and 10 with " "``reverse_cost``." msgstr "" @@ -12920,15 +12934,15 @@ msgstr "" msgid "Returns set of |result-component-make|" msgstr "" -msgid "" -"Query done on :doc:`sampledata` network gives the list of edges that are " -"needed to connect the graph." +msgid "List of edges that are needed to connect the graph." msgstr "" -msgid "https://www.boost.org/libs/graph/doc/make_connected.html" +msgid "" +"`Boost: make connected `__" msgstr "" -msgid "pgr_maxCardinalityMatch" +msgid "``pgr_maxCardinalityMatch``" msgstr "" msgid "" @@ -12936,13 +12950,16 @@ msgid "" "graph." msgstr "" +msgid "pgr_maxCardinalityMatch(text) returns only ``edge`` column." +msgstr "" + msgid "Deprecated signature" msgstr "" -msgid "``pgr_maxCardinalityMatch(text,boolean)``" +msgid "pgr_maxCardinalityMatch(text,boolean)" msgstr "" -msgid "``directed => false`` when used." +msgid "directed => ``false`` when used." msgstr "" msgid "Renamed from ``pgr_maximumCardinalityMatching``" @@ -12993,7 +13010,9 @@ msgstr "" msgid "Identifier of the edge in the original query." msgstr "" -msgid "https://www.boost.org/libs/graph/doc/maximum_matching.html" +msgid "" +"`Boost: maximum_matching `__" msgstr "" msgid "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" @@ -13010,12 +13029,6 @@ msgid "" "source(s) to the targets(s) using the Push Relabel algorithm." msgstr "" -msgid "``pgr_maxFlow`` (`Combinations`_)" -msgstr "" - -msgid "New **Proposed** function" -msgstr "" - msgid "Calculates the maximum flow from the sources to the targets." msgstr "" @@ -13050,7 +13063,9 @@ msgstr "" msgid "Maximum flow possible from the source(s) to the target(s)" msgstr "" -msgid "https://www.boost.org/libs/graph/doc/push_relabel_max_flow.html" +msgid "" +"`Boost: push relabel max flow `__" msgstr "" msgid "" @@ -13065,7 +13080,10 @@ msgid "" "of the maximum flow on a graph" msgstr "" -msgid "``pgr_maxFlowMinCost`` (`Combinations`_)" +msgid "pgr_maxFlowMinCost(Combinations)" +msgstr "" + +msgid "|boost| graph inside." msgstr "" msgid "**TODO** check which statement is true:" @@ -13109,11 +13127,6 @@ msgstr "" msgid "Returns set of |result-flow-mincost|" msgstr "" -msgid "" -"https://www.boost.org/libs/graph/doc/" -"successive_shortest_path_nonnegative_weights.html" -msgstr "" - msgid "``pgr_maxFlowMinCost_Cost`` - Experimental" msgstr "" @@ -13122,7 +13135,7 @@ msgid "" "maximum flow on a graph" msgstr "" -msgid "``pgr_maxFlowMinCost_Cost`` (`Combinations`_)" +msgid "pgr_maxFlowMinCost_Cost(Combinations)" msgstr "" msgid "**The cost value of all input edges must be nonnegative.**" @@ -13155,7 +13168,7 @@ msgstr "" msgid "Minimum Cost Maximum Flow possible from the source(s) to the target(s)" msgstr "" -msgid "pgr_nodeNetwork" +msgid "``pgr_nodeNetwork``" msgstr "" msgid "``pgr_nodeNetwork`` - Nodes an network edge table." @@ -13693,9 +13706,6 @@ msgid "" "the flow from the sources to the targets using Push Relabel Algorithm." msgstr "" -msgid "``pgr_pushRelabel`` (`Combinations`_)" -msgstr "" - msgid "Renamed from ``pgr_maxFlowPushRelabel``" msgstr "" @@ -13714,7 +13724,7 @@ msgstr "" msgid "pgr_pushRelabel(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -msgid "pgr_sequentialVertexColoring - Proposed" +msgid "``pgr_sequentialVertexColoring`` - Proposed" msgstr "" msgid "" @@ -13722,9 +13732,6 @@ msgid "" "undirected graph, using greedy approach." msgstr "" -msgid "Promoted to **proposed** signature" -msgstr "" - msgid "" "Sequential vertex coloring algorithm is a graph coloring algorithm in which " "color identifiers are assigned to the vertices of a graph in a sequential " @@ -13767,7 +13774,12 @@ msgstr "" msgid "pgr_sequentialVertexColoring(`Edges SQL`_)" msgstr "" -msgid "pgr_stoerWagner - Experimental" +msgid "" +"`Boost: Sequential Vertex Coloring `__" +msgstr "" + +msgid "``pgr_stoerWagner`` - Experimental" msgstr "" msgid "``pgr_stoerWagner`` — The min-cut of graph using stoerWagner algorithm." @@ -13851,6 +13863,11 @@ msgstr "" msgid "Using :doc:`pgr_connectedComponents`" msgstr "" +msgid "" +"`Boost: Stoer Wagner min cut `__" +msgstr "" + msgid "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" msgstr "" @@ -13880,7 +13897,7 @@ msgid "The strong components of the graph" msgstr "" msgid "" -"Boost: `Strong components `__" msgstr "" @@ -13945,6 +13962,11 @@ msgstr "" msgid "Graph is not a DAG" msgstr "" +msgid "" +"`Boost: topological sort `__" +msgstr "" + msgid "``pgr_transitiveClosure`` - Experimental" msgstr "" @@ -14000,49 +14022,51 @@ msgstr "" msgid "Identifiers of the vertices that are reachable from vertex v." msgstr "" -msgid "https://en.wikipedia.org/wiki/Transitive_closure" +msgid "" +"`Boost: transitive closure `__" msgstr "" -msgid "pgr_trsp - Proposed" +msgid "https://en.wikipedia.org/wiki/Transitive_closure" msgstr "" -msgid "``pgr_trsp`` - routing vertices with restrictions." +msgid "``pgr_trsp``" msgstr "" -msgid "New proposed signatures" +msgid "``pgr_trsp`` - routing vertices with restrictions." msgstr "" -msgid "``pgr_trsp`` (`One to One`_)" +msgid "pgr_trsp(One to One)" msgstr "" -msgid "``pgr_trsp`` (`One to Many`_)" +msgid "pgr_trsp(One to Many)" msgstr "" -msgid "``pgr_trsp`` (`Many to One`_)" +msgid "pgr_trsp(Many to One)" msgstr "" -msgid "``pgr_trsp`` (`Many to Many`_)" +msgid "pgr_trsp(Many to Many)" msgstr "" -msgid "``pgr_trsp`` (`Combinations`_)" +msgid "pgr_trsp(Combinations)" msgstr "" msgid "Deprecated signatures" msgstr "" -msgid "``pgr_trsp(text,integer,float,integer,float,boolean,boolean,text)``" +msgid "pgr_trsp(text,integer,float,integer,float,boolean,boolean,text)" msgstr "" -msgid "``pgr_trspViaVertices(text,anyarray,boolean,boolean,text)``" +msgid "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" msgstr "" msgid "New prototypes" msgstr "" -msgid "``pgr_trspViaVertices``" +msgid "pgr_trspViaVertices" msgstr "" -msgid "``pgr_trspViaEdges``" +msgid "pgr_trspViaEdges" msgstr "" msgid "" @@ -14115,19 +14139,13 @@ msgid "" "`Deprecated documentation `_" msgstr "" -msgid "``pgr_trspVia`` - Proposed" +msgid "``pgr_trspVia``" msgstr "" msgid "" "``pgr_trspVia`` Route that goes through a list of vertices with restrictions." msgstr "" -msgid "New proposed function:" -msgstr "" - -msgid "``pgr_trspVia`` (`One Via`_)" -msgstr "" - msgid "" "Given a list of vertices and a graph, this function is equivalent to finding " "the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :" @@ -14205,7 +14223,7 @@ msgstr "" msgid ":doc:`via-category`" msgstr "" -msgid "``pgr_trspVia_withPoints`` - Proposed" +msgid "``pgr_trspVia_withPoints``" msgstr "" msgid "" @@ -14213,9 +14231,6 @@ msgid "" "or points with restrictions." msgstr "" -msgid "``pgr_trspVia_withPoints`` (`One Via`_)" -msgstr "" - msgid "" "Given a graph, a set of restriction on the graph edges, a set of points on " "the graphs edges and a list of vertices, this function is equivalent to " @@ -14375,30 +14390,12 @@ msgid "" "`pgr_trsp` algorithm. In this case a U turn is been done using the same edge." msgstr "" -msgid "pgr_trsp_withPoints - Proposed" +msgid "``pgr_trsp_withPoints``" msgstr "" msgid "``pgr_trsp_withPoints`` Routing Vertex/Point with restrictions." msgstr "" -msgid "New proposed signatures:" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (`One to One`_)" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (`One to Many`_)" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (`Many to One`_)" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (`Many to Many`_)" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (`Combinations`_)" -msgstr "" - msgid "" "Modify the graph to include points defined by points_sql. Using Dijkstra " "algorithm, find the shortest path" @@ -14507,7 +14504,7 @@ msgid "" "`1` on an undirected graph, with details." msgstr "" -msgid "pgr_turnRestrictedPath - Experimental" +msgid "``pgr_turnRestrictedPath`` - Experimental" msgstr "" msgid "" @@ -14515,9 +14512,6 @@ msgid "" "with restrictions" msgstr "" -msgid "New experimental function" -msgstr "" - msgid "" "Using Yen's algorithm to obtain K shortest paths and analyze the paths to " "select the paths that do not use the restrictions" @@ -14589,7 +14583,7 @@ msgstr "" msgid "pgRouting Version for this documentation" msgstr "" -msgid "pgr_vrpOneDepot - Experimental" +msgid "``pgr_vrpOneDepot`` - Experimental" msgstr "" msgid "**No documentation available**" @@ -14598,7 +14592,7 @@ msgstr "" msgid "**TBD**" msgstr "" -msgid "``pgr_withPoints`` - Proposed" +msgid "``pgr_withPoints``" msgstr "" msgid "" @@ -14741,7 +14735,7 @@ msgstr "" msgid "Passes in front or visits with left side driving." msgstr "" -msgid "``pgr_withPointsCost`` - Proposed" +msgid "``pgr_withPointsCost``" msgstr "" msgid "" @@ -14885,7 +14879,7 @@ msgstr "" msgid "Does not matter driving side driving topology" msgstr "" -msgid "``pgr_withPointsCostMatrix`` - proposed" +msgid "``pgr_withPointsCostMatrix``" msgstr "" msgid "" @@ -14917,7 +14911,7 @@ msgid "" "locations on the graph of point `(2.9, 1.8)`." msgstr "" -msgid "``pgr_withPointsDD`` - Proposed" +msgid "``pgr_withPointsDD``" msgstr "" msgid "" @@ -14930,7 +14924,10 @@ msgid "" "unnamed compulsory **driving side**." msgstr "" -msgid "``pgr_withPointsDD`` (`Single vertex`)" +msgid "pgr_withPointsDD(Single vertex)" +msgstr "" + +msgid "pgr_withPointsDD(Multiple vertices)" msgstr "" msgid "Added ``depth``, ``pred`` and ``start_vid`` column." @@ -14948,13 +14945,12 @@ msgid "" msgstr "" msgid "" -"``pgr_withpointsdd(text,text,bigint,double precision,boolean,character," -"boolean)``" +"pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" msgstr "" msgid "" -"``pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)``" +"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," +"boolean,boolean)" msgstr "" msgid "" @@ -15061,7 +15057,7 @@ msgstr "" msgid ":doc:`pgr_alphaShape`" msgstr "" -msgid "pgr_withPointsKSP - Proposed" +msgid "``pgr_withPointsKSP``" msgstr "" msgid "" @@ -15071,26 +15067,23 @@ msgstr "" msgid "Standarizing output columns to |nksp-result|" msgstr "" -msgid "``pgr_withPointsKSP`` (One to One)" +msgid "pgr_withPointsKSP(One to One)" msgstr "" -msgid "New overload functions" +msgid "pgr_withPointsKSP(One to Many)" msgstr "" -msgid "``pgr_withPointsKSP`` (One to Many)" +msgid "pgr_withPointsKSP(Many to One)" msgstr "" -msgid "``pgr_withPointsKSP`` (Many to One)" +msgid "pgr_withPointsKSP(Many to Many)" msgstr "" -msgid "``pgr_withPointsKSP`` (Many to Many)" -msgstr "" - -msgid "``pgr_withPointsKSP`` (Combinations)" +msgid "pgr_withPointsKSP(Combinations)" msgstr "" msgid "" -"``pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," +"pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," "boolean)``" msgstr "" @@ -15206,7 +15199,7 @@ msgid "" "to point :math:`2` with heap paths and details." msgstr "" -msgid "``pgr_withPointsVia`` - Proposed" +msgid "``pgr_withPointsVia``" msgstr "" msgid "" @@ -15214,9 +15207,6 @@ msgid "" "points." msgstr "" -msgid "New **proposed** function ``pgr_withPointsVia`` (`One Via`_)" -msgstr "" - msgid "" "Given a graph, a set of points on the graphs edges and a list of vertices, " "this function is equivalent to finding the shortest path between :math:" @@ -15360,6 +15350,20 @@ msgstr "" msgid "pgRouting 3.7" msgstr "" +msgid "pgRouting 3.7.3 Release Notes" +msgstr "" + +msgid "" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.7.3 `__" +msgstr "" + +msgid "" +"`#2731 `__ Build Failure " +"on Ubuntu 22" +msgstr "" + msgid "pgRouting 3.7.2 Release Notes" msgstr "" @@ -15604,31 +15608,11 @@ msgid "" "output pgr_aStar" msgstr "" -msgid "" -"``pgr_aStar`` (`One to One`) added ``start_vid`` and ``end_vid`` columns." -msgstr "" - -msgid "``pgr_aStar`` (`One to Many`) added ``end_vid`` column." -msgstr "" - -msgid "``pgr_aStar`` (`Many to One`) added ``start_vid`` column." -msgstr "" - msgid "" "`#2523 `__ Standarize " "output pgr_bdAstar" msgstr "" -msgid "" -"``pgr_bdAstar`` (`One to One`) added ``start_vid`` and ``end_vid`` columns." -msgstr "" - -msgid "``pgr_bdAstar`` (`One to Many`) added ``end_vid`` column." -msgstr "" - -msgid "``pgr_bdAstar`` (`Many to One`) added ``start_vid`` column." -msgstr "" - msgid "" "`#2547 `__ Standarize " "output and modifying signature pgr_KSP" @@ -15636,7 +15620,7 @@ msgstr "" msgid "" "`#2548 `__ Standarize " -"output pgr_drivingdistance" +"output pgr_drivingDistance" msgstr "" msgid "Proposed functions changes" @@ -15782,16 +15766,6 @@ msgstr "" msgid "Dijkstra" msgstr "" -msgid "" -"``pgr_dijkstra`` (`One to One`) added ``start_vid`` and ``end_vid`` columns." -msgstr "" - -msgid "``pgr_dijkstra`` (`One to Many`) added ``end_vid`` column." -msgstr "" - -msgid "``pgr_dijkstra`` (`Many to One`) added ``start_vid`` column." -msgstr "" - msgid "pgRouting 3.4" msgstr "" @@ -15848,13 +15822,13 @@ msgid "" "doesn't give all correct shortest path" msgstr "" -msgid "New proposed functions" +msgid "New proposed functions." msgstr "" msgid "With points" msgstr "" -msgid "``pgr_withPointsVia`` (One Via)" +msgid "pgr_withPointsVia(One Via)" msgstr "" msgid "Turn Restrictions" @@ -15863,88 +15837,67 @@ msgstr "" msgid "Via with turn restrictions" msgstr "" -msgid "``pgr_trspVia`` (One Via)" -msgstr "" - -msgid "``pgr_trspVia_withPoints`` (One Via)" -msgstr "" - -msgid "``pgr_trsp``" +msgid "pgr_trspVia(One Via)" msgstr "" -msgid "``pgr_trsp`` (One to One)" +msgid "pgr_trspVia_withPoints(One Via)" msgstr "" -msgid "``pgr_trsp`` (One to Many)" +msgid "pgr_trsp_withPoints(One to One)" msgstr "" -msgid "``pgr_trsp`` (Many to One)" +msgid "pgr_trsp_withPoints(One to Many)" msgstr "" -msgid "``pgr_trsp`` (Many to Many)" -msgstr "" - -msgid "``pgr_trsp`` (Combinations)" -msgstr "" - -msgid "``pgr_trsp_withPoints``" +msgid "pgr_trsp_withPoints(Many to One)" msgstr "" -msgid "``pgr_trsp_withPoints`` (One to One)" +msgid "pgr_trsp_withPoints(Many to Many)" msgstr "" -msgid "``pgr_trsp_withPoints`` (One to Many)" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (Many to One)" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (Many to Many)" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (Combinations)" +msgid "pgr_trsp_withPoints(Combinations)" msgstr "" msgid "Topology" msgstr "" -msgid "``pgr_degree``" -msgstr "" - msgid "Utilities" msgstr "" -msgid "``pgr_findCloseEdges`` (One point)" +msgid "pgr_findCloseEdges(One point)" msgstr "" -msgid "``pgr_findCloseEdges`` (Many points)" +msgid "pgr_findCloseEdges(Many points)" msgstr "" msgid "Ordering" msgstr "" -msgid "``pgr_cuthillMckeeOrdering``" +msgid "pgr_cuthillMckeeOrdering" msgstr "" msgid "Unclassified" msgstr "" +msgid "pgr_hawickCircuits" +msgstr "" + msgid "Flow functions" msgstr "" -msgid "``pgr_maxCardinalityMatch(text)``" +msgid "pgr_maxCardinalityMatch(text)" msgstr "" -msgid "Deprecating ``pgr_maxCardinalityMatch(text,boolean)``" +msgid "Deprecating: pgr_maxCardinalityMatch(text,boolean)" msgstr "" msgid "Deprecated Functions" msgstr "" -msgid "``pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)``" +msgid "pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)" msgstr "" -msgid "``pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text)``" +msgid "pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text)" msgstr "" msgid "pgRouting 3.3" @@ -16206,12 +16159,6 @@ msgstr "" msgid "Removing support for Boost v1.53, v1.54 & v1.55" msgstr "" -msgid "pgr_bellmanFord(Combinations)" -msgstr "" - -msgid "pgr_binaryBreadthFirstSearch(Combinations)" -msgstr "" - msgid "pgr_bipartite" msgstr "" @@ -16221,9 +16168,6 @@ msgstr "" msgid "Dijkstra Near" msgstr "" -msgid "pgr_edwardMoore(Combinations)" -msgstr "" - msgid "pgr_isPlanar" msgstr "" @@ -16233,51 +16177,15 @@ msgstr "" msgid "pgr_makeConnected" msgstr "" -msgid "pgr_maxFlowMinCost(Combinations)" -msgstr "" - -msgid "pgr_maxFlowMinCost_Cost(Combinations)" -msgstr "" - msgid "Astar" msgstr "" -msgid "pgr_aStar(Combinations)" -msgstr "" - -msgid "pgr_aStarCost(Combinations)" -msgstr "" - msgid "Bidirectional Astar" msgstr "" -msgid "pgr_bdAstar(Combinations)" -msgstr "" - -msgid "pgr_bdAstarCost(Combinations)" -msgstr "" - msgid "Bidirectional Dijkstra" msgstr "" -msgid "pgr_bdDijkstra(Combinations)" -msgstr "" - -msgid "pgr_bdDijkstraCost(Combinations)" -msgstr "" - -msgid "pgr_boykovKolmogorov(Combinations)" -msgstr "" - -msgid "pgr_edmondsKarp(Combinations)" -msgstr "" - -msgid "pgr_maxFlow(Combinations)" -msgstr "" - -msgid "pgr_pushRelabel(Combinations)" -msgstr "" - msgid "pgRouting 3.1" msgstr "" @@ -16512,7 +16420,7 @@ msgid "" "information" msgstr "" -msgid "New functions" +msgid "New Functions" msgstr "" msgid "Kruskal family" @@ -16551,148 +16459,94 @@ msgstr "" msgid "aStar Family" msgstr "" -msgid "pgr_aStar(one to many)" -msgstr "" - -msgid "pgr_aStar(many to one)" -msgstr "" - -msgid "pgr_aStar(many to many)" -msgstr "" - -msgid "pgr_aStarCost(one to one)" -msgstr "" - -msgid "pgr_aStarCost(one to many)" -msgstr "" - -msgid "pgr_aStarCost(many to one)" +msgid "pgr_aStarCost(One to One)" msgstr "" -msgid "pgr_aStarCost(many to many)" +msgid "pgr_aStarCost(One to Many)" msgstr "" -msgid "pgr_aStarCostMatrix(one to one)" +msgid "pgr_aStarCost(Many to One)" msgstr "" -msgid "pgr_aStarCostMatrix(one to many)" +msgid "pgr_aStarCost(Many to Many)" msgstr "" -msgid "pgr_aStarCostMatrix(many to one)" -msgstr "" - -msgid "pgr_aStarCostMatrix(many to many)" +msgid "pgr_aStarCostMatrix" msgstr "" msgid "bdAstar Family" msgstr "" -msgid "pgr_bdAstar(one to many)" +msgid "pgr_bdAstarCost(One to One)" msgstr "" -msgid "pgr_bdAstar(many to one)" +msgid "pgr_bdAstarCost(One to Many)" msgstr "" -msgid "pgr_bdAstar(many to many)" +msgid "pgr_bdAstarCost(Many to One)" msgstr "" -msgid "pgr_bdAstarCost(one to one)" +msgid "pgr_bdAstarCost(Many to Many)" msgstr "" -msgid "pgr_bdAstarCost(one to many)" -msgstr "" - -msgid "pgr_bdAstarCost(many to one)" -msgstr "" - -msgid "pgr_bdAstarCost(many to many)" -msgstr "" - -msgid "pgr_bdAstarCostMatrix(one to one)" -msgstr "" - -msgid "pgr_bdAstarCostMatrix(one to many)" -msgstr "" - -msgid "pgr_bdAstarCostMatrix(many to one)" -msgstr "" - -msgid "pgr_bdAstarCostMatrix(many to many)" +msgid "pgr_bdAstarCostMatrix" msgstr "" msgid "bdDijkstra Family" msgstr "" -msgid "pgr_bdDijkstra(one to many)" +msgid "pgr_bdDijkstraCost(One to One)" msgstr "" -msgid "pgr_bdDijkstra(many to one)" +msgid "pgr_bdDijkstraCost(One to Many)" msgstr "" -msgid "pgr_bdDijkstra(many to many)" +msgid "pgr_bdDijkstraCost(Many to One)" msgstr "" -msgid "pgr_bdDijkstraCost(one to one)" +msgid "pgr_bdDijkstraCost(Many to Many)" msgstr "" -msgid "pgr_bdDijkstraCost(one to many)" -msgstr "" - -msgid "pgr_bdDijkstraCost(many to one)" -msgstr "" - -msgid "pgr_bdDijkstraCost(many to many)" -msgstr "" - -msgid "pgr_bdDijkstraCostMatrix(one to one)" -msgstr "" - -msgid "pgr_bdDijkstraCostMatrix(one to many)" -msgstr "" - -msgid "pgr_bdDijkstraCostMatrix(many to one)" -msgstr "" - -msgid "pgr_bdDijkstraCostMatrix(many to many)" +msgid "pgr_bdDijkstraCostMatrix" msgstr "" msgid "Flow Family" msgstr "" -msgid "pgr_pushRelabel(one to one)" +msgid "pgr_pushRelabel(One to One)" msgstr "" -msgid "pgr_pushRelabel(one to many)" +msgid "pgr_pushRelabel(One to Many)" msgstr "" -msgid "pgr_pushRelabel(many to one)" +msgid "pgr_pushRelabel(Many to One)" msgstr "" -msgid "pgr_pushRelabel(many to many)" +msgid "pgr_pushRelabel(Many to Many)" msgstr "" -msgid "pgr_edmondsKarp(one to one)" +msgid "pgr_edmondsKarp(One to One)" msgstr "" -msgid "pgr_edmondsKarp(one to many)" +msgid "pgr_edmondsKarp(One to Many)" msgstr "" -msgid "pgr_edmondsKarp(many to one)" +msgid "pgr_edmondsKarp(Many to One)" msgstr "" -msgid "pgr_edmondsKarp(many to many)" +msgid "pgr_edmondsKarp(Many to Many)" msgstr "" -msgid "pgr_boykovKolmogorov (one to one)" +msgid "pgr_boykovKolmogorov (One to One)" msgstr "" -msgid "pgr_boykovKolmogorov (one to many)" +msgid "pgr_boykovKolmogorov (One to Many)" msgstr "" -msgid "pgr_boykovKolmogorov (many to one)" +msgid "pgr_boykovKolmogorov (Many to One)" msgstr "" -msgid "pgr_boykovKolmogorov (many to many)" +msgid "pgr_boykovKolmogorov (Many to Many)" msgstr "" msgid "pgr_maxCardinalityMatching" @@ -16701,21 +16555,24 @@ msgstr "" msgid "pgr_maxFlow" msgstr "" -msgid "pgr_edgeDisjointPaths(one to one)" +msgid "pgr_edgeDisjointPaths(One to One)" msgstr "" -msgid "pgr_edgeDisjointPaths(one to many)" +msgid "pgr_edgeDisjointPaths(One to Many)" msgstr "" -msgid "pgr_edgeDisjointPaths(many to one)" +msgid "pgr_edgeDisjointPaths(Many to One)" msgstr "" -msgid "pgr_edgeDisjointPaths(many to many)" +msgid "pgr_edgeDisjointPaths(Many to Many)" msgstr "" msgid "Components family" msgstr "" +msgid "pgr_connectedComponents" +msgstr "" + msgid "pgr_strongComponents" msgstr "" @@ -16902,7 +16759,7 @@ msgstr "" msgid "pgr_johnson" msgstr "" -msgid "pgr_astar" +msgid "pgr_aStar" msgstr "" msgid "pgr_bdAstar" @@ -16923,6 +16780,9 @@ msgstr "" msgid "pgr_drivingDistance" msgstr "" +msgid "pgr_KSP" +msgstr "" + msgid "pgr_dijkstraVia (proposed)" msgstr "" @@ -17121,22 +16981,13 @@ msgstr "" msgid "Parameter names changed" msgstr "" -msgid "The many version results are the union of the one to one version" +msgid "The many version results are the union of the One to One version" msgstr "" msgid "New Signatures" msgstr "" -msgid "pgr_bdAstar(one to one)" -msgstr "" - -msgid "New Proposed functions" -msgstr "" - -msgid "pgr_bdAstarCostMatrix" -msgstr "" - -msgid "pgr_bdDijkstraCostMatrix" +msgid "pgr_bdAstar(One to One)" msgstr "" msgid "pgr_lineGraph" @@ -17218,31 +17069,7 @@ msgstr "" msgid "pgr_bdDijkstra" msgstr "" -msgid "New Proposed Signatures" -msgstr "" - -msgid "pgr_astar(one to many)" -msgstr "" - -msgid "pgr_astar(many to one)" -msgstr "" - -msgid "pgr_astar(many to many)" -msgstr "" - -msgid "pgr_astarCost(one to one)" -msgstr "" - -msgid "pgr_astarCost(one to many)" -msgstr "" - -msgid "pgr_astarCost(many to one)" -msgstr "" - -msgid "pgr_astarCost(many to many)" -msgstr "" - -msgid "pgr_astarCostMatrix" +msgid "Deprecated signatures." msgstr "" msgid "pgr_bddijkstra - use pgr_bdDijkstra instead" @@ -17314,52 +17141,43 @@ msgstr "" msgid "pgr_TSP" msgstr "" -msgid "pgr_aStar" -msgstr "" - -msgid "New Functions" -msgstr "" - msgid "pgr_eucledianTSP" msgstr "" -msgid "pgr_withPointsCostMatrix" -msgstr "" - -msgid "pgr_maxFlowPushRelabel(one to one)" +msgid "pgr_maxFlowPushRelabel(One to One)" msgstr "" -msgid "pgr_maxFlowPushRelabel(one to many)" +msgid "pgr_maxFlowPushRelabel(One to Many)" msgstr "" -msgid "pgr_maxFlowPushRelabel(many to one)" +msgid "pgr_maxFlowPushRelabel(Many to One)" msgstr "" -msgid "pgr_maxFlowPushRelabel(many to many)" +msgid "pgr_maxFlowPushRelabel(Many to Many)" msgstr "" -msgid "pgr_maxFlowEdmondsKarp(one to one)" +msgid "pgr_maxFlowEdmondsKarp(One to One)" msgstr "" -msgid "pgr_maxFlowEdmondsKarp(one to many)" +msgid "pgr_maxFlowEdmondsKarp(One to Many)" msgstr "" -msgid "pgr_maxFlowEdmondsKarp(many to one)" +msgid "pgr_maxFlowEdmondsKarp(Many to One)" msgstr "" -msgid "pgr_maxFlowEdmondsKarp(many to many)" +msgid "pgr_maxFlowEdmondsKarp(Many to Many)" msgstr "" -msgid "pgr_maxFlowBoykovKolmogorov (one to one)" +msgid "pgr_maxFlowBoykovKolmogorov (One to One)" msgstr "" -msgid "pgr_maxFlowBoykovKolmogorov (one to many)" +msgid "pgr_maxFlowBoykovKolmogorov (One to Many)" msgstr "" -msgid "pgr_maxFlowBoykovKolmogorov (many to one)" +msgid "pgr_maxFlowBoykovKolmogorov (Many to One)" msgstr "" -msgid "pgr_maxFlowBoykovKolmogorov (many to many)" +msgid "pgr_maxFlowBoykovKolmogorov (Many to Many)" msgstr "" msgid "pgr_maximumCardinalityMatching" @@ -17371,7 +17189,7 @@ msgstr "" msgid "pgr_tsp - use pgr_TSP or pgr_eucledianTSP instead" msgstr "" -msgid "pgr_astar - use pgr_aStar instead" +msgid "pgr_aStar - use pgr_aStar instead" msgstr "" msgid "pgr_flip_edges" @@ -17458,6 +17276,9 @@ msgstr "" msgid "Improvements" msgstr "" +msgid "pgr_nodeNetwork" +msgstr "" + msgid "Adding a row_where and outall optional parameters" msgstr "" @@ -17470,43 +17291,43 @@ msgstr "" msgid "pgr_Johnson" msgstr "" -msgid "pgr_dijkstraCost(one to one)" +msgid "pgr_dijkstraCost(One to One)" msgstr "" -msgid "pgr_dijkstraCost(one to many)" +msgid "pgr_dijkstraCost(One to Many)" msgstr "" -msgid "pgr_dijkstraCost(many to one)" +msgid "pgr_dijkstraCost(Many to One)" msgstr "" -msgid "pgr_dijkstraCost(many to many)" +msgid "pgr_dijkstraCost(Many to Many)" msgstr "" msgid "Proposed Functionality" msgstr "" -msgid "pgr_withPoints(one to one)" +msgid "pgr_withPoints(One to One)" msgstr "" -msgid "pgr_withPoints(one to many)" +msgid "pgr_withPoints(One to Many)" msgstr "" -msgid "pgr_withPoints(many to one)" +msgid "pgr_withPoints(Many to One)" msgstr "" -msgid "pgr_withPoints(many to many)" +msgid "pgr_withPoints(Many to Many)" msgstr "" -msgid "pgr_withPointsCost(one to one)" +msgid "pgr_withPointsCost(One to One)" msgstr "" -msgid "pgr_withPointsCost(one to many)" +msgid "pgr_withPointsCost(One to Many)" msgstr "" -msgid "pgr_withPointsCost(many to one)" +msgid "pgr_withPointsCost(Many to One)" msgstr "" -msgid "pgr_withPointsCost(many to many)" +msgid "pgr_withPointsCost(Many to Many)" msgstr "" msgid "pgr_withPointsDD(single vertex)" @@ -17515,9 +17336,6 @@ msgstr "" msgid "pgr_withPointsDD(multiple vertices)" msgstr "" -msgid "pgr_withPointsKSP" -msgstr "" - msgid "pgr_dijkstraVia" msgstr "" @@ -17551,25 +17369,10 @@ msgid "" "q=is%3Aissue+milestone%3A%22Release+2.1.0%22+is%3Aclosed>`_ on Github." msgstr "" -msgid "pgr_dijkstra(one to many)" -msgstr "" - -msgid "pgr_dijkstra(many to one)" -msgstr "" - -msgid "pgr_dijkstra(many to many)" -msgstr "" - -msgid "pgr_drivingDistance(multiple vertices)" -msgstr "" - msgid "Refactored" msgstr "" -msgid "pgr_dijkstra(one to one)" -msgstr "" - -msgid "pgr_drivingDistance(single vertex)" +msgid "pgr_dijkstra(One to One)" msgstr "" msgid "" @@ -18279,8 +18082,8 @@ msgid "" msgstr "" msgid "" -"pgRouting suplies some functions to create a routing topology and to analyze " -"the topology." +"pgRouting supplies some functions to create a routing topology and to " +"analyze the topology." msgstr "" msgid "Additional functions to create a graph:" diff --git a/locale/es/LC_MESSAGES/pgrouting_doc_strings.po b/locale/es/LC_MESSAGES/pgrouting_doc_strings.po index 1057b237ef1..2df51d0b68f 100644 --- a/locale/es/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/es/LC_MESSAGES/pgrouting_doc_strings.po @@ -10,8 +10,8 @@ msgid "" msgstr "" "Project-Id-Version: pgRouting v4.0\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2025-01-10 14:53+0000\n" -"PO-Revision-Date: 2025-01-15 21:02+0000\n" +"POT-Creation-Date: 2025-02-12 01:00+0000\n" +"PO-Revision-Date: 2025-02-12 01:39+0000\n" "Last-Translator: Celia Virginia Vergara Castillo \n" "Language-Team: Spanish \n" @@ -726,11 +726,11 @@ msgid "References" msgstr "Referencias" msgid "" -"`Boost's metric appro's metric approximation `__" +"`Boost: metric TSP approx `__" msgstr "" -"`Algoritmo Métrico de la Librería Boost `__" +"`Boost: aproximación métrica de TSP `__" msgid "`University of Waterloo TSP `__" msgstr "`Universided de Waterloo TSP `__" @@ -1788,8 +1788,8 @@ msgstr ":math:`1km * 0.0277hr/km = 0.0277hr`" msgid "https://en.wikipedia.org/wiki/Vehicle_routing_problem" msgstr "https://en.wikipedia.org/wiki/Vehicle_routing_problem" -msgid "The queries use the :doc:`sampledata` network." -msgstr "Las consultas utilizan la red :doc:`sampledata` ." +msgid ":doc:`sampledata`" +msgstr ":doc:`sampledata`" msgid "A* - Family of functions" msgstr "A* - Familia de Funciones" @@ -1969,8 +1969,11 @@ msgstr "" msgid ":doc:`bdAstar-family`" msgstr ":doc:`bdAstar-family`" -msgid "https://www.boost.org/libs/graph/doc/astar_search.html" -msgstr "https://www.boost.org/libs/graph/doc/astar_search.html" +msgid "" +"`Boost: A* search `__" +msgstr "" +"`Boost: Búsqueda A* `__" msgid "https://en.wikipedia.org/wiki/A*_search_algorithm" msgstr "https://en.wikipedia.org/wiki/A*_search_algorithm" @@ -2806,8 +2809,8 @@ msgstr "" "Para grandes gráficos donde hay un camino entre el vértice inicial y el " "vértice final:" -msgid "It is expected to terminate faster than pgr_astar" -msgstr "Se espera que termine más rápido que pgr_astar" +msgid "It is expected to terminate faster than pgr_aStar" +msgstr "Se espera que termine más rápido que pgr_aStar" msgid ":doc:`aStar-family`" msgstr ":doc:`aStar-family`" @@ -2981,38 +2984,9 @@ msgid "Identifier of the color of the edge." msgstr "Identificador del color del segmento." msgid "" -"`Boost: Sequential Vertex Coloring algorithm documentation `__" -msgstr "" -"`Boost: Documentacion de Algoritmo de Coloración Secuencial de Vertices " -"`__" - -msgid "" -"`Wikipedia: Graph coloring `__" -msgstr "" -"`Wikipedia: Coloración de grafos `__" - -msgid "" -"`Boost: is_bipartite `__" -msgstr "" -"`Boost: es bipartido `__" - -msgid "" -"`Wikipedia: bipartite graph `__" -msgstr "" -"`Wikipedia: grafo bipartito `__" - -msgid "" -"`Boost: Edge Coloring Algorithm documentation `__" +"`Boost: `__" msgstr "" -"`Boost: Algoritmo de Coloración de Segmentos `__" +"`Boost: `__" msgid "Components - Family of functions" msgstr "Componentes - Familia de funciones" @@ -3665,9 +3639,6 @@ msgstr "" "Ahora, el grafo de ruteo tiene un arista que se conecta con el nodo :math:" "`7`." -msgid ":doc:`sampledata`" -msgstr ":doc:`sampledata`" - msgid "" "https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/" "lecture16.pdf" @@ -4380,13 +4351,12 @@ msgstr "" ":doc:`pgr_cuthillMckeeOrdering` - Ordenamiento Cuthill-McKee de grafo sin no " "dirigido." -#, fuzzy msgid "" ":doc:`pgr_topologicalSort` - Linear ordering of the vertices for directed " "acyclic graph." msgstr "" -"``pgr_topologicalSort`` — Devuelve el orden lineal de los vértices para los " -"grafos acíclicos dirigidos ponderados (DAG)." +":doc:`pgr_topologicalSort` - Orden lineal de los vértices para grafos " +"acíclicos dirigidos." msgid ":doc:`metrics-family`" msgstr ":doc:`metrics-family`" @@ -4407,9 +4377,8 @@ msgstr "Categorías" msgid ":doc:`VRP-category`" msgstr ":doc:`VRP-category`" -#, fuzzy msgid "Shortest Path Category" -msgstr "Rutas más cortas K - Categoría" +msgstr "Rutas más cortas Categoría" msgid ":doc:`pgr_bellmanFord`" msgstr ":doc:`pgr_bellmanFord`" @@ -4420,15 +4389,14 @@ msgstr ":doc:`pgr_dagShortestPath`" msgid ":doc:`pgr_edwardMoore`" msgstr ":doc:`pgr_edwardMoore`" -#, fuzzy msgid "Planar Family" -msgstr "Familia aStar" +msgstr "Familia Planar" msgid ":doc:`pgr_isPlanar`" msgstr ":doc:`pgr_isPlanar`" msgid "Miscellaneous Algoritms" -msgstr "" +msgstr "Algoritmos diversos" msgid ":doc:`pgr_lengauerTarjanDominatorTree`" msgstr ":doc:`pgr_lengauerTarjanDominatorTree`" @@ -4936,32 +4904,186 @@ msgstr ":doc:`experimental`" msgid ":doc:`release_notes`" msgstr ":doc:`release_notes`" -#, fuzzy msgid "pgRouting 4.0.0 Release Notes" -msgstr "Notas de la versión de pgRouting 3.0.0" +msgstr "Notas de la versión de pgRouting 4.0.0" -#, fuzzy -msgid "Removal of deprecated functions and signatures" -msgstr "Sobre las firmas obsoletas:" +msgid "" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 4.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 "Functions promoted to official" +msgstr "Funciones promovidas a oficial" + +msgid "pgr_trsp" +msgstr "pgr_trsp" + +msgid "pgr_trspVia" +msgstr "pgr_trspVia" + +msgid "pgr_trspVia_withPoints" +msgstr "pgr_trspVia_withPoints" + +msgid "pgr_trsp_withPoints" +msgstr "pgr_trsp_withPoints" + +msgid "pgr_withPoints" +msgstr "pgr_withPoints" + +msgid "pgr_withPointsCost" +msgstr "pgr_withPointsCost" + +msgid "pgr_withPointsCostMatrix" +msgstr "pgr_withPointsCostMatrix" + +msgid "pgr_withPointsDD" +msgstr "pgr_withPointsDD" + +msgid "pgr_withPointsKSP" +msgstr "pgr_withPointsKSP" + +msgid "pgr_withPointsVia" +msgstr "pgr_withPointsVia" + +msgid "Signatures promoted to official" +msgstr "Firmas promovidas a oficial" + +msgid "pgr_aStar(Combinations)" +msgstr "pgr_aStar(Combinaciones)" + +msgid "pgr_aStarCost(Combinations)" +msgstr "pgr_aStarCost(Combinaciones)" + +msgid "pgr_bdAstar(Combinations)" +msgstr "pgr_bdAstar(Combinaciones)" + +msgid "pgr_bdAstarCost(Combinations)" +msgstr "pgr_bdAstarCost(Combinaciones)" + +msgid "pgr_bdDijkstra(Combinations)" +msgstr "pgr_bdDijkstra(Combinaciones)" + +msgid "pgr_bdDijkstraCost(Combinations)" +msgstr "pgr_bdDijkstraCost(Combinaciones)" + +msgid "pgr_dijkstra(Combinations)" +msgstr "pgr_dijkstra(Combinaciones)" + +msgid "pgr_dijkstraCost(Combinations)" +msgstr "pgr_dijkstraCost(Combinaciones)" + +msgid "pgr_KSP(All signatures)" +msgstr "pgr_KSP(todas las firmas)" + +msgid "pgr_boykovKolmogorov(Combinations)" +msgstr "pgr_boykovKolmogorov(Combinaciones)" + +msgid "pgr_edmondsKarp(Combinations)" +msgstr "pgr_edmondsKarp(Combinaciones)" + +msgid "pgr_maxFlow(Combinations)" +msgstr "pgr_maxFlow(Combinaciones)" + +msgid "pgr_pushRelabel(Combinations)" +msgstr "pgr_pushRelabel(Combinaciones)" + +msgid "code enhancements:" +msgstr "Mejora del código:" + +msgid "Removal of unused C/C++ code" +msgstr "Eliminación de código C/C++ no utilizado" + +msgid "Removal of SQL deprecated functions" +msgstr "Eliminación de funciones obsoletas" msgid "" -"``pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)``" +"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 "``pgr_trspviavertices(text,anyarray,boolean,boolean,text)``" -msgstr "``pgr_trsp(text,integer,integer,boolean,boolean,text)``" +msgid "pgr_trsp(text,integer,integer,boolean,boolean,text)" +msgstr "pgr_trsp(text,integer,integer,boolean,boolean,text)" -#, fuzzy msgid "" -"``pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean,text)``" +"pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" msgstr "" -"Correción pgr_trsp(text,integer,double precision,integer,double precision," -"boolean,boolean[,text])" +"pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" + +msgid "pgr_trspviavertices(text,anyarray,boolean,boolean,text)" +msgstr "pgr_trspviavertices(text,anyarray,boolean,boolean,text)" + +msgid "Removal of SQL deprecated internal functions" +msgstr "Eliminación de funciones internas SQL obsoletas" + +msgid "_pgr_dijkstranear(text,anyarray,anyarray,bigint,boolean)" +msgstr "_pgr_dijkstranear(text,anyarray,anyarray,bigint,boolean)" + +msgid "_pgr_dijkstranear(text,anyarray,bigint,bigint,boolean)" +msgstr "_pgr_dijkstranear(text,anyarray,bigint,bigint,boolean)" + +msgid "_pgr_dijkstranear(text,bigint,anyarray,bigint,boolean)" +msgstr "_pgr_dijkstranear(text,bigint,anyarray,bigint,boolean)" + +msgid "_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" +msgstr "_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" + +msgid "_pgr_dijkstra(text,text,boolean,boolean,boolean)" +msgstr "_pgr_dijkstra(text,text,boolean,boolean,boolean)" + +msgid "_pgr_drivingdistance(text,anyarray,double precision,boolean,boolean)" +msgstr "_pgr_drivingdistance(text,anyarray,double precision,boolean,boolean)" + +msgid "_pgr_kruskal(text,anyarray,text,bigint,double precision)" +msgstr "_pgr_kruskal(text,anyarray,text,bigint,double precision)" + +msgid "_pgr_prim(text,anyarray,text,bigint,double precision)" +msgstr "_pgr_prim(text,anyarray,text,bigint,double precision)" + +msgid "" +"_pgr_trsp(text,integer,double precision,integer,double precision,boolean," +"boolean,text)" +msgstr "" +"_pgr_trsp(text,integer,double precision,integer,double precision,boolean," +"boolean,text)" + +msgid "_pgr_trsp(text,text,anyarray,anyarray,boolean)" +msgstr "_pgr_trsp(text,text,anyarray,anyarray,boolean)" + +msgid "_pgr_trsp(text,text,anyarray,bigint,boolean)" +msgstr "_pgr_trsp(text,text,anyarray,bigint,boolean)" + +msgid "_pgr_trsp(text,text,bigint,anyarray,boolean)" +msgstr "_pgr_trsp(text,text,bigint,anyarray,boolean)" + +msgid "_pgr_trsp(text,text,bigint,bigint,boolean)" +msgstr "_pgr_trsp(text,text,bigint,bigint,boolean)" + +msgid "_pgr_trspviavertices(text,integer[],boolean,boolean,text)" +msgstr "_pgr_trspviavertices(text,integer[],boolean,boolean,text)" + +msgid "_pgr_withpointsvia(text,bigint[],double precision[],boolean)" +msgstr "_pgr_withpointsvia(text,bigint[],double precision[],boolean)" + +msgid "_trsp(text,text,anyarray,anyarray,boolean)" +msgstr "_trsp(text,text,anyarray,anyarray,boolean)" + +msgid "_v4trsp(text,text,anyarray,anyarray,boolean)" +msgstr "_v4trsp(text,text,anyarray,anyarray,boolean)" + +msgid "_v4trsp(text,text,text,boolean)" +msgstr "_v4trsp(text,text,text,boolean)" -msgid "``pgr_trsp(text,integer,integer,boolean,boolean,text)``" -msgstr "``pgr_trsp(text,integer,integer,boolean,boolean,text)``" +msgid "Deprecation of internal C/C++ functions" +msgstr "Obsolescencia de funciones internas C/C++" + +msgid "Internal C/C++ functions in legacy" +msgstr "Funciones C/C++ internas en legado" msgid "All releases" msgstr "Todas las versiones" @@ -4969,9 +5091,6 @@ msgstr "Todas las versiones" msgid "Kruskal - Family of functions" msgstr "Kruskal - Familia de funciones" -msgid "Boost Graph Inside" -msgstr "Adentro: Boost Graph" - msgid "" "Kruskal's algorithm is a greedy minimum spanning tree algorithm that in each " "cycle finds and adds the edge of the least possible weight that connects any " @@ -5177,7 +5296,7 @@ msgstr "En ``pgr_dijkstra`` (`Muchos a Uno`)" msgid "If needed add the new columns, for example:" msgstr "Si es necesario, añadir las nuevas columnas, por ejemplo:" -msgid "Migration of ``pgr_drivingdistance``" +msgid "Migration of ``pgr_drivingDistance``" msgstr "Migración de ``pgr_drivingDistance``" msgid "" @@ -5199,11 +5318,11 @@ msgstr "a" msgid "|result-spantree|" msgstr "|result-spantree|" -msgid "``pgr_drivingdistance`` (Single vertex)" -msgstr "``pgr_drivingDistance`` (Vértice único)" +msgid "pgr_drivingDistance(Single vertex)" +msgstr "pgr_drivingDistance(Vértice único)" -msgid "``pgr_drivingdistance`` (Multiple vertices)" -msgstr "``pgr_drivingDistance`` (Múltiples vértices)" +msgid "pgr_drivingDistance(Multiple vertices)" +msgstr "pgr_drivingDistance(Múltiples vértices)" msgid "Output columns were |result-dij-dd|" msgstr "Columnas de resultados eran |old-generic-result|" @@ -5533,7 +5652,7 @@ msgstr "" "dirigidos." msgid "``pgr_withPointsDD`` (Single vertex)" -msgstr "``pgr_withPointsDD`` (vértice único)" +msgstr "``pgr_withPointsDD`` (Vértice único)" msgid "``pgr_withPointsDD`` (Multiple vertices)" msgstr "``pgr_withPointsDD`` (Múltiples vértices)" @@ -5714,52 +5833,38 @@ msgstr "" msgid "Migration of ``pgr_trsp`` (Vertices)" msgstr "Migración de `pgr_trsp`` (Vértices)" -#, fuzzy msgid "Signature:" -msgstr "Firma" +msgstr "Firma:" -#, fuzzy msgid "Deprecated" -msgstr "Funcion Obsoleta" +msgstr "Obsoleto" -#, fuzzy msgid "`v3.4.0 `__" -msgstr "" -"A partir de v3.4.0 `__" +msgstr "`v3.4.0 `__" msgid "Removed" -msgstr "" +msgstr "Eliminado" -#, fuzzy msgid "`v4.0.0 `__" -msgstr "" -"A partir de v3.4.0 `__" - -#, fuzzy -msgid "See also" -msgstr "Ver también" +msgstr "`v4.0.0 `__" -#, fuzzy msgid ":doc:`pgr_dijkstra`" -msgstr ":doc:`pgr_dijkstra`:" +msgstr ":doc:`pgr_dijkstra`" msgid ":doc:`pgr_trsp`" msgstr ":doc:`pgr_trsp`" -#, fuzzy msgid "`Migration of restrictions`_" -msgstr "Migración de restricciones" +msgstr "`Migración de restricciones`_" -#, fuzzy msgid "Use ``pgr_dijkstra`` when there are no restrictions." -msgstr ":doc:`pgr_dijkstra` cuando no hay restricciones," +msgstr "Usar ``pgr_dijkstra`` cuando no hay restricciones." msgid "Use :doc:`pgr_dijkstra` instead." msgstr "Usa en vez :doc:`pgr_dijkstra`." -#, fuzzy msgid "To get the original column names:" -msgstr "Para obtener la conectividad del grafo:" +msgstr "Para obtener los nombres originales de las columnas:" msgid "``id1`` is the node" msgstr "``id1`` es el nodo" @@ -5767,9 +5872,8 @@ msgstr "``id1`` es el nodo" msgid "``id2`` is the edge" msgstr "``id2`` es la arista" -#, fuzzy msgid "Use ``pgr_trsp`` when there are restrictions." -msgstr ":doc:`pgr_trspVia` cuando hay restricciones." +msgstr "Usar ``pgr_trspVia`` cuando hay restricciones." msgid "Use :doc:`pgr_trsp` (One to One) instead." msgstr "Utilice en su lugar :doc:`pgr_trsp` (Uno a Uno)." @@ -5780,28 +5884,23 @@ msgstr "Migración de ``pgr_trsp`` (Aristas)" msgid ":doc:`pgr_withPoints`" msgstr ":doc:`pgr_withPoints`" -#, fuzzy msgid ":doc:`pgr_trsp_withPoints`" -msgstr ":doc:`pgr_trsp_withPoints`:" +msgstr ":doc:`pgr_trsp_withPoints`" -#, fuzzy msgid "Use ``pgr_withPoints`` when there are no restrictions." -msgstr ":doc:`pgr_withPoints` cuando no hay restricciones," +msgstr "Usar ``pgr_withPoints`` cuando no hay restricciones." -#, fuzzy -msgid "Use :doc:`pgr_withPoints` (Ont to One) instead." -msgstr "Utilice en su lugar :doc:`pgr_trsp` (Uno a Uno)." +msgid "Use :doc:`pgr_withPoints` (One to One) instead." +msgstr "Utilizar en su lugar :doc:`pgr_withPoints` (Uno a Uno)." -#, fuzzy msgid "Use ``pgr_trsp_withPoints`` when there are restrictions." -msgstr ":doc:`pgr_trspVia_withPoints` cuando hay restricciones." +msgstr "Usar ``pgr_trsp_withPoints`` cuando hay restricciones." msgid "Use :doc:`pgr_trsp_withPoints` instead." msgstr "Utilizar en su lugar :doc:`pgr_trsp_withPoints`." -#, fuzzy msgid "Migration of ``pgr_trspViaVertices``" -msgstr "Migraciones de ``pgr_trspViaVertices``" +msgstr "Migración de ``pgr_trspViaVertices``" msgid ":doc:`pgr_dijkstraVia`" msgstr ":doc:`pgr_dijkstraVia`" @@ -5809,9 +5908,8 @@ msgstr ":doc:`pgr_dijkstraVia`" msgid ":doc:`pgr_trspVia`" msgstr ":doc:`pgr_trspVia`" -#, fuzzy msgid "Use ``pgr_dijkstraVia`` when there are no restrictions" -msgstr ":doc:`pgr_dijkstraVia` cuando no hay restricciones," +msgstr "Usar ``pgr_dijkstraVia`` cuando no hay restricciones" msgid "Use :doc:`pgr_dijkstraVia` instead." msgstr "Usar :doc:`pgr_dijkstraVia` en su lugar." @@ -5825,14 +5923,12 @@ msgstr "``id2`` es el nodo" msgid "``id3`` is the edge" msgstr "``id3`` es la arista" -#, fuzzy msgid "Use ``pgr_trspVia`` when there are restrictions" -msgstr ":doc:`pgr_trspVia` cuando hay restricciones." +msgstr "Usar ``pgr_trspVia`` cuando hay restricciones" msgid "Use :doc:`pgr_trspVia` instead." msgstr "Usar :doc:`pgr_trspVia` en su lugar." -#, fuzzy msgid "Migration of ``pgr_trspViaEdges``" msgstr "Migración de ``pgr_trspViaEdges``" @@ -5842,16 +5938,14 @@ msgstr ":doc:`pgr_withPointsVia`" msgid ":doc:`pgr_trspVia_withPoints`" msgstr ":doc:`pgr_trspVia_withPoints`" -#, fuzzy msgid "Use ``pgr_withPointsVia`` when there are no restrictions" -msgstr ":doc:`pgr_withPointsVia` cuando no hay restricciones," +msgstr "Usar ``pgr_withPointsVia`` cuando no hay restricciones" msgid "Use :doc:`pgr_withPointsVia` instead." msgstr "Usar :doc:`pgr_withPointsVia` en su lugar." -#, fuzzy msgid "Use ``pgr_trspVia_withPoints`` when there are restrictions" -msgstr ":doc:`pgr_trspVia_withPoints` cuando hay restricciones." +msgstr "Usar ``pgr_trspVia_withPoints`` cuando hay restricciones" msgid "Use :doc:`pgr_trspVia_withPoints` instead." msgstr "Usar :doc:`pgr_trspVia_withPoints` en su lugar." @@ -7811,12 +7905,11 @@ msgstr "" msgid "Upgrading the database" msgstr "Actualización de la base de datos" -#, fuzzy 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 3.7.0 utilice el " +"Para actualizar pgRouting en la base de datos a la versión 4.0.0 utilice el " "siguiente comando:" msgid "" @@ -8345,8 +8438,8 @@ msgstr "Bibliotecas de código Boost C++ en https://www.boost.org." msgid ":doc:`migration`" msgstr ":doc:`migration`" -msgid "pgr_KSP" -msgstr "pgr_KSP" +msgid "``pgr_KSP``" +msgstr "``pgr_KSP``" msgid "``pgr_KSP`` — Yen's algorithm for K shortest paths using Dijkstra." msgstr "``pgr_KSP`` — Devuelve las K rutas más cortas usando Dijkstra ." @@ -8354,32 +8447,38 @@ msgstr "``pgr_KSP`` — Devuelve las K rutas más cortas usando Dijkstra ." msgid "Availability" msgstr "Disponibilidad" +msgid "Version 4.0.0" +msgstr "Versión 4.0.0" + +msgid "All signatures promoted to official." +msgstr "Todas las firmas promovidas a oficial." + msgid "Version 3.6.0" msgstr "Versión 3.6.0" msgid "Result columns standarized to: |nksp-result|" msgstr "Columnas de resultados estandarizadas a: |nksp-result|" -msgid "``pgr_ksp`` (One to One)" -msgstr "``pgr_ksp`` (Uno a Uno)" +msgid "pgr_ksp(One to One)" +msgstr "pgr_ksp(Uno a Uno)" msgid "Added ``start_vid`` and ``end_vid`` result columns." msgstr "Añadidas las columnas de resultados ``start_vid`` y ``end_vid``." -msgid "New overload functions:" -msgstr "Nuevas funciones de sobrecarga:" +msgid "New proposed signatures:" +msgstr "Nuevas firmas propuestas:" -msgid "``pgr_ksp`` (One to Many)" -msgstr "``pgr_ksp`` (Uno a muchos)" +msgid "pgr_ksp(One to Many)" +msgstr "pgr_ksp(Uno a muchos)" -msgid "``pgr_ksp`` (Many to One)" -msgstr "``pgr_ksp`` (Muchos a uno)" +msgid "pgr_ksp(Many to One)" +msgstr "pgr_ksp(Muchos a uno)" -msgid "``pgr_ksp`` (Many to Many)" -msgstr "``pgr_ksp`` (Muchos a muchos)" +msgid "pgr_ksp(Many to Many)" +msgstr "pgr_ksp(Muchos a muchos)" -msgid "``pgr_ksp`` (Combinations)" -msgstr "``pgr_ksp`` (Combinaciones)" +msgid "pgr_ksp(Combinations)" +msgstr "pgr_ksp(Combinaciones)" msgid "Version 2.1.0" msgstr "Versión 2.1.0" @@ -8393,8 +8492,8 @@ msgstr "Firma antigua ya no soportada" msgid "Version 2.0.0" msgstr "Versión 2.0.0" -msgid "**Official** function" -msgstr "Función **oficial**" +msgid "Official function." +msgstr "Función oficial." msgid "" "The K shortest path routing algorithm based on Yen's algorithm. \"K\" is the " @@ -8403,6 +8502,12 @@ msgstr "" "El algoritmo de ruteo para obtener la ruta más corta K basado en el " "algoritmo de Yen . \"K\" es el número de rutas más cortas deseadas." +msgid "|Boost| Boost Graph Inside" +msgstr "|Boost| Adentro: Boost Graph" + +msgid "Boost Graph Inside" +msgstr "Adentro: Boost Graph" + msgid "Signatures" msgstr "Firmas" @@ -8814,6 +8919,13 @@ msgstr "``pgr_TSPeuclidean``" msgid "``pgr_TSPeuclidean`` - Aproximation using *metric* algorithm." msgstr "``pgr_TSPeuclidean`` - Aproximación usando el algoritmo *metric*." +msgid "" +"Using `Boost: metric TSP approx `__" +msgstr "" +"Usando `Boost: Algoritmo de aproximación Métrica de TSP `__" + msgid "" "The Simulated Annealing Algorithm related parameters are ignored: " "`max_processing_time`, `tries_per_temperature`, " @@ -8831,8 +8943,8 @@ msgstr "Versión 3.0.0" msgid "Name change from pgr_eucledianTSP" msgstr "Cambio de nombre de pgr_eucledianTSP" -msgid "New **Official** function" -msgstr "Nueva función **Oficial**" +msgid "New official function." +msgstr "Nueva función oficial." msgid "" "Any duplicated identifier will be ignored. The coordinates that will be kept" @@ -8927,59 +9039,51 @@ msgstr "" "uwaterloo.ca/tsp/world/witour.html>`__ y la segunda imagen es la solución " "obtenida con ``pgr_TSPeuclidean``." -msgid ":doc:`sampledata` network." -msgstr ":doc:`sampledata` ." - msgid "``pgr_aStar``" msgstr "``pgr_aStar``" msgid "``pgr_aStar`` — Shortest path using the A* algorithm." msgstr "``pgr_aStar`` — La ruta más corta utilizando el algoritmo A*." +msgid "Combinations signature promoted to official." +msgstr "Firmas de combinaciones promovidas a oficial." + msgid "Standarizing output columns to |short-generic-result|" msgstr "Estandarización de las columnas de salida a |short-generic-result|" -msgid "" -"``pgr_aStar`` (`One to One`_) added ``start_vid`` and ``end_vid`` columns." +msgid "pgr_aStar(One to One) added ``start_vid`` and ``end_vid`` columns." msgstr "" -"``pgr_aStar`` (`Uno a Uno`_) ha añadido las columnas ``start_vid`` y " -"``end_vid``." +"pgr_aStar(Uno a Uno) ha añadido las columnas ``start_vid`` y ``end_vid``." -msgid "``pgr_aStar`` (`One to Many`_) added ``end_vid`` column." -msgstr "``pgr_aStar`` (`Uno a Muchos`_) ha añadido la columna ``end_vid``." +msgid "pgr_aStar(One to Many) added ``end_vid`` column." +msgstr "pgr_aStar(Uno a Muchos) ha añadido la columna ``end_vid``." -msgid "``pgr_aStar`` (`Many to One`_) added ``start_vid`` column." -msgstr "``pgr_aStar`` (`Muchos a Uno`_) ha añadido la columna ``start_vid``." +msgid "pgr_aStar(Many to One) added ``start_vid`` column." +msgstr "pgr_aStar(Muchos a Uno) ha añadido la columna ``start_vid``." msgid "Version 3.2.0" msgstr "Versión 3.2.0" -msgid "New **proposed** signature:" -msgstr "Nueva firma **propuesta**:" +msgid "New proposed signature:" +msgstr "Nuevas firmas propuesta:" -msgid "``pgr_aStar`` (`Combinations`_)" -msgstr "``pgr_aStar`` (`Combinaciones`_)" +msgid "Function promoted to official." +msgstr "Función promovida a oficial." msgid "Version 2.4.0" msgstr "Versión 2.4.0" -msgid "New **Proposed** signatures:" -msgstr "Nuevas firmas **propuestas**:" - -msgid "``pgr_aStar`` (`One to Many`_)" -msgstr "``pgr_aStar`` (`Uno a Muchos`_)" - -msgid "``pgr_aStar`` (`Many to One`_)" -msgstr "``pgr_aStar`` (`Muchos a Uno`_)" +msgid "pgr_aStar(One to Many)" +msgstr "pgr_aStar(Uno a Muchos)" -msgid "``pgr_aStar`` (`Many to Many`_)" -msgstr "``pgr_aStar`` (`Muchos a Muchos`_)" +msgid "pgr_aStar(Many to One)" +msgstr "pgr_aStar(Muchos a Uno)" -msgid "Signature change on ``pgr_astar`` (`One to One`_)" -msgstr "Cambio de firma en ``pgr_astar`` (`Uno a Uno`_)" +msgid "pgr_aStar(Many to Many)" +msgstr "pgr_aStar(Muchos a Muchos)" -msgid "**Official** ``pgr_aStar`` (`One to One`_)" -msgstr "**Oficial** ``pgr_aStar`` (`Uno a Uno`_)" +msgid "Signature change on pgr_aStar(One to One)" +msgstr "Cambio de firma en pgr_aStar(Uno a Uno)" msgid "" "The results are equivalent to the union of the results of the `pgr_aStar(` " @@ -9071,8 +9175,8 @@ msgstr "Ejemplo 3" msgid "Manually assigned vertex combinations." msgstr "Manualmente asignar combinaciones de vértices." -msgid "pgr_aStarCost" -msgstr "pgr_aStarCost" +msgid "``pgr_aStarCost``" +msgstr "``pgr_aStarCost``" msgid "" "``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." @@ -9080,11 +9184,8 @@ msgstr "" "``pgr_aStarCost`` - Coste total del camino más corto utilizando el algoritmo " "A*." -msgid "``pgr_aStarCost`` (`Combinations`_)" -msgstr "``pgr_aStarCost`` (`Combinaciones`_)" - -msgid "New **proposed** function" -msgstr "Nueva función **propuesta**" +msgid "New proposed function." +msgstr "Nueva función propuesta." msgid "" "The ``pgr_aStarCost`` function sumarizes of the cost of the shortest path " @@ -9300,8 +9401,8 @@ msgstr ":doc:`pgr_drivingDistance`" msgid "`ST_ConcaveHull `__" msgstr "`ST_ConcaveHull `__" -msgid "pgr_analyzeGraph" -msgstr "pgr_analyzeGraph" +msgid "``pgr_analyzeGraph``" +msgstr "``pgr_analyzeGraph``" msgid "``pgr_analyzeGraph`` — Analyzes the network topology." msgstr "``pgr_analyzeGraph`` — analiza la topología de red." @@ -9618,9 +9719,6 @@ msgstr "" "Seleccionar las filas donde la geometría está cerca de la place='myhouse' de " "la tabla ``othertable``. (Nótese el uso de quote_literal)" -msgid "The examples use the :doc:`sampledata` network." -msgstr "Los ejemplos usan la red de ejemplo :doc:`sampledata`." - msgid ":doc:`pgr_analyzeOneWay`" msgstr ":doc:`pgr_analyzeOneWay`" @@ -9630,8 +9728,8 @@ msgstr ":doc:`pgr_createVerticesTable`" msgid ":doc:`pgr_nodeNetwork` to create nodes to a not noded edge table." msgstr ":doc:`pgr_nodeNetwork` para crear nodos en una tabla sin nodos." -msgid "pgr_analyzeOneWay" -msgstr "pgr_analyzeOneWay" +msgid "``pgr_analyzeOneWay``" +msgstr "``pgr_analyzeOneWay``" msgid "" "``pgr_analyzeOneWay`` — Analyzes oneway Sstreets and identifies flipped " @@ -9831,8 +9929,8 @@ msgstr "Cambio de columnas de resultados: ``seq`` se elimina" msgid "Version 2.5.0" msgstr "Versión 2.5.0" -msgid "New **experimental** function" -msgstr "Nueva función **experimental**" +msgid "New experimental function." +msgstr "Nueva función experimental." msgid "" "Those vertices that belong to more than one biconnected component are called " @@ -9868,11 +9966,11 @@ msgid "Nodes in red are the articulation points." msgstr "Nodos en rojo son los puntos de articulación." msgid "" -"Boost: `Biconnected components & articulation points `__" msgstr "" -"Boost: `Componentes biconectados & y puntos de articulación `__" +"`Boost: Componentes biconectados y puntos de articulación `__" msgid "" "wikipedia: `Biconnected component `__" +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" -msgid "``pgr_betweennessCentrality``" -msgstr "``pgr_betweennessCentrality``" +msgid "``pgr_betweennessCentrality`` - Experimental" +msgstr "``pgr_betweennessCentrality`` - Experimental" msgid "" -"``pgr_betweennessCentrality`` - Calculates the relative betweeness " +"``pgr_betweennessCentrality`` - Calculates the relative betweenness " "centrality using Brandes Algorithm" msgstr "" "``pgr_betweennessCentrality`` - Calcula la centralidad intermedia relativa " @@ -10342,9 +10402,6 @@ msgstr "" msgid "Version 3.7.0" msgstr "Versión 3.7.0" -msgid "New **experimental** function:" -msgstr "Nueva función **experimental**:" - msgid "" "The Brandes Algorithm takes advantage of the sparse graphs for evaluating " "the betweenness centrality score of all vertices." @@ -10428,14 +10485,11 @@ msgstr "" "Puntuación relativa de centralidad entre vértices (estará en el rango [0,1])" msgid "" -"Boost's `betweenness_centrality `_" +"`Boost: betweenness centrality `_" msgstr "" -"`Boost: Centralidad de intermediación `__" - -msgid "Queries use the :doc:`sampledata` network." -msgstr "Las consultas utilizan la red :doc:`sampledata`." +"`Boost: Centralidad de intermediación `__" msgid "``pgr_biconnectedComponents``" msgstr "``pgr_biconnectedComponents``" @@ -10502,13 +10556,6 @@ msgstr "Contiene el identificador mínimo de arista en el componente." msgid "Identifier of the edge that belongs to the ``component``." msgstr "Identificador de arista que pertenece a ``component``." -msgid "" -"Boost: `Biconnected components `__" -msgstr "" -"Boost: `Componentes Biconectados `__" - msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" msgstr "``pgr_binaryBreadthFirstSearch`` - Experimental" @@ -10526,20 +10573,8 @@ msgstr "" "Un grafo cuyos pesos de las aristas pertenece al conjunto {0, X}, donde 'X' " "es un entero no negativo, se le llama 'grafo binario'." -msgid "pgr_binaryBreadthFirstSearch(`Combinations`_)" -msgstr "pgr_binaryBreadthFirstSearch(`Combinaciones`_)" - -msgid "pgr_binaryBreadthFirstSearch(`One to One`_)" -msgstr "pgr_binaryBreadthFirstSearch(`Uno a Uno`_)" - -msgid "pgr_binaryBreadthFirstSearch(`One to Many`_)" -msgstr "pgr_binaryBreadthFirstSearch(`Uno a Muchos`_)" - -msgid "pgr_binaryBreadthFirstSearch(`Many to One`_)" -msgstr "pgr_binaryBreadthFirstSearch(`Muchos a Uno`_)" - -msgid "pgr_binaryBreadthFirstSearch(`Many to Many`_)" -msgstr "pgr_binaryBreadthFirstSearch(`Muchos a Muchos`_)" +msgid "pgr_binaryBreadthFirstSearch(Combinations)" +msgstr "pgr_binaryBreadthFirstSearch(Combinaciones)" msgid "" "It is well-known that the shortest paths between a single source and all " @@ -10630,6 +10665,13 @@ 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 "https://cp-algorithms.com/graph/01_bfs.html" msgstr "https://cp-algorithms.com/graph/01_bfs.html" @@ -10638,8 +10680,8 @@ msgid "" msgstr "" "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" -msgid "pgr_bipartite -Experimental" -msgstr "pgr_bipartite - Experimental" +msgid "``pgr_bipartite`` - Experimental" +msgstr "``pgr_bipartite`` - Experimental" msgid "" "``pgr_bipartite`` — Disjoint sets of vertices such that no two vertices " @@ -10648,9 +10690,6 @@ msgstr "" "``pgr_bipartite`` — Conjuntos disjuntos tal que ningun par de vertices en el " "mismo conjunto son adjacentes." -msgid "New **experimental** signature" -msgstr "Nueva firma **experimental**" - msgid "" "A bipartite graph is a graph with two sets of vertices which are connected " "to each other, but not within themselves. A bipartite graph is possible if " @@ -10707,6 +10746,20 @@ msgstr "" 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 "" +"`Wikipedia: bipartite graph `__" +msgstr "" +"`Wikipedia: grafo bipartito `__" + msgid "``pgr_boykovKolmogorov``" msgstr "``pgr_boykovKolmogorov``" @@ -10719,20 +10772,11 @@ msgstr "" "maximiza el flujo de las fuentes a los objetivos utilizando el algoritmo " "Boykov Kolmogorov." -msgid "New **proposed** signature" -msgstr "Nueva firma **propuesta**" - -msgid "``pgr_boykovKolmogorov`` (`Combinations`_)" -msgstr "``pgr_boykovKolmogorov`` (`Combinaciones`_)" - msgid "Renamed from ``pgr_maxFlowBoykovKolmogorov``" msgstr "Renombrado de ``pgr_maxFlowBoykovKolmogorov``" -msgid "**Proposed** function" -msgstr "Función **propuesta**" - -msgid "New **Experimental** function" -msgstr "Nueva función **Experimental**" +msgid "Function promoted to proposed." +msgstr "Función promovida a propuesta." msgid "Running time: Polynomial" msgstr "Tiempo de ejecución: Polinomio" @@ -10777,8 +10821,12 @@ 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 "https://www.boost.org/libs/graph/doc/boykov_kolmogorov_max_flow.html" -msgstr "https://www.boost.org/libs/graph/doc/boykov_kolmogorov_max_flow.html" +msgid "" +"`Boost: Boykov Kolmogorov max flow `__" +msgstr "" +"`Boost: Flujo máximo Boykov Kolmogorov `__" msgid "``pgr_breadthFirstSearch`` - Experimental" msgstr "``pgr_breadthFirstSearch`` - Experimental" @@ -10790,12 +10838,6 @@ msgstr "" "``pgr_breadthFirstSearch`` — Devuelve los orden(es) transversales mediante " "el algoritmo Breadth First Search." -msgid "``pgr_breadthFirstSearch`` (`Single Vertex`_)" -msgstr "``pgr_breadthFirstSearch`` (`Vértice único`_)" - -msgid "``pgr_breadthFirstSearch`` (`Multiple Vertices`_)" -msgstr "``pgr_breadthFirstSearch`` (`Múltiples Vértices`_)" - msgid "" "Provides the Breadth First Search traversal order from a root vertex to a " "particular depth." @@ -10872,13 +10914,6 @@ msgstr "ascendente" msgid "descending" msgstr "descendente" -msgid "" -"`Boost: Breadth First Search algorithm documentation `__" -msgstr "" -"`Boost: Breadth First Search `__" - msgid "" "`Wikipedia: Breadth First Search algorithm `__" @@ -10922,10 +10957,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 "**Supported versions**" -msgstr "** Versions soportadas**" - -msgid "``pgr_chinesePostman`` - Experimental" +msgid "" +"`Boost: Connected components `__" +msgstr "" +"`Boost: Componentes conectados `__" + +msgid "``pgr_chinesePostman`` - Experimental" msgstr "``pgr_chinesePostman`` - Experimental" msgid "" @@ -10987,8 +11026,8 @@ msgstr "``pgr_chinesepostmancost``" msgid "Minimum costs of a circuit path." msgstr "Costes mínimos de una trayectoria de circuito." -msgid "pgr_connectedComponents" -msgstr "pgr_connectedComponents" +msgid "``pgr_connectedComponents``" +msgstr "``pgr_connectedComponents``" msgid "" "``pgr_connectedComponents`` — Connected components of an undirected graph " @@ -11028,13 +11067,6 @@ msgstr "Identificador del vértice que pertenece al ``component``." msgid "Connecting disconnected components" msgstr "Conectando componentes desconectados" -msgid "" -"Boost: `Connected components `__" -msgstr "" -"Boost: `Componente conectado `__" - msgid "" "wikipedia: `Connected component `__" @@ -11230,8 +11262,8 @@ msgstr "Sólo contracción sin salida" msgid "Only linear contraction" msgstr "Sólo contracción lineal" -msgid "pgr_createTopology" -msgstr "pgr_createTopology" +msgid "``pgr_createTopology``" +msgstr "``pgr_createTopology``" msgid "" "``pgr_createTopology`` — Builds a network topology based on the geometry " @@ -11485,11 +11517,8 @@ msgstr "" "En este ejemplo se inicia una topología limpia, con 5 aristas y, a " "continuación, se incrementa al resto de los bordes." -msgid "The example uses the :doc:`sampledata` network." -msgstr "En el ejemplo se utiliza la red :doc:`sampledata`." - -msgid "pgr_createVerticesTable" -msgstr "pgr_createVerticesTable" +msgid "``pgr_createVerticesTable``" +msgstr "``pgr_createVerticesTable``" msgid "" "``pgr_createVerticesTable`` — Reconstructs the vertices table based on the " @@ -11754,8 +11783,8 @@ msgstr "" "`Wikipedia: Ordenamiento Cuthill-McKee `__" -msgid "pgr_dagShortestPath - Experimental" -msgstr "pgr_dagShortestPath - Experimental" +msgid "``pgr_dagShortestPath`` - Experimental" +msgstr "``pgr_dagShortestPath`` - Experimental" msgid "" "``pgr_dagShortestPath`` — Returns the shortest path for weighted directed " @@ -11850,6 +11879,13 @@ msgstr "Columnas de Resultados" msgid "Making **start_vids** the same as **end_vids**" msgstr "Haciendo **vértices de salida** igual que **vértices destino**" +msgid "" +"`Boost: DAG shortest paths `__" +msgstr "" +"`Boost: Caminos mas cortos en DAG `__" + msgid "https://en.wikipedia.org/wiki/Topological_sorting" msgstr "https://en.wikipedia.org/wiki/Topological_sorting" @@ -11989,15 +12025,6 @@ msgstr "" msgid "Version 3.3.0" msgstr "Versión 3.3.0" -msgid "Promoted to **proposed** function" -msgstr "Promovido a función **propuesta**" - -msgid "``pgr_depthFirstSearch`` (`Single Vertex`_)" -msgstr "``pgr_depthFirstSearch`` (`Vértice único`_)" - -msgid "``pgr_depthFirstSearch`` (`Multiple Vertices`_)" -msgstr "``pgr_depthFirstSearch`` (`Vértices multiples`_)" - msgid "" "Depth First Search algorithm is a traversal algorithm which starts from a " "root vertex, goes as deep as possible, and backtracks once a vertex is " @@ -12067,18 +12094,18 @@ msgstr "" "Igual que `Vértice único`_ pero con aristas en orden descendente de ``id``." msgid "" -"`Boost: Depth First Search algorithm documentation `__" +"`Boost: Depth First Search `__" msgstr "" -"`Boost: Documentación del algoritmo de Primera Búsqueda de Profundidad " -"`__" +"`Boost: Primera Búsqueda de Profundidad `__" msgid "" -"`Boost: Undirected DFS algorithm documentation `__" +"`Boost: Undirected DFS `__" msgstr "" -"`Boost: Documentación del algoritmo DFS No dirigido `__" +"`Boost: DFS No dirigido `__" msgid "" "`Wikipedia: Depth First Search algorithm `__" +msgstr "" +"`Boost: Camino mas corto Dijkstra `__" + msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgstr "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" @@ -12364,9 +12383,6 @@ msgstr "" "``pgr_dijkstraCost`` - Coste total del camino más corto utilizando el " "algoritmo de Dijkstra." -msgid "``pgr_dijkstraCost`` (`Combinations`_)" -msgstr "``pgr_dijkstraCost`` (`Combinaciones`_)" - msgid "" "The ``pgr_dijkstraCost`` function sumarizes of the cost of the shortest path " "using Dijkstra Algorithm." @@ -12724,9 +12740,6 @@ msgstr "Cuando ``true``: solo se devolverán los resultados del límite ``cap``" msgid "When ``false``: ``cap`` limit per ``Start vid`` will be returned" msgstr "Cuando ``false``: ``cap`` límite por ``Start vid`` será devuelto" -msgid "boost: https://www.boost.org/libs/graph/doc/table_of_contents.html" -msgstr "boost: https://www.boost.org/libs/graph/doc/table_of_contents.html" - msgid "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgstr "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" @@ -12944,14 +12957,17 @@ msgstr "" msgid "Added ``depth`` and ``pred`` result columns." msgstr "Agregado las columnas de resultados``depth`` y ``pred``." -msgid "Signature change pgr_drivingDistance(single vertex)" -msgstr "Cambio de firma pgr_drivingDistance(vértice único)" +msgid "Signature change:" +msgstr "Cambio de firma:" + +msgid "pgr_drivingDistance(single vertex)" +msgstr "pgr_drivingDistance(vértice único)" -msgid "New **Official** pgr_drivingDistance(multiple vertices)" -msgstr "Nuevo **Oficial** pgr_drivingDistance(multiples vértices)" +msgid "New official signature:" +msgstr "Nueva firma oficial:" -msgid "Official:: pgr_drivingDistance(single vertex)" -msgstr "Oficial:: pgr_drivingDistance(vértice único)" +msgid "pgr_drivingDistance(multiple vertices)" +msgstr "pgr_drivingDistance(múltiples vértices)" msgid "" "Using the Dijkstra algorithm, extracts all the nodes that have costs less " @@ -13020,8 +13036,8 @@ msgstr "" "Desde vértices math:`\\{11, 16\\}` con una distancia de :math:`3.0` en un " "grafo no dirigido" -msgid "pgr_edgeColoring - Experimental" -msgstr "pgr_edgeColoring - Experimental" +msgid "``pgr_edgeColoring`` - Experimental" +msgstr "``pgr_edgeColoring`` - Experimental" msgid "" "``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free " @@ -13107,6 +13123,19 @@ msgstr "Regresa el conjunto de |result-edge-color|" msgid "Graph coloring of pgRouting :doc:`sampledata`" msgstr "Coloración de grafos de pgRouting :doc:`sampledata`" +msgid "" +"`Boost: Edge Coloring `__" +msgstr "" +"`Boost: Coloración de Segmentos `__" + +msgid "" +"`Wikipedia: Graph coloring `__" +msgstr "" +"`Wikipedia: Coloración de grafos `__" + msgid "``pgr_edgeDisjointPaths``" msgstr "``pgr_edgeDisjointPaths``" @@ -13117,9 +13146,6 @@ msgstr "" "``pgr_edgeDisjointPaths`` — Calcula las rutas de aristas desarticuladas " "entre dos grupos de vértices." -msgid "New **proposed** function:" -msgstr "Nueva función **propuesta**:" - msgid "pgr_edgeDisjointPaths(Combinations)" msgstr "pgr_edgeDisjointPaths(Combinaciones)" @@ -13224,9 +13250,6 @@ msgstr "" "maximizan el flujo de las fuentes a los destinos usando el algoritmo de " "Edmonds Karp." -msgid "``pgr_edmondsKarp`` (`Combinations`_)" -msgstr "``pgr_edmondsKarp`` (`Combinaciones`_)" - msgid "Renamed from ``pgr_maxFlowEdmondsKarp``" msgstr "Renombrado desde ``pgr_maxFlowEdmondsKarp``" @@ -13248,13 +13271,17 @@ msgstr "pgr_edmondsKarp(`SQL de aristas`_, **salidas**, **destinos**)" msgid "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" msgstr "pgr_edmondsKarp(`SQL de aristas`_, `SQL de combinaciones`_)" -msgid "https://www.boost.org/libs/graph/doc/edmonds_karp_max_flow.html" -msgstr "https://www.boost.org/libs/graph/doc/edmonds_karp_max_flow.html" +msgid "" +"`Boost: Edmonds Karp max flow `__" +msgstr "" +"`Boost: Flujo máximo Edmonds Karp `__" msgid "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" msgstr "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" -msgid "``pgr_edwardMoore - Experimental``" +msgid "``pgr_edwardMoore`` - Experimental" msgstr "``pgr_edwardMoore`` - Experimental" msgid "" @@ -13263,20 +13290,8 @@ msgstr "" "``pgr_edwardMoore`` — Devuelve la ruta más cortas usando el algoritmo Edward-" "Moore." -msgid "``pgr_edwardMoore`` (`Combinations`_)" -msgstr "``pgr_edwardMoore`` (`Combinaciones`_)" - -msgid "``pgr_edwardMoore`` (`One to One`_)" -msgstr "``pgr_edwardMoore`` (`Uno a Uno`_)" - -msgid "``pgr_edwardMoore`` (`One to Many`_)" -msgstr "``pgr_edwardMoore`` (`Uno a Muchos`_)" - -msgid "``pgr_edwardMoore`` (`Many to One`_)" -msgstr "``pgr_edwardMoore`` (`Muchos a Uno`_)" - -msgid "``pgr_edwardMoore`` (`Many to Many`_)" -msgstr "``pgr_edwardMoore`` (`Muchos a Muchos`_)" +msgid "pgr_edwardMoore(Combinations)" +msgstr "pgr_edwardMoore(Combinaciones)" msgid "" "Edward Moore’s Algorithm is an improvement of the Bellman-Ford Algorithm. It " @@ -13358,8 +13373,8 @@ msgstr "" msgid "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" msgstr "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" -msgid "pgr_extractVertices -- Proposed" -msgstr "pgr_extractVertices -- Propuesto" +msgid "``pgr_extractVertices`` -- Proposed" +msgstr "``pgr_extractVertices``-- Propuesto" msgid "``pgr_extractVertices`` — Extracts the vertices information" msgstr "``pgr_extractVertices`` — Extrae la información de los vértices" @@ -13475,23 +13490,14 @@ msgstr "" "Para obtener la consulta generada que se usa para obtener la información de " "vértices, utilice ``dryrun := true``." -msgid "``pgr_findCloseEdges``" -msgstr "``pgr_findCloseEdges``" +msgid "``pgr_findCloseEdges`` - Proposed" +msgstr "``pgr_findCloseEdges`` - Propuesto" msgid "``pgr_findCloseEdges`` - Finds the close edges to a point geometry." msgstr "" "``pgr_findCloseEdges`` - Encuentra las aristas cercanas a una geometría " "puntual." -msgid "New **proposed** signatures:" -msgstr "Nuevas firmas **propuestas**:" - -msgid "``pgr_findCloseEdges`` (`One point`_)" -msgstr "``pgr_findCloseEdges`` (`Un punto`_)" - -msgid "``pgr_findCloseEdges`` (`Many points`_)" -msgstr "``pgr_findCloseEdges`` (`Muchos puntos`_)" - msgid "" "``pgr_findCloseEdges`` - An utility function that finds the closest edge to " "a point geometry." @@ -14056,9 +14062,6 @@ msgstr "" "Boost `Algoritmo floyd-Warshall `_" -msgid "Queries uses the :doc:`sampledata` network." -msgstr "Consultas utilizan la red :doc:`sampledata`." - msgid "``pgr_full_version``" msgstr "``pgr_full_version``" @@ -14068,9 +14071,6 @@ msgstr "" "``pgr_full_version`` — Obtener los detalles de la información de la versión " "de pgRouting." -msgid "New **official** function" -msgstr "Nueva función **oficial**" - msgid "Get complete details of pgRouting version information" msgstr "Obtener los detalles de la información de la versión de pgRouting" @@ -14137,8 +14137,8 @@ msgstr "``hash``" msgid "Git hash of pgRouting build" msgstr "Hash de Git de pgRouting" -msgid "``pgr_hawickCircuits - Experimental``" -msgstr "``pgr_hawickCircuits - Experimental``" +msgid "``pgr_hawickCircuits`` - Experimental" +msgstr "``pgr_hawickCircuits`` - Experimental" msgid "" "``pgr_hawickCircuits`` — Returns the list of cirucits using hawick circuits " @@ -14147,9 +14147,6 @@ msgstr "" "``pgr_hawickCircuits`` — Enumeración de los circuitos usando el algoritmo de " "circutos de Hawick." -msgid "``pgr_hawickCircuits``" -msgstr "``pgr_hawickCircuits``" - msgid "" "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. " "James. This algorithm solves the problem of detecting and enumerating " @@ -14301,8 +14298,12 @@ msgstr "" "El nuevo grafo no es planar porque tiene un subgráfico :math:`K_5`. Las " "aristas en azul representan el subgrafo :math:`K_5`." -msgid "https://www.boost.org/libs/graph/doc/boyer_myrvold.html" -msgstr "https://www.boost.org/libs/graph/doc/boyer_myrvold.html" +msgid "" +"`Boost: Boyer Myrvold `__" +msgstr "" +"`Boost: Boyer Myrvold `__" msgid "``pgr_johnson``" msgstr "``pgr_johnson``" @@ -14472,8 +14473,8 @@ msgstr "pgr_kruskalDFS(`SQL de aristas`_, **raíz**, [``max_depth``])" msgid "pgr_kruskalDFS(`Edges SQL`_, **root vids**, [``max_depth``])" msgstr "pgr_kruskalDFS(`SQL de aristas`_, **raices**, [``max_depth``])" -msgid "pgr_lengauerTarjanDominatorTree -Experimental" -msgstr "pgr_lengauerTarjanDominatorTree -Experimental" +msgid "``pgr_lengauerTarjanDominatorTree`` - Experimental" +msgstr "``pgr_lengauerTarjanDominatorTree`` - Experimental" msgid "" "``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all " @@ -14538,11 +14539,11 @@ msgid "Dominator tree of another component." msgstr "Árbnol dominante de otro componente." msgid "" -"`Boost: Lengauer-Tarjan dominator tree algorithm `__" +"`Boost: Lengauer-Tarjan dominator `__" msgstr "" -"`Boost: Algoritmo Lengauer-Tarjan de árbol dominante `__" +"`Boost: Árbol dominante Lengauer-Tarjan `__" msgid "" "`Wikipedia: dominator tree `__" -msgid "pgr_lineGraph - Proposed" -msgstr "pgr_lineGraph - Propuesto" +msgid "``pgr_lineGraph`` - Proposed" +msgstr "``pgr_lineGraph`` - Propuesto" msgid "" "``pgr_lineGraph`` — Transforms the given graph into its corresponding edge-" @@ -14561,9 +14562,6 @@ msgstr "" "``pgr_lineGraph`` — Transforma un grafo dado en su grafo correspondiente " "basado en aristas." -msgid "Promoted to **proposed** signature." -msgstr "Promovido a firma **propuesta**." - msgid "Works for directed and undirected graphs." msgstr "Funciona para grafos dirigidos y no dirigidos." @@ -14884,16 +14882,14 @@ msgstr "" "Grafo de línea completa del subgrafo de las aristas :math:`\\{4, 7, 8, 10\\}`" msgid "" -"The examples of this section are based on the :doc:`sampledata` network. The " -"examples include the subgraph including edges 4, 7, 8, and 10 with " +"The examples include the subgraph including edges 4, 7, 8, and 10 with " "``reverse_cost``." msgstr "" -"Los ejemplos de esta sección se basan en la red :doc:`sampledata`. Los " -"ejemplos incluyen el subgrafo que incluye las aristas 4, 7, 8 y 10 con " +"Los ejemplos incluyen el sub-grafo que incluye las aristas 4, 7, 8 y 10 con " "``reverse_cost``." msgid "The data" -msgstr "" +msgstr "Los datos" msgid "" "This example displays how this graph transformation works to create " @@ -14909,7 +14905,7 @@ msgid "first" msgstr "primero" msgid "The transformation" -msgstr "" +msgstr "La transformación" msgid "|second|" msgstr "|second|" @@ -14952,7 +14948,7 @@ msgid "" msgstr "" msgid "Store edge results" -msgstr "" +msgstr "Almacenar resultados de aristas" msgid "" "The first step is to store the results of the ``pgr_lineGraphFull`` call " @@ -14966,7 +14962,7 @@ msgid "From the original graph's vertex information" msgstr "" msgid "Add the new vertices" -msgstr "" +msgstr "Agregar nuevos vértices" msgid "Filling the mapping table" msgstr "" @@ -14986,7 +14982,7 @@ msgid "Updating values from self loops" msgstr "" msgid "Inspecting the vertices table" -msgstr "" +msgstr "Inspeccionando la tabla de vértices" msgid "Updating from inner self loops" msgstr "" @@ -15128,18 +15124,18 @@ msgstr "pgr_makeConnected(`SQL de aristas`_)" msgid "Returns set of |result-component-make|" msgstr "Regresa conjunto de |result-component-make|" +msgid "List of edges that are needed to connect the graph." +msgstr "Lista de aristas que se necesitan para conectar el grafo." + msgid "" -"Query done on :doc:`sampledata` network gives the list of edges that are " -"needed to connect the graph." +"`Boost: make connected `__" msgstr "" -"La consulta realizada en la red de :doc:`sampledata` proporciona la lista de " -"aristas que se necesitan en el grafo para conectarlo." - -msgid "https://www.boost.org/libs/graph/doc/make_connected.html" -msgstr "https://www.boost.org/libs/graph/doc/make_connected.html" +"`Boost: conectar `__" -msgid "pgr_maxCardinalityMatch" -msgstr "pgr_maxCardinalityMatch" +msgid "``pgr_maxCardinalityMatch``" +msgstr "``pgr_maxCardinalityMatch``" msgid "" "``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a " @@ -15148,14 +15144,17 @@ msgstr "" "``pgr_maxCardinalityMatch`` — Calcula una coincidencia de cardinalidad " "máxima en un grafo." +msgid "pgr_maxCardinalityMatch(text) returns only ``edge`` column." +msgstr "pgr_maxCardinalityMatch(text) regresa solamente la columna ``edge``." + msgid "Deprecated signature" msgstr "" -msgid "``pgr_maxCardinalityMatch(text,boolean)``" -msgstr "``pgr_maxCardinalityMatch(text,boolean)``" +msgid "pgr_maxCardinalityMatch(text,boolean)" +msgstr "pgr_maxCardinalityMatch(text,boolean)" -msgid "``directed => false`` when used." -msgstr "" +msgid "directed => ``false`` when used." +msgstr "Con directed => `` false`` cuando se usa." msgid "Renamed from ``pgr_maximumCardinalityMatching``" msgstr "Renombrado de ``pgr_maximumCardinalityMatching``" @@ -15215,8 +15214,12 @@ msgstr "" msgid "Identifier of the edge in the original query." msgstr "Identificador de la arista en la consulta original." -msgid "https://www.boost.org/libs/graph/doc/maximum_matching.html" -msgstr "https://www.boost.org/libs/graph/doc/maximum_matching.html" +msgid "" +"`Boost: maximum_matching `__" +msgstr "" +"`Boost: Coincidencia máxima `__" msgid "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" msgstr "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" @@ -15234,12 +15237,6 @@ msgstr "" "``pgr_maxFlow`` — Calcula el flujo máximo en un gráfico dirigido desde los " "orígene(s) a los destino(s) mediante el algoritmo Push Relabel." -msgid "``pgr_maxFlow`` (`Combinations`_)" -msgstr "``pgr_maxFlow`` (`Combinaciones`_)" - -msgid "New **Proposed** function" -msgstr "Nueva función **Propuesta**" - msgid "Calculates the maximum flow from the sources to the targets." msgstr "Calcula el flujo máximo de las fuentes a los objetivos." @@ -15275,8 +15272,12 @@ msgstr "" msgid "Maximum flow possible from the source(s) to the target(s)" msgstr "Flujo máximo posible desde el/los orígen(es) hacia el/los destino(s)" -msgid "https://www.boost.org/libs/graph/doc/push_relabel_max_flow.html" -msgstr "https://www.boost.org/libs/graph/doc/push_relabel_max_flow.html" +msgid "" +"`Boost: push relabel max flow `__" +msgstr "" +"`Boost: Flujo máximo empujar reetiquetar `__" msgid "" "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" @@ -15293,8 +15294,11 @@ msgstr "" "``pgr_maxFlowMinCost`` — Calcula las aristas que minimiza el costo del flujo " "maximo en un grafo" -msgid "``pgr_maxFlowMinCost`` (`Combinations`_)" -msgstr "``pgr_maxFlowMinCost`` (`Combinaciones`_)" +msgid "pgr_maxFlowMinCost(Combinations)" +msgstr "pgr_maxFlowMinCost(Combinaciones)" + +msgid "|boost| graph inside." +msgstr "|boost| graph adentro." msgid "**TODO** check which statement is true:" msgstr "**Por hacer** comprobar qué declaración es verdadera:" @@ -15343,13 +15347,6 @@ msgstr "pgr_maxFlowMinCost(`SQL de aristas`_, `SQL de combinaciones`_)" msgid "Returns set of |result-flow-mincost|" msgstr "Regresa el conjunto de |result-flow-mincost|" -msgid "" -"https://www.boost.org/libs/graph/doc/" -"successive_shortest_path_nonnegative_weights.html" -msgstr "" -"https://www.boost.org/libs/graph/doc/" -"successive_shortest_path_nonnegative_weights.html" - msgid "``pgr_maxFlowMinCost_Cost`` - Experimental" msgstr "``pgr_maxFlowMinCost_Cost`` - Experimental" @@ -15360,8 +15357,8 @@ msgstr "" "``pgr_maxFlowMinCost_Cost`` — Calcula el costo mínimo para el máximo flujo " "en un grafo" -msgid "``pgr_maxFlowMinCost_Cost`` (`Combinations`_)" -msgstr "``pgr_maxFlowMinCost_Cost`` (`Combinaciones`_)" +msgid "pgr_maxFlowMinCost_Cost(Combinations)" +msgstr "pgr_maxFlowMinCost_Cost(Combinaciones)" msgid "**The cost value of all input edges must be nonnegative.**" msgstr "" @@ -15397,8 +15394,8 @@ msgstr "" "Coste Mínimo Flujo Máximo posible desde el/los origen(es) hasta el/los " "objetivo(s)" -msgid "pgr_nodeNetwork" -msgstr "pgr_nodeNetwork" +msgid "``pgr_nodeNetwork``" +msgstr "``pgr_nodeNetwork``" msgid "``pgr_nodeNetwork`` - Nodes an network edge table." msgstr "" @@ -15782,6 +15779,8 @@ msgstr "Firma" msgid "" "pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" msgstr "" +"pgr_pickDeliver(`SQL de ordenes`_, `SQL de vehículos`_, `SQL de matriz`_, " +"[**opciones**])" msgid "**options:** ``[factor, max_cycles, initial_sol]``" msgstr "**opcionales:** ``[factor, max_cycles, initial_sol]``" @@ -16021,9 +16020,6 @@ msgstr "" "``pgr_pushRelabel`` — Calcula el flujo en los bordes del grafo que maximiza " "el flujo de los orígenes a los destinos mediante el Algoritmo Push Relabel." -msgid "``pgr_pushRelabel`` (`Combinations`_)" -msgstr "``pgr_pushRelabel`` (`Combinaciones`_)" - msgid "Renamed from ``pgr_maxFlowPushRelabel``" msgstr "Renombrado de ``pgr_maxFlowPushRelabel``" @@ -16042,8 +16038,8 @@ msgstr "pgr_pushRelabel(`SQL de aristas`_, **salidas**, **destinos**)" msgid "pgr_pushRelabel(`Edges SQL`_, `Combinations SQL`_)" msgstr "pgr_pushRelabel(`SQL de aristas`_, `SQL de combinaciones`_)" -msgid "pgr_sequentialVertexColoring - Proposed" -msgstr "pgr_sequentialVertexColoring - Propuesto" +msgid "``pgr_sequentialVertexColoring`` - Proposed" +msgstr "``pgr_sequentialVertexColoring`` - Propuesto" msgid "" "``pgr_sequentialVertexColoring`` — Returns the vertex coloring of an " @@ -16052,9 +16048,6 @@ msgstr "" "``pgr_sequentialVertexColoring`` — Devuelve el color de vértice de un grafo " "no dirigido, utilizando un enfoque codicioso." -msgid "Promoted to **proposed** signature" -msgstr "Promovido a firma **propuesta**" - msgid "" "Sequential vertex coloring algorithm is a graph coloring algorithm in which " "color identifiers are assigned to the vertices of a graph in a sequential " @@ -16113,8 +16106,15 @@ msgstr ":math:`k` es el número de colores utilizados." msgid "pgr_sequentialVertexColoring(`Edges SQL`_)" msgstr "pgr_sequentialVertexColoring(`SQL de aristas`_)" -msgid "pgr_stoerWagner - Experimental" -msgstr "pgr_stoerWagner - Experimental" +msgid "" +"`Boost: Sequential Vertex Coloring `__" +msgstr "" +"`Boost: Coloración Secuencial de Vértices `__" + +msgid "``pgr_stoerWagner`` - Experimental" +msgstr "``pgr_stoerWagner`` - Experimental" msgid "``pgr_stoerWagner`` — The min-cut of graph using stoerWagner algorithm." msgstr "" @@ -16220,6 +16220,13 @@ msgstr "corte mínimo de una arista" msgid "Using :doc:`pgr_connectedComponents`" msgstr "Usando :doc:`pgr_connectedComponents`" +msgid "" +"`Boost: Stoer Wagner min cut `__" +msgstr "" +"`Boost: Corte mínimo Stoer Wagner `__" + msgid "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" msgstr "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" @@ -16253,10 +16260,10 @@ msgid "The strong components of the graph" msgstr "Los componentes fuertes del grafo" msgid "" -"Boost: `Strong components `__" msgstr "" -"Boost: `Components fuertemente conectados `__" msgid "" @@ -16329,6 +16336,13 @@ msgstr "" msgid "Graph is not a DAG" msgstr "" +msgid "" +"`Boost: topological sort `__" +msgstr "" +"`Boost: Ordenamiento topológico `__" + msgid "``pgr_transitiveClosure`` - Experimental" msgstr "``pgr_transitiveClosure`` - Experimental" @@ -16385,50 +16399,54 @@ msgid "Identifiers of the vertices that are reachable from vertex v." msgstr "" "Identificadores de los vértices que son alcanzables desde el vértice v." +msgid "" +"`Boost: transitive closure `__" +msgstr "" +"`Boost: Cierre transitivo `__" + msgid "https://en.wikipedia.org/wiki/Transitive_closure" msgstr "https://en.wikipedia.org/wiki/Transitive_closure" -msgid "pgr_trsp - Proposed" -msgstr "" +msgid "``pgr_trsp``" +msgstr "``pgr_trsp``" msgid "``pgr_trsp`` - routing vertices with restrictions." msgstr "``pgr_trsp`` - Ruteo con restricciones." -msgid "New proposed signatures" -msgstr "Nuevas firmas propuestas" +msgid "pgr_trsp(One to One)" +msgstr "pgr_trsp(Uno a Uno)" -msgid "``pgr_trsp`` (`One to One`_)" -msgstr "``pgr_trsp`` (`Uno a Uno`_)" - -msgid "``pgr_trsp`` (`One to Many`_)" -msgstr "" +msgid "pgr_trsp(One to Many)" +msgstr "pgr_trsp(Uno a Muchos)" -msgid "``pgr_trsp`` (`Many to One`_)" -msgstr "" +msgid "pgr_trsp(Many to One)" +msgstr "pgr_trsp(Muchos a Uno)" -msgid "``pgr_trsp`` (`Many to Many`_)" -msgstr "" +msgid "pgr_trsp(Many to Many)" +msgstr "pgr_trsp(Muchos a Muchos)" -msgid "``pgr_trsp`` (`Combinations`_)" -msgstr "" +msgid "pgr_trsp(Combinations)" +msgstr "pgr_trsp(Combinaciones)" msgid "Deprecated signatures" msgstr "Firmas obsoletas" -msgid "``pgr_trsp(text,integer,float,integer,float,boolean,boolean,text)``" -msgstr "" +msgid "pgr_trsp(text,integer,float,integer,float,boolean,boolean,text)" +msgstr "pgr_trsp(text,integer,float,integer,float,boolean,boolean,text)" -msgid "``pgr_trspViaVertices(text,anyarray,boolean,boolean,text)``" -msgstr "" +msgid "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" +msgstr "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" msgid "New prototypes" msgstr "Nuevos prototipos" -msgid "``pgr_trspViaVertices``" -msgstr "``pgr_trspViaVertices``" +msgid "pgr_trspViaVertices" +msgstr "pgr_trspViaVertices" -msgid "``pgr_trspViaEdges``" -msgstr "``pgr_trspViaEdges``" +msgid "pgr_trspViaEdges" +msgstr "pgr_trspViaEdges" msgid "" "Turn restricted shortest path (TRSP) is an algorithm that receives turn " @@ -16509,20 +16527,15 @@ msgstr "Usando una tabla de combinaciones en un grafo no dirigido." msgid "" "`Deprecated documentation `_" msgstr "" +"`Documentación obsoleta `_" -msgid "``pgr_trspVia`` - Proposed" -msgstr "" +msgid "``pgr_trspVia``" +msgstr "``pgr_trspVia``" msgid "" "``pgr_trspVia`` Route that goes through a list of vertices with restrictions." msgstr "" -msgid "New proposed function:" -msgstr "" - -msgid "``pgr_trspVia`` (`One Via`_)" -msgstr "" - msgid "" "Given a list of vertices and a graph, this function is equivalent to finding " "the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :" @@ -16533,7 +16546,7 @@ msgid "The paths represents the sections of the route." msgstr "Las trayectorias representan los tramos de la ruta." msgid "Execute a :doc:`pgr_dijkstraVia`." -msgstr "" +msgstr "Ejecutar un :doc:`pgr_dijkstraVia`." msgid "" "For the set of sub paths of the solution that pass through a restriction then" @@ -16604,17 +16617,14 @@ msgstr "" msgid ":doc:`via-category`" msgstr ":doc:`via-category`" -msgid "``pgr_trspVia_withPoints`` - Proposed" -msgstr "" +msgid "``pgr_trspVia_withPoints``" +msgstr "``pgr_trspVia_withPoints``" msgid "" "``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/" "or points with restrictions." msgstr "" -msgid "``pgr_trspVia_withPoints`` (`One Via`_)" -msgstr "" - msgid "" "Given a graph, a set of restriction on the graph edges, a set of points on " "the graphs edges and a list of vertices, this function is equivalent to " @@ -16746,7 +16756,7 @@ msgid "Status of \"passes in front\" or \"visits\" of the nodes and points." msgstr "" msgid "The algorithm performs a :doc:`pgr_withPointsVia`" -msgstr "" +msgstr "El algoritmo realiza una :doc:`pgr_withPointsVia`" msgid "" "Detects which of the paths pass through a restriction in this case is for " @@ -16784,30 +16794,12 @@ msgid "" "`pgr_trsp` algorithm. In this case a U turn is been done using the same edge." msgstr "" -msgid "pgr_trsp_withPoints - Proposed" -msgstr "" +msgid "``pgr_trsp_withPoints``" +msgstr "``pgr_trsp_withPoints``" msgid "``pgr_trsp_withPoints`` Routing Vertex/Point with restrictions." msgstr "" -msgid "New proposed signatures:" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (`One to One`_)" -msgstr "``pgr_trsp_withPoints`` (`Uno a Uno`_)" - -msgid "``pgr_trsp_withPoints`` (`One to Many`_)" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (`Many to One`_)" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (`Many to Many`_)" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (`Combinations`_)" -msgstr "" - msgid "" "Modify the graph to include points defined by points_sql. Using Dijkstra " "algorithm, find the shortest path" @@ -16951,17 +16943,15 @@ msgstr "" "Desde el punto :math:`1` y el vértice :math:`6` al punto :math:`3` y el " "vértice :math:`1` en un grafo no dirigido, con detalles." -msgid "pgr_turnRestrictedPath - Experimental" -msgstr "pgr_turnRestrictedPath - Experimental" +msgid "``pgr_turnRestrictedPath`` - Experimental" +msgstr "``pgr_turnRestrictedPath`` - Experimental" -#, fuzzy msgid "" "``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex - Vertex routing " "with restrictions" -msgstr ":doc:`pgr_trsp` - Ruteo Vértice - Vértice con restricciones." - -msgid "New experimental function" -msgstr "Nueva función Experimental" +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 " @@ -17037,8 +17027,8 @@ msgstr "pgr_version()" msgid "pgRouting Version for this documentation" msgstr "Versión de pgRouting para esta documentación" -msgid "pgr_vrpOneDepot - Experimental" -msgstr "pgr_vrpOneDepot - Experimental" +msgid "``pgr_vrpOneDepot`` - Experimental" +msgstr "``pgr_vrpOneDepot`` - Experimental" msgid "**No documentation available**" msgstr "**No hay documentación disponible**" @@ -17046,8 +17036,8 @@ msgstr "**No hay documentación disponible**" msgid "**TBD**" msgstr "**TBD**" -msgid "``pgr_withPoints`` - Proposed" -msgstr "``pgr_withPoints`` - Propuesto" +msgid "``pgr_withPoints``" +msgstr "``pgr_withPoints``" msgid "" "``pgr_withPoints`` - Returns the shortest path in a graph with additional " @@ -17222,8 +17212,8 @@ msgstr "Del punto :math:`6` al vértice :math:`11`." msgid "Passes in front or visits with left side driving." msgstr "Pasa enfrente o visita con lado izquierdo de manejo." -msgid "``pgr_withPointsCost`` - Proposed" -msgstr "``pgr_withPointsCost`` - Propuesto" +msgid "``pgr_withPointsCost``" +msgstr "``pgr_withPointsCost``" msgid "" "``pgr_withPointsCost`` - Calculates the shortest path and returns only the " @@ -17406,8 +17396,8 @@ msgstr "Topología de manejo del lado izquierdo" msgid "Does not matter driving side driving topology" msgstr "No importa el lado de manejo" -msgid "``pgr_withPointsCostMatrix`` - proposed" -msgstr "``pgr_withPointsCostMatrix`` - propuesto" +msgid "``pgr_withPointsCostMatrix``" +msgstr "``pgr_withPointsCostMatrix``" msgid "" "``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:" @@ -17446,8 +17436,8 @@ msgstr "" "Encontrar la matriz de costos de las rutas desde el vértice :math:`1` y las " "dos ubicaciones más cercanas en el grafo al punto `(2.9, 1.8)`." -msgid "``pgr_withPointsDD`` - Proposed" -msgstr "``pgr_withPointsDD`` - Propuesto" +msgid "``pgr_withPointsDD``" +msgstr "``pgr_withPointsDD``" msgid "" "``pgr_withPointsDD`` - Returns the driving **distance** from a starting " @@ -17461,8 +17451,11 @@ msgid "" "unnamed compulsory **driving side**." msgstr "" -msgid "``pgr_withPointsDD`` (`Single vertex`)" -msgstr "``pgr_withPointsDD`` (`Vértice único`)" +msgid "pgr_withPointsDD(Single vertex)" +msgstr "pgr_withPointsDD(Vértice único)" + +msgid "pgr_withPointsDD(Multiple vertices)" +msgstr "pgr_withPointsDD(Múltiples vértices)" msgid "Added ``depth``, ``pred`` and ``start_vid`` column." msgstr "Agregado las columnas ``depth``, ``pred`` y ``start_vid``." @@ -17479,18 +17472,16 @@ msgid "" msgstr "" msgid "" -"``pgr_withpointsdd(text,text,bigint,double precision,boolean,character," -"boolean)``" +"pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" msgstr "" -"``pgr_withpointsdd(text,text,bigint,double precision,boolean,character," -"boolean)``" +"pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" msgid "" -"``pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)``" +"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," +"boolean,boolean)" msgstr "" -"``pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)``" +"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," +"boolean,boolean)" msgid "" "Modify the graph to include points and using Dijkstra algorithm, extracts " @@ -17622,8 +17613,8 @@ msgstr "" msgid ":doc:`pgr_alphaShape`" msgstr ":doc:`pgr_alphaShape`" -msgid "pgr_withPointsKSP - Proposed" -msgstr "pgr_withPointsKSP - Propuesto" +msgid "``pgr_withPointsKSP``" +msgstr "``pgr_withPointsKSP``" msgid "" "``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." @@ -17634,29 +17625,26 @@ msgstr "" msgid "Standarizing output columns to |nksp-result|" msgstr "" -msgid "``pgr_withPointsKSP`` (One to One)" -msgstr "``pgr_withPointsKSP`` (Uno a Uno)" - -msgid "New overload functions" -msgstr "Nuevas funciones de sobrecarga" +msgid "pgr_withPointsKSP(One to One)" +msgstr "pgr_withPointsKSP(Uno a Uno)" -msgid "``pgr_withPointsKSP`` (One to Many)" -msgstr "``pgr_withPointsKSP`` (Uno a Muchos)" +msgid "pgr_withPointsKSP(One to Many)" +msgstr "pgr_withPointsKSP(Uno a Muchos)" -msgid "``pgr_withPointsKSP`` (Many to One)" -msgstr "``pgr_withPointsKSP`` (Muchos a Uno)" +msgid "pgr_withPointsKSP(Many to One)" +msgstr "pgr_withPointsKSP(Muchos a Uno)" -msgid "``pgr_withPointsKSP`` (Many to Many)" -msgstr "``pgr_withPointsKSP`` (Muchos a Muchos)" +msgid "pgr_withPointsKSP(Many to Many)" +msgstr "pgr_withPointsKSP(Muchos a Muchos)" -msgid "``pgr_withPointsKSP`` (Combinations)" -msgstr "``pgr_withPointsKSP`` (Combinaciones)" +msgid "pgr_withPointsKSP(Combinations)" +msgstr "pgr_withPointsKSP(Combinaciones)" msgid "" -"``pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," +"pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," "boolean)``" msgstr "" -"``pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," +"pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," "boolean)``" msgid "" @@ -17809,16 +17797,14 @@ msgstr "" "Obtener :math:`2` rutas, usando topología de manejo por la derecha, desde el " "punto :math:`1` al punto :math:`2`, detallado y con rutas procesadas." -msgid "``pgr_withPointsVia`` - Proposed" -msgstr "" +msgid "``pgr_withPointsVia``" +msgstr "``pgr_withPointsVia``" msgid "" "``pgr_withPointsVia`` - Route that goes through a list of vertices and/or " "points." msgstr "" - -msgid "New **proposed** function ``pgr_withPointsVia`` (`One Via`_)" -msgstr "" +"``pgr_withPointsVia`` - Ruta que recorre una lista de vértices y/o puntos." msgid "" "Given a graph, a set of points on the graphs edges and a list of vertices, " @@ -17831,7 +17817,7 @@ msgid "" "pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, " "[**options**])" msgstr "" -"pgr_withPointsVia(`SQL de aristas`_, `SQL de puntos`_, ****vértices****, " +"pgr_withPointsVia(`SQL de aristas`_, `SQL de puntos`_, ** via de vértices**, " "[**opciones**])" msgid "" @@ -17919,7 +17905,7 @@ msgid ":doc:`pgr_withPointsKSP` - K shortest paths." msgstr ":doc:`pgr_withPointsKSP` - rutas más cortas K." msgid ":doc:`pgr_withPointsDD` - Driving distance." -msgstr ":doc:`pgr_withPointsDD` - Distancia de conducción." +msgstr ":doc:`pgr_withPointsDD` - Distancia de manejo." msgid ":doc:`pgr_withPointsVia` - Via routing" msgstr ":doc:`pgr_withPointsVia` - Ruteo vía ubicaciones" @@ -17951,9 +17937,8 @@ msgstr ":doc:`withPoints-family` - Funciones basadas en el algoritmo Dijkstra." msgid "From the :doc:`TRSP-family`:" msgstr "Desde :doc:`TRSP-family` :" -#, fuzzy msgid "Utilities Category" -msgstr "Utilidades" +msgstr "Utilidades - Categoría" msgid ":doc:`pgr_findCloseEdges`" msgstr ":doc:`pgr_findCloseEdges`" @@ -17974,16 +17959,14 @@ msgstr "" msgid "Mayors" msgstr "" -#, fuzzy msgid "pgRouting 4" -msgstr "pgRouting 3.4" +msgstr "pgRouting 4" msgid "Minors 4.x" msgstr "" -#, fuzzy msgid "pgRouting 4.0" -msgstr "pgRouting 3.0" +msgstr "pgRouting 4.0" msgid "pgRouting 3" msgstr "pgRouting 3" @@ -17994,30 +17977,46 @@ msgstr "" msgid "pgRouting 3.7" msgstr "pgRouting 3.7" -#, fuzzy +msgid "pgRouting 3.7.3 Release Notes" +msgstr "Notas de la versión de pgRouting 3.7.3" + +msgid "" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.7.3 `__" +msgstr "" +"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " +"versión, consulte la `meta cerrada 3.7.3 `__" + +msgid "" +"`#2731 `__ Build Failure " +"on Ubuntu 22" +msgstr "" +"`#2731 `__ Construcción " +"falla en Ubuntu 22" + msgid "pgRouting 3.7.2 Release Notes" -msgstr "Notas de la versión de pgRouting 3.7.0" +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 `Git closed " "milestone for 3.7.2 `__" msgstr "" "Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.7.0 `_" +"versión, consulte la `meta cerrada 3.7.2 `__" msgid "Build" msgstr "Construir" -#, fuzzy msgid "" "`#2713 `__ cmake missing " "some policies and min version" msgstr "" -"`#2517 `__ Simplificación " -"del código de Astar." +"`#2713 `__ cmake le falta " +"algunas políticas y versión minima" msgid "Using OLD policies: CMP0148, CMP0144, CMP0167" msgstr "" @@ -18025,59 +18024,51 @@ msgstr "" msgid "Minimum cmake version 3.12" msgstr "" -#, fuzzy msgid "" "`#2707 `__ Build failure " "in pgRouting 3.7.1 on Alpine" msgstr "" -"`#2607 `__ Leer datos " -"postgresql en C++" +"`#2707 `__ Falla de " +"construcción en Alpine para pgRouting 3.7.1" -#, fuzzy msgid "" "`#2706 `__ winnie crashing " "on pgr_betweennessCentrality" msgstr "" -"`#2505 `__ Usando " -"namespace." +"`#2706 `__ winnie falla en " +"pgr_betweennessCentrality" -#, fuzzy msgid "pgRouting 3.7.1 Release Notes" -msgstr "Notas de la versión de pgRouting 3.7.0" +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 `Git closed " "milestone for 3.7.1 `__" msgstr "" "Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.7.0 `_" +"versión, consulte la `meta cerrada 3.7.1 `__" -#, fuzzy msgid "" "`#2680 `__ fails to " "compile under mingw64 gcc 13.2" msgstr "" -"`#2588 `__ pgrouting 3.6.0 " -"no construye en OSX" +"`#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 "" -"`#2490 `__ Lígas " -"automáticas historiales." +"`#2689 `__ Cuando el punto " +"es un vértice, la familia withPoints no devuelve resultados." -#, fuzzy msgid "C/C++ code enhancemet" -msgstr "Mejora de código C/C++" +msgstr "Mejora del código C/C++" -#, fuzzy msgid "TRSP family" -msgstr "Familia Prim" +msgstr "Familia TRSP" msgid "pgRouting 3.7.0 Release Notes" msgstr "Notas de la versión de pgRouting 3.7.0" @@ -18296,18 +18287,6 @@ msgstr "" "`#2516 `__ estandarización " "de resultados de pgr_aStar" -msgid "" -"``pgr_aStar`` (`One to One`) added ``start_vid`` and ``end_vid`` columns." -msgstr "" -"``pgr_aStar`` (`Uno a Uno`) ha añadido las columnas ``start_vid`` y " -"``end_vid``." - -msgid "``pgr_aStar`` (`One to Many`) added ``end_vid`` column." -msgstr "``pgr_aStar`` (`Uno a Muchos`) ha añadido la columna ``end_vid``." - -msgid "``pgr_aStar`` (`Many to One`) added ``start_vid`` column." -msgstr "``pgr_aStar`` (`Muchos a Uno`) ha añadido la columna ``start_vid``." - msgid "" "`#2523 `__ Standarize " "output pgr_bdAstar" @@ -18315,18 +18294,6 @@ msgstr "" "`#2523 `__ Estandarización " "de resultados de pgr_bdAstar" -msgid "" -"``pgr_bdAstar`` (`One to One`) added ``start_vid`` and ``end_vid`` columns." -msgstr "" -"``pgr_bdAstar`` (`Uno a Uno`) ha añadido las columnas ``start_vid`` y " -"``end_vid``." - -msgid "``pgr_bdAstar`` (`One to Many`) added ``end_vid`` column." -msgstr "``pgr_bdAstar`` (`Uno a Muchos`) ha añadido la columna ``end_vid``." - -msgid "``pgr_bdAstar`` (`Many to One`) added ``start_vid`` column." -msgstr "``pgr_bdAstar`` (`Muchos a Uno`) ha añadido la columna ``start_vid``." - msgid "" "`#2547 `__ Standarize " "output and modifying signature pgr_KSP" @@ -18336,10 +18303,10 @@ msgstr "" msgid "" "`#2548 `__ Standarize " -"output pgr_drivingdistance" +"output pgr_drivingDistance" msgstr "" "`#2548 `__ Estandarización " -"de resultados de pgr_drivingdistance" +"de resultados de pgr_drivingDistance" msgid "Proposed functions changes" msgstr "Cambios en funciones propuestas" @@ -18465,13 +18432,12 @@ msgstr "" msgid "Issue fixes" msgstr "Corrección de problema" -#, fuzzy msgid "" "`#2565 `__ " "pgr_lengauerTarjanDominatorTree triggers an assertion" msgstr "" "`#2565 `__ " -"pgr_pgr_lengauerTarjanDominatorTree genera un error de afirmación" +"pgr_lengauerTarjanDominatorTree genera un error de afirmación" msgid "SQL enhancements" msgstr "Mejoras SQL" @@ -18517,18 +18483,6 @@ msgstr "" msgid "Dijkstra" msgstr "Dijkstra" -msgid "" -"``pgr_dijkstra`` (`One to One`) added ``start_vid`` and ``end_vid`` columns." -msgstr "" -"``pgr_dijkstra`` (`Uno a Uno`) ha añadido las columnas ``start_vid`` y " -"``end_vid``." - -msgid "``pgr_dijkstra`` (`One to Many`) added ``end_vid`` column." -msgstr "``pgr_dijkstra`` (`Uno a Muchos`) ha añadido la columna ``end_vid``." - -msgid "``pgr_dijkstra`` (`Many to One`) added ``start_vid`` column." -msgstr "``pgr_dijkstra`` (`Muchos a Uno`) ha añadido la columna ``start_vid``." - msgid "pgRouting 3.4" msgstr "pgRouting 3.4" @@ -18603,14 +18557,14 @@ msgid "" "doesn't give all correct shortest path" msgstr "" -msgid "New proposed functions" -msgstr "Nuevas funciones propuestas" +msgid "New proposed functions." +msgstr "Nuevas funciones propuestas." msgid "With points" msgstr "Con puntos" -msgid "``pgr_withPointsVia`` (One Via)" -msgstr "``pgr_withPointsVia`` (Una trayectoria)" +msgid "pgr_withPointsVia(One Via)" +msgstr "pgr_withPointsVia(Una Vía)" msgid "Turn Restrictions" msgstr "Restricciones de giro" @@ -18618,89 +18572,68 @@ msgstr "Restricciones de giro" msgid "Via with turn restrictions" msgstr "Trayectoria con restricciones de giro" -msgid "``pgr_trspVia`` (One Via)" -msgstr "" - -msgid "``pgr_trspVia_withPoints`` (One Via)" -msgstr "``pgr_trspVia_withPoints`` (Muchas trayectorias)" - -msgid "``pgr_trsp``" -msgstr "``pgr_trsp``" - -msgid "``pgr_trsp`` (One to One)" -msgstr "``pgr_trsp`` (Uno a Uno)" - -msgid "``pgr_trsp`` (One to Many)" -msgstr "``pgr_trsp`` (Uno a Muchos)" +msgid "pgr_trspVia(One Via)" +msgstr "pgr_trspVia(Una Vía)" -msgid "``pgr_trsp`` (Many to One)" -msgstr "``pgr_trsp`` (Muchos a Uno)" +msgid "pgr_trspVia_withPoints(One Via)" +msgstr "pgr_trspVia_withPoints(Una Vía)" -msgid "``pgr_trsp`` (Many to Many)" -msgstr "``pgr_trsp`` (Muchos a Muchos)" +msgid "pgr_trsp_withPoints(One to One)" +msgstr "pgr_trsp_withPoints(Uno a Uno)" -msgid "``pgr_trsp`` (Combinations)" -msgstr "``pgr_trsp`` (Combinaciones)" +msgid "pgr_trsp_withPoints(One to Many)" +msgstr "pgr_trsp_withPoints(Uno a Muchos)" -msgid "``pgr_trsp_withPoints``" -msgstr "``pgr_trsp_withPoints``" - -msgid "``pgr_trsp_withPoints`` (One to One)" -msgstr "``pgr_trsp_withPoints`` (Uno a Uno)" - -msgid "``pgr_trsp_withPoints`` (One to Many)" -msgstr "``pgr_trsp_withPoints`` (Uno a Muchos)" +msgid "pgr_trsp_withPoints(Many to One)" +msgstr "pgr_trsp_withPoints(Muchos a Uno)" -msgid "``pgr_trsp_withPoints`` (Many to One)" -msgstr "``pgr_trsp_withPoints`` (Muchos a Uno)" +msgid "pgr_trsp_withPoints(Many to Many)" +msgstr "pgr_trsp_withPoints(Muchos a Muchos)" -msgid "``pgr_trsp_withPoints`` (Many to Many)" -msgstr "``pgr_trsp_withPoints`` (Muchos a Muchos)" - -msgid "``pgr_trsp_withPoints`` (Combinations)" -msgstr "``pgr_trsp_withPoints`` (Combinaciones)" +msgid "pgr_trsp_withPoints(Combinations)" +msgstr "pgr_trsp_withPoints(Combinaciones)" msgid "Topology" msgstr "Topología" -msgid "``pgr_degree``" -msgstr "" - msgid "Utilities" msgstr "Utilidades" -msgid "``pgr_findCloseEdges`` (One point)" -msgstr "" +msgid "pgr_findCloseEdges(One point)" +msgstr "pgr_findCloseEdges(Un punto)" -msgid "``pgr_findCloseEdges`` (Many points)" -msgstr "" +msgid "pgr_findCloseEdges(Many points)" +msgstr "pgr_findCloseEdges(Muchos puntos)" msgid "Ordering" msgstr "Ordenamiento" -msgid "``pgr_cuthillMckeeOrdering``" -msgstr "``pgr_cuthillMckeeOrdering``" +msgid "pgr_cuthillMckeeOrdering" +msgstr "pgr_cuthillMckeeOrdering" msgid "Unclassified" msgstr "No clasificado" +msgid "pgr_hawickCircuits" +msgstr "pgr_hawickCircuits" + msgid "Flow functions" msgstr "Funciones de flujo" -msgid "``pgr_maxCardinalityMatch(text)``" -msgstr "``pgr_maxCardinalityMatch(text)``" +msgid "pgr_maxCardinalityMatch(text)" +msgstr "pgr_maxCardinalityMatch(text)" -msgid "Deprecating ``pgr_maxCardinalityMatch(text,boolean)``" -msgstr "" +msgid "Deprecating: pgr_maxCardinalityMatch(text,boolean)" +msgstr "Ossoleto: pgr_maxCardinalityMatch(text,boolean)" msgid "Deprecated Functions" msgstr "Funciones obsoletas" -msgid "``pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)``" -msgstr "``pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)``" +msgid "pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)" +msgstr "pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)" -msgid "``pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text)``" -msgstr "" +msgid "pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text)" +msgstr "pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text)" msgid "pgRouting 3.3" msgstr "pgRouting 3.3" @@ -19018,12 +18951,6 @@ msgstr "" msgid "Removing support for Boost v1.53, v1.54 & v1.55" msgstr "Eliminación de soporte para Boost v1.53, v1.54 & v1.55" -msgid "pgr_bellmanFord(Combinations)" -msgstr "pgr_bellmanFord(Combinaciones)" - -msgid "pgr_binaryBreadthFirstSearch(Combinations)" -msgstr "pgr_binaryBreadthFirstSearch(Combinaciones)" - msgid "pgr_bipartite" msgstr "pgr_bipartite" @@ -19033,9 +18960,6 @@ msgstr "pgr_depthFirstSearch" msgid "Dijkstra Near" msgstr "Dijkstra Cercano" -msgid "pgr_edwardMoore(Combinations)" -msgstr "pgr_edwardMoore(Combinaciones)" - msgid "pgr_isPlanar" msgstr "pgr_isPlanar" @@ -19045,51 +18969,15 @@ msgstr "pgr_lengauerTarjanDominatorTree" msgid "pgr_makeConnected" msgstr "pgr_makeConnected" -msgid "pgr_maxFlowMinCost(Combinations)" -msgstr "pgr_maxFlowMinCost(Combinaciones)" - -msgid "pgr_maxFlowMinCost_Cost(Combinations)" -msgstr "pgr_maxFlowMinCost_Cost(Combinaciones)" - msgid "Astar" msgstr "Astar" -msgid "pgr_aStar(Combinations)" -msgstr "pgr_aStar(Combinaciones)" - -msgid "pgr_aStarCost(Combinations)" -msgstr "pgr_aStarCost(Combinaciones)" - -msgid "Bidirectional Astar" -msgstr "Astar Bidireccional" - -msgid "pgr_bdAstar(Combinations)" -msgstr "pgr_bdAstar(Combinaciones)" - -msgid "pgr_bdAstarCost(Combinations)" -msgstr "pgr_bdAstarCost(Combinaciones)" +msgid "Bidirectional Astar" +msgstr "Astar Bidireccional" msgid "Bidirectional Dijkstra" msgstr "Dijkstra Bidireccional" -msgid "pgr_bdDijkstra(Combinations)" -msgstr "pgr_bdDijkstra(Combinaciones)" - -msgid "pgr_bdDijkstraCost(Combinations)" -msgstr "pgr_bdDijkstraCost(Combinaciones)" - -msgid "pgr_boykovKolmogorov(Combinations)" -msgstr "pgr_boykovKolmogorov(Combinaciones)" - -msgid "pgr_edmondsKarp(Combinations)" -msgstr "pgr_edmondsKarp(Combinaciones)" - -msgid "pgr_maxFlow(Combinations)" -msgstr "pgr_maxFlow(Combinaciones)" - -msgid "pgr_pushRelabel(Combinations)" -msgstr "pgr_pushRelabel(Combinaciones)" - msgid "pgRouting 3.1" msgstr "pgRouting 3.1" @@ -19407,8 +19295,8 @@ msgstr "" "`#1006 `__: No hay " "pérdida de información2" -msgid "New functions" -msgstr "Nuevas funciones" +msgid "New Functions" +msgstr "Nuevas Funciones" msgid "Kruskal family" msgstr "Familia Kruskal" @@ -19446,149 +19334,95 @@ msgstr "Propuesta cambió a oficial en pgRouting" msgid "aStar Family" msgstr "Familia aStar" -msgid "pgr_aStar(one to many)" -msgstr "pgr_aStar(Uno a Muchos)" - -msgid "pgr_aStar(many to one)" -msgstr "pgr_aStar(muchos a uno)" - -msgid "pgr_aStar(many to many)" -msgstr "pgr_aStar(muchos a muchos)" - -msgid "pgr_aStarCost(one to one)" +msgid "pgr_aStarCost(One to One)" msgstr "pgr_aStarCost(Uno a Uno)" -msgid "pgr_aStarCost(one to many)" +msgid "pgr_aStarCost(One to Many)" msgstr "pgr_aStarCost(Uno a Muchos)" -msgid "pgr_aStarCost(many to one)" -msgstr "pgr_aStarCost(muchos a uno)" +msgid "pgr_aStarCost(Many to One)" +msgstr "pgr_aStarCost(Muchos a Uno)" -msgid "pgr_aStarCost(many to many)" -msgstr "pgr_aStarCost(muchos a muchos)" +msgid "pgr_aStarCost(Many to Many)" +msgstr "pgr_aStarCost(Muchos a Muchos)" -msgid "pgr_aStarCostMatrix(one to one)" -msgstr "pgr_aStarCostMatrix(Uno a Uno)" - -msgid "pgr_aStarCostMatrix(one to many)" -msgstr "pgr_aStarCostMatrix(Uno a Muchos)" - -msgid "pgr_aStarCostMatrix(many to one)" -msgstr "pgr_aStarCostMatrix(muchos a uno)" - -msgid "pgr_aStarCostMatrix(many to many)" -msgstr "pgr_aStarCostMatrix(muchos a muchos)" +msgid "pgr_aStarCostMatrix" +msgstr "pgr_aStarCostMatrix" msgid "bdAstar Family" msgstr "Familia bdAstar" -msgid "pgr_bdAstar(one to many)" -msgstr "pgr_bdAstar(Uno a Muchos)" - -msgid "pgr_bdAstar(many to one)" -msgstr "pgr_bdAstar(muchos a uno)" - -msgid "pgr_bdAstar(many to many)" -msgstr "pgr_bdAstar(muchos a muchos)" - -msgid "pgr_bdAstarCost(one to one)" +msgid "pgr_bdAstarCost(One to One)" msgstr "pgr_bdAstarCost(Uno a Uno)" -msgid "pgr_bdAstarCost(one to many)" +msgid "pgr_bdAstarCost(One to Many)" msgstr "pgr_bdAstarCost(Uno a Muchos)" -msgid "pgr_bdAstarCost(many to one)" -msgstr "pgr_bdAstarCost(muchos a uno)" - -msgid "pgr_bdAstarCost(many to many)" -msgstr "pgr_bdAstarCost(muchos a muchos)" - -msgid "pgr_bdAstarCostMatrix(one to one)" -msgstr "pgr_bdAstarCostMatrix(Uno a Uno)" +msgid "pgr_bdAstarCost(Many to One)" +msgstr "pgr_bdAstarCost(Muchos a Uno)" -msgid "pgr_bdAstarCostMatrix(one to many)" -msgstr "pgr_bdAstarCostMatrix(Uno a Muchos)" +msgid "pgr_bdAstarCost(Many to Many)" +msgstr "pgr_bdAstarCost(Muchos a Muchos)" -msgid "pgr_bdAstarCostMatrix(many to one)" -msgstr "pgr_bdAstarCostMatrix(muchos a uno)" - -msgid "pgr_bdAstarCostMatrix(many to many)" -msgstr "pgr_bdAstarCostMatrix(muchos a muchos)" +msgid "pgr_bdAstarCostMatrix" +msgstr "pgr_bdAstarCostMatrix" msgid "bdDijkstra Family" msgstr "bdDijkstra Familia" -msgid "pgr_bdDijkstra(one to many)" -msgstr "pgr_bdDijkstra(Uno a Muchos)" - -msgid "pgr_bdDijkstra(many to one)" -msgstr "pgr_bdDijkstra(muchos a uno)" - -msgid "pgr_bdDijkstra(many to many)" -msgstr "pgr_bdDijkstra(muchos a muchos)" - -msgid "pgr_bdDijkstraCost(one to one)" -msgstr "pgr_bdDijkstraCost(uno a uno)" - -msgid "pgr_bdDijkstraCost(one to many)" -msgstr "pgr_bdDijkstraCost(uno a muchos)" +msgid "pgr_bdDijkstraCost(One to One)" +msgstr "pgr_bdDijkstraCost(Uno a Uno)" -msgid "pgr_bdDijkstraCost(many to one)" -msgstr "pgr_bdDijkstraCost(muchos a uno)" +msgid "pgr_bdDijkstraCost(One to Many)" +msgstr "pgr_bdDijkstraCost(Uno a Muchos)" -msgid "pgr_bdDijkstraCost(many to many)" -msgstr "pgr_bdDijkstraCost(muchos a muchos)" +msgid "pgr_bdDijkstraCost(Many to One)" +msgstr "pgr_bdDijkstraCost(Muchos a Uno)" -msgid "pgr_bdDijkstraCostMatrix(one to one)" -msgstr "pgr_bdDijkstraCostMatrix(uno a uno)" +msgid "pgr_bdDijkstraCost(Many to Many)" +msgstr "pgr_bdDijkstraCost(Muchos a Muchos)" -msgid "pgr_bdDijkstraCostMatrix(one to many)" -msgstr "pgr_bdDijkstraCostMatrix(uno a muchos)" - -msgid "pgr_bdDijkstraCostMatrix(many to one)" -msgstr "pgr_bdDijkstraCostMatrix(muchos a uno)" - -msgid "pgr_bdDijkstraCostMatrix(many to many)" -msgstr "pgr_bdDijkstraCostMatrix(muchos a muchos)" +msgid "pgr_bdDijkstraCostMatrix" +msgstr "pgr_bdDijkstraCostMatrix" msgid "Flow Family" msgstr "Familia Flow" -msgid "pgr_pushRelabel(one to one)" +msgid "pgr_pushRelabel(One to One)" msgstr "pgr_pushRelabel(Uno a Uno)" -msgid "pgr_pushRelabel(one to many)" +msgid "pgr_pushRelabel(One to Many)" msgstr "pgr_pushRelabel(Uno a Muchos)" -msgid "pgr_pushRelabel(many to one)" -msgstr "pgr_pushRelabel(muchos a uno)" +msgid "pgr_pushRelabel(Many to One)" +msgstr "pgr_pushRelabel(Muchos a Uno)" -msgid "pgr_pushRelabel(many to many)" -msgstr "pgr_pushRelabel(muchos a muchos)" +msgid "pgr_pushRelabel(Many to Many)" +msgstr "pgr_pushRelabel(Muchos a Muchos)" -msgid "pgr_edmondsKarp(one to one)" +msgid "pgr_edmondsKarp(One to One)" msgstr "pgr_edmondsKarp(Uno a Uno)" -msgid "pgr_edmondsKarp(one to many)" +msgid "pgr_edmondsKarp(One to Many)" msgstr "pgr_edmondsKarp(Uno a Muchos)" -msgid "pgr_edmondsKarp(many to one)" -msgstr "pgr_edmondsKarp(muchos a uno)" +msgid "pgr_edmondsKarp(Many to One)" +msgstr "pgr_edmondsKarp(Muchos a Uno)" -msgid "pgr_edmondsKarp(many to many)" -msgstr "pgr_edmondsKarp(muchos a muchos)" +msgid "pgr_edmondsKarp(Many to Many)" +msgstr "pgr_edmondsKarp(Muchos a Muchos)" -msgid "pgr_boykovKolmogorov (one to one)" +msgid "pgr_boykovKolmogorov (One to One)" msgstr "pgr_boykovKolmogorov(Uno a Uno)" -msgid "pgr_boykovKolmogorov (one to many)" +msgid "pgr_boykovKolmogorov (One to Many)" msgstr "pgr_boykovKolmogorov(Uno a Muchos)" -msgid "pgr_boykovKolmogorov (many to one)" -msgstr "pgr_boykovKolmogorov (muchos a uno)" +msgid "pgr_boykovKolmogorov (Many to One)" +msgstr "pgr_boykovKolmogorov (Muchos a Uno)" -msgid "pgr_boykovKolmogorov (many to many)" -msgstr "pgr_boykovKolmogorov (muchos a muchos)" +msgid "pgr_boykovKolmogorov (Many to Many)" +msgstr "pgr_boykovKolmogorov (Muchos a Muchos)" msgid "pgr_maxCardinalityMatching" msgstr "pgr_maxCardinalityMatching" @@ -19596,21 +19430,24 @@ msgstr "pgr_maxCardinalityMatching" msgid "pgr_maxFlow" msgstr "pgr_maxFlow" -msgid "pgr_edgeDisjointPaths(one to one)" +msgid "pgr_edgeDisjointPaths(One to One)" msgstr "pgr_edgeDisjointPaths(Uno a Uno)" -msgid "pgr_edgeDisjointPaths(one to many)" +msgid "pgr_edgeDisjointPaths(One to Many)" msgstr "pgr_edgeDisjointPaths(Uno a Muchos)" -msgid "pgr_edgeDisjointPaths(many to one)" -msgstr "pgr_edgeDisjointPaths(muchos a uno)" +msgid "pgr_edgeDisjointPaths(Many to One)" +msgstr "pgr_edgeDisjointPaths(Muchos a Uno)" -msgid "pgr_edgeDisjointPaths(many to many)" -msgstr "pgr_edgeDisjointPaths(muchos a muchos)" +msgid "pgr_edgeDisjointPaths(Many to Many)" +msgstr "pgr_edgeDisjointPaths(Muchos a Muchos)" msgid "Components family" msgstr "Familia de Componentes" +msgid "pgr_connectedComponents" +msgstr "pgr_connectedComponents" + msgid "pgr_strongComponents" msgstr "pgr_strongComponents" @@ -19814,8 +19651,8 @@ msgstr "pgr_floydWarshall" msgid "pgr_johnson" msgstr "pgr_johnson" -msgid "pgr_astar" -msgstr "pgr_astar" +msgid "pgr_aStar" +msgstr "pgr_aStar" msgid "pgr_bdAstar" msgstr "pgr_bdAstar" @@ -19835,6 +19672,9 @@ msgstr "pgr_dijkstraCost" msgid "pgr_drivingDistance" msgstr "pgr_drivingDistance" +msgid "pgr_KSP" +msgstr "pgr_KSP" + msgid "pgr_dijkstraVia (proposed)" msgstr "pgr_dijkstraVia (proposed)" @@ -19863,7 +19703,7 @@ msgid "pgr_withPointsKSP (proposed)" msgstr "pgr_withPointsKSP (proposed)" msgid "pgr_withPointsDD (proposed)" -msgstr "pgr_withPointsDD (proposed)" +msgstr "pgr_withPointsDD (propuesta)" msgid "pgr_withPointsCostMatrix (proposed)" msgstr "pgr_withPointsCostMatrix (propuesto)" @@ -20065,25 +19905,16 @@ msgstr "Columnas path_id, cost y agg_cost añadidas al resultado" msgid "Parameter names changed" msgstr "Nombres de parámetros cambiados" -msgid "The many version results are the union of the one to one version" +msgid "The many version results are the union of the One to One version" msgstr "" -"Los muchos resultados de la versión son la unión de la versión uno a uno" +"Los muchos resultados de la versión son la unión de la versión Uno a Uno" msgid "New Signatures" msgstr "Nuevas Firmas" -msgid "pgr_bdAstar(one to one)" +msgid "pgr_bdAstar(One to One)" msgstr "pgr_bdAstar(Uno a Uno)" -msgid "New Proposed functions" -msgstr "Nuevas Funciones Propuestas" - -msgid "pgr_bdAstarCostMatrix" -msgstr "pgr_bdAstarCostMatrix" - -msgid "pgr_bdDijkstraCostMatrix" -msgstr "pgr_bdDijkstraCostMatrix" - msgid "pgr_lineGraph" msgstr "pgr_lineGraph" @@ -20175,32 +20006,8 @@ msgstr "" msgid "pgr_bdDijkstra" msgstr "pgr_bdDijkstra" -msgid "New Proposed Signatures" -msgstr "Nuevas Firmas Propuestas" - -msgid "pgr_astar(one to many)" -msgstr "pgr_astar(Uno a Muchos)" - -msgid "pgr_astar(many to one)" -msgstr "pgr_astar(muchos a uno)" - -msgid "pgr_astar(many to many)" -msgstr "pgr_astar(muchos a muchos)" - -msgid "pgr_astarCost(one to one)" -msgstr "pgr_astarCost(Uno a Uno)" - -msgid "pgr_astarCost(one to many)" -msgstr "pgr_astarCost(uno a muchos)" - -msgid "pgr_astarCost(many to one)" -msgstr "pgr_astarCost(muchos a uno)" - -msgid "pgr_astarCost(many to many)" -msgstr "pgr_astarCost(muchos a muchos)" - -msgid "pgr_astarCostMatrix" -msgstr "pgr_astarCostMatrix" +msgid "Deprecated signatures." +msgstr "Firmas obsoletas." msgid "pgr_bddijkstra - use pgr_bdDijkstra instead" msgstr "pgr_bddijkstra - utilizar pgr_bdDijkstra en su lugar" @@ -20285,53 +20092,44 @@ msgstr "" msgid "pgr_TSP" msgstr "pgr_TSP" -msgid "pgr_aStar" -msgstr "pgr_aStar" - -msgid "New Functions" -msgstr "Nuevas Funciones" - msgid "pgr_eucledianTSP" msgstr "pgr_eucledianTSP" -msgid "pgr_withPointsCostMatrix" -msgstr "pgr_withPointsCostMatrix" - -msgid "pgr_maxFlowPushRelabel(one to one)" +msgid "pgr_maxFlowPushRelabel(One to One)" msgstr "pgr_maxFlowPushRelabel(Uno a Uno)" -msgid "pgr_maxFlowPushRelabel(one to many)" -msgstr "pgr_maxFlowPushRelabel(uno a muchos)" +msgid "pgr_maxFlowPushRelabel(One to Many)" +msgstr "pgr_maxFlowPushRelabel(Uno a Muchos)" -msgid "pgr_maxFlowPushRelabel(many to one)" -msgstr "pgr_maxFlowPushRelabel(muchos a uno)" +msgid "pgr_maxFlowPushRelabel(Many to One)" +msgstr "pgr_maxFlowPushRelabel(Muchos a Uno)" -msgid "pgr_maxFlowPushRelabel(many to many)" -msgstr "pgr_maxFlowPushRelabel(muchos a muchos)" +msgid "pgr_maxFlowPushRelabel(Many to Many)" +msgstr "pgr_maxFlowPushRelabel(Muchos a Muchos)" -msgid "pgr_maxFlowEdmondsKarp(one to one)" +msgid "pgr_maxFlowEdmondsKarp(One to One)" msgstr "pgr_maxFlowEdmondsKarp(Uno a Uno)" -msgid "pgr_maxFlowEdmondsKarp(one to many)" -msgstr "pgr_maxFlowEdmondsKarp(uno a muchos)" +msgid "pgr_maxFlowEdmondsKarp(One to Many)" +msgstr "pgr_maxFlowEdmondsKarp(Uno a Muchos)" -msgid "pgr_maxFlowEdmondsKarp(many to one)" -msgstr "pgr_maxFlowEdmondsKarp(muchos a uno)" +msgid "pgr_maxFlowEdmondsKarp(Many to One)" +msgstr "pgr_maxFlowEdmondsKarp(Muchos a Uno)" -msgid "pgr_maxFlowEdmondsKarp(many to many)" -msgstr "pgr_maxFlowEdmondsKarp(muchos a muchos)" +msgid "pgr_maxFlowEdmondsKarp(Many to Many)" +msgstr "pgr_maxFlowEdmondsKarp(Muchos a Muchos)" -msgid "pgr_maxFlowBoykovKolmogorov (one to one)" +msgid "pgr_maxFlowBoykovKolmogorov (One to One)" msgstr "pgr_maxFlowBoykovKolmogorov(Uno a Uno)" -msgid "pgr_maxFlowBoykovKolmogorov (one to many)" -msgstr "pgr_maxFlowBoykovKolmogorov (uno a muchos)" +msgid "pgr_maxFlowBoykovKolmogorov (One to Many)" +msgstr "pgr_maxFlowBoykovKolmogorov (Uno a Muchos)" -msgid "pgr_maxFlowBoykovKolmogorov (many to one)" -msgstr "pgr_maxFlowBoykovKolmogorov (muchos a uno)" +msgid "pgr_maxFlowBoykovKolmogorov (Many to One)" +msgstr "pgr_maxFlowBoykovKolmogorov (Muchos a Uno)" -msgid "pgr_maxFlowBoykovKolmogorov (many to many)" -msgstr "pgr_maxFlowBoykovKolmogorov (muchos a muchos)" +msgid "pgr_maxFlowBoykovKolmogorov (Many to Many)" +msgstr "pgr_maxFlowBoykovKolmogorov (Muchos a Muchos)" msgid "pgr_maximumCardinalityMatching" msgstr "pgr_maximumCardinalityMatching" @@ -20342,8 +20140,8 @@ msgstr "pgr_contractGraph" msgid "pgr_tsp - use pgr_TSP or pgr_eucledianTSP instead" msgstr "pgr_tsp - utilice pgr_TSP o pgr_eucledianTSP en su lugar" -msgid "pgr_astar - use pgr_aStar instead" -msgstr "pgr_astar - utilice pgr_aStar en su lugar" +msgid "pgr_aStar - use pgr_aStar instead" +msgstr "pgr_aStar - utilice pgr_aStar en su lugar" msgid "pgr_flip_edges" msgstr "pgr_flip_edges" @@ -20444,6 +20242,9 @@ msgstr "" msgid "Improvements" msgstr "Mejoras" +msgid "pgr_nodeNetwork" +msgstr "pgr_nodeNetwork" + msgid "Adding a row_where and outall optional parameters" msgstr "Adición de un row_where y todos los parámetros opcionales" @@ -20456,44 +20257,44 @@ msgstr "pgr_dijkstra -- para que coincida con lo documentado" msgid "pgr_Johnson" msgstr "pgr_Johnson" -msgid "pgr_dijkstraCost(one to one)" +msgid "pgr_dijkstraCost(One to One)" msgstr "pgr_dijkstraCost(Uno a Uno)" -msgid "pgr_dijkstraCost(one to many)" -msgstr "pgr_dijkstraCost(uno a muchos)" +msgid "pgr_dijkstraCost(One to Many)" +msgstr "pgr_dijkstraCost(Uno a Muchos)" -msgid "pgr_dijkstraCost(many to one)" -msgstr "pgr_dijkstraCost(muchos a uno)" +msgid "pgr_dijkstraCost(Many to One)" +msgstr "pgr_dijkstraCost(Muchos a Uno)" -msgid "pgr_dijkstraCost(many to many)" -msgstr "pgr_dijkstraCost(muchos a muchos)" +msgid "pgr_dijkstraCost(Many to Many)" +msgstr "pgr_dijkstraCost(Muchos a Muchos)" msgid "Proposed Functionality" msgstr "Funcionalidad Propuesta" -msgid "pgr_withPoints(one to one)" +msgid "pgr_withPoints(One to One)" msgstr "pgr_withPoints(Uno a Uno)" -msgid "pgr_withPoints(one to many)" -msgstr "pgr_withPoints(uno a muchos)" +msgid "pgr_withPoints(One to Many)" +msgstr "pgr_withPoints(Uno a Muchos)" -msgid "pgr_withPoints(many to one)" -msgstr "pgr_withPoints(muchos a uno)" +msgid "pgr_withPoints(Many to One)" +msgstr "pgr_withPoints(Muchos a Uno)" -msgid "pgr_withPoints(many to many)" -msgstr "pgr_withPoints(muchos a muchos)" +msgid "pgr_withPoints(Many to Many)" +msgstr "pgr_withPoints(Muchos a Muchos)" -msgid "pgr_withPointsCost(one to one)" +msgid "pgr_withPointsCost(One to One)" msgstr "pgr_withPointsCost(Uno a Uno)" -msgid "pgr_withPointsCost(one to many)" -msgstr "pgr_withPointsCost(uno a muchos)" +msgid "pgr_withPointsCost(One to Many)" +msgstr "pgr_withPointsCost(Uno a Muchos)" -msgid "pgr_withPointsCost(many to one)" -msgstr "pgr_withPointsCost(muchos a uno)" +msgid "pgr_withPointsCost(Many to One)" +msgstr "pgr_withPointsCost(Muchos a Uno)" -msgid "pgr_withPointsCost(many to many)" -msgstr "pgr_withPointsCost(muchos a muchos)" +msgid "pgr_withPointsCost(Many to Many)" +msgstr "pgr_withPointsCost(Muchos a Muchos)" msgid "pgr_withPointsDD(single vertex)" msgstr "pgr_withPointsDD(vértice único)" @@ -20501,9 +20302,6 @@ msgstr "pgr_withPointsDD(vértice único)" msgid "pgr_withPointsDD(multiple vertices)" msgstr "pgr_withPointsDD(múltiples vértices)" -msgid "pgr_withPointsKSP" -msgstr "pgr_withPointsKSP" - msgid "pgr_dijkstraVia" msgstr "pgr_dijkstraVia" @@ -20540,27 +20338,12 @@ msgstr "" "issues for 2.1.0 `_ en Github." -msgid "pgr_dijkstra(one to many)" -msgstr "pgr_dijkstra(uno a muchos)" - -msgid "pgr_dijkstra(many to one)" -msgstr "pgr_dijkstra(muchos a uno)" - -msgid "pgr_dijkstra(many to many)" -msgstr "pgr_dijkstra(muchos a muchos)" - -msgid "pgr_drivingDistance(multiple vertices)" -msgstr "pgr_drivingDistance(múltiples vértices)" - msgid "Refactored" msgstr "Refactorizado" -msgid "pgr_dijkstra(one to one)" +msgid "pgr_dijkstra(One to One)" msgstr "pgr_dijkstra(Uno a Uno)" -msgid "pgr_drivingDistance(single vertex)" -msgstr "pgr_drivingDistance(vértice único)" - msgid "" "pgr_alphaShape function now can generate better (multi)polygon with holes " "and alpha parameter." @@ -21377,8 +21160,8 @@ msgid "" msgstr "" msgid "" -"pgRouting suplies some functions to create a routing topology and to analyze " -"the topology." +"pgRouting supplies some functions to create a routing topology and to " +"analyze the topology." msgstr "" msgid "Additional functions to create a graph:" @@ -21828,5 +21611,519 @@ msgid "pgr_withPointsDD is pgr_drivingDistance **with points**" msgstr "pgr_withPointsDD es pgr_drivingDistance **con puntos**" msgid "pgr_withPointsvia is pgr_dijkstraVia **with points**" -msgstr "pgr_withPoints es pgr_dijkstraVia **con puntos**" +msgstr "pgr_withPointsvia es pgr_dijkstraVia **con puntos**" + +#~ msgid "pgr_aStarCostMatrix(One to One)" +#~ msgstr "pgr_aStarCostMatrix(Uno a Uno)" + +#~ msgid "pgr_aStarCostMatrix(One to Many)" +#~ msgstr "pgr_aStarCostMatrix(Uno a Muchos)" + +#~ msgid "pgr_aStarCostMatrix(Many to One)" +#~ msgstr "pgr_aStarCostMatrix(Muchos a Uno)" + +#~ msgid "pgr_aStarCostMatrix(Many to Many)" +#~ msgstr "pgr_aStarCostMatrix(Muchos a Muchos)" + +#, fuzzy +#~ msgid "pgr_bdAstarCostMatrix(One to One)" +#~ msgstr "pgr_bdAstarCostMatrix(Uno a Uno)" + +#, fuzzy +#~ msgid "pgr_bdAstarCostMatrix(One to Many)" +#~ msgstr "pgr_bdAstarCostMatrix(Uno a Muchos)" + +#, fuzzy +#~ msgid "pgr_bdAstarCostMatrix(Many to One)" +#~ msgstr "pgr_bdAstarCostMatrix(muchos a uno)" + +#, fuzzy +#~ msgid "pgr_bdAstarCostMatrix(Many to Many)" +#~ msgstr "pgr_bdAstarCostMatrix(muchos a muchos)" + +#, fuzzy +#~ msgid "pgr_bdDijkstraCostMatrix(One to One)" +#~ msgstr "pgr_bdDijkstraCostMatrix(uno a uno)" + +#, fuzzy +#~ msgid "pgr_bdDijkstraCostMatrix(One to Many)" +#~ msgstr "pgr_bdDijkstraCostMatrix(uno a muchos)" + +#, fuzzy +#~ msgid "pgr_bdDijkstraCostMatrix(Many to One)" +#~ msgstr "pgr_bdDijkstraCostMatrix(muchos a uno)" + +#, fuzzy +#~ msgid "pgr_bdDijkstraCostMatrix(Many to Many)" +#~ msgstr "pgr_bdDijkstraCostMatrix(muchos a muchos)" + +#~ msgid "pgr_astar" +#~ msgstr "pgr_astar" + +#, fuzzy +#~ msgid "pgr_astar(One to Many)" +#~ msgstr "pgr_aStar(Uno a Muchos)" + +#, fuzzy +#~ msgid "pgr_astar(Many to One)" +#~ msgstr "pgr_aStar(Muchos a Uno)" + +#, fuzzy +#~ msgid "pgr_astar(Many to Many)" +#~ msgstr "pgr_aStar(Muchos a Muchos)" + +#, fuzzy +#~ msgid "pgr_astarCost(One to One)" +#~ msgstr "pgr_astarCost(Uno a Uno)" + +#, fuzzy +#~ msgid "pgr_astarCost(One to Many)" +#~ msgstr "pgr_astarCost(uno a muchos)" + +#, fuzzy +#~ msgid "pgr_astarCost(Many to One)" +#~ msgstr "pgr_astarCost(muchos a uno)" + +#, fuzzy +#~ msgid "pgr_astarCost(Many to Many)" +#~ msgstr "pgr_astarCost(muchos a muchos)" + +#~ msgid "``pgr_drivingdistance`` (Single vertex)" +#~ msgstr "``pgr_drivingDistance`` (Vértice único)" + +#~ msgid "``pgr_drivingdistance`` (Multiple vertices)" +#~ msgstr "``pgr_drivingDistance`` (Múltiples vértices)" + +#, fuzzy +#~ msgid "**options:** [directed, heuristic, factor, epsilon]``" +#~ msgstr "**opcionales:** ``[directed, heuristic, factor, epsilon]``" + +#~ msgid "New Proposed signatures:" +#~ msgstr "Nuevas firmas Propuestas:" + +#, fuzzy +#~ msgid "pgr_betweennessCentrality``" +#~ msgstr "``pgr_betweennessCentrality``" + +#~ msgid "" +#~ "`Boost: connected components `__" +#~ msgstr "" +#~ "`Boost: componentes conectados `__" + +#~ msgid "New functions" +#~ msgstr "Nuevas funciones" + +#~ msgid "pgr_aStar(one to many)" +#~ msgstr "pgr_aStar(Uno a Muchos)" + +#~ msgid "pgr_aStar(many to one)" +#~ msgstr "pgr_aStar(muchos a uno)" + +#~ msgid "pgr_aStar(many to many)" +#~ msgstr "pgr_aStar(muchos a muchos)" + +#~ msgid "pgr_bdAstar(one to many)" +#~ msgstr "pgr_bdAstar(Uno a Muchos)" + +#~ msgid "pgr_bdAstar(many to one)" +#~ msgstr "pgr_bdAstar(muchos a uno)" + +#~ msgid "pgr_bdAstar(many to many)" +#~ msgstr "pgr_bdAstar(muchos a muchos)" + +#~ msgid "pgr_bdDijkstra(one to many)" +#~ msgstr "pgr_bdDijkstra(Uno a Muchos)" + +#~ msgid "pgr_bdDijkstra(many to one)" +#~ msgstr "pgr_bdDijkstra(muchos a uno)" + +#~ msgid "pgr_bdDijkstra(many to many)" +#~ msgstr "pgr_bdDijkstra(muchos a muchos)" + +#~ msgid "New Function." +#~ msgstr "Nueva Función." + +#~ msgid "pgr_astar(one to many)" +#~ msgstr "pgr_astar(Uno a Muchos)" + +#~ msgid "pgr_astar(many to one)" +#~ msgstr "pgr_astar(muchos a uno)" + +#~ msgid "pgr_astar(many to many)" +#~ msgstr "pgr_astar(muchos a muchos)" + +#~ msgid "pgr_dijkstraCost(one to many)" +#~ msgstr "pgr_dijkstraCost(uno a muchos)" + +#~ msgid "pgr_dijkstraCost(many to one)" +#~ msgstr "pgr_dijkstraCost(muchos a uno)" + +#~ msgid "pgr_dijkstraCost(many to many)" +#~ msgstr "pgr_dijkstraCost(muchos a muchos)" + +#~ msgid "pgr_withPoints(one to one)" +#~ msgstr "pgr_withPoints(Uno a Uno)" + +#~ msgid "pgr_withPoints(one to many)" +#~ msgstr "pgr_withPoints(uno a muchos)" + +#~ msgid "pgr_withPoints(many to one)" +#~ msgstr "pgr_withPoints(muchos a uno)" + +#~ msgid "pgr_withPoints(many to many)" +#~ msgstr "pgr_withPoints(muchos a muchos)" + +#~ msgid "pgr_dijkstra(one to many)" +#~ msgstr "pgr_dijkstra(uno a muchos)" + +#~ msgid "pgr_dijkstra(many to one)" +#~ msgstr "pgr_dijkstra(muchos a uno)" + +#~ msgid "pgr_dijkstra(many to many)" +#~ msgstr "pgr_dijkstra(muchos a muchos)" + +#~ msgid "The queries use the :doc:`sampledata` network." +#~ msgstr "Las consultas utilizan la red :doc:`sampledata` ." + +#, fuzzy +#~ msgid "See also" +#~ msgstr "Ver también" + +#~ msgid "New overload functions:" +#~ msgstr "Nuevas funciones de sobrecarga:" + +#~ msgid "New **Official** function" +#~ msgstr "Nueva función **Oficial**" + +#~ msgid ":doc:`sampledata` network." +#~ msgstr ":doc:`sampledata` ." + +#~ msgid "" +#~ "``pgr_aStar`` (`One to One`_) added ``start_vid`` and ``end_vid`` columns." +#~ msgstr "" +#~ "``pgr_aStar`` (`Uno a Uno`_) ha añadido las columnas ``start_vid`` y " +#~ "``end_vid``." + +#~ msgid "``pgr_aStar`` (`One to Many`_) added ``end_vid`` column." +#~ msgstr "``pgr_aStar`` (`Uno a Muchos`_) ha añadido la columna ``end_vid``." + +#~ msgid "``pgr_aStar`` (`Many to One`_) added ``start_vid`` column." +#~ msgstr "" +#~ "``pgr_aStar`` (`Muchos a Uno`_) ha añadido la columna ``start_vid``." + +#~ msgid "New **proposed** signature:" +#~ msgstr "Nueva firma **propuesta**:" + +#~ msgid "``pgr_aStar`` (`Combinations`_)" +#~ msgstr "``pgr_aStar`` (`Combinaciones`_)" + +#~ msgid "New **Proposed** signatures:" +#~ msgstr "Nuevas firmas **propuestas**:" + +#~ msgid "``pgr_aStar`` (`One to Many`_)" +#~ msgstr "``pgr_aStar`` (`Uno a Muchos`_)" + +#~ msgid "``pgr_aStar`` (`Many to One`_)" +#~ msgstr "``pgr_aStar`` (`Muchos a Uno`_)" + +#~ msgid "``pgr_aStar`` (`Many to Many`_)" +#~ msgstr "``pgr_aStar`` (`Muchos a Muchos`_)" + +#~ msgid "**Official** ``pgr_aStar`` (`One to One`_)" +#~ msgstr "**Oficial** ``pgr_aStar`` (`Uno a Uno`_)" + +#~ msgid "``pgr_aStarCost`` (`Combinations`_)" +#~ msgstr "``pgr_aStarCost`` (`Combinaciones`_)" + +#~ msgid "New **proposed** function" +#~ msgstr "Nueva función **propuesta**" + +#~ msgid "The examples use the :doc:`sampledata` network." +#~ msgstr "Los ejemplos usan la red de ejemplo :doc:`sampledata`." + +#~ msgid "New **experimental** function" +#~ msgstr "Nueva función **experimental**" + +#~ msgid "" +#~ "``pgr_bdAstar`` (`One to One`_) added ``start_vid`` and ``end_vid`` " +#~ "columns." +#~ msgstr "" +#~ "``pgr_bdAstar`` (`Uno a Uno`_) ha añadido las columnas ``start_vid`` y " +#~ "``end_vid``." + +#~ msgid "``pgr_bdAstar`` (`One to Many`_) added ``end_vid`` column." +#~ msgstr "" +#~ "``pgr_bdAstar`` (`Uno a Muchos`_) ha añadido la columna ``end_vid``." + +#~ msgid "``pgr_bdAstar`` (`Many to One`_) added ``start_vid`` column." +#~ msgstr "" +#~ "``pgr_bdAstar`` (`Muchos a Uno`_) ha añadido la columna ``start_vid``." + +#~ msgid "``pgr_bdAstar`` (`Combinations`_)" +#~ msgstr "``pgr_bdAstar`` (`Combinaciones`_)" + +#~ msgid "``pgr_bdAstar`` (`One to Many`_)" +#~ msgstr "``pgr_bdAstar`` (`Uno a Muchos`_)" + +#~ msgid "``pgr_bdAstar`` (`Many to One`_)" +#~ msgstr "``pgr_bdAstar`` (`Muchos a Uno`_)" + +#~ msgid "``pgr_bdAstar`` (`Many to Many`_)" +#~ msgstr "``pgr_bdAstar`` (`Muchos a Muchos`_)" + +#~ msgid "**Official** ``pgr_bdAstar`` (`One to One`_)" +#~ msgstr "**Oficial** ``pgr_bdAstar`` (`Uno a Uno`_)" + +#~ msgid "``pgr_bdAstarCost`` (`Combinations`_)" +#~ msgstr "``pgr_bdAstarCost`` (`Combinaciones`_)" + +#~ msgid "pgr_bdDijkstra(`Combinations`_)" +#~ msgstr "pgr_bdDijkstra(`Combinaciones`_)" + +#~ msgid "New **Proposed** functions:" +#~ msgstr "Nuevas funciones **Propuestas**:" + +#~ msgid "``pgr_bdDijkstra`` (`One to Many`_)" +#~ msgstr "``pgr_bdDijkstra`` (`Uno a Muchos`_)" + +#~ msgid "``pgr_bdDijkstra`` (`Many to One`_)" +#~ msgstr "``pgr_bdDijkstra`` (`Muchos a Uno`_)" + +#~ msgid "``pgr_bdDijkstra`` (`Many to Many`_)" +#~ msgstr "``pgr_bdDijkstra`` (`Muchos a Muchos`_)" + +#~ msgid "**Official** ``pgr_bdDijkstra`` (`One to One`_)" +#~ msgstr "**Oficial** ``pgr_bdDijkstra`` (`Uno a Uno`_)" + +#~ msgid "" +#~ "https://www.cs.princeton.edu/courses/archive/spr06/cos423/Handouts/" +#~ "EPP%20shortest%20path%20algorithms.pdf" +#~ msgstr "" +#~ "https://www.cs.princeton.edu/courses/archive/spr06/cos423/Handouts/" +#~ "EPP%20shortest%20path%20algorithms.pdf" + +#~ msgid "``pgr_bdDijkstraCost`` (`Combinations`_)" +#~ msgstr "``pgr_bdDijkstraCost`` (`Combinaciones`_)" + +#~ msgid "``pgr_bellmanFord`` (`Combinations`_)" +#~ msgstr "``pgr_bellmanFord`` (`Combinaciones`_)" + +#~ msgid "New **experimental** signatures:" +#~ msgstr "Nuevas firmas **experimental**:" + +#~ msgid "``pgr_bellmanFord`` (`One to One`_)" +#~ msgstr "``pgr_bellmanFord`` (`Uno a Uno`_)" + +#~ msgid "``pgr_bellmanFord`` (`One to Many`_)" +#~ msgstr "``pgr_bellmanFord`` (`Uno a Muchos`_)" + +#~ msgid "``pgr_bellmanFord`` (`Many to One`_)" +#~ msgstr "``pgr_bellmanFord`` (`Muchos a uno`_)" + +#~ msgid "``pgr_bellmanFord`` (`Many to Many`_)" +#~ msgstr "``pgr_bellmanFord`` (`Muchos a Muchos`_)" + +#~ msgid "New **experimental** function:" +#~ msgstr "Nueva función **experimental**:" + +#~ msgid "Queries use the :doc:`sampledata` network." +#~ msgstr "Las consultas utilizan la red :doc:`sampledata`." + +#~ msgid "" +#~ "Boost: `Biconnected components `__" +#~ msgstr "" +#~ "Boost: `Componentes Biconectados `__" + +#~ msgid "pgr_binaryBreadthFirstSearch(`Combinations`_)" +#~ msgstr "pgr_binaryBreadthFirstSearch(`Combinaciones`_)" + +#~ msgid "pgr_binaryBreadthFirstSearch(`One to One`_)" +#~ msgstr "pgr_binaryBreadthFirstSearch(`Uno a Uno`_)" + +#~ msgid "pgr_binaryBreadthFirstSearch(`One to Many`_)" +#~ msgstr "pgr_binaryBreadthFirstSearch(`Uno a Muchos`_)" + +#~ msgid "pgr_binaryBreadthFirstSearch(`Many to One`_)" +#~ msgstr "pgr_binaryBreadthFirstSearch(`Muchos a Uno`_)" + +#~ msgid "pgr_binaryBreadthFirstSearch(`Many to Many`_)" +#~ msgstr "pgr_binaryBreadthFirstSearch(`Muchos a Muchos`_)" + +#~ msgid "New **experimental** signature" +#~ msgstr "Nueva firma **experimental**" + +#~ msgid "New **proposed** signature" +#~ msgstr "Nueva firma **propuesta**" + +#~ msgid "``pgr_boykovKolmogorov`` (`Combinations`_)" +#~ msgstr "``pgr_boykovKolmogorov`` (`Combinaciones`_)" + +#~ msgid "**Proposed** function" +#~ msgstr "Función **propuesta**" + +#~ msgid "New **Experimental** function" +#~ msgstr "Nueva función **Experimental**" + +#~ msgid "``pgr_breadthFirstSearch`` (`Single Vertex`_)" +#~ msgstr "``pgr_breadthFirstSearch`` (`Vértice único`_)" + +#~ msgid "``pgr_breadthFirstSearch`` (`Multiple Vertices`_)" +#~ msgstr "``pgr_breadthFirstSearch`` (`Múltiples Vértices`_)" + +#~ msgid "**Supported versions**" +#~ msgstr "** Versions soportadas**" + +#~ msgid "The example uses the :doc:`sampledata` network." +#~ msgstr "En el ejemplo se utiliza la red :doc:`sampledata`." + +#~ msgid "Promoted to **proposed** function" +#~ msgstr "Promovido a función **propuesta**" + +#~ msgid "``pgr_depthFirstSearch`` (`Single Vertex`_)" +#~ msgstr "``pgr_depthFirstSearch`` (`Vértice único`_)" + +#~ msgid "``pgr_depthFirstSearch`` (`Multiple Vertices`_)" +#~ msgstr "``pgr_depthFirstSearch`` (`Vértices multiples`_)" + +#~ msgid "" +#~ "``pgr_dijkstra`` (`One to One`_) added ``start_vid`` and ``end_vid`` " +#~ "columns." +#~ msgstr "" +#~ "``pgr_dijkstra`` (`Uno a Uno`_) ha añadido las columnas ``start_vid`` y " +#~ "``end_vid``." + +#~ msgid "``pgr_dijkstra`` (`One to Many`_) added ``end_vid`` column." +#~ msgstr "" +#~ "``pgr_dijkstra`` (`Uno a Muchos`_) ha añadido la columna ``end_vid``." + +#~ msgid "``pgr_dijkstra`` (`Many to One`_) added ``start_vid`` column." +#~ msgstr "" +#~ "``pgr_dijkstra`` (`Muchos a Uno`_) ha añadido la columna ``start_vid``." + +#~ msgid "``pgr_dijkstra`` (`Combinations`_)" +#~ msgstr "``pgr_dijkstra`` (`Combinaciones`_)" + +#~ msgid "**Official** functions" +#~ msgstr "Funciones **oficiales**" + +#~ msgid "New **proposed** functions:" +#~ msgstr "Nuevas funciones **propuestas**:" + +#~ msgid "``pgr_dijkstra`` (`One to Many`_)" +#~ msgstr "``pgr_dijkstra`` (`Uno a Muchos`_)" + +#~ msgid "``pgr_dijkstra`` (`Many to One`_)" +#~ msgstr "``pgr_dijkstra`` (`Muchos a Uno`_)" + +#~ msgid "``pgr_dijkstra`` (`Many to Many`_)" +#~ msgstr "``pgr_dijkstra`` (`Muchos a Muchos`_)" + +#~ msgid "**Official** ``pgr_dijkstra`` (`One to One`_)" +#~ msgstr "**Oficial** ``pgr_dijkstra`` (`Uno a Uno`_)" + +#~ msgid "``pgr_dijkstraCost`` (`Combinations`_)" +#~ msgstr "``pgr_dijkstraCost`` (`Combinaciones`_)" + +#~ msgid "Signature change pgr_drivingDistance(single vertex)" +#~ msgstr "Cambio de firma pgr_drivingDistance(vértice único)" + +#~ msgid "New **Official** pgr_drivingDistance(multiple vertices)" +#~ msgstr "Nuevo **Oficial** pgr_drivingDistance(multiples vértices)" + +#~ msgid "Official:: pgr_drivingDistance(single vertex)" +#~ msgstr "Oficial:: pgr_drivingDistance(vértice único)" + +#~ msgid "New **proposed** function:" +#~ msgstr "Nueva función **propuesta**:" + +#~ msgid "``pgr_edmondsKarp`` (`Combinations`_)" +#~ msgstr "``pgr_edmondsKarp`` (`Combinaciones`_)" + +#~ msgid "``pgr_edwardMoore`` (`Combinations`_)" +#~ msgstr "``pgr_edwardMoore`` (`Combinaciones`_)" + +#~ msgid "``pgr_edwardMoore`` (`One to One`_)" +#~ msgstr "``pgr_edwardMoore`` (`Uno a Uno`_)" + +#~ msgid "``pgr_edwardMoore`` (`One to Many`_)" +#~ msgstr "``pgr_edwardMoore`` (`Uno a Muchos`_)" + +#~ msgid "``pgr_edwardMoore`` (`Many to One`_)" +#~ msgstr "``pgr_edwardMoore`` (`Muchos a Uno`_)" + +#~ msgid "``pgr_edwardMoore`` (`Many to Many`_)" +#~ msgstr "``pgr_edwardMoore`` (`Muchos a Muchos`_)" + +#~ msgid "New **proposed** signatures:" +#~ msgstr "Nuevas firmas **propuestas**:" + +#~ msgid "Queries uses the :doc:`sampledata` network." +#~ msgstr "Consultas utilizan la red :doc:`sampledata`." + +#~ msgid "Promoted to **proposed** signature." +#~ msgstr "Promovido a firma **propuesta**." + +#~ msgid "``pgr_maxFlow`` (`Combinations`_)" +#~ msgstr "``pgr_maxFlow`` (`Combinaciones`_)" + +#~ msgid "New **Proposed** function" +#~ msgstr "Nueva función **Propuesta**" + +#~ msgid "``pgr_maxFlowMinCost`` (`Combinations`_)" +#~ msgstr "``pgr_maxFlowMinCost`` (`Combinaciones`_)" + +#~ msgid "" +#~ "https://www.boost.org/libs/graph/doc/" +#~ "successive_shortest_path_nonnegative_weights.html" +#~ msgstr "" +#~ "https://www.boost.org/libs/graph/doc/" +#~ "successive_shortest_path_nonnegative_weights.html" + +#~ msgid "``pgr_maxFlowMinCost_Cost`` (`Combinations`_)" +#~ msgstr "``pgr_maxFlowMinCost_Cost`` (`Combinaciones`_)" + +#~ msgid "``pgr_pushRelabel`` (`Combinations`_)" +#~ msgstr "``pgr_pushRelabel`` (`Combinaciones`_)" + +#~ msgid "Promoted to **proposed** signature" +#~ msgstr "Promovido a firma **propuesta**" + +#~ msgid "``pgr_trsp`` (`One to One`_)" +#~ msgstr "``pgr_trsp`` (`Uno a Uno`_)" + +#~ msgid "``pgr_trsp_withPoints`` (`One to One`_)" +#~ msgstr "``pgr_trsp_withPoints`` (`Uno a Uno`_)" + +#~ msgid "``pgr_withPoints`` - Proposed" +#~ msgstr "``pgr_withPoints`` - Propuesto" + +#~ msgid "``pgr_withPointsCost`` - Proposed" +#~ msgstr "``pgr_withPointsCost`` - Propuesto" + +#~ msgid "``pgr_withPointsCostMatrix`` - proposed" +#~ msgstr "``pgr_withPointsCostMatrix`` - propuesto" + +#~ msgid "``pgr_withPointsDD`` - Proposed" +#~ msgstr "``pgr_withPointsDD`` - Propuesto" + +#~ msgid "``pgr_withPointsDD`` (`Single vertex`)" +#~ msgstr "``pgr_withPointsDD`` (`Vértice único`)" + +#~ msgid "pgr_withPointsKSP - Proposed" +#~ msgstr "pgr_withPointsKSP - Propuesto" + +#~ msgid "New overload functions" +#~ msgstr "Nuevas funciones de sobrecarga" + +#~ msgid "``pgr_withPointsKSP`` (Combinations)" +#~ msgstr "``pgr_withPointsKSP`` (Combinaciones)" + +#~ msgid "New Proposed functions" +#~ msgstr "Nuevas Funciones Propuestas" +#~ msgid "New Proposed Signatures" +#~ msgstr "Nuevas Firmas Propuestas" diff --git a/locale/ja/LC_MESSAGES/pgrouting_doc_strings.po b/locale/ja/LC_MESSAGES/pgrouting_doc_strings.po index 005305498d6..cc56b6f8a91 100644 --- a/locale/ja/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/ja/LC_MESSAGES/pgrouting_doc_strings.po @@ -20,7 +20,7 @@ msgid "" msgstr "" "Project-Id-Version: pgRouting v4.0\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2025-01-10 14:53+0000\n" +"POT-Creation-Date: 2025-02-12 01:00+0000\n" "PO-Revision-Date: 2024-09-23 01:16+0000\n" "Last-Translator: Celia Virginia Vergara Castillo \n" "Language-Team: Japanese `__" +"`Boost: metric TSP approx `__" msgstr "" msgid "`University of Waterloo TSP `__" @@ -1647,8 +1647,8 @@ msgstr "" msgid "https://en.wikipedia.org/wiki/Vehicle_routing_problem" msgstr "" -msgid "The queries use the :doc:`sampledata` network." -msgstr "クエリは :doc:`sampledata` ネットワークを使用します。" +msgid ":doc:`sampledata`" +msgstr "" msgid "A* - Family of functions" msgstr "" @@ -1810,7 +1810,8 @@ msgstr "" msgid ":doc:`bdAstar-family`" msgstr "" -msgid "https://www.boost.org/libs/graph/doc/astar_search.html" +msgid "" +"`Boost: A* search `__" msgstr "" msgid "https://en.wikipedia.org/wiki/A*_search_algorithm" @@ -2614,7 +2615,7 @@ msgid "" "ending vertex:" msgstr "" -msgid "It is expected to terminate faster than pgr_astar" +msgid "It is expected to terminate faster than pgr_aStar" msgstr "" msgid ":doc:`aStar-family`" @@ -2762,27 +2763,7 @@ msgid "Identifier of the color of the edge." msgstr "" msgid "" -"`Boost: Sequential Vertex Coloring algorithm documentation `__" -msgstr "" - -msgid "" -"`Wikipedia: Graph coloring `__" -msgstr "" - -msgid "" -"`Boost: is_bipartite `__" -msgstr "" - -msgid "" -"`Wikipedia: bipartite graph `__" -msgstr "" - -msgid "" -"`Boost: Edge Coloring Algorithm documentation `__" +"`Boost: `__" msgstr "" msgid "Components - Family of functions" @@ -3330,9 +3311,6 @@ msgstr "" msgid "Now, the routing graph has an edge connecting with node :math:`7`." msgstr "" -msgid ":doc:`sampledata`" -msgstr "" - msgid "" "https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/" "lecture16.pdf" @@ -4467,31 +4445,187 @@ msgstr "" msgid "pgRouting 4.0.0 Release Notes" msgstr "" -msgid "Removal of deprecated functions and signatures" +msgid "" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 4.0.0 `__" +msgstr "" + +msgid "Functions promoted to official" +msgstr "" + +msgid "pgr_trsp" +msgstr "" + +msgid "pgr_trspVia" +msgstr "" + +#, fuzzy +msgid "pgr_trspVia_withPoints" +msgstr ":doc:`pgr_kruskalBFS`" + +#, fuzzy +msgid "pgr_trsp_withPoints" +msgstr ":doc:`pgr_kruskalBFS`" + +#, fuzzy +msgid "pgr_withPoints" +msgstr ":doc:`pgr_kruskalBFS`" + +#, fuzzy +msgid "pgr_withPointsCost" +msgstr ":doc:`pgr_kruskalBFS`" + +msgid "pgr_withPointsCostMatrix" +msgstr "" + +#, fuzzy +msgid "pgr_withPointsDD" +msgstr ":doc:`pgr_kruskalBFS`" + +msgid "pgr_withPointsKSP" +msgstr "" + +#, fuzzy +msgid "pgr_withPointsVia" +msgstr ":doc:`pgr_kruskalBFS`" + +msgid "Signatures promoted to official" +msgstr "" + +msgid "pgr_aStar(Combinations)" +msgstr "" + +msgid "pgr_aStarCost(Combinations)" +msgstr "" + +msgid "pgr_bdAstar(Combinations)" +msgstr "" + +msgid "pgr_bdAstarCost(Combinations)" +msgstr "" + +msgid "pgr_bdDijkstra(Combinations)" +msgstr "" + +msgid "pgr_bdDijkstraCost(Combinations)" +msgstr "" + +msgid "pgr_dijkstra(Combinations)" +msgstr "" + +msgid "pgr_dijkstraCost(Combinations)" +msgstr "" + +#, fuzzy +msgid "pgr_KSP(All signatures)" +msgstr "機能" + +msgid "pgr_boykovKolmogorov(Combinations)" +msgstr "" + +msgid "pgr_edmondsKarp(Combinations)" +msgstr "" + +msgid "pgr_maxFlow(Combinations)" +msgstr "" + +msgid "pgr_pushRelabel(Combinations)" +msgstr "" + +msgid "code enhancements:" +msgstr "" + +msgid "Removal of unused C/C++ code" +msgstr "" + +msgid "Removal of SQL deprecated functions" msgstr "" msgid "" -"``pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)``" +"pgr_trsp(text,integer,double precision,integer,double precision,boolean," +"boolean,text)" msgstr "" -msgid "``pgr_trspviavertices(text,anyarray,boolean,boolean,text)``" +msgid "pgr_trsp(text,integer,integer,boolean,boolean,text)" msgstr "" msgid "" -"``pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean,text)``" +"pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" msgstr "" -msgid "``pgr_trsp(text,integer,integer,boolean,boolean,text)``" +msgid "pgr_trspviavertices(text,anyarray,boolean,boolean,text)" msgstr "" -msgid "All releases" +msgid "Removal of SQL deprecated internal functions" msgstr "" -msgid "Kruskal - Family of functions" +msgid "_pgr_dijkstranear(text,anyarray,anyarray,bigint,boolean)" msgstr "" -msgid "Boost Graph Inside" +msgid "_pgr_dijkstranear(text,anyarray,bigint,bigint,boolean)" +msgstr "" + +msgid "_pgr_dijkstranear(text,bigint,anyarray,bigint,boolean)" +msgstr "" + +msgid "_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" +msgstr "" + +msgid "_pgr_dijkstra(text,text,boolean,boolean,boolean)" +msgstr "" + +msgid "_pgr_drivingdistance(text,anyarray,double precision,boolean,boolean)" +msgstr "" + +msgid "_pgr_kruskal(text,anyarray,text,bigint,double precision)" +msgstr "" + +msgid "_pgr_prim(text,anyarray,text,bigint,double precision)" +msgstr "" + +msgid "" +"_pgr_trsp(text,integer,double precision,integer,double precision,boolean," +"boolean,text)" +msgstr "" + +msgid "_pgr_trsp(text,text,anyarray,anyarray,boolean)" +msgstr "" + +msgid "_pgr_trsp(text,text,anyarray,bigint,boolean)" +msgstr "" + +msgid "_pgr_trsp(text,text,bigint,anyarray,boolean)" +msgstr "" + +msgid "_pgr_trsp(text,text,bigint,bigint,boolean)" +msgstr "" + +msgid "_pgr_trspviavertices(text,integer[],boolean,boolean,text)" +msgstr "" + +msgid "_pgr_withpointsvia(text,bigint[],double precision[],boolean)" +msgstr "" + +msgid "_trsp(text,text,anyarray,anyarray,boolean)" +msgstr "" + +msgid "_v4trsp(text,text,anyarray,anyarray,boolean)" +msgstr "" + +msgid "_v4trsp(text,text,text,boolean)" +msgstr "" + +msgid "Deprecation of internal C/C++ functions" +msgstr "" + +msgid "Internal C/C++ functions in legacy" +msgstr "" + +msgid "All releases" +msgstr "" + +msgid "Kruskal - Family of functions" msgstr "" msgid "" @@ -4680,8 +4814,9 @@ msgstr "" msgid "If needed add the new columns, for example:" msgstr "" -msgid "Migration of ``pgr_drivingdistance``" -msgstr "" +#, fuzzy +msgid "Migration of ``pgr_drivingDistance``" +msgstr "ダイクストラ関連機能" msgid "" "Starting from `v3.6.0 `__ :" @@ -4700,10 +4835,10 @@ msgstr "" msgid "|result-spantree|" msgstr "" -msgid "``pgr_drivingdistance`` (Single vertex)" +msgid "pgr_drivingDistance(Single vertex)" msgstr "" -msgid "``pgr_drivingdistance`` (Multiple vertices)" +msgid "pgr_drivingDistance(Multiple vertices)" msgstr "" msgid "Output columns were |result-dij-dd|" @@ -5160,10 +5295,6 @@ msgstr "" msgid "`v4.0.0 `__" msgstr "" -#, fuzzy -msgid "See also" -msgstr "参照" - #, fuzzy msgid ":doc:`pgr_dijkstra`" msgstr ":doc:`pgr_kruskalBFS`" @@ -5209,8 +5340,9 @@ msgstr ":doc:`pgr_kruskalBFS`" msgid "Use ``pgr_withPoints`` when there are no restrictions." msgstr "" -msgid "Use :doc:`pgr_withPoints` (Ont to One) instead." -msgstr "" +#, fuzzy +msgid "Use :doc:`pgr_withPoints` (One to One) instead." +msgstr ":doc:`pgr_kruskalBFS`" msgid "Use ``pgr_trsp_withPoints`` when there are restrictions." msgstr "" @@ -7385,8 +7517,9 @@ msgstr "" msgid ":doc:`migration`" msgstr "" -msgid "pgr_KSP" -msgstr "" +#, fuzzy +msgid "``pgr_KSP``" +msgstr "pgr_TSP" msgid "``pgr_KSP`` — Yen's algorithm for K shortest paths using Dijkstra." msgstr "" @@ -7394,6 +7527,13 @@ msgstr "" msgid "Availability" msgstr "使用可能なバージョン" +#, fuzzy +msgid "Version 4.0.0" +msgstr "バージョン 2.0.0" + +msgid "All signatures promoted to official." +msgstr "" + #, fuzzy msgid "Version 3.6.0" msgstr "バージョン 3.0.0" @@ -7401,25 +7541,25 @@ msgstr "バージョン 3.0.0" msgid "Result columns standarized to: |nksp-result|" msgstr "" -msgid "``pgr_ksp`` (One to One)" +msgid "pgr_ksp(One to One)" msgstr "" msgid "Added ``start_vid`` and ``end_vid`` result columns." msgstr "" -msgid "New overload functions:" -msgstr "新しい **公式** 機能:" +msgid "New proposed signatures:" +msgstr "" -msgid "``pgr_ksp`` (One to Many)" +msgid "pgr_ksp(One to Many)" msgstr "" -msgid "``pgr_ksp`` (Many to One)" +msgid "pgr_ksp(Many to One)" msgstr "" -msgid "``pgr_ksp`` (Many to Many)" +msgid "pgr_ksp(Many to Many)" msgstr "" -msgid "``pgr_ksp`` (Combinations)" +msgid "pgr_ksp(Combinations)" msgstr "" msgid "Version 2.1.0" @@ -7434,7 +7574,8 @@ msgstr "" msgid "Version 2.0.0" msgstr "バージョン 2.0.0" -msgid "**Official** function" +#, fuzzy +msgid "Official function." msgstr "**公式** 機能" msgid "" @@ -7442,6 +7583,12 @@ msgid "" "number of shortest paths desired." msgstr "" +msgid "|Boost| Boost Graph Inside" +msgstr "" + +msgid "Boost Graph Inside" +msgstr "" + msgid "Signatures" msgstr "機能" @@ -7794,6 +7941,11 @@ msgstr "" msgid "``pgr_TSPeuclidean`` - Aproximation using *metric* algorithm." msgstr "" +msgid "" +"Using `Boost: metric TSP approx `__" +msgstr "" + msgid "" "The Simulated Annealing Algorithm related parameters are ignored: " "`max_processing_time`, `tries_per_temperature`, " @@ -7807,7 +7959,8 @@ msgstr "バージョン 3.0.0" msgid "Name change from pgr_eucledianTSP" msgstr "名称が pgr_eucledianTSP から変わりました" -msgid "New **Official** function" +#, fuzzy +msgid "New official function." msgstr "新しい **公式** 機能" msgid "" @@ -7888,57 +8041,51 @@ msgid "" "obtained with ``pgr_TSPeuclidean``." msgstr "" -msgid ":doc:`sampledata` network." -msgstr "" - msgid "``pgr_aStar``" msgstr "" msgid "``pgr_aStar`` — Shortest path using the A* algorithm." msgstr "" +msgid "Combinations signature promoted to official." +msgstr "" + msgid "Standarizing output columns to |short-generic-result|" msgstr "" -msgid "" -"``pgr_aStar`` (`One to One`_) added ``start_vid`` and ``end_vid`` columns." +msgid "pgr_aStar(One to One) added ``start_vid`` and ``end_vid`` columns." msgstr "" -msgid "``pgr_aStar`` (`One to Many`_) added ``end_vid`` column." +msgid "pgr_aStar(One to Many) added ``end_vid`` column." msgstr "" -msgid "``pgr_aStar`` (`Many to One`_) added ``start_vid`` column." +msgid "pgr_aStar(Many to One) added ``start_vid`` column." msgstr "" msgid "Version 3.2.0" msgstr "" -msgid "New **proposed** signature:" +msgid "New proposed signature:" msgstr "" -msgid "``pgr_aStar`` (`Combinations`_)" +msgid "Function promoted to official." msgstr "" msgid "Version 2.4.0" msgstr "" -msgid "New **Proposed** signatures:" -msgstr "" - -msgid "``pgr_aStar`` (`One to Many`_)" -msgstr "" - -msgid "``pgr_aStar`` (`Many to One`_)" +msgid "pgr_aStar(One to Many)" msgstr "" -msgid "``pgr_aStar`` (`Many to Many`_)" +msgid "pgr_aStar(Many to One)" msgstr "" -msgid "Signature change on ``pgr_astar`` (`One to One`_)" +msgid "pgr_aStar(Many to Many)" msgstr "" -msgid "**Official** ``pgr_aStar`` (`One to One`_)" -msgstr "" +#, fuzzy +msgid "Signature change on pgr_aStar(One to One)" +msgstr ":doc:`pgr_kruskalBFS`" msgid "" "The results are equivalent to the union of the results of the `pgr_aStar(` " @@ -8011,7 +8158,7 @@ msgstr "" msgid "Manually assigned vertex combinations." msgstr "" -msgid "pgr_aStarCost" +msgid "``pgr_aStarCost``" msgstr "" #, fuzzy @@ -8019,11 +8166,9 @@ msgid "" "``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." msgstr ":doc:`pgr_dijkstraCost` - 最短経路の総コストを集計します。" -msgid "``pgr_aStarCost`` (`Combinations`_)" -msgstr "" - -msgid "New **proposed** function" -msgstr "" +#, fuzzy +msgid "New proposed function." +msgstr "新しい **公式** 機能" msgid "" "The ``pgr_aStarCost`` function sumarizes of the cost of the shortest path " @@ -8217,7 +8362,7 @@ msgstr "" msgid "`ST_ConcaveHull `__" msgstr "" -msgid "pgr_analyzeGraph" +msgid "``pgr_analyzeGraph``" msgstr "" msgid "``pgr_analyzeGraph`` — Analyzes the network topology." @@ -8479,9 +8624,6 @@ msgid "" "table ``othertable``. (note the use of quote_literal)" msgstr "" -msgid "The examples use the :doc:`sampledata` network." -msgstr "" - msgid ":doc:`pgr_analyzeOneWay`" msgstr "" @@ -8491,7 +8633,7 @@ msgstr "" msgid ":doc:`pgr_nodeNetwork` to create nodes to a not noded edge table." msgstr "" -msgid "pgr_analyzeOneWay" +msgid "``pgr_analyzeOneWay``" msgstr "" msgid "" @@ -8643,8 +8785,9 @@ msgstr "" msgid "Version 2.5.0" msgstr "" -msgid "New **experimental** function" -msgstr "" +#, fuzzy +msgid "New experimental function." +msgstr "新しい **公式** 機能" msgid "" "Those vertices that belong to more than one biconnected component are called " @@ -8675,7 +8818,7 @@ msgid "Nodes in red are the articulation points." msgstr "" msgid "" -"Boost: `Biconnected components & articulation points `__" msgstr "" @@ -8690,37 +8833,30 @@ msgstr "" msgid "``pgr_bdAstar`` — Shortest path using the bidirectional A* algorithm." msgstr "" -msgid "" -"``pgr_bdAstar`` (`One to One`_) added ``start_vid`` and ``end_vid`` columns." -msgstr "" - -msgid "``pgr_bdAstar`` (`One to Many`_) added ``end_vid`` column." -msgstr "" - -msgid "``pgr_bdAstar`` (`Many to One`_) added ``start_vid`` column." +msgid "pgr_bdAstar(One to One) added ``start_vid`` and ``end_vid`` columns." msgstr "" -msgid "``pgr_bdAstar`` (`Combinations`_)" +msgid "pgr_bdAstar(One to Many) added ``end_vid`` column." msgstr "" -msgid "``pgr_bdAstar`` (`One to Many`_)" +msgid "pgr_bdAstar(Many to One) added ``start_vid`` column." msgstr "" -msgid "``pgr_bdAstar`` (`Many to One`_)" +msgid "pgr_bdAstar(One to Many)" msgstr "" -msgid "``pgr_bdAstar`` (`Many to Many`_)" +msgid "pgr_bdAstar(Many to One)" msgstr "" -msgid "Signature change on ``pgr_bdAstar`` (`One to One`_)" +msgid "pgr_bdAstar(Many to Many)" msgstr "" -msgid "**Official** ``pgr_bdAstar`` (`One to One`_)" +msgid "Signature change on pgr_bdAstar(One to One)" msgstr "" msgid "" -"The results are equivalent to the union of the results of the `pgr_bdAStar(` " -"`One to One`_ `)` on the:" +"The results are equivalent to the union of the results of the " +"pgr_bdAStar(One to One) on the:" msgstr "" msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" @@ -8738,7 +8874,7 @@ msgstr "" msgid "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" -msgid "pgr_bdAstarCost" +msgid "``pgr_bdAstarCost``" msgstr "" msgid "" @@ -8746,9 +8882,6 @@ msgid "" "bidirectional A* algorithm." msgstr "" -msgid "``pgr_bdAstarCost`` (`Combinations`_)" -msgstr "" - msgid "" "The ``pgr_bdAstarCost`` function sumarizes of the cost of the shortest path " "using the bidirectional A* algorithm." @@ -8795,25 +8928,16 @@ msgid "" "algorithm." msgstr "" -msgid "pgr_bdDijkstra(`Combinations`_)" +msgid "pgr_bdDijkstra(One to Many)" msgstr "" -msgid "New **Proposed** functions:" +msgid "pgr_bdDijkstra(Many to One)" msgstr "" -msgid "``pgr_bdDijkstra`` (`One to Many`_)" +msgid "pgr_bdDijkstra(Many to Many)" msgstr "" -msgid "``pgr_bdDijkstra`` (`Many to One`_)" -msgstr "" - -msgid "``pgr_bdDijkstra`` (`Many to Many`_)" -msgstr "" - -msgid "Signature change on ``pgr_bdDijsktra`` (`One to One`_)" -msgstr "" - -msgid "**Official** ``pgr_bdDijkstra`` (`One to One`_)" +msgid "Signature change on pgr_bdDijsktra(One to One)" msgstr "" msgid "" @@ -8867,11 +8991,6 @@ msgstr "" msgid "Using a combinations table on an **undirected** graph" msgstr "" -msgid "" -"https://www.cs.princeton.edu/courses/archive/spr06/cos423/Handouts/" -"EPP%20shortest%20path%20algorithms.pdf" -msgstr "" - msgid "https://en.wikipedia.org/wiki/Bidirectional_search" msgstr "" @@ -8883,9 +9002,6 @@ msgid "" "Bidirectional Dijkstra algorithm." msgstr "" -msgid "``pgr_bdDijkstraCost`` (`Combinations`_)" -msgstr "" - msgid "" "The ``pgr_bdDijkstraCost`` function sumarizes of the cost of the shortest " "path using the bidirectional Dijkstra Algorithm." @@ -8944,25 +9060,11 @@ msgstr "" msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm." msgstr "" -msgid "New **experimental** signature:" -msgstr "" - -msgid "``pgr_bellmanFord`` (`Combinations`_)" -msgstr "" - -msgid "New **experimental** signatures:" -msgstr "" - -msgid "``pgr_bellmanFord`` (`One to One`_)" -msgstr "" - -msgid "``pgr_bellmanFord`` (`One to Many`_)" -msgstr "" - -msgid "``pgr_bellmanFord`` (`Many to One`_)" -msgstr "" +#, fuzzy +msgid "New experimental signature:" +msgstr "新しい **公式** 機能" -msgid "``pgr_bellmanFord`` (`Many to Many`_)" +msgid "pgr_bellmanFord(Combinations)" msgstr "" msgid "" @@ -9037,14 +9139,20 @@ msgstr "" msgid "Using a combinations table on an **undirected** graph." msgstr "" -msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" +msgid "" +"`Boost: Bellman Ford `__" msgstr "" -msgid "``pgr_betweennessCentrality``" +msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" msgstr "" +#, fuzzy +msgid "``pgr_betweennessCentrality`` - Experimental" +msgstr "p" + msgid "" -"``pgr_betweennessCentrality`` - Calculates the relative betweeness " +"``pgr_betweennessCentrality`` - Calculates the relative betweenness " "centrality using Brandes Algorithm" msgstr "" @@ -9052,9 +9160,6 @@ msgstr "" msgid "Version 3.7.0" msgstr "バージョン 3.0.0" -msgid "New **experimental** function:" -msgstr "" - msgid "" "The Brandes Algorithm takes advantage of the sparse graphs for evaluating " "the betweenness centrality score of all vertices." @@ -9127,14 +9232,10 @@ msgid "" msgstr "" msgid "" -"Boost's `betweenness_centrality `_" +"`Boost: betweenness centrality `_" msgstr "" -#, fuzzy -msgid "Queries use the :doc:`sampledata` network." -msgstr "クエリは :doc:`sampledata` ネットワークを使用します。" - msgid "``pgr_biconnectedComponents``" msgstr "" @@ -9192,11 +9293,6 @@ msgstr "" msgid "Identifier of the edge that belongs to the ``component``." msgstr "" -msgid "" -"Boost: `Biconnected components `__" -msgstr "" - msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" msgstr "" @@ -9210,19 +9306,7 @@ msgid "" "negative integer, is termed as a 'binary graph'." msgstr "" -msgid "pgr_binaryBreadthFirstSearch(`Combinations`_)" -msgstr "" - -msgid "pgr_binaryBreadthFirstSearch(`One to One`_)" -msgstr "" - -msgid "pgr_binaryBreadthFirstSearch(`One to Many`_)" -msgstr "" - -msgid "pgr_binaryBreadthFirstSearch(`Many to One`_)" -msgstr "" - -msgid "pgr_binaryBreadthFirstSearch(`Many to Many`_)" +msgid "pgr_binaryBreadthFirstSearch(Combinations)" msgstr "" msgid "" @@ -9284,14 +9368,19 @@ msgid "" "math:`1``)" msgstr "" -msgid "https://cp-algorithms.com/graph/01_bfs.html" +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" msgstr "" -msgid "pgr_bipartite -Experimental" +msgid "``pgr_bipartite`` - Experimental" msgstr "" msgid "" @@ -9299,9 +9388,6 @@ msgid "" "within the same set are adjacent." msgstr "" -msgid "New **experimental** signature" -msgstr "" - msgid "" "A bipartite graph is a graph with two sets of vertices which are connected " "to each other, but not within themselves. A bipartite graph is possible if " @@ -9348,28 +9434,29 @@ msgstr "" msgid "Edges in blue represent odd length cycle subgraph." msgstr "" -msgid "``pgr_boykovKolmogorov``" +msgid "" +"`Boost: is_bipartite `__" 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." +"`Wikipedia: bipartite graph `__" msgstr "" -msgid "New **proposed** signature" +msgid "``pgr_boykovKolmogorov``" msgstr "" -msgid "``pgr_boykovKolmogorov`` (`Combinations`_)" +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 "Renamed from ``pgr_maxFlowBoykovKolmogorov``" msgstr "" -msgid "**Proposed** function" -msgstr "" - -msgid "New **Experimental** function" +msgid "Function promoted to proposed." msgstr "" msgid "Running time: Polynomial" @@ -9411,7 +9498,9 @@ msgid "" "math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`." msgstr "" -msgid "https://www.boost.org/libs/graph/doc/boykov_kolmogorov_max_flow.html" +msgid "" +"`Boost: Boykov Kolmogorov max flow `__" msgstr "" msgid "``pgr_breadthFirstSearch`` - Experimental" @@ -9422,12 +9511,6 @@ msgid "" "First Search algorithm." msgstr "" -msgid "``pgr_breadthFirstSearch`` (`Single Vertex`_)" -msgstr "" - -msgid "``pgr_breadthFirstSearch`` (`Multiple Vertices`_)" -msgstr "" - msgid "" "Provides the Breadth First Search traversal order from a root vertex to a " "particular depth." @@ -9492,11 +9575,6 @@ msgstr "" msgid "descending" msgstr "" -msgid "" -"`Boost: Breadth First Search algorithm documentation `__" -msgstr "" - msgid "" "`Wikipedia: Breadth First Search algorithm `__" @@ -9535,7 +9613,9 @@ msgstr "" msgid "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" msgstr "" -msgid "**Supported versions**" +msgid "" +"`Boost: Connected components `__" msgstr "" msgid "``pgr_chinesePostman`` - Experimental" @@ -9593,7 +9673,7 @@ msgstr "" msgid "Minimum costs of a circuit path." msgstr "" -msgid "pgr_connectedComponents" +msgid "``pgr_connectedComponents``" msgstr "" msgid "" @@ -9630,11 +9710,6 @@ msgstr "" msgid "Connecting disconnected components" msgstr "" -msgid "" -"Boost: `Connected components `__" -msgstr "" - msgid "" "wikipedia: `Connected component `__" @@ -9809,7 +9884,7 @@ msgstr "" msgid "Only linear contraction" msgstr "" -msgid "pgr_createTopology" +msgid "``pgr_createTopology``" msgstr "" msgid "" @@ -10012,10 +10087,7 @@ msgid "" "to the rest of the edges." msgstr "" -msgid "The example uses the :doc:`sampledata` network." -msgstr "" - -msgid "pgr_createVerticesTable" +msgid "``pgr_createVerticesTable``" msgstr "" msgid "" @@ -10233,7 +10305,7 @@ msgid "" "Cuthill%E2%80%93McKee_algorithm>`__" msgstr "" -msgid "pgr_dagShortestPath - Experimental" +msgid "``pgr_dagShortestPath`` - Experimental" msgstr "" msgid "" @@ -10315,6 +10387,11 @@ msgstr "結果として返却されるカラム" msgid "Making **start_vids** the same as **end_vids**" msgstr "" +msgid "" +"`Boost: DAG shortest paths `__" +msgstr "" + msgid "https://en.wikipedia.org/wiki/Topological_sorting" msgstr "" @@ -10433,15 +10510,6 @@ msgstr "" msgid "Version 3.3.0" msgstr "" -msgid "Promoted to **proposed** function" -msgstr "" - -msgid "``pgr_depthFirstSearch`` (`Single Vertex`_)" -msgstr "" - -msgid "``pgr_depthFirstSearch`` (`Multiple Vertices`_)" -msgstr "" - msgid "" "Depth First Search algorithm is a traversal algorithm which starts from a " "root vertex, goes as deep as possible, and backtracks once a vertex is " @@ -10495,13 +10563,13 @@ msgid "Same as `Single vertex`_ but with edges in descending order of ``id``." msgstr "" msgid "" -"`Boost: Depth First Search algorithm documentation `__" +"`Boost: Depth First Search `__" msgstr "" msgid "" -"`Boost: Undirected DFS algorithm documentation `__" +"`Boost: Undirected DFS `__" msgstr "" msgid "" @@ -10519,44 +10587,31 @@ msgstr "" msgid "Version 3.5.0" msgstr "バージョン 3.0.0" -msgid "" -"``pgr_dijkstra`` (`One to One`_) added ``start_vid`` and ``end_vid`` columns." +msgid "pgr_dijkstra(One to One) added ``start_vid`` and ``end_vid`` columns." msgstr "" -msgid "``pgr_dijkstra`` (`One to Many`_) added ``end_vid`` column." +msgid "pgr_dijkstra(One to Many) added ``end_vid`` column." msgstr "" -msgid "``pgr_dijkstra`` (`Many to One`_) added ``start_vid`` column." +msgid "pgr_dijkstra(Many to One) added ``start_vid`` column." msgstr "" msgid "Version 3.1.0" msgstr "" -msgid "``pgr_dijkstra`` (`Combinations`_)" -msgstr "" - -msgid "**Official** functions" -msgstr "" - msgid "Version 2.2.0" msgstr "" -msgid "New **proposed** functions:" -msgstr "" - -msgid "``pgr_dijkstra`` (`One to Many`_)" +msgid "pgr_dijkstra(One to Many)" msgstr "" -msgid "``pgr_dijkstra`` (`Many to One`_)" +msgid "pgr_dijkstra(Many to One)" msgstr "" -msgid "``pgr_dijkstra`` (`Many to Many`_)" +msgid "pgr_dijkstra(Many to Many)" msgstr "" -msgid "Signature change on ``pgr_dijkstra`` (`One to One`_)" -msgstr "" - -msgid "**Official** ``pgr_dijkstra`` (`One to One`_)" +msgid "Signature change on pgr_dijkstra(One to One)" msgstr "" #, fuzzy @@ -10745,6 +10800,11 @@ msgstr "" msgid "37) Using `Combinations`_" msgstr "" +msgid "" +"`Boost: Dijkstra shortest paths `__" +msgstr "" + msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgstr "" @@ -10757,9 +10817,6 @@ msgid "" "algorithm." msgstr ":doc:`pgr_dijkstraCost` - 最短経路の総コストを集計します。" -msgid "``pgr_dijkstraCost`` (`Combinations`_)" -msgstr "" - #, fuzzy msgid "" "The ``pgr_dijkstraCost`` function sumarizes of the cost of the shortest path " @@ -11048,9 +11105,6 @@ msgstr "" msgid "When ``false``: ``cap`` limit per ``Start vid`` will be returned" msgstr "" -msgid "boost: https://www.boost.org/libs/graph/doc/table_of_contents.html" -msgstr "" - msgid "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgstr "" @@ -11229,13 +11283,17 @@ msgstr "" msgid "Added ``depth`` and ``pred`` result columns." msgstr "" -msgid "Signature change pgr_drivingDistance(single vertex)" +#, fuzzy +msgid "Signature change:" +msgstr "変更機能" + +msgid "pgr_drivingDistance(single vertex)" msgstr "" -msgid "New **Official** pgr_drivingDistance(multiple vertices)" +msgid "New official signature:" msgstr "" -msgid "Official:: pgr_drivingDistance(single vertex)" +msgid "pgr_drivingDistance(multiple vertices)" msgstr "" msgid "" @@ -11291,7 +11349,7 @@ msgid "" "undirected graph" msgstr "" -msgid "pgr_edgeColoring - Experimental" +msgid "``pgr_edgeColoring`` - Experimental" msgstr "" msgid "" @@ -11365,6 +11423,15 @@ msgstr "" msgid "Graph coloring of pgRouting :doc:`sampledata`" msgstr "" +msgid "" +"`Boost: Edge Coloring `__" +msgstr "" + +msgid "" +"`Wikipedia: Graph coloring `__" +msgstr "" + msgid "``pgr_edgeDisjointPaths``" msgstr "" @@ -11373,9 +11440,6 @@ msgid "" "groups of vertices." msgstr "" -msgid "New **proposed** function:" -msgstr "" - msgid "pgr_edgeDisjointPaths(Combinations)" msgstr "" @@ -11457,9 +11521,6 @@ msgid "" "the flow from the sources to the targets using Edmonds Karp Algorithm." msgstr "" -msgid "``pgr_edmondsKarp`` (`Combinations`_)" -msgstr "" - msgid "Renamed from ``pgr_maxFlowEdmondsKarp``" msgstr "" @@ -11481,32 +11542,22 @@ msgstr "" msgid "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -msgid "https://www.boost.org/libs/graph/doc/edmonds_karp_max_flow.html" +msgid "" +"`Boost: Edmonds Karp max flow `__" msgstr "" msgid "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" msgstr "" -msgid "``pgr_edwardMoore - Experimental``" +msgid "``pgr_edwardMoore`` - Experimental" msgstr "" msgid "" "``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore algorithm." msgstr "" -msgid "``pgr_edwardMoore`` (`Combinations`_)" -msgstr "" - -msgid "``pgr_edwardMoore`` (`One to One`_)" -msgstr "" - -msgid "``pgr_edwardMoore`` (`One to Many`_)" -msgstr "" - -msgid "``pgr_edwardMoore`` (`Many to One`_)" -msgstr "" - -msgid "``pgr_edwardMoore`` (`Many to Many`_)" +msgid "pgr_edwardMoore(Combinations)" msgstr "" msgid "" @@ -11568,7 +11619,7 @@ msgstr "" msgid "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" msgstr "" -msgid "pgr_extractVertices -- Proposed" +msgid "``pgr_extractVertices`` -- Proposed" msgstr "" msgid "``pgr_extractVertices`` — Extracts the vertices information" @@ -11669,21 +11720,12 @@ msgid "" "= true``." msgstr "" -msgid "``pgr_findCloseEdges``" +msgid "``pgr_findCloseEdges`` - Proposed" msgstr "" msgid "``pgr_findCloseEdges`` - Finds the close edges to a point geometry." msgstr "" -msgid "New **proposed** signatures:" -msgstr "" - -msgid "``pgr_findCloseEdges`` (`One point`_)" -msgstr "" - -msgid "``pgr_findCloseEdges`` (`Many points`_)" -msgstr "" - msgid "" "``pgr_findCloseEdges`` - An utility function that finds the closest edge to " "a point geometry." @@ -12161,9 +12203,6 @@ msgid "" "floyd_warshall_shortest.html>`_" msgstr "" -msgid "Queries uses the :doc:`sampledata` network." -msgstr "" - msgid "``pgr_full_version``" msgstr "" @@ -12171,9 +12210,6 @@ msgid "" "``pgr_full_version`` — Get the details of pgRouting version information." msgstr "" -msgid "New **official** function" -msgstr "" - msgid "Get complete details of pgRouting version information" msgstr "" @@ -12240,17 +12276,15 @@ msgstr "" msgid "Git hash of pgRouting build" msgstr "" -msgid "``pgr_hawickCircuits - Experimental``" -msgstr "" +#, fuzzy +msgid "``pgr_hawickCircuits`` - Experimental" +msgstr "p" msgid "" "``pgr_hawickCircuits`` — Returns the list of cirucits using hawick circuits " "algorithm." msgstr "" -msgid "``pgr_hawickCircuits``" -msgstr "" - msgid "" "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. " "James. This algorithm solves the problem of detecting and enumerating " @@ -12375,7 +12409,9 @@ msgid "" "blue represent :math:`K_5` subgraph." msgstr "" -msgid "https://www.boost.org/libs/graph/doc/boyer_myrvold.html" +msgid "" +"`Boost: Boyer Myrvold `__" msgstr "" msgid "``pgr_johnson``" @@ -12508,8 +12544,9 @@ msgstr "" msgid "pgr_kruskalDFS(`Edges SQL`_, **root vids**, [``max_depth``])" msgstr "" -msgid "pgr_lengauerTarjanDominatorTree -Experimental" -msgstr "" +#, fuzzy +msgid "``pgr_lengauerTarjanDominatorTree`` - Experimental" +msgstr "p" msgid "" "``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all " @@ -12566,8 +12603,8 @@ msgid "Dominator tree of another component." msgstr "" msgid "" -"`Boost: Lengauer-Tarjan dominator tree algorithm `__" +"`Boost: Lengauer-Tarjan dominator `__" msgstr "" msgid "" @@ -12575,7 +12612,7 @@ msgid "" "Dominator_(graph_theory)>`__" msgstr "" -msgid "pgr_lineGraph - Proposed" +msgid "``pgr_lineGraph`` - Proposed" msgstr "" msgid "" @@ -12583,9 +12620,6 @@ msgid "" "based graph." msgstr "" -msgid "Promoted to **proposed** signature." -msgstr "" - #, fuzzy msgid "Works for directed and undirected graphs." msgstr "導かれないグラフ。" @@ -12856,8 +12890,7 @@ msgid "Full line graph of subgraph of edges :math:`\\{4, 7, 8, 10\\}`" msgstr "" msgid "" -"The examples of this section are based on the :doc:`sampledata` network. The " -"examples include the subgraph including edges 4, 7, 8, and 10 with " +"The examples include the subgraph including edges 4, 7, 8, and 10 with " "``reverse_cost``." msgstr "" @@ -13076,15 +13109,15 @@ msgstr "" msgid "Returns set of |result-component-make|" msgstr "" -msgid "" -"Query done on :doc:`sampledata` network gives the list of edges that are " -"needed to connect the graph." +msgid "List of edges that are needed to connect the graph." msgstr "" -msgid "https://www.boost.org/libs/graph/doc/make_connected.html" +msgid "" +"`Boost: make connected `__" msgstr "" -msgid "pgr_maxCardinalityMatch" +msgid "``pgr_maxCardinalityMatch``" msgstr "" msgid "" @@ -13092,13 +13125,16 @@ msgid "" "graph." msgstr "" +msgid "pgr_maxCardinalityMatch(text) returns only ``edge`` column." +msgstr "" + msgid "Deprecated signature" msgstr "" -msgid "``pgr_maxCardinalityMatch(text,boolean)``" +msgid "pgr_maxCardinalityMatch(text,boolean)" msgstr "" -msgid "``directed => false`` when used." +msgid "directed => ``false`` when used." msgstr "" msgid "Renamed from ``pgr_maximumCardinalityMatching``" @@ -13149,7 +13185,9 @@ msgstr "" msgid "Identifier of the edge in the original query." msgstr "" -msgid "https://www.boost.org/libs/graph/doc/maximum_matching.html" +msgid "" +"`Boost: maximum_matching `__" msgstr "" msgid "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" @@ -13166,12 +13204,6 @@ msgid "" "source(s) to the targets(s) using the Push Relabel algorithm." msgstr "" -msgid "``pgr_maxFlow`` (`Combinations`_)" -msgstr "" - -msgid "New **Proposed** function" -msgstr "" - msgid "Calculates the maximum flow from the sources to the targets." msgstr "" @@ -13206,7 +13238,9 @@ msgstr "" msgid "Maximum flow possible from the source(s) to the target(s)" msgstr "" -msgid "https://www.boost.org/libs/graph/doc/push_relabel_max_flow.html" +msgid "" +"`Boost: push relabel max flow `__" msgstr "" msgid "" @@ -13221,7 +13255,10 @@ msgid "" "of the maximum flow on a graph" msgstr "" -msgid "``pgr_maxFlowMinCost`` (`Combinations`_)" +msgid "pgr_maxFlowMinCost(Combinations)" +msgstr "" + +msgid "|boost| graph inside." msgstr "" msgid "**TODO** check which statement is true:" @@ -13265,11 +13302,6 @@ msgstr "" msgid "Returns set of |result-flow-mincost|" msgstr "" -msgid "" -"https://www.boost.org/libs/graph/doc/" -"successive_shortest_path_nonnegative_weights.html" -msgstr "" - msgid "``pgr_maxFlowMinCost_Cost`` - Experimental" msgstr "" @@ -13278,7 +13310,7 @@ msgid "" "maximum flow on a graph" msgstr "" -msgid "``pgr_maxFlowMinCost_Cost`` (`Combinations`_)" +msgid "pgr_maxFlowMinCost_Cost(Combinations)" msgstr "" msgid "**The cost value of all input edges must be nonnegative.**" @@ -13311,7 +13343,7 @@ msgstr "" msgid "Minimum Cost Maximum Flow possible from the source(s) to the target(s)" msgstr "" -msgid "pgr_nodeNetwork" +msgid "``pgr_nodeNetwork``" msgstr "" msgid "``pgr_nodeNetwork`` - Nodes an network edge table." @@ -13852,9 +13884,6 @@ msgid "" "the flow from the sources to the targets using Push Relabel Algorithm." msgstr "" -msgid "``pgr_pushRelabel`` (`Combinations`_)" -msgstr "" - msgid "Renamed from ``pgr_maxFlowPushRelabel``" msgstr "" @@ -13873,7 +13902,7 @@ msgstr "" msgid "pgr_pushRelabel(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -msgid "pgr_sequentialVertexColoring - Proposed" +msgid "``pgr_sequentialVertexColoring`` - Proposed" msgstr "" msgid "" @@ -13881,9 +13910,6 @@ msgid "" "undirected graph, using greedy approach." msgstr "" -msgid "Promoted to **proposed** signature" -msgstr "" - msgid "" "Sequential vertex coloring algorithm is a graph coloring algorithm in which " "color identifiers are assigned to the vertices of a graph in a sequential " @@ -13926,7 +13952,12 @@ msgstr "" msgid "pgr_sequentialVertexColoring(`Edges SQL`_)" msgstr "" -msgid "pgr_stoerWagner - Experimental" +msgid "" +"`Boost: Sequential Vertex Coloring `__" +msgstr "" + +msgid "``pgr_stoerWagner`` - Experimental" msgstr "" msgid "``pgr_stoerWagner`` — The min-cut of graph using stoerWagner algorithm." @@ -14011,6 +14042,11 @@ msgstr "" msgid "Using :doc:`pgr_connectedComponents`" msgstr "" +msgid "" +"`Boost: Stoer Wagner min cut `__" +msgstr "" + msgid "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" msgstr "" @@ -14040,7 +14076,7 @@ msgid "The strong components of the graph" msgstr "" msgid "" -"Boost: `Strong components `__" msgstr "" @@ -14105,6 +14141,11 @@ msgstr "" msgid "Graph is not a DAG" msgstr "" +msgid "" +"`Boost: topological sort `__" +msgstr "" + msgid "``pgr_transitiveClosure`` - Experimental" msgstr "" @@ -14160,50 +14201,54 @@ msgstr "" msgid "Identifiers of the vertices that are reachable from vertex v." msgstr "" -msgid "https://en.wikipedia.org/wiki/Transitive_closure" +msgid "" +"`Boost: transitive closure `__" msgstr "" -msgid "pgr_trsp - Proposed" +msgid "https://en.wikipedia.org/wiki/Transitive_closure" msgstr "" -msgid "``pgr_trsp`` - routing vertices with restrictions." +msgid "``pgr_trsp``" msgstr "" -msgid "New proposed signatures" +msgid "``pgr_trsp`` - routing vertices with restrictions." msgstr "" -msgid "``pgr_trsp`` (`One to One`_)" +msgid "pgr_trsp(One to One)" msgstr "" -msgid "``pgr_trsp`` (`One to Many`_)" +msgid "pgr_trsp(One to Many)" msgstr "" -msgid "``pgr_trsp`` (`Many to One`_)" +msgid "pgr_trsp(Many to One)" msgstr "" -msgid "``pgr_trsp`` (`Many to Many`_)" +msgid "pgr_trsp(Many to Many)" msgstr "" -msgid "``pgr_trsp`` (`Combinations`_)" +msgid "pgr_trsp(Combinations)" msgstr "" msgid "Deprecated signatures" msgstr "" -msgid "``pgr_trsp(text,integer,float,integer,float,boolean,boolean,text)``" +msgid "pgr_trsp(text,integer,float,integer,float,boolean,boolean,text)" msgstr "" -msgid "``pgr_trspViaVertices(text,anyarray,boolean,boolean,text)``" +msgid "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" msgstr "" msgid "New prototypes" msgstr "" -msgid "``pgr_trspViaVertices``" -msgstr "" +#, fuzzy +msgid "pgr_trspViaVertices" +msgstr "ダイクストラ関連機能" -msgid "``pgr_trspViaEdges``" -msgstr "" +#, fuzzy +msgid "pgr_trspViaEdges" +msgstr "ダイクストラ関連機能" msgid "" "Turn restricted shortest path (TRSP) is an algorithm that receives turn " @@ -14275,19 +14320,14 @@ msgid "" "`Deprecated documentation `_" msgstr "" -msgid "``pgr_trspVia`` - Proposed" -msgstr "" +#, fuzzy +msgid "``pgr_trspVia``" +msgstr "ダイクストラ関連機能" msgid "" "``pgr_trspVia`` Route that goes through a list of vertices with restrictions." msgstr "" -msgid "New proposed function:" -msgstr "" - -msgid "``pgr_trspVia`` (`One Via`_)" -msgstr "" - msgid "" "Given a list of vertices and a graph, this function is equivalent to finding " "the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :" @@ -14365,17 +14405,15 @@ msgstr "" msgid ":doc:`via-category`" msgstr "" -msgid "``pgr_trspVia_withPoints`` - Proposed" -msgstr "" +#, fuzzy +msgid "``pgr_trspVia_withPoints``" +msgstr ":doc:`pgr_kruskalBFS`" msgid "" "``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/" "or points with restrictions." msgstr "" -msgid "``pgr_trspVia_withPoints`` (`One Via`_)" -msgstr "" - msgid "" "Given a graph, a set of restriction on the graph edges, a set of points on " "the graphs edges and a list of vertices, this function is equivalent to " @@ -14535,30 +14573,12 @@ msgid "" "`pgr_trsp` algorithm. In this case a U turn is been done using the same edge." msgstr "" -msgid "pgr_trsp_withPoints - Proposed" +msgid "``pgr_trsp_withPoints``" msgstr "" msgid "``pgr_trsp_withPoints`` Routing Vertex/Point with restrictions." msgstr "" -msgid "New proposed signatures:" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (`One to One`_)" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (`One to Many`_)" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (`Many to One`_)" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (`Many to Many`_)" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (`Combinations`_)" -msgstr "" - msgid "" "Modify the graph to include points defined by points_sql. Using Dijkstra " "algorithm, find the shortest path" @@ -14668,7 +14688,7 @@ msgid "" "`1` on an undirected graph, with details." msgstr "" -msgid "pgr_turnRestrictedPath - Experimental" +msgid "``pgr_turnRestrictedPath`` - Experimental" msgstr "" msgid "" @@ -14676,10 +14696,6 @@ msgid "" "with restrictions" msgstr "" -#, fuzzy -msgid "New experimental function" -msgstr "新しい **公式** 機能" - msgid "" "Using Yen's algorithm to obtain K shortest paths and analyze the paths to " "select the paths that do not use the restrictions" @@ -14751,7 +14767,7 @@ msgstr "" msgid "pgRouting Version for this documentation" msgstr "" -msgid "pgr_vrpOneDepot - Experimental" +msgid "``pgr_vrpOneDepot`` - Experimental" msgstr "" msgid "**No documentation available**" @@ -14760,8 +14776,9 @@ msgstr "" msgid "**TBD**" msgstr "" -msgid "``pgr_withPoints`` - Proposed" -msgstr "" +#, fuzzy +msgid "``pgr_withPoints``" +msgstr ":doc:`pgr_kruskalBFS`" msgid "" "``pgr_withPoints`` - Returns the shortest path in a graph with additional " @@ -14903,8 +14920,9 @@ msgstr "" msgid "Passes in front or visits with left side driving." msgstr "" -msgid "``pgr_withPointsCost`` - Proposed" -msgstr "" +#, fuzzy +msgid "``pgr_withPointsCost``" +msgstr ":doc:`pgr_kruskalBFS`" msgid "" "``pgr_withPointsCost`` - Calculates the shortest path and returns only the " @@ -15047,7 +15065,7 @@ msgstr "" msgid "Does not matter driving side driving topology" msgstr "" -msgid "``pgr_withPointsCostMatrix`` - proposed" +msgid "``pgr_withPointsCostMatrix``" msgstr "" msgid "" @@ -15079,8 +15097,9 @@ msgid "" "locations on the graph of point `(2.9, 1.8)`." msgstr "" -msgid "``pgr_withPointsDD`` - Proposed" -msgstr "" +#, fuzzy +msgid "``pgr_withPointsDD``" +msgstr ":doc:`pgr_kruskalBFS`" msgid "" "``pgr_withPointsDD`` - Returns the driving **distance** from a starting " @@ -15092,7 +15111,10 @@ msgid "" "unnamed compulsory **driving side**." msgstr "" -msgid "``pgr_withPointsDD`` (`Single vertex`)" +msgid "pgr_withPointsDD(Single vertex)" +msgstr "" + +msgid "pgr_withPointsDD(Multiple vertices)" msgstr "" msgid "Added ``depth``, ``pred`` and ``start_vid`` column." @@ -15110,13 +15132,12 @@ msgid "" msgstr "" msgid "" -"``pgr_withpointsdd(text,text,bigint,double precision,boolean,character," -"boolean)``" +"pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" msgstr "" msgid "" -"``pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)``" +"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," +"boolean,boolean)" msgstr "" msgid "" @@ -15227,8 +15248,9 @@ msgstr "" msgid ":doc:`pgr_alphaShape`" msgstr "" -msgid "pgr_withPointsKSP - Proposed" -msgstr "" +#, fuzzy +msgid "``pgr_withPointsKSP``" +msgstr ":doc:`pgr_kruskalBFS`" msgid "" "``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." @@ -15237,27 +15259,23 @@ msgstr "" msgid "Standarizing output columns to |nksp-result|" msgstr "" -msgid "``pgr_withPointsKSP`` (One to One)" +msgid "pgr_withPointsKSP(One to One)" msgstr "" -#, fuzzy -msgid "New overload functions" -msgstr "新しい **公式** 機能" - -msgid "``pgr_withPointsKSP`` (One to Many)" +msgid "pgr_withPointsKSP(One to Many)" msgstr "" -msgid "``pgr_withPointsKSP`` (Many to One)" +msgid "pgr_withPointsKSP(Many to One)" msgstr "" -msgid "``pgr_withPointsKSP`` (Many to Many)" +msgid "pgr_withPointsKSP(Many to Many)" msgstr "" -msgid "``pgr_withPointsKSP`` (Combinations)" +msgid "pgr_withPointsKSP(Combinations)" msgstr "" msgid "" -"``pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," +"pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," "boolean)``" msgstr "" @@ -15379,17 +15397,15 @@ msgid "" "to point :math:`2` with heap paths and details." msgstr "" -msgid "``pgr_withPointsVia`` - Proposed" -msgstr "" +#, fuzzy +msgid "``pgr_withPointsVia``" +msgstr ":doc:`pgr_kruskalBFS`" msgid "" "``pgr_withPointsVia`` - Route that goes through a list of vertices and/or " "points." msgstr "" -msgid "New **proposed** function ``pgr_withPointsVia`` (`One Via`_)" -msgstr "" - msgid "" "Given a graph, a set of points on the graphs edges and a list of vertices, " "this function is equivalent to finding the shortest path between :math:" @@ -15534,6 +15550,20 @@ msgstr "" msgid "pgRouting 3.7" msgstr "" +msgid "pgRouting 3.7.3 Release Notes" +msgstr "" + +msgid "" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.7.3 `__" +msgstr "" + +msgid "" +"`#2731 `__ Build Failure " +"on Ubuntu 22" +msgstr "" + msgid "pgRouting 3.7.2 Release Notes" msgstr "" @@ -15780,31 +15810,11 @@ msgid "" "output pgr_aStar" msgstr "" -msgid "" -"``pgr_aStar`` (`One to One`) added ``start_vid`` and ``end_vid`` columns." -msgstr "" - -msgid "``pgr_aStar`` (`One to Many`) added ``end_vid`` column." -msgstr "" - -msgid "``pgr_aStar`` (`Many to One`) added ``start_vid`` column." -msgstr "" - msgid "" "`#2523 `__ Standarize " "output pgr_bdAstar" msgstr "" -msgid "" -"``pgr_bdAstar`` (`One to One`) added ``start_vid`` and ``end_vid`` columns." -msgstr "" - -msgid "``pgr_bdAstar`` (`One to Many`) added ``end_vid`` column." -msgstr "" - -msgid "``pgr_bdAstar`` (`Many to One`) added ``start_vid`` column." -msgstr "" - msgid "" "`#2547 `__ Standarize " "output and modifying signature pgr_KSP" @@ -15812,7 +15822,7 @@ msgstr "" msgid "" "`#2548 `__ Standarize " -"output pgr_drivingdistance" +"output pgr_drivingDistance" msgstr "" #, fuzzy @@ -15960,16 +15970,6 @@ msgstr "" msgid "Dijkstra" msgstr "" -msgid "" -"``pgr_dijkstra`` (`One to One`) added ``start_vid`` and ``end_vid`` columns." -msgstr "" - -msgid "``pgr_dijkstra`` (`One to Many`) added ``end_vid`` column." -msgstr "" - -msgid "``pgr_dijkstra`` (`Many to One`) added ``start_vid`` column." -msgstr "" - msgid "pgRouting 3.4" msgstr "" @@ -16026,14 +16026,16 @@ msgid "" "doesn't give all correct shortest path" msgstr "" -msgid "New proposed functions" -msgstr "" +#, fuzzy +msgid "New proposed functions." +msgstr "新しい **公式** 機能" msgid "With points" msgstr "" -msgid "``pgr_withPointsVia`` (One Via)" -msgstr "" +#, fuzzy +msgid "pgr_withPointsVia(One Via)" +msgstr ":doc:`pgr_kruskalBFS`" msgid "Turn Restrictions" msgstr "" @@ -16041,88 +16043,73 @@ msgstr "" msgid "Via with turn restrictions" msgstr "" -msgid "``pgr_trspVia`` (One Via)" +msgid "pgr_trspVia(One Via)" msgstr "" -msgid "``pgr_trspVia_withPoints`` (One Via)" -msgstr "" +#, fuzzy +msgid "pgr_trspVia_withPoints(One Via)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "``pgr_trsp``" -msgstr "" +#, fuzzy +msgid "pgr_trsp_withPoints(One to One)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "``pgr_trsp`` (One to One)" -msgstr "" +#, fuzzy +msgid "pgr_trsp_withPoints(One to Many)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "``pgr_trsp`` (One to Many)" -msgstr "" - -msgid "``pgr_trsp`` (Many to One)" -msgstr "" - -msgid "``pgr_trsp`` (Many to Many)" -msgstr "" - -msgid "``pgr_trsp`` (Combinations)" -msgstr "" - -msgid "``pgr_trsp_withPoints``" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (One to One)" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (One to Many)" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (Many to One)" -msgstr "" +#, fuzzy +msgid "pgr_trsp_withPoints(Many to One)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "``pgr_trsp_withPoints`` (Many to Many)" -msgstr "" +#, fuzzy +msgid "pgr_trsp_withPoints(Many to Many)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "``pgr_trsp_withPoints`` (Combinations)" -msgstr "" +#, fuzzy +msgid "pgr_trsp_withPoints(Combinations)" +msgstr ":doc:`pgr_kruskalBFS`" msgid "Topology" msgstr "" -msgid "``pgr_degree``" -msgstr "" - msgid "Utilities" msgstr "" -msgid "``pgr_findCloseEdges`` (One point)" +msgid "pgr_findCloseEdges(One point)" msgstr "" -msgid "``pgr_findCloseEdges`` (Many points)" +msgid "pgr_findCloseEdges(Many points)" msgstr "" msgid "Ordering" msgstr "" -msgid "``pgr_cuthillMckeeOrdering``" +msgid "pgr_cuthillMckeeOrdering" msgstr "" msgid "Unclassified" msgstr "" +msgid "pgr_hawickCircuits" +msgstr "" + msgid "Flow functions" msgstr "" -msgid "``pgr_maxCardinalityMatch(text)``" +msgid "pgr_maxCardinalityMatch(text)" msgstr "" -msgid "Deprecating ``pgr_maxCardinalityMatch(text,boolean)``" +msgid "Deprecating: pgr_maxCardinalityMatch(text,boolean)" msgstr "" msgid "Deprecated Functions" msgstr "" -msgid "``pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)``" +msgid "pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)" msgstr "" -msgid "``pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text)``" +msgid "pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text)" msgstr "" msgid "pgRouting 3.3" @@ -16384,12 +16371,6 @@ msgstr "" msgid "Removing support for Boost v1.53, v1.54 & v1.55" msgstr "" -msgid "pgr_bellmanFord(Combinations)" -msgstr "" - -msgid "pgr_binaryBreadthFirstSearch(Combinations)" -msgstr "" - msgid "pgr_bipartite" msgstr "" @@ -16399,9 +16380,6 @@ msgstr "" msgid "Dijkstra Near" msgstr "" -msgid "pgr_edwardMoore(Combinations)" -msgstr "" - msgid "pgr_isPlanar" msgstr "" @@ -16411,51 +16389,15 @@ msgstr "" msgid "pgr_makeConnected" msgstr "" -msgid "pgr_maxFlowMinCost(Combinations)" -msgstr "" - -msgid "pgr_maxFlowMinCost_Cost(Combinations)" -msgstr "" - msgid "Astar" msgstr "" -msgid "pgr_aStar(Combinations)" -msgstr "" - -msgid "pgr_aStarCost(Combinations)" -msgstr "" - msgid "Bidirectional Astar" msgstr "" -msgid "pgr_bdAstar(Combinations)" -msgstr "" - -msgid "pgr_bdAstarCost(Combinations)" -msgstr "" - msgid "Bidirectional Dijkstra" msgstr "" -msgid "pgr_bdDijkstra(Combinations)" -msgstr "" - -msgid "pgr_bdDijkstraCost(Combinations)" -msgstr "" - -msgid "pgr_boykovKolmogorov(Combinations)" -msgstr "" - -msgid "pgr_edmondsKarp(Combinations)" -msgstr "" - -msgid "pgr_maxFlow(Combinations)" -msgstr "" - -msgid "pgr_pushRelabel(Combinations)" -msgstr "" - msgid "pgRouting 3.1" msgstr "" @@ -16690,7 +16632,7 @@ msgid "" "information" msgstr "" -msgid "New functions" +msgid "New Functions" msgstr "" msgid "Kruskal family" @@ -16729,148 +16671,115 @@ msgstr "" msgid "aStar Family" msgstr "" -msgid "pgr_aStar(one to many)" -msgstr "" - -msgid "pgr_aStar(many to one)" -msgstr "" - -msgid "pgr_aStar(many to many)" -msgstr "" - -msgid "pgr_aStarCost(one to one)" -msgstr "" - -msgid "pgr_aStarCost(one to many)" -msgstr "" - -msgid "pgr_aStarCost(many to one)" -msgstr "" - -msgid "pgr_aStarCost(many to many)" -msgstr "" +#, fuzzy +msgid "pgr_aStarCost(One to One)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_aStarCostMatrix(one to one)" -msgstr "" +#, fuzzy +msgid "pgr_aStarCost(One to Many)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_aStarCostMatrix(one to many)" -msgstr "" +#, fuzzy +msgid "pgr_aStarCost(Many to One)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_aStarCostMatrix(many to one)" -msgstr "" +#, fuzzy +msgid "pgr_aStarCost(Many to Many)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_aStarCostMatrix(many to many)" -msgstr "" +#, fuzzy +msgid "pgr_aStarCostMatrix" +msgstr ":doc:`pgr_kruskalBFS`" msgid "bdAstar Family" msgstr "" -msgid "pgr_bdAstar(one to many)" -msgstr "" - -msgid "pgr_bdAstar(many to one)" -msgstr "" - -msgid "pgr_bdAstar(many to many)" -msgstr "" - -msgid "pgr_bdAstarCost(one to one)" -msgstr "" - -msgid "pgr_bdAstarCost(one to many)" -msgstr "" - -msgid "pgr_bdAstarCost(many to one)" -msgstr "" - -msgid "pgr_bdAstarCost(many to many)" -msgstr "" +#, fuzzy +msgid "pgr_bdAstarCost(One to One)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_bdAstarCostMatrix(one to one)" -msgstr "" +#, fuzzy +msgid "pgr_bdAstarCost(One to Many)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_bdAstarCostMatrix(one to many)" -msgstr "" +#, fuzzy +msgid "pgr_bdAstarCost(Many to One)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_bdAstarCostMatrix(many to one)" -msgstr "" +#, fuzzy +msgid "pgr_bdAstarCost(Many to Many)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_bdAstarCostMatrix(many to many)" +msgid "pgr_bdAstarCostMatrix" msgstr "" msgid "bdDijkstra Family" msgstr "" -msgid "pgr_bdDijkstra(one to many)" -msgstr "" - -msgid "pgr_bdDijkstra(many to one)" -msgstr "" - -msgid "pgr_bdDijkstra(many to many)" -msgstr "" - -msgid "pgr_bdDijkstraCost(one to one)" -msgstr "" - -msgid "pgr_bdDijkstraCost(one to many)" -msgstr "" - -msgid "pgr_bdDijkstraCost(many to one)" -msgstr "" - -msgid "pgr_bdDijkstraCost(many to many)" -msgstr "" +#, fuzzy +msgid "pgr_bdDijkstraCost(One to One)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_bdDijkstraCostMatrix(one to one)" -msgstr "" +#, fuzzy +msgid "pgr_bdDijkstraCost(One to Many)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_bdDijkstraCostMatrix(one to many)" -msgstr "" +#, fuzzy +msgid "pgr_bdDijkstraCost(Many to One)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_bdDijkstraCostMatrix(many to one)" -msgstr "" +#, fuzzy +msgid "pgr_bdDijkstraCost(Many to Many)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_bdDijkstraCostMatrix(many to many)" +msgid "pgr_bdDijkstraCostMatrix" msgstr "" msgid "Flow Family" msgstr "" -msgid "pgr_pushRelabel(one to one)" -msgstr "" +#, fuzzy +msgid "pgr_pushRelabel(One to One)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_pushRelabel(one to many)" -msgstr "" +#, fuzzy +msgid "pgr_pushRelabel(One to Many)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_pushRelabel(many to one)" -msgstr "" +#, fuzzy +msgid "pgr_pushRelabel(Many to One)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_pushRelabel(many to many)" -msgstr "" +#, fuzzy +msgid "pgr_pushRelabel(Many to Many)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_edmondsKarp(one to one)" -msgstr "" +#, fuzzy +msgid "pgr_edmondsKarp(One to One)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_edmondsKarp(one to many)" -msgstr "" +#, fuzzy +msgid "pgr_edmondsKarp(One to Many)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_edmondsKarp(many to one)" -msgstr "" +#, fuzzy +msgid "pgr_edmondsKarp(Many to One)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_edmondsKarp(many to many)" -msgstr "" +#, fuzzy +msgid "pgr_edmondsKarp(Many to Many)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_boykovKolmogorov (one to one)" +msgid "pgr_boykovKolmogorov (One to One)" msgstr "" -msgid "pgr_boykovKolmogorov (one to many)" +msgid "pgr_boykovKolmogorov (One to Many)" msgstr "" -msgid "pgr_boykovKolmogorov (many to one)" +msgid "pgr_boykovKolmogorov (Many to One)" msgstr "" -msgid "pgr_boykovKolmogorov (many to many)" +msgid "pgr_boykovKolmogorov (Many to Many)" msgstr "" msgid "pgr_maxCardinalityMatching" @@ -16879,21 +16788,28 @@ msgstr "" msgid "pgr_maxFlow" msgstr "" -msgid "pgr_edgeDisjointPaths(one to one)" -msgstr "" +#, fuzzy +msgid "pgr_edgeDisjointPaths(One to One)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_edgeDisjointPaths(one to many)" -msgstr "" +#, fuzzy +msgid "pgr_edgeDisjointPaths(One to Many)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_edgeDisjointPaths(many to one)" -msgstr "" +#, fuzzy +msgid "pgr_edgeDisjointPaths(Many to One)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_edgeDisjointPaths(many to many)" -msgstr "" +#, fuzzy +msgid "pgr_edgeDisjointPaths(Many to Many)" +msgstr ":doc:`pgr_kruskalBFS`" msgid "Components family" msgstr "" +msgid "pgr_connectedComponents" +msgstr "" + msgid "pgr_strongComponents" msgstr "" @@ -17080,7 +16996,7 @@ msgstr "" msgid "pgr_johnson" msgstr "" -msgid "pgr_astar" +msgid "pgr_aStar" msgstr "" msgid "pgr_bdAstar" @@ -17101,6 +17017,9 @@ msgstr "" msgid "pgr_drivingDistance" msgstr "" +msgid "pgr_KSP" +msgstr "" + msgid "pgr_dijkstraVia (proposed)" msgstr "" @@ -17299,23 +17218,15 @@ msgstr "" msgid "Parameter names changed" msgstr "" -msgid "The many version results are the union of the one to one version" +msgid "The many version results are the union of the One to One version" msgstr "" msgid "New Signatures" msgstr "" -msgid "pgr_bdAstar(one to one)" -msgstr "" - -msgid "New Proposed functions" -msgstr "" - -msgid "pgr_bdAstarCostMatrix" -msgstr "" - -msgid "pgr_bdDijkstraCostMatrix" -msgstr "" +#, fuzzy +msgid "pgr_bdAstar(One to One)" +msgstr ":doc:`pgr_kruskalBFS`" msgid "pgr_lineGraph" msgstr "" @@ -17397,31 +17308,7 @@ msgstr "" msgid "pgr_bdDijkstra" msgstr "" -msgid "New Proposed Signatures" -msgstr "" - -msgid "pgr_astar(one to many)" -msgstr "" - -msgid "pgr_astar(many to one)" -msgstr "" - -msgid "pgr_astar(many to many)" -msgstr "" - -msgid "pgr_astarCost(one to one)" -msgstr "" - -msgid "pgr_astarCost(one to many)" -msgstr "" - -msgid "pgr_astarCost(many to one)" -msgstr "" - -msgid "pgr_astarCost(many to many)" -msgstr "" - -msgid "pgr_astarCostMatrix" +msgid "Deprecated signatures." msgstr "" msgid "pgr_bddijkstra - use pgr_bdDijkstra instead" @@ -17493,52 +17380,48 @@ msgstr "" msgid "pgr_TSP" msgstr "pgr_TSP" -msgid "pgr_aStar" -msgstr "" - -msgid "New Functions" -msgstr "" - msgid "pgr_eucledianTSP" msgstr "" -msgid "pgr_withPointsCostMatrix" -msgstr "" - -msgid "pgr_maxFlowPushRelabel(one to one)" +msgid "pgr_maxFlowPushRelabel(One to One)" msgstr "" -msgid "pgr_maxFlowPushRelabel(one to many)" +msgid "pgr_maxFlowPushRelabel(One to Many)" msgstr "" -msgid "pgr_maxFlowPushRelabel(many to one)" +msgid "pgr_maxFlowPushRelabel(Many to One)" msgstr "" -msgid "pgr_maxFlowPushRelabel(many to many)" -msgstr "" +#, fuzzy +msgid "pgr_maxFlowPushRelabel(Many to Many)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_maxFlowEdmondsKarp(one to one)" -msgstr "" +#, fuzzy +msgid "pgr_maxFlowEdmondsKarp(One to One)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_maxFlowEdmondsKarp(one to many)" -msgstr "" +#, fuzzy +msgid "pgr_maxFlowEdmondsKarp(One to Many)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_maxFlowEdmondsKarp(many to one)" -msgstr "" +#, fuzzy +msgid "pgr_maxFlowEdmondsKarp(Many to One)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_maxFlowEdmondsKarp(many to many)" -msgstr "" +#, fuzzy +msgid "pgr_maxFlowEdmondsKarp(Many to Many)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_maxFlowBoykovKolmogorov (one to one)" +msgid "pgr_maxFlowBoykovKolmogorov (One to One)" msgstr "" -msgid "pgr_maxFlowBoykovKolmogorov (one to many)" +msgid "pgr_maxFlowBoykovKolmogorov (One to Many)" msgstr "" -msgid "pgr_maxFlowBoykovKolmogorov (many to one)" +msgid "pgr_maxFlowBoykovKolmogorov (Many to One)" msgstr "" -msgid "pgr_maxFlowBoykovKolmogorov (many to many)" +msgid "pgr_maxFlowBoykovKolmogorov (Many to Many)" msgstr "" msgid "pgr_maximumCardinalityMatching" @@ -17550,7 +17433,7 @@ msgstr "" msgid "pgr_tsp - use pgr_TSP or pgr_eucledianTSP instead" msgstr "" -msgid "pgr_astar - use pgr_aStar instead" +msgid "pgr_aStar - use pgr_aStar instead" msgstr "" msgid "pgr_flip_edges" @@ -17637,6 +17520,9 @@ msgstr "" msgid "Improvements" msgstr "" +msgid "pgr_nodeNetwork" +msgstr "" + msgid "Adding a row_where and outall optional parameters" msgstr "" @@ -17649,45 +17535,57 @@ msgstr "" msgid "pgr_Johnson" msgstr "" -msgid "pgr_dijkstraCost(one to one)" -msgstr "" +#, fuzzy +msgid "pgr_dijkstraCost(One to One)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_dijkstraCost(one to many)" -msgstr "" +#, fuzzy +msgid "pgr_dijkstraCost(One to Many)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_dijkstraCost(many to one)" -msgstr "" +#, fuzzy +msgid "pgr_dijkstraCost(Many to One)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_dijkstraCost(many to many)" -msgstr "" +#, fuzzy +msgid "pgr_dijkstraCost(Many to Many)" +msgstr ":doc:`pgr_kruskalBFS`" #, fuzzy msgid "Proposed Functionality" msgstr "次期リリース予定の機能。" -msgid "pgr_withPoints(one to one)" -msgstr "" +#, fuzzy +msgid "pgr_withPoints(One to One)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_withPoints(one to many)" -msgstr "" +#, fuzzy +msgid "pgr_withPoints(One to Many)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_withPoints(many to one)" -msgstr "" +#, fuzzy +msgid "pgr_withPoints(Many to One)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_withPoints(many to many)" -msgstr "" +#, fuzzy +msgid "pgr_withPoints(Many to Many)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_withPointsCost(one to one)" -msgstr "" +#, fuzzy +msgid "pgr_withPointsCost(One to One)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_withPointsCost(one to many)" -msgstr "" +#, fuzzy +msgid "pgr_withPointsCost(One to Many)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_withPointsCost(many to one)" -msgstr "" +#, fuzzy +msgid "pgr_withPointsCost(Many to One)" +msgstr ":doc:`pgr_kruskalBFS`" -msgid "pgr_withPointsCost(many to many)" -msgstr "" +#, fuzzy +msgid "pgr_withPointsCost(Many to Many)" +msgstr ":doc:`pgr_kruskalBFS`" msgid "pgr_withPointsDD(single vertex)" msgstr "" @@ -17695,9 +17593,6 @@ msgstr "" msgid "pgr_withPointsDD(multiple vertices)" msgstr "" -msgid "pgr_withPointsKSP" -msgstr "" - msgid "pgr_dijkstraVia" msgstr "" @@ -17731,26 +17626,12 @@ msgid "" "q=is%3Aissue+milestone%3A%22Release+2.1.0%22+is%3Aclosed>`_ on Github." msgstr "" -msgid "pgr_dijkstra(one to many)" -msgstr "" - -msgid "pgr_dijkstra(many to one)" -msgstr "" - -msgid "pgr_dijkstra(many to many)" -msgstr "" - -msgid "pgr_drivingDistance(multiple vertices)" -msgstr "" - msgid "Refactored" msgstr "" -msgid "pgr_dijkstra(one to one)" -msgstr "" - -msgid "pgr_drivingDistance(single vertex)" -msgstr "" +#, fuzzy +msgid "pgr_dijkstra(One to One)" +msgstr ":doc:`pgr_kruskalBFS`" msgid "" "pgr_alphaShape function now can generate better (multi)polygon with holes " @@ -18459,8 +18340,8 @@ msgid "" msgstr "" msgid "" -"pgRouting suplies some functions to create a routing topology and to analyze " -"the topology." +"pgRouting supplies some functions to create a routing topology and to " +"analyze the topology." msgstr "" msgid "Additional functions to create a graph:" @@ -18872,3 +18753,95 @@ msgid "pgr_withPointsvia is pgr_dijkstraVia **with points**" msgstr "" #, fuzzy +#~ msgid "pgr_aStarCostMatrix(One to Many)" +#~ msgstr ":doc:`pgr_kruskalBFS`" + +#, fuzzy +#~ msgid "pgr_aStarCostMatrix(Many to One)" +#~ msgstr ":doc:`pgr_kruskalBFS`" + +#, fuzzy +#~ msgid "pgr_aStarCostMatrix(Many to Many)" +#~ msgstr ":doc:`pgr_kruskalBFS`" + +#, fuzzy +#~ msgid "pgr_bdAstarCostMatrix(One to One)" +#~ msgstr ":doc:`pgr_kruskalBFS`" + +#, fuzzy +#~ msgid "pgr_bdAstarCostMatrix(One to Many)" +#~ msgstr ":doc:`pgr_kruskalBFS`" + +#, fuzzy +#~ msgid "pgr_bdAstarCostMatrix(Many to One)" +#~ msgstr ":doc:`pgr_kruskalBFS`" + +#, fuzzy +#~ msgid "pgr_bdAstarCostMatrix(Many to Many)" +#~ msgstr ":doc:`pgr_kruskalBFS`" + +#, fuzzy +#~ msgid "pgr_bdDijkstraCostMatrix(One to One)" +#~ msgstr ":doc:`pgr_kruskalBFS`" + +#, fuzzy +#~ msgid "pgr_bdDijkstraCostMatrix(One to Many)" +#~ msgstr ":doc:`pgr_kruskalBFS`" + +#, fuzzy +#~ msgid "pgr_bdDijkstraCostMatrix(Many to One)" +#~ msgstr ":doc:`pgr_kruskalBFS`" + +#, fuzzy +#~ msgid "pgr_bdDijkstraCostMatrix(Many to Many)" +#~ msgstr ":doc:`pgr_kruskalBFS`" + +#, fuzzy +#~ msgid "pgr_astar(One to Many)" +#~ msgstr ":doc:`pgr_kruskalBFS`" + +#, fuzzy +#~ msgid "pgr_astar(Many to One)" +#~ msgstr ":doc:`pgr_kruskalBFS`" + +#, fuzzy +#~ msgid "pgr_astar(Many to Many)" +#~ msgstr ":doc:`pgr_kruskalBFS`" + +#, fuzzy +#~ msgid "pgr_astarCost(One to One)" +#~ msgstr ":doc:`pgr_kruskalBFS`" + +#, fuzzy +#~ msgid "pgr_astarCost(One to Many)" +#~ msgstr ":doc:`pgr_kruskalBFS`" + +#, fuzzy +#~ msgid "pgr_astarCost(Many to One)" +#~ msgstr ":doc:`pgr_kruskalBFS`" + +#, fuzzy +#~ msgid "pgr_astarCost(Many to Many)" +#~ msgstr ":doc:`pgr_kruskalBFS`" + +#, fuzzy +#~ msgid "pgr_betweennessCentrality``" +#~ msgstr "p" + +#, fuzzy +#~ msgid "New Function." +#~ msgstr "新しい **公式** 機能" + +#~ msgid "The queries use the :doc:`sampledata` network." +#~ msgstr "クエリは :doc:`sampledata` ネットワークを使用します。" + +#, fuzzy +#~ msgid "See also" +#~ msgstr "参照" + +#~ msgid "New overload functions:" +#~ msgstr "新しい **公式** 機能:" + +#, fuzzy +#~ msgid "Queries use the :doc:`sampledata` network." +#~ msgstr "クエリは :doc:`sampledata` ネットワークを使用します。" diff --git a/locale/ko/LC_MESSAGES/pgrouting_doc_strings.po b/locale/ko/LC_MESSAGES/pgrouting_doc_strings.po index 7b1be9415a0..70f27ad615d 100644 --- a/locale/ko/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/ko/LC_MESSAGES/pgrouting_doc_strings.po @@ -7,7 +7,7 @@ msgid "" msgstr "" "Project-Id-Version: pgRouting v4.0\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2025-01-10 14:53+0000\n" +"POT-Creation-Date: 2025-02-12 01:00+0000\n" "PO-Revision-Date: 2022-12-13 12:30+0000\n" "Last-Translator: Hyung-Gyu Ryoo \n" "Language-Team: Korean `__" +"`Boost: metric TSP approx `__" msgstr "" msgid "`University of Waterloo TSP `__" @@ -1618,8 +1618,8 @@ msgstr "" msgid "https://en.wikipedia.org/wiki/Vehicle_routing_problem" msgstr "" -msgid "The queries use the :doc:`sampledata` network." -msgstr "" +msgid ":doc:`sampledata`" +msgstr ":doc:`sampledata`" msgid "A* - Family of functions" msgstr "" @@ -1780,7 +1780,8 @@ msgstr "" msgid ":doc:`bdAstar-family`" msgstr ":doc:`bdAstar-family`" -msgid "https://www.boost.org/libs/graph/doc/astar_search.html" +msgid "" +"`Boost: A* search `__" msgstr "" msgid "https://en.wikipedia.org/wiki/A*_search_algorithm" @@ -2587,7 +2588,7 @@ msgid "" "ending vertex:" msgstr "" -msgid "It is expected to terminate faster than pgr_astar" +msgid "It is expected to terminate faster than pgr_aStar" msgstr "" msgid ":doc:`aStar-family`" @@ -2739,27 +2740,7 @@ msgid "Identifier of the color of the edge." msgstr "" msgid "" -"`Boost: Sequential Vertex Coloring algorithm documentation `__" -msgstr "" - -msgid "" -"`Wikipedia: Graph coloring `__" -msgstr "" - -msgid "" -"`Boost: is_bipartite `__" -msgstr "" - -msgid "" -"`Wikipedia: bipartite graph `__" -msgstr "" - -msgid "" -"`Boost: Edge Coloring Algorithm documentation `__" +"`Boost: `__" msgstr "" msgid "Components - Family of functions" @@ -3307,9 +3288,6 @@ msgstr "" msgid "Now, the routing graph has an edge connecting with node :math:`7`." msgstr "" -msgid ":doc:`sampledata`" -msgstr ":doc:`sampledata`" - msgid "" "https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/" "lecture16.pdf" @@ -4404,31 +4382,190 @@ msgstr ":doc:`release_notes`" msgid "pgRouting 4.0.0 Release Notes" msgstr "" -msgid "Removal of deprecated functions and signatures" +msgid "" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 4.0.0 `__" +msgstr "" + +msgid "Functions promoted to official" +msgstr "" + +#, fuzzy +msgid "pgr_trsp" +msgstr ":doc:`pgr_trsp`" + +#, fuzzy +msgid "pgr_trspVia" +msgstr ":doc:`pgr_trspVia`" + +#, fuzzy +msgid "pgr_trspVia_withPoints" +msgstr ":doc:`pgr_trspVia_withPoints`" + +#, fuzzy +msgid "pgr_trsp_withPoints" +msgstr ":doc:`pgr_trspVia_withPoints`" + +#, fuzzy +msgid "pgr_withPoints" +msgstr ":doc:`pgr_withPoints`" + +#, fuzzy +msgid "pgr_withPointsCost" +msgstr ":doc:`pgr_withPointsCost`" + +msgid "pgr_withPointsCostMatrix" +msgstr "" + +#, fuzzy +msgid "pgr_withPointsDD" +msgstr ":doc:`pgr_withPoints`" + +msgid "pgr_withPointsKSP" +msgstr "" + +#, fuzzy +msgid "pgr_withPointsVia" +msgstr ":doc:`pgr_withPointsVia`" + +msgid "Signatures promoted to official" +msgstr "" + +msgid "pgr_aStar(Combinations)" +msgstr "" + +msgid "pgr_aStarCost(Combinations)" +msgstr "" + +msgid "pgr_bdAstar(Combinations)" +msgstr "" + +msgid "pgr_bdAstarCost(Combinations)" +msgstr "" + +msgid "pgr_bdDijkstra(Combinations)" +msgstr "" + +msgid "pgr_bdDijkstraCost(Combinations)" +msgstr "" + +#, fuzzy +msgid "pgr_dijkstra(Combinations)" +msgstr ":doc:`pgr_withPointsCostMatrix`" + +#, fuzzy +msgid "pgr_dijkstraCost(Combinations)" +msgstr ":doc:`pgr_withPointsCostMatrix`" + +msgid "pgr_KSP(All signatures)" +msgstr "" + +msgid "pgr_boykovKolmogorov(Combinations)" +msgstr "" + +msgid "pgr_edmondsKarp(Combinations)" +msgstr "" + +msgid "pgr_maxFlow(Combinations)" +msgstr "" + +msgid "pgr_pushRelabel(Combinations)" +msgstr "" + +msgid "code enhancements:" +msgstr "" + +msgid "Removal of unused C/C++ code" +msgstr "" + +msgid "Removal of SQL deprecated functions" msgstr "" msgid "" -"``pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)``" +"pgr_trsp(text,integer,double precision,integer,double precision,boolean," +"boolean,text)" msgstr "" -msgid "``pgr_trspviavertices(text,anyarray,boolean,boolean,text)``" +msgid "pgr_trsp(text,integer,integer,boolean,boolean,text)" msgstr "" msgid "" -"``pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean,text)``" +"pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" msgstr "" -msgid "``pgr_trsp(text,integer,integer,boolean,boolean,text)``" +msgid "pgr_trspviavertices(text,anyarray,boolean,boolean,text)" msgstr "" -msgid "All releases" +msgid "Removal of SQL deprecated internal functions" msgstr "" -msgid "Kruskal - Family of functions" +msgid "_pgr_dijkstranear(text,anyarray,anyarray,bigint,boolean)" msgstr "" -msgid "Boost Graph Inside" +msgid "_pgr_dijkstranear(text,anyarray,bigint,bigint,boolean)" +msgstr "" + +msgid "_pgr_dijkstranear(text,bigint,anyarray,bigint,boolean)" +msgstr "" + +msgid "_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" +msgstr "" + +msgid "_pgr_dijkstra(text,text,boolean,boolean,boolean)" +msgstr "" + +msgid "_pgr_drivingdistance(text,anyarray,double precision,boolean,boolean)" +msgstr "" + +msgid "_pgr_kruskal(text,anyarray,text,bigint,double precision)" +msgstr "" + +msgid "_pgr_prim(text,anyarray,text,bigint,double precision)" +msgstr "" + +msgid "" +"_pgr_trsp(text,integer,double precision,integer,double precision,boolean," +"boolean,text)" +msgstr "" + +msgid "_pgr_trsp(text,text,anyarray,anyarray,boolean)" +msgstr "" + +msgid "_pgr_trsp(text,text,anyarray,bigint,boolean)" +msgstr "" + +msgid "_pgr_trsp(text,text,bigint,anyarray,boolean)" +msgstr "" + +msgid "_pgr_trsp(text,text,bigint,bigint,boolean)" +msgstr "" + +msgid "_pgr_trspviavertices(text,integer[],boolean,boolean,text)" +msgstr "" + +msgid "_pgr_withpointsvia(text,bigint[],double precision[],boolean)" +msgstr "" + +msgid "_trsp(text,text,anyarray,anyarray,boolean)" +msgstr "" + +msgid "_v4trsp(text,text,anyarray,anyarray,boolean)" +msgstr "" + +msgid "_v4trsp(text,text,text,boolean)" +msgstr "" + +msgid "Deprecation of internal C/C++ functions" +msgstr "" + +msgid "Internal C/C++ functions in legacy" +msgstr "" + +msgid "All releases" +msgstr "" + +msgid "Kruskal - Family of functions" msgstr "" msgid "" @@ -4617,7 +4754,7 @@ msgid "If needed add the new columns, for example:" msgstr "" #, fuzzy -msgid "Migration of ``pgr_drivingdistance``" +msgid "Migration of ``pgr_drivingDistance``" msgstr ":doc:`pgr_withPoints`" msgid "" @@ -4638,11 +4775,12 @@ msgid "|result-spantree|" msgstr "" #, fuzzy -msgid "``pgr_drivingdistance`` (Single vertex)" +msgid "pgr_drivingDistance(Single vertex)" msgstr ":doc:`pgr_drivingDistance`" -msgid "``pgr_drivingdistance`` (Multiple vertices)" -msgstr "" +#, fuzzy +msgid "pgr_drivingDistance(Multiple vertices)" +msgstr ":doc:`pgr_drivingDistance`" msgid "Output columns were |result-dij-dd|" msgstr "" @@ -5095,9 +5233,6 @@ msgstr "" msgid "`v4.0.0 `__" msgstr "" -msgid "See also" -msgstr "" - #, fuzzy msgid ":doc:`pgr_dijkstra`" msgstr ":doc:`pgr_dijkstraVia`" @@ -5144,7 +5279,7 @@ msgid "Use ``pgr_withPoints`` when there are no restrictions." msgstr "" #, fuzzy -msgid "Use :doc:`pgr_withPoints` (Ont to One) instead." +msgid "Use :doc:`pgr_withPoints` (One to One) instead." msgstr ":doc:`pgr_withPointsCostMatrix`" msgid "Use ``pgr_trsp_withPoints`` when there are restrictions." @@ -7311,8 +7446,9 @@ msgstr "" msgid ":doc:`migration`" msgstr ":doc:`migration`" -msgid "pgr_KSP" -msgstr "" +#, fuzzy +msgid "``pgr_KSP``" +msgstr ":doc:`pgr_withPoints`" msgid "``pgr_KSP`` — Yen's algorithm for K shortest paths using Dijkstra." msgstr "" @@ -7320,6 +7456,12 @@ msgstr "" msgid "Availability" msgstr "" +msgid "Version 4.0.0" +msgstr "" + +msgid "All signatures promoted to official." +msgstr "" + msgid "Version 3.6.0" msgstr "" @@ -7327,29 +7469,29 @@ msgid "Result columns standarized to: |nksp-result|" msgstr "" #, fuzzy -msgid "``pgr_ksp`` (One to One)" +msgid "pgr_ksp(One to One)" msgstr ":doc:`pgr_withPointsCostMatrix`" msgid "Added ``start_vid`` and ``end_vid`` result columns." msgstr "" -msgid "New overload functions:" +msgid "New proposed signatures:" msgstr "" #, fuzzy -msgid "``pgr_ksp`` (One to Many)" +msgid "pgr_ksp(One to Many)" msgstr ":doc:`pgr_withPointsCostMatrix`" #, fuzzy -msgid "``pgr_ksp`` (Many to One)" +msgid "pgr_ksp(Many to One)" msgstr ":doc:`pgr_withPointsCostMatrix`" #, fuzzy -msgid "``pgr_ksp`` (Many to Many)" +msgid "pgr_ksp(Many to Many)" msgstr ":doc:`pgr_withPointsCostMatrix`" #, fuzzy -msgid "``pgr_ksp`` (Combinations)" +msgid "pgr_ksp(Combinations)" msgstr ":doc:`pgr_withPointsCostMatrix`" msgid "Version 2.1.0" @@ -7364,7 +7506,7 @@ msgstr "" msgid "Version 2.0.0" msgstr "" -msgid "**Official** function" +msgid "Official function." msgstr "" msgid "" @@ -7372,6 +7514,12 @@ msgid "" "number of shortest paths desired." msgstr "" +msgid "|Boost| Boost Graph Inside" +msgstr "" + +msgid "Boost Graph Inside" +msgstr "" + msgid "Signatures" msgstr "" @@ -7716,6 +7864,11 @@ msgstr "" msgid "``pgr_TSPeuclidean`` - Aproximation using *metric* algorithm." msgstr "" +msgid "" +"Using `Boost: metric TSP approx `__" +msgstr "" + msgid "" "The Simulated Annealing Algorithm related parameters are ignored: " "`max_processing_time`, `tries_per_temperature`, " @@ -7729,7 +7882,7 @@ msgstr "" msgid "Name change from pgr_eucledianTSP" msgstr "" -msgid "New **Official** function" +msgid "New official function." msgstr "" msgid "" @@ -7810,57 +7963,54 @@ msgid "" "obtained with ``pgr_TSPeuclidean``." msgstr "" -msgid ":doc:`sampledata` network." -msgstr "" - msgid "``pgr_aStar``" msgstr "" msgid "``pgr_aStar`` — Shortest path using the A* algorithm." msgstr "" +msgid "Combinations signature promoted to official." +msgstr "" + msgid "Standarizing output columns to |short-generic-result|" msgstr "" -msgid "" -"``pgr_aStar`` (`One to One`_) added ``start_vid`` and ``end_vid`` columns." +msgid "pgr_aStar(One to One) added ``start_vid`` and ``end_vid`` columns." msgstr "" -msgid "``pgr_aStar`` (`One to Many`_) added ``end_vid`` column." +msgid "pgr_aStar(One to Many) added ``end_vid`` column." msgstr "" -msgid "``pgr_aStar`` (`Many to One`_) added ``start_vid`` column." +msgid "pgr_aStar(Many to One) added ``start_vid`` column." msgstr "" msgid "Version 3.2.0" msgstr "" -msgid "New **proposed** signature:" +msgid "New proposed signature:" msgstr "" -msgid "``pgr_aStar`` (`Combinations`_)" +msgid "Function promoted to official." msgstr "" msgid "Version 2.4.0" msgstr "" -msgid "New **Proposed** signatures:" -msgstr "" - -msgid "``pgr_aStar`` (`One to Many`_)" -msgstr "" - -msgid "``pgr_aStar`` (`Many to One`_)" -msgstr "" +#, fuzzy +msgid "pgr_aStar(One to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "``pgr_aStar`` (`Many to Many`_)" -msgstr "" +#, fuzzy +msgid "pgr_aStar(Many to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "Signature change on ``pgr_astar`` (`One to One`_)" -msgstr "" +#, fuzzy +msgid "pgr_aStar(Many to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "**Official** ``pgr_aStar`` (`One to One`_)" -msgstr "" +#, fuzzy +msgid "Signature change on pgr_aStar(One to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" msgid "" "The results are equivalent to the union of the results of the `pgr_aStar(` " @@ -7933,19 +8083,18 @@ msgstr "" msgid "Manually assigned vertex combinations." msgstr "" -msgid "pgr_aStarCost" -msgstr "" +#, fuzzy +msgid "``pgr_aStarCost``" +msgstr ":doc:`pgr_aStarCost`" #, fuzzy msgid "" "``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." msgstr ":doc:`pgr_aStarCost` - 최단 경로의 집계 비용 반환." -msgid "``pgr_aStarCost`` (`Combinations`_)" -msgstr "" - -msgid "New **proposed** function" -msgstr "" +#, fuzzy +msgid "New proposed function." +msgstr ":doc:`routingFunctions`" #, fuzzy msgid "" @@ -8140,8 +8289,9 @@ msgstr ":doc:`pgr_drivingDistance`" msgid "`ST_ConcaveHull `__" msgstr "" -msgid "pgr_analyzeGraph" -msgstr "" +#, fuzzy +msgid "``pgr_analyzeGraph``" +msgstr ":doc:`pgr_analyzeGraph`" msgid "``pgr_analyzeGraph`` — Analyzes the network topology." msgstr "" @@ -8402,9 +8552,6 @@ msgid "" "table ``othertable``. (note the use of quote_literal)" msgstr "" -msgid "The examples use the :doc:`sampledata` network." -msgstr "" - msgid ":doc:`pgr_analyzeOneWay`" msgstr ":doc:`pgr_analyzeOneWay`" @@ -8414,8 +8561,9 @@ msgstr ":doc:`pgr_createVerticesTable`" msgid ":doc:`pgr_nodeNetwork` to create nodes to a not noded edge table." msgstr "" -msgid "pgr_analyzeOneWay" -msgstr "" +#, fuzzy +msgid "``pgr_analyzeOneWay``" +msgstr ":doc:`pgr_analyzeOneWay`" msgid "" "``pgr_analyzeOneWay`` — Analyzes oneway Sstreets and identifies flipped " @@ -8566,7 +8714,7 @@ msgstr "" msgid "Version 2.5.0" msgstr "" -msgid "New **experimental** function" +msgid "New experimental function." msgstr "" msgid "" @@ -8598,7 +8746,7 @@ msgid "Nodes in red are the articulation points." msgstr "" msgid "" -"Boost: `Biconnected components & articulation points `__" msgstr "" @@ -8613,37 +8761,33 @@ msgstr "" msgid "``pgr_bdAstar`` — Shortest path using the bidirectional A* algorithm." msgstr "" -msgid "" -"``pgr_bdAstar`` (`One to One`_) added ``start_vid`` and ``end_vid`` columns." -msgstr "" - -msgid "``pgr_bdAstar`` (`One to Many`_) added ``end_vid`` column." -msgstr "" - -msgid "``pgr_bdAstar`` (`Many to One`_) added ``start_vid`` column." +msgid "pgr_bdAstar(One to One) added ``start_vid`` and ``end_vid`` columns." msgstr "" -msgid "``pgr_bdAstar`` (`Combinations`_)" +msgid "pgr_bdAstar(One to Many) added ``end_vid`` column." msgstr "" -msgid "``pgr_bdAstar`` (`One to Many`_)" +msgid "pgr_bdAstar(Many to One) added ``start_vid`` column." msgstr "" -msgid "``pgr_bdAstar`` (`Many to One`_)" -msgstr "" +#, fuzzy +msgid "pgr_bdAstar(One to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "``pgr_bdAstar`` (`Many to Many`_)" -msgstr "" +#, fuzzy +msgid "pgr_bdAstar(Many to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "Signature change on ``pgr_bdAstar`` (`One to One`_)" -msgstr "" +#, fuzzy +msgid "pgr_bdAstar(Many to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "**Official** ``pgr_bdAstar`` (`One to One`_)" +msgid "Signature change on pgr_bdAstar(One to One)" msgstr "" msgid "" -"The results are equivalent to the union of the results of the `pgr_bdAStar(` " -"`One to One`_ `)` on the:" +"The results are equivalent to the union of the results of the " +"pgr_bdAStar(One to One) on the:" msgstr "" msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" @@ -8661,17 +8805,15 @@ msgstr "" msgid "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" -msgid "pgr_bdAstarCost" -msgstr "" +#, fuzzy +msgid "``pgr_bdAstarCost``" +msgstr ":doc:`pgr_bdAstarCost`" 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 sumarizes of the cost of the shortest path " "using the bidirectional A* algorithm." @@ -8719,25 +8861,19 @@ msgid "" "algorithm." msgstr ":doc:`pgr_bdDijkstra` - 최단 경로를 위한 양방향 다익스트라 알고리즘." -msgid "pgr_bdDijkstra(`Combinations`_)" -msgstr "" - -msgid "New **Proposed** functions:" -msgstr "" - -msgid "``pgr_bdDijkstra`` (`One to Many`_)" -msgstr "" - -msgid "``pgr_bdDijkstra`` (`Many to One`_)" -msgstr "" +#, fuzzy +msgid "pgr_bdDijkstra(One to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "``pgr_bdDijkstra`` (`Many to Many`_)" -msgstr "" +#, fuzzy +msgid "pgr_bdDijkstra(Many to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "Signature change on ``pgr_bdDijsktra`` (`One to One`_)" -msgstr "" +#, fuzzy +msgid "pgr_bdDijkstra(Many to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "**Official** ``pgr_bdDijkstra`` (`One to One`_)" +msgid "Signature change on pgr_bdDijsktra(One to One)" msgstr "" msgid "" @@ -8791,11 +8927,6 @@ msgstr "" msgid "Using a combinations table on an **undirected** graph" msgstr "" -msgid "" -"https://www.cs.princeton.edu/courses/archive/spr06/cos423/Handouts/" -"EPP%20shortest%20path%20algorithms.pdf" -msgstr "" - msgid "https://en.wikipedia.org/wiki/Bidirectional_search" msgstr "" @@ -8807,9 +8938,6 @@ msgid "" "Bidirectional Dijkstra algorithm." msgstr "" -msgid "``pgr_bdDijkstraCost`` (`Combinations`_)" -msgstr "" - msgid "" "The ``pgr_bdDijkstraCost`` function sumarizes of the cost of the shortest " "path using the bidirectional Dijkstra Algorithm." @@ -8868,25 +8996,10 @@ msgstr "" msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm." msgstr "" -msgid "New **experimental** signature:" -msgstr "" - -msgid "``pgr_bellmanFord`` (`Combinations`_)" -msgstr "" - -msgid "New **experimental** signatures:" +msgid "New experimental signature:" msgstr "" -msgid "``pgr_bellmanFord`` (`One to One`_)" -msgstr "" - -msgid "``pgr_bellmanFord`` (`One to Many`_)" -msgstr "" - -msgid "``pgr_bellmanFord`` (`Many to One`_)" -msgstr "" - -msgid "``pgr_bellmanFord`` (`Many to Many`_)" +msgid "pgr_bellmanFord(Combinations)" msgstr "" msgid "" @@ -8961,23 +9074,25 @@ msgstr "" msgid "Using a combinations table on an **undirected** graph." msgstr "" +msgid "" +"`Boost: Bellman Ford `__" +msgstr "" + msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" msgstr "" -msgid "``pgr_betweennessCentrality``" +msgid "``pgr_betweennessCentrality`` - Experimental" msgstr "" msgid "" -"``pgr_betweennessCentrality`` - Calculates the relative betweeness " +"``pgr_betweennessCentrality`` - Calculates the relative betweenness " "centrality using Brandes Algorithm" msgstr "" msgid "Version 3.7.0" msgstr "" -msgid "New **experimental** function:" -msgstr "" - msgid "" "The Brandes Algorithm takes advantage of the sparse graphs for evaluating " "the betweenness centrality score of all vertices." @@ -9048,11 +9163,8 @@ msgid "" msgstr "" msgid "" -"Boost's `betweenness_centrality `_" -msgstr "" - -msgid "Queries use the :doc:`sampledata` network." +"`Boost: betweenness centrality `_" msgstr "" msgid "``pgr_biconnectedComponents``" @@ -9112,11 +9224,6 @@ msgstr "" msgid "Identifier of the edge that belongs to the ``component``." msgstr "" -msgid "" -"Boost: `Biconnected components `__" -msgstr "" - msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" msgstr "" @@ -9130,19 +9237,7 @@ msgid "" "negative integer, is termed as a 'binary graph'." msgstr "" -msgid "pgr_binaryBreadthFirstSearch(`Combinations`_)" -msgstr "" - -msgid "pgr_binaryBreadthFirstSearch(`One to One`_)" -msgstr "" - -msgid "pgr_binaryBreadthFirstSearch(`One to Many`_)" -msgstr "" - -msgid "pgr_binaryBreadthFirstSearch(`Many to One`_)" -msgstr "" - -msgid "pgr_binaryBreadthFirstSearch(`Many to Many`_)" +msgid "pgr_binaryBreadthFirstSearch(Combinations)" msgstr "" msgid "" @@ -9204,6 +9299,11 @@ msgid "" "math:`1``)" msgstr "" +msgid "" +"`Boost: Breadth First Search `__" +msgstr "" + msgid "https://cp-algorithms.com/graph/01_bfs.html" msgstr "" @@ -9211,7 +9311,7 @@ msgid "" "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" msgstr "" -msgid "pgr_bipartite -Experimental" +msgid "``pgr_bipartite`` - Experimental" msgstr "" msgid "" @@ -9219,9 +9319,6 @@ msgid "" "within the same set are adjacent." msgstr "" -msgid "New **experimental** signature" -msgstr "" - msgid "" "A bipartite graph is a graph with two sets of vertices which are connected " "to each other, but not within themselves. A bipartite graph is possible if " @@ -9268,28 +9365,29 @@ msgstr "" msgid "Edges in blue represent odd length cycle subgraph." msgstr "" -msgid "``pgr_boykovKolmogorov``" +msgid "" +"`Boost: is_bipartite `__" 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." +"`Wikipedia: bipartite graph `__" msgstr "" -msgid "New **proposed** signature" +msgid "``pgr_boykovKolmogorov``" msgstr "" -msgid "``pgr_boykovKolmogorov`` (`Combinations`_)" +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 "Renamed from ``pgr_maxFlowBoykovKolmogorov``" msgstr "" -msgid "**Proposed** function" -msgstr "" - -msgid "New **Experimental** function" +msgid "Function promoted to proposed." msgstr "" msgid "Running time: Polynomial" @@ -9331,7 +9429,9 @@ msgid "" "math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`." msgstr "" -msgid "https://www.boost.org/libs/graph/doc/boykov_kolmogorov_max_flow.html" +msgid "" +"`Boost: Boykov Kolmogorov max flow `__" msgstr "" msgid "``pgr_breadthFirstSearch`` - Experimental" @@ -9342,12 +9442,6 @@ msgid "" "First Search algorithm." msgstr "" -msgid "``pgr_breadthFirstSearch`` (`Single Vertex`_)" -msgstr "" - -msgid "``pgr_breadthFirstSearch`` (`Multiple Vertices`_)" -msgstr "" - msgid "" "Provides the Breadth First Search traversal order from a root vertex to a " "particular depth." @@ -9412,11 +9506,6 @@ msgstr "" msgid "descending" msgstr "" -msgid "" -"`Boost: Breadth First Search algorithm documentation `__" -msgstr "" - msgid "" "`Wikipedia: Breadth First Search algorithm `__" @@ -9455,9 +9544,10 @@ msgstr "" msgid "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" msgstr "" -#, fuzzy -msgid "**Supported versions**" -msgstr "짧은 버전" +msgid "" +"`Boost: Connected components `__" +msgstr "" msgid "``pgr_chinesePostman`` - Experimental" msgstr "" @@ -9514,7 +9604,7 @@ msgstr "" msgid "Minimum costs of a circuit path." msgstr "" -msgid "pgr_connectedComponents" +msgid "``pgr_connectedComponents``" msgstr "" msgid "" @@ -9551,11 +9641,6 @@ msgstr "" msgid "Connecting disconnected components" msgstr "" -msgid "" -"Boost: `Connected components `__" -msgstr "" - msgid "" "wikipedia: `Connected component `__" @@ -9730,7 +9815,7 @@ msgstr "" msgid "Only linear contraction" msgstr "" -msgid "pgr_createTopology" +msgid "``pgr_createTopology``" msgstr "" msgid "" @@ -9933,11 +10018,9 @@ msgid "" "to the rest of the edges." msgstr "" -msgid "The example uses the :doc:`sampledata` network." -msgstr "" - -msgid "pgr_createVerticesTable" -msgstr "" +#, fuzzy +msgid "``pgr_createVerticesTable``" +msgstr ":doc:`pgr_createVerticesTable`" msgid "" "``pgr_createVerticesTable`` — Reconstructs the vertices table based on the " @@ -10152,8 +10235,9 @@ msgid "" "Cuthill%E2%80%93McKee_algorithm>`__" msgstr "" -msgid "pgr_dagShortestPath - Experimental" -msgstr "" +#, fuzzy +msgid "``pgr_dagShortestPath`` - Experimental" +msgstr ":doc:`pgr_dagShortestPath`" msgid "" "``pgr_dagShortestPath`` — Returns the shortest path for weighted directed " @@ -10232,6 +10316,11 @@ msgstr "결과 컬럼" msgid "Making **start_vids** the same as **end_vids**" msgstr "" +msgid "" +"`Boost: DAG shortest paths `__" +msgstr "" + msgid "https://en.wikipedia.org/wiki/Topological_sorting" msgstr "" @@ -10350,15 +10439,6 @@ msgstr "" msgid "Version 3.3.0" msgstr "" -msgid "Promoted to **proposed** function" -msgstr "" - -msgid "``pgr_depthFirstSearch`` (`Single Vertex`_)" -msgstr "" - -msgid "``pgr_depthFirstSearch`` (`Multiple Vertices`_)" -msgstr "" - msgid "" "Depth First Search algorithm is a traversal algorithm which starts from a " "root vertex, goes as deep as possible, and backtracks once a vertex is " @@ -10412,13 +10492,13 @@ msgid "Same as `Single vertex`_ but with edges in descending order of ``id``." msgstr "" msgid "" -"`Boost: Depth First Search algorithm documentation `__" +"`Boost: Depth First Search `__" msgstr "" msgid "" -"`Boost: Undirected DFS algorithm documentation `__" +"`Boost: Undirected DFS `__" msgstr "" msgid "" @@ -10435,44 +10515,34 @@ msgstr "" msgid "Version 3.5.0" msgstr "" -msgid "" -"``pgr_dijkstra`` (`One to One`_) added ``start_vid`` and ``end_vid`` columns." +msgid "pgr_dijkstra(One to One) added ``start_vid`` and ``end_vid`` columns." msgstr "" -msgid "``pgr_dijkstra`` (`One to Many`_) added ``end_vid`` column." +msgid "pgr_dijkstra(One to Many) added ``end_vid`` column." msgstr "" -msgid "``pgr_dijkstra`` (`Many to One`_) added ``start_vid`` column." +msgid "pgr_dijkstra(Many to One) added ``start_vid`` column." msgstr "" msgid "Version 3.1.0" msgstr "" -msgid "``pgr_dijkstra`` (`Combinations`_)" -msgstr "" - -msgid "**Official** functions" -msgstr "" - msgid "Version 2.2.0" msgstr "" -msgid "New **proposed** functions:" -msgstr "" - -msgid "``pgr_dijkstra`` (`One to Many`_)" -msgstr "" - -msgid "``pgr_dijkstra`` (`Many to One`_)" -msgstr "" +#, fuzzy +msgid "pgr_dijkstra(One to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "``pgr_dijkstra`` (`Many to Many`_)" -msgstr "" +#, fuzzy +msgid "pgr_dijkstra(Many to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "Signature change on ``pgr_dijkstra`` (`One to One`_)" -msgstr "" +#, fuzzy +msgid "pgr_dijkstra(Many to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "**Official** ``pgr_dijkstra`` (`One to One`_)" +msgid "Signature change on pgr_dijkstra(One to One)" msgstr "" msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" @@ -10658,6 +10728,11 @@ msgstr "" msgid "37) Using `Combinations`_" msgstr "" +msgid "" +"`Boost: Dijkstra shortest paths `__" +msgstr "" + msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgstr "" @@ -10670,9 +10745,6 @@ msgid "" "algorithm." msgstr ":doc:`pgr_aStarCost` - 최단 경로의 집계 비용 반환." -msgid "``pgr_dijkstraCost`` (`Combinations`_)" -msgstr "" - #, fuzzy msgid "" "The ``pgr_dijkstraCost`` function sumarizes of the cost of the shortest path " @@ -10961,9 +11033,6 @@ msgstr "" msgid "When ``false``: ``cap`` limit per ``Start vid`` will be returned" msgstr "" -msgid "boost: https://www.boost.org/libs/graph/doc/table_of_contents.html" -msgstr "" - msgid "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgstr "" @@ -11142,13 +11211,16 @@ msgstr "" msgid "Added ``depth`` and ``pred`` result columns." msgstr "" -msgid "Signature change pgr_drivingDistance(single vertex)" +msgid "Signature change:" +msgstr "" + +msgid "pgr_drivingDistance(single vertex)" msgstr "" -msgid "New **Official** pgr_drivingDistance(multiple vertices)" +msgid "New official signature:" msgstr "" -msgid "Official:: pgr_drivingDistance(single vertex)" +msgid "pgr_drivingDistance(multiple vertices)" msgstr "" msgid "" @@ -11203,7 +11275,7 @@ msgid "" "undirected graph" msgstr "" -msgid "pgr_edgeColoring - Experimental" +msgid "``pgr_edgeColoring`` - Experimental" msgstr "" msgid "" @@ -11277,6 +11349,15 @@ msgstr "" msgid "Graph coloring of pgRouting :doc:`sampledata`" msgstr "" +msgid "" +"`Boost: Edge Coloring `__" +msgstr "" + +msgid "" +"`Wikipedia: Graph coloring `__" +msgstr "" + msgid "``pgr_edgeDisjointPaths``" msgstr "" @@ -11285,9 +11366,6 @@ msgid "" "groups of vertices." msgstr "" -msgid "New **proposed** function:" -msgstr "" - msgid "pgr_edgeDisjointPaths(Combinations)" msgstr "" @@ -11369,9 +11447,6 @@ msgid "" "the flow from the sources to the targets using Edmonds Karp Algorithm." msgstr "" -msgid "``pgr_edmondsKarp`` (`Combinations`_)" -msgstr "" - msgid "Renamed from ``pgr_maxFlowEdmondsKarp``" msgstr "" @@ -11393,32 +11468,23 @@ msgstr "" msgid "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -msgid "https://www.boost.org/libs/graph/doc/edmonds_karp_max_flow.html" +msgid "" +"`Boost: Edmonds Karp max flow `__" msgstr "" msgid "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" msgstr "" -msgid "``pgr_edwardMoore - Experimental``" -msgstr "" +#, fuzzy +msgid "``pgr_edwardMoore`` - Experimental" +msgstr ":doc:`pgr_edwardMoore`" msgid "" "``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore algorithm." msgstr "" -msgid "``pgr_edwardMoore`` (`Combinations`_)" -msgstr "" - -msgid "``pgr_edwardMoore`` (`One to One`_)" -msgstr "" - -msgid "``pgr_edwardMoore`` (`One to Many`_)" -msgstr "" - -msgid "``pgr_edwardMoore`` (`Many to One`_)" -msgstr "" - -msgid "``pgr_edwardMoore`` (`Many to Many`_)" +msgid "pgr_edwardMoore(Combinations)" msgstr "" msgid "" @@ -11480,8 +11546,9 @@ msgstr "" msgid "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" msgstr "" -msgid "pgr_extractVertices -- Proposed" -msgstr "" +#, fuzzy +msgid "``pgr_extractVertices`` -- Proposed" +msgstr ":doc:`pgr_extractVertices`" msgid "``pgr_extractVertices`` — Extracts the vertices information" msgstr "" @@ -11581,21 +11648,13 @@ msgid "" "= true``." msgstr "" -msgid "``pgr_findCloseEdges``" -msgstr "" +#, fuzzy +msgid "``pgr_findCloseEdges`` - Proposed" +msgstr ":doc:`pgr_findCloseEdges`" msgid "``pgr_findCloseEdges`` - Finds the close edges to a point geometry." msgstr "" -msgid "New **proposed** signatures:" -msgstr "" - -msgid "``pgr_findCloseEdges`` (`One point`_)" -msgstr "" - -msgid "``pgr_findCloseEdges`` (`Many points`_)" -msgstr "" - msgid "" "``pgr_findCloseEdges`` - An utility function that finds the closest edge to " "a point geometry." @@ -12072,9 +12131,6 @@ msgid "" "floyd_warshall_shortest.html>`_" msgstr "" -msgid "Queries uses the :doc:`sampledata` network." -msgstr "" - msgid "``pgr_full_version``" msgstr "" @@ -12082,9 +12138,6 @@ msgid "" "``pgr_full_version`` — Get the details of pgRouting version information." msgstr "" -msgid "New **official** function" -msgstr "" - msgid "Get complete details of pgRouting version information" msgstr "" @@ -12151,17 +12204,15 @@ msgstr "" msgid "Git hash of pgRouting build" msgstr "" -msgid "``pgr_hawickCircuits - Experimental``" -msgstr "" +#, fuzzy +msgid "``pgr_hawickCircuits`` - Experimental" +msgstr ":doc:`pgr_dagShortestPath`" msgid "" "``pgr_hawickCircuits`` — Returns the list of cirucits using hawick circuits " "algorithm." msgstr "" -msgid "``pgr_hawickCircuits``" -msgstr "" - msgid "" "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. " "James. This algorithm solves the problem of detecting and enumerating " @@ -12284,7 +12335,9 @@ msgid "" "blue represent :math:`K_5` subgraph." msgstr "" -msgid "https://www.boost.org/libs/graph/doc/boyer_myrvold.html" +msgid "" +"`Boost: Boyer Myrvold `__" msgstr "" msgid "``pgr_johnson``" @@ -12417,8 +12470,9 @@ msgstr "" msgid "pgr_kruskalDFS(`Edges SQL`_, **root vids**, [``max_depth``])" msgstr "" -msgid "pgr_lengauerTarjanDominatorTree -Experimental" -msgstr "" +#, fuzzy +msgid "``pgr_lengauerTarjanDominatorTree`` - Experimental" +msgstr ":doc:`pgr_lengauerTarjanDominatorTree`" msgid "" "``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all " @@ -12475,8 +12529,8 @@ msgid "Dominator tree of another component." msgstr "" msgid "" -"`Boost: Lengauer-Tarjan dominator tree algorithm `__" +"`Boost: Lengauer-Tarjan dominator `__" msgstr "" msgid "" @@ -12484,17 +12538,15 @@ msgid "" "Dominator_(graph_theory)>`__" msgstr "" -msgid "pgr_lineGraph - Proposed" -msgstr "" +#, fuzzy +msgid "``pgr_lineGraph`` - Proposed" +msgstr ":doc:`pgr_analyzeGraph`" msgid "" "``pgr_lineGraph`` — Transforms the given graph into its corresponding edge-" "based graph." msgstr "" -msgid "Promoted to **proposed** signature." -msgstr "" - #, fuzzy msgid "Works for directed and undirected graphs." msgstr ":doc:`pgr_bridges` - 무방향 그래프의 브릿지." @@ -12760,8 +12812,7 @@ msgid "Full line graph of subgraph of edges :math:`\\{4, 7, 8, 10\\}`" msgstr "" msgid "" -"The examples of this section are based on the :doc:`sampledata` network. The " -"examples include the subgraph including edges 4, 7, 8, and 10 with " +"The examples include the subgraph including edges 4, 7, 8, and 10 with " "``reverse_cost``." msgstr "" @@ -12980,15 +13031,15 @@ msgstr "" msgid "Returns set of |result-component-make|" msgstr "" -msgid "" -"Query done on :doc:`sampledata` network gives the list of edges that are " -"needed to connect the graph." +msgid "List of edges that are needed to connect the graph." msgstr "" -msgid "https://www.boost.org/libs/graph/doc/make_connected.html" +msgid "" +"`Boost: make connected `__" msgstr "" -msgid "pgr_maxCardinalityMatch" +msgid "``pgr_maxCardinalityMatch``" msgstr "" msgid "" @@ -12996,13 +13047,16 @@ msgid "" "graph." msgstr "" +msgid "pgr_maxCardinalityMatch(text) returns only ``edge`` column." +msgstr "" + msgid "Deprecated signature" msgstr "" -msgid "``pgr_maxCardinalityMatch(text,boolean)``" +msgid "pgr_maxCardinalityMatch(text,boolean)" msgstr "" -msgid "``directed => false`` when used." +msgid "directed => ``false`` when used." msgstr "" msgid "Renamed from ``pgr_maximumCardinalityMatching``" @@ -13053,7 +13107,9 @@ msgstr "" msgid "Identifier of the edge in the original query." msgstr "" -msgid "https://www.boost.org/libs/graph/doc/maximum_matching.html" +msgid "" +"`Boost: maximum_matching `__" msgstr "" msgid "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" @@ -13070,12 +13126,6 @@ msgid "" "source(s) to the targets(s) using the Push Relabel algorithm." msgstr "" -msgid "``pgr_maxFlow`` (`Combinations`_)" -msgstr "" - -msgid "New **Proposed** function" -msgstr "" - msgid "Calculates the maximum flow from the sources to the targets." msgstr "" @@ -13110,7 +13160,9 @@ msgstr "" msgid "Maximum flow possible from the source(s) to the target(s)" msgstr "" -msgid "https://www.boost.org/libs/graph/doc/push_relabel_max_flow.html" +msgid "" +"`Boost: push relabel max flow `__" msgstr "" msgid "" @@ -13125,7 +13177,10 @@ msgid "" "of the maximum flow on a graph" msgstr "" -msgid "``pgr_maxFlowMinCost`` (`Combinations`_)" +msgid "pgr_maxFlowMinCost(Combinations)" +msgstr "" + +msgid "|boost| graph inside." msgstr "" msgid "**TODO** check which statement is true:" @@ -13169,11 +13224,6 @@ msgstr "" msgid "Returns set of |result-flow-mincost|" msgstr "" -msgid "" -"https://www.boost.org/libs/graph/doc/" -"successive_shortest_path_nonnegative_weights.html" -msgstr "" - msgid "``pgr_maxFlowMinCost_Cost`` - Experimental" msgstr "" @@ -13182,7 +13232,7 @@ msgid "" "maximum flow on a graph" msgstr "" -msgid "``pgr_maxFlowMinCost_Cost`` (`Combinations`_)" +msgid "pgr_maxFlowMinCost_Cost(Combinations)" msgstr "" msgid "**The cost value of all input edges must be nonnegative.**" @@ -13215,8 +13265,9 @@ msgstr "" msgid "Minimum Cost Maximum Flow possible from the source(s) to the target(s)" msgstr "" -msgid "pgr_nodeNetwork" -msgstr "" +#, fuzzy +msgid "``pgr_nodeNetwork``" +msgstr ":doc:`pgr_analyzeGraph`" msgid "``pgr_nodeNetwork`` - Nodes an network edge table." msgstr "" @@ -13753,9 +13804,6 @@ msgid "" "the flow from the sources to the targets using Push Relabel Algorithm." msgstr "" -msgid "``pgr_pushRelabel`` (`Combinations`_)" -msgstr "" - msgid "Renamed from ``pgr_maxFlowPushRelabel``" msgstr "" @@ -13774,7 +13822,7 @@ msgstr "" msgid "pgr_pushRelabel(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -msgid "pgr_sequentialVertexColoring - Proposed" +msgid "``pgr_sequentialVertexColoring`` - Proposed" msgstr "" msgid "" @@ -13782,9 +13830,6 @@ msgid "" "undirected graph, using greedy approach." msgstr "" -msgid "Promoted to **proposed** signature" -msgstr "" - msgid "" "Sequential vertex coloring algorithm is a graph coloring algorithm in which " "color identifiers are assigned to the vertices of a graph in a sequential " @@ -13827,9 +13872,15 @@ msgstr "" msgid "pgr_sequentialVertexColoring(`Edges SQL`_)" msgstr "" -msgid "pgr_stoerWagner - Experimental" +msgid "" +"`Boost: Sequential Vertex Coloring `__" msgstr "" +#, fuzzy +msgid "``pgr_stoerWagner`` - Experimental" +msgstr ":doc:`pgr_stoerWagner`" + msgid "``pgr_stoerWagner`` — The min-cut of graph using stoerWagner algorithm." msgstr "" @@ -13911,6 +13962,11 @@ msgstr "" msgid "Using :doc:`pgr_connectedComponents`" msgstr "" +msgid "" +"`Boost: Stoer Wagner min cut `__" +msgstr "" + msgid "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" msgstr "" @@ -13940,7 +13996,7 @@ msgid "The strong components of the graph" msgstr "" msgid "" -"Boost: `Strong components `__" msgstr "" @@ -14005,6 +14061,11 @@ msgstr "" msgid "Graph is not a DAG" msgstr "" +msgid "" +"`Boost: topological sort `__" +msgstr "" + msgid "``pgr_transitiveClosure`` - Experimental" msgstr "" @@ -14060,50 +14121,59 @@ msgstr "" msgid "Identifiers of the vertices that are reachable from vertex v." msgstr "" -msgid "https://en.wikipedia.org/wiki/Transitive_closure" +msgid "" +"`Boost: transitive closure `__" msgstr "" -msgid "pgr_trsp - Proposed" +msgid "https://en.wikipedia.org/wiki/Transitive_closure" msgstr "" -msgid "``pgr_trsp`` - routing vertices with restrictions." +msgid "``pgr_trsp``" msgstr "" -msgid "New proposed signatures" +msgid "``pgr_trsp`` - routing vertices with restrictions." msgstr "" -msgid "``pgr_trsp`` (`One to One`_)" -msgstr "" +#, fuzzy +msgid "pgr_trsp(One to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "``pgr_trsp`` (`One to Many`_)" -msgstr "" +#, fuzzy +msgid "pgr_trsp(One to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "``pgr_trsp`` (`Many to One`_)" -msgstr "" +#, fuzzy +msgid "pgr_trsp(Many to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "``pgr_trsp`` (`Many to Many`_)" -msgstr "" +#, fuzzy +msgid "pgr_trsp(Many to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "``pgr_trsp`` (`Combinations`_)" -msgstr "" +#, fuzzy +msgid "pgr_trsp(Combinations)" +msgstr ":doc:`pgr_withPointsCostMatrix`" msgid "Deprecated signatures" msgstr "" -msgid "``pgr_trsp(text,integer,float,integer,float,boolean,boolean,text)``" +msgid "pgr_trsp(text,integer,float,integer,float,boolean,boolean,text)" msgstr "" -msgid "``pgr_trspViaVertices(text,anyarray,boolean,boolean,text)``" +msgid "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" msgstr "" msgid "New prototypes" msgstr "" -msgid "``pgr_trspViaVertices``" -msgstr "" +#, fuzzy +msgid "pgr_trspViaVertices" +msgstr ":doc:`pgr_withPoints`" -msgid "``pgr_trspViaEdges``" -msgstr "" +#, fuzzy +msgid "pgr_trspViaEdges" +msgstr ":doc:`pgr_withPoints`" msgid "" "Turn restricted shortest path (TRSP) is an algorithm that receives turn " @@ -14175,19 +14245,14 @@ msgid "" "`Deprecated documentation `_" msgstr "" -msgid "``pgr_trspVia`` - Proposed" -msgstr "" +#, fuzzy +msgid "``pgr_trspVia``" +msgstr ":doc:`pgr_trspVia`" msgid "" "``pgr_trspVia`` Route that goes through a list of vertices with restrictions." msgstr "" -msgid "New proposed function:" -msgstr "" - -msgid "``pgr_trspVia`` (`One Via`_)" -msgstr "" - msgid "" "Given a list of vertices and a graph, this function is equivalent to finding " "the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :" @@ -14265,17 +14330,15 @@ msgstr "" msgid ":doc:`via-category`" msgstr ":doc:`via-category`" -msgid "``pgr_trspVia_withPoints`` - Proposed" -msgstr "" +#, fuzzy +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." msgstr "" -msgid "``pgr_trspVia_withPoints`` (`One Via`_)" -msgstr "" - msgid "" "Given a graph, a set of restriction on the graph edges, a set of points on " "the graphs edges and a list of vertices, this function is equivalent to " @@ -14435,30 +14498,12 @@ msgid "" "`pgr_trsp` algorithm. In this case a U turn is been done using the same edge." msgstr "" -msgid "pgr_trsp_withPoints - Proposed" +msgid "``pgr_trsp_withPoints``" msgstr "" msgid "``pgr_trsp_withPoints`` Routing Vertex/Point with restrictions." msgstr "" -msgid "New proposed signatures:" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (`One to One`_)" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (`One to Many`_)" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (`Many to One`_)" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (`Many to Many`_)" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (`Combinations`_)" -msgstr "" - msgid "" "Modify the graph to include points defined by points_sql. Using Dijkstra " "algorithm, find the shortest path" @@ -14567,7 +14612,7 @@ msgid "" "`1` on an undirected graph, with details." msgstr "" -msgid "pgr_turnRestrictedPath - Experimental" +msgid "``pgr_turnRestrictedPath`` - Experimental" msgstr "" msgid "" @@ -14575,9 +14620,6 @@ msgid "" "with restrictions" msgstr "" -msgid "New experimental function" -msgstr "" - msgid "" "Using Yen's algorithm to obtain K shortest paths and analyze the paths to " "select the paths that do not use the restrictions" @@ -14649,7 +14691,7 @@ msgstr "" msgid "pgRouting Version for this documentation" msgstr "" -msgid "pgr_vrpOneDepot - Experimental" +msgid "``pgr_vrpOneDepot`` - Experimental" msgstr "" msgid "**No documentation available**" @@ -14658,8 +14700,9 @@ msgstr "" msgid "**TBD**" msgstr "" -msgid "``pgr_withPoints`` - Proposed" -msgstr "" +#, fuzzy +msgid "``pgr_withPoints``" +msgstr ":doc:`pgr_withPoints`" msgid "" "``pgr_withPoints`` - Returns the shortest path in a graph with additional " @@ -14801,8 +14844,9 @@ msgstr "" msgid "Passes in front or visits with left side driving." msgstr "" -msgid "``pgr_withPointsCost`` - Proposed" -msgstr "" +#, fuzzy +msgid "``pgr_withPointsCost``" +msgstr ":doc:`pgr_withPointsCost`" msgid "" "``pgr_withPointsCost`` - Calculates the shortest path and returns only the " @@ -14945,8 +14989,9 @@ msgstr "" msgid "Does not matter driving side driving topology" msgstr "" -msgid "``pgr_withPointsCostMatrix`` - proposed" -msgstr "" +#, fuzzy +msgid "``pgr_withPointsCostMatrix``" +msgstr ":doc:`pgr_withPointsCostMatrix`" msgid "" "``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:" @@ -14977,8 +15022,9 @@ msgid "" "locations on the graph of point `(2.9, 1.8)`." msgstr "" -msgid "``pgr_withPointsDD`` - Proposed" -msgstr "" +#, fuzzy +msgid "``pgr_withPointsDD``" +msgstr ":doc:`pgr_withPoints`" msgid "" "``pgr_withPointsDD`` - Returns the driving **distance** from a starting " @@ -14990,8 +15036,13 @@ msgid "" "unnamed compulsory **driving side**." msgstr "" -msgid "``pgr_withPointsDD`` (`Single vertex`)" -msgstr "" +#, fuzzy +msgid "pgr_withPointsDD(Single vertex)" +msgstr ":doc:`pgr_withPointsCostMatrix`" + +#, fuzzy +msgid "pgr_withPointsDD(Multiple vertices)" +msgstr ":doc:`pgr_withPointsCostMatrix`" msgid "Added ``depth``, ``pred`` and ``start_vid`` column." msgstr "" @@ -15008,13 +15059,12 @@ msgid "" msgstr "" msgid "" -"``pgr_withpointsdd(text,text,bigint,double precision,boolean,character," -"boolean)``" +"pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" msgstr "" msgid "" -"``pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)``" +"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," +"boolean,boolean)" msgstr "" msgid "" @@ -15121,8 +15171,9 @@ msgstr "" msgid ":doc:`pgr_alphaShape`" msgstr ":doc:`pgr_alphaShape`" -msgid "pgr_withPointsKSP - Proposed" -msgstr "" +#, fuzzy +msgid "``pgr_withPointsKSP``" +msgstr ":doc:`pgr_withPoints`" msgid "" "``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." @@ -15132,30 +15183,27 @@ msgid "Standarizing output columns to |nksp-result|" msgstr "" #, fuzzy -msgid "``pgr_withPointsKSP`` (One to One)" +msgid "pgr_withPointsKSP(One to One)" msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "New overload functions" -msgstr "" - #, fuzzy -msgid "``pgr_withPointsKSP`` (One to Many)" +msgid "pgr_withPointsKSP(One to Many)" msgstr ":doc:`pgr_withPointsCostMatrix`" #, fuzzy -msgid "``pgr_withPointsKSP`` (Many to One)" +msgid "pgr_withPointsKSP(Many to One)" msgstr ":doc:`pgr_withPointsCostMatrix`" #, fuzzy -msgid "``pgr_withPointsKSP`` (Many to Many)" +msgid "pgr_withPointsKSP(Many to Many)" msgstr ":doc:`pgr_withPointsCostMatrix`" #, fuzzy -msgid "``pgr_withPointsKSP`` (Combinations)" +msgid "pgr_withPointsKSP(Combinations)" msgstr ":doc:`pgr_withPointsCostMatrix`" msgid "" -"``pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," +"pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," "boolean)``" msgstr "" @@ -15271,17 +15319,15 @@ msgid "" "to point :math:`2` with heap paths and details." msgstr "" -msgid "``pgr_withPointsVia`` - Proposed" -msgstr "" +#, fuzzy +msgid "``pgr_withPointsVia``" +msgstr ":doc:`pgr_withPointsVia`" msgid "" "``pgr_withPointsVia`` - Route that goes through a list of vertices and/or " "points." msgstr "" -msgid "New **proposed** function ``pgr_withPointsVia`` (`One Via`_)" -msgstr "" - 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:" @@ -15425,6 +15471,20 @@ msgstr "" msgid "pgRouting 3.7" msgstr "" +msgid "pgRouting 3.7.3 Release Notes" +msgstr "" + +msgid "" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.7.3 `__" +msgstr "" + +msgid "" +"`#2731 `__ Build Failure " +"on Ubuntu 22" +msgstr "" + msgid "pgRouting 3.7.2 Release Notes" msgstr "" @@ -15674,31 +15734,11 @@ msgid "" "output pgr_aStar" msgstr "" -msgid "" -"``pgr_aStar`` (`One to One`) added ``start_vid`` and ``end_vid`` columns." -msgstr "" - -msgid "``pgr_aStar`` (`One to Many`) added ``end_vid`` column." -msgstr "" - -msgid "``pgr_aStar`` (`Many to One`) added ``start_vid`` column." -msgstr "" - msgid "" "`#2523 `__ Standarize " "output pgr_bdAstar" msgstr "" -msgid "" -"``pgr_bdAstar`` (`One to One`) added ``start_vid`` and ``end_vid`` columns." -msgstr "" - -msgid "``pgr_bdAstar`` (`One to Many`) added ``end_vid`` column." -msgstr "" - -msgid "``pgr_bdAstar`` (`Many to One`) added ``start_vid`` column." -msgstr "" - msgid "" "`#2547 `__ Standarize " "output and modifying signature pgr_KSP" @@ -15706,7 +15746,7 @@ msgstr "" msgid "" "`#2548 `__ Standarize " -"output pgr_drivingdistance" +"output pgr_drivingDistance" msgstr "" msgid "Proposed functions changes" @@ -15853,16 +15893,6 @@ msgstr "" msgid "Dijkstra" msgstr "" -msgid "" -"``pgr_dijkstra`` (`One to One`) added ``start_vid`` and ``end_vid`` columns." -msgstr "" - -msgid "``pgr_dijkstra`` (`One to Many`) added ``end_vid`` column." -msgstr "" - -msgid "``pgr_dijkstra`` (`Many to One`) added ``start_vid`` column." -msgstr "" - msgid "pgRouting 3.4" msgstr "" @@ -15919,14 +15949,16 @@ msgid "" "doesn't give all correct shortest path" msgstr "" -msgid "New proposed functions" -msgstr "" +#, fuzzy +msgid "New proposed functions." +msgstr ":doc:`routingFunctions`" msgid "With points" msgstr "" -msgid "``pgr_withPointsVia`` (One Via)" -msgstr "" +#, fuzzy +msgid "pgr_withPointsVia(One Via)" +msgstr ":doc:`pgr_withPointsCostMatrix`" msgid "Turn Restrictions" msgstr "" @@ -15934,88 +15966,76 @@ msgstr "" msgid "Via with turn restrictions" msgstr "" -msgid "``pgr_trspVia`` (One Via)" -msgstr "" - -msgid "``pgr_trspVia_withPoints`` (One Via)" +msgid "pgr_trspVia(One Via)" msgstr "" -msgid "``pgr_trsp``" -msgstr "" - -msgid "``pgr_trsp`` (One to One)" -msgstr "" - -msgid "``pgr_trsp`` (One to Many)" -msgstr "" - -msgid "``pgr_trsp`` (Many to One)" -msgstr "" - -msgid "``pgr_trsp`` (Many to Many)" -msgstr "" - -msgid "``pgr_trsp`` (Combinations)" -msgstr "" - -msgid "``pgr_trsp_withPoints``" -msgstr "" +#, fuzzy +msgid "pgr_trspVia_withPoints(One Via)" +msgstr ":doc:`pgr_trspVia_withPoints`" -msgid "``pgr_trsp_withPoints`` (One to One)" -msgstr "" +#, fuzzy +msgid "pgr_trsp_withPoints(One to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "``pgr_trsp_withPoints`` (One to Many)" -msgstr "" +#, fuzzy +msgid "pgr_trsp_withPoints(One to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "``pgr_trsp_withPoints`` (Many to One)" -msgstr "" +#, fuzzy +msgid "pgr_trsp_withPoints(Many to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "``pgr_trsp_withPoints`` (Many to Many)" -msgstr "" +#, fuzzy +msgid "pgr_trsp_withPoints(Many to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "``pgr_trsp_withPoints`` (Combinations)" -msgstr "" +#, fuzzy +msgid "pgr_trsp_withPoints(Combinations)" +msgstr ":doc:`pgr_withPointsCostMatrix`" msgid "Topology" msgstr "" -msgid "``pgr_degree``" -msgstr "" - msgid "Utilities" msgstr "" -msgid "``pgr_findCloseEdges`` (One point)" -msgstr "" +#, fuzzy +msgid "pgr_findCloseEdges(One point)" +msgstr ":doc:`pgr_findCloseEdges`" -msgid "``pgr_findCloseEdges`` (Many points)" -msgstr "" +#, fuzzy +msgid "pgr_findCloseEdges(Many points)" +msgstr ":doc:`pgr_findCloseEdges`" msgid "Ordering" msgstr "" -msgid "``pgr_cuthillMckeeOrdering``" +msgid "pgr_cuthillMckeeOrdering" msgstr "" msgid "Unclassified" msgstr "" +#, fuzzy +msgid "pgr_hawickCircuits" +msgstr ":doc:`pgr_hawickCircuits`" + msgid "Flow functions" msgstr "" -msgid "``pgr_maxCardinalityMatch(text)``" +msgid "pgr_maxCardinalityMatch(text)" msgstr "" -msgid "Deprecating ``pgr_maxCardinalityMatch(text,boolean)``" +msgid "Deprecating: pgr_maxCardinalityMatch(text,boolean)" msgstr "" msgid "Deprecated Functions" msgstr "" -msgid "``pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)``" +msgid "pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)" msgstr "" -msgid "``pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text)``" +msgid "pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text)" msgstr "" msgid "pgRouting 3.3" @@ -16277,12 +16297,6 @@ msgstr "" msgid "Removing support for Boost v1.53, v1.54 & v1.55" msgstr "" -msgid "pgr_bellmanFord(Combinations)" -msgstr "" - -msgid "pgr_binaryBreadthFirstSearch(Combinations)" -msgstr "" - msgid "pgr_bipartite" msgstr "" @@ -16292,9 +16306,6 @@ msgstr "" msgid "Dijkstra Near" msgstr "" -msgid "pgr_edwardMoore(Combinations)" -msgstr "" - msgid "pgr_isPlanar" msgstr "" @@ -16304,51 +16315,15 @@ msgstr "" msgid "pgr_makeConnected" msgstr "" -msgid "pgr_maxFlowMinCost(Combinations)" -msgstr "" - -msgid "pgr_maxFlowMinCost_Cost(Combinations)" -msgstr "" - msgid "Astar" msgstr "" -msgid "pgr_aStar(Combinations)" -msgstr "" - -msgid "pgr_aStarCost(Combinations)" -msgstr "" - msgid "Bidirectional Astar" msgstr "" -msgid "pgr_bdAstar(Combinations)" -msgstr "" - -msgid "pgr_bdAstarCost(Combinations)" -msgstr "" - msgid "Bidirectional Dijkstra" msgstr "" -msgid "pgr_bdDijkstra(Combinations)" -msgstr "" - -msgid "pgr_bdDijkstraCost(Combinations)" -msgstr "" - -msgid "pgr_boykovKolmogorov(Combinations)" -msgstr "" - -msgid "pgr_edmondsKarp(Combinations)" -msgstr "" - -msgid "pgr_maxFlow(Combinations)" -msgstr "" - -msgid "pgr_pushRelabel(Combinations)" -msgstr "" - msgid "pgRouting 3.1" msgstr "" @@ -16583,7 +16558,7 @@ msgid "" "information" msgstr "" -msgid "New functions" +msgid "New Functions" msgstr "" msgid "Kruskal family" @@ -16622,149 +16597,120 @@ msgstr "" msgid "aStar Family" msgstr "" -msgid "pgr_aStar(one to many)" -msgstr "" - -msgid "pgr_aStar(many to one)" -msgstr "" - -msgid "pgr_aStar(many to many)" -msgstr "" - -msgid "pgr_aStarCost(one to one)" -msgstr "" - -msgid "pgr_aStarCost(one to many)" -msgstr "" - -msgid "pgr_aStarCost(many to one)" -msgstr "" - -msgid "pgr_aStarCost(many to many)" -msgstr "" +#, fuzzy +msgid "pgr_aStarCost(One to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_aStarCostMatrix(one to one)" -msgstr "" +#, fuzzy +msgid "pgr_aStarCost(One to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_aStarCostMatrix(one to many)" -msgstr "" +#, fuzzy +msgid "pgr_aStarCost(Many to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_aStarCostMatrix(many to one)" -msgstr "" +#, fuzzy +msgid "pgr_aStarCost(Many to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_aStarCostMatrix(many to many)" -msgstr "" +#, fuzzy +msgid "pgr_aStarCostMatrix" +msgstr ":doc:`pgr_aStarCostMatrix`" msgid "bdAstar Family" msgstr "" -msgid "pgr_bdAstar(one to many)" -msgstr "" - -msgid "pgr_bdAstar(many to one)" -msgstr "" - -msgid "pgr_bdAstar(many to many)" -msgstr "" - -msgid "pgr_bdAstarCost(one to one)" -msgstr "" - -msgid "pgr_bdAstarCost(one to many)" -msgstr "" - -msgid "pgr_bdAstarCost(many to one)" -msgstr "" - -msgid "pgr_bdAstarCost(many to many)" -msgstr "" +#, fuzzy +msgid "pgr_bdAstarCost(One to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_bdAstarCostMatrix(one to one)" -msgstr "" +#, fuzzy +msgid "pgr_bdAstarCost(One to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_bdAstarCostMatrix(one to many)" -msgstr "" +#, fuzzy +msgid "pgr_bdAstarCost(Many to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_bdAstarCostMatrix(many to one)" -msgstr "" +#, fuzzy +msgid "pgr_bdAstarCost(Many to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_bdAstarCostMatrix(many to many)" +msgid "pgr_bdAstarCostMatrix" msgstr "" msgid "bdDijkstra Family" msgstr "" -msgid "pgr_bdDijkstra(one to many)" -msgstr "" - -msgid "pgr_bdDijkstra(many to one)" -msgstr "" - -msgid "pgr_bdDijkstra(many to many)" -msgstr "" - -msgid "pgr_bdDijkstraCost(one to one)" -msgstr "" - -msgid "pgr_bdDijkstraCost(one to many)" -msgstr "" - -msgid "pgr_bdDijkstraCost(many to one)" -msgstr "" - -msgid "pgr_bdDijkstraCost(many to many)" -msgstr "" +#, fuzzy +msgid "pgr_bdDijkstraCost(One to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_bdDijkstraCostMatrix(one to one)" -msgstr "" +#, fuzzy +msgid "pgr_bdDijkstraCost(One to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_bdDijkstraCostMatrix(one to many)" -msgstr "" +#, fuzzy +msgid "pgr_bdDijkstraCost(Many to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_bdDijkstraCostMatrix(many to one)" -msgstr "" +#, fuzzy +msgid "pgr_bdDijkstraCost(Many to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_bdDijkstraCostMatrix(many to many)" +msgid "pgr_bdDijkstraCostMatrix" msgstr "" msgid "Flow Family" msgstr "" -msgid "pgr_pushRelabel(one to one)" -msgstr "" +#, fuzzy +msgid "pgr_pushRelabel(One to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_pushRelabel(one to many)" -msgstr "" +#, fuzzy +msgid "pgr_pushRelabel(One to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_pushRelabel(many to one)" -msgstr "" +#, fuzzy +msgid "pgr_pushRelabel(Many to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_pushRelabel(many to many)" -msgstr "" +#, fuzzy +msgid "pgr_pushRelabel(Many to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_edmondsKarp(one to one)" -msgstr "" +#, fuzzy +msgid "pgr_edmondsKarp(One to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_edmondsKarp(one to many)" -msgstr "" +#, fuzzy +msgid "pgr_edmondsKarp(One to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_edmondsKarp(many to one)" -msgstr "" +#, fuzzy +msgid "pgr_edmondsKarp(Many to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_edmondsKarp(many to many)" -msgstr "" +#, fuzzy +msgid "pgr_edmondsKarp(Many to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_boykovKolmogorov (one to one)" -msgstr "" +#, fuzzy +msgid "pgr_boykovKolmogorov (One to One)" +msgstr ":doc:`pgr_boykovKolmogorov`" -msgid "pgr_boykovKolmogorov (one to many)" -msgstr "" +#, fuzzy +msgid "pgr_boykovKolmogorov (One to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_boykovKolmogorov (many to one)" -msgstr "" +#, fuzzy +msgid "pgr_boykovKolmogorov (Many to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_boykovKolmogorov (many to many)" -msgstr "" +#, fuzzy +msgid "pgr_boykovKolmogorov (Many to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" msgid "pgr_maxCardinalityMatching" msgstr "" @@ -16772,21 +16718,28 @@ msgstr "" msgid "pgr_maxFlow" msgstr "" -msgid "pgr_edgeDisjointPaths(one to one)" -msgstr "" +#, fuzzy +msgid "pgr_edgeDisjointPaths(One to One)" +msgstr ":doc:`pgr_edgeDisjointPaths`" -msgid "pgr_edgeDisjointPaths(one to many)" -msgstr "" +#, fuzzy +msgid "pgr_edgeDisjointPaths(One to Many)" +msgstr ":doc:`pgr_edgeDisjointPaths`" -msgid "pgr_edgeDisjointPaths(many to one)" -msgstr "" +#, fuzzy +msgid "pgr_edgeDisjointPaths(Many to One)" +msgstr ":doc:`pgr_edgeDisjointPaths`" -msgid "pgr_edgeDisjointPaths(many to many)" -msgstr "" +#, fuzzy +msgid "pgr_edgeDisjointPaths(Many to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" msgid "Components family" msgstr "" +msgid "pgr_connectedComponents" +msgstr "" + msgid "pgr_strongComponents" msgstr "" @@ -16973,7 +16926,7 @@ msgstr "" msgid "pgr_johnson" msgstr "" -msgid "pgr_astar" +msgid "pgr_aStar" msgstr "" msgid "pgr_bdAstar" @@ -16994,6 +16947,9 @@ msgstr "" msgid "pgr_drivingDistance" msgstr "" +msgid "pgr_KSP" +msgstr "" + msgid "pgr_dijkstraVia (proposed)" msgstr "" @@ -17192,23 +17148,15 @@ msgstr "" msgid "Parameter names changed" msgstr "" -msgid "The many version results are the union of the one to one version" +msgid "The many version results are the union of the One to One version" msgstr "" msgid "New Signatures" msgstr "" -msgid "pgr_bdAstar(one to one)" -msgstr "" - -msgid "New Proposed functions" -msgstr "" - -msgid "pgr_bdAstarCostMatrix" -msgstr "" - -msgid "pgr_bdDijkstraCostMatrix" -msgstr "" +#, fuzzy +msgid "pgr_bdAstar(One to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" msgid "pgr_lineGraph" msgstr "" @@ -17290,31 +17238,7 @@ msgstr "" msgid "pgr_bdDijkstra" msgstr "" -msgid "New Proposed Signatures" -msgstr "" - -msgid "pgr_astar(one to many)" -msgstr "" - -msgid "pgr_astar(many to one)" -msgstr "" - -msgid "pgr_astar(many to many)" -msgstr "" - -msgid "pgr_astarCost(one to one)" -msgstr "" - -msgid "pgr_astarCost(one to many)" -msgstr "" - -msgid "pgr_astarCost(many to one)" -msgstr "" - -msgid "pgr_astarCost(many to many)" -msgstr "" - -msgid "pgr_astarCostMatrix" +msgid "Deprecated signatures." msgstr "" msgid "pgr_bddijkstra - use pgr_bdDijkstra instead" @@ -17386,53 +17310,55 @@ msgstr "" msgid "pgr_TSP" msgstr "" -msgid "pgr_aStar" -msgstr "" - -msgid "New Functions" -msgstr "" - msgid "pgr_eucledianTSP" msgstr "" -msgid "pgr_withPointsCostMatrix" -msgstr "" - -msgid "pgr_maxFlowPushRelabel(one to one)" -msgstr "" +#, fuzzy +msgid "pgr_maxFlowPushRelabel(One to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_maxFlowPushRelabel(one to many)" -msgstr "" +#, fuzzy +msgid "pgr_maxFlowPushRelabel(One to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_maxFlowPushRelabel(many to one)" -msgstr "" +#, fuzzy +msgid "pgr_maxFlowPushRelabel(Many to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_maxFlowPushRelabel(many to many)" -msgstr "" +#, fuzzy +msgid "pgr_maxFlowPushRelabel(Many to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_maxFlowEdmondsKarp(one to one)" -msgstr "" +#, fuzzy +msgid "pgr_maxFlowEdmondsKarp(One to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_maxFlowEdmondsKarp(one to many)" -msgstr "" +#, fuzzy +msgid "pgr_maxFlowEdmondsKarp(One to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_maxFlowEdmondsKarp(many to one)" -msgstr "" +#, fuzzy +msgid "pgr_maxFlowEdmondsKarp(Many to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_maxFlowEdmondsKarp(many to many)" -msgstr "" +#, fuzzy +msgid "pgr_maxFlowEdmondsKarp(Many to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_maxFlowBoykovKolmogorov (one to one)" +msgid "pgr_maxFlowBoykovKolmogorov (One to One)" msgstr "" -msgid "pgr_maxFlowBoykovKolmogorov (one to many)" -msgstr "" +#, fuzzy +msgid "pgr_maxFlowBoykovKolmogorov (One to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_maxFlowBoykovKolmogorov (many to one)" -msgstr "" +#, fuzzy +msgid "pgr_maxFlowBoykovKolmogorov (Many to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_maxFlowBoykovKolmogorov (many to many)" -msgstr "" +#, fuzzy +msgid "pgr_maxFlowBoykovKolmogorov (Many to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" msgid "pgr_maximumCardinalityMatching" msgstr "" @@ -17443,7 +17369,7 @@ msgstr "" msgid "pgr_tsp - use pgr_TSP or pgr_eucledianTSP instead" msgstr "" -msgid "pgr_astar - use pgr_aStar instead" +msgid "pgr_aStar - use pgr_aStar instead" msgstr "" msgid "pgr_flip_edges" @@ -17530,6 +17456,9 @@ msgstr "" msgid "Improvements" msgstr "" +msgid "pgr_nodeNetwork" +msgstr "" + msgid "Adding a row_where and outall optional parameters" msgstr "" @@ -17542,44 +17471,56 @@ msgstr "" msgid "pgr_Johnson" msgstr "" -msgid "pgr_dijkstraCost(one to one)" -msgstr "" +#, fuzzy +msgid "pgr_dijkstraCost(One to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_dijkstraCost(one to many)" -msgstr "" +#, fuzzy +msgid "pgr_dijkstraCost(One to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_dijkstraCost(many to one)" -msgstr "" +#, fuzzy +msgid "pgr_dijkstraCost(Many to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_dijkstraCost(many to many)" -msgstr "" +#, fuzzy +msgid "pgr_dijkstraCost(Many to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" msgid "Proposed Functionality" msgstr "" -msgid "pgr_withPoints(one to one)" -msgstr "" +#, fuzzy +msgid "pgr_withPoints(One to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_withPoints(one to many)" -msgstr "" +#, fuzzy +msgid "pgr_withPoints(One to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_withPoints(many to one)" -msgstr "" +#, fuzzy +msgid "pgr_withPoints(Many to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_withPoints(many to many)" -msgstr "" +#, fuzzy +msgid "pgr_withPoints(Many to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_withPointsCost(one to one)" -msgstr "" +#, fuzzy +msgid "pgr_withPointsCost(One to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_withPointsCost(one to many)" -msgstr "" +#, fuzzy +msgid "pgr_withPointsCost(One to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_withPointsCost(many to one)" -msgstr "" +#, fuzzy +msgid "pgr_withPointsCost(Many to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" -msgid "pgr_withPointsCost(many to many)" -msgstr "" +#, fuzzy +msgid "pgr_withPointsCost(Many to Many)" +msgstr ":doc:`pgr_withPointsCostMatrix`" msgid "pgr_withPointsDD(single vertex)" msgstr "" @@ -17587,9 +17528,6 @@ msgstr "" msgid "pgr_withPointsDD(multiple vertices)" msgstr "" -msgid "pgr_withPointsKSP" -msgstr "" - msgid "pgr_dijkstraVia" msgstr "" @@ -17623,26 +17561,12 @@ msgid "" "q=is%3Aissue+milestone%3A%22Release+2.1.0%22+is%3Aclosed>`_ on Github." msgstr "" -msgid "pgr_dijkstra(one to many)" -msgstr "" - -msgid "pgr_dijkstra(many to one)" -msgstr "" - -msgid "pgr_dijkstra(many to many)" -msgstr "" - -msgid "pgr_drivingDistance(multiple vertices)" -msgstr "" - msgid "Refactored" msgstr "" -msgid "pgr_dijkstra(one to one)" -msgstr "" - -msgid "pgr_drivingDistance(single vertex)" -msgstr "" +#, fuzzy +msgid "pgr_dijkstra(One to One)" +msgstr ":doc:`pgr_withPointsCostMatrix`" msgid "" "pgr_alphaShape function now can generate better (multi)polygon with holes " @@ -18352,8 +18276,8 @@ msgid "" msgstr "" msgid "" -"pgRouting suplies some functions to create a routing topology and to analyze " -"the topology." +"pgRouting supplies some functions to create a routing topology and to " +"analyze the topology." msgstr "" msgid "Additional functions to create a graph:" @@ -18762,3 +18686,89 @@ msgid "pgr_withPointsvia is pgr_dijkstraVia **with points**" msgstr "" #, fuzzy +#~ msgid "pgr_aStarCostMatrix(One to One)" +#~ msgstr ":doc:`pgr_withPointsCostMatrix`" + +#, fuzzy +#~ msgid "pgr_aStarCostMatrix(One to Many)" +#~ msgstr ":doc:`pgr_withPointsCostMatrix`" + +#, fuzzy +#~ msgid "pgr_aStarCostMatrix(Many to One)" +#~ msgstr ":doc:`pgr_withPointsCostMatrix`" + +#, fuzzy +#~ msgid "pgr_aStarCostMatrix(Many to Many)" +#~ msgstr ":doc:`pgr_withPointsCostMatrix`" + +#, fuzzy +#~ msgid "pgr_bdAstarCostMatrix(One to One)" +#~ msgstr ":doc:`pgr_withPointsCostMatrix`" + +#, fuzzy +#~ msgid "pgr_bdAstarCostMatrix(One to Many)" +#~ msgstr ":doc:`pgr_withPointsCostMatrix`" + +#, fuzzy +#~ msgid "pgr_bdAstarCostMatrix(Many to One)" +#~ msgstr ":doc:`pgr_withPointsCostMatrix`" + +#, fuzzy +#~ msgid "pgr_bdAstarCostMatrix(Many to Many)" +#~ msgstr ":doc:`pgr_withPointsCostMatrix`" + +#, fuzzy +#~ msgid "pgr_bdDijkstraCostMatrix(One to One)" +#~ msgstr ":doc:`pgr_withPointsCostMatrix`" + +#, fuzzy +#~ msgid "pgr_bdDijkstraCostMatrix(One to Many)" +#~ msgstr ":doc:`pgr_withPointsCostMatrix`" + +#, fuzzy +#~ msgid "pgr_bdDijkstraCostMatrix(Many to One)" +#~ msgstr ":doc:`pgr_withPointsCostMatrix`" + +#, fuzzy +#~ msgid "pgr_bdDijkstraCostMatrix(Many to Many)" +#~ msgstr ":doc:`pgr_withPointsCostMatrix`" + +#, fuzzy +#~ msgid "pgr_astar(One to Many)" +#~ msgstr ":doc:`pgr_withPointsCostMatrix`" + +#, fuzzy +#~ msgid "pgr_astar(Many to One)" +#~ msgstr ":doc:`pgr_withPointsCostMatrix`" + +#, fuzzy +#~ msgid "pgr_astar(Many to Many)" +#~ msgstr ":doc:`pgr_withPointsCostMatrix`" + +#, fuzzy +#~ msgid "pgr_astarCost(One to One)" +#~ msgstr ":doc:`pgr_withPointsCostMatrix`" + +#, fuzzy +#~ msgid "pgr_astarCost(One to Many)" +#~ msgstr ":doc:`pgr_withPointsCostMatrix`" + +#, fuzzy +#~ msgid "pgr_astarCost(Many to One)" +#~ msgstr ":doc:`pgr_withPointsCostMatrix`" + +#, fuzzy +#~ msgid "pgr_astarCost(Many to Many)" +#~ msgstr ":doc:`pgr_withPointsCostMatrix`" + +#, fuzzy +#~ msgid "``pgr_drivingdistance`` (Single vertex)" +#~ msgstr ":doc:`pgr_drivingDistance`" + +#, fuzzy +#~ msgid "New Function." +#~ msgstr ":doc:`routingFunctions`" + +#, fuzzy +#~ msgid "**Supported versions**" +#~ msgstr "짧은 버전" diff --git a/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po b/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po index bc67a9c9631..386efcf7d13 100644 --- a/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po @@ -4,7 +4,7 @@ # Regina Obe , 2023. # Wangdapeng , 2023. # Zuochenwei , 2023, 2024. -# Celia Virginia Vergara Castillo , 2023, 2024. +# Celia Virginia Vergara Castillo , 2023, 2024, 2025. # Wang Dapeng , 2023. # DeepL , 2024. # Dapeng Wang , 2024. @@ -12,9 +12,9 @@ msgid "" msgstr "" "Project-Id-Version: pgRouting v4.0\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2025-01-10 14:53+0000\n" -"PO-Revision-Date: 2024-12-20 07:59+0000\n" -"Last-Translator: Dapeng Wang \n" +"POT-Creation-Date: 2025-02-12 01:00+0000\n" +"PO-Revision-Date: 2025-02-12 01:27+0000\n" +"Last-Translator: Celia Virginia Vergara Castillo \n" "Language-Team: Chinese (Simplified) \n" "Language: zh_Hans\n" @@ -687,9 +687,10 @@ msgstr "当 ``NOT 0`` 且 ``start_id = 0`` 时，它是第一个和最后一个 msgid "References" msgstr "参考" +#, fuzzy msgid "" -"`Boost's metric appro's metric approximation `__" +"`Boost: metric TSP approx `__" msgstr "" "`Boost 的 metric appro 的 metric 近似 `__" @@ -1676,8 +1677,8 @@ msgstr ":math:`1km * 0.0277hr/km = 0.0277hr`" msgid "https://en.wikipedia.org/wiki/Vehicle_routing_problem" msgstr "https://en.wikipedia.org/wiki/Vehicle_routing_problem" -msgid "The queries use the :doc:`sampledata` network." -msgstr "查询使用 :doc:`sampledata` 网络。" +msgid ":doc:`sampledata`" +msgstr ":doc:`sampledata`" msgid "A* - Family of functions" msgstr "A* - 函数族" @@ -1848,7 +1849,9 @@ msgstr "" msgid ":doc:`bdAstar-family`" msgstr ":doc:`bdAstar-family`" -msgid "https://www.boost.org/libs/graph/doc/astar_search.html" +#, fuzzy +msgid "" +"`Boost: A* search `__" msgstr "https://www.boost.org/libs/graph/doc/astar_search.html" msgid "https://en.wikipedia.org/wiki/A*_search_algorithm" @@ -2664,7 +2667,8 @@ msgid "" "ending vertex:" msgstr "对于起始顶点和结束顶点之间存在路径的大型图:" -msgid "It is expected to terminate faster than pgr_astar" +#, fuzzy +msgid "It is expected to terminate faster than pgr_aStar" msgstr "预计终止速度比 pgr_astar 更快" msgid ":doc:`aStar-family`" @@ -2813,35 +2817,10 @@ msgstr "``edge_id``" msgid "Identifier of the color of the edge." msgstr "边颜色的标识符。" +#, fuzzy msgid "" -"`Boost: Sequential Vertex Coloring algorithm documentation `__" -msgstr "" -"`Boost：顺序顶点着色算法文档 `__" - -msgid "" -"`Wikipedia: Graph coloring `__" -msgstr "`维基百科：图着色 `__" - -msgid "" -"`Boost: is_bipartite `__" -msgstr "" -"`Boost: is_bipartite `__" - -msgid "" -"`Wikipedia: bipartite graph `__" -msgstr "`维基百科：二分图 `__" - -msgid "" -"`Boost: Edge Coloring Algorithm documentation `__" -msgstr "" -"`Boost：边缘着色算法文档 `__" +"`Boost: `__" +msgstr "boost: https://www.boost.org/libs/graph/doc/table_of_contents.html" msgid "Components - Family of functions" msgstr "分量 - 函数族" @@ -3403,9 +3382,6 @@ msgstr "当源和/或目标属于一个顶点时，现在就找到了一条路 msgid "Now, the routing graph has an edge connecting with node :math:`7`." msgstr "现在，路由图有一条与节点 :math:`7` 连接的边。" -msgid ":doc:`sampledata`" -msgstr ":doc:`sampledata`" - msgid "" "https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/" "lecture16.pdf" @@ -4052,11 +4028,10 @@ msgid "" "an undirected graph." msgstr ":doc:`pgr_cuthillMckeeOrdering` -返回无向图的反向 Cuthill-McKee 排序。" -#, fuzzy msgid "" ":doc:`pgr_topologicalSort` - Linear ordering of the vertices for directed " "acyclic graph." -msgstr "``pgr_topologicalSort`` — 有向无环图 (DAG) 的顶点的线性排序。" +msgstr ":doc:`pgr_topologicalSort` — 有向无环图 (DAG) 的顶点的线性排序。" msgid ":doc:`metrics-family`" msgstr ":doc:`metrics-family`" @@ -4569,27 +4544,188 @@ msgstr ":doc:`release_notes`" msgid "pgRouting 4.0.0 Release Notes" msgstr "pgRouting 4.0.0 发布说明" -msgid "Removal of deprecated functions and signatures" +#, fuzzy +msgid "" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 4.0.0 `__" +msgstr "" +"要查看此版本关闭的所有问题和拉取请求，请参阅 `Git closed milestone for 3.7.0 " +"`__" + +msgid "Functions promoted to official" +msgstr "" + +msgid "pgr_trsp" +msgstr "pgr_trsp" + +msgid "pgr_trspVia" +msgstr "pgr_trspVia" + +msgid "pgr_trspVia_withPoints" +msgstr "pgr_trspVia_withPoints" + +msgid "pgr_trsp_withPoints" +msgstr "pgr_trsp_withPoints" + +msgid "pgr_withPoints" +msgstr "pgr_withPoints" + +msgid "pgr_withPointsCost" +msgstr "pgr_withPointsCost" + +msgid "pgr_withPointsCostMatrix" +msgstr "pgr_withPointsCostMatrix" + +msgid "pgr_withPointsDD" +msgstr "pgr_withPointsDD" + +msgid "pgr_withPointsKSP" +msgstr "pgr_withPointsKSP" + +msgid "pgr_withPointsVia" +msgstr "pgr_withPointsVia" + +msgid "Signatures promoted to official" +msgstr "" + +msgid "pgr_aStar(Combinations)" +msgstr "pgr_aStar(组合)" + +msgid "pgr_aStarCost(Combinations)" +msgstr "pgr_aStarCost(组合)" + +msgid "pgr_bdAstar(Combinations)" +msgstr "pgr_bdAstar(组合)" + +msgid "pgr_bdAstarCost(Combinations)" +msgstr "pgr_bdAstarCost(组合)" + +msgid "pgr_bdDijkstra(Combinations)" +msgstr "pgr_bdDijkstra(组合)" + +msgid "pgr_bdDijkstraCost(Combinations)" +msgstr "pgr_bdDijkstraCost(组合)" + +msgid "pgr_dijkstra(Combinations)" +msgstr "pgr_dijkstra(组合)" + +msgid "pgr_dijkstraCost(Combinations)" +msgstr "pgr_dijkstraCost(组合)" + +#, fuzzy +msgid "pgr_KSP(All signatures)" +msgstr "TSP 旧签名" + +msgid "pgr_boykovKolmogorov(Combinations)" +msgstr "pgr_boykovKolmogorov (组合)" + +msgid "pgr_edmondsKarp(Combinations)" +msgstr "pgr_edmondsKarp(组合)" + +msgid "pgr_maxFlow(Combinations)" +msgstr "pgr_maxFlow(组合)" + +msgid "pgr_pushRelabel(Combinations)" +msgstr "pgr_pushRelabel(组合)" + +msgid "code enhancements:" +msgstr "代码改进：" + +msgid "Removal of unused C/C++ code" +msgstr "" + +#, fuzzy +msgid "Removal of SQL deprecated functions" msgstr "移除已弃用的函数和签名" msgid "" -"``pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)``" +"pgr_trsp(text,integer,double precision,integer,double precision,boolean," +"boolean,text)" +msgstr "" +"pgr_trsp(text,integer,double precision,integer,double precision,boolean," +"boolean,text)" + +msgid "pgr_trsp(text,integer,integer,boolean,boolean,text)" +msgstr "pgr_trsp(text,integer,integer,boolean,boolean,text)" + +msgid "" +"pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" msgstr "" -"``pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)``" +"pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" -msgid "``pgr_trspviavertices(text,anyarray,boolean,boolean,text)``" -msgstr "``pgr_trspviavertices(text,anyarray,boolean,boolean,text)``" +msgid "pgr_trspviavertices(text,anyarray,boolean,boolean,text)" +msgstr "pgr_trspviavertices(text,anyarray,boolean,boolean,text)" #, fuzzy +msgid "Removal of SQL deprecated internal functions" +msgstr "移除已弃用的函数和签名" + +msgid "_pgr_dijkstranear(text,anyarray,anyarray,bigint,boolean)" +msgstr "_pgr_dijkstranear(text,anyarray,anyarray,bigint,boolean)" + +msgid "_pgr_dijkstranear(text,anyarray,bigint,bigint,boolean)" +msgstr "_pgr_dijkstranear(text,anyarray,bigint,bigint,boolean)" + +msgid "_pgr_dijkstranear(text,bigint,anyarray,bigint,boolean)" +msgstr "_pgr_dijkstranear(text,bigint,anyarray,bigint,boolean)" + +msgid "_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" +msgstr "_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)" + +msgid "_pgr_dijkstra(text,text,boolean,boolean,boolean)" +msgstr "_pgr_dijkstra(text,text,boolean,boolean,boolean)" + +msgid "_pgr_drivingdistance(text,anyarray,double precision,boolean,boolean)" +msgstr "_pgr_drivingdistance(text,anyarray,double precision,boolean,boolean)" + +msgid "_pgr_kruskal(text,anyarray,text,bigint,double precision)" +msgstr "_pgr_kruskal(text,anyarray,text,bigint,double precision)" + +msgid "_pgr_prim(text,anyarray,text,bigint,double precision)" +msgstr "_pgr_prim(text,anyarray,text,bigint,double precision)" + msgid "" -"``pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean,text)``" +"_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])" +"_pgr_trsp(text,integer,double precision,integer,double precision,boolean," +"boolean,text)" + +msgid "_pgr_trsp(text,text,anyarray,anyarray,boolean)" +msgstr "_pgr_trsp(text,text,anyarray,anyarray,boolean)" + +msgid "_pgr_trsp(text,text,anyarray,bigint,boolean)" +msgstr "_pgr_trsp(text,text,anyarray,bigint,boolean)" + +msgid "_pgr_trsp(text,text,bigint,anyarray,boolean)" +msgstr "_pgr_trsp(text,text,bigint,anyarray,boolean)" + +msgid "_pgr_trsp(text,text,bigint,bigint,boolean)" +msgstr "_pgr_trsp(text,text,bigint,bigint,boolean)" + +msgid "_pgr_trspviavertices(text,integer[],boolean,boolean,text)" +msgstr "_pgr_trspviavertices(text,integer[],boolean,boolean,text)" + +msgid "_pgr_withpointsvia(text,bigint[],double precision[],boolean)" +msgstr "_pgr_withpointsvia(text,bigint[],double precision[],boolean)" + +msgid "_trsp(text,text,anyarray,anyarray,boolean)" +msgstr "_trsp(text,text,anyarray,anyarray,boolean)" -msgid "``pgr_trsp(text,integer,integer,boolean,boolean,text)``" -msgstr "``pgr_trsp(text,integer,integer,boolean,boolean,text)``" +msgid "_v4trsp(text,text,anyarray,anyarray,boolean)" +msgstr "_v4trsp(text,text,anyarray,anyarray,boolean)" + +msgid "_v4trsp(text,text,text,boolean)" +msgstr "_v4trsp(text,text,text,boolean)" + +#, fuzzy +msgid "Deprecation of internal C/C++ functions" +msgstr "已废弃的函数" + +msgid "Internal C/C++ functions in legacy" +msgstr "" msgid "All releases" msgstr "All releases" @@ -4597,9 +4733,6 @@ msgstr "All releases" msgid "Kruskal - Family of functions" msgstr "Kruskal - 函数族" -msgid "Boost Graph Inside" -msgstr "Boost 图内部" - 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 " @@ -4795,7 +4928,8 @@ msgstr "在 ``pgr_dijkstra`` (`多对一`)中" msgid "If needed add the new columns, for example:" msgstr "如果需要，过滤掉添加的列，例如：" -msgid "Migration of ``pgr_drivingdistance``" +#, fuzzy +msgid "Migration of ``pgr_drivingDistance``" msgstr "迁移 ``pgr_drivingdistance``" msgid "" @@ -4817,11 +4951,13 @@ msgstr "到" msgid "|result-spantree|" msgstr "|result-spantree|" -msgid "``pgr_drivingdistance`` (Single vertex)" -msgstr "``pgr_drivingdistance`` (单个顶点)" +#, fuzzy +msgid "pgr_drivingDistance(Single vertex)" +msgstr "pgr_drivingDistance （单顶点）" -msgid "``pgr_drivingdistance`` (Multiple vertices)" -msgstr "``pgr_drivingdistance`` (多个顶点)" +#, fuzzy +msgid "pgr_drivingDistance(Multiple vertices)" +msgstr "pgr_drivingDistance （多顶点）" msgid "Output columns were |result-dij-dd|" msgstr "输出列是 |result-dij-dd|" @@ -5058,13 +5194,14 @@ msgstr "查询中仅返回 ``边`` 列。" msgid "Migration of ``pgr_primDD`` / ``pgr_primBFS`` / ``pgr_primDFS``" msgstr "`pgr_primDD`` / `pgr_primBFS`` / `pgr_primDFS`` 的迁移" +#, fuzzy msgid "" "Starting from `v3.7.0 `__ :" "doc:`pgr_primDD`, :doc:`pgr_primBFS` and :doc:`pgr_primDFS` result columns " "are being standardized." msgstr "" -"Starting from `v3.7.0 `__ :" -"doc:`pgr_primDD`, :doc:`pgr_primBFS` and :doc:`pgr_primDFS` result columns " +"Starting from `v3.7.0 `__ " +":doc:`pgr_primDD`, :doc:`pgr_primBFS` and :doc:`pgr_primDFS` result columns " "are being standardized." msgid "``pgr_primDD``" @@ -5293,32 +5430,24 @@ msgstr "如果需要，过滤掉附加列，例如，返回原始列：" msgid "Migration of ``pgr_trsp`` (Vertices)" msgstr "迁移 ``pgr_trsp`` （顶点）" -#, fuzzy msgid "Signature:" -msgstr "标识" +msgstr "标识：" #, fuzzy msgid "Deprecated" msgstr "已废弃的功能" -#, fuzzy msgid "`v3.4.0 `__" -msgstr "从`v3.4.0 `__ 开始" +msgstr "`v3.4.0 `__" msgid "Removed" msgstr "" -#, fuzzy msgid "`v4.0.0 `__" -msgstr "从`v3.4.0 `__ 开始" - -#, fuzzy -msgid "See also" -msgstr "另请参阅" +msgstr "`v4.0.0 `__" -#, fuzzy msgid ":doc:`pgr_dijkstra`" -msgstr ":doc:`pgr_dijkstra`:" +msgstr ":doc:`pgr_dijkstra`" msgid ":doc:`pgr_trsp`" msgstr ":doc:`pgr_trsp`" @@ -5357,16 +5486,15 @@ msgstr "迁移 ``pgr_trsp`` （边）" msgid ":doc:`pgr_withPoints`" msgstr ":doc:`pgr_withPoints`" -#, fuzzy msgid ":doc:`pgr_trsp_withPoints`" -msgstr ":doc:`pgr_trsp_withPoints`:" +msgstr ":doc:`pgr_trsp_withPoints`" #, fuzzy msgid "Use ``pgr_withPoints`` when there are no restrictions." msgstr ":doc:`pgr_withPoints` 当没有任何限制的时候，" #, fuzzy -msgid "Use :doc:`pgr_withPoints` (Ont to One) instead." +msgid "Use :doc:`pgr_withPoints` (One to One) instead." msgstr "请改用 :doc:`pgr_trsp` (一对一）。" #, fuzzy @@ -7704,8 +7832,8 @@ msgstr "Boost C++ 源库位于 https://www.boost.org。" msgid ":doc:`migration`" msgstr ":doc:`migration`" -msgid "pgr_KSP" -msgstr "pgr_KSP" +msgid "``pgr_KSP``" +msgstr "``pgr_KSP``" msgid "``pgr_KSP`` — Yen's algorithm for K shortest paths using Dijkstra." msgstr "``pgr_KSP`` — Yen 使用 Dijkstra 计算 K 最短路径的算法。" @@ -7713,32 +7841,39 @@ msgstr "``pgr_KSP`` — Yen 使用 Dijkstra 计算 K 最短路径的算法。" msgid "Availability" msgstr "可用性" +#, fuzzy +msgid "Version 4.0.0" +msgstr "版本2.0.0" + +msgid "All signatures promoted to official." +msgstr "" + msgid "Version 3.6.0" msgstr "版本3.6.0" msgid "Result columns standarized to: |nksp-result|" msgstr "结果列标准化为 |nksp-result|" -msgid "``pgr_ksp`` (One to One)" -msgstr "``pgr_ksp`` (一对一)" +msgid "pgr_ksp(One to One)" +msgstr "pgr_ksp(一对一)" msgid "Added ``start_vid`` and ``end_vid`` result columns." msgstr "增加 ``start_vid`` 和 ``end_vid`` 结果列。" -msgid "New overload functions:" -msgstr "新的重载函数：" +msgid "New proposed signatures:" +msgstr "新拟议的签名：" -msgid "``pgr_ksp`` (One to Many)" -msgstr "``pgr_ksp`` (一对多)" +msgid "pgr_ksp(One to Many)" +msgstr "pgr_ksp(一对多)" -msgid "``pgr_ksp`` (Many to One)" -msgstr "``pgr_ksp`` (多对一)" +msgid "pgr_ksp(Many to One)" +msgstr "pgr_ksp(多对一)" -msgid "``pgr_ksp`` (Many to Many)" -msgstr "``pgr_ksp`` (多对多)" +msgid "pgr_ksp(Many to Many)" +msgstr "pgr_ksp(多对多)" -msgid "``pgr_ksp`` (Combinations)" -msgstr "``pgr_ksp`` (组合)" +msgid "pgr_ksp(Combinations)" +msgstr "pgr_ksp(组合)" msgid "Version 2.1.0" msgstr "版本2.1.0" @@ -7752,14 +7887,20 @@ msgstr "不再支持旧签名" msgid "Version 2.0.0" msgstr "版本2.0.0" -msgid "**Official** function" -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." msgstr "基于Yen算法的K最短路径路由算法。 “K”是所需的最短路径的数量。" +msgid "|Boost| Boost Graph Inside" +msgstr "|Boost| Boost 图内部" + +msgid "Boost Graph Inside" +msgstr "Boost 图内部" + msgid "Signatures" msgstr "签名" @@ -8127,6 +8268,14 @@ msgstr "``pgr_TSPeuclidean``" msgid "``pgr_TSPeuclidean`` - Aproximation using *metric* algorithm." msgstr "``pgr_TSPeuclidean`` -使用*metric*算法进行近似。" +#, fuzzy +msgid "" +"Using `Boost: metric TSP approx `__" +msgstr "" +"`Boost 的 metric appro 的 metric 近似 `__" + msgid "" "The Simulated Annealing Algorithm related parameters are ignored: " "`max_processing_time`, `tries_per_temperature`, " @@ -8144,8 +8293,9 @@ msgstr "版本3.0.0" msgid "Name change from pgr_eucledianTSP" msgstr "pgr_eucledianTSP 的名称更改" -msgid "New **Official** function" -msgstr "新函数 **Official**" +#, fuzzy +msgid "New official function." +msgstr "新函数 official。" msgid "" "Any duplicated identifier will be ignored. The coordinates that will be kept" @@ -8230,57 +8380,53 @@ msgstr "" "从视觉上看，第一幅图像是 `最优解 `__ ，第二幅图像是使用 ``pgr_TSPeuclidean`` 获得的解。" -msgid ":doc:`sampledata` network." -msgstr ":doc:`sampledata` 网络。" - msgid "``pgr_aStar``" msgstr "``pgr_aStar``" msgid "``pgr_aStar`` — Shortest path using the A* algorithm." msgstr "``pgr_aStar`` —使用 A* 算法的最短路径。" +msgid "Combinations signature promoted to official." +msgstr "" + msgid "Standarizing output columns to |short-generic-result|" msgstr "标准输出列|short-generic-result|" -msgid "" -"``pgr_aStar`` (`One to One`_) added ``start_vid`` and ``end_vid`` columns." -msgstr "``pgr_aStar`` (`一对一`_) 增加 ``start_vid`` 和 ``end_vid`` 列." +#, fuzzy +msgid "pgr_aStar(One to One) added ``start_vid`` and ``end_vid`` columns." +msgstr "``pgr_aStar`` （`一对一`）增加了 ``start_vid`` 和 ``end_vid`` 列。" -msgid "``pgr_aStar`` (`One to Many`_) added ``end_vid`` column." -msgstr "``pgr_aStar`` (`一对多`_) 增加 ``end_vid`` 列." +msgid "pgr_aStar(One to Many) added ``end_vid`` column." +msgstr "pgr_aStar(一对多）添加了 ``end_vid`` 列。" -msgid "``pgr_aStar`` (`Many to One`_) added ``start_vid`` column." -msgstr "``pgr_aStar`` (`多对一`_) 增加 ``start_vid`` 列." +msgid "pgr_aStar(Many to One) added ``start_vid`` column." +msgstr "pgr_aStar(多对一）添加了 ``start_vid`` 列。" msgid "Version 3.2.0" msgstr "版本3.2.0" -msgid "New **proposed** signature:" -msgstr "新 **拟议** 的签名：" +#, fuzzy +msgid "New proposed signature:" +msgstr "新拟议的签名：" -msgid "``pgr_aStar`` (`Combinations`_)" -msgstr "``pgr_aStar`` (`组合`_)" +msgid "Function promoted to official." +msgstr "" msgid "Version 2.4.0" msgstr "版本2.4.0" -msgid "New **Proposed** signatures:" -msgstr "新 **拟议** 签名：" - -msgid "``pgr_aStar`` (`One to Many`_)" -msgstr "``pgr_aStar`` (`一对多`_)" - -msgid "``pgr_aStar`` (`Many to One`_)" -msgstr "``pgr_aStar`` (`多对一`_)" +msgid "pgr_aStar(One to Many)" +msgstr "pgr_aStar(一对多）" -msgid "``pgr_aStar`` (`Many to Many`_)" -msgstr "``pgr_aStar`` (`多对多`_)" +msgid "pgr_aStar(Many to One)" +msgstr "pgr_aStar(多对一）" -msgid "Signature change on ``pgr_astar`` (`One to One`_)" -msgstr "签名更改 ``pgr_astar`` (`一对一`_)" +msgid "pgr_aStar(Many to Many)" +msgstr "pgr_aStar(多对多）" -msgid "**Official** ``pgr_aStar`` (`One to One`_)" -msgstr "**官方** ``pgr_aStar`` (`一对一`_)" +#, fuzzy +msgid "Signature change on pgr_aStar(One to One)" +msgstr "签名更改 pgr_aStar(一对一)" msgid "" "The results are equivalent to the union of the results of the `pgr_aStar(` " @@ -8361,18 +8507,15 @@ msgstr "示例3" msgid "Manually assigned vertex combinations." msgstr "手动指定的顶点组合。" -msgid "pgr_aStarCost" -msgstr "pgr_aStarCost" +msgid "``pgr_aStarCost``" +msgstr "``pgr_aStarCost``" msgid "" "``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." msgstr "``pgr_aStarCost`` - 使用 A* 算法计算最短路径的总成本。" -msgid "``pgr_aStarCost`` (`Combinations`_)" -msgstr "``pgr_aStarCost`` (`组合`_)" - -msgid "New **proposed** function" -msgstr "新 **拟议** 函数" +msgid "New proposed function." +msgstr "新提议的函数。" msgid "" "The ``pgr_aStarCost`` function sumarizes of the cost of the shortest path " @@ -8573,8 +8716,8 @@ msgstr ":doc:`pgr_drivingDistance`" msgid "`ST_ConcaveHull `__" msgstr "`ST_ConcaveHull `__" -msgid "pgr_analyzeGraph" -msgstr "pgr_analyzeGraph" +msgid "``pgr_analyzeGraph``" +msgstr "``pgr_analyzeGraph``" msgid "``pgr_analyzeGraph`` — Analyzes the network topology." msgstr "``pgr_analyzeGraph`` —分析网络拓扑。" @@ -8849,9 +8992,6 @@ msgstr "" "选择几何图形靠近表 ``othertable`` 的 place='myhouse' 的行。 （注意 " "quote_literal 的使用）" -msgid "The examples use the :doc:`sampledata` network." -msgstr "这些示例使用 :doc:`sampledata` 网络。" - msgid ":doc:`pgr_analyzeOneWay`" msgstr ":doc:`pgr_analyzeOneWay`" @@ -8861,8 +9001,8 @@ msgstr ":doc:`pgr_createVerticesTable`" msgid ":doc:`pgr_nodeNetwork` to create nodes to a not noded edge table." msgstr ":doc:`pgr_nodeNetwork` 创建节点到非节点边表。" -msgid "pgr_analyzeOneWay" -msgstr "pgr_analyzeOneWay" +msgid "``pgr_analyzeOneWay``" +msgstr "``pgr_analyzeOneWay``" msgid "" "``pgr_analyzeOneWay`` — Analyzes oneway Sstreets and identifies flipped " @@ -9037,8 +9177,8 @@ msgstr "结果列更改：删除了 ``seq``" msgid "Version 2.5.0" msgstr "版本2.5.0" -msgid "New **experimental** function" -msgstr "新 **实验** 函数" +msgid "New experimental function." +msgstr "新实验功能。" msgid "" "Those vertices that belong to more than one biconnected component are called " @@ -9070,8 +9210,9 @@ msgstr "图表的连接点" msgid "Nodes in red are the articulation points." msgstr "红色节点是关节点。" +#, fuzzy msgid "" -"Boost: `Biconnected components & articulation points `__" msgstr "" "Boost: `双连通分量和关节点 `__" +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" -msgid "``pgr_betweennessCentrality``" +#, fuzzy +msgid "``pgr_betweennessCentrality`` - Experimental" msgstr "``pgr_betweennessCentrality``" +#, fuzzy msgid "" -"``pgr_betweennessCentrality`` - Calculates the relative betweeness " +"``pgr_betweennessCentrality`` - Calculates the relative betweenness " "centrality using Brandes Algorithm" msgstr "``pgr_betweennessCentrality`` - 使用 Brandes 算法计算相对介数中心度" msgid "Version 3.7.0" msgstr "版本 3.7.0" -msgid "New **experimental** function:" -msgstr "新的 **实验** 函数：" - msgid "" "The Brandes Algorithm takes advantage of the sparse graphs for evaluating " "the betweenness centrality score of all vertices." @@ -9561,16 +9669,14 @@ msgid "" "Relative betweenness centrality score of the vertex (will be in range [0,1])" msgstr "该节点的相对介数中心性得分（范围为 [0,1]）" +#, fuzzy msgid "" -"Boost's `betweenness_centrality `_" +"`Boost: betweenness centrality `_" msgstr "" -"Boost's `betweenness_centrality `_" -msgid "Queries use the :doc:`sampledata` network." -msgstr "查询使用 :doc:`sampledata` 网络。" - msgid "``pgr_biconnectedComponents``" msgstr "``pgr_biconnectedComponents``" @@ -9630,13 +9736,6 @@ msgstr "具有组件中最小边标识符的值。" msgid "Identifier of the edge that belongs to the ``component``." msgstr "属于该 ``分量`` 的边的标识符。" -msgid "" -"Boost: `Biconnected components `__" -msgstr "" -"Boost: `双连通分量 `__" - msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" msgstr "``pgr_binaryBreadthFirstSearch`` - 实验" @@ -9650,20 +9749,8 @@ msgid "" "negative integer, is termed as a 'binary graph'." msgstr "任何边权属于集合 {0,X} 的图（其中“X”是任何非负整数）都被称为“二元图”。" -msgid "pgr_binaryBreadthFirstSearch(`Combinations`_)" -msgstr "pgr_binaryBreadthFirstSearch(`组合`_)" - -msgid "pgr_binaryBreadthFirstSearch(`One to One`_)" -msgstr "pgr_binaryBreadthFirstSearch(`一对一`_)" - -msgid "pgr_binaryBreadthFirstSearch(`One to Many`_)" -msgstr "pgr_binaryBreadthFirstSearch(`一对多`_)" - -msgid "pgr_binaryBreadthFirstSearch(`Many to One`_)" -msgstr "pgr_binaryBreadthFirstSearch(`多对一`_)" - -msgid "pgr_binaryBreadthFirstSearch(`Many to Many`_)" -msgstr "pgr_binaryBreadthFirstSearch(`多对多`_)" +msgid "pgr_binaryBreadthFirstSearch(Combinations)" +msgstr "pgr_binaryBreadthFirstSearch(组合)" msgid "" "It is well-known that the shortest paths between a single source and all " @@ -9746,6 +9833,14 @@ msgid "" msgstr "" "**注意:** 使用 :doc:`sampledata` 网络，因为所有权重都相同（即为 :math:`1`）" +#, fuzzy +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" @@ -9754,7 +9849,8 @@ msgid "" msgstr "" "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" -msgid "pgr_bipartite -Experimental" +#, fuzzy +msgid "``pgr_bipartite`` - Experimental" msgstr "pgr_bipartite -实验" msgid "" @@ -9762,9 +9858,6 @@ msgid "" "within the same set are adjacent." msgstr "`pgr_bipartite` - 不相邻的顶点集合，同一集合中没有两个顶点相邻。" -msgid "New **experimental** signature" -msgstr "新的 **实验** 签名" - msgid "" "A bipartite graph is a graph with two sets of vertices which are connected " "to each other, but not within themselves. A bipartite graph is possible if " @@ -9818,31 +9911,35 @@ msgstr "" msgid "Edges in blue represent odd length cycle subgraph." 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 " +"`Boost: is_bipartite `__" +msgstr "" +"`Boost: is_bipartite `__" + +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 "New **proposed** signature" -msgstr "新的 **拟议** 签名" - -msgid "``pgr_boykovKolmogorov`` (`Combinations`_)" -msgstr "``pgr_boykovKolmogorov`` (`组合`_)" - msgid "Renamed from ``pgr_maxFlowBoykovKolmogorov``" msgstr "从 ``pgr_maxFlowBoykovKolmogorov`` 更名而来" -msgid "**Proposed** function" -msgstr "**拟议** 函数" - -msgid "New **Experimental** function" -msgstr "新的 **实验** 函数" +#, fuzzy +msgid "Function promoted to proposed." +msgstr "实验性的功能被提升为提议的。" msgid "Running time: Polynomial" msgstr "运行时间：多项式时间" @@ -9885,7 +9982,10 @@ msgstr "" "使用组合表，相当于计算从顶点 :math:`\\{5, 6\\}` 到顶点 :math:`{\\10, 15, " "14\\}` 的结果。" -msgid "https://www.boost.org/libs/graph/doc/boykov_kolmogorov_max_flow.html" +#, fuzzy +msgid "" +"`Boost: Boykov Kolmogorov max flow `__" msgstr "https://www.boost.org/libs/graph/doc/boykov_kolmogorov_max_flow.html" msgid "``pgr_breadthFirstSearch`` - Experimental" @@ -9896,12 +9996,6 @@ msgid "" "First Search algorithm." msgstr "``pgr_breadthFirstSearch`` — 使用广度优先搜索算法返回遍历顺序。" -msgid "``pgr_breadthFirstSearch`` (`Single Vertex`_)" -msgstr "``pgr_breadthFirstSearch`` (`单顶点搜索`_)" - -msgid "``pgr_breadthFirstSearch`` (`Multiple Vertices`_)" -msgstr "``pgr_breadthFirstSearch`` (`多顶点搜索`_)" - msgid "" "Provides the Breadth First Search traversal order from a root vertex to a " "particular depth." @@ -9970,13 +10064,6 @@ msgstr "升序" msgid "descending" msgstr "降序" -msgid "" -"`Boost: Breadth First Search algorithm documentation `__" -msgstr "" -"`Boost：广度优先搜索算法文档 `__" - msgid "" "`Wikipedia: Breadth First Search algorithm `__" @@ -10019,8 +10106,13 @@ msgstr "作为桥的边的标识符。" msgid "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" msgstr "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" -msgid "**Supported versions**" -msgstr "**支持版本**" +#, fuzzy +msgid "" +"`Boost: Connected components `__" +msgstr "" +"Boost: ` 已连接组件 `__" msgid "``pgr_chinesePostman`` - Experimental" msgstr "``pgr_chinesePostman`` - 实验" @@ -10083,8 +10175,8 @@ msgstr "``pgr_chinesepostmancost``" msgid "Minimum costs of a circuit path." msgstr "一个回路路径的最小成本。" -msgid "pgr_connectedComponents" -msgstr "pgr_connectedComponents" +msgid "``pgr_connectedComponents``" +msgstr "``pgr_connectedComponents``" msgid "" "``pgr_connectedComponents`` — Connected components of an undirected graph " @@ -10122,13 +10214,6 @@ msgstr "属于该 ``组件`` 的顶点的标识符。" msgid "Connecting disconnected components" msgstr "连接不连通的组件" -msgid "" -"Boost: `Connected components `__" -msgstr "" -"Boost: ` 已连接组件 `__" - msgid "" "wikipedia: `Connected component `__" @@ -10310,8 +10395,8 @@ msgstr "仅死端收缩" msgid "Only linear contraction" msgstr "仅线性收缩" -msgid "pgr_createTopology" -msgstr "pgr_createTopology" +msgid "``pgr_createTopology``" +msgstr "``pgr_createTopology``" msgid "" "``pgr_createTopology`` — Builds a network topology based on the geometry " @@ -10530,11 +10615,8 @@ msgid "" "to the rest of the edges." msgstr "该示例以 5 条边的简洁拓扑结构为起点，然后递增到其余的边。" -msgid "The example uses the :doc:`sampledata` network." -msgstr "本例使用 :doc:`sampledata` 网络。" - -msgid "pgr_createVerticesTable" -msgstr "pgr_createVerticesTable" +msgid "``pgr_createVerticesTable``" +msgstr "``pgr_createVerticesTable``" msgid "" "``pgr_createVerticesTable`` — Reconstructs the vertices table based on the " @@ -10773,7 +10855,8 @@ msgstr "" "`Wikipedia: Cuthill-McKee 排序 `__" -msgid "pgr_dagShortestPath - Experimental" +#, fuzzy +msgid "``pgr_dagShortestPath`` - Experimental" msgstr "pgr_dagShortestPath - 实验" msgid "" @@ -10859,6 +10942,14 @@ msgstr "返回列" msgid "Making **start_vids** the same as **end_vids**" msgstr "使 **start_vids** 与 **end_vids** 相同" +#, fuzzy +msgid "" +"`Boost: DAG shortest paths `__" +msgstr "" +"`Boost: is_bipartite `__" + msgid "https://en.wikipedia.org/wiki/Topological_sorting" msgstr "https://en.wikipedia.org/wiki/Topological_sorting" @@ -10985,15 +11076,6 @@ msgstr "" msgid "Version 3.3.0" msgstr "版本 3.3.0" -msgid "Promoted to **proposed** function" -msgstr "升级至 **拟议** 函数" - -msgid "``pgr_depthFirstSearch`` (`Single Vertex`_)" -msgstr "``pgr_depthFirstSearch`` (`单个顶点`_)" - -msgid "``pgr_depthFirstSearch`` (`Multiple Vertices`_)" -msgstr "``pgr_depthFirstSearch`` (`多个顶点`_)" - msgid "" "Depth First Search algorithm is a traversal algorithm which starts from a " "root vertex, goes as deep as possible, and backtracks once a vertex is " @@ -11049,16 +11131,18 @@ msgstr "**options:** ``[directed, max_depth]``" msgid "Same as `Single vertex`_ but with edges in descending order of ``id``." msgstr "与 `单顶点`_ 相同，但边按 ``id`` 降序排列。" +#, fuzzy msgid "" -"`Boost: Depth First Search algorithm documentation `__" +"`Boost: Depth First Search `__" msgstr "" "`Boost：深度优先搜索算法文档 `__" +#, fuzzy msgid "" -"`Boost: Undirected DFS algorithm documentation `__" +"`Boost: Undirected DFS `__" msgstr "" "`Boost：非定向 DFS 算法文档 `__" @@ -11079,46 +11163,34 @@ msgstr "`pgr_dijkstra`` - 使用 Dijkstra 算法计算的最短路径。" msgid "Version 3.5.0" msgstr "版本 3.5.0" -msgid "" -"``pgr_dijkstra`` (`One to One`_) added ``start_vid`` and ``end_vid`` columns." -msgstr "``pgr_dijkstra`` (`一对一`_)增加``start_vid`` 和``end_vid`` 列。" +msgid "pgr_dijkstra(One to One) added ``start_vid`` and ``end_vid`` columns." +msgstr "pgr_dijkstra（一对一）增加了``start_vid`` 和``end_vid`` 列。" -msgid "``pgr_dijkstra`` (`One to Many`_) added ``end_vid`` column." -msgstr "``pgr_dijkstra`` (`一对多`_) 增加``end_vid`` 列。" +msgid "pgr_dijkstra(One to Many) added ``end_vid`` column." +msgstr "pgr_dijkstra（一对多）添加了 ``end_vid`` 列。" -msgid "``pgr_dijkstra`` (`Many to One`_) added ``start_vid`` column." -msgstr "``pgr_dijkstra`` (`多对一`_) 增加 ``start_vid`` 列。" +msgid "pgr_dijkstra(Many to One) added ``start_vid`` column." +msgstr "pgr_dijkstra（多对一）添加了 ``start_vid`` 列。" msgid "Version 3.1.0" msgstr "版本 3.1.0" -msgid "``pgr_dijkstra`` (`Combinations`_)" -msgstr "``pgr_dijkstra`` (`组合`_)" - -msgid "**Official** functions" -msgstr "**官方** 函数" - msgid "Version 2.2.0" msgstr "版本 2.2.0" -msgid "New **proposed** functions:" -msgstr "新的 **拟议** 函数：" - -msgid "``pgr_dijkstra`` (`One to Many`_)" -msgstr "``pgr_dijkstra`` (`一对多`_)" +msgid "pgr_dijkstra(One to Many)" +msgstr "pgr_dijkstra(一对多)" -msgid "``pgr_dijkstra`` (`Many to One`_)" -msgstr "``pgr_dijkstra`` (`多对一`_)" +msgid "pgr_dijkstra(Many to One)" +msgstr "pgr_dijkstra(多对一)" -msgid "``pgr_dijkstra`` (`Many to Many`_)" -msgstr "``pgr_dijkstra`` (`多对多`_)" +msgid "pgr_dijkstra(Many to Many)" +msgstr "pgr_dijkstra（多对多）" -msgid "Signature change on ``pgr_dijkstra`` (`One to One`_)" +#, fuzzy +msgid "Signature change on pgr_dijkstra(One to One)" msgstr "``pgr_dijkstra`` (`一对一`_)的签名更改" -msgid "**Official** ``pgr_dijkstra`` (`One to One`_)" -msgstr "**官方** ``pgr_dijkstra`` (`一对一`_)" - msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" @@ -11304,6 +11376,14 @@ msgstr "36) 使用 `多对多`_" msgid "37) Using `Combinations`_" msgstr "37) 使用 `组合`_" +#, fuzzy +msgid "" +"`Boost: Dijkstra shortest paths `__" +msgstr "" +"`Boost: is_bipartite `__" + msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgstr "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" @@ -11315,9 +11395,6 @@ msgid "" "algorithm." msgstr "`pgr_dijkstraCost`` - 使用 Dijkstra 算法计算最短路径的总成本。" -msgid "``pgr_dijkstraCost`` (`Combinations`_)" -msgstr "``pgr_dijkstraCost`` (`组合`_)" - msgid "" "The ``pgr_dijkstraCost`` function sumarizes of the cost of the shortest path " "using Dijkstra Algorithm." @@ -11630,9 +11707,6 @@ msgstr "``true`` 时：仅返回 ``cap`` 结果" msgid "When ``false``: ``cap`` limit per ``Start vid`` will be returned" msgstr "当 ``false`` 时：将返回每个 ``Start vid`` 的 ``cap`` 限值" -msgid "boost: https://www.boost.org/libs/graph/doc/table_of_contents.html" -msgstr "boost: https://www.boost.org/libs/graph/doc/table_of_contents.html" - msgid "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgstr "维基百科：https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" @@ -11828,14 +11902,17 @@ msgstr "结果列名称更改： ``from_v``改为 ``start_vid``。" msgid "Added ``depth`` and ``pred`` result columns." msgstr "添加了 ``depth`` 和``pred`` 结果列。" -msgid "Signature change pgr_drivingDistance(single vertex)" -msgstr "签名更改 pgr_drivingDistance（单顶点）" +msgid "Signature change:" +msgstr "签名变更：" -msgid "New **Official** pgr_drivingDistance(multiple vertices)" -msgstr "新 **官方** pgr_drivingDistance(多顶点)" +msgid "pgr_drivingDistance(single vertex)" +msgstr "pgr_drivingDistance （单顶点）" -msgid "Official:: pgr_drivingDistance(single vertex)" -msgstr "官方:: pgr_drivingDistance(单顶点)" +msgid "New official signature:" +msgstr "新签名：" + +msgid "pgr_drivingDistance(multiple vertices)" +msgstr "pgr_drivingDistance （多顶点）" msgid "" "Using the Dijkstra algorithm, extracts all the nodes that have costs less " @@ -11895,7 +11972,8 @@ msgid "" "undirected graph" msgstr "在无向图上，从顶点 :math:`{11, 16\\}` 开始的距离为 :math:`3.0`" -msgid "pgr_edgeColoring - Experimental" +#, fuzzy +msgid "``pgr_edgeColoring`` - Experimental" msgstr "pgr_edgeColoring - 实验" msgid "" @@ -11975,6 +12053,18 @@ msgstr "Returns set of |result-edge-color|" msgid "Graph coloring of pgRouting :doc:`sampledata`" msgstr "pgRouting :doc:`sampledata` 的图形着色" +#, fuzzy +msgid "" +"`Boost: Edge Coloring `__" +msgstr "" +"`Boost：边缘着色算法文档 `__" + +msgid "" +"`Wikipedia: Graph coloring `__" +msgstr "`维基百科：图着色 `__" + msgid "``pgr_edgeDisjointPaths``" msgstr "``pgr_edgeDisjointPaths``" @@ -11983,9 +12073,6 @@ msgid "" "groups of vertices." msgstr "``pgr_edgeDisjointPaths`` - 计算两组顶点之间的边不相交路径。" -msgid "New **proposed** function:" -msgstr "新的 **拟议** 函数：" - msgid "pgr_edgeDisjointPaths(Combinations)" msgstr "pgr_edgeDisjointPaths(组合)" @@ -12080,9 +12167,6 @@ msgstr "" "``pgr_edmondsKarp`` —使用 Edmonds Karp 算法计算图边上的流量，以最大化从源到目" "标的流量。" -msgid "``pgr_edmondsKarp`` (`Combinations`_)" -msgstr "``pgr_edmondsKarp`` (`组合`_)" - msgid "Renamed from ``pgr_maxFlowEdmondsKarp``" msgstr "从 ``pgr_maxFlowEdmondsKarp`` 更名而来" @@ -12104,33 +12188,25 @@ msgstr "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vids**)" msgid "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" msgstr "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" -msgid "https://www.boost.org/libs/graph/doc/edmonds_karp_max_flow.html" +#, fuzzy +msgid "" +"`Boost: Edmonds Karp max flow `__" msgstr "https://www.boost.org/libs/graph/doc/edmonds_karp_max_flow.html" msgid "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" msgstr "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" -msgid "``pgr_edwardMoore - Experimental``" -msgstr "``pgr_edwardMoore - 实验``" +#, fuzzy +msgid "``pgr_edwardMoore`` - Experimental" +msgstr "``pgr_edwardMoore`` - 实验" msgid "" "``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore algorithm." msgstr "`pgr_edwardMoore`` - 使用 Edward-Moore 算法返回最短路径。" -msgid "``pgr_edwardMoore`` (`Combinations`_)" -msgstr "``pgr_edwardMoore`` (`组合`_)" - -msgid "``pgr_edwardMoore`` (`One to One`_)" -msgstr "``pgr_edwardMoore`` (`一对一`_)" - -msgid "``pgr_edwardMoore`` (`One to Many`_)" -msgstr "``pgr_edwardMoore`` (`一对多`_)" - -msgid "``pgr_edwardMoore`` (`Many to One`_)" -msgstr "``pgr_edwardMoore`` (`多对一`_)" - -msgid "``pgr_edwardMoore`` (`Many to Many`_)" -msgstr "``pgr_edwardMoore`` (`多对多`_)" +msgid "pgr_edwardMoore(Combinations)" +msgstr "pgr_edwardMoore(组合)" msgid "" "Edward Moore’s Algorithm is an improvement of the Bellman-Ford Algorithm. It " @@ -12203,8 +12279,8 @@ msgstr "pgr_edwardMoore(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgid "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" msgstr "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" -msgid "pgr_extractVertices -- Proposed" -msgstr "pgr_extractVertices -- 拟议" +msgid "``pgr_extractVertices`` -- Proposed" +msgstr "``pgr_extractVertices`` -- 拟议" msgid "``pgr_extractVertices`` — Extracts the vertices information" msgstr "``pgr_extractVertices`` — 提取顶点信息" @@ -12310,21 +12386,12 @@ msgid "" "= true``." msgstr "要获取用于生成顶点信息的查询，请使用 ``dryrun := true``。" -msgid "``pgr_findCloseEdges``" -msgstr "``pgr_findCloseEdges``" +msgid "``pgr_findCloseEdges`` - Proposed" +msgstr "``pgr_findCloseEdges``- 拟议" msgid "``pgr_findCloseEdges`` - Finds the close edges to a point geometry." msgstr "``pgr_findCloseEdges`` -查找点几何图形的闭合边。" -msgid "New **proposed** signatures:" -msgstr "新的 **拟议** 签名：" - -msgid "``pgr_findCloseEdges`` (`One point`_)" -msgstr "``pgr_findCloseEdges`` (`一个点`_)" - -msgid "``pgr_findCloseEdges`` (`Many points`_)" -msgstr "``pgr_findCloseEdges`` (`多个点`_)" - msgid "" "``pgr_findCloseEdges`` - An utility function that finds the closest edge to " "a point geometry." @@ -12339,6 +12406,7 @@ msgid "" "adjustments needed by the application." msgstr "可以获取计算代码，以便根据应用需要进行进一步的具体调整。" +#, fuzzy msgid "``EMTPY SET`` is returned on dryrun executions" msgstr "空运行执行时返回 ``EMTPY SET``" @@ -12835,9 +12903,6 @@ msgstr "" "Boost `floyd-Warshall `_" -msgid "Queries uses the :doc:`sampledata` network." -msgstr "查询使用 :doc:`sampledata` 网络。" - msgid "``pgr_full_version``" msgstr "``pgr_full_version``" @@ -12845,9 +12910,6 @@ msgid "" "``pgr_full_version`` — Get the details of pgRouting version information." msgstr "``pgr_full_version`` — 获取pgRouting版本信息的详细信息。." -msgid "New **official** function" -msgstr "新函数 **official**" - msgid "Get complete details of pgRouting version information" msgstr "获取 pgRouting 版本信息的完整详细信息" @@ -12914,7 +12976,8 @@ msgstr "``hash``" msgid "Git hash of pgRouting build" msgstr "pgRouting 构建的 Git 哈希" -msgid "``pgr_hawickCircuits - Experimental``" +#, fuzzy +msgid "``pgr_hawickCircuits`` - Experimental" msgstr "``pgr_hawickCircuits - 实验``" msgid "" @@ -12922,9 +12985,6 @@ msgid "" "algorithm." msgstr "``pgr_hawickCircuits`` — 使用 Hawick 回路算法返回回路列表。" -msgid "``pgr_hawickCircuits``" -msgstr "``pgr_hawickCircuits``" - msgid "" "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. " "James. This algorithm solves the problem of detecting and enumerating " @@ -13065,7 +13125,10 @@ msgstr "" "新图不是平面图，因为它具有一个 :math:`K_5` 子图。蓝色的边代表 :math:`K_5` 子" "图。" -msgid "https://www.boost.org/libs/graph/doc/boyer_myrvold.html" +#, fuzzy +msgid "" +"`Boost: Boyer Myrvold `__" msgstr "https://www.boost.org/libs/graph/doc/boyer_myrvold.html" msgid "``pgr_johnson``" @@ -13210,8 +13273,9 @@ msgstr "pgr_kruskalDFS(`Edges SQL`_, **root vid**, [``max_depth``])" msgid "pgr_kruskalDFS(`Edges SQL`_, **root vids**, [``max_depth``])" msgstr "pgr_kruskalDFS(`Edges SQL`_, **root vids**, [``max_depth``])" -msgid "pgr_lengauerTarjanDominatorTree -Experimental" -msgstr "pgr_lengauerTarjanDominatorTree -实验" +#, fuzzy +msgid "``pgr_lengauerTarjanDominatorTree`` - Experimental" +msgstr "``pgr_lengauerTarjanDominatorTree`` - 实验" msgid "" "``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all " @@ -13269,11 +13333,12 @@ msgstr "顶点的直接支配者。" msgid "Dominator tree of another component." msgstr "另一个组件的支配树。" +#, fuzzy msgid "" -"`Boost: Lengauer-Tarjan dominator tree algorithm `__" +"`Boost: Lengauer-Tarjan dominator `__" msgstr "" -"`BOOST：Languer-Tarzan 支配树算法 `__" msgid "" @@ -13282,17 +13347,14 @@ msgid "" msgstr "" "`维基百科:支配树 `__" -msgid "pgr_lineGraph - Proposed" -msgstr "pgr_lineGraph - 提议" +msgid "``pgr_lineGraph`` - Proposed" +msgstr "``pgr_lineGraph`` - 提议" msgid "" "``pgr_lineGraph`` — Transforms the given graph into its corresponding edge-" "based graph." msgstr "``pgr_lineGraph`` — 将给定图转换为其相应的基于边的图。" -msgid "Promoted to **proposed** signature." -msgstr "晋升为**proposed** 签名。" - msgid "Works for directed and undirected graphs." msgstr "适用于有向和无向图。" @@ -13576,9 +13638,9 @@ msgstr "返回 |result-linegf| 的集合" msgid "Full line graph of subgraph of edges :math:`\\{4, 7, 8, 10\\}`" msgstr "边 :math:`\\{4, 7, 8, 10\\}` 子图的全线图" +#, fuzzy msgid "" -"The examples of this section are based on the :doc:`sampledata` network. The " -"examples include the subgraph including edges 4, 7, 8, and 10 with " +"The examples include the subgraph including edges 4, 7, 8, and 10 with " "``reverse_cost``." msgstr "" "本节的示例基于 :doc:`sampledata` 网络。 这些示例包括包含具有 " @@ -13812,30 +13874,36 @@ msgstr "pgr_makeConnected(`Edges SQL`_)" msgid "Returns set of |result-component-make|" msgstr "Returns set of |result-component-make|" -msgid "" -"Query done on :doc:`sampledata` network gives the list of edges that are " -"needed to connect the graph." +#, fuzzy +msgid "List of edges that are needed to connect the graph." msgstr "在 :doc:`sampledata` 网络上完成的查询给出了连接图所需的边列表。" -msgid "https://www.boost.org/libs/graph/doc/make_connected.html" +#, fuzzy +msgid "" +"`Boost: make connected `__" msgstr "https://www.boost.org/libs/graph/doc/make_connected.html" -msgid "pgr_maxCardinalityMatch" -msgstr "pgr_maxCardinalityMatch" +msgid "``pgr_maxCardinalityMatch``" +msgstr "``pgr_maxCardinalityMatch``" msgid "" "``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a " "graph." msgstr "``pgr_maxCardinalityMatch`` — 计算图中的最大基数匹配。." +#, fuzzy +msgid "pgr_maxCardinalityMatch(text) returns only ``edge`` column." +msgstr "``pgr_maxCardinalityMatch(text)`` 仅仅返回``边`` 列." + msgid "Deprecated signature" msgstr "已弃用的签名" -msgid "``pgr_maxCardinalityMatch(text,boolean)``" -msgstr "``pgr_maxCardinalityMatch(text,boolean)``" +msgid "pgr_maxCardinalityMatch(text,boolean)" +msgstr "pgr_maxCardinalityMatch(text,boolean)" -msgid "``directed => false`` when used." -msgstr "使用时 ``directed => false``。" +msgid "directed => ``false`` when used." +msgstr "使用时 directed => ``false``。" msgid "Renamed from ``pgr_maximumCardinalityMatching``" msgstr "从 ``pgr_maximumCardinalityMatching`` 重命名" @@ -13885,7 +13953,10 @@ msgstr "正值表示存在边(``target``, ``source``)" msgid "Identifier of the edge in the original query." msgstr "原始查询中边的标识符。" -msgid "https://www.boost.org/libs/graph/doc/maximum_matching.html" +#, fuzzy +msgid "" +"`Boost: maximum_matching `__" msgstr "https://www.boost.org/libs/graph/doc/maximum_matching.html" msgid "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" @@ -13903,12 +13974,6 @@ msgid "" msgstr "" "``pgr_maxFlow`` — 使用 Push Relabel 算法计算有向图中从源到目标的最大流量。" -msgid "``pgr_maxFlow`` (`Combinations`_)" -msgstr "``pgr_maxFlow`` (`组合`_)" - -msgid "New **Proposed** function" -msgstr "新 **拟议** 的函数" - msgid "Calculates the maximum flow from the sources to the targets." msgstr "计算从源头到目标的最大流量。" @@ -13943,7 +14008,10 @@ msgstr "RETURNS ``BIGINT``" msgid "Maximum flow possible from the source(s) to the target(s)" msgstr "从 source(s)到 target(s)的可能最大流量" -msgid "https://www.boost.org/libs/graph/doc/push_relabel_max_flow.html" +#, fuzzy +msgid "" +"`Boost: push relabel max flow `__" msgstr "https://www.boost.org/libs/graph/doc/push_relabel_max_flow.html" msgid "" @@ -13959,8 +14027,11 @@ msgid "" "of the maximum flow on a graph" msgstr "``pgr_maxFlowMinCost`` — 计算图上最大流的总成本最小化的边" -msgid "``pgr_maxFlowMinCost`` (`Combinations`_)" -msgstr "``pgr_maxFlowMinCost`` (`组合`_)" +msgid "pgr_maxFlowMinCost(Combinations)" +msgstr "pgr_maxFlowMinCost(组合)" + +msgid "|boost| graph inside." +msgstr "|boost| 图内部。" msgid "**TODO** check which statement is true:" msgstr "**TODO** 检查哪个陈述是正确的：" @@ -14005,13 +14076,6 @@ msgstr "pgr_maxFlowMinCost(`Edges SQL`_, `Combinations SQL`_)" msgid "Returns set of |result-flow-mincost|" msgstr "返回 |result-flow-mincost| 的集合" -msgid "" -"https://www.boost.org/libs/graph/doc/" -"successive_shortest_path_nonnegative_weights.html" -msgstr "" -"https://www.boost.org/libs/graph/doc/" -"successive_shortest_path_nonnegative_weights.html" - msgid "``pgr_maxFlowMinCost_Cost`` - Experimental" msgstr "``pgr_maxFlowMinCost_Cost`` - 实验" @@ -14020,8 +14084,8 @@ msgid "" "maximum flow on a graph" msgstr "``pgr_maxFlowMinCost_Cost`` — 计算图上最大流量的最小总成本" -msgid "``pgr_maxFlowMinCost_Cost`` (`Combinations`_)" -msgstr "``pgr_maxFlowMinCost_Cost`` (`组合`_)" +msgid "pgr_maxFlowMinCost_Cost(Combinations)" +msgstr "pgr_maxFlowMinCost_Cost(组合)" msgid "**The cost value of all input edges must be nonnegative.**" msgstr "**所有输入边的成本值必须是非负的。**" @@ -14053,8 +14117,8 @@ msgstr "RETURNS FLOAT" msgid "Minimum Cost Maximum Flow possible from the source(s) to the target(s)" msgstr "从source(s) 到target(s)的最小成本最大流量" -msgid "pgr_nodeNetwork" -msgstr "pgr_nodeNetwork" +msgid "``pgr_nodeNetwork``" +msgstr "``pgr_nodeNetwork``" msgid "``pgr_nodeNetwork`` - Nodes an network edge table." msgstr "``pgr_nodeNetwork`` - 网络边表的节点。" @@ -14624,9 +14688,6 @@ msgstr "" "``pgr_pushRelabel`` — 使用 Push Relabel 算法计算图边上的流量，以最大化从源到" "目标的流量。" -msgid "``pgr_pushRelabel`` (`Combinations`_)" -msgstr "``pgr_pushRelabel`` (`组合`_)" - msgid "Renamed from ``pgr_maxFlowPushRelabel``" msgstr "由 ``pgr_maxFlowPushRelabel`` 重命名" @@ -14645,17 +14706,14 @@ msgstr "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vids**)" msgid "pgr_pushRelabel(`Edges SQL`_, `Combinations SQL`_)" msgstr "pgr_pushRelabel(`Edges SQL`_, `Combinations SQL`_)" -msgid "pgr_sequentialVertexColoring - Proposed" -msgstr "pgr_sequentialVertexColoring - 拟议" +msgid "``pgr_sequentialVertexColoring`` - Proposed" +msgstr "``pgr_sequentialVertexColoring`` - 拟议" msgid "" "``pgr_sequentialVertexColoring`` — Returns the vertex coloring of an " "undirected graph, using greedy approach." msgstr "``pgr_sequentialVertexColoring`` — 使用贪婪方法返回无向图的顶点着色。" -msgid "Promoted to **proposed** signature" -msgstr "晋升为 **拟议** 签名" - msgid "" "Sequential vertex coloring algorithm is a graph coloring algorithm in which " "color identifiers are assigned to the vertices of a graph in a sequential " @@ -14702,8 +14760,16 @@ msgstr ":math:`k` 是使用的颜色数量。" msgid "pgr_sequentialVertexColoring(`Edges SQL`_)" msgstr "pgr_sequentialVertexColoring(`Edges SQL`_)" -msgid "pgr_stoerWagner - Experimental" -msgstr "pgr_stoerWagner - 实验" +#, fuzzy +msgid "" +"`Boost: Sequential Vertex Coloring `__" +msgstr "" +"`Boost：顺序顶点着色算法文档 `__" + +msgid "``pgr_stoerWagner`` - Experimental" +msgstr "``pgr_stoerWagner`` - 实验" msgid "``pgr_stoerWagner`` — The min-cut of graph using stoerWagner algorithm." msgstr "``pgr_stoerWagner`` — 使用 stoerWagner 算法对图进行最小分割。" @@ -14796,6 +14862,14 @@ msgstr "边的最小割" msgid "Using :doc:`pgr_connectedComponents`" msgstr "使用 :doc:`pgr_connectedComponents`" +#, fuzzy +msgid "" +"`Boost: Stoer Wagner min cut `__" +msgstr "" +"Boost: `强大组件 `__" + msgid "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" msgstr "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" @@ -14826,8 +14900,9 @@ msgstr "pgr_strongComponents(`Edges SQL`_)" msgid "The strong components of the graph" msgstr "图的重要组成部分" +#, fuzzy msgid "" -"Boost: `Strong components `__" msgstr "" "Boost: `强大组件 `__" +msgstr "" +"`Boost: is_bipartite `__" + msgid "``pgr_transitiveClosure`` - Experimental" msgstr "``pgr_transitiveClosure`` - 实验" @@ -14955,50 +15038,55 @@ msgstr "边目标的标识符" msgid "Identifiers of the vertices that are reachable from vertex v." msgstr "从顶点 v 可到达的顶点的标识符。" +#, fuzzy +msgid "" +"`Boost: transitive closure `__" +msgstr "" +"`Boost: is_bipartite `__" + msgid "https://en.wikipedia.org/wiki/Transitive_closure" msgstr "https://en.wikipedia.org/wiki/Transitive_closure" -msgid "pgr_trsp - Proposed" -msgstr "pgr_trsp - 拟议" +msgid "``pgr_trsp``" +msgstr "``pgr_trsp``" msgid "``pgr_trsp`` - routing vertices with restrictions." msgstr "``pgr_trsp`` -有限制的路由顶点。" -msgid "New proposed signatures" -msgstr "新拟议的签名" +msgid "pgr_trsp(One to One)" +msgstr "pgr_trsp （一对一）" -msgid "``pgr_trsp`` (`One to One`_)" -msgstr "``pgr_trsp`` (`一对一`_)" +msgid "pgr_trsp(One to Many)" +msgstr "pgr_trsp （一对多）" -msgid "``pgr_trsp`` (`One to Many`_)" -msgstr "``pgr_trsp`` (`一对多`_)" +msgid "pgr_trsp(Many to One)" +msgstr "pgr_trsp （多对一）" -msgid "``pgr_trsp`` (`Many to One`_)" -msgstr "``pgr_trsp`` (`多对一`_)" +msgid "pgr_trsp(Many to Many)" +msgstr "pgr_trsp （多对多）" -msgid "``pgr_trsp`` (`Many to Many`_)" -msgstr "``pgr_trsp`` (`多对多`_)" - -msgid "``pgr_trsp`` (`Combinations`_)" -msgstr "``pgr_trsp`` (`组合`_)" +msgid "pgr_trsp(Combinations)" +msgstr "pgr_trsp （组合）" msgid "Deprecated signatures" msgstr "弃用签名" -msgid "``pgr_trsp(text,integer,float,integer,float,boolean,boolean,text)``" -msgstr "``pgr_trsp(text,integer,float,integer,float,boolean,boolean,text)``" +msgid "pgr_trsp(text,integer,float,integer,float,boolean,boolean,text)" +msgstr "pgr_trsp(text,integer,float,integer,float,boolean,boolean,text)" -msgid "``pgr_trspViaVertices(text,anyarray,boolean,boolean,text)``" -msgstr "``pgr_trspViaVertices(text,anyarray,boolean,boolean,text)``" +msgid "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" +msgstr "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" msgid "New prototypes" msgstr "新原型" -msgid "``pgr_trspViaVertices``" -msgstr "``pgr_trspViaVertices``" +msgid "pgr_trspViaVertices" +msgstr "pgr_trspViaVertices" -msgid "``pgr_trspViaEdges``" -msgstr "``pgr_trspViaEdges``" +msgid "pgr_trspViaEdges" +msgstr "pgr_trspViaEdges" msgid "" "Turn restricted shortest path (TRSP) is an algorithm that receives turn " @@ -15082,19 +15170,13 @@ msgid "" "`Deprecated documentation `_" msgstr "` 已弃用文档 `_" -msgid "``pgr_trspVia`` - Proposed" -msgstr "``pgr_trspVia`` - 拟议" +msgid "``pgr_trspVia``" +msgstr "``pgr_trspVia``" msgid "" "``pgr_trspVia`` Route that goes through a list of vertices with restrictions." msgstr "``pgr_trspVia`` 穿过有限制的顶点列表的路线。" -msgid "New proposed function:" -msgstr "新提议的函数：" - -msgid "``pgr_trspVia`` (`One Via`_)" -msgstr "``pgr_trspVia`` (`One Via`_)" - msgid "" "Given a list of vertices and a graph, this function is equivalent to finding " "the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :" @@ -15187,17 +15269,14 @@ msgstr "因此，当设置为 ``false`` 时，结果会忽略 ``U_turn_on_edge`` msgid ":doc:`via-category`" msgstr ":doc:`via-category`" -msgid "``pgr_trspVia_withPoints`` - Proposed" -msgstr "``pgr_trspVia_withPoints`` - 拟议" +msgid "``pgr_trspVia_withPoints``" +msgstr "``pgr_trspVia_withPoints``" msgid "" "``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/" "or points with restrictions." msgstr "``pgr_trspVia_withPoints`` - 经过一系列具有限制的顶点和/或点的路线。" -msgid "``pgr_trspVia_withPoints`` (`One Via`_)" -msgstr "``pgr_trspVia_withPoints`` (`One Via`_)" - msgid "" "Given a graph, a set of restriction on the graph edges, a set of points on " "the graphs edges and a list of vertices, this function is equivalent to " @@ -15381,30 +15460,12 @@ msgstr "" "`pgr_withPointsVia` 结果中，它删除了冲突路径，并使用 :doc:`pgr_trsp` 算法的结" "果构建解决方案。 在这种情况下，使用相同的边缘完成 U 形转弯。" -msgid "pgr_trsp_withPoints - Proposed" -msgstr "pgr_trsp_withPoints - 拟议" +msgid "``pgr_trsp_withPoints``" +msgstr "``pgr_trsp_withPoints``" msgid "``pgr_trsp_withPoints`` Routing Vertex/Point with restrictions." msgstr "``pgr_trsp_withPoints`` 有限制的路由顶点/点。" -msgid "New proposed signatures:" -msgstr "新拟议的签名：" - -msgid "``pgr_trsp_withPoints`` (`One to One`_)" -msgstr "``pgr_trsp_withPoints`` (`一对一`_)" - -msgid "``pgr_trsp_withPoints`` (`One to Many`_)" -msgstr "``pgr_trsp_withPoints`` (`一对多`_)" - -msgid "``pgr_trsp_withPoints`` (`Many to One`_)" -msgstr "``pgr_trsp_withPoints`` (`多对一`_)" - -msgid "``pgr_trsp_withPoints`` (`Many to Many`_)" -msgstr "``pgr_trsp_withPoints`` (`多对多`_)" - -msgid "``pgr_trsp_withPoints`` (`Combinations`_)" -msgstr "``pgr_trsp_withPoints`` (`组合`_)" - msgid "" "Modify the graph to include points defined by points_sql. Using Dijkstra " "algorithm, find the shortest path" @@ -15530,8 +15591,8 @@ msgstr "" "无向图上从点 :math:`1` 和顶点 :math:`6` 到点 :math:`3`到顶点 :math:`1` 的详细" "信息。" -msgid "pgr_turnRestrictedPath - Experimental" -msgstr "pgr_turnRestrictedPath - 实验性" +msgid "``pgr_turnRestrictedPath`` - Experimental" +msgstr "``pgr_turnRestrictedPath`` - 实验性" #, fuzzy msgid "" @@ -15539,9 +15600,6 @@ msgid "" "with restrictions" msgstr "``pgr_turnRestrictedPath`` 使用 Yen 算法顶点- 带限制的顶点路由" -msgid "New experimental function" -msgstr "新实验功能" - msgid "" "Using Yen's algorithm to obtain K shortest paths and analyze the paths to " "select the paths that do not use the restrictions" @@ -15615,8 +15673,8 @@ msgstr "pgr_version()" msgid "pgRouting Version for this documentation" msgstr "本文档的 pgRouting 版本" -msgid "pgr_vrpOneDepot - Experimental" -msgstr "pgr_vrpOneDepot -实验" +msgid "``pgr_vrpOneDepot`` - Experimental" +msgstr "``pgr_vrpOneDepot`` - 实验" msgid "**No documentation available**" msgstr "**无可用文档**" @@ -15624,8 +15682,8 @@ msgstr "**无可用文档**" msgid "**TBD**" msgstr "**TBD**" -msgid "``pgr_withPoints`` - Proposed" -msgstr "``pgr_withPoints`` -拟议" +msgid "``pgr_withPoints``" +msgstr "``pgr_withPoints``" msgid "" "``pgr_withPoints`` - Returns the shortest path in a graph with additional " @@ -15783,8 +15841,8 @@ msgstr "对于点 :math:`6` 和顶点 :math:`11`。" msgid "Passes in front or visits with left side driving." msgstr "从前方超车或以左侧驾驶方式行驶。" -msgid "``pgr_withPointsCost`` - Proposed" -msgstr "``pgr_withPointsCost`` -拟议" +msgid "``pgr_withPointsCost``" +msgstr "``pgr_withPointsCost``" msgid "" "``pgr_withPointsCost`` - Calculates the shortest path and returns only the " @@ -15951,8 +16009,8 @@ msgstr "左侧驾驶拓扑" msgid "Does not matter driving side driving topology" msgstr "与驱动端驱动拓扑无关" -msgid "``pgr_withPointsCostMatrix`` - proposed" -msgstr "``pgr_withPointsCostMatrix`` - 拟议" +msgid "``pgr_withPointsCostMatrix``" +msgstr "``pgr_withPointsCostMatrix``" msgid "" "``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:" @@ -15988,8 +16046,8 @@ msgid "" msgstr "" "求从顶点 :math:`1` 到图上点 `(2.9, 1.8)` 的两个最近位置的路线的矩阵成本。" -msgid "``pgr_withPointsDD`` - Proposed" -msgstr "``pgr_withPointsDD`` - 拟议" +msgid "``pgr_withPointsDD``" +msgstr "``pgr_withPointsDD``" msgid "" "``pgr_withPointsDD`` - Returns the driving **distance** from a starting " @@ -16003,8 +16061,11 @@ msgstr "" "签名更改： ``driving_side`` 参数从已命名的可选参数改为未命名的必选参数 " "**driving side**。" -msgid "``pgr_withPointsDD`` (`Single vertex`)" -msgstr "``pgr_withPointsDD`` （`单顶点`）" +msgid "pgr_withPointsDD(Single vertex)" +msgstr "pgr_withPointsDD （单顶点）" + +msgid "pgr_withPointsDD(Multiple vertices)" +msgstr "pgr_withPointsDD（多顶点）" msgid "Added ``depth``, ``pred`` and ``start_vid`` column." msgstr "添加了 ``depth``、``pred`` 和 ``start_vid`` 列。" @@ -16023,18 +16084,16 @@ msgstr "" "被包含在内" msgid "" -"``pgr_withpointsdd(text,text,bigint,double precision,boolean,character," -"boolean)``" +"pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" msgstr "" -"``pgr_withpointsdd(text,text,bigint,double precision,boolean,character," -"boolean)``" +"pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" msgid "" -"``pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)``" +"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," +"boolean,boolean)" msgstr "" -"``pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," -"boolean,boolean)``" +"pgr_withpointsdd(text,text,anyarray,double precision,boolean,character," +"boolean,boolean)" msgid "" "Modify the graph to include points and using Dijkstra algorithm, extracts " @@ -16155,8 +16214,8 @@ msgstr "" msgid ":doc:`pgr_alphaShape`" msgstr ":doc:`pgr_alphaShape`" -msgid "pgr_withPointsKSP - Proposed" -msgstr "pgr_withPointsKSP -拟议" +msgid "``pgr_withPointsKSP``" +msgstr "``pgr_withPointsKSP``" msgid "" "``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." @@ -16165,29 +16224,26 @@ msgstr "``pgr_withPointsKSP`` — Yen 使用 Dijkstra 计算 K 最短路径的 msgid "Standarizing output columns to |nksp-result|" msgstr "标准化输出列为 |nksp-result|" -msgid "``pgr_withPointsKSP`` (One to One)" -msgstr "``pgr_withPointsKSP`` (一对一)" +msgid "pgr_withPointsKSP(One to One)" +msgstr "pgr_withPointsKSP(一对一)" -msgid "New overload functions" -msgstr "新的重载函数" +msgid "pgr_withPointsKSP(One to Many)" +msgstr "pgr_withPointsKSP (一对多)" -msgid "``pgr_withPointsKSP`` (One to Many)" -msgstr "``pgr_withPointsKSP`` (一对多)" +msgid "pgr_withPointsKSP(Many to One)" +msgstr "pgr_withPointsKSP(多对一)" -msgid "``pgr_withPointsKSP`` (Many to One)" -msgstr "``pgr_withPointsKSP`` (多对一)" +msgid "pgr_withPointsKSP(Many to Many)" +msgstr "pgr_withPointsKSP(多对多)" -msgid "``pgr_withPointsKSP`` (Many to Many)" -msgstr "``pgr_withPointsKSP`` (多对多)" - -msgid "``pgr_withPointsKSP`` (Combinations)" -msgstr "``pgr_withPointsKSP`` (组合)" +msgid "pgr_withPointsKSP(Combinations)" +msgstr "pgr_withPointsKSP（组合）" msgid "" -"``pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," +"pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," "boolean)``" msgstr "" -"``pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," +"pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," "boolean)``" msgid "" @@ -16324,17 +16380,14 @@ msgstr "" "使用右侧驾驶拓扑，从点 :math:`1` 到点 :math:`2` 获取 :math:`2` 条路径，同时使" "用堆路径（heap paths）并包含详细信息。" -msgid "``pgr_withPointsVia`` - Proposed" -msgstr "``pgr_withPointsVia`` - 拟议" +msgid "``pgr_withPointsVia``" +msgstr "``pgr_withPointsVia``" msgid "" "``pgr_withPointsVia`` - Route that goes through a list of vertices and/or " "points." msgstr "``pgr_withPointsVia`` - 经过一系列顶点和/或点的路线。" -msgid "New **proposed** function ``pgr_withPointsVia`` (`One Via`_)" -msgstr "新 **拟议** 的函数 ``pgr_withPointsVia`` (`One Via`_)" - 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:" @@ -16501,9 +16554,29 @@ msgstr "Minors 3.x" msgid "pgRouting 3.7" msgstr "pgRouting 3.7" +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 `Git closed " +"milestone for 3.7.3 `__" +msgstr "" +"要查看此版本关闭的所有问题和拉取请求，请参阅 `Git closed milestone for 3.7.1 " +"`__" + #, fuzzy +msgid "" +"`#2731 `__ Build Failure " +"on Ubuntu 22" +msgstr "" +"`#2607 `__ 在 C++ 上读取 " +"postgresql 数据" + msgid "pgRouting 3.7.2 Release Notes" -msgstr "pgRouting 3.7.1 发布说明" +msgstr "pgRouting 3.7.2 发布说明" #, fuzzy msgid "" @@ -16797,16 +16870,6 @@ msgstr "" "`#2516 `__ 标准化输出" "pgr_aStar" -msgid "" -"``pgr_aStar`` (`One to One`) added ``start_vid`` and ``end_vid`` columns." -msgstr "``pgr_aStar`` （`一对一`）增加了 ``start_vid`` 和 ``end_vid`` 列。" - -msgid "``pgr_aStar`` (`One to Many`) added ``end_vid`` column." -msgstr "``pgr_aStar``（`一对多`）添加了 ``end_vid`` 列。" - -msgid "``pgr_aStar`` (`Many to One`) added ``start_vid`` column." -msgstr "``pgr_aStar``（`多对一`）添加了 ``start_vid`` 列。" - msgid "" "`#2523 `__ Standarize " "output pgr_bdAstar" @@ -16814,16 +16877,6 @@ msgstr "" "`#2523 `__ 标准化输出 " "pgr_bdAstar" -msgid "" -"``pgr_bdAstar`` (`One to One`) added ``start_vid`` and ``end_vid`` columns." -msgstr "``pgr_bdAstar``（`一对一`）增加了 ``start_vid`` 和``end_vid`` 列。" - -msgid "``pgr_bdAstar`` (`One to Many`) added ``end_vid`` column." -msgstr "``pgr_bdAstar``（`一对多）添加了``end_vid`` 列。" - -msgid "``pgr_bdAstar`` (`Many to One`) added ``start_vid`` column." -msgstr "``pgr_bdAstar``（`多对一`）添加了``start_vid`` 列。" - msgid "" "`#2547 `__ Standarize " "output and modifying signature pgr_KSP" @@ -16831,9 +16884,10 @@ msgstr "" "`#2547 `__ 标准化输出并修改" "签名 pgr_KSP" +#, fuzzy msgid "" "`#2548 `__ Standarize " -"output pgr_drivingdistance" +"output pgr_drivingDistance" msgstr "" "`#2548 `__ 标准化输出 " "pgr_drivingdistance" @@ -16960,7 +17014,6 @@ msgstr "使用 bootstrap_version 2，因为 3+ 不支持下拉菜单" msgid "Issue fixes" msgstr "问题修复" -#, fuzzy msgid "" "`#2565 `__ " "pgr_lengauerTarjanDominatorTree triggers an assertion" @@ -17012,16 +17065,6 @@ msgstr "" msgid "Dijkstra" msgstr "Dijkstra" -msgid "" -"``pgr_dijkstra`` (`One to One`) added ``start_vid`` and ``end_vid`` columns." -msgstr "``pgr_dijkstra``（`一对一`）增加了``start_vid`` 和``end_vid`` 列。" - -msgid "``pgr_dijkstra`` (`One to Many`) added ``end_vid`` column." -msgstr "``pgr_dijkstra``（`一对多`）添加了 ``end_vid`` 列。" - -msgid "``pgr_dijkstra`` (`Many to One`) added ``start_vid`` column." -msgstr "``pgr_dijkstra`` （`多对一`）添加了 ``start_vid`` 列。" - msgid "pgRouting 3.4" msgstr "pgRouting 3.4" @@ -17097,14 +17140,15 @@ msgstr "" "`#1891 `__: pgr_ksp 没有" "给出所有正确的最短路径" -msgid "New proposed functions" -msgstr "新的拟议函数" +msgid "New proposed functions." +msgstr "新的拟议函数。" msgid "With points" msgstr "带点" -msgid "``pgr_withPointsVia`` (One Via)" -msgstr "``pgr_withPointsVia`` (One Via)" +#, fuzzy +msgid "pgr_withPointsVia(One Via)" +msgstr "pgr_withPointsVia (One Via)" msgid "Turn Restrictions" msgstr "转弯限制" @@ -17112,89 +17156,70 @@ msgstr "转弯限制" msgid "Via with turn restrictions" msgstr "有转弯限制的通道" -msgid "``pgr_trspVia`` (One Via)" -msgstr "``pgr_trspVia`` (One Via)" - -msgid "``pgr_trspVia_withPoints`` (One Via)" -msgstr "pgr_trspVia_withPoints``（一次通过）" - -msgid "``pgr_trsp``" -msgstr "``pgr_trsp``" - -msgid "``pgr_trsp`` (One to One)" -msgstr "``pgr_trsp`` （一对一）" - -msgid "``pgr_trsp`` (One to Many)" -msgstr "``pgr_trsp`` （一对多）" - -msgid "``pgr_trsp`` (Many to One)" -msgstr "``pgr_trsp`` （多对一）" - -msgid "``pgr_trsp`` (Many to Many)" -msgstr "``pgr_trsp`` （多对多）" - -msgid "``pgr_trsp`` (Combinations)" -msgstr "``pgr_trsp`` （组合）" +#, fuzzy +msgid "pgr_trspVia(One Via)" +msgstr "pgr_trspVia(One Via)" -msgid "``pgr_trsp_withPoints``" -msgstr "``pgr_trsp_withPoints``" +msgid "pgr_trspVia_withPoints(One Via)" +msgstr "pgr_trspVia_withPoints（一次通过）" -msgid "``pgr_trsp_withPoints`` (One to One)" -msgstr "``pgr_trsp_withPoints`` （一对一）" +msgid "pgr_trsp_withPoints(One to One)" +msgstr "pgr_trsp_withPoints（一对一）" -msgid "``pgr_trsp_withPoints`` (One to Many)" -msgstr "``pgr_trsp_withPoints`` （一对多）" +msgid "pgr_trsp_withPoints(One to Many)" +msgstr "pgr_trsp_withPoints（一对多）" -msgid "``pgr_trsp_withPoints`` (Many to One)" -msgstr "pgr_trsp_withPoints``（多对一）" +msgid "pgr_trsp_withPoints(Many to One)" +msgstr "pgr_trsp_withPoints（多对一）" -msgid "``pgr_trsp_withPoints`` (Many to Many)" -msgstr "``pgr_trsp_withPoints`` （多对多）" +msgid "pgr_trsp_withPoints(Many to Many)" +msgstr "pgr_trsp_withPoints（多对多）" -msgid "``pgr_trsp_withPoints`` (Combinations)" -msgstr "``pgr_trsp_withPoints`` （组合）" +msgid "pgr_trsp_withPoints(Combinations)" +msgstr "pgr_trsp_withPoints（组合）" msgid "Topology" msgstr "拓扑结构" -msgid "``pgr_degree``" -msgstr "``pgr_degree``" - msgid "Utilities" msgstr "实用程序" -msgid "``pgr_findCloseEdges`` (One point)" -msgstr "``pgr_findCloseEdges`` （单点）" +msgid "pgr_findCloseEdges(One point)" +msgstr "pgr_findCloseEdges（单点）" -msgid "``pgr_findCloseEdges`` (Many points)" -msgstr "``pgr_findCloseEdges`` （多点）" +msgid "pgr_findCloseEdges(Many points)" +msgstr "pgr_findCloseEdges（多点）" msgid "Ordering" msgstr "排序" -msgid "``pgr_cuthillMckeeOrdering``" -msgstr "``pgr_cuthillMckeeOrdering``" +msgid "pgr_cuthillMckeeOrdering" +msgstr "pgr_cuthillMckeeOrdering" msgid "Unclassified" msgstr "未分类" +msgid "pgr_hawickCircuits" +msgstr "pgr_hawickCircuits" + msgid "Flow functions" msgstr "流程函数" -msgid "``pgr_maxCardinalityMatch(text)``" -msgstr "``pgr_maxCardinalityMatch(text)``" +msgid "pgr_maxCardinalityMatch(text)" +msgstr "pgr_maxCardinalityMatch(text)" -msgid "Deprecating ``pgr_maxCardinalityMatch(text,boolean)``" +#, fuzzy +msgid "Deprecating: pgr_maxCardinalityMatch(text,boolean)" msgstr "弃用 ``pgr_maxCardinalityMatch(text,boolean)``" msgid "Deprecated Functions" msgstr "已废弃的函数" -msgid "``pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)``" -msgstr "``pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)``" +msgid "pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)" +msgstr "pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)" -msgid "``pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text)``" -msgstr "``pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text)``" +msgid "pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text)" +msgstr "pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text)" msgid "pgRouting 3.3" msgstr "pgRouting 3.3" @@ -17508,12 +17533,6 @@ msgstr "" msgid "Removing support for Boost v1.53, v1.54 & v1.55" msgstr "删除对 Boost v1.53、v1.54 和 v1.55 的支持" -msgid "pgr_bellmanFord(Combinations)" -msgstr "pgr_bellmanFord(组合)" - -msgid "pgr_binaryBreadthFirstSearch(Combinations)" -msgstr "pgr_binaryBreadthFirstSearch(组合)" - msgid "pgr_bipartite" msgstr "pgr_bipartite" @@ -17523,9 +17542,6 @@ msgstr "pgr_depthFirstSearch" msgid "Dijkstra Near" msgstr "Dijkstra Near" -msgid "pgr_edwardMoore(Combinations)" -msgstr "pgr_edwardMoore(组合)" - msgid "pgr_isPlanar" msgstr "pgr_isPlanar" @@ -17535,51 +17551,15 @@ msgstr "pgr_lengauerTarjanDominatorTree" msgid "pgr_makeConnected" msgstr "pgr_makeConnected" -msgid "pgr_maxFlowMinCost(Combinations)" -msgstr "pgr_maxFlowMinCost(组合)" - -msgid "pgr_maxFlowMinCost_Cost(Combinations)" -msgstr "pgr_maxFlowMinCost_Cost(组合)" - -msgid "Astar" -msgstr "Astar" - -msgid "pgr_aStar(Combinations)" -msgstr "pgr_aStar(组合)" - -msgid "pgr_aStarCost(Combinations)" -msgstr "pgr_aStarCost(组合)" +msgid "Astar" +msgstr "Astar" msgid "Bidirectional Astar" msgstr "双向Astar" -msgid "pgr_bdAstar(Combinations)" -msgstr "pgr_bdAstar(组合)" - -msgid "pgr_bdAstarCost(Combinations)" -msgstr "pgr_bdAstarCost(组合)" - msgid "Bidirectional Dijkstra" msgstr "双向 Dijkstra" -msgid "pgr_bdDijkstra(Combinations)" -msgstr "pgr_bdDijkstra(组合)" - -msgid "pgr_bdDijkstraCost(Combinations)" -msgstr "pgr_bdDijkstraCost(组合)" - -msgid "pgr_boykovKolmogorov(Combinations)" -msgstr "pgr_boykovKolmogorov (组合)" - -msgid "pgr_edmondsKarp(Combinations)" -msgstr "pgr_edmondsKarp(组合)" - -msgid "pgr_maxFlow(Combinations)" -msgstr "pgr_maxFlow(组合)" - -msgid "pgr_pushRelabel(Combinations)" -msgstr "pgr_pushRelabel(组合)" - msgid "pgRouting 3.1" msgstr "pgRouting 3.1" @@ -17887,7 +17867,7 @@ msgid "" msgstr "" "`#1006 `__：无信息丢失" -msgid "New functions" +msgid "New Functions" msgstr "新函数" msgid "Kruskal family" @@ -17926,148 +17906,119 @@ msgstr "pgRouting 中的拟议已升级为正式版本" msgid "aStar Family" msgstr "aStar族" -msgid "pgr_aStar(one to many)" -msgstr "pgr_aStar（一对多）" - -msgid "pgr_aStar(many to one)" -msgstr "pgr_aStar（多对一）" - -msgid "pgr_aStar(many to many)" -msgstr "pgr_aStar（多对多）" - -msgid "pgr_aStarCost(one to one)" +#, fuzzy +msgid "pgr_aStarCost(One to One)" msgstr "pgr_aStarCost(一对一)" -msgid "pgr_aStarCost(one to many)" +#, fuzzy +msgid "pgr_aStarCost(One to Many)" msgstr "pgr_aStarCost(一对多)" -msgid "pgr_aStarCost(many to one)" +#, fuzzy +msgid "pgr_aStarCost(Many to One)" msgstr "pgr_aStarCost(多对一)" -msgid "pgr_aStarCost(many to many)" +#, fuzzy +msgid "pgr_aStarCost(Many to Many)" msgstr "pgr_aStarCost（多对多）" -msgid "pgr_aStarCostMatrix(one to one)" -msgstr "pgr_aStarCostMatrix(一对一)" - -msgid "pgr_aStarCostMatrix(one to many)" -msgstr "pgr_aStarCostMatrix (一对多)" - -msgid "pgr_aStarCostMatrix(many to one)" -msgstr "pgr_aStarCostMatrix (多对一)" - -msgid "pgr_aStarCostMatrix(many to many)" -msgstr "pgr_aStarCostMatrix（多对多）" +#, fuzzy +msgid "pgr_aStarCostMatrix" +msgstr "pgr_astarCostMatrix" msgid "bdAstar Family" msgstr "bdAstar 族" -msgid "pgr_bdAstar(one to many)" -msgstr "pgr_bdAstar（一对多）" - -msgid "pgr_bdAstar(many to one)" -msgstr "pgr_bdAstar（多对一）" - -msgid "pgr_bdAstar(many to many)" -msgstr "pgr_bdAstar（多对多）" - -msgid "pgr_bdAstarCost(one to one)" +#, fuzzy +msgid "pgr_bdAstarCost(One to One)" msgstr "pgr_bdAstarCost(一对一)" -msgid "pgr_bdAstarCost(one to many)" +#, fuzzy +msgid "pgr_bdAstarCost(One to Many)" msgstr "pgr_bdAstarCost(一对多)" -msgid "pgr_bdAstarCost(many to one)" +#, fuzzy +msgid "pgr_bdAstarCost(Many to One)" msgstr "pgr_bdAstarCost （多对一）" -msgid "pgr_bdAstarCost(many to many)" +#, fuzzy +msgid "pgr_bdAstarCost(Many to Many)" msgstr "pgr_bdAstarCost (多对多)" -msgid "pgr_bdAstarCostMatrix(one to one)" -msgstr "pgr_bdAstarCostMatrix(一对一)" - -msgid "pgr_bdAstarCostMatrix(one to many)" -msgstr "pgr_bdAstarCostMatrix(一对多)" - -msgid "pgr_bdAstarCostMatrix(many to one)" -msgstr "pgr_bdAstarCostMatrix （多对一）" - -msgid "pgr_bdAstarCostMatrix(many to many)" -msgstr "pgr_bdAstarCostMatrix （多对多）" +msgid "pgr_bdAstarCostMatrix" +msgstr "pgr_bdAstarCostMatrix" msgid "bdDijkstra Family" msgstr "bdDijkstra族" -msgid "pgr_bdDijkstra(one to many)" -msgstr "pgr_bdDijkstra（一对多）" - -msgid "pgr_bdDijkstra(many to one)" -msgstr "pgr_bdDijkstra（多对一）" - -msgid "pgr_bdDijkstra(many to many)" -msgstr "pgr_bdDijkstra（多对多）" - -msgid "pgr_bdDijkstraCost(one to one)" +#, fuzzy +msgid "pgr_bdDijkstraCost(One to One)" msgstr "pgr_bdDijkstraCost (一对一)" -msgid "pgr_bdDijkstraCost(one to many)" +#, fuzzy +msgid "pgr_bdDijkstraCost(One to Many)" msgstr "pgr_bdDijkstraCost(一对多)" -msgid "pgr_bdDijkstraCost(many to one)" +#, fuzzy +msgid "pgr_bdDijkstraCost(Many to One)" msgstr "pgr_bdDijkstraCost (多对一)" -msgid "pgr_bdDijkstraCost(many to many)" +#, fuzzy +msgid "pgr_bdDijkstraCost(Many to Many)" msgstr "pgr_bdDijkstraCost（多对多）" -msgid "pgr_bdDijkstraCostMatrix(one to one)" -msgstr "pgr_bdDijkstraCostMatrix(一对一)" - -msgid "pgr_bdDijkstraCostMatrix(one to many)" -msgstr "pgr_bdDijkstraCostMatrix(一对多)" - -msgid "pgr_bdDijkstraCostMatrix(many to one)" -msgstr "pgr_bdDijkstraCostMatrix (多对一)" - -msgid "pgr_bdDijkstraCostMatrix(many to many)" -msgstr "pgr_bdDijkstraCostMatrix（多对多）" +msgid "pgr_bdDijkstraCostMatrix" +msgstr "pgr_bdDijkstraCostMatrix" msgid "Flow Family" msgstr "Flow族" -msgid "pgr_pushRelabel(one to one)" +#, fuzzy +msgid "pgr_pushRelabel(One to One)" msgstr "pgr_pushRelabel(一对一)" -msgid "pgr_pushRelabel(one to many)" +#, fuzzy +msgid "pgr_pushRelabel(One to Many)" msgstr "pgr_pushRelabel(一对多)" -msgid "pgr_pushRelabel(many to one)" +#, fuzzy +msgid "pgr_pushRelabel(Many to One)" msgstr "pgr_pushRelabel(多对一)" -msgid "pgr_pushRelabel(many to many)" +#, fuzzy +msgid "pgr_pushRelabel(Many to Many)" msgstr "pgr_pushRelabel(多对多)" -msgid "pgr_edmondsKarp(one to one)" +#, fuzzy +msgid "pgr_edmondsKarp(One to One)" msgstr "pgr_edmondsKarp（一对一）" -msgid "pgr_edmondsKarp(one to many)" +#, fuzzy +msgid "pgr_edmondsKarp(One to Many)" msgstr "pgr_edmondsKarp（一对多）" -msgid "pgr_edmondsKarp(many to one)" +#, fuzzy +msgid "pgr_edmondsKarp(Many to One)" msgstr "pgr_edmondsKarp（多对一）" -msgid "pgr_edmondsKarp(many to many)" +#, fuzzy +msgid "pgr_edmondsKarp(Many to Many)" msgstr "pgr_edmondsKarp（多对多）" -msgid "pgr_boykovKolmogorov (one to one)" +#, fuzzy +msgid "pgr_boykovKolmogorov (One to One)" msgstr "pgr_boykovKolmogorov (一对一)" -msgid "pgr_boykovKolmogorov (one to many)" +#, fuzzy +msgid "pgr_boykovKolmogorov (One to Many)" msgstr "pgr_boykovKolmogorov (一对多)" -msgid "pgr_boykovKolmogorov (many to one)" +#, fuzzy +msgid "pgr_boykovKolmogorov (Many to One)" msgstr "pgr_boykovKolmogorov (多对一)" -msgid "pgr_boykovKolmogorov (many to many)" +#, fuzzy +msgid "pgr_boykovKolmogorov (Many to Many)" msgstr "pgr_boykovKolmogorov (多对多)" msgid "pgr_maxCardinalityMatching" @@ -18076,21 +18027,28 @@ msgstr "pgr_maxCardinalityMatching" msgid "pgr_maxFlow" msgstr "pgr_maxFlow" -msgid "pgr_edgeDisjointPaths(one to one)" +#, fuzzy +msgid "pgr_edgeDisjointPaths(One to One)" msgstr "pgr_edgeDisjointPaths (一对一)" -msgid "pgr_edgeDisjointPaths(one to many)" +#, fuzzy +msgid "pgr_edgeDisjointPaths(One to Many)" msgstr "pgr_edgeDisjointPaths （一对多）" -msgid "pgr_edgeDisjointPaths(many to one)" +#, fuzzy +msgid "pgr_edgeDisjointPaths(Many to One)" msgstr "pgr_edgeDisjointPaths (多对一)" -msgid "pgr_edgeDisjointPaths(many to many)" +#, fuzzy +msgid "pgr_edgeDisjointPaths(Many to Many)" msgstr "pgr_edgeDisjointPaths （多对多）" msgid "Components family" msgstr "分量族" +msgid "pgr_connectedComponents" +msgstr "pgr_connectedComponents" + msgid "pgr_strongComponents" msgstr "pgr_strongComponents" @@ -18298,8 +18256,8 @@ msgstr "pgr_floydWarshall" msgid "pgr_johnson" msgstr "pgr_johnson" -msgid "pgr_astar" -msgstr "pgr_astar" +msgid "pgr_aStar" +msgstr "pgr_aStar" msgid "pgr_bdAstar" msgstr "pgr_bdAstar" @@ -18319,6 +18277,9 @@ msgstr "pgr_dijkstraCost" msgid "pgr_drivingDistance" msgstr "pgr_drivingDistance" +msgid "pgr_KSP" +msgstr "pgr_KSP" + msgid "pgr_dijkstraVia (proposed)" msgstr "pgr_dijkstraVia (拟议)" @@ -18540,24 +18501,17 @@ msgstr "在结果中添加了 path_id、cost 和 agg_cost 列" msgid "Parameter names changed" msgstr "更改参数名称" -msgid "The many version results are the union of the one to one version" +#, fuzzy +msgid "The many version results are the union of the One to One version" msgstr "多版本结果是一对一版本的并集" msgid "New Signatures" msgstr "新签名" -msgid "pgr_bdAstar(one to one)" +#, fuzzy +msgid "pgr_bdAstar(One to One)" msgstr "pgr_bdAstar（一对一）" -msgid "New Proposed functions" -msgstr "新的拟议函数" - -msgid "pgr_bdAstarCostMatrix" -msgstr "pgr_bdAstarCostMatrix" - -msgid "pgr_bdDijkstraCostMatrix" -msgstr "pgr_bdDijkstraCostMatrix" - msgid "pgr_lineGraph" msgstr "pgr_lineGraph" @@ -18646,32 +18600,8 @@ msgstr "" msgid "pgr_bdDijkstra" msgstr "pgr_bdDijkstra" -msgid "New Proposed Signatures" -msgstr "新的拟议签名" - -msgid "pgr_astar(one to many)" -msgstr "pgr_astar（一对多）" - -msgid "pgr_astar(many to one)" -msgstr "pgr_astar（多对一）" - -msgid "pgr_astar(many to many)" -msgstr "pgr_astar（多对多）" - -msgid "pgr_astarCost(one to one)" -msgstr "pgr_astarCost(一对一)" - -msgid "pgr_astarCost(one to many)" -msgstr "pgr_astarCost(一对多)" - -msgid "pgr_astarCost(many to one)" -msgstr "pgr_astarCost(多对一)" - -msgid "pgr_astarCost(many to many)" -msgstr "pgr_astarCost（多对多）" - -msgid "pgr_astarCostMatrix" -msgstr "pgr_astarCostMatrix" +msgid "Deprecated signatures." +msgstr "弃用签名。" msgid "pgr_bddijkstra - use pgr_bdDijkstra instead" msgstr "pgr_bddijkstra - 使用 pgr_bdDijkstra代替" @@ -18751,52 +18681,55 @@ msgstr "" msgid "pgr_TSP" msgstr "pgr_TSP" -msgid "pgr_aStar" -msgstr "pgr_aStar" - -msgid "New Functions" -msgstr "新函数" - msgid "pgr_eucledianTSP" msgstr "pgr_eucledianTSP" -msgid "pgr_withPointsCostMatrix" -msgstr "pgr_withPointsCostMatrix" - -msgid "pgr_maxFlowPushRelabel(one to one)" +#, fuzzy +msgid "pgr_maxFlowPushRelabel(One to One)" msgstr "pgr_maxFlowPushRelabel(一对一)" -msgid "pgr_maxFlowPushRelabel(one to many)" +#, fuzzy +msgid "pgr_maxFlowPushRelabel(One to Many)" msgstr "pgr_maxFlowPushRelabel(一对多)" -msgid "pgr_maxFlowPushRelabel(many to one)" +#, fuzzy +msgid "pgr_maxFlowPushRelabel(Many to One)" msgstr "pgr_maxFlowPushRelabel(多对一)" -msgid "pgr_maxFlowPushRelabel(many to many)" +#, fuzzy +msgid "pgr_maxFlowPushRelabel(Many to Many)" msgstr "pgr_maxFlowPushRelabel(多对多)" -msgid "pgr_maxFlowEdmondsKarp(one to one)" +#, fuzzy +msgid "pgr_maxFlowEdmondsKarp(One to One)" msgstr "pgr_maxFlowEdmondsKarp（一对一）" -msgid "pgr_maxFlowEdmondsKarp(one to many)" +#, fuzzy +msgid "pgr_maxFlowEdmondsKarp(One to Many)" msgstr "pgr_maxFlowEdmondsKarp（一对多）" -msgid "pgr_maxFlowEdmondsKarp(many to one)" +#, fuzzy +msgid "pgr_maxFlowEdmondsKarp(Many to One)" msgstr "pgr_maxFlowEdmondsKarp（多对一）" -msgid "pgr_maxFlowEdmondsKarp(many to many)" +#, fuzzy +msgid "pgr_maxFlowEdmondsKarp(Many to Many)" msgstr "pgr_maxFlowEdmondsKarp（多对多）" -msgid "pgr_maxFlowBoykovKolmogorov (one to one)" +#, fuzzy +msgid "pgr_maxFlowBoykovKolmogorov (One to One)" msgstr "pgr_maxFlowBoykovKolmogorov （一对一）" -msgid "pgr_maxFlowBoykovKolmogorov (one to many)" +#, fuzzy +msgid "pgr_maxFlowBoykovKolmogorov (One to Many)" msgstr "pgr_maxFlowBoykovKolmogorov （一对多）" -msgid "pgr_maxFlowBoykovKolmogorov (many to one)" +#, fuzzy +msgid "pgr_maxFlowBoykovKolmogorov (Many to One)" msgstr "pgr_maxFlowBoykovKolmogorov （多对一）" -msgid "pgr_maxFlowBoykovKolmogorov (many to many)" +#, fuzzy +msgid "pgr_maxFlowBoykovKolmogorov (Many to Many)" msgstr "pgr_maxFlowBoykovKolmogorov （多对多）" msgid "pgr_maximumCardinalityMatching" @@ -18808,7 +18741,8 @@ msgstr "pgr_contractGraph" msgid "pgr_tsp - use pgr_TSP or pgr_eucledianTSP instead" msgstr "pgr_tsp - 使用 pgr_TSP 或 pgr_eucledianTSP 代替" -msgid "pgr_astar - use pgr_aStar instead" +#, fuzzy +msgid "pgr_aStar - use pgr_aStar instead" msgstr "pgr_astar - 使用 pgr_aStar 代替" msgid "pgr_flip_edges" @@ -18909,6 +18843,9 @@ msgstr "" msgid "Improvements" msgstr "改进" +msgid "pgr_nodeNetwork" +msgstr "pgr_nodeNetwork" + msgid "Adding a row_where and outall optional parameters" msgstr "添加 row_where 和 outall 可选参数" @@ -18921,43 +18858,55 @@ msgstr "pgr_dijkstra -- 与文档中的内容相匹配" msgid "pgr_Johnson" msgstr "pgr_Johnson" -msgid "pgr_dijkstraCost(one to one)" +#, fuzzy +msgid "pgr_dijkstraCost(One to One)" msgstr "pgr_dijkstraCost(一对一)" -msgid "pgr_dijkstraCost(one to many)" -msgstr "pgr_dijkstraCost(一对多)" +#, fuzzy +msgid "pgr_dijkstraCost(One to Many)" +msgstr "pgr_dijkstraNearCost(一对多)" -msgid "pgr_dijkstraCost(many to one)" -msgstr "pgr_dijkstraCost（多对一）" +#, fuzzy +msgid "pgr_dijkstraCost(Many to One)" +msgstr "pgr_dijkstraNearCost(多对一)" -msgid "pgr_dijkstraCost(many to many)" -msgstr "pgr_dijkstraCost（多对多）" +#, fuzzy +msgid "pgr_dijkstraCost(Many to Many)" +msgstr "pgr_dijkstraNearCost (多对多)" msgid "Proposed Functionality" msgstr "建议的功能" -msgid "pgr_withPoints(one to one)" -msgstr "pgr_withPoints(一对一)" +#, fuzzy +msgid "pgr_withPoints(One to One)" +msgstr "pgr_withPointsKSP(一对一)" -msgid "pgr_withPoints(one to many)" -msgstr "pgr_withPoints（一对多）" +#, fuzzy +msgid "pgr_withPoints(One to Many)" +msgstr "pgr_withPointsKSP (一对多)" -msgid "pgr_withPoints(many to one)" -msgstr "pgr_withPoints(多对一)" +#, fuzzy +msgid "pgr_withPoints(Many to One)" +msgstr "pgr_withPointsKSP(多对一)" -msgid "pgr_withPoints(many to many)" -msgstr "pgr_withPoints(多对多)" +#, fuzzy +msgid "pgr_withPoints(Many to Many)" +msgstr "pgr_withPointsKSP(多对多)" -msgid "pgr_withPointsCost(one to one)" +#, fuzzy +msgid "pgr_withPointsCost(One to One)" msgstr "pgr_withPointsCost(一对一)" -msgid "pgr_withPointsCost(one to many)" +#, fuzzy +msgid "pgr_withPointsCost(One to Many)" msgstr "pgr_withPointsCost(一对多)" -msgid "pgr_withPointsCost(many to one)" +#, fuzzy +msgid "pgr_withPointsCost(Many to One)" msgstr "pgr_withPointsCost(多对一)" -msgid "pgr_withPointsCost(many to many)" +#, fuzzy +msgid "pgr_withPointsCost(Many to Many)" msgstr "pgr_withPointsCost(多对多)" msgid "pgr_withPointsDD(single vertex)" @@ -18966,9 +18915,6 @@ msgstr "pgr_withPointsDD （单顶点）" msgid "pgr_withPointsDD(multiple vertices)" msgstr "pgr_withPointsDD（多顶点）" -msgid "pgr_withPointsKSP" -msgstr "pgr_withPointsKSP" - msgid "pgr_dijkstraVia" msgstr "pgr_dijkstraVia" @@ -19005,27 +18951,13 @@ msgstr "" "github.com/pgRouting/pgrouting/issues?" "q=is%3Aissue+milestone%3A%22Release+2.1.0%22+is%3Aclosed>`_ 。" -msgid "pgr_dijkstra(one to many)" -msgstr "pgr_dijkstra（一对多）" - -msgid "pgr_dijkstra(many to one)" -msgstr "pgr_dijkstra（多对一）" - -msgid "pgr_dijkstra(many to many)" -msgstr "pgr_dijkstra（多对多）" - -msgid "pgr_drivingDistance(multiple vertices)" -msgstr "pgr_drivingDistance （多顶点）" - msgid "Refactored" msgstr "重构" -msgid "pgr_dijkstra(one to one)" +#, fuzzy +msgid "pgr_dijkstra(One to One)" msgstr "pgr_dijkstra（一对一）" -msgid "pgr_drivingDistance(single vertex)" -msgstr "pgr_drivingDistance （单顶点）" - msgid "" "pgr_alphaShape function now can generate better (multi)polygon with holes " "and alpha parameter." @@ -19785,9 +19717,10 @@ msgstr "" "与表关联的属性有助于指示图是有向的还是无向的，边是否是有向图上的单向，并且根" "据最终应用程序的需要，需要创建合适的拓扑。" +#, fuzzy msgid "" -"pgRouting suplies some functions to create a routing topology and to analyze " -"the topology." +"pgRouting supplies some functions to create a routing topology and to " +"analyze the topology." msgstr "pgRouting 提供一些函数来创建路由拓扑并分析拓扑。" msgid "Additional functions to create a graph:" @@ -20207,3 +20140,572 @@ msgstr "pgr_withPointsDD 是 **带有点** 的 pgr_drivenDistance" msgid "pgr_withPointsvia is pgr_dijkstraVia **with points**" msgstr "pgr_withPointsvia 是 pgr_dijkstraVia **with points** 的版本" +#, fuzzy +#~ msgid "pgr_aStarCostMatrix(One to One)" +#~ msgstr "pgr_aStarCostMatrix(一对一)" + +#, fuzzy +#~ msgid "pgr_aStarCostMatrix(One to Many)" +#~ msgstr "pgr_aStarCostMatrix (一对多)" + +#, fuzzy +#~ msgid "pgr_aStarCostMatrix(Many to One)" +#~ msgstr "pgr_aStarCostMatrix (多对一)" + +#, fuzzy +#~ msgid "pgr_aStarCostMatrix(Many to Many)" +#~ msgstr "pgr_aStarCostMatrix（多对多）" + +#, fuzzy +#~ msgid "pgr_bdAstarCostMatrix(One to One)" +#~ msgstr "pgr_bdAstarCostMatrix(一对一)" + +#, fuzzy +#~ msgid "pgr_bdAstarCostMatrix(One to Many)" +#~ msgstr "pgr_bdAstarCostMatrix(一对多)" + +#, fuzzy +#~ msgid "pgr_bdAstarCostMatrix(Many to One)" +#~ msgstr "pgr_bdAstarCostMatrix （多对一）" + +#, fuzzy +#~ msgid "pgr_bdAstarCostMatrix(Many to Many)" +#~ msgstr "pgr_bdAstarCostMatrix （多对多）" + +#, fuzzy +#~ msgid "pgr_bdDijkstraCostMatrix(One to One)" +#~ msgstr "pgr_bdDijkstraCostMatrix(一对一)" + +#, fuzzy +#~ msgid "pgr_bdDijkstraCostMatrix(One to Many)" +#~ msgstr "pgr_bdDijkstraCostMatrix(一对多)" + +#, fuzzy +#~ msgid "pgr_bdDijkstraCostMatrix(Many to One)" +#~ msgstr "pgr_bdDijkstraCostMatrix (多对一)" + +#, fuzzy +#~ msgid "pgr_bdDijkstraCostMatrix(Many to Many)" +#~ msgstr "pgr_bdDijkstraCostMatrix（多对多）" + +#~ msgid "pgr_astar" +#~ msgstr "pgr_astar" + +#, fuzzy +#~ msgid "pgr_astar(One to Many)" +#~ msgstr "pgr_aStar(一对多）" + +#, fuzzy +#~ msgid "pgr_astar(Many to One)" +#~ msgstr "pgr_aStar(多对一）" + +#, fuzzy +#~ msgid "pgr_astar(Many to Many)" +#~ msgstr "pgr_aStar(多对多）" + +#, fuzzy +#~ msgid "pgr_astarCost(One to One)" +#~ msgstr "pgr_astarCost(一对一)" + +#, fuzzy +#~ msgid "pgr_astarCost(One to Many)" +#~ msgstr "pgr_astarCost(一对多)" + +#, fuzzy +#~ msgid "pgr_astarCost(Many to One)" +#~ msgstr "pgr_astarCost(多对一)" + +#, fuzzy +#~ msgid "pgr_astarCost(Many to Many)" +#~ msgstr "pgr_astarCost（多对多）" + +#~ msgid "``pgr_drivingdistance`` (Single vertex)" +#~ msgstr "``pgr_drivingdistance`` (单个顶点)" + +#~ msgid "``pgr_drivingdistance`` (Multiple vertices)" +#~ msgstr "``pgr_drivingdistance`` (多个顶点)" + +#, fuzzy +#~ msgid "**options:** [directed, heuristic, factor, epsilon]``" +#~ msgstr "**options:** ``[directed, heuristic, factor, epsilon]``" + +#, fuzzy +#~ msgid "New Proposed signatures:" +#~ msgstr "新拟议的签名：" + +#, fuzzy +#~ msgid "pgr_betweennessCentrality``" +#~ msgstr "``pgr_betweennessCentrality``" + +#, fuzzy +#~ msgid "" +#~ "`Boost: connected components `__" +#~ msgstr "" +#~ "Boost: ` 已连接组件 `__" + +#~ msgid "New functions" +#~ msgstr "新函数" + +#~ msgid "pgr_aStar(one to many)" +#~ msgstr "pgr_aStar（一对多）" + +#~ msgid "pgr_aStar(many to one)" +#~ msgstr "pgr_aStar（多对一）" + +#~ msgid "pgr_aStar(many to many)" +#~ msgstr "pgr_aStar（多对多）" + +#~ msgid "pgr_bdAstar(one to many)" +#~ msgstr "pgr_bdAstar（一对多）" + +#~ msgid "pgr_bdAstar(many to one)" +#~ msgstr "pgr_bdAstar（多对一）" + +#~ msgid "pgr_bdAstar(many to many)" +#~ msgstr "pgr_bdAstar（多对多）" + +#~ msgid "pgr_bdDijkstra(one to many)" +#~ msgstr "pgr_bdDijkstra（一对多）" + +#~ msgid "pgr_bdDijkstra(many to one)" +#~ msgstr "pgr_bdDijkstra（多对一）" + +#~ msgid "pgr_bdDijkstra(many to many)" +#~ msgstr "pgr_bdDijkstra（多对多）" + +#~ msgid "New Function." +#~ msgstr "新函数。" + +#~ msgid "pgr_astar(one to many)" +#~ msgstr "pgr_astar（一对多）" + +#~ msgid "pgr_astar(many to one)" +#~ msgstr "pgr_astar（多对一）" + +#~ msgid "pgr_astar(many to many)" +#~ msgstr "pgr_astar（多对多）" + +#~ msgid "pgr_dijkstraCost(one to many)" +#~ msgstr "pgr_dijkstraCost(一对多)" + +#~ msgid "pgr_dijkstraCost(many to one)" +#~ msgstr "pgr_dijkstraCost（多对一）" + +#~ msgid "pgr_dijkstraCost(many to many)" +#~ msgstr "pgr_dijkstraCost（多对多）" + +#~ msgid "pgr_withPoints(one to one)" +#~ msgstr "pgr_withPoints(一对一)" + +#~ msgid "pgr_withPoints(one to many)" +#~ msgstr "pgr_withPoints（一对多）" + +#~ msgid "pgr_withPoints(many to one)" +#~ msgstr "pgr_withPoints(多对一)" + +#~ msgid "pgr_withPoints(many to many)" +#~ msgstr "pgr_withPoints(多对多)" + +#~ msgid "pgr_dijkstra(one to many)" +#~ msgstr "pgr_dijkstra（一对多）" + +#~ msgid "pgr_dijkstra(many to one)" +#~ msgstr "pgr_dijkstra（多对一）" + +#~ msgid "pgr_dijkstra(many to many)" +#~ msgstr "pgr_dijkstra（多对多）" + +#~ msgid "The queries use the :doc:`sampledata` network." +#~ msgstr "查询使用 :doc:`sampledata` 网络。" + +#, fuzzy +#~ msgid "See also" +#~ msgstr "另请参阅" + +#~ msgid "New overload functions:" +#~ msgstr "新的重载函数：" + +#~ msgid "New **Official** function" +#~ msgstr "新函数 **Official**" + +#~ msgid ":doc:`sampledata` network." +#~ msgstr ":doc:`sampledata` 网络。" + +#~ msgid "" +#~ "``pgr_aStar`` (`One to One`_) added ``start_vid`` and ``end_vid`` columns." +#~ msgstr "``pgr_aStar`` (`一对一`_) 增加 ``start_vid`` 和 ``end_vid`` 列." + +#~ msgid "``pgr_aStar`` (`One to Many`_) added ``end_vid`` column." +#~ msgstr "``pgr_aStar`` (`一对多`_) 增加 ``end_vid`` 列." + +#~ msgid "``pgr_aStar`` (`Many to One`_) added ``start_vid`` column." +#~ msgstr "``pgr_aStar`` (`多对一`_) 增加 ``start_vid`` 列." + +#~ msgid "New **proposed** signature:" +#~ msgstr "新 **拟议** 的签名：" + +#~ msgid "``pgr_aStar`` (`Combinations`_)" +#~ msgstr "``pgr_aStar`` (`组合`_)" + +#~ msgid "New **Proposed** signatures:" +#~ msgstr "新 **拟议** 签名：" + +#~ msgid "``pgr_aStar`` (`One to Many`_)" +#~ msgstr "``pgr_aStar`` (`一对多`_)" + +#~ msgid "``pgr_aStar`` (`Many to One`_)" +#~ msgstr "``pgr_aStar`` (`多对一`_)" + +#~ msgid "``pgr_aStar`` (`Many to Many`_)" +#~ msgstr "``pgr_aStar`` (`多对多`_)" + +#~ msgid "**Official** ``pgr_aStar`` (`One to One`_)" +#~ msgstr "**官方** ``pgr_aStar`` (`一对一`_)" + +#~ msgid "``pgr_aStarCost`` (`Combinations`_)" +#~ msgstr "``pgr_aStarCost`` (`组合`_)" + +#~ msgid "New **proposed** function" +#~ msgstr "新 **拟议** 函数" + +#~ msgid "The examples use the :doc:`sampledata` network." +#~ msgstr "这些示例使用 :doc:`sampledata` 网络。" + +#~ msgid "New **experimental** function" +#~ msgstr "新 **实验** 函数" + +#~ msgid "" +#~ "``pgr_bdAstar`` (`One to One`_) added ``start_vid`` and ``end_vid`` " +#~ "columns." +#~ msgstr "``pgr_bdAstar`` (`一对一`_) 增加 ``start_vid`` 和 ``end_vid`` 列。" + +#~ msgid "``pgr_bdAstar`` (`One to Many`_) added ``end_vid`` column." +#~ msgstr "``pgr_bdAstar`` (`一对多`_) 增加 ``end_vid`` 列。" + +#~ msgid "``pgr_bdAstar`` (`Many to One`_) added ``start_vid`` column." +#~ msgstr "``pgr_bdAstar`` (`多对一`_) 增加 ``start_vid`` 列。" + +#~ msgid "``pgr_bdAstar`` (`Combinations`_)" +#~ msgstr "``pgr_bdAstar`` (`组合`_)" + +#~ msgid "``pgr_bdAstar`` (`One to Many`_)" +#~ msgstr "``pgr_bdAstar`` (`一对多`_)" + +#~ msgid "``pgr_bdAstar`` (`Many to One`_)" +#~ msgstr "``pgr_bdAstar`` (`多对一`_)" + +#~ msgid "``pgr_bdAstar`` (`Many to Many`_)" +#~ msgstr "``pgr_bdAstar`` (`多对多`_)" + +#~ msgid "**Official** ``pgr_bdAstar`` (`One to One`_)" +#~ msgstr "**官方** ``pgr_bdAstar`` (`一对一`_)" + +#~ msgid "``pgr_bdAstarCost`` (`Combinations`_)" +#~ msgstr "``pgr_bdAstarCost`` (`组合`_)" + +#~ msgid "pgr_bdDijkstra(`Combinations`_)" +#~ msgstr "pgr_bdDijkstra(`组合`_)" + +#~ msgid "New **Proposed** functions:" +#~ msgstr "新 **拟议** 函数：" + +#~ msgid "``pgr_bdDijkstra`` (`One to Many`_)" +#~ msgstr "``pgr_bdDijkstra`` (`一对多`_)" + +#~ msgid "``pgr_bdDijkstra`` (`Many to One`_)" +#~ msgstr "``pgr_bdDijkstra`` (`多对一`_)" + +#~ msgid "``pgr_bdDijkstra`` (`Many to Many`_)" +#~ msgstr "``pgr_bdDijkstra`` (`多对多`_)" + +#~ msgid "**Official** ``pgr_bdDijkstra`` (`One to One`_)" +#~ msgstr "**官方** ``pgr_bdDijkstra`` (`一对一`_)" + +#~ msgid "" +#~ "https://www.cs.princeton.edu/courses/archive/spr06/cos423/Handouts/" +#~ "EPP%20shortest%20path%20algorithms.pdf" +#~ msgstr "" +#~ "https://www.cs.princeton.edu/courses/archive/spr06/cos423/Handouts/" +#~ "EPP%20shortest%20path%20algorithms.pdf" + +#~ msgid "``pgr_bdDijkstraCost`` (`Combinations`_)" +#~ msgstr "``pgr_bdDijkstraCost`` (`组合`_)" + +#~ msgid "``pgr_bellmanFord`` (`Combinations`_)" +#~ msgstr "``pgr_bellmanFord`` (`组合`_)" + +#~ msgid "New **experimental** signatures:" +#~ msgstr "新 **实验** 签名：" + +#~ msgid "``pgr_bellmanFord`` (`One to One`_)" +#~ msgstr "``pgr_bellmanFord`` (`一对一`_)" + +#~ msgid "``pgr_bellmanFord`` (`One to Many`_)" +#~ msgstr "``pgr_bellmanFord`` (`一对多`_)" + +#~ msgid "``pgr_bellmanFord`` (`Many to One`_)" +#~ msgstr "``pgr_bellmanFord`` (`多对一`_)" + +#~ msgid "``pgr_bellmanFord`` (`Many to Many`_)" +#~ msgstr "``pgr_bellmanFord`` (`多对多`_)" + +#~ msgid "New **experimental** function:" +#~ msgstr "新的 **实验** 函数：" + +#~ msgid "Queries use the :doc:`sampledata` network." +#~ msgstr "查询使用 :doc:`sampledata` 网络。" + +#~ msgid "" +#~ "Boost: `Biconnected components `__" +#~ msgstr "" +#~ "Boost: `双连通分量 `__" + +#~ msgid "pgr_binaryBreadthFirstSearch(`Combinations`_)" +#~ msgstr "pgr_binaryBreadthFirstSearch(`组合`_)" + +#~ msgid "pgr_binaryBreadthFirstSearch(`One to One`_)" +#~ msgstr "pgr_binaryBreadthFirstSearch(`一对一`_)" + +#~ msgid "pgr_binaryBreadthFirstSearch(`One to Many`_)" +#~ msgstr "pgr_binaryBreadthFirstSearch(`一对多`_)" + +#~ msgid "pgr_binaryBreadthFirstSearch(`Many to One`_)" +#~ msgstr "pgr_binaryBreadthFirstSearch(`多对一`_)" + +#~ msgid "pgr_binaryBreadthFirstSearch(`Many to Many`_)" +#~ msgstr "pgr_binaryBreadthFirstSearch(`多对多`_)" + +#~ msgid "New **experimental** signature" +#~ msgstr "新的 **实验** 签名" + +#~ msgid "New **proposed** signature" +#~ msgstr "新的 **拟议** 签名" + +#~ msgid "``pgr_boykovKolmogorov`` (`Combinations`_)" +#~ msgstr "``pgr_boykovKolmogorov`` (`组合`_)" + +#~ msgid "**Proposed** function" +#~ msgstr "**拟议** 函数" + +#~ msgid "New **Experimental** function" +#~ msgstr "新的 **实验** 函数" + +#~ msgid "``pgr_breadthFirstSearch`` (`Single Vertex`_)" +#~ msgstr "``pgr_breadthFirstSearch`` (`单顶点搜索`_)" + +#~ msgid "``pgr_breadthFirstSearch`` (`Multiple Vertices`_)" +#~ msgstr "``pgr_breadthFirstSearch`` (`多顶点搜索`_)" + +#~ msgid "**Supported versions**" +#~ msgstr "**支持版本**" + +#~ msgid "The example uses the :doc:`sampledata` network." +#~ msgstr "本例使用 :doc:`sampledata` 网络。" + +#~ msgid "Promoted to **proposed** function" +#~ msgstr "升级至 **拟议** 函数" + +#~ msgid "``pgr_depthFirstSearch`` (`Single Vertex`_)" +#~ msgstr "``pgr_depthFirstSearch`` (`单个顶点`_)" + +#~ msgid "``pgr_depthFirstSearch`` (`Multiple Vertices`_)" +#~ msgstr "``pgr_depthFirstSearch`` (`多个顶点`_)" + +#~ msgid "" +#~ "``pgr_dijkstra`` (`One to One`_) added ``start_vid`` and ``end_vid`` " +#~ "columns." +#~ msgstr "``pgr_dijkstra`` (`一对一`_)增加``start_vid`` 和``end_vid`` 列。" + +#~ msgid "``pgr_dijkstra`` (`One to Many`_) added ``end_vid`` column." +#~ msgstr "``pgr_dijkstra`` (`一对多`_) 增加``end_vid`` 列。" + +#~ msgid "``pgr_dijkstra`` (`Many to One`_) added ``start_vid`` column." +#~ msgstr "``pgr_dijkstra`` (`多对一`_) 增加 ``start_vid`` 列。" + +#~ msgid "``pgr_dijkstra`` (`Combinations`_)" +#~ msgstr "``pgr_dijkstra`` (`组合`_)" + +#~ msgid "**Official** functions" +#~ msgstr "**官方** 函数" + +#~ msgid "New **proposed** functions:" +#~ msgstr "新的 **拟议** 函数：" + +#~ msgid "``pgr_dijkstra`` (`One to Many`_)" +#~ msgstr "``pgr_dijkstra`` (`一对多`_)" + +#~ msgid "``pgr_dijkstra`` (`Many to One`_)" +#~ msgstr "``pgr_dijkstra`` (`多对一`_)" + +#~ msgid "``pgr_dijkstra`` (`Many to Many`_)" +#~ msgstr "``pgr_dijkstra`` (`多对多`_)" + +#~ msgid "**Official** ``pgr_dijkstra`` (`One to One`_)" +#~ msgstr "**官方** ``pgr_dijkstra`` (`一对一`_)" + +#~ msgid "``pgr_dijkstraCost`` (`Combinations`_)" +#~ msgstr "``pgr_dijkstraCost`` (`组合`_)" + +#~ msgid "Signature change pgr_drivingDistance(single vertex)" +#~ msgstr "签名更改 pgr_drivingDistance（单顶点）" + +#~ msgid "New **Official** pgr_drivingDistance(multiple vertices)" +#~ msgstr "新 **官方** pgr_drivingDistance(多顶点)" + +#~ msgid "Official:: pgr_drivingDistance(single vertex)" +#~ msgstr "官方:: pgr_drivingDistance(单顶点)" + +#~ msgid "New **proposed** function:" +#~ msgstr "新的 **拟议** 函数：" + +#~ msgid "``pgr_edmondsKarp`` (`Combinations`_)" +#~ msgstr "``pgr_edmondsKarp`` (`组合`_)" + +#~ msgid "``pgr_edwardMoore`` (`Combinations`_)" +#~ msgstr "``pgr_edwardMoore`` (`组合`_)" + +#~ msgid "``pgr_edwardMoore`` (`One to One`_)" +#~ msgstr "``pgr_edwardMoore`` (`一对一`_)" + +#~ msgid "``pgr_edwardMoore`` (`One to Many`_)" +#~ msgstr "``pgr_edwardMoore`` (`一对多`_)" + +#~ msgid "``pgr_edwardMoore`` (`Many to One`_)" +#~ msgstr "``pgr_edwardMoore`` (`多对一`_)" + +#~ msgid "``pgr_edwardMoore`` (`Many to Many`_)" +#~ msgstr "``pgr_edwardMoore`` (`多对多`_)" + +#~ msgid "New **proposed** signatures:" +#~ msgstr "新的 **拟议** 签名：" + +#~ msgid "``pgr_findCloseEdges`` (`One point`_)" +#~ msgstr "``pgr_findCloseEdges`` (`一个点`_)" + +#~ msgid "``pgr_findCloseEdges`` (`Many points`_)" +#~ msgstr "``pgr_findCloseEdges`` (`多个点`_)" + +#~ msgid "Queries uses the :doc:`sampledata` network." +#~ msgstr "查询使用 :doc:`sampledata` 网络。" + +#~ msgid "Promoted to **proposed** signature." +#~ msgstr "晋升为**proposed** 签名。" + +#~ msgid "``pgr_maxFlow`` (`Combinations`_)" +#~ msgstr "``pgr_maxFlow`` (`组合`_)" + +#~ msgid "New **Proposed** function" +#~ msgstr "新 **拟议** 的函数" + +#~ msgid "``pgr_maxFlowMinCost`` (`Combinations`_)" +#~ msgstr "``pgr_maxFlowMinCost`` (`组合`_)" + +#~ msgid "" +#~ "https://www.boost.org/libs/graph/doc/" +#~ "successive_shortest_path_nonnegative_weights.html" +#~ msgstr "" +#~ "https://www.boost.org/libs/graph/doc/" +#~ "successive_shortest_path_nonnegative_weights.html" + +#~ msgid "``pgr_maxFlowMinCost_Cost`` (`Combinations`_)" +#~ msgstr "``pgr_maxFlowMinCost_Cost`` (`组合`_)" + +#~ msgid "``pgr_pushRelabel`` (`Combinations`_)" +#~ msgstr "``pgr_pushRelabel`` (`组合`_)" + +#~ msgid "Promoted to **proposed** signature" +#~ msgstr "晋升为 **拟议** 签名" + +#~ msgid "pgr_trsp - Proposed" +#~ msgstr "pgr_trsp - 拟议" + +#~ msgid "New proposed signatures" +#~ msgstr "新拟议的签名" + +#~ msgid "``pgr_trsp`` (`One to One`_)" +#~ msgstr "``pgr_trsp`` (`一对一`_)" + +#~ msgid "``pgr_trsp`` (`One to Many`_)" +#~ msgstr "``pgr_trsp`` (`一对多`_)" + +#~ msgid "``pgr_trsp`` (`Many to One`_)" +#~ msgstr "``pgr_trsp`` (`多对一`_)" + +#~ msgid "``pgr_trsp`` (`Many to Many`_)" +#~ msgstr "``pgr_trsp`` (`多对多`_)" + +#~ msgid "``pgr_trsp`` (`Combinations`_)" +#~ msgstr "``pgr_trsp`` (`组合`_)" + +#~ msgid "``pgr_trspVia`` - Proposed" +#~ msgstr "``pgr_trspVia`` - 拟议" + +#~ msgid "``pgr_trspVia`` (`One Via`_)" +#~ msgstr "``pgr_trspVia`` (`One Via`_)" + +#~ msgid "``pgr_trspVia_withPoints`` - Proposed" +#~ msgstr "``pgr_trspVia_withPoints`` - 拟议" + +#~ msgid "``pgr_trspVia_withPoints`` (`One Via`_)" +#~ msgstr "``pgr_trspVia_withPoints`` (`One Via`_)" + +#~ msgid "pgr_trsp_withPoints - Proposed" +#~ msgstr "pgr_trsp_withPoints - 拟议" + +#~ msgid "``pgr_trsp_withPoints`` (`One to One`_)" +#~ msgstr "``pgr_trsp_withPoints`` (`一对一`_)" + +#~ msgid "``pgr_trsp_withPoints`` (`One to Many`_)" +#~ msgstr "``pgr_trsp_withPoints`` (`一对多`_)" + +#~ msgid "``pgr_trsp_withPoints`` (`Many to One`_)" +#~ msgstr "``pgr_trsp_withPoints`` (`多对一`_)" + +#~ msgid "``pgr_trsp_withPoints`` (`Many to Many`_)" +#~ msgstr "``pgr_trsp_withPoints`` (`多对多`_)" + +#~ msgid "``pgr_trsp_withPoints`` (`Combinations`_)" +#~ msgstr "``pgr_trsp_withPoints`` (`组合`_)" + +#~ msgid "``pgr_withPoints`` - Proposed" +#~ msgstr "``pgr_withPoints`` -拟议" + +#~ msgid "``pgr_withPointsCost`` - Proposed" +#~ msgstr "``pgr_withPointsCost`` -拟议" + +#~ msgid "``pgr_withPointsCostMatrix`` - proposed" +#~ msgstr "``pgr_withPointsCostMatrix`` - 拟议" + +#~ msgid "``pgr_withPointsDD`` - Proposed" +#~ msgstr "``pgr_withPointsDD`` - 拟议" + +#~ msgid "``pgr_withPointsDD`` (`Single vertex`)" +#~ msgstr "``pgr_withPointsDD`` （`单顶点`）" + +#~ msgid "pgr_withPointsKSP - Proposed" +#~ msgstr "pgr_withPointsKSP -拟议" + +#~ msgid "New overload functions" +#~ msgstr "新的重载函数" + +#~ msgid "``pgr_withPointsKSP`` (Combinations)" +#~ msgstr "``pgr_withPointsKSP`` (组合)" + +#~ msgid "``pgr_withPointsVia`` - Proposed" +#~ msgstr "``pgr_withPointsVia`` - 拟议" + +#~ msgid "New **proposed** function ``pgr_withPointsVia`` (`One Via`_)" +#~ msgstr "新 **拟议** 的函数 ``pgr_withPointsVia`` (`One Via`_)" + +#~ msgid "``pgr_degree``" +#~ msgstr "``pgr_degree``" + +#~ msgid "New Proposed functions" +#~ msgstr "新的拟议函数" + +#~ msgid "New Proposed Signatures" +#~ msgstr "新的拟议签名"