diff --git a/NEWS.md b/NEWS.md index 28e0160e353..6e5bef74aa3 100644 --- a/NEWS.md +++ b/NEWS.md @@ -1,10 +1,11 @@ +To read all history of releases go to the latest [release notes](https://docs.pgrouting.org/latest/en/release_notes.html) + # pgRouting 3 ## pgRouting 3.8 -.. current ### pgRouting 3.8.0 Release Notes @@ -15,41 +16,45 @@ milestone for 3.8.0 **Promotion to official function of pgRouting.** * [#2772](https://github.com/pgRouting/pgrouting/issues/2772): - pgr_extractVertices + Promoted to official pgr_extractVertices in version 3.8 * Error messages adjustment. * Function promoted to official. * [#2760](https://github.com/pgRouting/pgrouting/issues/2760): - pgr_degree + Promoted to official pgr_degree in version 3.8 * Error messages adjustment. * New signature with only Edges SQL. * Function promoted to official. * [#2774](https://github.com/pgRouting/pgrouting/issues/2774): - pgr_findCloseEdges + Promoted to official pgr_findCloseEdges in version 3.8 * Error messages adjustment. * ``partial`` option is removed. * Function promoted to official. -**Deprecation of functions.** +**Proposed functions** -* [#2749](https://github.com/pgRouting/pgrouting/issues/2749): - pgr_alphaShape -* [#2754](https://github.com/pgRouting/pgrouting/issues/2754): - pgr_analyzeOneWay -* [#2753](https://github.com/pgRouting/pgrouting/issues/2753): - pgr_analyzeGraph -* [#2750](https://github.com/pgRouting/pgrouting/issues/2750): - pgr_createTopology -* [#2826](https://github.com/pgRouting/pgrouting/issues/2826): - pgr_createVerticesTable +* Contraction + + * [#2790](https://github.com/pgRouting/pgrouting/issues/2790): + pgr_contractionDeadEnd new contraction function + * [#2791](https://github.com/pgRouting/pgrouting/issues/2791): + pgr_contractionLinear new contraction function + +* Utilities + + * [#2848](https://github.com/pgRouting/pgrouting/issues/2848): + Create pgr_separateCrossing new utility function + * [#2849](https://github.com/pgRouting/pgrouting/issues/2849): + Create of pgr_separateTouching new utility function **Official functions changes** -* [#2786](https://github.com/pgRouting/pgrouting/issues/2786): pgr_contraction +* [#2786](https://github.com/pgRouting/pgrouting/issues/2786): + pgr_contraction(edges) new signature * New signature: * Previously compulsory parameter **Contraction order** is now optional with @@ -60,30 +65,34 @@ milestone for 3.8.0 **C/C++ code enhancements** * [#2802](https://github.com/pgRouting/pgrouting/issues/2802): - Code factorization on pgr_contraction family + Code reorganization on pgr_contraction **SQL code enhancements** * [#2850](https://github.com/pgRouting/pgrouting/issues/2850): Rewrite pgr_nodeNetwork -**New proposed functions** +**Deprecation of SQL functions** -* Contraction - - * [#2790](https://github.com/pgRouting/pgrouting/issues/2790): pgr_contractionDeadEnd - * [#2791](https://github.com/pgRouting/pgrouting/issues/2791): pgr_contractionLinear +* [#2749](https://github.com/pgRouting/pgrouting/issues/2749): + Deprecate pgr_AlphaShape in 3.8 +* [#2750](https://github.com/pgRouting/pgrouting/issues/2750): + Deprecate pgr_CreateTopology in 3.8 +* [#2753](https://github.com/pgRouting/pgrouting/issues/2753): + Deprecate pgr_analyzeGraph in 3.8 +* [#2754](https://github.com/pgRouting/pgrouting/issues/2754): + Deprecate pgr_analyzeOneWay in 3.8 +* [#2826](https://github.com/pgRouting/pgrouting/issues/2826): + Deprecate pgr_createVerticesTable in 3.8 -* Utilities +In the deprecated functions: - * [#2848](https://github.com/pgRouting/pgrouting/issues/2848): - pgr_separateCrossing - * [#2849](https://github.com/pgRouting/pgrouting/issues/2849): - pgr_separateTouching +- Migration section is created. +- The use of the functions is removed in the documentation. ## pgRouting 3.7 -### pgRouting 3.7.3 Release Notes +
pgRouting 3.7.3 Release Notes To see all issues & pull requests closed by this release see the [Git closed milestone for 3.7.3 @@ -91,7 +100,9 @@ milestone for 3.7.3 * [#2731](https://github.com/pgRouting/pgrouting/pull/2731) Build Failure on Ubuntu 22 -### pgRouting 3.7.2 Release Notes +
+ +
pgRouting 3.7.2 Release Notes To see all issues & pull requests closed by this release see the [Git closed milestone for 3.7.2 @@ -112,7 +123,9 @@ milestone for 3.7.2 * [#2706](https://github.com/pgRouting/pgrouting/pull/2706) winnie crashing on pgr_betweennessCentrality -### pgRouting 3.7.1 Release Notes +
+ +
pgRouting 3.7.1 Release Notes To see all issues & pull requests closed by this release see the [Git closed milestone for 3.7.1 @@ -129,7 +142,9 @@ milestone for 3.7.1 * TRSP family -### pgRouting 3.7.0 Release Notes +
+ +
pgRouting 3.7.0 Release Notes To see all issues & pull requests closed by this release see the [Git closed milestone for 3.7.0 @@ -163,7 +178,7 @@ milestone for 3.7.0 * ``pgr_primDFS`` * ``pgr_primBFS`` - * Standarizing output columns to ``(seq, depth, start_vid, pred, node, edge, cost, agg_cost)`` + * Standardizing output columns to ``(seq, depth, start_vid, pred, node, edge, cost, agg_cost)`` * Added ``pred`` result columns. **Experimental promoted to proposed.** @@ -185,10 +200,12 @@ milestone for 3.7.0 * [#2614](https://github.com/pgRouting/pgrouting/pull/2614) Clang tidy does not work +
+ ## pgRouting 3.6 -### pgRouting 3.6.3 Release Notes +
pgRouting 3.6.3 Release Notes To see all issues & pull requests closed by this release see the [Git closed milestone for 3.6.3 @@ -226,7 +243,9 @@ milestone for 3.6.3 * bug fixes -### pgRouting 3.6.2 Release Notes +
+ +
pgRouting 3.6.2 Release Notes To see all issues & pull requests closed by this release see the [Git closed milestone for 3.6.2 @@ -246,7 +265,9 @@ milestone for 3.6.2 * Name change to `NEWS.md` for better visualization on GitHub -### pgRouting 3.6.1 Release Notes +
+ +
pgRouting 3.6.1 Release Notes To see all issues & pull requests closed by this release see the [Git closed milestone for 3.6.1 @@ -255,7 +276,9 @@ milestone for 3.6.1 * [#2588](https://github.com/pgRouting/pgrouting/pull/2588) pgrouting 3.6.0 fails to build on OSX -### pgRouting 3.6.0 Release Notes +
+ +
pgRouting 3.6.0 Release Notes To see all issues & pull requests closed by this release see the [Git closed milestone for 3.6.0 @@ -285,7 +308,7 @@ milestone for 3.6.0 * [#2547](https://github.com/pgRouting/pgrouting/pull/2547) Standardize output and modifying signature pgr_KSP - * Result columns standarized to: ``(seq, path_id, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)`` + * Standardizing output columns to ``(seq, path_id, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)`` * pgr_ksp(One to One) * Added ``start_vid`` and ``end_vid`` result columns. * New proposed signatures: @@ -297,7 +320,7 @@ milestone for 3.6.0 * [#2548](https://github.com/pgRouting/pgrouting/pull/2548) Standardize output pgr_drivingDistance - * Standarizing output columns to ``(seq, depth, start_vid, pred, node, edge, cost, agg_cost)`` + * Standardizing output columns to ``(seq, depth, start_vid, pred, node, edge, cost, agg_cost)`` * pgr_drivingDistance(Single vertex) * Added ``depth`` and ``start_vid`` result columns. * pgr_drivingDistance(Multiple vertices) @@ -313,7 +336,7 @@ milestone for 3.6.0 unnamed compulsory **driving side**. * pgr_withPointsDD(Single vertex) * pgr_withPointsDD(Multiple vertices) - * Standarizing output columns to ``(seq, depth, start_vid, pred, node, edge, cost, agg_cost)`` + * Standardizing output columns to ``(seq, depth, start_vid, pred, node, edge, cost, agg_cost)`` * pgr_withPointsDD(Single vertex) * Added ``depth``, ``pred`` and ``start_vid`` column. * pgr_withPointsDD(Multiple vertices) @@ -322,13 +345,13 @@ milestone for 3.6.0 * Only points that are visited are removed, that is, points reached within the distance are included * Deprecated signatures - * pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)`` - * pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)`` + * pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean) + * pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean) * [#2546](https://github.com/pgRouting/pgrouting/pull/2546) Standardize output and modifying signature pgr_withPointsKSP - * Standarizing output columns to ``(seq, path_id, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)`` + * Standardizing output columns to ``(seq, path_id, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)`` * pgr_withPointsKSP(One to One) * Signature change: ``driving_side`` parameter changed from named optional to unnamed compulsory **driving side**. @@ -369,10 +392,12 @@ milestone for 3.6.0 deprecated messages * On new internal function: do not use named parameters and default parameters. +
+ ## pgRouting 3.5 -### pgRouting 3.5.1 Release Notes +
pgRouting 3.5.1 Release Notes To see all issues & pull requests closed by this release see the [Git closed milestone for 3.5.1 @@ -413,7 +438,9 @@ Changes on the documentation to the following: * Grouping headers of postgres readers -### pgRouting 3.5.0 Release Notes +
+ +
pgRouting 3.5.0 Release Notes To see all issues & pull requests closed by this release see the [Git closed milestone for 3.5.0 @@ -429,10 +456,12 @@ milestone for 3.5.0 * pgr_dijkstra(One to Many) added ``end_vid`` column. * pgr_dijkstra(Many to One) added ``start_vid`` column. +
+ ## pgRouting 3.4 -### pgRouting 3.4.2 Release Notes +
pgRouting 3.4.2 Release Notes To see all issues & pull requests closed by this release see the [Git closed milestone for 3.4.2 @@ -445,7 +474,9 @@ milestone for 3.4.2 * [#2427](https://github.com/pgRouting/pgrouting/issues/2427): pgr_createVerticesTable & pgr_createTopology, variable should be of type Record. -### pgRouting 3.4.1 Release Notes +
+ +
pgRouting 3.4.1 Release Notes To see all issues & pull requests closed by this release see the [Git closed milestone for 3.4.1 @@ -458,7 +489,9 @@ milestone for 3.4.1 * [#2398](https://github.com/pgRouting/pgrouting/issues/2398): v3.4.0 does not upgrade from 3.3.3 -### pgRouting 3.4.0 Release Notes +
+ +
pgRouting 3.4.0 Release Notes To see all issues & pull requests closed by this release see the [Git closed milestone for 3.4.0 @@ -534,15 +567,19 @@ milestone for 3.4.0 * pgr_trspViaVertices(text,anyarray,boolean,boolean,text) * pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text) +
+ ## pgRouting 3.3 -### pgRouting 3.3.5 Release Notes +
pgRouting 3.3.5 Release Notes * [#2401](https://github.com/pgRouting/pgrouting/issues/2401): pgRouting 3.4.0 do not build docs when sphinx is too low or missing -### pgRouting 3.3.4 Release Notes +
+ +
pgRouting 3.3.4 Release Notes To see all issues & pull requests closed by this release see the [Git closed milestone for 3.3.4 @@ -553,7 +590,9 @@ milestone for 3.3.4 * [#2400](https://github.com/pgRouting/pgrouting/issues/2400): pgRouting 3.3.3 does not build in focal -### pgRouting 3.3.3 Release Notes +
+ +
pgRouting 3.3.3 Release Notes To see all issues & pull requests closed by this release see the [Git closed milestone for 3.3.3 @@ -574,7 +613,9 @@ milestone for 3.3.3 undirected graphs. -### pgRouting 3.3.2 Release Notes +
+ +
pgRouting 3.3.2 Release Notes To see all issues & pull requests closed by this release see the [Git closed milestone for 3.3.2 @@ -610,7 +651,9 @@ milestone for 3.3.2 * [#2357](https://github.com/pgRouting/pgrouting/issues/2357): Apply clang-tidy performance-* -### pgRouting 3.3.1 Release Notes +
+ +
pgRouting 3.3.1 Release Notes To see all issues & pull requests closed by this release see the [Git closed milestone for 3.3.1 @@ -623,7 +666,9 @@ on Github. * [#2266](https://github.com/pgRouting/pgrouting/issues/2266): Error processing restrictions -### pgRouting 3.3.0 Release Notes +
+ +
pgRouting 3.3.0 Release Notes To see all issues & pull requests closed by this release see the [Git closed milestone for 3.3.0 @@ -675,10 +720,12 @@ on Github. * pgr_depthFirstSearch(Multiple vertices) * pgr_depthFirstSearch(Single vertex) +
+ ## pgRouting 3.2 -### pgRouting 3.2.2 Release Notes +
pgRouting 3.2.2 Release Notes To see all issues & pull requests closed by this release see the [Git closed milestone for 3.2.2 @@ -690,7 +737,9 @@ on Github. * [#2093](https://github.com/pgRouting/pgrouting/issues/2093): Compilation on Visual Studio * [#2189](https://github.com/pgRouting/pgrouting/issues/2189): Build error on RHEL 7 -### pgRouting 3.2.1 Release Notes +
+ +
pgRouting 3.2.1 Release Notes To see all issues & pull requests closed by this release see the [Git closed milestone for 3.2.1 @@ -706,7 +755,9 @@ on Github. * The function with the annaeling optional parameters is deprecated -### pgRouting 3.2.0 Release Notes +
+ +
pgRouting 3.2.0 Release Notes To see all issues & pull requests closed by this release see the [Git closed milestone for 3.2.0 @@ -782,10 +833,12 @@ on Github. * pgr_withPoints(Combinations) * pgr_withPointsCost(Combinations) +
+ ## pgRouting 3.1 -### pgRouting 3.1.4 Release Notes +
pgRouting 3.1.4 Release Notes To see all issues & pull requests closed by this release see the [Git closed milestone for 3.1.4 @@ -798,7 +851,9 @@ on Github. RHEL 7 -### pgRouting 3.1.3 Release Notes +
+ +
pgRouting 3.1.3 Release Notes To see all issues & pull requests closed by this release see the [Git closed milestone for 3.1.3 @@ -815,7 +870,9 @@ on Github. crash server -### pgRouting 3.1.2 Release Notes +
+ +
pgRouting 3.1.2 Release Notes To see all issues & pull requests closed by this release see the [Git closed milestone for 3.1.2 @@ -836,7 +893,9 @@ on Github. warnings when using clang compiler -### pgRouting 3.1.1 Release Notes +
+ +
pgRouting 3.1.1 Release Notes To see all issues & pull requests closed by this release see the [Git closed milestone for 3.1.1 @@ -858,7 +917,9 @@ on Github. -### pgRouting 3.1.0 Release Notes +
+ +
pgRouting 3.1.0 Release Notes To see all issues & pull requests closed by this release see the [Git closed milestone for 3.1.0 @@ -874,10 +935,12 @@ on Github. * Minimal requirement for Sphinx: version 1.8 +
+ ## pgRouting 3.0 -### pgRouting 3.0.6 Release Notes +
pgRouting 3.0.6 Release Notes To see all issues & pull requests closed by this release see the [Git closed milestone for 3.0.6 @@ -890,7 +953,9 @@ on Github. RHEL 7 -### pgRouting 3.0.5 Release Notes +
+ +
pgRouting 3.0.5 Release Notes To see all issues & pull requests closed by this release see the [Git closed milestone for 3.0.5 @@ -907,7 +972,9 @@ on Github. crash server -### pgRouting 3.0.4 Release Notes +
+ +
pgRouting 3.0.4 Release Notes To see all issues & pull requests closed by this release see the [Git closed milestone for 3.0.4 @@ -929,7 +996,9 @@ on Github. -### pgRouting 3.0.3 Release Notes +
+ +
pgRouting 3.0.3 Release Notes **Backport issue fixes** @@ -946,7 +1015,9 @@ on Github. -### pgRouting 3.0.2 Release Notes +
+ +
pgRouting 3.0.2 Release Notes To see all issues & pull requests closed by this release see the [Git closed milestone for 3.0.2 @@ -959,7 +1030,9 @@ on Github. build failing -### pgRouting 3.0.1 Release Notes +
+ +
pgRouting 3.0.1 Release Notes To see all issues & pull requests closed by this release see the [Git closed milestone for 3.0.1 @@ -972,7 +1045,9 @@ on Github. cancel requests in C /C++ code -### pgRouting 3.0.0 Release Notes +
+ +
pgRouting 3.0.0 Release Notes To see all issues & pull requests closed by this release see the [Git closed @@ -1133,750 +1208,4 @@ on Github. * pgr_pointsAsPolygon * pgr_alphaShape old signature -# pgRouting 2 - - -## pgRouting 2.6 - - -### pgRouting 2.6.3 Release Notes - -To see the issues closed by this release see the [Git closed milestone for 2.6.3 -](https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.6.3%22%20) -on Github. - -**Bug fixes** - -* [#1219](https://github.com/pgRouting/pgrouting/pull/1219) Implicit cast for - via_path integer to text -* [#1193](https://github.com/pgRouting/pgrouting/pull/1193) Fixed - pgr_pointsAsPolygon breaking when comparing strings in WHERE clause -* [#1185](https://github.com/pgRouting/pgrouting/pull/1185) Improve - FindPostgreSQL.cmake - - - -### pgRouting 2.6.2 Release Notes - -To see the issues closed by this release see the [Git closed milestone for 2.6.2 -](https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.6.2%22%20) -on Github. - -**Bug fixes** - -* [#1152](https://github.com/pgRouting/pgrouting/issues/1152) Fixes driving - distance when vertex is not part of the graph -* [#1098](https://github.com/pgRouting/pgrouting/issues/1098) Fixes windows - test -* [#1165](https://github.com/pgRouting/pgrouting/issues/1165) Fixes build for - python3 and perl5 - - -### pgRouting 2.6.1 Release Notes - -To see the issues closed by this release see the [Git closed milestone for 2.6.1 -](https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.6.1%22%20) -on Github. - -* Fixes server crash on several functions. - - * pgr_floydWarshall - * pgr_johnson - * pgr_aStar - * pgr_bdAstar - * pgr_bdDijstra - * pgr_alphashape - * pgr_dijkstraCostMatrix - * pgr_dijkstra - * pgr_dijkstraCost - * pgr_drivingDistance - * pgr_KSP - * pgr_dijkstraVia (proposed) - * pgr_boykovKolmogorov (proposed) - * pgr_edgeDisjointPaths (proposed) - * pgr_edmondsKarp (proposed) - * pgr_maxCardinalityMatch (proposed) - * pgr_maxFlow (proposed) - * pgr_withPoints (proposed) - * pgr_withPointsCost (proposed) - * pgr_withPointsKSP (proposed) - * pgr_withPointsDD (proposed) - * pgr_withPointsCostMatrix (proposed) - * pgr_contractGraph (experimental) - * pgr_pushRelabel (experimental) - * pgr_vrpOneDepot (experimental) - * pgr_gsoc_vrppdtw (experimental) - * Fixes for deprecated functions where also applied but not tested - -* Removed compilation warning for g++8 -* Fixed a fallthrugh on Astar and bdAstar. - - -### pgRouting 2.6.0 Release Notes - -To see the issues closed by this release see the [Git closed milestone for 2.6.0 -](https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.6.0%22%20) -on Github. - - -**New experimental functions** - -* pgr_lineGraphFull - -**Bug fixes** - -* Fix pgr_trsp(text,integer,double precision,integer,double - precision,boolean,boolean[,text]) - - * without restrictions - - * calls pgr_dijkstra when both end points have a fraction IN (0,1) - * calls pgr_withPoints when at least one fraction NOT IN (0,1) - - * with restrictions - - * calls original trsp code - -**Internal code** - -* Cleaned the internal code of trsp(text,integer,integer,boolean,boolean [, - text]) - - * Removed the use of pointers - * Internal code can accept BIGINT - -* Cleaned the internal code of withPoints - -## pgRouting 2.5 - - -### pgRouting 2.5.5 Release Notes - -To see the issues closed by this release see the [Git closed milestone for 2.5.5 -](https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.5%22%20) -on Github. - -**Bug fixes** - -* Fixes driving distance when vertex is not part of the graph -* Fixes windows test -* Fixes build for python3 and perl5 - - -### pgRouting 2.5.4 Release Notes - -To see the issues closed by this release see the [Git closed milestone for 2.5.4 -](https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.4%22%20) -on Github. - -* Fixes server crash on several functions. - - * pgr_floydWarshall - * pgr_johnson - * pgr_aStar - * pgr_bdAstar - * pgr_bdDijstra - * pgr_alphashape - * pgr_dijkstraCostMatrix - * pgr_dijkstra - * pgr_dijkstraCost - * pgr_drivingDistance - * pgr_KSP - * pgr_dijkstraVia (proposed) - * pgr_boykovKolmogorov (proposed) - * pgr_edgeDisjointPaths (proposed) - * pgr_edmondsKarp (proposed) - * pgr_maxCardinalityMatch (proposed) - * pgr_maxFlow (proposed) - * pgr_withPoints (proposed) - * pgr_withPointsCost (proposed) - * pgr_withPointsKSP (proposed) - * pgr_withPointsDD (proposed) - * pgr_withPointsCostMatrix (proposed) - * pgr_contractGraph (experimental) - * pgr_pushRelabel (experimental) - * pgr_vrpOneDepot (experimental) - * pgr_gsoc_vrppdtw (experimental) - * Fixes for deprecated functions where also applied but not tested - -* Removed compilation warning for g++8 -* Fixed a fallthrugh on Astar and bdAstar. - - -### pgRouting 2.5.3 Release Notes - -To see the issues closed by this release see the [Git closed milestone for 2.5.3 -](https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.3%22%20) -on Github. - -**Bug fixes** - -* Fix for postgresql 11: Removed a compilation error when compiling with - postgreSQL - - -### pgRouting 2.5.2 Release Notes - -To see the issues closed by this release see the [Git closed milestone for 2.5.2](https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.2%22%20) on Github. - -**Bug fixes** - -* Fix for postgresql 10.1: Removed a compiler condition - - - -### pgRouting 2.5.1 Release Notes - -To see the issues closed by this release see the [Git closed milestone for 2.5.1 -](https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.1%22%20) -on Github. - -**Bug fixes** - -* Fixed prerequisite minimum version of: cmake - - - -### pgRouting 2.5.0 Release Notes - -To see the issues closed by this release see the [Git closed issues for 2.5.0 -](https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+2.5.0%22+is%3Aclosed) -on Github. - - -**enhancement:** - -* pgr_version is now on SQL language - -**Breaking change on:** - -* pgr_edgeDisjointPaths: - - * Added path_id, cost and agg_cost columns on the result - * Parameter names changed - * The many version results are the union of the One to One version - -**New Signatures** - -* pgr_bdAstar(One to One) - -**New proposed functions.** - -* pgr_bdAstar(One to Many) -* pgr_bdAstar(Many to One) -* pgr_bdAstar(Many to Many) -* pgr_bdAstarCost(One to One) -* pgr_bdAstarCost(One to Many) -* pgr_bdAstarCost(Many to One) -* pgr_bdAstarCost(Many to Many) -* pgr_bdAstarCostMatrix -* pgr_bdDijkstra(One to Many) -* pgr_bdDijkstra(Many to One) -* pgr_bdDijkstra(Many to Many) -* pgr_bdDijkstraCost(One to One) -* pgr_bdDijkstraCost(One to Many) -* pgr_bdDijkstraCost(Many to One) -* pgr_bdDijkstraCost(Many to Many) -* pgr_bdDijkstraCostMatrix -* pgr_lineGraph -* pgr_lineGraphFull -* pgr_connectedComponents -* pgr_strongComponents -* pgr_biconnectedComponents -* pgr_articulationPoints -* pgr_bridges - -**Deprecated signatures** - -* pgr_bdastar - use pgr_bdAstar instead - -**Renamed functions** - -* pgr_maxFlowPushRelabel - use pgr_pushRelabel instead -* pgr_maxFlowEdmondsKarp -use pgr_edmondsKarp instead -* pgr_maxFlowBoykovKolmogorov - use pgr_boykovKolmogorov instead -* pgr_maximumCardinalityMatching - use pgr_maxCardinalityMatch instead - -**Deprecated Function** - -* pgr_pointToEdgeNode - - -## pgRouting 2.4 - - -### pgRouting 2.4.2 Release Notes - -To see the issues closed by this release see the [Git closed milestone for 2.4.2 -](https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.4.2%22%20) -on Github. - -**Improvement** - -* Works for postgreSQL 10 - -**Bug fixes** - -* Fixed: Unexpected error column "cname" -* Replace __linux__ with __GLIBC__ for glibc-specific headers and functions - - - - -### pgRouting 2.4.1 Release Notes - -To see the issues closed by this release see the [Git closed milestone for 2.4.1 -](https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.4.1%22%20) -on Github. - -**Bug fixes** - -* Fixed compiling error on macOS -* Condition error on pgr_withPoints - - -### pgRouting 2.4.0 Release Notes - -To see the issues closed by this release see the [Git closed issues for 2.4.0 -](https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+2.4.0%22+is%3Aclosed) -on Github. - -**New Functions** - -* pgr_bdDijkstra - - -**New proposed signatures:** - -* pgr_maxFlow -* pgr_aStar(One to Many) -* pgr_aStar(Many to One) -* pgr_aStar(Many to Many) -* pgr_aStarCost(One to One) -* pgr_aStarCost(One to Many) -* pgr_aStarCost(Many to One) -* pgr_aStarCost(Many to Many) -* pgr_aStarCostMatrix - -**Deprecated signatures.** - -* pgr_bddijkstra - use pgr_bdDijkstra instead - -**Deprecated Functions** - -* pgr_pointsToVids - -**Bug fixes** - -* Bug fixes on proposed functions - - * pgr_withPointsKSP: fixed ordering - -* TRSP original code is used with no changes on the compilation warnings - -## pgRouting 2.3 - -### pgRouting 2.3.2 Release Notes - -To see the issues closed by this release see the [Git closed issues for 2.3.2 -](https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+2.3.2%22+is%3Aclosed) -on Github. - -**Bug Fixes** - -* Fixed pgr_gsoc_vrppdtw crash when all orders fit on one truck. -* Fixed pgr_trsp: - - * Alternate code is not executed when the point is in reality a vertex - * Fixed ambiguity on seq - - - -### pgRouting 2.3.1 Release Notes - -To see the issues closed by this release see the [Git closed issues for 2.3.1 -](https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+2.3.1%22+is%3Aclosed) -on Github. - -**Bug Fixes** - -* Leaks on proposed max_flow functions -* Regression error on pgr_trsp -* Types discrepancy on pgr_createVerticesTable - - - -### pgRouting 2.3.0 Release Notes - -To see the issues closed by this release see the [Git closed issues for 2.3.0 -](https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+2.3.0%22+is%3Aclosed) -on Github. - -**New Signatures** - -* pgr_TSP -* pgr_aStar - -**New Functions** - -* pgr_eucledianTSP - - -**New proposed functions.** - -* pgr_dijkstraCostMatrix -* pgr_withPointsCostMatrix -* pgr_maxFlowPushRelabel(One to One) -* pgr_maxFlowPushRelabel(One to Many) -* pgr_maxFlowPushRelabel(Many to One) -* pgr_maxFlowPushRelabel(Many to Many) -* pgr_maxFlowEdmondsKarp(One to One) -* pgr_maxFlowEdmondsKarp(One to Many) -* pgr_maxFlowEdmondsKarp(Many to One) -* pgr_maxFlowEdmondsKarp(Many to Many) -* pgr_maxFlowBoykovKolmogorov (One to One) -* pgr_maxFlowBoykovKolmogorov (One to Many) -* pgr_maxFlowBoykovKolmogorov (Many to One) -* pgr_maxFlowBoykovKolmogorov (Many to Many) -* pgr_maximumCardinalityMatching -* pgr_edgeDisjointPaths(One to One) -* pgr_edgeDisjointPaths(One to Many) -* pgr_edgeDisjointPaths(Many to One) -* pgr_edgeDisjointPaths(Many to Many) -* pgr_contractGraph - - -**Deprecated signatures** - -* pgr_tsp - use pgr_TSP or pgr_eucledianTSP instead -* pgr_aStar - use pgr_aStar instead - - -**Deprecated Functions** - -* pgr_flip_edges -* pgr_vidsToDmatrix -* pgr_pointsToDMatrix -* pgr_textToPoints - -## pgRouting 2.2 - - -### pgRouting 2.2.4 Release Notes - -To see the issues closed by this release see the [Git closed issues for 2.2.4 -](https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+2.2.4%22+is%3Aclosed) -on Github. - -**Bug Fixes** - -* Bogus uses of extern "C" -* Build error on Fedora 24 + GCC 6.0 -* Regression error pgr_nodeNetwork - - -### pgRouting 2.2.3 Release Notes - -To see the issues closed by this release see the [Git closed issues for 2.2.3 -](https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+2.2.3%22+is%3Aclosed) -on Github. - -**Bug Fixes** - -* Fixed compatibility issues with PostgreSQL 9.6. - - -### pgRouting 2.2.2 Release Notes - -To see the issues closed by this release see the [Git closed issues for 2.2.2 -](https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+2.2.2%22+is%3Aclosed) -on Github. - -**Bug Fixes** - -* Fixed regression error on pgr_drivingDistance - - - -### pgRouting 2.2.1 Release Notes - -To see the issues closed by this release see the [Git closed issues for 2.2.1 -](https://github.com/pgRouting/pgrouting/issues?q=milestone%3A2.2.1+is%3Aclosed) -on Github. - -**Bug Fixes** - -* Server crash fix on pgr_alphaShape -* Bug fix on With Points family of functions - - - -### pgRouting 2.2.0 Release Notes - -To see the issues closed by this release see the [Git closed issues for 2.2.0 -](https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+2.2.0%22+is%3Aclosed) -on Github. - - -**Improvements** - -- pgr_nodeNetwork - - - Adding a row_where and outall optional parameters - -- Signature fix - - - pgr_dijkstra -- to match what is documented - - -**New Functions** - -- pgr_floydWarshall -- pgr_Johnson -- pgr_dijkstraCost(One to One) -- pgr_dijkstraCost(One to Many) -- pgr_dijkstraCost(Many to One) -- pgr_dijkstraCost(Many to Many) - -**Proposed Functionality** - -- pgr_withPoints(One to One) -- pgr_withPoints(One to Many) -- pgr_withPoints(Many to One) -- pgr_withPoints(Many to Many) -- pgr_withPointsCost(One to One) -- pgr_withPointsCost(One to Many) -- pgr_withPointsCost(Many to One) -- pgr_withPointsCost(Many to Many) -- pgr_withPointsDD(single vertex) -- pgr_withPointsDD(multiple vertices) -- pgr_withPointsKSP -- pgr_dijkstraVia - - -**Deprecated Functions** - -- pgr_apspWarshall use pgr_floydWarshall instead -- pgr_apspJohnson use pgr_Johnson instead -- pgr_kDijkstraCost use pgr_dijkstraCost instead -- pgr_kDijkstraPath use pgr_dijkstra instead - -**Renamed and Deprecated Function** - -- pgr_makeDistanceMatrix renamed to _pgr_makeDistanceMatrix - -## pgRouting 2.1 - - -### pgRouting 2.1.0 Release Notes - -To see the issues closed by this release see the [Git closed issues for 2.1.0 -](https://github.com/pgRouting/pgrouting/issues?q=is%3Aissue+milestone%3A%22Release+2.1.0%22+is%3Aclosed) -on Github. - -**New Signatures** - -- pgr_dijkstra(One to Many) -- pgr_dijkstra(Many to One) -- pgr_dijkstra(Many to Many) -- pgr_drivingDistance(multiple vertices) - -**Refactored** - -- pgr_dijkstra(One to One) -- pgr_ksp -- pgr_drivingDistance(single vertex) - -**Improvements** - -- pgr_alphaShape function now can generate better (multi)polygon with holes and - alpha parameter. - -**Proposed Functionality** - -- Proposed functions from Steve Woodbridge, (Classified as Convenience by the - author.) - - - pgr_pointToEdgeNode - convert a point geometry to a vertex_id based on - closest edge. - - pgr_flipEdges - flip the edges in an array of geometries so the connect end - to end. - - pgr_textToPoints - convert a string of x,y;x,y;... locations into point - geometries. - - pgr_pointsToVids - convert an array of point geometries into vertex ids. - - pgr_pointsToDMatrix - Create a distance matrix from an array of points. - - pgr_vidsToDMatrix - Create a distance matrix from an array of vertix_id. - - pgr_vidsToDMatrix - Create a distance matrix from an array of vertix_id. - -- Added proposed functions from GSoc Projects: - - - pgr_vrppdtw - - pgr_vrponedepot - -**Deprecated Functions** - -- pgr_getColumnName -- pgr_getTableName -- pgr_isColumnCndexed -- pgr_isColumnInTable -- pgr_quote_ident -- pgr_versionless -- pgr_startPoint -- pgr_endPoint -- pgr_pointToId - -**No longer supported** - -- Removed the 1.x legacy functions - -**Bug Fixes** - -- Some bug fixes in other functions - - -**Refactoring Internal Code** - -- A C and C++ library for developer was created - - - encapsulates postgreSQL related functions - - encapsulates Boost.Graph graphs - - - Directed Boost.Graph - - Undirected Boost.graph. - - - allow any-integer in the id's - - allow any-numerical on the cost/reverse_cost columns - -- Instead of generating many libraries: - - All functions are encapsulated in one library - - The library has the prefix 2-1-0 - - -## pgRouting 2.0 - - -### pgRouting 2.0.1 Release Notes - -Minor bug fixes. - -**Bug Fixes** - -* No track of the bug fixes were kept. - -### pgRouting 2.0.0 Release Notes - -To see the issues closed by this release see the [Git closed issues for 2.0.0 -](https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+2.0.0%22+is%3Aclosed) -on Github. - -With the release of pgRouting 2.0.0 the library has abandoned backwards -compatibility to `pgRouting 1.0`_ releases. -The main Goals for this release are: - -* Major restructuring of pgRouting. -* Standardization of the function naming -* Preparation of the project for future development. - -As a result of this effort: - -* pgRouting has a simplified structure -* Significant new functionality has being added -* Documentation has being integrated -* Testing has being integrated -* And made it easier for multiple developers to make contributions. - - -**Important Changes** - -* Graph Analytics - tools for detecting and fixing connection some problems in a - graph -* A collection of useful utility functions -* Two new All Pairs Short Path algorithms (pgr_apspJohnson, pgr_apspWarshall) -* Bi-directional Dijkstra and A-star search algorithms (pgr_bdAstar, - pgr_bdDijkstra) -* One to many nodes search (pgr_kDijkstra) -* K alternate paths shortest path (pgr_ksp) -* New TSP solver that simplifies the code and the build process (pgr_tsp), - dropped "Gaul Library" dependency -* Turn Restricted shortest path (pgr_trsp) that replaces Shooting Star -* Dropped support for Shooting Star -* Built a test infrastructure that is run before major code changes are checked - in -* Tested and fixed most all of the outstanding bugs reported against 1.x that - existing in the 2.0-dev code base. -* Improved build process for Windows -* Automated testing on Linux and Windows platforms trigger by every commit -* Modular library design -* Compatibility with PostgreSQL 9.1 or newer -* Compatibility with PostGIS 2.0 or newer -* Installs as PostgreSQL EXTENSION -* Return types re factored and unified -* Support for table SCHEMA in function parameters -* Support for ``st_`` PostGIS function prefix -* Added ``pgr_`` prefix to functions and types -* Better documentation: https://docs.pgrouting.org -* shooting_star is discontinued - -# pgRouting 1 - -## pgRouting 1.0 - - -To see the issues closed by this release see the [Git closed issues for 1.x -](https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+1.x%22+is%3Aclosed) -on Github. -The following release notes have been copied from the previous ``RELEASE_NOTES`` -file and are kept as a reference. - - -Changes for release 1.05 - -* Bug fixes - - -Changes for release 1.03 - -* Much faster topology creation -* Bug fixes - - -Changes for release 1.02 - -* Shooting* bug fixes -* Compilation problems solved - -Changes for release 1.01 - -* Shooting* bug fixes - - -Changes for release 1.0 - -* Core and extra functions are separated -* Cmake build process -* Bug fixes - - -Changes for release 1.0.0b - -* Additional SQL file with more simple names for wrapper functions -* Bug fixes - - -Changes for release 1.0.0a - -* Shooting* shortest path algorithm for real road networks -* Several SQL bugs were fixed - - -Changes for release 0.9.9 - -* PostgreSQL 8.2 support -* Shortest path functions return empty result if they could not find any path - - -Changes for release 0.9.8 - -* Renumbering scheme was added to shortest path functions -* Directed shortest path functions were added -* routing_postgis.sql was modified to use dijkstra in TSP search +
diff --git a/doc/allpairs/allpairs-family.rst b/doc/allpairs/allpairs-family.rst index d963b68ae84..bdd4b02013a 100644 --- a/doc/allpairs/allpairs-family.rst +++ b/doc/allpairs/allpairs-family.rst @@ -114,7 +114,7 @@ The following tests: - with AMD 64 CPU - 4G memory - trusty - - posgreSQL version 9.3 + - PostgreSQL version 9.3 Data ......................................... diff --git a/doc/allpairs/pgr_johnson.rst b/doc/allpairs/pgr_johnson.rst index d489b26a505..a182800b778 100644 --- a/doc/allpairs/pgr_johnson.rst +++ b/doc/allpairs/pgr_johnson.rst @@ -35,7 +35,7 @@ Description The Johnson algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *sparse graphs*. -It usees the Boost's implementation which runs in :math:`O(V E \log V)` time, +It uses the Boost's implementation which runs in :math:`O(V E \log V)` time, .. include:: allpairs-family.rst :start-after: characteristics_start diff --git a/doc/astar/pgr_aStar.rst b/doc/astar/pgr_aStar.rst index 15e057a179e..4f5baf3a28d 100644 --- a/doc/astar/pgr_aStar.rst +++ b/doc/astar/pgr_aStar.rst @@ -22,7 +22,7 @@ * Version 3.6.0 - * Standarizing output columns to |short-generic-result| + * Standardizing output columns to |short-generic-result| * pgr_aStar(One to One) added ``start_vid`` and ``end_vid`` columns. * pgr_aStar(One to Many) added ``end_vid`` column. diff --git a/doc/astar/pgr_aStarCost.rst b/doc/astar/pgr_aStarCost.rst index 694241bcbf4..efc69ccb6e7 100644 --- a/doc/astar/pgr_aStarCost.rst +++ b/doc/astar/pgr_aStarCost.rst @@ -38,7 +38,7 @@ Description ------------------------------------------------------------------------------- -The ``pgr_aStarCost`` function sumarizes of the cost of the shortest path +The ``pgr_aStarCost`` function summarizes of the cost of the shortest path using the A* algorithm. **The main characteristics are:** diff --git a/doc/astar/pgr_aStarCostMatrix.rst b/doc/astar/pgr_aStarCostMatrix.rst index 526914e8cca..2eee4b157d1 100644 --- a/doc/astar/pgr_aStarCostMatrix.rst +++ b/doc/astar/pgr_aStarCostMatrix.rst @@ -35,7 +35,7 @@ Description **The main characteristics are:** -* Using internaly the :doc:`pgr_aStar` algorithm +* Using internally the :doc:`pgr_aStar` algorithm * Returns a cost matrix. * No ordering is performed * let `v` and `u` are nodes on the graph: diff --git a/doc/bdAstar/pgr_bdAstar.rst b/doc/bdAstar/pgr_bdAstar.rst index 53b3a5914f7..8d514c12acc 100644 --- a/doc/bdAstar/pgr_bdAstar.rst +++ b/doc/bdAstar/pgr_bdAstar.rst @@ -22,7 +22,7 @@ * Version 3.6.0 - * Standarizing output columns to |short-generic-result| + * Standardizing output columns to |short-generic-result| * pgr_bdAstar(One to One) added ``start_vid`` and ``end_vid`` columns. * pgr_bdAstar(One to Many) added ``end_vid`` column. diff --git a/doc/bdAstar/pgr_bdAstarCost.rst b/doc/bdAstar/pgr_bdAstarCost.rst index 8c9719b95f9..38d58eb901e 100644 --- a/doc/bdAstar/pgr_bdAstarCost.rst +++ b/doc/bdAstar/pgr_bdAstarCost.rst @@ -38,7 +38,7 @@ A* algorithm. Description ------------------------------------------------------------------------------- -The ``pgr_bdAstarCost`` function sumarizes of the cost of the shortest path +The ``pgr_bdAstarCost`` function summarizes of the cost of the shortest path using the bidirectional A* algorithm. **The main characteristics are:** diff --git a/doc/bdAstar/pgr_bdAstarCostMatrix.rst b/doc/bdAstar/pgr_bdAstarCostMatrix.rst index c0464bc4f3b..8006756656e 100644 --- a/doc/bdAstar/pgr_bdAstarCostMatrix.rst +++ b/doc/bdAstar/pgr_bdAstarCostMatrix.rst @@ -34,7 +34,7 @@ Description **The main characteristics are:** -* Using internaly the :doc:`pgr_bdAstar` algorithm +* Using internally the :doc:`pgr_bdAstar` algorithm * Returns a cost matrix. * No ordering is performed * let `v` and `u` are nodes on the graph: diff --git a/doc/bdDijkstra/pgr_bdDijkstraCost.rst b/doc/bdDijkstra/pgr_bdDijkstraCost.rst index 444bc29d452..2f3384314ae 100644 --- a/doc/bdDijkstra/pgr_bdDijkstraCost.rst +++ b/doc/bdDijkstra/pgr_bdDijkstraCost.rst @@ -39,7 +39,7 @@ Dijkstra algorithm. Description ------------------------------------------------------------------------------- -The ``pgr_bdDijkstraCost`` function sumarizes of the cost of the shortest path +The ``pgr_bdDijkstraCost`` function summarizes of the cost of the shortest path using the bidirectional Dijkstra Algorithm. .. include:: bdDijkstra-family.rst diff --git a/doc/categories/VRP-category.rst b/doc/categories/VRP-category.rst index 6565fe75b92..a4bef028417 100644 --- a/doc/categories/VRP-category.rst +++ b/doc/categories/VRP-category.rst @@ -467,7 +467,7 @@ Result columns - BIGINT - Current vehicle identifier. - * Sumary row has the **total capacity violations**. + * Summary row has the **total capacity violations**. * A capacity violation happens when overloading or underloading a vehicle. @@ -476,7 +476,7 @@ Result columns - Sequential value starting from **1** for the stops made by the current vehicle. The :math:`m_{th}` stop of the current vehicle. - * Sumary row has the **total time windows violations**. + * Summary row has the **total time windows violations**. * A time window violation happens when arriving after the location has closed. @@ -735,7 +735,7 @@ For the following equivalences :math:`10m/s \approx 600m/min \approx 36 km/hr` Working with time units in seconds and the matrix been in meters: -For a 1000m lenght value on the matrix: +For a 1000m length value on the matrix: .. list-table:: :width: 81 diff --git a/doc/categories/withPoints-category.rst b/doc/categories/withPoints-category.rst index 0f4a2a9d041..2ed13d18b01 100644 --- a/doc/categories/withPoints-category.rst +++ b/doc/categories/withPoints-category.rst @@ -237,7 +237,7 @@ Advanced documentation About points ............................................................................... -For this section the following city (see :doc:`sampledata`) some interesing +For this section the following city (see :doc:`sampledata`) some interesting points such as restaurant, supermarket, post office, etc. will be used as example. @@ -264,7 +264,7 @@ for this example: Driving side ............................................................................... -In the the folowwing images: +In the following images: - The squared vertices are the temporary vertices, - The temporary vertices are added according to the driving side, @@ -301,7 +301,7 @@ Driving side does not matter _______________________________________________________________________________ - Like having all points to be considered in both sides ``b`` -- Prefered usage on **undirected** graphs +- Preferred usage on **undirected** graphs - On the :doc:`TRSP-family` this option is not valid .. image:: images/noMatterDrivingSide.png @@ -342,14 +342,14 @@ _______________________________________________________________________________ .. image:: images/rightDrivingSide.png :scale: 50% -- Arrival to point ``-2`` can be achived only via vertex **16**. +- Arrival to point ``-2`` can be achieved only via vertex **16**. - Does not affects edge ``(17, 16)``, therefore the edge is kept. - It only affects the edge ``(16, 17)``, therefore the edge is removed. - Create two new edges: - Edge ``(16, -2)`` with cost ``0.4`` (original cost * fraction == :math:`1 * 0.4`) - - Edge ``(-2, 17)`` with cost ``0.6`` (the remaing cost) + - Edge ``(-2, 17)`` with cost ``0.6`` (the remaining cost) - The total cost of the additional edges is equal to the original cost. - If more points are on the same edge, the process is repeated recursevly. @@ -362,7 +362,7 @@ _______________________________________________________________________________ .. image:: images/leftDrivingSide.png :scale: 50% -- Arrival to point ``-2`` can be achived only via vertex **17**. +- Arrival to point ``-2`` can be achieved only via vertex **17**. - Does not affects edge ``(16, 17)``, therefore the edge is kept. - It only affects the edge ``(17, 16)``, therefore the edge is removed. - Create two new edges: @@ -372,7 +372,7 @@ _______________________________________________________________________________ - Edge ``(16, -2)`` with cost ``0.4`` (original cost * fraction == :math:`1 * 0.4`) - - Edge ``(-2, 17)`` with cost ``0.6`` (the remaing cost) + - Edge ``(-2, 17)`` with cost ``0.6`` (the remaining cost) - If more points are on the same edge, the process is repeated recursevly. - Flip the Edges and add them to the graph: @@ -390,7 +390,7 @@ _______________________________________________________________________________ .. image:: images/noMatterDrivingSide.png :scale: 50% -- Arrival to point ``-2`` can be achived via vertices **16** or **17**. +- Arrival to point ``-2`` can be achieved via vertices **16** or **17**. - Affects the edges ``(16, 17)`` and ``(17, 16)``, therefore the edges are removed. - Create four new edges: @@ -399,7 +399,7 @@ _______________________________________________________________________________ - Edge ``(16, -2)`` with cost ``0.4`` (original cost * fraction == :math:`1 * 0.4`) - - Edge ``(-2, 17)`` with cost ``0.6`` (the remaing cost) + - Edge ``(-2, 17)`` with cost ``0.6`` (the remaining cost) - If more points are on the same edge, the process is repeated recursevly. - Flip the Edges and add all the edges to the graph: diff --git a/doc/circuits/pgr_hawickCircuits.rst b/doc/circuits/pgr_hawickCircuits.rst index 30a7c42fdda..b44cf15428f 100644 --- a/doc/circuits/pgr_hawickCircuits.rst +++ b/doc/circuits/pgr_hawickCircuits.rst @@ -16,7 +16,7 @@ ``pgr_hawickCircuits`` - Experimental =============================================================================== -``pgr_hawickCircuits`` — Returns the list of ciruits using hawick circuits algorithm. +``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits algorithm. .. include:: experimental.rst :start-after: warning-begin @@ -53,7 +53,7 @@ implemenent this variation. - where :math:`|E|` is the number of edges in the graph, - :math:`|V|` is the number of vertices in the graph. - - :math:`|c|` is the number of circuts in the graph. + - :math:`|c|` is the number of circuits in the graph. |Boost| Boost Graph Inside @@ -117,7 +117,7 @@ Result columns - Id of the circuit starting from ``1`` * - ``path_seq`` - ``INTEGER`` - - Relative postion in the path. Has value ``0`` for beginning of the path + - Relative position in the path. Has value ``0`` for beginning of the path * - ``start_vid`` - ``BIGINT`` - Identifier of the starting vertex of the circuit. diff --git a/doc/conf.py.in b/doc/conf.py.in index 95b0dbe2c16..52c4432b6c3 100644 --- a/doc/conf.py.in +++ b/doc/conf.py.in @@ -332,6 +332,7 @@ linkcheck_ignore = [ # (see: https://github.com/sphinx-doc/sphinx/issues/7388) r'https://github.com/pgRouting/pgrouting/issues/*', # limit only pgrouting r'https://github.com/pgRouting/pgrouting/archive/*', + r'https://docs.pgrouting.org/3.8/*', r'https://www.overpass-api.de/*' ] diff --git a/doc/dijkstra/pgr_dijkstra.rst b/doc/dijkstra/pgr_dijkstra.rst index f98042a866e..eb6ddaa8b03 100644 --- a/doc/dijkstra/pgr_dijkstra.rst +++ b/doc/dijkstra/pgr_dijkstra.rst @@ -23,7 +23,7 @@ * Version 3.5.0 - * Standarizing output columns to |short-generic-result| + * Standardizing output columns to |short-generic-result| * pgr_dijkstra(One to One) added ``start_vid`` and ``end_vid`` columns. * pgr_dijkstra(One to Many) added ``end_vid`` column. @@ -596,7 +596,7 @@ The following examples find the path for :math:`\{6\}\rightarrow\{10\}` :start-after: -- q154 :end-before: -- q16 -e Also +See Also ------------------------------------------------------------------------------- * :doc:`sampledata` diff --git a/doc/dijkstra/pgr_dijkstraCost.rst b/doc/dijkstra/pgr_dijkstraCost.rst index 9bc8e08d1d5..8c864904558 100644 --- a/doc/dijkstra/pgr_dijkstraCost.rst +++ b/doc/dijkstra/pgr_dijkstraCost.rst @@ -37,7 +37,7 @@ algorithm. Description ------------------------------------------------------------------------------- -The ``pgr_dijkstraCost`` function sumarizes of the cost of the shortest path +The ``pgr_dijkstraCost`` function summarizes of the cost of the shortest path using Dijkstra Algorithm. .. include:: dijkstra-family.rst diff --git a/doc/dijkstra/pgr_dijkstraNear.rst b/doc/dijkstra/pgr_dijkstraNear.rst index 5f7bd2186b9..6031f36cef1 100644 --- a/doc/dijkstra/pgr_dijkstraNear.rst +++ b/doc/dijkstra/pgr_dijkstraNear.rst @@ -174,7 +174,7 @@ Many to Many :Example: Find the best pedestrian connection between two lines of buses -* Unsing an **undirected** graph for pedestrian routing +* Using an **undirected** graph for pedestrian routing * The first subway line stations are at :math:`\{15, 16\}` * The second subway line stations stops are at :math:`\{1, 10, 11\}` * On line `4`: using the named parameter: `directed => false` @@ -253,7 +253,7 @@ From the results: * The best connections from all the stations from the second line are: :math:`{(15 \rightarrow 10) (16 \rightarrow 11)}` - * Both are equaly good as they have the same cost. (lines: `13` and `14` and + * Both are equally good as they have the same cost. (lines: `13` and `14` and lines: `15` and `16`) diff --git a/doc/dijkstra/pgr_dijkstraNearCost.rst b/doc/dijkstra/pgr_dijkstraNearCost.rst index 34b4fa8b66b..4d1505fddd2 100644 --- a/doc/dijkstra/pgr_dijkstraNearCost.rst +++ b/doc/dijkstra/pgr_dijkstraNearCost.rst @@ -151,7 +151,7 @@ Many to Many :Example: Find the best pedestrian connection between two lines of buses -* Unsing an **undirected** graph for pedestrian routing +* Using an **undirected** graph for pedestrian routing * The first subway line stations are at :math:`\{15, 16\}` * The second subway line stations stops are at :math:`\{1, 10, 11\}` * On line `4`: using the named parameter: `directed => false` @@ -200,7 +200,7 @@ The combinations contents: The query: -* lines `3~4` sets the start vertices to be from the fisrt subway line and the +* lines `3~4` sets the start vertices to be from the first subway line and the ending vertices to be from the second subway line * lines `6~7` sets the start vertices to be from the first subway line and the ending vertices to be from the first subway line @@ -230,7 +230,7 @@ From the results: * The best connections from all the stations from the second line are: :math:`{(15 \rightarrow 10) (16 \rightarrow 11)}` - * Both are equaly good as they have the same cost. (lines: `12` and `13`) + * Both are equally good as they have the same cost. (lines: `12` and `13`) Parameters ------------------------------------------------------------------------------- diff --git a/doc/dominator/pgr_lengauerTarjanDominatorTree.rst b/doc/dominator/pgr_lengauerTarjanDominatorTree.rst index b32d04f5cef..e493f336d4d 100644 --- a/doc/dominator/pgr_lengauerTarjanDominatorTree.rst +++ b/doc/dominator/pgr_lengauerTarjanDominatorTree.rst @@ -32,7 +32,7 @@ vertices. Description ------------------------------------------------------------------------------- -The algorithm calculates the *immidiate dominator* of each vertex called +The algorithm calculates the *immediate dominator* of each vertex called **idom**, once **idom** of each vertex is calculated then by making every **idom** of each vertex as its parent, the dominator tree can be built. diff --git a/doc/driving_distance/pgr_drivingDistance.rst b/doc/driving_distance/pgr_drivingDistance.rst index cbebce3c80d..3ab74ab04d4 100644 --- a/doc/driving_distance/pgr_drivingDistance.rst +++ b/doc/driving_distance/pgr_drivingDistance.rst @@ -22,7 +22,7 @@ .. rubric:: Version 3.6.0 -* Standarizing output columns to |result-spantree| +* Standardizing output columns to |result-spantree| * pgr_drivingDistance(Single vertex) @@ -53,7 +53,7 @@ Description Using the Dijkstra algorithm, extracts all the nodes that have costs less than or equal to the value ``distance``. -The edges extracted will conform to the corresponding spaning tree. +The edges extracted will conform to the corresponding spanning tree. |Boost| Boost Graph Inside diff --git a/doc/ksp/pgr_KSP.rst b/doc/ksp/pgr_KSP.rst index bfdf24c4c61..c006f0db08c 100644 --- a/doc/ksp/pgr_KSP.rst +++ b/doc/ksp/pgr_KSP.rst @@ -22,7 +22,7 @@ .. rubric:: Version 3.6.0 -* Result columns standarized to: |nksp-result| +* Standardizing output columns to |nksp-result| * pgr_ksp(One to One) * Added ``start_vid`` and ``end_vid`` result columns. diff --git a/doc/lineGraph/pgr_lineGraphFull.rst b/doc/lineGraph/pgr_lineGraphFull.rst index 3d98206e810..0a07f3b748e 100644 --- a/doc/lineGraph/pgr_lineGraphFull.rst +++ b/doc/lineGraph/pgr_lineGraphFull.rst @@ -272,7 +272,7 @@ Adding a soft restriction A soft restriction going from vertex 6 to vertex 3 using edges 4 -> 7 is wanted. -Idenifying the restriction +Identifying the restriction +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where the @@ -283,7 +283,7 @@ cost will be increased :end-before: -- q13 The edge to be altered is ``WHERE cost = 0 AND seq != 1 AND edge != -1`` from -the previus query: +the previous query: .. literalinclude:: lineGraphFull.queries :start-after: -- q13 diff --git a/doc/max_flow/pgr_edmondsKarp.rst b/doc/max_flow/pgr_edmondsKarp.rst index 3b77fa23e37..4240cbfe6f1 100644 --- a/doc/max_flow/pgr_edmondsKarp.rst +++ b/doc/max_flow/pgr_edmondsKarp.rst @@ -226,7 +226,7 @@ See Also * :doc:`pgr_boykovKolmogorov` * :doc:`pgr_pushRelabel` -* `Boost: edmonds_karp_max_flow +* `Boost: Edmonds Karp max flow `__ * https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm diff --git a/doc/spanningTree/pgr_kruskalBFS.rst b/doc/spanningTree/pgr_kruskalBFS.rst index 6b7fe05e707..f1b390e01f3 100644 --- a/doc/spanningTree/pgr_kruskalBFS.rst +++ b/doc/spanningTree/pgr_kruskalBFS.rst @@ -25,7 +25,7 @@ First Search ordering. :Version 3.7.0: -* Standarizing output columns to |result-spantree| +* Standardizing output columns to |result-spantree| * Added ``pred`` result columns. diff --git a/doc/spanningTree/pgr_kruskalDD.rst b/doc/spanningTree/pgr_kruskalDD.rst index 48e712e464c..97a8988cba8 100644 --- a/doc/spanningTree/pgr_kruskalDD.rst +++ b/doc/spanningTree/pgr_kruskalDD.rst @@ -25,7 +25,7 @@ :Version 3.7.0: -* Standarizing output columns to |result-spantree| +* Standardizing output columns to |result-spantree| * Added ``pred`` result columns. diff --git a/doc/spanningTree/pgr_kruskalDFS.rst b/doc/spanningTree/pgr_kruskalDFS.rst index 5def6ca23c4..e0b554e536a 100644 --- a/doc/spanningTree/pgr_kruskalDFS.rst +++ b/doc/spanningTree/pgr_kruskalDFS.rst @@ -25,7 +25,7 @@ First Search ordering. :Version 3.7.0: -* Standarizing output columns to |result-spantree| +* Standardizing output columns to |result-spantree| * Added ``pred`` result columns. diff --git a/doc/spanningTree/pgr_primBFS.rst b/doc/spanningTree/pgr_primBFS.rst index 3cf9c4cdb6e..a1a83ee688d 100644 --- a/doc/spanningTree/pgr_primBFS.rst +++ b/doc/spanningTree/pgr_primBFS.rst @@ -25,7 +25,7 @@ Search ordering. :Version 3.7.0: -* Standarizing output columns to |result-spantree| +* Standardizing output columns to |result-spantree| * Added ``pred`` result columns. diff --git a/doc/spanningTree/pgr_primDD.rst b/doc/spanningTree/pgr_primDD.rst index a0196cc2b64..1cc8866fb7c 100644 --- a/doc/spanningTree/pgr_primDD.rst +++ b/doc/spanningTree/pgr_primDD.rst @@ -24,7 +24,7 @@ .. rubric:: Version 3.7.0 -* Standarizing output columns to |result-spantree| +* Standardizing output columns to |result-spantree| * Added ``pred`` result columns. diff --git a/doc/spanningTree/pgr_primDFS.rst b/doc/spanningTree/pgr_primDFS.rst index 1b32d3b37ec..a0399ef858e 100644 --- a/doc/spanningTree/pgr_primDFS.rst +++ b/doc/spanningTree/pgr_primDFS.rst @@ -25,7 +25,7 @@ Search ordering. :Version 3.7.0: -* Standarizing output columns to |result-spantree| +* Standardizing output columns to |result-spantree| * Added ``pred`` result columns. diff --git a/doc/src/release_notes.rst b/doc/src/release_notes.rst index b51bb2494c9..ab5a3f5bd11 100644 --- a/doc/src/release_notes.rst +++ b/doc/src/release_notes.rst @@ -46,42 +46,46 @@ milestone for 3.8.0 .. rubric:: Promotion to official function of pgRouting. * `#2772 `__: - pgr_extractVertices + Promoted to official pgr_extractVertices in version 3.8 .. include:: pgr_extractVertices.rst :start-after: Version 3.8.0 :end-before: .. rubric * `#2760 `__: - pgr_degree + Promoted to official pgr_degree in version 3.8 .. include:: pgr_degree.rst :start-after: Version 3.8.0 :end-before: .. rubric * `#2774 `__: - pgr_findCloseEdges + Promoted to official pgr_findCloseEdges in version 3.8 .. include:: pgr_findCloseEdges.rst :start-after: Version 3.8.0 :end-before: .. rubric -.. rubric:: Deprecation of functions. +.. rubric:: Proposed functions -* `#2749 `__: - pgr_alphaShape -* `#2754 `__: - pgr_analyzeOneWay -* `#2753 `__: - pgr_analyzeGraph -* `#2750 `__: - pgr_createTopology -* `#2826 `__: - pgr_createVerticesTable +* Contraction + + * `#2790 `__: + pgr_contractionDeadEnd new contraction function + * `#2791 `__: + pgr_contractionLinear new contraction function + +* Utilities + + * `#2848 `__: + Create pgr_separateCrossing new utility function + * `#2849 `__: + Create of pgr_separateTouching new utility function .. rubric:: Official functions changes -* `#2786 `__: pgr_contraction +* `#2786 `__: + pgr_contraction(edges) new signature .. include:: pgr_contraction.rst :start-after: Version 3.8.0 @@ -90,26 +94,30 @@ milestone for 3.8.0 .. rubric:: C/C++ code enhancements * `#2802 `__: - Code factorization on pgr_contraction family + Code reorganization on pgr_contraction .. rubric:: SQL code enhancements * `#2850 `__: Rewrite pgr_nodeNetwork -.. rubric:: New proposed functions - -* Contraction +.. rubric:: Deprecation of SQL functions - * `#2790 `__: pgr_contractionDeadEnd - * `#2791 `__: pgr_contractionLinear +* `#2749 `__: + Deprecate pgr_AlphaShape in 3.8 +* `#2750 `__: + Deprecate pgr_CreateTopology in 3.8 +* `#2753 `__: + Deprecate pgr_analyzeGraph in 3.8 +* `#2754 `__: + Deprecate pgr_analyzeOneWay in 3.8 +* `#2826 `__: + Deprecate pgr_createVerticesTable in 3.8 -* Utilities +In the deprecated functions: - * `#2848 `__: - pgr_separateCrossing - * `#2849 `__: - pgr_separateTouching +- Migration section is created. +- The use of the functions is removed in the documentation. pgRouting 3.7 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ diff --git a/doc/transitiveClosure/pgr_transitiveClosure.rst b/doc/transitiveClosure/pgr_transitiveClosure.rst index 340cd472e2a..5546035fc0b 100644 --- a/doc/transitiveClosure/pgr_transitiveClosure.rst +++ b/doc/transitiveClosure/pgr_transitiveClosure.rst @@ -44,7 +44,7 @@ The main characteristics are: belong to the same connected component. (see :doc:`pgr_connectedComponents`) * The returned values are not ordered -* The returned graph is compresed +* The returned graph is compressed * Running time: :math:`O(|V||E|)` |Boost| Boost Graph Inside diff --git a/doc/tsp/pgr_TSP.rst b/doc/tsp/pgr_TSP.rst index 28feb2bc26d..eafac324116 100644 --- a/doc/tsp/pgr_TSP.rst +++ b/doc/tsp/pgr_TSP.rst @@ -67,18 +67,18 @@ Description - When ``start_vid = 0 OR end_vid = 0`` - - The solutions generated is garanteed to be *twice as long as the + - The solutions generated are guaranteed to be *twice as long as the optimal tour in the worst case* - When ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid`` - - It is **not garanteed** that the solution will be, in the worse case, + - It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour, due to the fact that `end_vid` is forced to be in a fixed position. - With ``directed => true`` - - It is **not garanteed** that the solution will be, in the worse case, + - It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour - Will generate a graph that: @@ -118,7 +118,7 @@ Signatures | pgr_TSP(`Matrix SQL`_, ``[start_id, end_id]``) | Returns set of |tsp-result| - | OR EMTPY SET + | OR EMPTY SET :Example: Using :doc:`pgr_dijkstraCostMatrix` to generate the matrix information @@ -187,14 +187,14 @@ Start from vertex :math:`1` :end-before: -- q3 :linenos: -Using points of interest to generate an asymetric matrix. +Using points of interest to generate an asymmetric matrix. ............................................................................... To generate an asymmetric matrix: * **Line 4** The ``side`` information of ``pointsOfInterset`` is ignored by not including it in the query -* **Line 6** Generating an asymetric matrix with ``directed => true`` +* **Line 6** Generating an asymmetric matrix with ``directed => true`` * :math:`min(agg\_cost(u, v), agg\_cost(v, u))` is going to be considered as the ``agg_cost`` diff --git a/doc/tsp/pgr_TSPeuclidean.rst b/doc/tsp/pgr_TSPeuclidean.rst index 8de9f3817c6..5d9ba1e5957 100644 --- a/doc/tsp/pgr_TSPeuclidean.rst +++ b/doc/tsp/pgr_TSPeuclidean.rst @@ -53,7 +53,7 @@ Description :end-before: tsp characteristics end - Any duplicated identifier will be ignored. The coordinates that will be kept - is arbitrarly. + is arbitrarily. - The coordinates are quite similar for the same identifier, for example :: @@ -83,7 +83,7 @@ Signatures | pgr_TSPeuclidean(`Coordinates SQL`_, ``[start_id, end_id]``) | Returns set of |tsp-result| - | OR EMTPY SET + | OR EMPTY SET :Example: With default values @@ -178,7 +178,7 @@ Getting a geometry of the tour Visual results +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ -Visualy, The first image is the `optimal solution +Visually, The first image is the `optimal solution `__ and the second image is the solution obtained with ``pgr_TSPeuclidean``. diff --git a/doc/withPoints/pgr_withPoints.rst b/doc/withPoints/pgr_withPoints.rst index 4925007c11a..06a8dc6115a 100644 --- a/doc/withPoints/pgr_withPoints.rst +++ b/doc/withPoints/pgr_withPoints.rst @@ -86,7 +86,7 @@ Signatures | **options:** ``[directed, driving_side, details])`` | Returns set of |old-pid-result| - | OR EMTPY SET + | OR EMPTY SET .. index:: single: withPoints ; One to One - Proposed on v2.2 @@ -101,7 +101,7 @@ One to One | **options:** [directed, driving_side, details]) | Returns set of |result-1-1| - | OR EMTPY SET + | OR EMPTY SET :Example: From point :math:`1` to vertex :math:`10` with details @@ -122,7 +122,7 @@ One to Many | **options:** [directed, driving_side, details]) | Returns set of |pid-1-m| - | OR EMTPY SET + | OR EMPTY SET :Example: From point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph @@ -144,7 +144,7 @@ Many to One | **options:** [directed, driving_side, details]) | Returns set of |pid-m-1| - | OR EMTPY SET + | OR EMPTY SET :Example: From point :math:`1` and vertex :math:`6` to point :math:`3` @@ -165,7 +165,7 @@ Many to Many | **options:** [directed, driving_side, details]) | Returns set of |pid-m-m| - | OR EMTPY SET + | OR EMPTY SET :Example: From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` @@ -187,7 +187,7 @@ Combinations | **options:** [directed, driving_side, details]) | Returns set of |pid-m-m| - | OR EMTPY SET + | OR EMPTY SET :Example: Two combinations diff --git a/doc/withPoints/pgr_withPointsDD.rst b/doc/withPoints/pgr_withPointsDD.rst index 940a2580257..99526927987 100644 --- a/doc/withPoints/pgr_withPointsDD.rst +++ b/doc/withPoints/pgr_withPointsDD.rst @@ -34,7 +34,7 @@ * pgr_withPointsDD(Single vertex) * pgr_withPointsDD(Multiple vertices) -* Standarizing output columns to |result-spantree| +* Standardizing output columns to |result-spantree| * pgr_withPointsDD(Single vertex) @@ -51,8 +51,8 @@ * Deprecated signatures - * pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)`` - * pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)`` + * pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean) + * pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean) .. rubric:: Version 2.2.0 diff --git a/doc/withPoints/pgr_withPointsKSP.rst b/doc/withPoints/pgr_withPointsKSP.rst index 4a11bdafabb..1c52bf766c8 100644 --- a/doc/withPoints/pgr_withPointsKSP.rst +++ b/doc/withPoints/pgr_withPointsKSP.rst @@ -26,7 +26,7 @@ .. rubric:: Version 3.6.0 -* Standarizing output columns to |nksp-result| +* Standardizing output columns to |nksp-result| * pgr_withPointsKSP(One to One) * Signature change: ``driving_side`` parameter changed from named optional to @@ -86,7 +86,7 @@ One to One | **options:** ``[directed, heap_paths, details]`` | Returns set of |nksp-result| - | OR EMTPY SET + | OR EMPTY SET :Example: Get 2 paths from Point :math:`1` to point :math:`2` on a directed graph with **left** side driving. @@ -112,7 +112,7 @@ One to Many | **options:** ``[directed, heap_paths, details]`` | Returns set of |ksp-result| - | OR EMTPY SET + | OR EMPTY SET :Example: Get 2 paths from point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph @@ -134,7 +134,7 @@ Many to One | **options:** ``[directed, heap_paths, details]`` | Returns set of |ksp-result| - | OR EMTPY SET + | OR EMPTY SET :Example: Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` on a **directed** graph with **right** side driving and **details** set to **True** @@ -156,7 +156,7 @@ Many to Many | **options:** ``[directed, heap_paths, details]`` | Returns set of |nksp-result| - | OR EMTPY SET + | OR EMPTY SET :Example: Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` on a **directed** graph with **left** side driving and **heap_paths** set to **True** @@ -178,7 +178,7 @@ Combinations | **options:** ``[directed, heap_paths, details]`` | Returns set of |ksp-result| - | OR EMTPY SET + | OR EMPTY SET :Example: Using a combinations table on an **directed** graph diff --git a/locale/en/LC_MESSAGES/pgrouting_doc_strings.po b/locale/en/LC_MESSAGES/pgrouting_doc_strings.po index e80f48aca5f..536327e05f8 100644 --- a/locale/en/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/en/LC_MESSAGES/pgrouting_doc_strings.po @@ -8,12 +8,13 @@ msgid "" msgstr "" "Project-Id-Version: pgRouting v3.8\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2025-04-18 23:09+0000\n" +"POT-Creation-Date: 2025-04-22 16:17-0600\n" "PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n" "Last-Translator: FULL NAME \n" "Language-Team: LANGUAGE \n" +"Language: \n" "MIME-Version: 1.0\n" -"Content-Type: text/plain; charset=utf-8\n" +"Content-Type: text/plain; charset=UTF-8\n" "Content-Transfer-Encoding: 8bit\n" "Generated-By: Babel 2.17.0\n" @@ -81,8 +82,8 @@ msgid "Identifier of the root vertex of the tree." msgstr "" msgid "" -"When value is :math:`0` then gets the spanning forest starting in " -"aleatory nodes for each tree in the forest." +"When value is :math:`0` then gets the spanning forest starting in aleatory " +"nodes for each tree in the forest." msgstr "" msgid "**root vids**" @@ -182,8 +183,8 @@ msgid "Weight of the edge (``target``, ``source``)" msgstr "" msgid "" -"When negative: edge (``target``, ``source``) does not exist, therefore " -"it's not part of the graph." +"When negative: edge (``target``, ``source``) does not exist, therefore it's " +"not part of the graph." msgstr "" msgid "``SMALLINT``, ``INTEGER``, ``BIGINT``" @@ -253,24 +254,23 @@ msgid "See Also" msgstr "" msgid "" -"`Boost: Prim's algorithm " -"`__" +"`Boost: Prim's algorithm `__" msgstr "" msgid "" -"`Boost: Kruskal's algorithm " -"`__" +"`Boost: Kruskal's algorithm `__" msgstr "" -#, python-format msgid "" -"`Wikipedia: Prim's algorithm " -"`__" +"`Wikipedia: Prim's algorithm `__" msgstr "" msgid "" -"`Wikipedia: Kruskal's algorithm " -"`__" +"`Wikipedia: Kruskal's algorithm `__" msgstr "" msgid "Indices and tables" @@ -282,6 +282,9 @@ msgstr "" msgid ":ref:`search`" msgstr "" +msgid "Boost Graph inside" +msgstr "" + msgid "DFS - Category" msgstr "" @@ -321,7 +324,8 @@ msgstr "" msgid "Documentation might need refinement." msgstr "" -msgid ":doc:`pgr_depthFirstSearch` - Depth first search traversal of the graph." +msgid "" +":doc:`pgr_depthFirstSearch` - Depth first search traversal of the graph." msgstr "" msgid "In general:" @@ -352,8 +356,7 @@ msgid ":doc:`pgr_trsp_withPoints` - Vertex/Point routing with restrictions." msgstr "" msgid "" -":doc:`pgr_trspVia_withPoints` - Via Vertex/point routing with " -"restrictions." +":doc:`pgr_trspVia_withPoints` - Via Vertex/point routing with restrictions." msgstr "" msgid "" @@ -419,21 +422,20 @@ msgid "Introduction" msgstr "" msgid "" -"Road restrictions are a sequence of road segments that can not be taken " -"in a sequential manner. Some restrictions are implicit on a directed " -"graph, for example, one way roads where the wrong way edge is not even " -"inserted on the graph. But normally on turns like no left turn or no " -"right turn, hence the name turn restrictions, there are sometimes " -"restrictions." +"Road restrictions are a sequence of road segments that can not be taken in a " +"sequential manner. Some restrictions are implicit on a directed graph, for " +"example, one way roads where the wrong way edge is not even inserted on the " +"graph. But normally on turns like no left turn or no right turn, hence the " +"name turn restrictions, there are sometimes restrictions." msgstr "" msgid "TRSP algorithm" msgstr "" msgid "" -"The internal TRSP algorithm performs a lookahead over the dijkstra " -"algorithm in order to find out if the attempted path has a restriction. " -"This allows the algorithm to pass twice on the same vertex." +"The internal TRSP algorithm performs a lookahead over the dijkstra algorithm " +"in order to find out if the attempted path has a restriction. This allows " +"the algorithm to pass twice on the same vertex." msgstr "" msgid "`Edges SQL`_ query as described." @@ -474,9 +476,9 @@ msgid "These restrictions are represented on a table as follows:" msgstr "" msgid "" -"The table has an identifier, which maybe is needed for the administration" -" of the restrictions, but the algorithms do not need that information. If" -" given it will be ignored." +"The table has an identifier, which maybe is needed for the administration of " +"the restrictions, but the algorithms do not need that information. If given " +"it will be ignored." msgstr "" msgid "Restrictions SQL" @@ -490,8 +492,8 @@ msgstr "" msgid "" "Sequence of edge identifiers that form a path that is not allowed to be " -"taken. - Empty arrays or ``NULL`` arrays are ignored. - Arrays that have " -"a ``NULL`` element will raise an exception." +"taken. - Empty arrays or ``NULL`` arrays are ignored. - Arrays that have a " +"``NULL`` element will raise an exception." msgstr "" msgid "``Cost``" @@ -522,9 +524,9 @@ msgid "The travelling salesperson problem (TSP) asks the following question:" msgstr "" msgid "" -"*Given a list of cities and the distances between each pair of cities, " -"which is the shortest possible route that visits each city exactly once " -"and returns to the origin city?*" +"*Given a list of cities and the distances between each pair of cities, which " +"is the shortest possible route that visits each city exactly once and " +"returns to the origin city?*" msgstr "" msgid "Origin" @@ -537,8 +539,8 @@ msgid "" msgstr "" msgid "" -"A discussion about the work of Hamilton & Kirkman can be found in the " -"book **Graph Theory (Biggs et al. 1976)**." +"A discussion about the work of Hamilton & Kirkman can be found in the book " +"**Graph Theory (Biggs et al. 1976)**." msgstr "" msgid "ISBN-13: 978-0198539162" @@ -548,12 +550,12 @@ msgid "ISBN-10: 0198539169" msgstr "" msgid "" -"It is believed that the general form of the TSP have been first studied " -"by Kalr Menger in Vienna and Harvard. The problem was later promoted by " -"Hassler, Whitney & Merrill at Princeton. A detailed description about the" -" connection between Menger & Whitney, and the development of the TSP can " -"be found in `On the history of combinatorial optimization (till 1960) " -"`__" +"It is believed that the general form of the TSP have been first studied by " +"Kalr Menger in Vienna and Harvard. The problem was later promoted by " +"Hassler, Whitney & Merrill at Princeton. A detailed description about the " +"connection between Menger & Whitney, and the development of the TSP can be " +"found in `On the history of combinatorial optimization (till 1960) `__" msgstr "" msgid "To calculate the number of different tours through :math:`n` cities:" @@ -572,8 +574,8 @@ msgid "Multiplying these together we get :math:`(n-1)! = (n-1) (n-2) . . 1`." msgstr "" msgid "" -"Now since the travel costs do not depend on the direction taken around " -"the tour:" +"Now since the travel costs do not depend on the direction taken around the " +"tour:" msgstr "" msgid "this number by 2" @@ -592,8 +594,8 @@ msgid "Metric Algorithm is used" msgstr "" msgid "" -"Implementation generates solutions that *are twice as long as the optimal" -" tour in the worst case* when:" +"Implementation generates solutions that *are twice as long as the optimal " +"tour in the worst case* when:" msgstr "" msgid "Graph is undirected" @@ -612,8 +614,8 @@ msgid "The traveling costs are symmetric:" msgstr "" msgid "" -"Traveling costs from ``u`` to ``v`` are just as much as traveling from " -"``v`` to ``u``" +"Traveling costs from ``u`` to ``v`` are just as much as traveling from ``v`` " +"to ``u``" msgstr "" msgid "TSP optional parameters" @@ -638,27 +640,28 @@ msgid "Last visiting vertex before returning to ``start_vid``." msgstr "" msgid "" -"When ``0`` any vertex can become the last visiting vertex before " -"returning to ``start_id``." +"When ``0`` any vertex can become the last visiting vertex before returning " +"to ``start_id``." msgstr "" -msgid "When ``NOT 0`` and ``start_id = 0`` then it is the first and last vertex" +msgid "" +"When ``NOT 0`` and ``start_id = 0`` then it is the first and last vertex" msgstr "" msgid "References" msgstr "" msgid "" -"`Boost: metric TSP approx " -"`__" +"`Boost: metric TSP approx `__" msgstr "" msgid "`University of Waterloo TSP `__" msgstr "" msgid "" -"`Wikipedia: Traveling Salesman Problem " -"`__" +"`Wikipedia: Traveling Salesman Problem `__" msgstr "" msgid "Vehicle Routing Functions - Category" @@ -671,8 +674,7 @@ msgid ":doc:`pgr_pickDeliver` - Pickup & Delivery using a Cost Matrix" msgstr "" msgid "" -":doc:`pgr_pickDeliverEuclidean` - Pickup & Delivery with Euclidean " -"distances" +":doc:`pgr_pickDeliverEuclidean` - Pickup & Delivery with Euclidean distances" msgstr "" msgid "Distribution problem" @@ -699,19 +701,19 @@ msgid "**pgRouting does not try to implement all variants.**" msgstr "" msgid "" -"Capacitated Vehicle Routing Problem `CVRP` where The vehicles have " -"limited carrying capacity of the goods." +"Capacitated Vehicle Routing Problem `CVRP` where The vehicles have limited " +"carrying capacity of the goods." msgstr "" msgid "" -"Vehicle Routing Problem with Time Windows `VRPTW` where the locations " -"have time windows within which the vehicle's visits must be made." +"Vehicle Routing Problem with Time Windows `VRPTW` where the locations have " +"time windows within which the vehicle's visits must be made." msgstr "" msgid "" -"Vehicle Routing Problem with Pickup and Delivery `VRPPD` where a number " -"of goods need to be moved from certain pickup locations to other delivery" -" locations." +"Vehicle Routing Problem with Pickup and Delivery `VRPPD` where a number of " +"goods need to be moved from certain pickup locations to other delivery " +"locations." msgstr "" msgid "Limitations" @@ -733,8 +735,8 @@ msgid "Pick & Delivery" msgstr "" msgid "" -"Problem: `CVRPPDTW` Capacitated Pick and Delivery Vehicle Routing problem" -" with Time Windows" +"Problem: `CVRPPDTW` Capacitated Pick and Delivery Vehicle Routing problem " +"with Time Windows" msgstr "" msgid "Times are relative to `0`" @@ -856,10 +858,12 @@ msgstr "" msgid "``4`` Optimize insert." msgstr "" -msgid "``5`` Push back order that allows more orders to be inserted at the back" +msgid "" +"``5`` Push back order that allows more orders to be inserted at the back" msgstr "" -msgid "``6`` Push front order that allows more orders to be inserted at the front" +msgid "" +"``6`` Push front order that allows more orders to be inserted at the front" msgstr "" msgid "Orders SQL" @@ -939,8 +943,8 @@ msgid "``d_node_id``" msgstr "" msgid "" -"The node identifier of the delivery, must match a vertex identifier in " -"the `Matrix SQL`_." +"The node identifier of the delivery, must match a vertex identifier in the " +"`Matrix SQL`_." msgstr "" msgid "" @@ -1044,16 +1048,16 @@ msgid "``start_node_id``" msgstr "" msgid "" -"The node identifier of the start location, must match a vertex identifier" -" in the `Matrix SQL`_." +"The node identifier of the start location, must match a vertex identifier in " +"the `Matrix SQL`_." msgstr "" msgid "[``end_node_id``]" msgstr "" msgid "" -"The node identifier of the end location, must match a vertex identifier " -"in the `Matrix SQL`_." +"The node identifier of the end location, must match a vertex identifier in " +"the `Matrix SQL`_." msgstr "" msgid "When missing: ``end_node_id`` is used." @@ -1113,10 +1117,9 @@ msgstr "" msgid "``vehicle_seq``" msgstr "" -#, python-brace-format msgid "" -"Sequential value starting from **1** for current vehicles. The " -":math:`n_{th}` vehicle in the solution." +"Sequential value starting from **1** for current vehicles. The :math:`n_{th}" +"` vehicle in the solution." msgstr "" msgid "Value :math:`-2` indicates it is the summary row." @@ -1131,10 +1134,11 @@ msgstr "" msgid "Current vehicle identifier." msgstr "" -msgid "Sumary row has the **total capacity violations**." +msgid "Summary row has the **total capacity violations**." msgstr "" -msgid "A capacity violation happens when overloading or underloading a vehicle." +msgid "" +"A capacity violation happens when overloading or underloading a vehicle." msgstr "" msgid "``stop_seq``" @@ -1143,18 +1147,16 @@ msgstr "" msgid "INTEGER" msgstr "" -#, python-brace-format msgid "" "Sequential value starting from **1** for the stops made by the current " "vehicle. The :math:`m_{th}` stop of the current vehicle." msgstr "" -msgid "Sumary row has the **total time windows violations**." +msgid "Summary row has the **total time windows violations**." msgstr "" msgid "" -"A time window violation happens when arriving after the location has " -"closed." +"A time window violation happens when arriving after the location has closed." msgstr "" msgid "``stop_type``" @@ -1184,7 +1186,8 @@ msgstr "" msgid "Pickup-Delivery order pair identifier." msgstr "" -msgid "Value :math:`-1`: When no order is involved on the current stop location." +msgid "" +"Value :math:`-1`: When no order is involved on the current stop location." msgstr "" msgid "``cargo``" @@ -1257,8 +1260,8 @@ msgid "Summary row has the **total solution time**:" msgstr "" msgid "" -":math:`total\\ traveling\\ time + total\\ waiting\\ time + total\\ " -"service\\ time`." +":math:`total\\ traveling\\ time + total\\ waiting\\ time + total\\ service\\ " +"time`." msgstr "" msgid "Summary Row" @@ -1290,8 +1293,8 @@ msgstr "" msgid "" "To define a problem, several considerations have to be done, to get " -"consistent results. This section gives an insight of how parameters are " -"to be considered." +"consistent results. This section gives an insight of how parameters are to " +"be considered." msgstr "" msgid "`Capacity and Demand Units Handling`_" @@ -1328,31 +1331,31 @@ msgid "Number of seats in the vehicle" msgstr "" msgid "" -"The `demand` request of the pickup-deliver orders must use the same units" -" as the units used in the vehicle's `capacity`." +"The `demand` request of the pickup-deliver orders must use the same units as " +"the units used in the vehicle's `capacity`." msgstr "" msgid "" -"To handle problems like: 10 (equal dimension) boxes of apples and 5 kg of" -" feathers that are to be transported (not packed in boxes)." +"To handle problems like: 10 (equal dimension) boxes of apples and 5 kg of " +"feathers that are to be transported (not packed in boxes)." msgstr "" msgid "" -"If the vehicle's **capacity** is measured in `boxes`, a conversion of `kg" -" of feathers` to `number of boxes` is needed." +"If the vehicle's **capacity** is measured in `boxes`, a conversion of `kg of " +"feathers` to `number of boxes` is needed." msgstr "" msgid "" -"If the vehicle's **capacity** is measured in `kg`, a conversion of `box " -"of apples` to `kg` is needed." +"If the vehicle's **capacity** is measured in `kg`, a conversion of `box of " +"apples` to `kg` is needed." msgstr "" msgid "Showing how the 2 possible conversions can be done" msgstr "" msgid "" -"Let: - :math:`f\\_boxes`: number of boxes needed for `1` kg of feathers. " -"- :math:`a\\_weight`: weight of `1` box of apples." +"Let: - :math:`f\\_boxes`: number of boxes needed for `1` kg of feathers. - :" +"math:`a\\_weight`: weight of `1` box of apples." msgstr "" msgid "Capacity Units" @@ -1407,14 +1410,13 @@ msgid "Time Handling" msgstr "" msgid "" -"The times are relative to **0**. All time units have to be converted to a" -" **0** reference and the same time units." +"The times are relative to **0**. All time units have to be converted to a " +"**0** reference and the same time units." msgstr "" msgid "" "Suppose that a vehicle's driver starts the shift at 9:00 am and ends the " -"shift at 4:30 pm and the service time duration is 10 minutes with 30 " -"seconds." +"shift at 4:30 pm and the service time duration is 10 minutes with 30 seconds." msgstr "" msgid "Meaning of 0" @@ -1492,9 +1494,9 @@ msgid "For the :doc:`pgr_pickDeliverEuclidean`:" msgstr "" msgid "" -"Working with time units in seconds, and x/y in lat/lon: Factor: would " -"depend on the location of the points and on the average velocity say " -"25m/s is the velocity." +"Working with time units in seconds, and x/y in lat/lon: Factor: would depend " +"on the location of the points and on the average velocity say 25m/s is the " +"velocity." msgstr "" msgid "Latitude" @@ -1548,13 +1550,13 @@ msgid "Time" msgstr "" msgid "" -"For the following equivalences :math:`10m/s \\approx 600m/min \\approx 36" -" km/hr`" +"For the following equivalences :math:`10m/s \\approx 600m/min \\approx 36 km/" +"hr`" msgstr "" msgid "" "Working with time units in seconds and the matrix been in meters: For a " -"1000m lenght value on the matrix:" +"1000m length value on the matrix:" msgstr "" msgid "Units" @@ -1572,7 +1574,6 @@ msgstr "" msgid ":math:`10 m/s`" msgstr "" -#, python-brace-format msgid ":math:`\\frac{1}{10m/s}`" msgstr "" @@ -1585,7 +1586,6 @@ msgstr "" msgid ":math:`600 m/min`" msgstr "" -#, python-brace-format msgid ":math:`\\frac{1}{600m/min}`" msgstr "" @@ -1601,7 +1601,6 @@ msgstr "" msgid ":math:`36 km/hr`" msgstr "" -#, python-brace-format msgid ":math:`\\frac{1}{36 km/hr}`" msgstr "" @@ -1621,8 +1620,8 @@ msgid "A* - Family of functions" msgstr "" msgid "" -"The A* (pronounced \"A Star\") algorithm is based on Dijkstra's algorithm" -" with a heuristic that allow it to solve most shortest path problems by " +"The A* (pronounced \"A Star\") algorithm is based on Dijkstra's algorithm " +"with a heuristic that allow it to solve most shortest path problems by " "evaluation only a sub-set of the overall graph." msgstr "" @@ -1740,16 +1739,16 @@ msgid "Analysis 1" msgstr "" msgid "" -"Working with cost/reverse_cost as length in degrees, x/y in lat/lon: " -"Factor = 1 (no need to change units)" +"Working with cost/reverse_cost as length in degrees, x/y in lat/lon: Factor " +"= 1 (no need to change units)" msgstr "" msgid "Analysis 2" msgstr "" msgid "" -"Working with cost/reverse_cost as length in meters, x/y in lat/lon: " -"Factor = would depend on the location of the points:" +"Working with cost/reverse_cost as length in meters, x/y in lat/lon: Factor = " +"would depend on the location of the points:" msgstr "" msgid "1 longitude degree is 78846.81 m" @@ -1768,17 +1767,16 @@ msgid "Analysis 3" msgstr "" msgid "" -"Working with cost/reverse_cost as time in seconds, x/y in lat/lon: " -"Factor: would depend on the location of the points and on the average " -"speed say 25m/s is the speed." +"Working with cost/reverse_cost as time in seconds, x/y in lat/lon: Factor: " +"would depend on the location of the points and on the average speed say 25m/" +"s is the speed." msgstr "" msgid ":doc:`bdAstar-family`" msgstr "" msgid "" -"`Boost: A* search " -"`__" +"`Boost: A* search `__" msgstr "" msgid "https://en.wikipedia.org/wiki/A*_search_algorithm" @@ -1803,8 +1801,8 @@ msgid "It does not return a path." msgstr "" msgid "" -"Returns the sum of the costs of the shortest path for each pair of nodes " -"in the graph." +"Returns the sum of the costs of the shortest path for each pair of nodes in " +"the graph." msgstr "" msgid "" @@ -1870,7 +1868,7 @@ msgstr "" msgid "trusty" msgstr "" -msgid "posgreSQL version 9.3" +msgid "PostgreSQL version 9.3" msgstr "" msgid "Data" @@ -1893,8 +1891,8 @@ msgstr "" msgid "" "This test is not with a bounding box The density of the passed graph is " -"extremely low. For each 30 tests were executed to get the average " -"The tested query is:" +"extremely low. For each 30 tests were executed to get the average The " +"tested query is:" msgstr "" msgid "The results of this tests are presented as:" @@ -1915,7 +1913,6 @@ msgstr "" msgid "DENSITY" msgstr "" -#, python-brace-format msgid "is the density of the data :math:`\\dfrac{E}{V \\times (V-1)}`." msgstr "" @@ -2238,9 +2235,9 @@ msgid "Two" msgstr "" msgid "" -"This test is with a bounding box The density of the passed graph higher " -"than of the Test One. For each 30 tests were executed to get the " -"average The tested edge query is:" +"This test is with a bounding box The density of the passed graph higher than " +"of the Test One. For each 30 tests were executed to get the average " +"The tested edge query is:" msgstr "" msgid "The tested queries" @@ -2544,24 +2541,24 @@ msgid ":doc:`pgr_floydWarshall`" msgstr "" msgid "" -"Boost `floyd-Warshall " -"`__" +"Boost `floyd-Warshall `__" msgstr "" msgid "Bidirectional A* - Family of functions" msgstr "" msgid "" -"The bidirectional A* (pronounced \"A Star\") algorithm is based on the A*" -" algorithm." +"The bidirectional A* (pronounced \"A Star\") algorithm is based on the A* " +"algorithm." msgstr "" msgid ":doc:`pgr_bdAstar` - Bidirectional A* algorithm for obtaining paths." msgstr "" msgid "" -":doc:`pgr_bdAstarCost` - Bidirectional A* algorithm to calculate the cost" -" of the paths." +":doc:`pgr_bdAstarCost` - Bidirectional A* algorithm to calculate the cost of " +"the paths." msgstr "" msgid "" @@ -2570,12 +2567,12 @@ msgid "" msgstr "" msgid "" -"Based on A* algorithm, the bidirectional search finds a shortest path " -"from a starting vertex (``start_vid``) to an ending vertex (``end_vid``)." -" It runs two simultaneous searches: one forward from the ``start_vid``, " -"and one backward from the ``end_vid``, stopping when the two meet in the " -"middle. This implementation can be used with a directed graph and an " -"undirected graph." +"Based on A* algorithm, the bidirectional search finds a shortest path from a " +"starting vertex (``start_vid``) to an ending vertex (``end_vid``). It runs " +"two simultaneous searches: one forward from the ``start_vid``, and one " +"backward from the ``end_vid``, stopping when the two meet in the middle. " +"This implementation can be used with a directed graph and an undirected " +"graph." msgstr "" msgid "" @@ -2593,18 +2590,18 @@ msgid "Bidirectional Dijkstra - Family of functions" msgstr "" msgid "" -":doc:`pgr_bdDijkstra` - Bidirectional Dijkstra algorithm for the shortest" -" paths." +":doc:`pgr_bdDijkstra` - Bidirectional Dijkstra algorithm for the shortest " +"paths." msgstr "" msgid "" -":doc:`pgr_bdDijkstraCost` - Bidirectional Dijkstra to calculate the cost " -"of the shortest paths" +":doc:`pgr_bdDijkstraCost` - Bidirectional Dijkstra to calculate the cost of " +"the shortest paths" msgstr "" msgid "" -":doc:`pgr_bdDijkstraCostMatrix` - Bidirectional Dijkstra algorithm to " -"create a matrix of costs of the shortest paths." +":doc:`pgr_bdDijkstraCostMatrix` - Bidirectional Dijkstra algorithm to create " +"a matrix of costs of the shortest paths." msgstr "" msgid "Synopsis" @@ -2626,8 +2623,7 @@ msgid "" msgstr "" msgid "" -"A negative value on a cost column is interpreted as the edge does not " -"exist." +"A negative value on a cost column is interpreted as the edge does not exist." msgstr "" msgid "When there is no path:" @@ -2637,23 +2633,22 @@ msgid "When the starting vertex and ending vertex are the same." msgstr "" msgid "" -"The **aggregate cost** of the non included values :math:`(v, v)` is " -":math:`0`" +"The **aggregate cost** of the non included values :math:`(v, v)` is :math:`0`" msgstr "" msgid "" -"When the starting vertex and ending vertex are the different and there is" -" no path:" +"When the starting vertex and ending vertex are the different and there is no " +"path:" msgstr "" msgid "" -"The **aggregate cost** the non included values :math:`(u, v)` is " -":math:`\\infty`" +"The **aggregate cost** the non included values :math:`(u, v)` is :math:" +"`\\infty`" msgstr "" msgid "" -"For optimization purposes, any duplicated value in the starting vertices " -"or on the ending vertices are ignored." +"For optimization purposes, any duplicated value in the starting vertices or " +"on the ending vertices are ignored." msgstr "" msgid "Running time (worse case scenario): :math:`O((V \\log V + E))`" @@ -2684,24 +2679,24 @@ msgid "Graph must be connected." msgstr "" msgid "" -"An Edges SQL that represents a **directed** graph with the following " -"columns" +"An Edges SQL that represents a **directed** graph with the following columns" msgstr "" msgid "Coloring - Family of functions" msgstr "" msgid "" -":doc:`pgr_sequentialVertexColoring` - Vertex coloring algorithm using " -"greedy approach." +":doc:`pgr_sequentialVertexColoring` - Vertex coloring algorithm using greedy " +"approach." msgstr "" msgid "" -":doc:`pgr_bipartite` - Bipartite graph algorithm using a DFS-based " -"coloring approach." +":doc:`pgr_bipartite` - Bipartite graph algorithm using a DFS-based coloring " +"approach." msgstr "" -msgid ":doc:`pgr_edgeColoring` - Edge Coloring algorithm using Vizing's theorem." +msgid "" +":doc:`pgr_edgeColoring` - Edge Coloring algorithm using Vizing's theorem." msgstr "" msgid "Returns set of ``(vertex_id, color_id)``" @@ -2731,30 +2726,29 @@ msgstr "" msgid "Identifier of the color of the edge." msgstr "" -msgid "`Boost: `__" +msgid "" +"`Boost: `__" msgstr "" msgid "Components - Family of functions" msgstr "" msgid "" -":doc:`pgr_connectedComponents` - Connected components of an undirected " -"graph." +":doc:`pgr_connectedComponents` - Connected components of an undirected graph." msgstr "" msgid "" -":doc:`pgr_strongComponents` - Strongly connected components of a directed" -" graph." +":doc:`pgr_strongComponents` - Strongly connected components of a directed " +"graph." msgstr "" msgid "" -":doc:`pgr_biconnectedComponents` - Biconnected components of an " -"undirected graph." +":doc:`pgr_biconnectedComponents` - Biconnected components of an undirected " +"graph." msgstr "" msgid "" -":doc:`pgr_articulationPoints` - Articulation points of an undirected " -"graph." +":doc:`pgr_articulationPoints` - Articulation points of an undirected graph." msgstr "" msgid ":doc:`pgr_bridges` - Bridges of an undirected graph." @@ -2798,11 +2792,13 @@ msgid "Forbid contraction on a set of nodes." msgstr "" msgid "" -"Decide the order of the contraction algorithms and set the maximum number" -" of times they are to be executed." +"Decide the order of the contraction algorithms and set the maximum number of " +"times they are to be executed." msgstr "" -msgid "https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/lecture16.pdf" +msgid "" +"https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/" +"lecture16.pdf" msgstr "" msgid "https://algo2.iti.kit.edu/documents/routeplanning/geisberger_dipl.pdf" @@ -2833,8 +2829,8 @@ msgid "Each function works as part of the family it belongs to." msgstr "" msgid "" -"Returns the sum of the costs of the shortest path of each pair " -"combination of nodes requested." +"Returns the sum of the costs of the shortest path of each pair combination " +"of nodes requested." msgstr "" msgid "" @@ -2843,16 +2839,15 @@ msgid "" msgstr "" msgid "" -"Depending on the function and its parameters, the results can be " -"symmetric." +"Depending on the function and its parameters, the results can be symmetric." msgstr "" msgid "" -"The **aggregate cost** of :math:`(u, v)` is the same as for :math:`(v, " -"u)`." +"The **aggregate cost** of :math:`(u, v)` is the same as for :math:`(v, u)`." msgstr "" -msgid "Any duplicated value in the start or end vertex identifiers are ignored." +msgid "" +"Any duplicated value in the start or end vertex identifiers are ignored." msgstr "" msgid "The returned values are ordered:" @@ -2883,19 +2878,20 @@ msgid ":doc:`pgr_withPointsCostMatrix`" msgstr "" msgid "" -":doc:`TSP-family` needs as input a symmetric cost matrix and no edge `(u," -" v)` must value :math:`\\infty`." +":doc:`TSP-family` needs as input a symmetric cost matrix and no edge `(u, " +"v)` must value :math:`\\infty`." msgstr "" -msgid "This collection of functions will return a cost matrix in form of a table." +msgid "" +"This collection of functions will return a cost matrix in form of a table." msgstr "" msgid "Can be used as input to :doc:`pgr_TSP`." msgstr "" msgid "" -"Use directly when the resulting matrix is symmetric and there is no " -":math:`\\infty` value." +"Use directly when the resulting matrix is symmetric and there is no :math:" +"`\\infty` value." msgstr "" msgid "It will be the users responsibility to make the matrix symmetric." @@ -2908,35 +2904,35 @@ msgid "By using max or min the non symmetric values." msgstr "" msgid "" -"By setting the upper triangle to be the mirror image of the lower " -"triangle." +"By setting the upper triangle to be the mirror image of the lower triangle." msgstr "" msgid "" -"By setting the lower triangle to be the mirror image of the upper " -"triangle." +"By setting the lower triangle to be the mirror image of the upper triangle." msgstr "" msgid "It is also the users responsibility to fix an :math:`\\infty` value." msgstr "" msgid "" -"Returns the sum of the costs of the shortest path for pair combination of" -" nodes in the graph." +"Returns the sum of the costs of the shortest path for pair combination of " +"nodes in the graph." msgstr "" -msgid "When the starting vertex and ending vertex are the same, there is no path." +msgid "" +"When the starting vertex and ending vertex are the same, there is no path." msgstr "" msgid "The aggregate cost in the non included values `(v, v)` is `0`." msgstr "" msgid "" -"When the starting vertex and ending vertex are the different and there is" -" no path." +"When the starting vertex and ending vertex are the different and there is no " +"path." msgstr "" -msgid "The aggregate cost in the non included values `(u, v)` is :math:`\\infty`." +msgid "" +"The aggregate cost in the non included values `(u, v)` is :math:`\\infty`." msgstr "" msgid "Let be the case the values returned are stored in a table:" @@ -2984,7 +2980,8 @@ msgstr "" msgid "Identifier of the point." msgstr "" -msgid "Use with positive value, as internally will be converted to negative value" +msgid "" +"Use with positive value, as internally will be converted to negative value" msgstr "" msgid "If column is present, it can not be NULL." @@ -3039,7 +3036,8 @@ msgstr "" msgid ":doc:`pgr_dijkstraCost` - Get the aggregate cost of the shortest paths." msgstr "" -msgid ":doc:`pgr_dijkstraCostMatrix` - Use pgr_dijkstra to create a costs matrix." +msgid "" +":doc:`pgr_dijkstraCostMatrix` - Use pgr_dijkstra to create a costs matrix." msgstr "" msgid "" @@ -3048,8 +3046,8 @@ msgid "" msgstr "" msgid "" -":doc:`pgr_KSP` - Use Yen algorithm with pgr_dijkstra to get the K " -"shortest paths." +":doc:`pgr_KSP` - Use Yen algorithm with pgr_dijkstra to get the K shortest " +"paths." msgstr "" msgid ":doc:`pgr_dijkstraVia` - Get a route of a sequence of vertices." @@ -3062,11 +3060,11 @@ msgid ":doc:`pgr_dijkstraNearCost` - Get the cost to the nearest vertex." msgstr "" msgid "" -"Dijkstra's algorithm, conceived by Dutch computer scientist Edsger " -"Dijkstra in 1956. It is a graph search algorithm that solves the shortest" -" path problem for a graph with non-negative edge path costs, producing a " -"shortest path from a starting vertex to an ending vertex. This " -"implementation can be used with a directed graph and an undirected graph." +"Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra " +"in 1956. It is a graph search algorithm that solves the shortest path " +"problem for a graph with non-negative edge path costs, producing a shortest " +"path from a starting vertex to an ending vertex. This implementation can be " +"used with a directed graph and an undirected graph." msgstr "" msgid "Running time: :math:`O(| start\\ vids | * (V \\log V + E))`" @@ -3114,14 +3112,12 @@ msgstr "" msgid "Given the following query:" msgstr "" -#, python-brace-format msgid "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)" msgstr "" -#, python-brace-format msgid "" -"where :math:`sql = \\{(id_i, source_i, target_i, cost_i, " -"reverse\\_cost_i)\\}`" +"where :math:`sql = \\{(id_i, source_i, target_i, cost_i, reverse\\_cost_i)\\}" +"`" msgstr "" msgid "and" @@ -3156,9 +3152,9 @@ msgid "" "\\text{ when } cost >=0 \\} & \\quad \\text{if } reverse\\_cost = " "\\varnothing \\\\ \\text{ } \\text{ } & \\quad \\text{ } \\\\ \\text{ } " "\\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & \\quad " -"\\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) \\text{ " -"when } reverse\\_cost_i>=0 \\} & \\quad \\text{if } reverse\\_cost \\neq " -"\\varnothing \\\\ \\end{cases}`" +"\\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) " +"\\text{ when } reverse\\_cost_i>=0 \\} & \\quad \\text{if } reverse\\_cost " +"\\neq \\varnothing \\\\ \\end{cases}`" msgstr "" msgid "Undirected graph" @@ -3176,12 +3172,11 @@ msgid "" "source_i, cost_i) \\text{ when } cost >=0 \\} & \\quad \\text{ if } " "reverse\\_cost = \\varnothing \\\\ \\text{ } \\text{ } & \\text{ } \\\\ " "\\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & " -"\\text{ } \\\\ \\cup \\{(target_i, source_i, cost_i) \\text{ when } cost " -">=0 \\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) " -"\\text{ when } reverse\\_cost_i >=0)\\} & \\text{ } \\\\ \\cup " -"\\{(source_i, target_i, reverse\\_cost_i) \\text{ when } reverse\\_cost_i" -" >=0)\\} & \\quad \\text{ if } reverse\\_cost \\neq \\varnothing \\\\ " -"\\end{cases}`" +"\\text{ } \\\\ \\cup \\{(target_i, source_i, cost_i) \\text{ when } cost >=0 " +"\\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) " +"\\text{ when } reverse\\_cost_i >=0)\\} & \\text{ } \\\\ \\cup \\{(source_i, " +"target_i, reverse\\_cost_i) \\text{ when } reverse\\_cost_i >=0)\\} & \\quad " +"\\text{ if } reverse\\_cost \\neq \\varnothing \\\\ \\end{cases}`" msgstr "" msgid "The problem" @@ -3190,25 +3185,20 @@ msgstr "" msgid "Given:" msgstr "" -#, python-brace-format msgid ":math:`start_{vid} \\in V` a starting vertex" msgstr "" -#, python-brace-format msgid ":math:`end_{vid} \\in V` an ending vertex" msgstr "" -#, python-brace-format msgid "" -":math:`G(V,E) = \\begin{cases} G_d(V,E) & \\quad \\text{ if6 } directed =" -" true \\\\ G_u(V,E) & \\quad \\text{ if5 } directed = false \\\\ " -"\\end{cases}`" +":math:`G(V,E) = \\begin{cases} G_d(V,E) & \\quad \\text{ if6 } directed = " +"true \\\\ G_u(V,E) & \\quad \\text{ if5 } directed = false \\\\ \\end{cases}`" msgstr "" msgid "Then:" msgstr "" -#, python-brace-format msgid "" ":math:`\\boldsymbol{\\pi} = \\{(path\\_seq_i, node_i, edge_i, cost_i, " "agg\\_cost_i)\\}`" @@ -3220,61 +3210,53 @@ msgstr "" msgid ":math:`path\\_seq_i = i`" msgstr "" -#, python-brace-format msgid ":math:`path\\_seq_{| \\pi |} = | \\pi |`" msgstr "" msgid ":math:`node_i \\in V`" msgstr "" -#, python-brace-format msgid ":math:`node_1 = start_{vid}`" msgstr "" -#, python-brace-format msgid ":math:`node_{| \\pi |} = end_{vid}`" msgstr "" -#, python-brace-format msgid "" -":math:`\\forall i \\neq | \\pi |, \\quad (node_i, node_{i+1}, cost_i) " -"\\in E`" +":math:`\\forall i \\neq | \\pi |, \\quad (node_i, node_{i+1}, cost_i) \\in E`" msgstr "" msgid "" -":math:`edge_i = \\begin{cases} id_{(node_i, node_{i+1},cost_i)} " -"&\\quad \\text{when } i \\neq | \\pi | \\\\ -1 &\\quad \\text{when } i " -"= | \\pi | \\\\ \\end{cases}`" +":math:`edge_i = \\begin{cases} id_{(node_i, node_{i+1},cost_i)} &\\quad " +"\\text{when } i \\neq | \\pi | \\\\ -1 &\\quad \\text{when } i = | \\pi | \\" +"\\ \\end{cases}`" msgstr "" msgid ":math:`cost_i = cost_{(node_i, node_{i+1})}`" msgstr "" msgid "" -":math:`agg\\_cost_i = \\begin{cases} 0 &\\quad \\text{when } i = 1 " -"\\\\ \\displaystyle\\sum_{k=1}^{i} cost_{(node_{k-1}, node_k)} &\\quad" -" \\text{when } i \\neq 1 \\\\ \\end{cases}`" +":math:`agg\\_cost_i = \\begin{cases} 0 &\\quad \\text{when } i = 1 \\" +"\\ \\displaystyle\\sum_{k=1}^{i} cost_{(node_{k-1}, node_k)} &\\quad " +"\\text{when } i \\neq 1 \\\\ \\end{cases}`" msgstr "" -#, python-brace-format msgid "" -"In other words: The algorithm returns a the shortest path between " -":math:`start_{vid}` and :math:`end_{vid}`, if it exists, in terms of a " -"sequence of nodes and of edges," +"In other words: The algorithm returns a the shortest path between :math:" +"`start_{vid}` and :math:`end_{vid}`, if it exists, in terms of a sequence of " +"nodes and of edges," msgstr "" msgid "" -":math:`path\\_seq` indicates the relative position in the path of the " -":math:`node` or :math:`edge`." +":math:`path\\_seq` indicates the relative position in the path of the :math:" +"`node` or :math:`edge`." msgstr "" msgid ":math:`cost` is the cost of the edge to be used to go to the next node." msgstr "" -#, python-brace-format msgid "" -":math:`agg\\_cost` is the cost from the :math:`start_{vid}` up to the " -"node." +":math:`agg\\_cost` is the cost from the :math:`start_{vid}` up to the node." msgstr "" msgid "If there is no path, the resulting set is empty." @@ -3284,8 +3266,7 @@ msgid "Driving Distance - Category" msgstr "" msgid "" -":doc:`pgr_drivingDistance` - Driving Distance based on Dijkstra's " -"algorithm" +":doc:`pgr_drivingDistance` - Driving Distance based on Dijkstra's algorithm" msgstr "" msgid ":doc:`pgr_primDD` - Driving Distance based on Prim's algorithm" @@ -3324,8 +3305,8 @@ msgid "The distance from the **root** to :math:`v` > limit distance." msgstr "" msgid "" -"No new nodes are created on the graph, so when is within the limit and is" -" not within the limit, the edge is not included." +"No new nodes are created on the graph, so when is within the limit and is " +"not within the limit, the edge is not included." msgstr "" msgid "Edges SQL as described below." @@ -3389,21 +3370,20 @@ msgid ":doc:`transformation-family`" msgstr "" msgid "" -":doc:`pgr_lineGraphFull` - Transformation algorithm for generating a Line" -" Graph out of each vertex in the input graph." +":doc:`pgr_lineGraphFull` - Transformation algorithm for generating a Line " +"Graph out of each vertex in the input graph." msgstr "" msgid ":doc:`traversal-family`" msgstr "" msgid "" -":doc:`pgr_breadthFirstSearch` - Breath first search traversal of the " -"graph." +":doc:`pgr_breadthFirstSearch` - Breath first search traversal of the graph." msgstr "" msgid "" -":doc:`pgr_binaryBreadthFirstSearch` - Breath first search traversal of " -"the graph." +":doc:`pgr_binaryBreadthFirstSearch` - Breath first search traversal of the " +"graph." msgstr "" msgid ":doc:`components-family`" @@ -3413,13 +3393,13 @@ msgid ":doc:`ordering-family`" msgstr "" msgid "" -":doc:`pgr_cuthillMckeeOrdering` - Return reverse Cuthill-McKee ordering " -"of an undirected graph." +":doc:`pgr_cuthillMckeeOrdering` - Return reverse Cuthill-McKee ordering of " +"an undirected graph." msgstr "" msgid "" -":doc:`pgr_topologicalSort` - Linear ordering of the vertices for directed" -" acyclic graph." +":doc:`pgr_topologicalSort` - Linear ordering of the vertices for directed " +"acyclic graph." msgstr "" msgid ":doc:`metrics-family`" @@ -3476,36 +3456,36 @@ msgid "Flow - Family of functions" msgstr "" msgid "" -":doc:`pgr_maxFlow` - Only the Max flow calculation using Push and Relabel" -" algorithm." +":doc:`pgr_maxFlow` - Only the Max flow calculation using Push and Relabel " +"algorithm." msgstr "" msgid "" -":doc:`pgr_boykovKolmogorov` - Boykov and Kolmogorov with details of flow " -"on edges." +":doc:`pgr_boykovKolmogorov` - Boykov and Kolmogorov with details of flow on " +"edges." msgstr "" msgid "" -":doc:`pgr_edmondsKarp` - Edmonds and Karp algorithm with details of flow " -"on edges." +":doc:`pgr_edmondsKarp` - Edmonds and Karp algorithm with details of flow on " +"edges." msgstr "" msgid "" -":doc:`pgr_pushRelabel` - Push and relabel algorithm with details of flow " -"on edges." +":doc:`pgr_pushRelabel` - Push and relabel algorithm with details of flow on " +"edges." msgstr "" msgid "Applications" msgstr "" msgid "" -":doc:`pgr_edgeDisjointPaths` - Calculates edge disjoint paths between two" -" groups of vertices." +":doc:`pgr_edgeDisjointPaths` - Calculates edge disjoint paths between two " +"groups of vertices." msgstr "" msgid "" -":doc:`pgr_maxCardinalityMatch` - Calculates a maximum cardinality " -"matching in a graph." +":doc:`pgr_maxCardinalityMatch` - Calculates a maximum cardinality matching " +"in a graph." msgstr "" msgid "Flow Functions General Information" @@ -3544,9 +3524,9 @@ msgid "a **super target** and edges from it to all the targetss." msgstr "" msgid "" -"The maximum flow through the graph is guaranteed to be the value returned" -" by :doc:`pgr_maxFlow ` when executed with the same " -"parameters and can be calculated:" +"The maximum flow through the graph is guaranteed to be the value returned " +"by :doc:`pgr_maxFlow ` when executed with the same parameters " +"and can be calculated:" msgstr "" msgid "By aggregation of the outgoing flow from the sources" @@ -3556,10 +3536,9 @@ msgid "By aggregation of the incoming flow to the targets" msgstr "" msgid "" -":doc:`pgr_maxFlow` is the maximum Flow and that maximum is guaranteed to " -"be the same on the functions :doc:`pgr_pushRelabel`, " -":doc:`pgr_edmondsKarp`, :doc:`pgr_boykovKolmogorov`, but the actual flow " -"through each edge may vary." +":doc:`pgr_maxFlow` is the maximum Flow and that maximum is guaranteed to be " +"the same on the functions :doc:`pgr_pushRelabel`, :doc:`pgr_edmondsKarp`, :" +"doc:`pgr_boykovKolmogorov`, but the actual flow through each edge may vary." msgstr "" msgid "Capacity edges" @@ -3635,8 +3614,7 @@ msgid "**residual_capacity**" msgstr "" msgid "" -"Residual capacity of the edge in the direction (``start_vid``, " -"``end_vid``)." +"Residual capacity of the edge in the direction (``start_vid``, ``end_vid``)." msgstr "" msgid "For :doc:`pgr_maxFlowMinCost`" @@ -3674,14 +3652,14 @@ msgstr "" msgid "" "A flow network is a directed graph where each edge has a capacity and a " "flow. The flow through an edge must not exceed the capacity of the edge. " -"Additionally, the incoming and outgoing flow of a node must be equal " -"except for source which only has outgoing flow, and the destination(sink)" -" which only has incoming flow." +"Additionally, the incoming and outgoing flow of a node must be equal except " +"for source which only has outgoing flow, and the destination(sink) which " +"only has incoming flow." msgstr "" msgid "" -"Maximum flow algorithms calculate the maximum flow through the graph and " -"the flow of each edge." +"Maximum flow algorithms calculate the maximum flow through the graph and the " +"flow of each edge." msgstr "" msgid "" @@ -3692,7 +3670,6 @@ msgstr "" msgid "pgr_maxFlow :math:`(edges\\_sql, source\\_vertex, sink\\_vertex)`" msgstr "" -#, python-brace-format msgid "" "where :math:`edges\\_sql = \\{(id_i, source_i, target_i, capacity_i, " "reverse\\_capacity_i)\\}`" @@ -3708,18 +3685,18 @@ msgid "the set of vertices :math:`V`" msgstr "" msgid "" -":math:`source\\_vertex \\cup sink\\_vertex \\bigcup source_i " -"\\bigcup target_i`" +":math:`source\\_vertex \\cup sink\\_vertex \\bigcup source_i \\bigcup " +"target_i`" msgstr "" msgid "" ":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, capacity_i) " -"\\text{ when } capacity > 0 \\} & \\quad \\text{ if } reverse\\_capacity" -" = \\varnothing \\\\ \\text{ } & \\quad \\text{ } \\\\ \\{(source_i, " -"target_i, capacity_i) \\text{ when } capacity > 0 \\} & \\text{ } \\\\ " -"\\cup \\{(target_i, source_i, reverse\\_capacity_i) \\text{ when } " -"reverse\\_capacity_i > 0)\\} & \\quad \\text{ if } reverse\\_capacity " -"\\neq \\varnothing \\\\ \\end{cases}`" +"\\text{ when } capacity > 0 \\} & \\quad \\text{ if } reverse\\_capacity = " +"\\varnothing \\\\ \\text{ } & \\quad \\text{ } \\\\ \\{(source_i, target_i, " +"capacity_i) \\text{ when } capacity > 0 \\} & \\text{ } \\\\ \\cup " +"\\{(target_i, source_i, reverse\\_capacity_i) \\text{ when } " +"reverse\\_capacity_i > 0)\\} & \\quad \\text{ if } reverse\\_capacity \\neq " +"\\varnothing \\\\ \\end{cases}`" msgstr "" msgid "Maximum flow problem" @@ -3734,22 +3711,19 @@ msgstr "" msgid ":math:`sink\\_vertex \\in V` the sink vertex" msgstr "" -#, python-brace-format msgid ":math:`pgr\\_maxFlow(edges\\_sql, source, sink) = \\boldsymbol{\\Phi}`" msgstr "" -#, python-brace-format msgid "" ":math:`\\boldsymbol{\\Phi} = {(id_i, edge\\_id_i, source_i, target_i, " "flow_i, residual\\_capacity_i)}`" msgstr "" -#, python-brace-format msgid "" ":math:`\\boldsymbol{\\Phi}` is a subset of the original edges with their " "residual capacity and flow. The maximum flow through the graph can be " -"obtained by aggregating on the source or sink and summing the flow " -"from/to it. In particular:" +"obtained by aggregating on the source or sink and summing the flow from/to " +"it. In particular:" msgstr "" msgid ":math:`id_i = i`" @@ -3765,9 +3739,9 @@ msgid "https://en.wikipedia.org/wiki/Maximum_flow_problem" msgstr "" msgid "" -"pgRouting extends the `PostGIS `__/`PostgreSQL " -"`__ geospatial database to provide geospatial" -" routing and other network analysis functionality." +"pgRouting extends the `PostGIS `__/`PostgreSQL `__ geospatial database to provide geospatial routing and " +"other network analysis functionality." msgstr "" msgid "This is the manual for pgRouting |release|." @@ -3777,12 +3751,12 @@ msgid "Creative Commons Attribution-Share Alike 3.0 License" msgstr "" msgid "" -"The pgRouting Manual is licensed under a `Creative Commons Attribution-" -"Share Alike 3.0 License `_. Feel free to use this material any way you like, but we ask " -"that you attribute credit to the pgRouting Project and wherever possible," -" a link back to https://pgrouting.org. For other licenses used in " -"pgRouting see the :ref:`license` page." +"The pgRouting Manual is licensed under a `Creative Commons Attribution-Share " +"Alike 3.0 License `_. Feel " +"free to use this material any way you like, but we ask that you attribute " +"credit to the pgRouting Project and wherever possible, a link back to " +"https://pgrouting.org. For other licenses used in pgRouting see the :ref:" +"`license` page." msgstr "" msgid "General" @@ -3845,16 +3819,16 @@ msgid ":doc:`topology-functions`" msgstr "" msgid "" -"The following functions modify the database directly therefore the user " -"must have special permissions given by the administrators to use them." +"The following functions modify the database directly therefore the user must " +"have special permissions given by the administrators to use them." msgstr "" msgid ":doc:`pgr_createTopology` - create a topology based on the geometry." msgstr "" msgid "" -":doc:`pgr_createVerticesTable` - reconstruct the vertices table based on " -"the source and target information." +":doc:`pgr_createVerticesTable` - reconstruct the vertices table based on the " +"source and target information." msgstr "" msgid "" @@ -3875,8 +3849,8 @@ msgid "Utilities" msgstr "" msgid "" -":doc:`pgr_extractVertices` - Extracts vertex information based on the " -"edge table information." +":doc:`pgr_extractVertices` - Extracts vertex information based on the edge " +"table information." msgstr "" msgid ":doc:`pgr_findCloseEdges` - Finds close edges of points on the fly" @@ -3921,19 +3895,18 @@ msgstr "" msgid "pgRouting 3.8.0 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.8.0 " -"`__" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.8.0 `__" msgstr "" msgid "Promotion to official function of pgRouting." msgstr "" msgid "" -"`#2772 `__: " -"pgr_extractVertices" +"`#2772 `__: Promoted to " +"official pgr_extractVertices in version 3.8" msgstr "" msgid "Error messages adjustment." @@ -3942,46 +3915,46 @@ msgstr "" msgid "Function promoted to official." msgstr "" -msgid "`#2760 `__: pgr_degree" +msgid "" +"`#2760 `__: Promoted to " +"official pgr_degree in version 3.8" msgstr "" msgid "New signature with only Edges SQL." msgstr "" msgid "" -"`#2774 `__: " -"pgr_findCloseEdges" +"`#2774 `__: Promoted to " +"official pgr_findCloseEdges in version 3.8" msgstr "" msgid "``partial`` option is removed." msgstr "" -msgid "Deprecation of functions." +msgid "Proposed functions" msgstr "" -msgid "" -"`#2749 `__: " -"pgr_alphaShape" +msgid "Contraction" msgstr "" msgid "" -"`#2754 `__: " -"pgr_analyzeOneWay" +"`#2790 `__: " +"pgr_contractionDeadEnd new contraction function" msgstr "" msgid "" -"`#2753 `__: " -"pgr_analyzeGraph" +"`#2791 `__: " +"pgr_contractionLinear new contraction function" msgstr "" msgid "" -"`#2750 `__: " -"pgr_createTopology" +"`#2848 `__: Create " +"pgr_separateCrossing new utility function" msgstr "" msgid "" -"`#2826 `__: " -"pgr_createVerticesTable" +"`#2849 `__: Create of " +"pgr_separateTouching new utility function" msgstr "" msgid "Official functions changes" @@ -3989,23 +3962,22 @@ msgstr "" msgid "" "`#2786 `__: " -"pgr_contraction" +"pgr_contraction(edges) new signature" msgstr "" msgid "New signature:" msgstr "" msgid "" -"Previously compulsory parameter **Contraction order** is now optional " -"with name ``methods``." +"Previously compulsory parameter **Contraction order** is now optional with " +"name ``methods``." msgstr "" msgid "New name and order of optional parameters." msgstr "" msgid "" -"Deprecated signature " -"pgr_contraction(text,bigint[],integer,bigint[],boolean)" +"Deprecated signature pgr_contraction(text,bigint[],integer,bigint[],boolean)" msgstr "" msgid "C/C++ code enhancements" @@ -4013,33 +3985,52 @@ msgstr "" msgid "" "`#2802 `__: Code " -"factorization on pgr_contraction family" +"reorganization on pgr_contraction" msgstr "" -msgid "New proposed functions" +msgid "SQL code enhancements" msgstr "" -msgid "Contraction" +msgid "" +"`#2850 `__: Rewrite " +"pgr_nodeNetwork" +msgstr "" + +msgid "Deprecation of SQL functions" msgstr "" msgid "" -"`#2790 `__: " -"pgr_contractionDeadEnd" +"`#2749 `__: Deprecate " +"pgr_AlphaShape in 3.8" msgstr "" msgid "" -"`#2791 `__: " -"pgr_contractionLinear" +"`#2750 `__: Deprecate " +"pgr_CreateTopology in 3.8" msgstr "" msgid "" -"`#2848 `__: " -"pgr_separateCrossing" +"`#2753 `__: Deprecate " +"pgr_analyzeGraph in 3.8" msgstr "" msgid "" -"`#2849 `__: " -"pgr_separateTouching" +"`#2754 `__: Deprecate " +"pgr_analyzeOneWay in 3.8" +msgstr "" + +msgid "" +"`#2826 `__: Deprecate " +"pgr_createVerticesTable in 3.8" +msgstr "" + +msgid "In the deprecated functions:" +msgstr "" + +msgid "Migration section is created." +msgstr "" + +msgid "The use of the functions is removed in the documentation." msgstr "" msgid "All releases" @@ -4049,9 +4040,9 @@ msgid "Kruskal - Family of functions" msgstr "" msgid "" -"Kruskal's algorithm is a greedy minimum spanning tree algorithm that in " -"each cycle finds and adds the edge of the least possible weight that " -"connects any two trees in the forest." +"Kruskal's algorithm is a greedy minimum spanning tree algorithm that in each " +"cycle finds and adds the edge of the least possible weight that connects any " +"two trees in the forest." msgstr "" msgid "**The main Characteristics are:**" @@ -4084,8 +4075,7 @@ msgid "Migration of ``pgr_alphaShape``" msgstr "" msgid "" -"Starting from `v3.8.0 " -"`__" +"Starting from `v3.8.0 `__" msgstr "" msgid "**Before Deprecation:** The following was calculated:" @@ -4104,17 +4094,17 @@ msgid "If you have SFCGAL, which you can install using" msgstr "" msgid "" -"Since PostGIS 3.5+ use `CG_AlphaShape " -"`__" +"Since PostGIS 3.5+ use `CG_AlphaShape `__" msgstr "" msgid "For PostGIS 3.5+ use the old name ``ST_AlphaShape``" msgstr "" msgid "" -"Other PostGIS options are * `ST_ConvexHull " -"`__ * `ST_ConcaveHull " -"`__" +"Other PostGIS options are * `ST_ConvexHull `__ * `ST_ConcaveHull `__" msgstr "" msgid "Migration of ``pgr_createTopology``" @@ -4132,40 +4122,39 @@ msgid "Build a routing topology" msgstr "" msgid "" -"The basic information to use the majority of the pgRouting functions " -"``id, source, target, cost, [reverse_cost]`` is what in pgRouting is " -"called the routing topology." +"The basic information to use the majority of the pgRouting functions ``id, " +"source, target, cost, [reverse_cost]`` is what in pgRouting is called the " +"routing topology." msgstr "" msgid "" -"``reverse_cost`` is optional but strongly recommended to have in order to" -" reduce the size of the database due to the size of the geometry columns." -" Having said that, in this documentation ``reverse_cost`` is used in this" -" documentation." +"``reverse_cost`` is optional but strongly recommended to have in order to " +"reduce the size of the database due to the size of the geometry columns. " +"Having said that, in this documentation ``reverse_cost`` is used in this " +"documentation." msgstr "" msgid "" -"When the data comes with geometries and there is no routing topology, " -"then this step is needed." +"When the data comes with geometries and there is no routing topology, then " +"this step is needed." msgstr "" msgid "" -"All the start and end vertices of the geometries need an identifier that " -"is to be stored in a ``source`` and ``target`` columns of the table of " -"the data. Likewise, ``cost`` and ``reverse_cost`` need to have the value " -"of traversing the edge in both directions." +"All the start and end vertices of the geometries need an identifier that is " +"to be stored in a ``source`` and ``target`` columns of the table of the " +"data. Likewise, ``cost`` and ``reverse_cost`` need to have the value of " +"traversing the edge in both directions." msgstr "" msgid "" -"If the columns do not exist they need to be added to the table in " -"question. (see `ALTER TABLE `__)" +"If the columns do not exist they need to be added to the table in question. " +"(see `ALTER TABLE `__)" msgstr "" msgid "" -"The function :doc:`pgr_extractVertices` is used to create a vertices " -"table based on the edge identifier and the geometry of the edge of the " -"graph." +"The function :doc:`pgr_extractVertices` is used to create a vertices table " +"based on the edge identifier and the geometry of the edge of the graph." msgstr "" msgid "" @@ -4177,9 +4166,8 @@ msgid "Migration of ``pgr_createVerticesTable``" msgstr "" msgid "" -"**After Deprecation:** The user is responsible to create the vertices " -"table, indexes, etc. They may use :doc:`pgr_extractVertices` for that " -"purpose." +"**After Deprecation:** The user is responsible to create the vertices table, " +"indexes, etc. They may use :doc:`pgr_extractVertices` for that purpose." msgstr "" msgid "Migration of ``pgr_analyzeOneWay``" @@ -4198,13 +4186,13 @@ msgid "Dead ends." msgstr "" msgid "" -"A routing problem can arise when from a vertex there is only a way on or " -"a way out but not both:" +"A routing problem can arise when from a vertex there is only a way on or a " +"way out but not both:" msgstr "" msgid "" -"Either saving or using directly :doc:`pgr_extractVertices` get the dead " -"ends information and determine if the adjacent edge is one way or not." +"Either saving or using directly :doc:`pgr_extractVertices` get the dead ends " +"information and determine if the adjacent edge is one way or not." msgstr "" msgid "In this example :doc:`pgr_extractVertices` has already been applied." @@ -4215,8 +4203,8 @@ msgstr "" msgid "" "Another routing problem can arise when there is an edge of an undirected " -"graph whose deletion increases its number of connected components, and " -"the bridge is only one way." +"graph whose deletion increases its number of connected components, and the " +"bridge is only one way." msgstr "" msgid "To determine if the bridges are or not one way." @@ -4274,8 +4262,8 @@ msgid "Components." msgstr "" msgid "" -"Instead of counting only isolated segments, determine all the components " -"of the graph." +"Instead of counting only isolated segments, determine all the components of " +"the graph." msgstr "" msgid "Depending of the final application requirements use:" @@ -4294,8 +4282,8 @@ msgid "For example:" msgstr "" msgid "" -"Instead of counting the dead ends, determine all the dead ends of the " -"graph using :doc:`pgr_degree`." +"Instead of counting the dead ends, determine all the dead ends of the graph " +"using :doc:`pgr_degree`." msgstr "" msgid "Potential gaps near dead ends." @@ -4315,18 +4303,17 @@ msgid "" msgstr "" msgid "" -"Several PostGIS functions can be used: `ST_Intersects " -"`__, `ST_Crosses " -"`__, `ST_Overlaps " -"`__, etc." +"Several PostGIS functions can be used: `ST_Intersects `__, `ST_Crosses `__, `ST_Overlaps `__, etc." msgstr "" msgid "Migration of ``pgr_aStar``" msgstr "" msgid "" -"Starting from `v3.6.0 " -"`__" +"Starting from `v3.6.0 `__" msgstr "" msgid "Signatures to be migrated:" @@ -4348,11 +4335,12 @@ msgid "Output columns were |old-generic-result|" msgstr "" msgid "" -"Depending on the overload used, the columns ``start_vid`` and ``end_vid``" -" might be missing:" +"Depending on the overload used, the columns ``start_vid`` and ``end_vid`` " +"might be missing:" msgstr "" -msgid "``pgr_aStar`` (`One to One`) does not have ``start_vid`` and ``end_vid``." +msgid "" +"``pgr_aStar`` (`One to One`) does not have ``start_vid`` and ``end_vid``." msgstr "" msgid "``pgr_aStar`` (`One to Many`) does not have ``start_vid``." @@ -4387,21 +4375,21 @@ msgstr "" msgid "" "If needed add the new columns, similar to the following example where " -"``pgr_dijkstra`` is used, and the function had to be modified to be able " -"to return the new columns:" +"``pgr_dijkstra`` is used, and the function had to be modified to be able to " +"return the new columns:" msgstr "" msgid "" -"In `v3.0 `__ the function ``my_dijkstra`` uses ``pgr_dijkstra``." +"In `v3.0 `__ the function " +"``my_dijkstra`` uses ``pgr_dijkstra``." msgstr "" msgid "" -"Starting from `v3.5 `__ the function ``my_dijkstra`` returns the new additional columns" -" of ``pgr_dijkstra``." +"Starting from `v3.5 `__ the " +"function ``my_dijkstra`` returns the new additional columns of " +"``pgr_dijkstra``." msgstr "" msgid "Migration of ``pgr_bdAstar``" @@ -4417,8 +4405,7 @@ msgid "``pgr_bdAstar`` (`Many to One`)" msgstr "" msgid "" -"``pgr_bdAstar`` (`One to One`) does not have ``start_vid`` and " -"``end_vid``." +"``pgr_bdAstar`` (`One to One`) does not have ``start_vid`` and ``end_vid``." msgstr "" msgid "``pgr_bdAstar`` (`One to Many`) does not have ``start_vid``." @@ -4440,8 +4427,7 @@ msgid "Migration of ``pgr_dijkstra``" msgstr "" msgid "" -"Starting from `v3.5.0 " -"`__" +"Starting from `v3.5.0 `__" msgstr "" msgid "``pgr_dijkstra`` (`One to One`)" @@ -4454,8 +4440,7 @@ msgid "``pgr_dijkstra`` (`Many to One`)" msgstr "" msgid "" -"``pgr_dijkstra`` (`One to One`) does not have ``start_vid`` and " -"``end_vid``." +"``pgr_dijkstra`` (`One to One`) does not have ``start_vid`` and ``end_vid``." msgstr "" msgid "``pgr_dijkstra`` (`One to Many`) does not have ``start_vid``." @@ -4480,9 +4465,8 @@ msgid "Migration of ``pgr_drivingDistance``" msgstr "" msgid "" -"Starting from `v3.6.0 " -"`__ " -":doc:`pgr_drivingDistance` result columns are being standardized." +"Starting from `v3.6.0 `__ :" +"doc:`pgr_drivingDistance` result columns are being standardized." msgstr "" msgid "from" @@ -4519,8 +4503,8 @@ msgid "Be aware of the existence and name change of the result columns." msgstr "" msgid "" -"Using `this `__ example." +"Using `this `__ example." msgstr "" msgid "``depth`` contains the depth of the ``node``." @@ -4530,31 +4514,31 @@ msgid "``pred`` contains the predecessor of the ``node``." msgstr "" msgid "" -"If needed filter out the added columns, for example, to return the " -"original columns" +"If needed filter out the added columns, for example, to return the original " +"columns" msgstr "" msgid "" -"Using `this `__ example." +"Using `this `__ example." msgstr "" msgid "The ``from_v`` result column name changes to ``start_vid``." msgstr "" msgid "" -"If needed filter out and rename columns, for example, to return the " -"original columns:" +"If needed filter out and rename columns, for example, to return the original " +"columns:" msgstr "" -msgid "Migration of ``pgr_kruskalDD`` / ``pgr_kruskalBFS`` / ``pgr_kruskalDFS``" +msgid "" +"Migration of ``pgr_kruskalDD`` / ``pgr_kruskalBFS`` / ``pgr_kruskalDFS``" msgstr "" msgid "" -"Starting from `v3.7.0 " -"`__ " -":doc:`pgr_kruskalDD`, :doc:`pgr_kruskalBFS` and :doc:`pgr_kruskalDFS` " -"result columns are being standardized." +"Starting from `v3.7.0 `__ :" +"doc:`pgr_kruskalDD`, :doc:`pgr_kruskalBFS` and :doc:`pgr_kruskalDFS` result " +"columns are being standardized." msgstr "" msgid "|result-bfs|" @@ -4594,35 +4578,33 @@ msgid "Kruskal single vertex" msgstr "" msgid "" -"Using ``pgr_KruskalDD`` as example. Migration is similar to al the " -"affected functions." +"Using ``pgr_KruskalDD`` as example. Migration is similar to al the affected " +"functions." msgstr "" msgid "" -"Comparing with `this " -"`__ " -"example." +"Comparing with `this `__ example." msgstr "" -msgid "Now column ``pred`` exists and contains the predecessor of the ``node``." +msgid "" +"Now column ``pred`` exists and contains the predecessor of the ``node``." msgstr "" msgid "Kruskal multiple vertices" msgstr "" msgid "" -"Comparing with `this " -"`__" -" example." +"Comparing with `this `__ example." msgstr "" msgid "Migration of ``pgr_KSP``" msgstr "" msgid "" -"Starting from `v3.6.0 " -"`__ :doc:`pgr_KSP` " -"result columns are being standardized." +"Starting from `v3.6.0 `__ :" +"doc:`pgr_KSP` result columns are being standardized." msgstr "" msgid "|ksp-result|" @@ -4644,26 +4626,25 @@ msgid "``pgr_KSP`` (One to One) does not have ``start_vid`` and ``end_vid``." msgstr "" msgid "" -"Using `this " -"`__ example." +"Using `this `__ " +"example." msgstr "" msgid "" -"If needed filter out the added columns, for example, to return the " -"original columns:" +"If needed filter out the added columns, for example, to return the original " +"columns:" msgstr "" msgid "Migration of ``pgr_maxCardinalityMatch``" msgstr "" msgid "" -":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, " -"therefore the ``directed`` flag has been removed." +":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, therefore " +"the ``directed`` flag has been removed." msgstr "" msgid "" -"Starting from `v3.4.0 " -"`__" +"Starting from `v3.4.0 `__" msgstr "" msgid "Signature to be migrated:" @@ -4694,8 +4675,8 @@ msgid "Before migration" msgstr "" msgid "" -"Columns used are ``going`` and ``coming`` to represent the existence of " -"an edge." +"Columns used are ``going`` and ``coming`` to represent the existence of an " +"edge." msgstr "" msgid "" @@ -4712,8 +4693,8 @@ msgid "" msgstr "" msgid "" -"Use the columns ``cost`` and ``reverse_cost`` to represent the existence " -"of an edge." +"Use the columns ``cost`` and ``reverse_cost`` to represent the existence of " +"an edge." msgstr "" msgid "Do not use the flag ``directed``." @@ -4726,10 +4707,9 @@ msgid "Migration of ``pgr_primDD`` / ``pgr_primBFS`` / ``pgr_primDFS``" msgstr "" msgid "" -"Starting from `v3.7.0 " -"`__ :doc:`pgr_primDD`, " -":doc:`pgr_primBFS` and :doc:`pgr_primDFS` result columns are being " -"standardized." +"Starting from `v3.7.0 `__ :" +"doc:`pgr_primDD`, :doc:`pgr_primBFS` and :doc:`pgr_primDFS` result columns " +"are being standardized." msgstr "" msgid "``pgr_primDD``" @@ -4750,25 +4730,24 @@ msgid "" msgstr "" msgid "" -"Comparing with `this `__ example." +"Comparing with `this `__ example." msgstr "" msgid "Prim multiple vertices" msgstr "" msgid "" -"Comparing with `this `__ example." +"Comparing with `this `__ example." msgstr "" msgid "Migration of ``pgr_withPointsDD``" msgstr "" msgid "" -"Starting from `v3.6.0 " -"`__ " -":doc:`pgr_withPointsDD` result columns are being standardized." +"Starting from `v3.6.0 `__ :" +"doc:`pgr_withPointsDD` result columns are being standardized." msgstr "" msgid "|result-generic-no-seq|" @@ -4793,8 +4772,7 @@ msgid "Does not have ``start_vid``, ``pred`` and ``depth`` result columns." msgstr "" msgid "" -"``driving_side`` parameter was named optional now it is compulsory " -"unnamed." +"``driving_side`` parameter was named optional now it is compulsory unnamed." msgstr "" msgid "``pgr_withPointsDD`` (`Multiple vertices`)" @@ -4852,8 +4830,8 @@ msgid "New output columns are |result-spantree|" msgstr "" msgid "" -"**driving side** parameter is unnamed compulsory, and valid values differ" -" for directed and undirected graphs." +"**driving side** parameter is unnamed compulsory, and valid values differ " +"for directed and undirected graphs." msgstr "" msgid "Does not have a default value." @@ -4869,8 +4847,8 @@ msgid "Using an invalid value throws an ``ERROR``." msgstr "" msgid "" -"Using `this `__ example." +"Using `this `__ example." msgstr "" msgid "" @@ -4890,13 +4868,13 @@ msgid "filter out the additional columns, for example;" msgstr "" msgid "" -"When ``details => false`` to remove the points use ``WHERE node >= 0 OR " -"cost = 0``" +"When ``details => false`` to remove the points use ``WHERE node >= 0 OR cost " +"= 0``" msgstr "" msgid "" -"Using `this `__ example." +"Using `this `__ example." msgstr "" msgid "Filter out the additional columns" @@ -4906,9 +4884,8 @@ msgid "Migration of ``pgr_withPointsKSP``" msgstr "" msgid "" -"Starting from `v3.6.0 " -"`__ " -":doc:`pgr_withPointsKSP` result columns are being standardized." +"Starting from `v3.6.0 `__ :" +"doc:`pgr_withPointsKSP` result columns are being standardized." msgstr "" msgid "" @@ -4927,9 +4904,8 @@ msgid "New output columns are |nksp-result|" msgstr "" msgid "" -"Using `this " -"`__ " -"example." +"Using `this `__ example." msgstr "" msgid "" @@ -5159,14 +5135,15 @@ msgid "Restrictions data" msgstr "" msgid "" -"The restriction with ``rid = 2`` represents the path :math:`3 " -"\\rightarrow5 \\rightarrow9`." +"The restriction with ``rid = 2`` represents the path :math:`3 \\rightarrow5 " +"\\rightarrow9`." msgstr "" msgid "By inspection the path is clear." msgstr "" -msgid "To transform the old restrictions table to the new restrictions structure," +msgid "" +"To transform the old restrictions table to the new restrictions structure," msgstr "" msgid "Create a new table with the new restrictions structure." @@ -5176,8 +5153,8 @@ msgid "In this migration guide ``new_restrictions`` is been used." msgstr "" msgid "" -"For this migration pgRouting supplies an auxiliary function for reversal " -"of an array ``_pgr_array_reverse`` needed for the migration." +"For this migration pgRouting supplies an auxiliary function for reversal of " +"an array ``_pgr_array_reverse`` needed for the migration." msgstr "" msgid "``_pgr_array_reverse``:" @@ -5205,8 +5182,8 @@ msgid "pgRouting Concepts" msgstr "" msgid "" -"This is a simple guide that go through some of the steps for getting " -"started with pgRouting. This guide covers:" +"This is a simple guide that go through some of the steps for getting started " +"with pgRouting. This guide covers:" msgstr "" msgid "Graphs" @@ -5218,33 +5195,29 @@ msgstr "" msgid ":math:`V` is a set of vertices, also called nodes." msgstr "" -#, python-brace-format msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V \\}`" msgstr "" msgid "There are different kinds of graphs:" msgstr "" -#, python-brace-format msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V\\}`" msgstr "" msgid "Undirected simple graph" msgstr "" -#, python-brace-format msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V, u \\neq v\\}`" msgstr "" -#, python-brace-format msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V) \\}`" msgstr "" msgid "Directed simple graph" msgstr "" -#, python-brace-format -msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" +msgid "" +":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`" msgstr "" msgid "Graphs:" @@ -5254,11 +5227,12 @@ msgid "Do not have geometries." msgstr "" msgid "" -"Some graph theory problems require graphs to have weights, called " -"**cost** in pgRouting." +"Some graph theory problems require graphs to have weights, called **cost** " +"in pgRouting." msgstr "" -msgid "In pgRouting there are several ways to represent a graph on the database:" +msgid "" +"In pgRouting there are several ways to represent a graph on the database:" msgstr "" msgid "With ``cost``" @@ -5284,18 +5258,20 @@ msgstr "" msgid "Weight of the edge (``source``, ``target``):" msgstr "" -msgid "When negative the edge (``source``, ``target``) do not exist on the graph." +msgid "" +"When negative the edge (``source``, ``target``) do not exist on the graph." msgstr "" msgid "``cost`` must exist in the query." msgstr "" -msgid "When negative the edge (``target``, ``source``) do not exist on the graph." +msgid "" +"When negative the edge (``target``, ``source``) do not exist on the graph." msgstr "" msgid "" -"The decision of the graph to be **directed** or **undirected** is done " -"when executing a pgRouting algorithm." +"The decision of the graph to be **directed** or **undirected** is done when " +"executing a pgRouting algorithm." msgstr "" msgid "Graph with ``cost``" @@ -5311,8 +5287,8 @@ msgid "``SELECT id, source, target, cost FROM edges``" msgstr "" msgid "" -":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } " -"cost_{id} \\ge 0 \\}`" +":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} " +"\\ge 0 \\}`" msgstr "" msgid "Edges where ``cost`` is non negative are part of the graph." @@ -5324,11 +5300,9 @@ msgstr "" msgid "All vertices in ``source`` and ``target`` are part of the graph." msgstr "" -#, python-brace-format msgid "" -"In a directed graph the edge :math:`(source_{id}, target_{id}, " -"cost_{id})` has directionality: :math:`source_{id} \\rightarrow " -"target_{id}`" +"In a directed graph the edge :math:`(source_{id}, target_{id}, cost_{id})` " +"has directionality: :math:`source_{id} \\rightarrow target_{id}`" msgstr "" msgid "For the following data:" @@ -5340,23 +5314,20 @@ msgstr "" msgid "The data is representing the following graph:" msgstr "" -#, python-brace-format msgid "" "In an undirected graph the edge :math:`(source_{id}, target_{id}, " -"cost_{id})` does not have directionality: :math:`source_{id} " -"\\frac{\\;\\;\\;\\;\\;}{} target_{id}`" +"cost_{id})` does not have directionality: :math:`source_{id} \\frac{\\;\\;\\;" +"\\;\\;}{} target_{id}`" msgstr "" -#, python-brace-format msgid "" -"In terms of a directed graph is like having two edges: :math:`source_{id}" -" \\leftrightarrow target_{id}`" +"In terms of a directed graph is like having two edges: :math:`source_{id} " +"\\leftrightarrow target_{id}`" msgstr "" -#, python-brace-format msgid "" -"Edge :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) is not part of the" -" graph." +"Edge :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) is not part of the " +"graph." msgstr "" msgid "Graph with ``cost`` and ``reverse_cost``" @@ -5369,15 +5340,15 @@ msgid "The set of edges :math:`E`:" msgstr "" msgid "" -":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}," -" cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & " +":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, " +"cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & " "{\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } " "reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`" msgstr "" msgid "" -"Edges :math:`(source \\rightarrow target)` where ``cost`` is non negative" -" are part of the graph." +"Edges :math:`(source \\rightarrow target)` where ``cost`` is non negative " +"are part of the graph." msgstr "" msgid "" @@ -5391,13 +5362,11 @@ msgstr "" msgid "In a directed graph both edges have directionality" msgstr "" -#, python-brace-format msgid "" -"edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: " -":math:`source_{id} \\rightarrow target_{id}`" +"edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:" +"`source_{id} \\rightarrow target_{id}`" msgstr "" -#, python-brace-format msgid "" "edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` has " "directionality: :math:`target_{id} \\rightarrow source_{id}`" @@ -5415,16 +5384,14 @@ msgstr "" msgid "In a directed graph both edges do not have directionality" msgstr "" -#, python-brace-format msgid "" "Edge :math:`(source_{id}, target_{id}, cost_{id})` is :math:`source_{id} " "\\frac{\\;\\;\\;\\;\\;}{} target_{id}`" msgstr "" -#, python-brace-format msgid "" -"Edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` is " -":math:`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" +"Edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` is :math:" +"`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`" msgstr "" msgid "In terms of a directed graph is like having four edges:" @@ -5436,11 +5403,9 @@ msgstr "" msgid ":math:`target_i \\leftrightarrow source_i`" msgstr "" -#, python-brace-format msgid ":math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`)" msgstr "" -#, python-brace-format msgid ":math:`3` (:math:`3 \\frac{\\;\\;\\;\\;\\;}{} 2`)" msgstr "" @@ -5448,18 +5413,17 @@ msgid "Graphs without geometries" msgstr "" msgid "" -"Personal relationships, genealogy, file dependency problems can be solved" -" using pgRouting. Those problems, normally, do not come with geometries " +"Personal relationships, genealogy, file dependency problems can be solved " +"using pgRouting. Those problems, normally, do not come with geometries " "associated with the graph." msgstr "" msgid "Wiki example" msgstr "" -#, python-format msgid "" -"Solve the example problem taken from `wikipedia " -"`__):" +"Solve the example problem taken from `wikipedia `__):" msgstr "" msgid "Problem is to find the shortest path from :math:`1` to :math:`5`." @@ -5469,25 +5433,22 @@ msgid "Is an undirected graph." msgstr "" msgid "" -"Although visually looks like to have geometries, the drawing is not to " -"scale." +"Although visually looks like to have geometries, the drawing is not to scale." msgstr "" msgid "No geometries associated to the vertices or edges" msgstr "" -#, python-brace-format msgid "Has 6 vertices :math:`\\{1,2,3,4,5,6\\}`" msgstr "" msgid "Has 9 edges:" msgstr "" -#, python-brace-format msgid "" -":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14)," -" \\\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), " -"\\\\ & (5,6,9) \\} \\end{align} \\end{split}`" +":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\" +"\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & " +"(5,6,9) \\} \\end{align} \\end{split}`" msgstr "" msgid "The graph can be represented in many ways for example:" @@ -5505,8 +5466,8 @@ msgid "Create a table" msgstr "" msgid "" -"The basic elements needed to perform basic routing on an undirected graph" -" are:" +"The basic elements needed to perform basic routing on an undirected graph " +"are:" msgstr "" msgid "SMALLINT, INTEGER, BIGINT, REAL, FLOAT" @@ -5541,15 +5502,16 @@ msgstr "" msgid "Create a routing Database" msgstr "" -msgid "The first step is to create a database and load pgRouting in the database." +msgid "" +"The first step is to create a database and load pgRouting in the database." msgstr "" msgid "Typically create a database for each project." msgstr "" msgid "" -"Once having the database to work in, load your data and build the routing" -" application in that database." +"Once having the database to work in, load your data and build the routing " +"application in that database." msgstr "" msgid "Load Data" @@ -5568,8 +5530,8 @@ msgid ":doc:`sampledata`: a small graph used in the documentation examples" msgstr "" msgid "" -"Using `osm2pgrouting " -"`__" +"Using `osm2pgrouting `__" msgstr "" msgid "There are various open source tools that can help, like:" @@ -5629,20 +5591,20 @@ msgid "Prepare the graph" msgstr "" msgid "" -"What and how to prepare the graph, will depend on the application and/or " -"on the quality of the data and/or on how close the information is to have" -" a topology usable by pgRouting and/or some other factors not mentioned." +"What and how to prepare the graph, will depend on the application and/or on " +"the quality of the data and/or on how close the information is to have a " +"topology usable by pgRouting and/or some other factors not mentioned." msgstr "" msgid "" -"The steps to prepare the graph involve geometry operations using `PostGIS" -" `__ and some others involve graph operations like " -":doc:`pgr_contraction` to contract a graph." +"The steps to prepare the graph involve geometry operations using `PostGIS " +"`__ and some others involve graph operations like :doc:" +"`pgr_contraction` to contract a graph." msgstr "" msgid "" -"The `workshop `__ has a step by " -"step on how to prepare a graph using Open Street Map data, for a small " +"The `workshop `__ has a step by step " +"on how to prepare a graph using Open Street Map data, for a small " "application." msgstr "" @@ -5661,19 +5623,18 @@ msgid "" msgstr "" msgid "" -"Data coming from OSM and using `osm2pgrouting " -"`__ as an import tool, comes " -"with the routing topology. See an example of using ``osm2pgrouting`` on " -"the `workshop " -"`__." +"Data coming from OSM and using `osm2pgrouting `__ as an import tool, comes with the routing topology. See an " +"example of using ``osm2pgrouting`` on the `workshop `__." msgstr "" msgid "Adjust costs" msgstr "" msgid "" -"For this example the ``cost`` and ``reverse_cost`` values are going to be" -" the double of the length of the geometry." +"For this example the ``cost`` and ``reverse_cost`` values are going to be " +"the double of the length of the geometry." msgstr "" msgid "Update costs to length of geometry" @@ -5761,16 +5722,15 @@ msgid "To get the crossing edges:" msgstr "" msgid "" -"That information is correct, for example, when in terms of vehicles, is " -"it a tunnel or bridge crossing over another road." +"That information is correct, for example, when in terms of vehicles, is it a " +"tunnel or bridge crossing over another road." msgstr "" msgid "It might be incorrect, for example:" msgstr "" msgid "" -"When it is actually an intersection of roads, where vehicles can make " -"turns." +"When it is actually an intersection of roads, where vehicles can make turns." msgstr "" msgid "" @@ -5786,14 +5746,14 @@ msgstr "" msgid "" "If the data comes from OSM and was imported to the database using " -"``osm2pgrouting``, the fix needs to be done in the `OSM portal " -"`__ and the data imported again." +"``osm2pgrouting``, the fix needs to be done in the `OSM portal `__ and the data imported again." msgstr "" msgid "" -"In general when the data comes from a supplier that has the data prepared" -" for routing vehicles, and there is a problem, the data is to be fixed " -"from the supplier" +"In general when the data comes from a supplier that has the data prepared " +"for routing vehicles, and there is a problem, the data is to be fixed from " +"the supplier" msgstr "" msgid "For very specific applications" @@ -5808,9 +5768,8 @@ msgid "The data needs a local fix for the specific application." msgstr "" msgid "" -"Once analyzed one by one the crossings, for the ones that need a local " -"fix, the edges need to be `split " -"`__." +"Once analyzed one by one the crossings, for the ones that need a local fix, " +"the edges need to be `split `__." msgstr "" msgid "" @@ -5823,8 +5782,8 @@ msgid "Fixing an intersection" msgstr "" msgid "" -"In this example the original edge table will be used to store the " -"additional geometries." +"In this example the original edge table will be used to store the additional " +"geometries." msgstr "" msgid "An example use without results" @@ -5849,17 +5808,17 @@ msgid "Adding new segments." msgstr "" msgid "" -"Calling :doc:`pgr_separateCrossing` and adding the new segments to the " -"edges table." +"Calling :doc:`pgr_separateCrossing` and adding the new segments to the edges " +"table." msgstr "" msgid "Update other values" msgstr "" msgid "" -"In this example only ``cost`` and ``reverse_cost`` are updated, where " -"they are based on the length of the geometry and the directionality is " -"kept using the ``sign`` function." +"In this example only ``cost`` and ``reverse_cost`` are updated, where they " +"are based on the length of the geometry and the directionality is kept using " +"the ``sign`` function." msgstr "" msgid "Update the topology" @@ -5890,9 +5849,8 @@ msgid "Maybe there is a small barrier for vehicles but not for pedestrians." msgstr "" msgid "" -"Once analyzed one by one the touchings, for the ones that need a local " -"fix, the edges need to be `split " -"`__." +"Once analyzed one by one the touchings, for the ones that need a local fix, " +"the edges need to be `split `__." msgstr "" msgid "Fixing a gap" @@ -5908,8 +5866,8 @@ msgid "The analysis tell us that the network has a gap." msgstr "" msgid "" -"Calling :doc:`pgr_separateTouching` and adding the new segments to the " -"edges table." +"Calling :doc:`pgr_separateTouching` and adding the new segments to the edges " +"table." msgstr "" msgid "Routing from :math:`1` to :math:`2` gives a solution." @@ -5937,8 +5895,8 @@ msgid "This solution requires the edge to be split." msgstr "" msgid "" -"In this example :doc:`pgr_separateCrossing` and " -":doc:`pgr_separateTouching` will be used." +"In this example :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` " +"will be used." msgstr "" msgid "Get the connectivity" @@ -5953,8 +5911,8 @@ msgid "Insert new edges" msgstr "" msgid "" -"Using :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` insert " -"the results into the edges table." +"Using :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` insert the " +"results into the edges table." msgstr "" msgid "Create the vertices table" @@ -5971,18 +5929,18 @@ msgstr "" msgid "" "When to contract will depend on the size of the graph, processing times, " -"correctness of the data, on the final application, or any other factor " -"not mentioned." +"correctness of the data, on the final application, or any other factor not " +"mentioned." msgstr "" msgid "" -"A fairly good method of finding out if contraction can be useful is " -"because of the number of dead ends and/or the number of linear edges." +"A fairly good method of finding out if contraction can be useful is because " +"of the number of dead ends and/or the number of linear edges." msgstr "" msgid "" -"A complete method on how to contract and how to use the contracted graph " -"is described on :doc:`contraction-family`" +"A complete method on how to contract and how to use the contracted graph is " +"described on :doc:`contraction-family`" msgstr "" msgid "To get the dead ends:" @@ -5992,8 +5950,7 @@ msgid "A dead end happens when" msgstr "" msgid "" -"The vertex is the limit of a cul-de-sac, a no-through road or a no-exit " -"road." +"The vertex is the limit of a cul-de-sac, a no-through road or a no-exit road." msgstr "" msgid "The vertex is on the limit of the imported graph." @@ -6003,8 +5960,8 @@ msgid "If a larger graph is imported then the vertex might not be a dead end" msgstr "" msgid "" -"Node :math:`4`, is a dead end on the query, even that it visually looks " -"like an end point of 3 edges." +"Node :math:`4`, is a dead end on the query, even that it visually looks like " +"an end point of 3 edges." msgstr "" msgid "Is node :math:`4` a dead end or not?" @@ -6020,8 +5977,8 @@ msgid "That does not allow a vehicle to use that visual intersection?" msgstr "" msgid "" -"Is the application for pedestrians and therefore the pedestrian can " -"easily walk on the small curb?" +"Is the application for pedestrians and therefore the pedestrian can easily " +"walk on the small curb?" msgstr "" msgid "" @@ -6030,16 +5987,16 @@ msgid "" msgstr "" msgid "" -"Is there a big cliff and from eagles view look like the dead end is close" -" to the segment?" +"Is there a big cliff and from eagles view look like the dead end is close to " +"the segment?" msgstr "" msgid "Depending on the answer, modification of the data might be needed." msgstr "" msgid "" -"When there are many dead ends, to speed up processing, the :doc" -":`contraction-family` functions can be used to contract the graph." +"When there are many dead ends, to speed up processing, the :doc:`contraction-" +"family` functions can be used to contract the graph." msgstr "" msgid "Linear edges" @@ -6049,21 +6006,21 @@ msgid "To get the linear edges:" msgstr "" msgid "" -"These linear vertices are correct, for example, when those the vertices " -"are speed bumps, stop signals and the application is taking them into " -"account." +"These linear vertices are correct, for example, when those the vertices are " +"speed bumps, stop signals and the application is taking them into account." msgstr "" msgid "" -"When there are many linear vertices, that need not to be taken into " -"account, to speed up the processing, the :doc:`contraction-family` " -"functions can be used to contract the problem." +"When there are many linear vertices, that need not to be taken into account, " +"to speed up the processing, the :doc:`contraction-family` functions can be " +"used to contract the problem." msgstr "" msgid "Function's structure" msgstr "" -msgid "Once the graph preparation work has been done above, it is time to use a" +msgid "" +"Once the graph preparation work has been done above, it is time to use a" msgstr "" msgid "The general form of a pgRouting function call is:" @@ -6080,23 +6037,25 @@ msgid "" "containing SQL queries." msgstr "" -msgid "**parameters**: Additional compulsory parameters needed by the function." +msgid "" +"**parameters**: Additional compulsory parameters needed by the function." msgstr "" msgid "" -"``Optional parameters``: Are non compulsory **named** parameters that " -"have a default value when omitted." +"``Optional parameters``: Are non compulsory **named** parameters that have a " +"default value when omitted." msgstr "" msgid "" -"The compulsory parameters are positional parameters, the optional " -"parameters are named parameters." +"The compulsory parameters are positional parameters, the optional parameters " +"are named parameters." msgstr "" msgid "For example, for this :doc:`pgr_dijkstra` signature:" msgstr "" -msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "" +"pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" msgid "`Edges SQL`_:" @@ -6112,8 +6071,8 @@ msgid "It is an inner query." msgstr "" msgid "" -"It has no name, so **Edges SQL** gives an idea of what kind of inner " -"query needs to be used" +"It has no name, so **Edges SQL** gives an idea of what kind of inner query " +"needs to be used" msgstr "" msgid "**start vid**:" @@ -6131,8 +6090,8 @@ msgid "Is the third parameter." msgstr "" msgid "" -"It has no name, so **end vid** gives an idea of what the third " -"parameter's value should contain" +"It has no name, so **end vid** gives an idea of what the third parameter's " +"value should contain" msgstr "" msgid "Is the fourth parameter." @@ -6230,10 +6189,10 @@ msgid "Needs a `Combinations SQL`_" msgstr "" msgid "" -"There are several kinds of valid inner queries and also the columns " -"returned are depending of the function. Which kind of inner query will " -"depend on the function's requirements. To simplify the variety of types, " -"**ANY-INTEGER** and **ANY-NUMERICAL** is used." +"There are several kinds of valid inner queries and also the columns returned " +"are depending of the function. Which kind of inner query will depend on the " +"function's requirements. To simplify the variety of types, **ANY-INTEGER** " +"and **ANY-NUMERICAL** is used." msgstr "" msgid "Edges SQL for" @@ -6252,8 +6211,8 @@ msgid "General with (X,Y)" msgstr "" msgid "" -"When negative: edge (``source``, ``target``) does not exist, therefore " -"it's not part of the graph." +"When negative: edge (``source``, ``target``) does not exist, therefore it's " +"not part of the graph." msgstr "" msgid "Weight of the edge (``target``, ``source``)," @@ -6304,14 +6263,14 @@ msgid "" msgstr "" msgid "" -"Depending on the family or category of a function it will have additional" -" parameters, some of them are compulsory and some are optional." +"Depending on the family or category of a function it will have additional " +"parameters, some of them are compulsory and some are optional." msgstr "" msgid "" "The compulsory parameters are nameless and must be given in the required " -"order. The optional parameters are named parameters and will have a " -"default value." +"order. The optional parameters are named parameters and will have a default " +"value." msgstr "" msgid "Parameters for the Via functions" @@ -6342,15 +6301,15 @@ msgid "``U_turn_on_edge``" msgstr "" msgid "" -"When ``true`` departing from a visited vertex will not try to avoid using" -" the edge used to reach it. In other words, U turn using the edge with " -"same identifier is allowed." +"When ``true`` departing from a visited vertex will not try to avoid using " +"the edge used to reach it. In other words, U turn using the edge with same " +"identifier is allowed." msgstr "" msgid "" -"When ``false`` when a departing from a visited vertex tries to avoid " -"using the edge used to reach it. In other words, U turn using the edge " -"with same identifier is used when no other path is found." +"When ``false`` when a departing from a visited vertex tries to avoid using " +"the edge used to reach it. In other words, U turn using the edge with same " +"identifier is used when no other path is found." msgstr "" msgid "For the TRSP functions" @@ -6359,7 +6318,8 @@ msgstr "" msgid "Array of identifiers of destination vertices." msgstr "" -msgid "There are several kinds of columns returned are depending of the function." +msgid "" +"There are several kinds of columns returned are depending of the function." msgstr "" msgid "Result columns for a path" @@ -6369,47 +6329,46 @@ msgid "Used in functions that return one path solution" msgstr "" msgid "" -"Returns set of ``(seq, path_seq [, start_vid] [, end_vid], node, edge, " -"cost, agg_cost)``" +"Returns set of ``(seq, path_seq [, start_vid] [, end_vid], node, edge, cost, " +"agg_cost)``" msgstr "" msgid "``path_seq``" msgstr "" msgid "" -"Relative position in the path. Has value **1** for the beginning of a " -"path." +"Relative position in the path. Has value **1** for the beginning of a path." msgstr "" msgid "" -"Identifier of the starting vertex. Returned when multiple starting " -"vetrices are in the query." +"Identifier of the starting vertex. Returned when multiple starting vetrices " +"are in the query." msgstr "" msgid "" -"Identifier of the ending vertex. Returned when multiple ending vertices " -"are in the query." +"Identifier of the ending vertex. Returned when multiple ending vertices are " +"in the query." msgstr "" msgid "Identifier of the node in the path from ``start_vid`` to ``end_vid``." msgstr "" msgid "" -"Identifier of the edge used to go from ``node`` to the next node in the " -"path sequence. **-1** for the last node of the path." +"Identifier of the edge used to go from ``node`` to the next node in the path " +"sequence. **-1** for the last node of the path." msgstr "" msgid "" -"Cost to traverse from ``node`` using ``edge`` to the next node in the " -"path sequence." +"Cost to traverse from ``node`` using ``edge`` to the next node in the path " +"sequence." msgstr "" msgid "Used in functions the following:" msgstr "" msgid "" -"Returns set of ``(seq, path_seq [, start_pid] [, end_pid], node, edge, " -"cost, agg_cost)``" +"Returns set of ``(seq, path_seq [, start_pid] [, end_pid], node, edge, cost, " +"agg_cost)``" msgstr "" msgid "Relative position in the path." @@ -6458,8 +6417,8 @@ msgid "When negative is the identifier of the a point." msgstr "" msgid "" -"Identifier of the edge used to go from ``node`` to the next node in the " -"path sequence." +"Identifier of the edge used to go from ``node`` to the next node in the path " +"sequence." msgstr "" msgid "**-1** for the last row of the path." @@ -6472,8 +6431,7 @@ msgid ":doc:`pgr_dijkstraNear`" msgstr "" msgid "" -"Returns ``(seq, path_seq, start_vid, end_vid, node, edge, cost, " -"agg_cost)``" +"Returns ``(seq, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)``" msgstr "" msgid "Identifier of the starting vertex of the current path." @@ -6502,7 +6460,8 @@ msgstr "" msgid "Path identifier." msgstr "" -msgid "Has value **1** for the first of a path from ``start_vid`` to ``end_vid``." +msgid "" +"Has value **1** for the first of a path from ``start_vid`` to ``end_vid``." msgstr "" msgid "Non selective for multiple paths" @@ -6512,8 +6471,8 @@ msgid "Regardless of the call, al the columns are returned." msgstr "" msgid "" -"Returns set of ``(seq, path_id, path_seq, start_vid, end_vid, node, edge," -" cost, agg_cost)``" +"Returns set of ``(seq, path_id, path_seq, start_vid, end_vid, node, edge, " +"cost, agg_cost)``" msgstr "" msgid "Result columns for cost functions" @@ -6523,8 +6482,8 @@ msgid "Used in the following" msgstr "" msgid "" -"When start_vid or end_vid columns have negative values, the identifier is" -" for a Point." +"When start_vid or end_vid columns have negative values, the identifier is " +"for a Point." msgstr "" msgid "Result columns for flow functions" @@ -6548,12 +6507,13 @@ msgstr "" msgid "For the Routing functions" msgstr "" -msgid "To get faster results bound the queries to an area of interest of routing." +msgid "" +"To get faster results bound the queries to an area of interest of routing." msgstr "" msgid "" -"In this example Use an inner query SQL that does not include some edges " -"in the routing function and is within the area of the results." +"In this example Use an inner query SQL that does not include some edges in " +"the routing function and is within the area of the results." msgstr "" msgid "Given this area:" @@ -6569,16 +6529,16 @@ msgid "Wiki" msgstr "" msgid "" -"Edit an existing `pgRouting Wiki " -"`__ page." +"Edit an existing `pgRouting Wiki `__ page." msgstr "" msgid "Or create a new Wiki page" msgstr "" msgid "" -"Create a page on the `pgRouting Wiki " -"`__" +"Create a page on the `pgRouting Wiki `__" msgstr "" msgid "Give the title an appropriate name" @@ -6593,8 +6553,8 @@ msgid "Adding Functionality to pgRouting" msgstr "" msgid "" -"Consult the `developer's documentation " -"`__" +"Consult the `developer's documentation `__" msgstr "" msgid "Installation" @@ -6622,17 +6582,16 @@ msgid ":ref:`install_testing`" msgstr "" msgid "" -"Instructions for downloading and installing binaries for different " -"operating systems, additional notes and corrections not included in this " -"documentation can be found in `Installation wiki " -"`__" +"Instructions for downloading and installing binaries for different operating " +"systems, additional notes and corrections not included in this documentation " +"can be found in `Installation wiki `__" msgstr "" msgid "" -"To use pgRouting PostGIS needs to be installed, please read the " -"information about installation in this `Install Guide " -"`__" +"To use pgRouting PostGIS needs to be installed, please read the information " +"about installation in this `Install Guide `__" msgstr "" msgid "Short Version" @@ -6653,16 +6612,16 @@ msgid "Get the sources" msgstr "" msgid "" -"The pgRouting latest release can be found in " -"https://github.com/pgRouting/pgrouting/releases/latest" +"The pgRouting latest release can be found in https://github.com/pgRouting/" +"pgrouting/releases/latest" msgstr "" msgid "To download this release:" msgstr "" msgid "" -"Go to :ref:`install-short` for more instructions on extracting tar ball " -"and compiling pgRouting." +"Go to :ref:`install-short` for more instructions on extracting tar ball and " +"compiling pgRouting." msgstr "" msgid "git" @@ -6673,8 +6632,8 @@ msgstr "" msgid "" "Go to :ref:`install-short` for more instructions on compiling pgRouting " -"(there is no tar ball involved while downloading pgRouting repository " -"from GitHub)." +"(there is no tar ball involved while downloading pgRouting repository from " +"GitHub)." msgstr "" msgid "Enabling and upgrading in the database" @@ -6685,13 +6644,12 @@ msgstr "" msgid "" "pgRouting is a PostgreSQL extension and depends on PostGIS to provide " -"functionalities to end user. Below given code demonstrates enabling " -"PostGIS and pgRouting in the database." +"functionalities to end user. Below given code demonstrates enabling PostGIS " +"and pgRouting in the database." msgstr "" msgid "" -"Checking PostGIS and pgRouting version after enabling them in the " -"database." +"Checking PostGIS and pgRouting version after enabling them in the database." msgstr "" msgid "Upgrading the database" @@ -6703,8 +6661,8 @@ msgid "" msgstr "" msgid "" -"More information can be found in https://www.postgresql.org/docs/current" -"/sql-createextension.html" +"More information can be found in https://www.postgresql.org/docs/current/sql-" +"createextension.html" msgstr "" msgid "Dependencies" @@ -6714,21 +6672,20 @@ msgid "Compilation Dependencies" msgstr "" msgid "" -"To be able to compile pgRouting, make sure that the following " -"dependencies are met:" +"To be able to compile pgRouting, make sure that the following dependencies " +"are met:" msgstr "" msgid "C and C++0x compilers" msgstr "" msgid "" -"Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with " -"C++03 or C++11 standard support" +"Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with C++03 " +"or C++11 standard support" msgstr "" msgid "" -"Compiling with Boost 1.75 requires C++ Compiler with C++14 standard " -"support" +"Compiling with Boost 1.75 requires C++ Compiler with C++14 standard support" msgstr "" msgid "Postgresql version = Supported versions by PostgreSQL" @@ -6792,8 +6749,8 @@ msgid "To exit psql console" msgstr "" msgid "" -"Entering psql console directly without switching roles can be done by the" -" following commands" +"Entering psql console directly without switching roles can be done by the " +"following commands" msgstr "" msgid "Then use the above given method to exit out of the psql console" @@ -6812,10 +6769,10 @@ msgid "Creating PostgreSQL role" msgstr "" msgid "" -"Default role provided by PostgreSQL is postgres. To create new roles you " -"can use the above provided commands. The prompt will ask the user to type" -" name of the role and then provide affirmation. Proceed with the steps " -"and you will succeed in creating PostgreSQL role successfully." +"Default role provided by PostgreSQL is postgres. To create new roles you can " +"use the above provided commands. The prompt will ask the user to type name " +"of the role and then provide affirmation. Proceed with the steps and you " +"will succeed in creating PostgreSQL role successfully." msgstr "" msgid "" @@ -6824,8 +6781,8 @@ msgid "" msgstr "" msgid "" -"To get additional details on the flags associated with ``createuser`` " -"below given command can be used" +"To get additional details on the flags associated with ``createuser`` below " +"given command can be used" msgstr "" msgid "Creating Database in PostgreSQL" @@ -6936,8 +6893,8 @@ msgid "The following instructions start from *path/to/pgrouting/build*" msgstr "" msgid "" -"We have tested on several platforms, For installing or reinstalling all " -"the steps are needed." +"We have tested on several platforms, For installing or reinstalling all the " +"steps are needed." msgstr "" msgid "The sql signatures are configured and build in the ``cmake`` command." @@ -6953,8 +6910,7 @@ msgid "The following instructions start from *path/to/pgrouting*" msgstr "" msgid "" -"To remove the build when the configuration changes, use the following " -"code:" +"To remove the build when the configuration changes, use the following code:" msgstr "" msgid "and start the build process as mentioned previously." @@ -6972,19 +6928,18 @@ msgstr "" msgid "" "pgRouting is an extension of `PostGIS `__ and " "`PostgreSQL `__ geospatial database and adds " -"routing and other network analysis functionality. A predecessor of " -"pgRouting – pgDijkstra, written by Sylvain Pasche from `Camptocamp " -"`__, was later extended by Orkney and renamed to " -"pgRouting. The project is now supported and maintained by `Georepublic " -"`__, `Paragon Corporation " -"`__ and a broad user community." +"routing and other network analysis functionality. A predecessor of pgRouting " +"– pgDijkstra, written by Sylvain Pasche from `Camptocamp `__, was later extended by Orkney and renamed to pgRouting. The project " +"is now supported and maintained by `Georepublic `__, `Paragon Corporation `__ and " +"a broad user community." msgstr "" msgid "" -"pgRouting is part of `OSGeo Community Projects " -"`__ from the `OSGeo" -" Foundation `__ and included on `OSGeoLive " -"`__." +"pgRouting is part of `OSGeo Community Projects `__ from the `OSGeo Foundation `__ and included on `OSGeoLive `__." msgstr "" msgid "Licensing" @@ -7000,29 +6955,28 @@ msgid "GNU General Public License v2.0 or later" msgstr "" msgid "" -"Most features of pgRouting are available under `GNU General Public " -"License v2.0 or later `_." +"Most features of pgRouting are available under `GNU General Public License " +"v2.0 or later `_." msgstr "" msgid "Boost Software License - Version 1.0" msgstr "" msgid "" -"Some Boost extensions are available under `Boost Software License - " -"Version 1.0 `_." +"Some Boost extensions are available under `Boost Software License - Version " +"1.0 `_." msgstr "" msgid "MIT-X License" msgstr "" -msgid "Some code contributed by iMaptools.com is available under MIT-X license." +msgid "" +"Some code contributed by iMaptools.com is available under MIT-X license." msgstr "" msgid "" -"The pgRouting Manual is licensed under a `Creative Commons Attribution-" -"Share Alike 3.0 License `_." +"The pgRouting Manual is licensed under a `Creative Commons Attribution-Share " +"Alike 3.0 License `_." msgstr "" msgid "" @@ -7055,8 +7009,8 @@ msgid "Corporate Sponsors in this release (in alphabetical order)" msgstr "" msgid "" -"These are corporate entities that have contributed developer time, " -"hosting, or direct monetary funding to the pgRouting project:" +"These are corporate entities that have contributed developer time, hosting, " +"or direct monetary funding to the pgRouting project:" msgstr "" msgid "`OSGeo `__" @@ -7079,18 +7033,17 @@ msgstr "" msgid "" "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio " -"Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, " -"Ashraf Hossain, Ashish Kumar, Cayetano Benavent, Christian Gonzalez, " -"Daniel Kastl, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, " -"Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa " -"Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, " -"Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata" -" Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, " -"Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, " -"Razequl Islam, Regina Obe, Rohith Reddy, Sarthak Agarwal, Shobhit " -"Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain " -"Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, " -"Yige Huang" +"Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf " +"Hossain, Ashish Kumar, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, " +"Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, " +"Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, " +"Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, " +"Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin " +"Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul " +"Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith " +"Reddy, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, " +"Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, " +"Virginia Vergara, Yige Huang" msgstr "" msgid "Corporate Sponsors (in alphabetical order)" @@ -7138,8 +7091,8 @@ msgid "" msgstr "" msgid "" -"PostgreSQL database server at the PostgreSQL main site " -"https://www.postgresql.org." +"PostgreSQL database server at the PostgreSQL main site https://www." +"postgresql.org." msgstr "" msgid "PostGIS extension at the PostGIS project web site https://postgis.net." @@ -7163,7 +7116,7 @@ msgstr "" msgid "Version 3.6.0" msgstr "" -msgid "Result columns standarized to: |nksp-result|" +msgid "Standardizing output columns to |nksp-result|" msgstr "" msgid "pgr_ksp(One to One)" @@ -7203,16 +7156,13 @@ msgid "Official function." msgstr "" msgid "" -"The K shortest path routing algorithm based on Yen's algorithm. \"K\" is " -"the number of shortest paths desired." +"The K shortest path routing algorithm based on Yen's algorithm. \"K\" is the " +"number of shortest paths desired." msgstr "" msgid "|Boost| Boost Graph Inside" msgstr "" -msgid "Boost Graph inside" -msgstr "" - msgid "Signatures" msgstr "" @@ -7222,13 +7172,16 @@ msgstr "" msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vid**, **K**, [**options**])" msgstr "" -msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" +msgid "" +"pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])" msgstr "" -msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" +msgid "" +"pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])" msgstr "" -msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" +msgid "" +"pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])" msgstr "" msgid "pgr_KSP(`Edges SQL`_, `Combinations SQL`_, **K**, [**options**])" @@ -7249,22 +7202,19 @@ msgstr "" msgid "Get 2 paths from :math:`6` to :math:`17` on a directed graph." msgstr "" -#, python-brace-format msgid "" "Get 2 paths from vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a " "directed graph." msgstr "" -#, python-brace-format msgid "" "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a " "directed graph." msgstr "" -#, python-brace-format msgid "" -"Get 2 paths vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` " -"on a directed graph." +"Get 2 paths vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on " +"a directed graph." msgstr "" msgid "Using a combinations table on an directed graph" @@ -7298,11 +7248,12 @@ msgid "When ``true`` all the calculated paths while processing are returned." msgstr "" msgid "" -"Roughly, when the shortest path has ``N`` edges, the heap will contain " -"about than ``N * K`` paths for small value of ``K`` and ``K > 5``." +"Roughly, when the shortest path has ``N`` edges, the heap will contain about " +"than ``N * K`` paths for small value of ``K`` and ``K > 5``." msgstr "" -msgid "Has value **1** for the first of a path from ``start_vid`` to ``end_vid``" +msgid "" +"Has value **1** for the first of a path from ``start_vid`` to ``end_vid``" msgstr "" msgid "Identifier of the node in the path from ``start_vid`` to ``end_vid``" @@ -7326,7 +7277,6 @@ msgstr "" msgid "Get 2 paths using combinations table on an undirected graph" msgstr "" -#, python-brace-format msgid "" "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a " "undirected graph." @@ -7348,8 +7298,8 @@ msgid "Version 3.2.1" msgstr "" msgid "" -"Metric Algorithm from `Boost library " -"`__" +"Metric Algorithm from `Boost library `__" msgstr "" msgid "Simulated Annealing Algorithm no longer supported" @@ -7389,7 +7339,7 @@ msgid "When ``start_vid = 0 OR end_vid = 0``" msgstr "" msgid "" -"The solutions generated is garanteed to be *twice as long as the optimal " +"The solutions generated are guaranteed to be *twice as long as the optimal " "tour in the worst case*" msgstr "" @@ -7397,17 +7347,17 @@ msgid "When ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``" msgstr "" msgid "" -"It is **not garanteed** that the solution will be, in the worse case, " -"twice as long as the optimal tour, due to the fact that `end_vid` is " -"forced to be in a fixed position." +"It is **not guaranteed** that the solution will be, in the worst case, twice " +"as long as the optimal tour, due to the fact that `end_vid` is forced to be " +"in a fixed position." msgstr "" msgid "With ``directed => true``" msgstr "" msgid "" -"It is **not garanteed** that the solution will be, in the worse case, " -"twice as long as the optimal tour" +"It is **not guaranteed** that the solution will be, in the worst case, twice " +"as long as the optimal tour" msgstr "" msgid "is directed" @@ -7424,8 +7374,8 @@ msgid "" msgstr "" msgid "" -"edges `(u, v)` and `(v, u)` is considered to be the same edge (denoted " -"`(u, v)`" +"edges `(u, v)` and `(v, u)` is considered to be the same edge (denoted `(u, " +"v)`" msgstr "" msgid "if ``agg_cost`` differs between one or more instances of edge `(u, v)`" @@ -7453,16 +7403,12 @@ msgstr "" msgid "Returns set of |tsp-result|" msgstr "" -msgid "OR EMTPY SET" -msgstr "" - msgid "Using :doc:`pgr_dijkstraCostMatrix` to generate the matrix information" msgstr "" -#, python-brace-format msgid "" -"**Line 4** Vertices :math:`\\{2, 4, 13, 14\\}` are not included because " -"they are not connected." +"**Line 4** Vertices :math:`\\{2, 4, 13, 14\\}` are not included because they " +"are not connected." msgstr "" msgid "`Matrix SQL`_ as described below" @@ -7490,8 +7436,8 @@ msgid "Identifier of the node/coordinate/point." msgstr "" msgid "" -"Cost to traverse from the current ``node`` to the next ``node`` in the " -"path sequence." +"Cost to traverse from the current ``node`` to the next ``node`` in the path " +"sequence." msgstr "" msgid "``0`` for the last row in the tour sequence." @@ -7509,23 +7455,23 @@ msgstr "" msgid "**Line 6** ``start_vid => 1``" msgstr "" -msgid "Using points of interest to generate an asymetric matrix." +msgid "Using points of interest to generate an asymmetric matrix." msgstr "" msgid "To generate an asymmetric matrix:" msgstr "" msgid "" -"**Line 4** The ``side`` information of ``pointsOfInterset`` is ignored by" -" not including it in the query" +"**Line 4** The ``side`` information of ``pointsOfInterset`` is ignored by " +"not including it in the query" msgstr "" -msgid "**Line 6** Generating an asymetric matrix with ``directed => true``" +msgid "**Line 6** Generating an asymmetric matrix with ``directed => true``" msgstr "" msgid "" -":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered" -" as the ``agg_cost``" +":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered as " +"the ``agg_cost``" msgstr "" msgid "" @@ -7542,15 +7488,14 @@ msgstr "" msgid "Connected incomplete data" msgstr "" -#, python-brace-format msgid "" "Using selected edges :math:`\\{2, 4, 5, 8, 9, 15\\}` the matrix is not " "complete." msgstr "" msgid "" -"Cost value for :math:`17 \\rightarrow 10` do not exist on the matrix, but" -" the value used is taken from :math:`10 \\rightarrow 17`." +"Cost value for :math:`17 \\rightarrow 10` do not exist on the matrix, but " +"the value used is taken from :math:`10 \\rightarrow 17`." msgstr "" msgid "``pgr_TSPeuclidean``" @@ -7560,8 +7505,8 @@ msgid "``pgr_TSPeuclidean`` - Approximation using *metric* algorithm." msgstr "" msgid "" -"Using `Boost: metric TSP approx " -"`__" +"Using `Boost: metric TSP approx `__" msgstr "" msgid "" @@ -7581,19 +7526,16 @@ msgid "New official function." msgstr "" msgid "" -"Any duplicated identifier will be ignored. The coordinates that will be " -"kept" -msgstr "" - -msgid "is arbitrarly." +"Any duplicated identifier will be ignored. The coordinates than will be kept " +"is arbitrarily." msgstr "" -msgid "The coordinates are quite similar for the same identifier, for example ::" +msgid "" +"The coordinates are quite similar for the same identifier, for example ::" msgstr "" msgid "" -"The coordinates are quite different for the same identifier, for example " -"::" +"The coordinates are quite different for the same identifier, for example ::" msgstr "" msgid "pgr_TSPeuclidean(`Coordinates SQL`_, ``[start_id, end_id]``)" @@ -7628,10 +7570,9 @@ msgstr "" msgid "" "This example shows how to make performance tests using University of " -"Waterloo's `example data " -"`__ using the 29 " -"cities of `Western Sahara dataset " -"`__" +"Waterloo's `example data `__ using the 29 cities of `Western Sahara dataset `__" msgstr "" msgid "Creating a table for the data and storing the data" @@ -7644,8 +7585,8 @@ msgid "Total tour cost" msgstr "" msgid "" -"Getting a total cost of the tour, compare the value with the length of an" -" optimal tour is 27603, given on the dataset" +"Getting a total cost of the tour, compare the value with the length of an " +"optimal tour is 27603, given on the dataset" msgstr "" msgid "Getting a geometry of the tour" @@ -7655,9 +7596,9 @@ msgid "Visual results" msgstr "" msgid "" -"Visualy, The first image is the `optimal solution " -"`__ and the second " -"image is the solution obtained with ``pgr_TSPeuclidean``." +"Visually, The first image is the `optimal solution `__ and the second image is the solution " +"obtained with ``pgr_TSPeuclidean``." msgstr "" msgid "``pgr_aStar``" @@ -7666,7 +7607,7 @@ msgstr "" msgid "``pgr_aStar`` — Shortest path using the A* algorithm." msgstr "" -msgid "Standarizing output columns to |short-generic-result|" +msgid "Standardizing output columns to |short-generic-result|" msgstr "" msgid "pgr_aStar(One to One) added ``start_vid`` and ``end_vid`` columns." @@ -7703,8 +7644,8 @@ msgid "Signature change on pgr_aStar(One to One)" msgstr "" msgid "" -"The results are equivalent to the union of the results of the " -"`pgr_aStar(` `One to One`_ `)` on the:" +"The results are equivalent to the union of the results of the `pgr_aStar(` " +"`One to One`_ `)` on the:" msgstr "" msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" @@ -7736,27 +7677,23 @@ msgid "" "heuristic :math:`2`" msgstr "" -#, python-brace-format msgid "" "From vertex :math:`6` to vertices :math:`\\{10, 12\\}` on a **directed** " "graph with heuristic :math:`3` and factor :math:`3.5`" msgstr "" -#, python-brace-format msgid "" -"From vertices :math:`\\{6, 8\\}` to vertex :math:`10` on an " -"**undirected** graph with heuristic :math:`4`" +"From vertices :math:`\\{6, 8\\}` to vertex :math:`10` on an **undirected** " +"graph with heuristic :math:`4`" msgstr "" -#, python-brace-format msgid "" "From vertices :math:`\\{6, 8\\}` to vertices :math:`\\{10, 12\\}` on a " "**directed** graph with factor :math:`0.5`" msgstr "" msgid "" -"Using a combinations table on a **directed** graph with factor " -":math:`0.5`." +"Using a combinations table on a **directed** graph with factor :math:`0.5`." msgstr "" msgid "Example 1" @@ -7781,8 +7718,7 @@ msgid "``pgr_aStarCost``" msgstr "" msgid "" -"``pgr_aStarCost`` - Total cost of the shortest path using the A* " -"algorithm." +"``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." msgstr "" msgid "pgr_aStarCost(Combinations)" @@ -7792,8 +7728,8 @@ msgid "New proposed function." msgstr "" msgid "" -"The ``pgr_aStarCost`` function sumarizes of the cost of the shortest path" -" using the A* algorithm." +"The ``pgr_aStarCost`` function summarizes of the cost of the shortest path " +"using the A* algorithm." msgstr "" msgid "" @@ -7822,7 +7758,8 @@ msgstr "" msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "" +"pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "" msgid "pgr_aStarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" @@ -7838,11 +7775,11 @@ msgid "``pgr_aStarCostMatrix``" msgstr "" msgid "" -"``pgr_aStarCostMatrix`` - Calculates the a cost matrix using " -":doc:`pgr_aStar`." +"``pgr_aStarCostMatrix`` - Calculates the a cost matrix using :doc:" +"`pgr_aStar`." msgstr "" -msgid "Using internaly the :doc:`pgr_aStar` algorithm" +msgid "Using internally the :doc:`pgr_aStar` algorithm" msgstr "" msgid "Returns a cost matrix." @@ -7872,7 +7809,6 @@ msgstr "" msgid "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" msgstr "" -#, python-brace-format msgid "" "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an " "**undirected** graph using heuristic :math:`2`" @@ -7923,21 +7859,23 @@ msgstr "" msgid "Uses PostGis ST_DelaunyTriangles" msgstr "" -msgid "Instead of using CGAL's definition of `alpha` it use the ``spoon_radius``" +msgid "" +"Instead of using CGAL's definition of `alpha` it use the ``spoon_radius``" msgstr "" msgid ":math:`spoon\\_radius = \\sqrt alpha`" msgstr "" msgid "" -"A Triangle area is considered part of the alpha shape when " -":math:`circumcenter\\ radius < spoon\\_radius`" +"A Triangle area is considered part of the alpha shape when :math:" +"`circumcenter\\ radius < spoon\\_radius`" msgstr "" msgid "The ``alpha`` parameter is the **spoon radius**" msgstr "" -msgid "When the total number of points is less than 3, returns an EMPTY geometry" +msgid "" +"When the total number of points is less than 3, returns an EMPTY geometry" msgstr "" msgid "pgr_alphaShape(**geometry**, [alpha])" @@ -7947,8 +7885,8 @@ msgid "RETURNS ``geometry``" msgstr "" msgid "" -"passing a geometry collection with spoon radius :math:`1.5` using the " -"return variable ``geom``" +"passing a geometry collection with spoon radius :math:`1.5` using the return " +"variable ``geom``" msgstr "" msgid "**geometry**" @@ -8030,7 +7968,8 @@ msgstr "" msgid "tolerance" msgstr "" -msgid "``float8`` Snapping tolerance of disconnected edges. (in projection unit)" +msgid "" +"``float8`` Snapping tolerance of disconnected edges. (in projection unit)" msgstr "" msgid "the_geom" @@ -8069,8 +8008,8 @@ msgid "rows_where" msgstr "" msgid "" -"``text`` Condition to select a subset or rows. Default value is ``true`` " -"to indicate all rows." +"``text`` Condition to select a subset or rows. Default value is ``true`` to " +"indicate all rows." msgstr "" msgid "Uses the vertices table: _vertices_pgr." @@ -8080,8 +8019,7 @@ msgid "Fills completely the ``cnt`` and ``chk`` columns of the vertices table." msgstr "" msgid "" -"Returns the analysis of the section of the network defined by " -"``rows_where``" +"Returns the analysis of the section of the network defined by ``rows_where``" msgstr "" msgid "The vertices table is not found." @@ -8114,8 +8052,7 @@ msgid "cnt" msgstr "" msgid "" -"``integer`` Number of vertices in the edge_table that reference this " -"vertex." +"``integer`` Number of vertices in the edge_table that reference this vertex." msgstr "" msgid "chk" @@ -8128,16 +8065,16 @@ msgid "ein" msgstr "" msgid "" -"``integer`` Number of vertices in the edge_table that reference this " -"vertex as incoming." +"``integer`` Number of vertices in the edge_table that reference this vertex " +"as incoming." msgstr "" msgid "eout" msgstr "" msgid "" -"``integer`` Number of vertices in the edge_table that reference this " -"vertex as outgoing." +"``integer`` Number of vertices in the edge_table that reference this vertex " +"as outgoing." msgstr "" msgid "``geometry`` Point geometry of the vertex." @@ -8162,9 +8099,9 @@ msgid "the arguments are not given in the appropriate order:" msgstr "" msgid "" -"In this example, the column ``id`` of the table ``mytable`` is passed to " -"the function as the geometry column, and the geometry column ``the_geom``" -" is passed to the function as the id column." +"In this example, the column ``id`` of the table ``mytable`` is passed to the " +"function as the geometry column, and the geometry column ``the_geom`` is " +"passed to the function as the id column." msgstr "" msgid "When using the named notation" @@ -8174,16 +8111,16 @@ msgid "The order of the parameters do not matter:" msgstr "" msgid "" -"Parameters defined with a default value can be omitted, as long as the " -"value matches the default:" +"Parameters defined with a default value can be omitted, as long as the value " +"matches the default:" msgstr "" msgid "Selecting rows using rows_where parameter" msgstr "" msgid "" -"Selecting rows based on the id. Displays the analysis a the section of " -"the network." +"Selecting rows based on the id. Displays the analysis a the section of the " +"network." msgstr "" msgid "" @@ -8192,8 +8129,8 @@ msgid "" msgstr "" msgid "" -"Selecting the rows where the geometry is near the geometry of the row " -"with ``gid`` =100 of the table ``othertable``." +"Selecting the rows where the geometry is near the geometry of the row with " +"``gid`` =100 of the table ``othertable``." msgstr "" msgid "Usage when the edge table's columns DO NOT MATCH the default values:" @@ -8205,7 +8142,8 @@ msgstr "" msgid "Using positional notation:" msgstr "" -msgid "The arguments need to be given in the order described in the parameters:" +msgid "" +"The arguments need to be given in the order described in the parameters:" msgstr "" msgid "" @@ -8249,36 +8187,36 @@ msgid "" msgstr "" msgid "" -"This function analyzes oneway streets in a graph and identifies any " -"flipped segments." +"This function analyzes oneway streets in a graph and identifies any flipped " +"segments." msgstr "" msgid "" "The analyses of one way segments is pretty simple but can be a powerful " "tools to identifying some the potential problems created by setting the " -"direction of a segment the wrong way. A node is a `source` if it has " -"edges the exit from that node and no edges enter that node. Conversely, a" -" node is a `sink` if all edges enter the node but none exit that node. " -"For a `source` type node it is logically impossible to exist because no " -"vehicle can exit the node if no vehicle and enter the node. Likewise, if " -"you had a `sink` node you would have an infinite number of vehicle piling" -" up on this node because you can enter it but not leave it." +"direction of a segment the wrong way. A node is a `source` if it has edges " +"the exit from that node and no edges enter that node. Conversely, a node is " +"a `sink` if all edges enter the node but none exit that node. For a `source` " +"type node it is logically impossible to exist because no vehicle can exit " +"the node if no vehicle and enter the node. Likewise, if you had a `sink` " +"node you would have an infinite number of vehicle piling up on this node " +"because you can enter it but not leave it." msgstr "" msgid "" -"So why do we care if the are not feasible? Well if the direction of an " -"edge was reversed by mistake we could generate exactly these conditions. " -"Think about a divided highway and on the north bound lane one segment got" -" entered wrong or maybe a sequence of multiple segments got entered wrong" -" or maybe this happened on a round-about. The result would be potentially" -" a `source` and/or a `sink` node." +"So why do we care if the are not feasible? Well if the direction of an edge " +"was reversed by mistake we could generate exactly these conditions. Think " +"about a divided highway and on the north bound lane one segment got entered " +"wrong or maybe a sequence of multiple segments got entered wrong or maybe " +"this happened on a round-about. The result would be potentially a `source` " +"and/or a `sink` node." msgstr "" msgid "" "So by counting the number of edges entering and exiting each node we can " -"identify both `source` and `sink` nodes so that you can look at those " -"areas of your network to make repairs and/or report the problem back to " -"your data vendor." +"identify both `source` and `sink` nodes so that you can look at those areas " +"of your network to make repairs and/or report the problem back to your data " +"vendor." msgstr "" msgid "" @@ -8332,7 +8270,8 @@ msgid "" "value is ``true``." msgstr "" -msgid "Fills completely the ``ein`` and ``eout`` columns of the vertices table." +msgid "" +"Fills completely the ``ein`` and ``eout`` columns of the vertices table." msgstr "" msgid "The names of source , target or oneway are the same." @@ -8348,8 +8287,8 @@ msgid "``pgr_articulationPoints``" msgstr "" msgid "" -"``pgr_articulationPoints`` - Return the articulation points of an " -"undirected graph." +"``pgr_articulationPoints`` - Return the articulation points of an undirected " +"graph." msgstr "" msgid "Result columns change: ``seq`` is removed" @@ -8362,11 +8301,10 @@ msgid "New experimental function." msgstr "" msgid "" -"Those vertices that belong to more than one biconnected component are " -"called articulation points or, equivalently, cut vertices. Articulation " -"points are vertices whose removal would increase the number of connected " -"components in the graph. This implementation can only be used with an " -"undirected graph." +"Those vertices that belong to more than one biconnected component are called " +"articulation points or, equivalently, cut vertices. Articulation points are " +"vertices whose removal would increase the number of connected components in " +"the graph. This implementation can only be used with an undirected graph." msgstr "" msgid "Works for **undirected** graphs." @@ -8391,13 +8329,13 @@ msgid "Nodes in red are the articulation points." msgstr "" msgid "" -"`Boost: Biconnected components & articulation points " -"`__" +"`Boost: Biconnected components & articulation points `__" msgstr "" msgid "" -"wikipedia: `Biconnected component " -"`__" +"wikipedia: `Biconnected component `__" msgstr "" msgid "``pgr_bdAstar``" @@ -8462,20 +8400,24 @@ msgid "pgr_bdAstarCost(Combinations)" msgstr "" msgid "" -"The ``pgr_bdAstarCost`` function sumarizes of the cost of the shortest " -"path using the bidirectional A* algorithm." +"The ``pgr_bdAstarCost`` function summarizes of the cost of the shortest path " +"using the bidirectional A* algorithm." msgstr "" -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" +msgid "" +"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" msgstr "" -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "" +"pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgstr "" -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "" +"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" -msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" +msgid "" +"pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "" msgid "pgr_bdAstarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" @@ -8485,11 +8427,11 @@ msgid "``pgr_bdAstarCostMatrix``" msgstr "" msgid "" -"``pgr_bdAstarCostMatrix`` - Calculates the a cost matrix using " -":doc:`pgr_aStar`." +"``pgr_bdAstarCostMatrix`` - Calculates the a cost matrix using :doc:" +"`pgr_aStar`." msgstr "" -msgid "Using internaly the :doc:`pgr_bdAstar` algorithm" +msgid "Using internally the :doc:`pgr_bdAstar` algorithm" msgstr "" msgid "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" @@ -8499,8 +8441,8 @@ msgid "``pgr_bdDijkstra``" msgstr "" msgid "" -"``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional " -"Dijkstra algorithm." +"``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra " +"algorithm." msgstr "" msgid "pgr_bdDijkstra(Combinations)" @@ -8518,16 +8460,20 @@ msgstr "" msgid "Signature change on pgr_bdDijsktra(One to One)" msgstr "" -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "" +"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "" +"pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "" +"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" -msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" +msgid "" +"pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])" @@ -8545,7 +8491,6 @@ msgstr "" msgid "Returns set of |result-1-m|" msgstr "" -#, python-brace-format msgid "" "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed** " "graph" @@ -8554,13 +8499,10 @@ msgstr "" msgid "Returns set of |result-m-1|" msgstr "" -#, python-brace-format msgid "" -"From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** " -"graph" +"From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** graph" msgstr "" -#, python-brace-format msgid "" "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an " "**undirected** graph" @@ -8584,18 +8526,16 @@ msgid "pgr_bdDijkstraCost(Combinations)" msgstr "" msgid "" -"The ``pgr_bdDijkstraCost`` function sumarizes of the cost of the shortest" -" path using the bidirectional Dijkstra Algorithm." +"The ``pgr_bdDijkstraCost`` function summarizes of the cost of the shortest " +"path using the bidirectional Dijkstra Algorithm." msgstr "" msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , " -"[``directed``])" +"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" msgstr "" msgid "" -"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, " -"[``directed``])" +"pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" msgid "" @@ -8618,19 +8558,17 @@ msgid "``pgr_bdDijkstraCostMatrix``" msgstr "" msgid "" -"``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using " -":doc:`pgr_bdDijkstra`." +"``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using :doc:" +"`pgr_bdDijkstra`." msgstr "" msgid "" -"Using bidirectional Dijkstra algorithm, calculate and return a cost " -"matrix." +"Using bidirectional Dijkstra algorithm, calculate and return a cost matrix." msgstr "" msgid "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])" msgstr "" -#, python-brace-format msgid "" "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an " "**undirected** graph" @@ -8652,34 +8590,35 @@ msgid "pgr_bellmanFord(Combinations)" msgstr "" msgid "" -"Bellman-Ford's algorithm, is named after Richard Bellman and Lester Ford," -" who first published it in 1958 and 1956, respectively.It is a graph " -"search algorithm that computes shortest paths from a starting vertex " -"(``start_vid``) to an ending vertex (``end_vid``) in a graph where some " -"of the edge weights may be negative. Though it is more versatile, it is " -"slower than Dijkstra's algorithm.This implementation can be used with a " -"directed graph and an undirected graph." +"Bellman-Ford's algorithm, is named after Richard Bellman and Lester Ford, " +"who first published it in 1958 and 1956, respectively.It is a graph search " +"algorithm that computes shortest paths from a starting vertex " +"(``start_vid``) to an ending vertex (``end_vid``) in a graph where some of " +"the edge weights may be negative. Though it is more versatile, it is slower " +"than Dijkstra's algorithm.This implementation can be used with a directed " +"graph and an undirected graph." msgstr "" -msgid "Process is valid for edges with both positive and negative edge weights." +msgid "" +"Process is valid for edges with both positive and negative edge weights." msgstr "" msgid "" -"When the start vertex and the end vertex are the same, there is no path. " -"The agg_cost would be :math:`0`." +"When the start vertex and the end vertex are the same, there is no path. The " +"agg_cost would be :math:`0`." msgstr "" msgid "" -"When the start vertex and the end vertex are different, and there exists " -"a path between them without having a *negative cycle*. The agg_cost would" -" be some finite value denoting the shortest distance between them." +"When the start vertex and the end vertex are different, and there exists a " +"path between them without having a *negative cycle*. The agg_cost would be " +"some finite value denoting the shortest distance between them." msgstr "" msgid "" -"When the start vertex and the end vertex are different, and there exists " -"a path between them, but it contains a *negative cycle*. In such case, " -"agg_cost for those vertices keep on decreasing furthermore, Hence " -"agg_cost can’t be defined for them." +"When the start vertex and the end vertex are different, and there exists a " +"path between them, but it contains a *negative cycle*. In such case, " +"agg_cost for those vertices keep on decreasing furthermore, Hence agg_cost " +"can’t be defined for them." msgstr "" msgid "" @@ -8695,38 +8634,38 @@ msgstr "" msgid "Running time: :math:`O(| start\\_vids | * ( V * E))`" msgstr "" -msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "" +"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "" +"pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "" +"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" msgid "" -"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" +"pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" msgid "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" -#, python-brace-format msgid "" -"From vertex :math:`6` to vertices :math:`\\{ 10, 17\\}` on a **directed**" -" graph" +"From vertex :math:`6` to vertices :math:`\\{ 10, 17\\}` on a **directed** " +"graph" msgstr "" msgid "Using a combinations table on an **undirected** graph." msgstr "" msgid "" -"`Boost: Bellman Ford " -"`__" +"`Boost: Bellman Ford `__" msgstr "" -#, python-format msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" msgstr "" @@ -8745,21 +8684,20 @@ msgid "Version 3.7.0" msgstr "" msgid "" -"The Brandes Algorithm takes advantage of the sparse graphs for evaluating" -" the betweenness centrality score of all vertices." +"The Brandes Algorithm takes advantage of the sparse graphs for evaluating " +"the betweenness centrality score of all vertices." msgstr "" msgid "" "Betweenness centrality measures the extent to which a vertex lies on the " "shortest paths between all other pairs of vertices. Vertices with a high " -"betweenness centrality score may have considerable influence in a network" -" by the virtue of their control over the shortest paths passing between " -"them." +"betweenness centrality score may have considerable influence in a network by " +"the virtue of their control over the shortest paths passing between them." msgstr "" msgid "" -"The removal of these vertices will affect the network by disrupting the " -"it, as most of the shortest paths between vertices pass through them." +"The removal of these vertices will affect the network by disrupting the it, " +"as most of the shortest paths between vertices pass through them." msgstr "" msgid "This implementation work for both directed and undirected graphs." @@ -8780,7 +8718,6 @@ msgstr "" msgid "Returns set of ``(vid, centrality)``" msgstr "" -#, python-brace-format msgid "For a directed graph with edges :math:`\\{1, 2, 3, 4\\}`." msgstr "" @@ -8794,8 +8731,8 @@ msgid "The leaf vertices have betweenness centrality :math:`0`." msgstr "" msgid "" -"Betweenness centrality of vertex :math:`6` is higher than of vertex " -":math:`10`." +"Betweenness centrality of vertex :math:`6` is higher than of vertex :math:" +"`10`." msgstr "" msgid "Removing vertex :math:`6` will create three graph components." @@ -8811,13 +8748,12 @@ msgid "``centrality``" msgstr "" msgid "" -"Relative betweenness centrality score of the vertex (will be in range " -"[0,1])" +"Relative betweenness centrality score of the vertex (will be in range [0,1])" msgstr "" msgid "" -"`Boost: betweenness centrality " -"`_" +"`Boost: betweenness centrality `_" msgstr "" msgid "``pgr_biconnectedComponents``" @@ -8838,12 +8774,12 @@ msgid "``seq`` changed type to ``BIGINT``" msgstr "" msgid "" -"The biconnected components of an undirected graph are the maximal subsets" -" of vertices such that the removal of a vertex from particular component " -"will not disconnect the component. Unlike connected components, vertices " -"may belong to multiple biconnected components. Vertices can be present in" -" multiple biconnected components, but each edge can only be contained in " -"a single biconnected component." +"The biconnected components of an undirected graph are the maximal subsets of " +"vertices such that the removal of a vertex from particular component will " +"not disconnect the component. Unlike connected components, vertices may " +"belong to multiple biconnected components. Vertices can be present in " +"multiple biconnected components, but each edge can only be contained in a " +"single biconnected component." msgstr "" msgid "Components are described by edges." @@ -8884,10 +8820,9 @@ msgid "" "graph." msgstr "" -#, python-brace-format msgid "" -"Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any " -"non-negative integer, is termed as a 'binary graph'." +"Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-" +"negative integer, is termed as a 'binary graph'." msgstr "" msgid "pgr_binaryBreadthFirstSearch(Combinations)" @@ -8895,30 +8830,28 @@ msgstr "" msgid "" "It is well-known that the shortest paths between a single source and all " -"other vertices can be found using Breadth First Search in :math:`O(|E|)` " -"in an unweighted graph, i.e. the distance is the minimal number of edges " -"that you need to traverse from the source to another vertex. We can " -"interpret such a graph also as a weighted graph, where every edge has the" -" weight :math:`1`. If not alledges in graph have the same weight, that we" -" need a more general algorithm, like Dijkstra's Algorithm which runs in " -":math:`O(|E|log|V|)` time." +"other vertices can be found using Breadth First Search in :math:`O(|E|)` in " +"an unweighted graph, i.e. the distance is the minimal number of edges that " +"you need to traverse from the source to another vertex. We can interpret " +"such a graph also as a weighted graph, where every edge has the weight :math:" +"`1`. If not alledges in graph have the same weight, that we need a more " +"general algorithm, like Dijkstra's Algorithm which runs in :math:`O(|E|log|" +"V|)` time." msgstr "" -#, python-brace-format msgid "" -"However if the weights are more constrained, we can use a faster " -"algorithm. This algorithm, termed as 'Binary Breadth First Search' as " -"well as '0-1 BFS', is a variation of the standard Breadth First Search " -"problem to solve the SSSP (single-source shortest path) problem in " -":math:`O(|E|)`, if the weights of each edge belongs to the set {0,X}, " -"where 'X' is any non-negative real integer." +"However if the weights are more constrained, we can use a faster algorithm. " +"This algorithm, termed as 'Binary Breadth First Search' as well as '0-1 " +"BFS', is a variation of the standard Breadth First Search problem to solve " +"the SSSP (single-source shortest path) problem in :math:`O(|E|)`, if the " +"weights of each edge belongs to the set {0,X}, where 'X' is any non-negative " +"real integer." msgstr "" -#, python-brace-format msgid "" -"Process is done only on 'binary graphs'. ('Binary Graph': Any graph whose" -" edge-weights belongs to the set {0,X}, where 'X' is any non-negative " -"real integer.)" +"Process is done only on 'binary graphs'. ('Binary Graph': Any graph whose " +"edge-weights belongs to the set {0,X}, where 'X' is any non-negative real " +"integer.)" msgstr "" msgid "Running time: :math:`O(| start\\_vids | * |E|)`" @@ -8950,20 +8883,20 @@ msgid "" msgstr "" msgid "" -"**Note:** Using the :doc:`sampledata` Network as all weights are same " -"(i.e :math:`1``)" +"**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :" +"math:`1``)" msgstr "" msgid "" -"`Boost: Breadth First Search " -"`__" +"`Boost: Breadth First Search `__" msgstr "" msgid "https://cp-algorithms.com/graph/01_bfs.html" msgstr "" -#, python-format -msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" +msgid "" +"https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" msgstr "" msgid "``pgr_bipartite`` - Experimental" @@ -8975,10 +8908,10 @@ msgid "" msgstr "" msgid "" -"A bipartite graph is a graph with two sets of vertices which are " -"connected to each other, but not within themselves. A bipartite graph is " -"possible if the graph coloring is possible using two colors such that " -"vertices in a set are colored with the same color." +"A bipartite graph is a graph with two sets of vertices which are connected " +"to each other, but not within themselves. A bipartite graph is possible if " +"the graph coloring is possible using two colors such that vertices in a set " +"are colored with the same color." msgstr "" msgid "The algorithm works in undirected graph only." @@ -8988,9 +8921,9 @@ msgid "The returned values are not ordered." msgstr "" msgid "" -"The algorithm checks graph is bipartite or not. If it is bipartite then " -"it returns the node along with two colors `0` and `1` which represents " -"two different sets." +"The algorithm checks graph is bipartite or not. If it is bipartite then it " +"returns the node along with two colors `0` and `1` which represents two " +"different sets." msgstr "" msgid "If graph is not bipartite then algorithm returns empty set." @@ -9011,24 +8944,23 @@ msgstr "" msgid "The odd length cyclic graph can not be bipartite." msgstr "" -#, python-brace-format msgid "" -"The edge :math:`5 \\rightarrow 1` will make subgraph with vertices " -":math:`\\{1, 3, 7, 6, 5\\}` an odd length cyclic graph, as the cycle has " -"5 vertices." +"The edge :math:`5 \\rightarrow 1` will make subgraph with vertices :math:" +"`\\{1, 3, 7, 6, 5\\}` an odd length cyclic graph, as the cycle has 5 " +"vertices." msgstr "" msgid "Edges in blue represent odd length cycle subgraph." msgstr "" msgid "" -"`Boost: is_bipartite " -"`__" +"`Boost: is_bipartite `__" msgstr "" msgid "" -"`Wikipedia: bipartite graph " -"`__" +"`Wikipedia: bipartite graph `__" msgstr "" msgid "``pgr_boykovKolmogorov``" @@ -9036,8 +8968,8 @@ msgstr "" msgid "" "``pgr_boykovKolmogorov`` — Calculates the flow on the graph edges that " -"maximizes the flow from the sources to the targets using Boykov " -"Kolmogorov algorithm." +"maximizes the flow from the sources to the targets using Boykov Kolmogorov " +"algorithm." msgstr "" msgid "pgr_boykovKolmogorov(Combinations)" @@ -9073,48 +9005,45 @@ msgstr "" msgid "From vertex :math:`11` to vertex :math:`12`" msgstr "" -#, python-brace-format msgid "From vertex :math:`11` to vertices :math:`\\{5, 10, 12\\}`" msgstr "" -#, python-brace-format msgid "From vertices :math:`\\{11, 3, 17\\}` to vertex :math:`12`" msgstr "" -#, python-brace-format -msgid "From vertices :math:`\\{11, 3, 17\\}` to vertices :math:`\\{5, 10, 12\\}`" +msgid "" +"From vertices :math:`\\{11, 3, 17\\}` to vertices :math:`\\{5, 10, 12\\}`" msgstr "" -#, python-brace-format msgid "" -"Using a combinations table, equivalent to calculating result from " -"vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`." +"Using a combinations table, equivalent to calculating result from vertices :" +"math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`." msgstr "" msgid "" -"`Boost: Boykov Kolmogorov max flow " -"`__" +"`Boost: Boykov Kolmogorov max flow `__" msgstr "" msgid "``pgr_breadthFirstSearch`` - Experimental" msgstr "" msgid "" -"``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth" -" First Search algorithm." +"``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth " +"First Search algorithm." msgstr "" msgid "" -"Provides the Breadth First Search traversal order from a root vertex to a" -" particular depth." +"Provides the Breadth First Search traversal order from a root vertex to a " +"particular depth." msgstr "" msgid "The implementation will work on any type of graph." msgstr "" msgid "" -"Provides the Breadth First Search traversal order from a source node to a" -" target depth level." +"Provides the Breadth First Search traversal order from a source node to a " +"target depth level." msgstr "" msgid "Running time: :math:`O(E + V)`" @@ -9133,11 +9062,10 @@ msgid "Returns set of |result-bfs|" msgstr "" msgid "" -"From root vertex :math:`6` on a **directed** graph with edges in " -"ascending order of ``id``" +"From root vertex :math:`6` on a **directed** graph with edges in ascending " +"order of ``id``" msgstr "" -#, python-brace-format msgid "" "From root vertices :math:`\\{12, 6\\}` on an **undirected** graph with " "**depth** :math:`<= 2` and edges in ascending order of ``id``" @@ -9156,8 +9084,8 @@ msgid "The resulting traversal is different." msgstr "" msgid "" -"The left image shows the result with ascending order of ids and the right" -" image shows with descending order of the edge identifiers." +"The left image shows the result with ascending order of ids and the right " +"image shows with descending order of the edge identifiers." msgstr "" msgid "|ascending| |descending|" @@ -9170,8 +9098,8 @@ msgid "descending" msgstr "" msgid "" -"`Wikipedia: Breadth First Search algorithm `__" +"`Wikipedia: Breadth First Search algorithm `__" msgstr "" msgid "``pgr_bridges``" @@ -9182,8 +9110,8 @@ msgstr "" msgid "" "A bridge is an edge of an undirected graph whose deletion increases its " -"number of connected components. This implementation can only be used with" -" an undirected graph." +"number of connected components. This implementation can only be used with an " +"undirected graph." msgstr "" msgid "``edge`` ascending" @@ -9204,22 +9132,20 @@ msgstr "" msgid "Identifier of the edge that is a bridge." msgstr "" -#, python-format msgid "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" msgstr "" msgid "" -"`Boost: Connected components " -"`__" +"`Boost: Connected components `__" msgstr "" msgid "``pgr_chinesePostman`` - Experimental" msgstr "" msgid "" -"``pgr_chinesePostman`` — Calculates the shortest circuit path which " -"contains every edge in a directed graph and starts and ends on the same " -"vertex." +"``pgr_chinesePostman`` — Calculates the shortest circuit path which contains " +"every edge in a directed graph and starts and ends on the same vertex." msgstr "" msgid "Returns ``EMPTY SET`` on a disconnected graph" @@ -9238,8 +9164,8 @@ msgid "Sequential value starting from ``1``" msgstr "" msgid "" -"Identifier of the edge used to go from ``node`` to the next node in the " -"path sequence. ``-1`` for the last node of the path." +"Identifier of the edge used to go from ``node`` to the next node in the path " +"sequence. ``-1`` for the last node of the path." msgstr "" msgid "Aggregate cost from ``start_v`` to ``node``." @@ -9249,9 +9175,9 @@ msgid "``pgr_chinesePostmanCost`` - Experimental" msgstr "" msgid "" -"``pgr_chinesePostmanCost`` — Calculates the minimum costs of a circuit " -"path which contains every edge in a directed graph and starts and ends on" -" the same vertex." +"``pgr_chinesePostmanCost`` — Calculates the minimum costs of a circuit path " +"which contains every edge in a directed graph and starts and ends on the " +"same vertex." msgstr "" msgid "Return value when the graph if disconnected" @@ -9273,13 +9199,13 @@ msgid "``pgr_connectedComponents``" msgstr "" msgid "" -"``pgr_connectedComponents`` — Connected components of an undirected graph" -" using a DFS-based approach." +"``pgr_connectedComponents`` — Connected components of an undirected graph " +"using a DFS-based approach." msgstr "" msgid "" -"A connected component of an undirected graph is a set of vertices that " -"are all reachable from each other." +"A connected component of an undirected graph is a set of vertices that are " +"all reachable from each other." msgstr "" msgid "Components are described by vertices" @@ -9307,16 +9233,16 @@ msgid "Connecting disconnected components" msgstr "" msgid "" -"wikipedia: `Connected component " -"`__" +"wikipedia: `Connected component `__" msgstr "" msgid "``pgr_contraction``" msgstr "" msgid "" -"``pgr_contraction`` — Performs graph contraction and returns the " -"contracted vertices and edges." +"``pgr_contraction`` — Performs graph contraction and returns the contracted " +"vertices and edges." msgstr "" msgid "Name change from ``pgr_contractGraph``" @@ -9326,10 +9252,9 @@ msgid "Bug fixes" msgstr "" msgid "" -"Contraction reduces the size of the graph by removing some of the " -"vertices and edges and, for example, might add edges that represent a " -"sequence of original edges decreasing the total time and space used in " -"graph algorithms." +"Contraction reduces the size of the graph by removing some of the vertices " +"and edges and, for example, might add edges that represent a sequence of " +"original edges decreasing the total time and space used in graph algorithms." msgstr "" msgid "Does not return the full contracted graph." @@ -9472,18 +9397,17 @@ msgid "When ``type`` = **'v'**: :math:`-1`" msgstr "" msgid "" -"When ``type`` = **'e'**: Identifier of the source vertex of the current " -"edge (``source``, ``target``)." +"When ``type`` = **'e'**: Identifier of the source vertex of the current edge " +"(``source``, ``target``)." msgstr "" msgid "" -"When ``type`` = **'e'**: Identifier of the target vertex of the current " -"edge (``source``, ``target``)." +"When ``type`` = **'e'**: Identifier of the target vertex of the current edge " +"(``source``, ``target``)." msgstr "" msgid "" -"When ``type`` = **'e'**: Weight of the current edge (``source``, " -"``target``)." +"When ``type`` = **'e'**: Weight of the current edge (``source``, ``target``)." msgstr "" msgid "Only dead end contraction" @@ -9496,10 +9420,10 @@ msgid "The cycle" msgstr "" msgid "" -"Contracting a graph can be done with more than one operation. The order " -"of the operations affect the resulting contracted graph, after applying " -"one operation, the set of vertices that can be contracted by another " -"operation changes." +"Contracting a graph can be done with more than one operation. The order of " +"the operations affect the resulting contracted graph, after applying one " +"operation, the set of vertices that can be contracted by another operation " +"changes." msgstr "" msgid "This implementation cycles ``cycles`` times through the ``methods`` ." @@ -9532,8 +9456,8 @@ msgid "" msgstr "" msgid "" -"Observe that vertices, for example, :math:`6` do not appear in the " -"results because it was not affected by the contraction algorithm." +"Observe that vertices, for example, :math:`6` do not appear in the results " +"because it was not affected by the contraction algorithm." msgstr "" msgid "After doing the dead end contraction operation:" @@ -9549,8 +9473,8 @@ msgid "Add additional columns" msgstr "" msgid "" -"Adding extra columns to the edges and vertices tables. In this " -"documentation the following will be used:" +"Adding extra columns to the edges and vertices tables. In this documentation " +"the following will be used:" msgstr "" msgid "Column." @@ -9566,8 +9490,7 @@ msgid "On the vertex table" msgstr "" msgid "" -"when ``true`` the vertex is contracted, its not part of the contracted " -"graph." +"when ``true`` the vertex is contracted, its not part of the contracted graph." msgstr "" msgid "" @@ -9582,8 +9505,8 @@ msgid "On the edge table" msgstr "" msgid "" -"when ``true`` the edge was generated by the contraction algorithm. its " -"part of the contracted graph." +"when ``true`` the edge was generated by the contraction algorithm. its part " +"of the contracted graph." msgstr "" msgid "" @@ -9600,7 +9523,8 @@ msgstr "" msgid "Update the edges and vertices tables" msgstr "" -msgid "Use ``is_contracted`` column to indicate the vertices that are contracted." +msgid "" +"Use ``is_contracted`` column to indicate the vertices that are contracted." msgstr "" msgid "" @@ -9657,11 +9581,11 @@ msgid "Create the function that will use the contracted graph." msgstr "" msgid "" -"Case 2: Source and/or target belong to an edge that has contracted " -"vertices." +"Case 2: Source and/or target belong to an edge that has contracted vertices." msgstr "" -msgid "Case 3: Source and/or target belong to a vertex that has been contracted." +msgid "" +"Case 3: Source and/or target belong to a vertex that has been contracted." msgstr "" msgid "``pgr_contractionDeadEnd`` - Proposed" @@ -9687,7 +9611,8 @@ msgstr "" msgid "When there is only one adjacent vertex or" msgstr "" -msgid "When all edges are incoming regardless of the number of adjacent vertices." +msgid "" +"When all edges are incoming regardless of the number of adjacent vertices." msgstr "" msgid "pgr_contractionDeadEnd(`Edges SQL`_, [**options**])" @@ -9738,7 +9663,8 @@ msgstr "" msgid "The green nodes are dead end nodes" msgstr "" -msgid "The blue nodes have an unlimited number of incoming and/or outgoing edges." +msgid "" +"The blue nodes have an unlimited number of incoming and/or outgoing edges." msgstr "" msgid "Node" @@ -9756,7 +9682,6 @@ msgstr "" msgid ":math:`6`" msgstr "" -#, python-brace-format msgid ":math:`\\{1\\}`" msgstr "" @@ -9769,28 +9694,24 @@ msgstr "" msgid ":math:`7`" msgstr "" -#, python-brace-format msgid ":math:`\\{2\\}`" msgstr "" msgid ":math:`8`" msgstr "" -#, python-brace-format msgid ":math:`\\{2, 3\\}`" msgstr "" msgid "Has more than one adjacent node and all edges are incoming." msgstr "" -#, python-brace-format msgid ":math:`\\{4\\}`" msgstr "" msgid ":math:`10`" msgstr "" -#, python-brace-format msgid ":math:`\\{4, 5\\}`" msgstr "" @@ -9811,7 +9732,6 @@ msgid "" "outgoing." msgstr "" -#, python-brace-format msgid "" "From above, nodes :math:`\\{6, 7, 9\\}` are dead ends because the total " "number of adjacent vertices is one." @@ -9826,14 +9746,13 @@ msgid "Step by step dead end contraction" msgstr "" msgid "" -"The dead end contraction will stop until there are no more dead end " -"nodes. For example, from the following graph where :math:`3` is the dead " -"end node:" +"The dead end contraction will stop until there are no more dead end nodes. " +"For example, from the following graph where :math:`3` is the dead end node:" msgstr "" msgid "" -"After contracting :math:`3`, node :math:`2` is now a dead end node and is" -" contracted:" +"After contracting :math:`3`, node :math:`2` is now a dead end node and is " +"contracted:" msgstr "" msgid "" @@ -9894,8 +9813,8 @@ msgid "**contraction Order**" msgstr "" msgid "" -"Number of times the contraction operations on ``contraction_order`` will " -"be performed." +"Number of times the contraction operations on ``contraction_order`` will be " +"performed." msgstr "" msgid "A node connects two (or more) `linear` edges when" @@ -9935,7 +9854,6 @@ msgstr "" msgid "With cost: :math:`4`." msgstr "" -#, python-brace-format msgid "Contracted vertices in the edge: :math:`\\{2\\}`." msgstr "" @@ -9961,8 +9879,8 @@ msgid "Step by step linear contraction" msgstr "" msgid "" -"The linear contraction will stop when there are no more linear edges. For" -" example from the following graph there are linear edges" +"The linear contraction will stop when there are no more linear edges. For " +"example from the following graph there are linear edges" msgstr "" msgid "Contracting vertex :math:`3`," @@ -9972,13 +9890,12 @@ msgid "The vertex :math:`3` is removed from the graph" msgstr "" msgid "" -"The edges :math:`2 \\rightarrow 3` and :math:`w \\rightarrow z` are " -"removed from the graph." +"The edges :math:`2 \\rightarrow 3` and :math:`w \\rightarrow z` are removed " +"from the graph." msgstr "" msgid "" -"A new edge :math:`2 \\rightarrow 4` is inserted represented with red " -"color." +"A new edge :math:`2 \\rightarrow 4` is inserted represented with red color." msgstr "" msgid "Contracting vertex :math:`2`:" @@ -9988,18 +9905,17 @@ msgid "The vertex :math:`2` is removed from the graph" msgstr "" msgid "" -"The edges :math:`1 \\rightarrow 2` and :math:`2 \\rightarrow 3` are " -"removed from the graph." +"The edges :math:`1 \\rightarrow 2` and :math:`2 \\rightarrow 3` are removed " +"from the graph." msgstr "" msgid "" -"A new edge :math:`1 \\rightarrow 3` is inserted represented with red " -"color." +"A new edge :math:`1 \\rightarrow 3` is inserted represented with red color." msgstr "" msgid "" -"Edge :math:`1 \\rightarrow 3` has the information of cost and the nodes " -"that were contracted." +"Edge :math:`1 \\rightarrow 3` has the information of cost and the nodes that " +"were contracted." msgstr "" msgid "Create the contracted graph." @@ -10031,9 +9947,9 @@ msgid "The topology creation function accepts the following parameters:" msgstr "" msgid "" -"``text`` Condition to SELECT a subset or rows. Default value is ``true`` " -"to indicate all rows that where ``source`` or ``target`` have a null " -"value, otherwise the condition is used." +"``text`` Condition to SELECT a subset or rows. Default value is ``true`` to " +"indicate all rows that where ``source`` or ``target`` have a null value, " +"otherwise the condition is used." msgstr "" msgid "clean" @@ -10052,8 +9968,8 @@ msgid "The ``target`` column values will change." msgstr "" msgid "" -"An index will be created, if it doesn't exists, to speed up the process " -"to the following columns:" +"An index will be created, if it doesn't exists, to speed up the process to " +"the following columns:" msgstr "" msgid "``the_geom``" @@ -10069,21 +9985,21 @@ msgid "Fills ``id`` and ``the_geom`` columns of the vertices table." msgstr "" msgid "" -"Fills the source and target columns of the edge table referencing the " -"``id`` of the vertices table." +"Fills the source and target columns of the edge table referencing the ``id`` " +"of the vertices table." msgstr "" msgid "``FAIL`` when the network topology was not built due to an error:" msgstr "" msgid "" -"``integer`` Number of vertices in the edge_table that reference this " -"vertex AS incoming." +"``integer`` Number of vertices in the edge_table that reference this vertex " +"AS incoming." msgstr "" msgid "" -"``integer`` Number of vertices in the edge_table that reference this " -"vertex AS outgoing." +"``integer`` Number of vertices in the edge_table that reference this vertex " +"AS outgoing." msgstr "" msgid "The simplest way to use pgr_createTopology is:" @@ -10103,27 +10019,27 @@ msgid "" msgstr "" msgid "" -"Parameters defined with a default value can be omitted, as long as the " -"value matches the default And The order of the parameters would not " -"matter." +"Parameters defined with a default value can be omitted, as long as the value " +"matches the default And The order of the parameters would not matter." msgstr "" msgid "" -"Selecting the rows where the geometry is near the geometry of row with " -"``id = 5``." +"Selecting the rows where the geometry is near the geometry of row with ``id " +"= 5``." msgstr "" -msgid "The arguments need to be given in the order described in the parameters." +msgid "" +"The arguments need to be given in the order described in the parameters." msgstr "" msgid "" -"Note that this example uses clean flag. So it recreates the whole " -"vertices table." +"Note that this example uses clean flag. So it recreates the whole vertices " +"table." msgstr "" msgid "" -"An error would occur when the arguments are not given in the appropiriate" -" order: In this example, the column ``gid`` of the table ``mytable`` is " +"An error would occur when the arguments are not given in the appropiriate " +"order: In this example, the column ``gid`` of the table ``mytable`` is " "passed to the function AS the geometry column, and the geometry column " "``mygeom`` is passed to the function AS the id column." msgstr "" @@ -10141,8 +10057,8 @@ msgid "Create a routing topology" msgstr "" msgid "" -"An alternate method to create a routing topology use " -":doc:`pgr_extractVertices`" +"An alternate method to create a routing topology use :doc:" +"`pgr_extractVertices`" msgstr "" msgid "Make sure the database does not have the ``vertices_table``" @@ -10152,8 +10068,7 @@ msgid "Clean up the columns of the routing topology to be created" msgstr "" msgid "" -"When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, " -")``" +"When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, )``" msgstr "" msgid "For big edge tables that are been prepared," @@ -10187,16 +10102,16 @@ msgid "With full output" msgstr "" msgid "" -"This example start a clean topology, with 5 edges, and then its " -"incremented to the rest of the edges." +"This example start a clean topology, with 5 edges, and then its incremented " +"to the rest of the edges." msgstr "" msgid "``pgr_createVerticesTable`` - Deprecated since 3.8.0" msgstr "" msgid "" -"``pgr_createVerticesTable`` — Reconstructs the vertices table based on " -"the source and target information." +"``pgr_createVerticesTable`` — Reconstructs the vertices table based on the " +"source and target information." msgstr "" msgid "``OK`` after the vertices table has been reconstructed." @@ -10216,8 +10131,8 @@ msgid "" msgstr "" msgid "" -"``text`` Condition to SELECT a subset or rows. Default value is ``true`` " -"to indicate all rows." +"``text`` Condition to SELECT a subset or rows. Default value is ``true`` to " +"indicate all rows." msgstr "" msgid "" @@ -10235,8 +10150,7 @@ msgid "" "An error would occur when the arguments are not given in the appropriate " "order: In this example, the column source column ``source`` of the table " "``mytable`` is passed to the function as the geometry column, and the " -"geometry column ``the_geom`` is passed to the function as the source " -"column." +"geometry column ``the_geom`` is passed to the function as the source column." msgstr "" msgid "Example 4" @@ -10322,30 +10236,31 @@ msgid "``pgr_cuthillMckeeOrdering`` - Experimental" msgstr "" msgid "" -"``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering" -" of an undirected graphs" +"``pgr_cuthillMckeeOrdering`` — Returns the reverse Cuthill-Mckee ordering of " +"an undirected graphs" msgstr "" msgid "Version 3.4.0" msgstr "" msgid "" -"In numerical linear algebra, the Cuthill-McKee algorithm (CM), named " -"after Elizabeth Cuthill and James McKee, is an algorithm to permute a " -"sparse matrix that has a symmetric sparsity pattern into a band matrix " -"form with a small bandwidth." +"In numerical linear algebra, the Cuthill-McKee algorithm (CM), named after " +"Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse " +"matrix that has a symmetric sparsity pattern into a band matrix form with a " +"small bandwidth." msgstr "" msgid "" "The vertices are basically assigned a breadth-first search order, except " -"that at each step, the adjacent vertices are placed in the queue in order" -" of increasing degree." +"that at each step, the adjacent vertices are placed in the queue in order of " +"increasing degree." msgstr "" msgid "The implementation is for **undirected** graphs." msgstr "" -msgid "The bandwidth minimization problems are considered NP-complete problems." +msgid "" +"The bandwidth minimization problems are considered NP-complete problems." msgstr "" msgid "The running time complexity is: :math:`O(m log(m)|V|)`" @@ -10376,22 +10291,21 @@ msgid "New ordering in reverse order." msgstr "" msgid "" -"`Boost: Cuthill-McKee Ordering " -"`__" +"`Boost: Cuthill-McKee Ordering `__" msgstr "" -#, python-format msgid "" -"`Wikipedia: Cuthill-McKee Ordering " -"`__" +"`Wikipedia: Cuthill-McKee Ordering `__" msgstr "" msgid "``pgr_dagShortestPath`` - Experimental" msgstr "" msgid "" -"``pgr_dagShortestPath`` — Returns the shortest path for weighted directed" -" acyclic graphs(DAG). In particular, the DAG shortest paths algorithm " +"``pgr_dagShortestPath`` — Returns the shortest path for weighted directed " +"acyclic graphs(DAG). In particular, the DAG shortest paths algorithm " "implemented by Boost.Graph." msgstr "" @@ -10399,10 +10313,10 @@ msgid "pgr_dagShortestPath(Combinations)" msgstr "" msgid "" -"Shortest Path for Directed Acyclic Graph(DAG) is a graph search algorithm" -" that solves the shortest path problem for weighted directed acyclic " -"graph, producing a shortest path from a starting vertex (``start_vid``) " -"to an ending vertex (``end_vid``)." +"Shortest Path for Directed Acyclic Graph(DAG) is a graph search algorithm " +"that solves the shortest path problem for weighted directed acyclic graph, " +"producing a shortest path from a starting vertex (``start_vid``) to an " +"ending vertex (``end_vid``)." msgstr "" msgid "" @@ -10412,8 +10326,8 @@ msgstr "" msgid "" "The algorithm relies on topological sorting the dag to impose a linear " -"ordering on the vertices, and thus is more efficient for DAG's than " -"either the Dijkstra or Bellman-Ford algorithm." +"ordering on the vertices, and thus is more efficient for DAG's than either " +"the Dijkstra or Bellman-Ford algorithm." msgstr "" msgid "" @@ -10448,15 +10362,12 @@ msgstr "" msgid "From vertex :math:`5` to vertex :math:`11` on a **directed** graph" msgstr "" -#, python-brace-format msgid "From vertex :math:`5` to vertices :math:`\\{7, 11\\}`" msgstr "" -#, python-brace-format msgid "From vertices :math:`\\{5, 10\\}` to vertex :math:`11`" msgstr "" -#, python-brace-format msgid "" "From vertices :math:`\\{5, 15\\}` to vertices :math:`\\{11, 17\\}` on an " "**undirected** graph" @@ -10469,8 +10380,8 @@ msgid "Making **start_vids** the same as **end_vids**" msgstr "" msgid "" -"`Boost: DAG shortest paths " -"`__" +"`Boost: DAG shortest paths `__" msgstr "" msgid "https://en.wikipedia.org/wiki/Topological_sorting" @@ -10480,16 +10391,16 @@ msgid "``pgr_degree``" msgstr "" msgid "" -"``pgr_degree`` — For each vertex in an undirected graph, return the count" -" of edges incident to the vertex." +"``pgr_degree`` — For each vertex in an undirected graph, return the count of " +"edges incident to the vertex." msgstr "" msgid "Calculates the degree of the vertices of an undirected graph" msgstr "" msgid "" -"The degree (or valency) of a vertex of a graph is the number of edges " -"that are incident to the vertex." +"The degree (or valency) of a vertex of a graph is the number of edges that " +"are incident to the vertex." msgstr "" msgid "A loop contributes 2 to a vertex's degree." @@ -10502,13 +10413,12 @@ msgid "Isolated vertex is not part of the result" msgstr "" msgid "" -"Vertex not participating on the subgraph is considered and isolated " -"vertex." +"Vertex not participating on the subgraph is considered and isolated vertex." msgstr "" msgid "" -"There can be a ``dryrun`` execution and the code used to get the answer " -"will be shown in a PostgreSQL ``NOTICE``." +"There can be a ``dryrun`` execution and the code used to get the answer will " +"be shown in a PostgreSQL ``NOTICE``." msgstr "" msgid "" @@ -10547,9 +10457,8 @@ msgid "``pgr_degree`` can use :doc:`pgr_extractVertices` embedded in the call." msgstr "" msgid "" -"For decent size networks, it is best to prepare your vertices table " -"before hand and use it on ``pgr_degree`` calls. (See `Using a vertex " -"table`_)" +"For decent size networks, it is best to prepare your vertices table before " +"hand and use it on ``pgr_degree`` calls. (See `Using a vertex table`_)" msgstr "" msgid "Calculate the degree of the nodes:" @@ -10580,8 +10489,8 @@ msgid "``in_edges``" msgstr "" msgid "" -"Array of identifiers of the edges that have the vertex ``id`` as *first " -"end point*." +"Array of identifiers of the edges that have the vertex ``id`` as *first end " +"point*." msgstr "" msgid "When missing, ``out_edges`` must exist." @@ -10591,8 +10500,8 @@ msgid "``out_edges``" msgstr "" msgid "" -"Array of identifiers of the edges that have the vertex ``id`` as *second " -"end point*." +"Array of identifiers of the edges that have the vertex ``id`` as *second end " +"point*." msgstr "" msgid "When missing, ``in_edges`` must exist." @@ -10622,11 +10531,9 @@ msgstr "" msgid "For the following is a subgraph of the :doc:`sampledata`:" msgstr "" -#, python-brace-format msgid ":math:`E = \\{(1, 5 \\leftrightarrow 6), (1, 6 \\leftrightarrow 10)\\}`" msgstr "" -#, python-brace-format msgid ":math:`V = \\{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17\\}`" msgstr "" @@ -10643,8 +10550,8 @@ msgid "Using a vertex table" msgstr "" msgid "" -"For decent size networks, it is best to prepare your vertices table " -"before hand and use it on ``pgr_degree`` calls." +"For decent size networks, it is best to prepare your vertices table before " +"hand and use it on ``pgr_degree`` calls." msgstr "" msgid "Extract the vertex information and save into a table:" @@ -10654,8 +10561,8 @@ msgid "Dry run execution" msgstr "" msgid "" -"To get the query generated used to get the vertex information, use " -"``dryrun => true``." +"To get the query generated used to get the vertex information, use ``dryrun " +"=> true``." msgstr "" msgid "" @@ -10667,10 +10574,10 @@ msgid "Finding dead ends" msgstr "" msgid "" -"If there is a vertices table already built using ``pgr_extractVertices`` " -"and want the degree of the whole graph rather than a subset, it can be " -"forgo using ``pgr_degree`` and work with the ``in_edges`` and " -"``out_edges`` columns directly." +"If there is a vertices table already built using ``pgr_extractVertices`` and " +"want the degree of the whole graph rather than a subset, it can be forgo " +"using ``pgr_degree`` and work with the ``in_edges`` and ``out_edges`` " +"columns directly." msgstr "" msgid "The degree of a dead end is 1." @@ -10683,8 +10590,7 @@ msgid "The degree of a linear vertex is 2." msgstr "" msgid "" -"If there is a vertices table already built using the " -"``pgr_extractVertices``" +"If there is a vertices table already built using the ``pgr_extractVertices``" msgstr "" msgid ":doc:`pgr_extractVertices`" @@ -10702,24 +10608,25 @@ msgid "Version 3.3.0" msgstr "" msgid "" -"Depth First Search algorithm is a traversal algorithm which starts from a" -" root vertex, goes as deep as possible, and backtracks once a vertex is " -"reached with no adjacent vertices or with all visited adjacent vertices. " -"The traversal continues until all the vertices reachable from the root " -"vertex are visited." +"Depth First Search algorithm is a traversal algorithm which starts from a " +"root vertex, goes as deep as possible, and backtracks once a vertex is " +"reached with no adjacent vertices or with all visited adjacent vertices. The " +"traversal continues until all the vertices reachable from the root vertex " +"are visited." msgstr "" -msgid "The implementation works for both **directed** and **undirected** graphs." +msgid "" +"The implementation works for both **directed** and **undirected** graphs." msgstr "" msgid "" -"Provides the Depth First Search traversal order from a root vertex or " -"from a set of root vertices." +"Provides the Depth First Search traversal order from a root vertex or from a " +"set of root vertices." msgstr "" msgid "" -"An optional non-negative maximum depth parameter to limit the results up " -"to a particular depth." +"An optional non-negative maximum depth parameter to limit the results up to " +"a particular depth." msgstr "" msgid "" @@ -10728,8 +10635,7 @@ msgid "" msgstr "" msgid "" -"It does not produce the shortest path from a root vertex to a target " -"vertex." +"It does not produce the shortest path from a root vertex to a target vertex." msgstr "" msgid "The aggregate cost of traversal is not guaranteed to be minimal." @@ -10754,18 +10660,18 @@ msgid "Same as `Single vertex`_ but with edges in descending order of ``id``." msgstr "" msgid "" -"`Boost: Depth First Search " -"`__" +"`Boost: Depth First Search `__" msgstr "" msgid "" -"`Boost: Undirected DFS " -"`__" +"`Boost: Undirected DFS `__" msgstr "" msgid "" -"`Wikipedia: Depth First Search algorithm `__" +"`Wikipedia: Depth First Search algorithm `__" msgstr "" msgid "``pgr_dijkstra``" @@ -10823,15 +10729,16 @@ msgid "Breaking change on 3.5.0" msgstr "" msgid "" -"Read the :doc:`migration` about how to migrate from the old result " -"columns to the new result columns." +"Read the :doc:`migration` about how to migrate from the old result columns " +"to the new result columns." msgstr "" -#, python-brace-format -msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**" +msgid "" +"From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**" msgstr "" -msgid "The examples of this section are based on the :doc:`sampledata` network." +msgid "" +"The examples of this section are based on the :doc:`sampledata` network." msgstr "" msgid "For **directed** graphs with ``cost`` and ``reverse_cost`` columns" @@ -10855,31 +10762,26 @@ msgstr "" msgid "5) Using `One to Many`_ to get the solution of examples 1 and 2" msgstr "" -#, python-brace-format msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}`" msgstr "" msgid "6) Using `Many to One`_ to get the solution of examples 2 and 4" msgstr "" -#, python-brace-format msgid "Paths :math:`\\{6, 12\\}\\rightarrow\\{7\\}`" msgstr "" msgid "7) Using `Many to Many`_ to get the solution of examples 1 to 4" msgstr "" -#, python-brace-format msgid "Paths :math:`\\{6, 12\\}\\rightarrow\\{10, 7\\}`" msgstr "" msgid "8) Using `Combinations`_ to get the solution of examples 1 to 3" msgstr "" -#, python-brace-format msgid "" -"Paths :math:`\\{6\\}\\rightarrow\\{10, " -"7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" +"Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`" msgstr "" msgid "For **undirected** graphs with ``cost`` and ``reverse_cost`` columns" @@ -10975,10 +10877,8 @@ msgstr "" msgid "Equvalences between signatures" msgstr "" -#, python-brace-format msgid "" -"The following examples find the path for " -":math:`\\{6\\}\\rightarrow\\{10\\}`" +"The following examples find the path for :math:`\\{6\\}\\rightarrow\\{10\\}`" msgstr "" msgid "33) Using `One to One`_" @@ -10996,15 +10896,11 @@ msgstr "" msgid "37) Using `Combinations`_" msgstr "" -msgid "e Also" -msgstr "" - msgid "" -"`Boost: Dijkstra shortest paths " -"`__" +"`Boost: Dijkstra shortest paths `__" msgstr "" -#, python-format msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgstr "" @@ -11020,26 +10916,24 @@ msgid "pgr_dijkstraCost(Combinations)" msgstr "" msgid "" -"The ``pgr_dijkstraCost`` function sumarizes of the cost of the shortest " +"The ``pgr_dijkstraCost`` function summarizes of the cost of the shortest " "path using Dijkstra Algorithm." msgstr "" -msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "" +"pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, " -"[``directed``])" +"pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vid**, " -"[``directed``])" +"pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" msgid "" -"pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" +"pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" msgid "pgr_dijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])" @@ -11049,8 +10943,8 @@ msgid "``pgr_dijkstraCostMatrix``" msgstr "" msgid "" -"``pgr_dijkstraCostMatrix`` - Calculates a cost matrix using " -":doc:`pgr_dijkstra`." +"``pgr_dijkstraCostMatrix`` - Calculates a cost matrix using :doc:" +"`pgr_dijkstra`." msgstr "" msgid "Using Dijkstra algorithm, calculate and return a cost matrix." @@ -11068,9 +10962,9 @@ msgid "" msgstr "" msgid "" -"Given a graph, a starting vertex and a set of ending vertices, this " -"function finds the shortest path from the starting vertex to the nearest " -"ending vertex." +"Given a graph, a starting vertex and a set of ending vertices, this function " +"finds the shortest path from the starting vertex to the nearest ending " +"vertex." msgstr "" msgid "Uses Dijkstra algorithm." @@ -11119,18 +11013,15 @@ msgid "Combinations: :math:`drt * |Starting vids|`" msgstr "" msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options " -"A**])" +"pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])" msgstr "" msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options " -"A**])" +"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])" msgstr "" msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options " -"B**])" +"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])" msgstr "" msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options B**])" @@ -11142,7 +11033,8 @@ msgstr "" msgid "**options B:** ``[directed, cap, global]``" msgstr "" -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" +msgid "" +"pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])" msgstr "" msgid "**options:** ``[directed, cap]``" @@ -11154,8 +11046,8 @@ msgstr "" msgid "Using a **directed** graph for car routing." msgstr "" -#, python-brace-format -msgid "The subway stations are on the following vertices :math:`\\{1, 10, 11\\}`" +msgid "" +"The subway stations are on the following vertices :math:`\\{1, 10, 11\\}`" msgstr "" msgid "The defaults used:" @@ -11170,12 +11062,13 @@ msgstr "" msgid "The result shows that station at vertex :math:`11` is the nearest." msgstr "" -msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" +msgid "" +"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])" msgstr "" msgid "" -"Departing on a car from a subway station find the nearest **two** " -"stations to vertex :math:`2`" +"Departing on a car from a subway station find the nearest **two** stations " +"to vertex :math:`2`" msgstr "" msgid "On line `4`: using the positional parameter: `directed` set to ``true``" @@ -11185,13 +11078,12 @@ msgid "In line `5`: using named parameter `cap => 2`" msgstr "" msgid "" -"The result shows that station at vertex :math:`10` is the nearest and the" -" next best is :math:`11`." +"The result shows that station at vertex :math:`10` is the nearest and the " +"next best is :math:`11`." msgstr "" msgid "" -"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, " -"[**options**])" +"pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])" msgstr "" msgid "**options:** ``[directed, cap, global]``" @@ -11200,14 +11092,12 @@ msgstr "" msgid "Find the best pedestrian connection between two lines of buses" msgstr "" -msgid "Unsing an **undirected** graph for pedestrian routing" +msgid "Using an **undirected** graph for pedestrian routing" msgstr "" -#, python-brace-format msgid "The first subway line stations are at :math:`\\{15, 16\\}`" msgstr "" -#, python-brace-format msgid "The second subway line stations stops are at :math:`\\{1, 10, 11\\}`" msgstr "" @@ -11218,27 +11108,25 @@ msgid "`global => true`" msgstr "" msgid "" -"For a pedestrian the best connection is to get on/off is at vertex " -":math:`15` of the first subway line and at vertex :math:`10` of the " -"second subway line." +"For a pedestrian the best connection is to get on/off is at vertex :math:" +"`15` of the first subway line and at vertex :math:`10` of the second subway " +"line." msgstr "" msgid "" -"Only `one` route is returned because `global` is ``true`` and `cap` is " -"``1``" +"Only `one` route is returned because `global` is ``true`` and `cap` is ``1``" msgstr "" msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" -msgid "Find the best car connection between all the stations of two subway lines" +msgid "" +"Find the best car connection between all the stations of two subway lines" msgstr "" -#, python-brace-format msgid "The first subway line stations stops are at :math:`\\{1, 10, 11\\}`" msgstr "" -#, python-brace-format msgid "The second subway line stations are at :math:`\\{15, 16\\}`" msgstr "" @@ -11246,13 +11134,13 @@ msgid "The combinations contents:" msgstr "" msgid "" -"lines `3~4` sets the start vertices to be from the first subway line and " -"the ending vertices to be from the second subway line" +"lines `3~4` sets the start vertices to be from the first subway line and the " +"ending vertices to be from the second subway line" msgstr "" msgid "" -"lines `6~7` sets the start vertices to be from the first subway line and " -"the ending vertices to be from the first subway line" +"lines `6~7` sets the start vertices to be from the first subway line and the " +"ending vertices to be from the first subway line" msgstr "" msgid "On line `8`: using the named parameter is `global => false`" @@ -11261,16 +11149,14 @@ msgstr "" msgid "From the results:" msgstr "" -#, python-brace-format msgid "" -"making a connection from the first subway line :math:`\\{1, 10, 11\\}` to" -" the second :math:`\\{15, 16\\}`:" +"making a connection from the first subway line :math:`\\{1, 10, 11\\}` to " +"the second :math:`\\{15, 16\\}`:" msgstr "" -#, python-brace-format msgid "" -"The best connections from all the stations from the first line are: " -":math:`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" +"The best connections from all the stations from the first line are: :math:" +"`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`" msgstr "" msgid "" @@ -11278,21 +11164,19 @@ msgid "" "(lines: `11` and `12`)" msgstr "" -#, python-brace-format msgid "" -"making a connection from the second subway line :math:`\\{15, 16\\}` to " -"the first :math:`\\{1, 10, 11\\}`:" +"making a connection from the second subway line :math:`\\{15, 16\\}` to the " +"first :math:`\\{1, 10, 11\\}`:" msgstr "" -#, python-brace-format msgid "" -"The best connections from all the stations from the second line are: " -":math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" +"The best connections from all the stations from the second line are: :math:" +"`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" msgstr "" msgid "" -"Both are equaly good as they have the same cost. (lines: `13` and `14` " -"and lines: `15` and `16`)" +"Both are equally good as they have the same cost. (lines: `13` and `14` and " +"lines: `15` and `16`)" msgstr "" msgid "Dijkstra optional parameters" @@ -11316,7 +11200,6 @@ msgstr "" msgid "When ``false``: ``cap`` limit per ``Start vid`` will be returned" msgstr "" -#, python-format msgid "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgstr "" @@ -11324,26 +11207,27 @@ msgid "``pgr_dijkstraNearCost`` - Proposed" msgstr "" msgid "" -"``pgr_dijkstraNearCost`` — Using dijkstra algorithm, finds the route that" -" leads to the nearest vertex." +"``pgr_dijkstraNearCost`` — Using dijkstra algorithm, finds the route that " +"leads to the nearest vertex." msgstr "" msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, " -"[**options A**])" +"pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options " +"A**])" msgstr "" msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, " -"[**options A**])" +"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options " +"A**])" msgstr "" msgid "" -"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, " -"[**options B**])" +"pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options " +"B**])" msgstr "" -msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" +msgid "" +"pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])" msgstr "" msgid "" @@ -11357,8 +11241,8 @@ msgid "" msgstr "" msgid "" -"Departing on a car from a subway station find the nearest **two** " -"stations to vertex :math:`6`" +"Departing on a car from a subway station find the nearest **two** stations " +"to vertex :math:`6`" msgstr "" msgid "" @@ -11369,17 +11253,13 @@ msgstr "" msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" -msgid "" -"lines `3~4` sets the start vertices to be from the fisrt subway line and " -"the ending vertices to be from the second subway line" -msgstr "" - msgid "" "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` " "(lines: `1`)" msgstr "" -msgid "Both are equaly good as they have the same cost. (lines: `12` and `13`)" +msgid "" +"Both are equally good as they have the same cost. (lines: `12` and `13`)" msgstr "" msgid "``pgr_dijkstraVia`` - Proposed" @@ -11388,11 +11268,10 @@ msgstr "" msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices." msgstr "" -#, python-brace-format msgid "" -"Given a list of vertices and a graph, this function is equivalent to " -"finding the shortest path between :math:`vertex_i` and " -":math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)`." +"Given a list of vertices and a graph, this function is equivalent to finding " +"the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :" +"math:`i < size\\_of(via\\;vertices)`." msgstr "" msgid "Route" @@ -11419,10 +11298,9 @@ msgstr "" msgid "Returns set of |via-result|" msgstr "" -#, python-brace-format msgid "" -"Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that " -"order on an directed graph." +"Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order " +"on an directed graph." msgstr "" msgid "Via optional parameters" @@ -11444,14 +11322,13 @@ msgid "``route_agg_cost``" msgstr "" msgid "" -"Total cost from ``start_vid`` of ``seq = 1`` to ``end_vid`` of the " -"current ``seq``." +"Total cost from ``start_vid`` of ``seq = 1`` to ``end_vid`` of the current " +"``seq``." msgstr "" -#, python-brace-format msgid "" -"All this examples are about the route that visits the vertices " -":math:`\\{5, 7, 1, 8, 15\\}` in that order on a **directed** graph." +"All this examples are about the route that visits the vertices :math:`\\{5, " +"7, 1, 8, 15\\}` in that order on a **directed** graph." msgstr "" msgid "The main query" @@ -11481,10 +11358,11 @@ msgstr "" msgid "``pgr_drivingDistance``" msgstr "" -msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." +msgid "" +"``pgr_drivingDistance`` - Returns the driving distance from a start node." msgstr "" -msgid "Standarizing output columns to |result-spantree|" +msgid "Standardizing output columns to |result-spantree|" msgstr "" msgid "Added ``depth`` and ``start_vid`` result columns." @@ -11509,19 +11387,17 @@ msgid "pgr_drivingDistance(multiple vertices)" msgstr "" msgid "" -"Using the Dijkstra algorithm, extracts all the nodes that have costs less" -" than or equal to the value ``distance``. The edges extracted will " -"conform to the corresponding spaning tree." +"Using the Dijkstra algorithm, extracts all the nodes that have costs less " +"than or equal to the value ``distance``. The edges extracted will conform to " +"the corresponding spanning tree." msgstr "" msgid "" -"pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, " -"[``directed``])" +"pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" msgstr "" msgid "" -"pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, " -"[**options**])" +"pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])" msgstr "" msgid "**options:** [directed, equicost]" @@ -11536,10 +11412,9 @@ msgstr "" msgid "Multiple Vertices" msgstr "" -#, python-brace-format msgid "" -"From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` with " -"equi-cost on a directed graph" +"From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` with equi-" +"cost on a directed graph" msgstr "" msgid "Driving distance optional parameters" @@ -11549,8 +11424,8 @@ msgid "``equicost``" msgstr "" msgid "" -"When ``true`` the node will only appear in the closest ``start_vid`` " -"list. Tie brakes are arbitrary." +"When ``true`` the node will only appear in the closest ``start_vid`` list. " +"Tie brakes are arbitrary." msgstr "" msgid "" @@ -11558,7 +11433,6 @@ msgid "" "signature." msgstr "" -#, python-brace-format msgid "" "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` on an " "undirected graph" @@ -11568,8 +11442,8 @@ msgid "``pgr_edgeColoring`` - Experimental" msgstr "" msgid "" -"``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-" -"free graphs" +"``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free " +"graphs" msgstr "" msgid "" @@ -11587,23 +11461,24 @@ msgstr "" msgid "no self-loops and no parallel edges." msgstr "" -msgid "Provides the color to be assigned to all the edges present in the graph." +msgid "" +"Provides the color to be assigned to all the edges present in the graph." msgstr "" msgid "" -"At most :math:`\\Delta + 1` colors are used, where :math:`\\Delta` is the" -" degree of the graph." +"At most :math:`\\Delta + 1` colors are used, where :math:`\\Delta` is the " +"degree of the graph." msgstr "" msgid "" -"This is optimal for some graphs, and by Vizing's theorem it uses at most " -"one color more than the optimal for all others." +"This is optimal for some graphs, and by Vizing's theorem it uses at most one " +"color more than the optimal for all others." msgstr "" msgid "" "the chromatic number :math:`x'(G)` (minimum number of colors needed for " -"proper edge coloring of graph) is equal to the degree :math:`\\Delta + 1`" -" of the graph, (:math:`x'(G) = \\Delta`)" +"proper edge coloring of graph) is equal to the degree :math:`\\Delta + 1` of " +"the graph, (:math:`x'(G) = \\Delta`)" msgstr "" msgid "The algorithm tries to assign the least possible color to every edge." @@ -11612,7 +11487,8 @@ msgstr "" msgid "Does not always produce optimal coloring." msgstr "" -msgid "The returned rows are ordered in ascending order of the edge identifier." +msgid "" +"The returned rows are ordered in ascending order of the edge identifier." msgstr "" msgid "Efficient graph coloring is an NP-Hard problem, and therefore:" @@ -11637,13 +11513,12 @@ msgid "Graph coloring of pgRouting :doc:`sampledata`" msgstr "" msgid "" -"`Boost: Edge Coloring " -"`__" +"`Boost: Edge Coloring `__" msgstr "" msgid "" -"`Wikipedia: Graph coloring " -"`__" +"`Wikipedia: Graph coloring `__" msgstr "" msgid "``pgr_edgeDisjointPaths``" @@ -11658,8 +11533,8 @@ msgid "pgr_edgeDisjointPaths(Combinations)" msgstr "" msgid "" -"Calculates the edge disjoint paths between two groups of vertices. " -"Utilizes underlying maximum flow algorithms to calculate the paths." +"Calculates the edge disjoint paths between two groups of vertices. Utilizes " +"underlying maximum flow algorithms to calculate the paths." msgstr "" msgid "The main characterics are:" @@ -11699,7 +11574,8 @@ msgid "" "[``directed``])" msgstr "" -msgid "pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" +msgid "" +"pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])" msgstr "" msgid "Returns set of |result-disjoint|" @@ -11717,11 +11593,10 @@ msgstr "" msgid "Returns set of |result-disjoint-m-m|" msgstr "" -#, python-brace-format msgid "" -"Using a combinations table, equivalent to calculating result from " -"vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}` on an " -"undirected graph." +"Using a combinations table, equivalent to calculating result from vertices :" +"math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}` on an undirected " +"graph." msgstr "" msgid "Manually assigned vertex combinations on an undirected graph." @@ -11731,9 +11606,8 @@ msgid "``pgr_edmondsKarp``" msgstr "" msgid "" -"``pgr_edmondsKarp`` — Calculates the flow on the graph edges that " -"maximizes the flow from the sources to the targets using Edmonds Karp " -"Algorithm." +"``pgr_edmondsKarp`` — Calculates the flow on the graph edges that maximizes " +"the flow from the sources to the targets using Edmonds Karp Algorithm." msgstr "" msgid "pgr_edmondsKarp(Combinations)" @@ -11761,11 +11635,10 @@ msgid "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" msgstr "" msgid "" -"`Boost: edmonds_karp_max_flow " -"`__" +"`Boost: Edmonds Karp max flow `__" msgstr "" -#, python-format msgid "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" msgstr "" @@ -11773,27 +11646,25 @@ msgid "``pgr_edwardMoore`` - Experimental" msgstr "" msgid "" -"``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore " -"algorithm." +"``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore algorithm." msgstr "" msgid "pgr_edwardMoore(Combinations)" msgstr "" msgid "" -"Edward Moore’s Algorithm is an improvement of the Bellman-Ford Algorithm." -" It can compute the shortest paths from a single source vertex to all " -"other vertices in a weighted directed graph. The main difference between " -"Edward Moore's Algorithm and Bellman Ford's Algorithm lies in the run " -"time." +"Edward Moore’s Algorithm is an improvement of the Bellman-Ford Algorithm. It " +"can compute the shortest paths from a single source vertex to all other " +"vertices in a weighted directed graph. The main difference between Edward " +"Moore's Algorithm and Bellman Ford's Algorithm lies in the run time." msgstr "" msgid "" "The worst-case running time of the algorithm is :math:`O(| V | * | E |)` " "similar to the time complexity of Bellman-Ford algorithm. However, " "experiments suggest that this algorithm has an average running time " -"complexity of :math:`O( | E | )` for random graphs. This is significantly" -" faster in terms of computation speed." +"complexity of :math:`O( | E | )` for random graphs. This is significantly " +"faster in terms of computation speed." msgstr "" msgid "" @@ -11805,8 +11676,8 @@ msgid "The `agg_cost` the non included values `(v, v)` is :math:`0`" msgstr "" msgid "" -"For optimization purposes, any duplicated value in the `start vids` or " -"`end vids` are ignored." +"For optimization purposes, any duplicated value in the `start vids` or `end " +"vids` are ignored." msgstr "" msgid "Running time:" @@ -11818,18 +11689,20 @@ msgstr "" msgid "Average case: :math:`O( | E | )`" msgstr "" -msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" +msgid "" +"pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" msgstr "" -msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" +msgid "" +"pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])" msgstr "" -msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" +msgid "" +"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])" msgstr "" msgid "" -"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, " -"[``directed``])" +"pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])" msgstr "" msgid "pgr_edwardMoore(`Edges SQL`_, `Combinations SQL`_, [``directed``])" @@ -11845,13 +11718,13 @@ msgid "``pgr_extractVertices`` — Extracts the vertices information" msgstr "" msgid "" -"This is an auxiliary function for extracting the vertex information of " -"the set of edges of a graph." +"This is an auxiliary function for extracting the vertex information of the " +"set of edges of a graph." msgstr "" msgid "" -"When the edge identifier is given, then it will also calculate the in and" -" out edges" +"When the edge identifier is given, then it will also calculate the in and " +"out edges" msgstr "" msgid "pgr_extractVertices(`Edges SQL`_, [``dryrun``])" @@ -11876,8 +11749,8 @@ msgid "Geometry of the edge." msgstr "" msgid "" -"This inner query takes precedence over the next two inner query, " -"therefore other columns are ignored when ``geom`` column appears." +"This inner query takes precedence over the next two inner query, therefore " +"other columns are ignored when ``geom`` column appears." msgstr "" msgid "Ignored columns:" @@ -11893,8 +11766,8 @@ msgid "When vertex geometry is known" msgstr "" msgid "" -"To use this inner query the column ``geom`` should not be part of the set" -" of columns." +"To use this inner query the column ``geom`` should not be part of the set of " +"columns." msgstr "" msgid "``POINT``" @@ -11907,9 +11780,8 @@ msgid "POINT geometry of the ending vertex." msgstr "" msgid "" -"This inner query takes precedence over the next inner query, therefore " -"other columns are ignored when ``startpoint`` and ``endpoint`` columns " -"appears." +"This inner query takes precedence over the next inner query, therefore other " +"columns are ignored when ``startpoint`` and ``endpoint`` columns appears." msgstr "" msgid "When identifiers of vertices are known" @@ -11933,8 +11805,8 @@ msgid "Geometry of the point" msgstr "" msgid "" -"To get the query generated used to get the vertex information, use " -"``dryrun := true``." +"To get the query generated used to get the vertex information, use ``dryrun :" +"= true``." msgstr "" msgid "``pgr_findCloseEdges``" @@ -11944,11 +11816,12 @@ msgid "``pgr_findCloseEdges`` - Finds the close edges to a point geometry." msgstr "" msgid "" -"``pgr_findCloseEdges`` - An utility function that finds the closest edge " -"to a point geometry." +"``pgr_findCloseEdges`` - An utility function that finds the closest edge to " +"a point geometry." msgstr "" -msgid "The geometries must be in the same coordinate system (have the same SRID)." +msgid "" +"The geometries must be in the same coordinate system (have the same SRID)." msgstr "" msgid "" @@ -11959,10 +11832,12 @@ msgstr "" msgid "``EMPTY SET`` is returned on dryrun executions" msgstr "" -msgid "pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" +msgid "" +"pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])" msgstr "" -msgid "pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" +msgid "" +"pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])" msgstr "" msgid "**options:** ``[cap, dryrun]``" @@ -12025,8 +11900,8 @@ msgid "When :math:`cap = 1`, it is the closest edge." msgstr "" msgid "" -"Value in <0,1> that indicates the relative position from the first end-" -"point of the edge." +"Value in <0,1> that indicates the relative position from the first end-point " +"of the edge." msgstr "" msgid "Value in ``[r, l]`` indicating if the point is:" @@ -12051,8 +11926,8 @@ msgid "Original ``POINT`` geometry." msgstr "" msgid "" -"``LINESTRING`` geometry that connects the original **point** to the " -"closest point of the edge with identifier ``edge_id``" +"``LINESTRING`` geometry that connects the original **point** to the closest " +"point of the edge with identifier ``edge_id``" msgstr "" msgid "One point in an edge" @@ -12065,8 +11940,8 @@ msgid "``geom`` has the value of the original point." msgstr "" msgid "" -"The geometry ``edge`` is a line that connects the original point with the" -" edge :math:`sp \\rightarrow ep` edge." +"The geometry ``edge`` is a line that connects the original point with the " +"edge :math:`sp \\rightarrow ep` edge." msgstr "" msgid "The point is located at the left of the edge." @@ -12116,8 +11991,7 @@ msgid "Do not process query" msgstr "" msgid "" -"Generate a PostgreSQL ``NOTICE`` with the code used to calculate all " -"columns" +"Generate a PostgreSQL ``NOTICE`` with the code used to calculate all columns" msgstr "" msgid "Find at most two routes to a given point" @@ -12137,18 +12011,18 @@ msgstr "" msgid "" "Some times the applications work \"on the fly\" starting from a location " -"that is not a vertex in the graph. Those locations, in pgRrouting are " -"called points of interest." +"that is not a vertex in the graph. Those locations, in pgRrouting are called " +"points of interest." msgstr "" msgid "" -"The information needed in the points of interest is ``pid``, ``edge_id``," -" ``side``, ``fraction``." +"The information needed in the points of interest is ``pid``, ``edge_id``, " +"``side``, ``fraction``." msgstr "" msgid "" -"On this documentation there will be some 6 fixed points of interest and " -"they will be stored on a table." +"On this documentation there will be some 6 fixed points of interest and they " +"will be stored on a table." msgstr "" msgid "A unique identifier." @@ -12170,8 +12044,8 @@ msgid "The distance between ``geom`` and the segment ``edge_id``." msgstr "" msgid "" -"A segment that connects the ``geom`` of the point to the closest point on" -" the segment ``edge_id``." +"A segment that connects the ``geom`` of the point to the closest point on " +"the segment ``edge_id``." msgstr "" msgid "``newPoint``" @@ -12190,8 +12064,8 @@ msgid "Filling the rest of the table." msgstr "" msgid "" -"Any other additional modification: In this manual, point :math:`6` can be" -" reached from both sides." +"Any other additional modification: In this manual, point :math:`6` can be " +"reached from both sides." msgstr "" msgid "The points of interest:" @@ -12201,33 +12075,33 @@ msgid "``pgr_floydWarshall``" msgstr "" msgid "" -"``pgr_floydWarshall`` - Returns the sum of the costs of the shortest path" -" for each pair of nodes in the graph using Floyd-Warshall algorithm." +"``pgr_floydWarshall`` - Returns the sum of the costs of the shortest path " +"for each pair of nodes in the graph using Floyd-Warshall algorithm." msgstr "" msgid "" "The Floyd-Warshall algorithm, also known as Floyd's algorithm, is a good " -"choice to calculate the sum of the costs of the shortest path for each " -"pair of nodes in the graph, for *dense graphs*. We use Boost's " -"implementation which runs in :math:`\\Theta(V^3)` time," +"choice to calculate the sum of the costs of the shortest path for each pair " +"of nodes in the graph, for *dense graphs*. We use Boost's implementation " +"which runs in :math:`\\Theta(V^3)` time," msgstr "" msgid "pgr_floydWarshall(`Edges SQL`_, [``directed``])" msgstr "" -#, python-brace-format msgid "For a directed subgraph with edges :math:`\\{1, 2, 3, 4\\}`." msgstr "" msgid "" -"Boost `floyd-Warshall " -"`_" +"Boost `floyd-Warshall `_" msgstr "" msgid "``pgr_full_version``" msgstr "" -msgid "``pgr_full_version`` — Get the details of pgRouting version information." +msgid "" +"``pgr_full_version`` — Get the details of pgRouting version information." msgstr "" msgid "Get complete details of pgRouting version information" @@ -12300,26 +12174,26 @@ msgid "``pgr_hawickCircuits`` - Experimental" msgstr "" msgid "" -"``pgr_hawickCircuits`` — Returns the list of ciruits using hawick " -"circuits algorithm." +"``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits " +"algorithm." msgstr "" msgid "" -"Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health " -"A. James. This algorithm solves the problem of detecting and enumerating " +"Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. " +"James. This algorithm solves the problem of detecting and enumerating " "circuits in graphs. It is capable of circuit enumeration in graphs with " -"directed-arcs, multiple-arcs and self-arcs with a memory efficient and " -"high-performance im-plementation. It is an extension of Johnson's " -"Algorithm of finding all the elementary circuits of a directed graph." +"directed-arcs, multiple-arcs and self-arcs with a memory efficient and high-" +"performance im-plementation. It is an extension of Johnson's Algorithm of " +"finding all the elementary circuits of a directed graph." msgstr "" msgid "" "There are 2 variations defined in the Boost Graph Library. Here, we have " -"implemented only 2nd as it serves the most suitable and practical " -"usecase. In this variation we get the circuits after filtering out the " -"circuits caused by parallel edges. Parallel edge circuits have more use " -"cases when you want to count the no. of circuits.Maybe in future, we will" -" also implemenent this variation." +"implemented only 2nd as it serves the most suitable and practical usecase. " +"In this variation we get the circuits after filtering out the circuits " +"caused by parallel edges. Parallel edge circuits have more use cases when " +"you want to count the no. of circuits.Maybe in future, we will also " +"implemenent this variation." msgstr "" msgid "The algorithm implementation works only for directed graph" @@ -12334,7 +12208,7 @@ msgstr "" msgid "Time Complexity: :math:`O((V + E) (c + 1))`" msgstr "" -msgid ":math:`|c|` is the number of circuts in the graph." +msgid ":math:`|c|` is the number of circuits in the graph." msgstr "" msgid "pgr_hawickCircuits(`Edges SQL`_)" @@ -12349,7 +12223,8 @@ msgstr "" msgid "Id of the circuit starting from ``1``" msgstr "" -msgid "Relative postion in the path. Has value ``0`` for beginning of the path" +msgid "" +"Relative position in the path. Has value ``0`` for beginning of the path" msgstr "" msgid "Identifier of the starting vertex of the circuit." @@ -12362,8 +12237,8 @@ msgid "Identifier of the node in the path from a vid to next vid." msgstr "" msgid "" -"`Boost: Hawick Circuit Algorithm " -"`__" +"`Boost: Hawick Circuit Algorithm `__" msgstr "" msgid "``pgr_isPlanar`` - Experimental" @@ -12374,20 +12249,19 @@ msgid "" "graph." msgstr "" -#, python-brace-format msgid "" -"A graph is planar if it can be drawn in two-dimensional space with no two" -" of its edges crossing. Such a drawing of a planar graph is called a " -"plane drawing. Every planar graph also admits a straight-line drawing, " -"which is a plane drawing where each edge is represented by a line " -"segment. When a graph has :math:`K_5` or :math:`K_{3, 3}` as subgraph " -"then the graph is not planar." +"A graph is planar if it can be drawn in two-dimensional space with no two of " +"its edges crossing. Such a drawing of a planar graph is called a plane " +"drawing. Every planar graph also admits a straight-line drawing, which is a " +"plane drawing where each edge is represented by a line segment. When a graph " +"has :math:`K_5` or :math:`K_{3, 3}` as subgraph then the graph is not planar." msgstr "" msgid "This implementation use the Boyer-Myrvold Planarity Testing." msgstr "" -msgid "It will return a boolean value depending upon the planarity of the graph." +msgid "" +"It will return a boolean value depending upon the planarity of the graph." msgstr "" msgid "Applicable only for **undirected** graphs." @@ -12417,56 +12291,53 @@ msgstr "" msgid "`false` when the graph is not planar." msgstr "" -#, python-brace-format msgid "" -"The following edges will make the subgraph with vertices {10, 15, 11, 16," -" 13} a :math:`K_1` graph." +"The following edges will make the subgraph with vertices {10, 15, 11, 16, " +"13} a :math:`K_1` graph." msgstr "" msgid "" -"The new graph is not planar because it has a :math:`K_5` subgraph. Edges " -"in blue represent :math:`K_5` subgraph." +"The new graph is not planar because it has a :math:`K_5` subgraph. Edges in " +"blue represent :math:`K_5` subgraph." msgstr "" msgid "" -"`Boost: Boyer Myrvold " -"`__" +"`Boost: Boyer Myrvold `__" msgstr "" msgid "``pgr_johnson``" msgstr "" msgid "" -"``pgr_johnson`` - Returns the sum of the costs of the shortest path for " -"each pair of nodes in the graph using Floyd-Warshall algorithm." +"``pgr_johnson`` - Returns the sum of the costs of the shortest path for each " +"pair of nodes in the graph using Floyd-Warshall algorithm." msgstr "" msgid "" -"The Johnson algorithm, is a good choice to calculate the sum of the costs" -" of the shortest path for each pair of nodes in the graph, for *sparse " -"graphs*. It usees the Boost's implementation which runs in :math:`O(V E " -"\\log V)` time," +"The Johnson algorithm, is a good choice to calculate the sum of the costs of " +"the shortest path for each pair of nodes in the graph, for *sparse graphs*. " +"It uses the Boost's implementation which runs in :math:`O(V E \\log V)` time," msgstr "" msgid "pgr johnson(`Edges SQL`_, [``directed``])" msgstr "" msgid "" -"Boost `Johnson " -"`_" +"Boost `Johnson `_" msgstr "" msgid "``pgr_kruskal``" msgstr "" msgid "" -"``pgr_kruskal`` — Minimum spanning tree of a graph using Kruskal's " -"algorithm." +"``pgr_kruskal`` — Minimum spanning tree of a graph using Kruskal's algorithm." msgstr "" msgid "" -"This algorithm finds the minimum spanning forest in a possibly " -"disconnected graph using Kruskal's algorithm." +"This algorithm finds the minimum spanning forest in a possibly disconnected " +"graph using Kruskal's algorithm." msgstr "" msgid "EMPTY SET is returned when there are no edges in the graph." @@ -12490,8 +12361,8 @@ msgid "Added ``pred`` result columns." msgstr "" msgid "" -"Visits and extracts the nodes information in Breath First Search ordering" -" of the Minimum Spanning Tree created using Kruskal's algorithm." +"Visits and extracts the nodes information in Breath First Search ordering of " +"the Minimum Spanning Tree created using Kruskal's algorithm." msgstr "" msgid "Returned tree nodes from a root vertex are on Breath First Search order" @@ -12509,19 +12380,18 @@ msgstr "" msgid "The Minimum Spanning Tree having as root vertex :math:`6`" msgstr "" -#, python-brace-format msgid "" -"The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with " -":math:`depth \\leq 3`" +"The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:" +"`depth \\leq 3`" msgstr "" msgid "``pgr_kruskalDD`` — Catchament nodes using Kruskal's algorithm." msgstr "" msgid "" -"Using Kruskal's algorithm, extracts the nodes that have aggregate costs " -"less than or equal to a **distance** from a **root** vertex (or vertices)" -" within the calculated minimum spanning tree." +"Using Kruskal's algorithm, extracts the nodes that have aggregate costs less " +"than or equal to a **distance** from a **root** vertex (or vertices) within " +"the calculated minimum spanning tree." msgstr "" msgid "Returned tree nodes from a root vertex are on Depth First Search order." @@ -12537,14 +12407,13 @@ msgid "pgr_kruskalDD(`Edges SQL`_, **root vids**, **distance**)" msgstr "" msgid "" -"The Minimum Spanning Tree starting on vertex :math:`6` with " -":math:`distance \\leq 3.5`" +"The Minimum Spanning Tree starting on vertex :math:`6` with :math:`distance " +"\\leq 3.5`" msgstr "" -#, python-brace-format msgid "" -"The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with " -":math:`distance \\leq 3.5`" +"The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:" +"`distance \\leq 3.5`" msgstr "" msgid "" @@ -12553,8 +12422,8 @@ msgid "" msgstr "" msgid "" -"Visits and extracts the nodes information in Depth First Search ordering " -"of the Minimum Spanning Tree created using Kruskal's algorithm." +"Visits and extracts the nodes information in Depth First Search ordering of " +"the Minimum Spanning Tree created using Kruskal's algorithm." msgstr "" msgid "Returned tree nodes from a root vertex are on Depth First Search order" @@ -12570,14 +12439,14 @@ msgid "``pgr_lengauerTarjanDominatorTree`` - Experimental" msgstr "" msgid "" -"``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of " -"all vertices." +"``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all " +"vertices." msgstr "" msgid "" -"The algorithm calculates the *immidiate dominator* of each vertex called " -"**idom**, once **idom** of each vertex is calculated then by making every" -" **idom** of each vertex as its parent, the dominator tree can be built." +"The algorithm calculates the *immediate dominator* of each vertex called " +"**idom**, once **idom** of each vertex is calculated then by making every " +"**idom** of each vertex as its parent, the dominator tree can be built." msgstr "" msgid "The algorithm works in directed graph only." @@ -12586,7 +12455,8 @@ msgstr "" msgid "The algorithm returns *idom* of each vertex." msgstr "" -msgid "If the *root vertex* not present in the graph then it returns empty set." +msgid "" +"If the *root vertex* not present in the graph then it returns empty set." msgstr "" msgid "Running time: :math:`O((V+E)log(V+E))`" @@ -12623,40 +12493,41 @@ msgid "Dominator tree of another component." msgstr "" msgid "" -"`Boost: Lengauer-Tarjan dominator " -"`__" +"`Boost: Lengauer-Tarjan dominator `__" msgstr "" msgid "" -"`Wikipedia: dominator tree " -"`__" +"`Wikipedia: dominator tree `__" msgstr "" msgid "``pgr_lineGraph`` - Proposed" msgstr "" msgid "" -"``pgr_lineGraph`` — Transforms the given graph into its corresponding " -"edge-based graph." +"``pgr_lineGraph`` — Transforms the given graph into its corresponding edge-" +"based graph." msgstr "" msgid "Works for directed and undirected graphs." msgstr "" -msgid "Given a graph :math:`G`, its line graph :math:`L(G)` is a graph such that:" +msgid "" +"Given a graph :math:`G`, its line graph :math:`L(G)` is a graph such that:" msgstr "" msgid "Each vertex of :math:`L(G)` represents an edge of :math:`G`." msgstr "" msgid "" -"Two vertices of :math:`L(G)` are adjacent if and only if their " -"corresponding edges share a common endpoint in :math:`G`" +"Two vertices of :math:`L(G)` are adjacent if and only if their corresponding " +"edges share a common endpoint in :math:`G`" msgstr "" msgid "" -"The ``cost`` and ``reverse_cost`` columns of the result represent " -"existence of the edge." +"The ``cost`` and ``reverse_cost`` columns of the result represent existence " +"of the edge." msgstr "" msgid "When the graph is directed the result is directed." @@ -12679,7 +12550,6 @@ msgstr "" msgid "Returns set of |result-lineg|" msgstr "" -#, python-brace-format msgid "For an undirected graph with edges :math:'{2,4,5,8}'" msgstr "" @@ -12711,10 +12581,9 @@ msgstr "" msgid "Given the following directed graph" msgstr "" -#, python-brace-format msgid "" -":math:`G(V,E) = G(\\{1,2,3,4\\},\\{ 1 \\rightarrow 2, 1 \\rightarrow 4, 2" -" \\rightarrow 3, 3 \\rightarrow 1, 3 \\rightarrow 2, 3 \\rightarrow 4, 4 " +":math:`G(V,E) = G(\\{1,2,3,4\\},\\{ 1 \\rightarrow 2, 1 \\rightarrow 4, 2 " +"\\rightarrow 3, 3 \\rightarrow 1, 3 \\rightarrow 2, 3 \\rightarrow 4, 4 " "\\rightarrow 3\\})`" msgstr "" @@ -12722,8 +12591,8 @@ msgid "Representation as directed with shared edge identifiers" msgstr "" msgid "" -"For the simplicity, the design of the edges table on the database, has " -"the edge's identifiers are represented with 3 digits:" +"For the simplicity, the design of the edges table on the database, has the " +"edge's identifiers are represented with 3 digits:" msgstr "" msgid "hundreds" @@ -12747,27 +12616,26 @@ msgstr "" msgid "In this image," msgstr "" -msgid "Single or double head arrows represent one edge (row) on the edges table." +msgid "" +"Single or double head arrows represent one edge (row) on the edges table." msgstr "" msgid "The numbers in the yellow shadow are the edge identifiers." msgstr "" msgid "" -"Two pair of edges share the same identifier when the ``reverse_cost`` " -"column is used." +"Two pair of edges share the same identifier when the ``reverse_cost`` column " +"is used." msgstr "" -#, python-brace-format msgid "" -"Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with " -"one edge row with :math:`id=203`." +"Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with one " +"edge row with :math:`id=203`." msgstr "" -#, python-brace-format msgid "" -"Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with " -"one edge row with :math:`id=304`." +"Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with one " +"edge row with :math:`id=304`." msgstr "" msgid "The graph can be created as follows:" @@ -12780,16 +12648,14 @@ msgid "The result is a directed graph." msgstr "" msgid "" -"For :math:`seq=4` from :math:`203 \\leftrightarrow 304` represent two " -"edges" +"For :math:`seq=4` from :math:`203 \\leftrightarrow 304` represent two edges" msgstr "" msgid "For all the other values of ``seq`` represent one edge." msgstr "" msgid "" -"The ``cost`` and ``reverse_cost`` values represent the existence of the " -"edge." +"The ``cost`` and ``reverse_cost`` values represent the existence of the edge." msgstr "" msgid "When positive: the edge exists." @@ -12812,58 +12678,55 @@ msgid "" "column is not used." msgstr "" -#, python-brace-format msgid "" -"Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with " -"two edges :math:`id=203` and :math:`id=302` respectively." +"Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with two " +"edges :math:`id=203` and :math:`id=302` respectively." msgstr "" -#, python-brace-format msgid "" -"Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with " -"two edges :math:`id=304` and :math:`id=403` respectively." +"Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with two " +"edges :math:`id=304` and :math:`id=403` respectively." msgstr "" msgid "Line Graph of a directed graph represented with unique edges" msgstr "" msgid "" -"For :math:`seq=7` from :math:`203 \\leftrightarrow 302` represent two " -"edges." +"For :math:`seq=7` from :math:`203 \\leftrightarrow 302` represent two edges." msgstr "" msgid "" -"For :math:`seq=8` from :math:`304 \\leftrightarrow 403` represent two " -"edges." +"For :math:`seq=8` from :math:`304 \\leftrightarrow 403` represent two edges." msgstr "" msgid "wikipedia: `Line Graph `__" msgstr "" -msgid "mathworld: `Line Graph `__" +msgid "" +"mathworld: `Line Graph `__" msgstr "" msgid "``pgr_lineGraphFull`` - Experimental" msgstr "" msgid "" -"``pgr_lineGraphFull`` — Transforms a given graph into a new graph where " -"all of the vertices from the original graph are converted to line graphs." +"``pgr_lineGraphFull`` — Transforms a given graph into a new graph where all " +"of the vertices from the original graph are converted to line graphs." msgstr "" msgid "Version 2.6.0" msgstr "" msgid "" -"``pgr_lineGraphFull``, converts original directed graph to a directed " -"line graph by converting each vertex to a complete graph and keeping all " -"the original edges. The new connecting edges have a cost 0 and go between" -" the adjacent original edges, respecting the directionality." +"``pgr_lineGraphFull``, converts original directed graph to a directed line " +"graph by converting each vertex to a complete graph and keeping all the " +"original edges. The new connecting edges have a cost 0 and go between the " +"adjacent original edges, respecting the directionality." msgstr "" msgid "" -"A possible application of the resulting graph is **\"routing with two " -"edge restrictions\"**:" +"A possible application of the resulting graph is **\"routing with two edge " +"restrictions\"**:" msgstr "" msgid "" @@ -12884,13 +12747,11 @@ msgid "This function is for **directed** graphs." msgstr "" msgid "" -"Results are undefined when a negative vertex id is used in the input " -"graph." +"Results are undefined when a negative vertex id is used in the input graph." msgstr "" msgid "" -"Results are undefined when a duplicated edge id is used in the input " -"graph." +"Results are undefined when a duplicated edge id is used in the input graph." msgstr "" msgid "Running time: TBD" @@ -12902,7 +12763,6 @@ msgstr "" msgid "Returns set of |result-linegf|" msgstr "" -#, python-brace-format msgid "Full line graph of subgraph of edges :math:`\\{4, 7, 8, 10\\}`" msgstr "" @@ -12935,28 +12795,27 @@ msgid "second" msgstr "" msgid "" -"In the transformed graph, all of the edges from the original graph are " -"still present (yellow), but we now have additional edges for every turn " -"that could be made across vertex 7 (orange)." +"In the transformed graph, all of the edges from the original graph are still " +"present (yellow), but we now have additional edges for every turn that could " +"be made across vertex 7 (orange)." msgstr "" msgid "Creating table that identifies transformed vertices" msgstr "" msgid "" -"The vertices in the transformed graph are each created by splitting up " -"the vertices in the original graph. Unless a vertex in the original graph" -" is a leaf vertex, it will generate more than one vertex in the " -"transformed graph. One of the newly created vertices in the transformed " -"graph will be given the same vertex identifier as the vertex that it was " -"created from in the original graph, but the rest of the newly created " -"vertices will have negative vertex ids." +"The vertices in the transformed graph are each created by splitting up the " +"vertices in the original graph. Unless a vertex in the original graph is a " +"leaf vertex, it will generate more than one vertex in the transformed graph. " +"One of the newly created vertices in the transformed graph will be given the " +"same vertex identifier as the vertex that it was created from in the " +"original graph, but the rest of the newly created vertices will have " +"negative vertex ids." msgstr "" msgid "" -"Following is an example of how to generate a table that maps the ids of " -"the newly created vertices with the original vertex that they were " -"created from" +"Following is an example of how to generate a table that maps the ids of the " +"newly created vertices with the original vertex that they were created from" msgstr "" msgid "Store edge results" @@ -12986,8 +12845,8 @@ msgid "Inspecting the vertices map" msgstr "" msgid "" -"The self loops happen when there is no cost traveling to the ``target`` " -"and the source has an original value." +"The self loops happen when there is no cost traveling to the ``target`` and " +"the source has an original value." msgstr "" msgid "Updating values from self loops" @@ -13007,17 +12866,17 @@ msgid "" "wanted." msgstr "" -msgid "Idenifying the restriction" +msgid "Identifying the restriction" msgstr "" msgid "" -"Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where " -"the cost will be increased" +"Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where the " +"cost will be increased" msgstr "" msgid "" "The edge to be altered is ``WHERE cost = 0 AND seq != 1 AND edge != -1`` " -"from the previus query:" +"from the previous query:" msgstr "" msgid "Adding a value to the restriction" @@ -13035,7 +12894,8 @@ msgstr "" msgid "Simplifying leaf vertices" msgstr "" -msgid "In this example, there is no additional cost for traversing a leaf vertex." +msgid "" +"In this example, there is no additional cost for traversing a leaf vertex." msgstr "" msgid "Using the vertex map give the leaf verices their original value." @@ -13057,8 +12917,8 @@ msgid "Which can be removed" msgstr "" msgid "" -"Routing can be done now using the original vertices id using " -":doc:`pgr_dijkstra`" +"Routing can be done now using the original vertices id using :doc:" +"`pgr_dijkstra`" msgstr "" msgid "Complete routing graph" @@ -13068,8 +12928,8 @@ msgid "Add edges from the original graph" msgstr "" msgid "" -"Add all the edges that are not involved in the line graph process to the " -"new table" +"Add all the edges that are not involved in the line graph process to the new " +"table" msgstr "" msgid "Some administrative tasks to get new identifiers for the edges" @@ -13102,21 +12962,22 @@ msgid "``pgr_makeConnected`` — Set of edges that will connect the graph." msgstr "" msgid "" -"Adds the minimum number of edges needed to make the input graph " -"connected. The algorithm first identifies all of the connected components" -" in the graph, then adds edges to connect those components together in a " -"path. For example, if a graph contains three connected components A, B, " -"and C, make_connected will add two edges. The two edges added might " -"consist of one connecting a vertex in A with a vertex in B and one " -"connecting a vertex in B with a vertex in C." +"Adds the minimum number of edges needed to make the input graph connected. " +"The algorithm first identifies all of the connected components in the graph, " +"then adds edges to connect those components together in a path. For example, " +"if a graph contains three connected components A, B, and C, make_connected " +"will add two edges. The two edges added might consist of one connecting a " +"vertex in A with a vertex in B and one connecting a vertex in B with a " +"vertex in C." msgstr "" msgid "" -"It will give a minimum list of all edges which are needed in the graph to" -" make connect it." +"It will give a minimum list of all edges which are needed in the graph to " +"make connect it." msgstr "" -msgid "The algorithm does not considers geometric topology in the calculations." +msgid "" +"The algorithm does not considers geometric topology in the calculations." msgstr "" msgid "pgr_makeConnected(`Edges SQL`_)" @@ -13129,16 +12990,16 @@ msgid "List of edges that are needed to connect the graph." msgstr "" msgid "" -"`Boost: make connected " -"`__" +"`Boost: make connected `__" msgstr "" msgid "``pgr_maxCardinalityMatch``" msgstr "" msgid "" -"``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching " -"in a graph." +"``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a " +"graph." msgstr "" msgid "pgr_maxCardinalityMatch(text) returns only ``edge`` column." @@ -13162,8 +13023,8 @@ msgid "" msgstr "" msgid "" -"A maximum matching is a matching that contains the largest possible " -"number of edges." +"A maximum matching is a matching that contains the largest possible number " +"of edges." msgstr "" msgid "There may be many maximum matchings." @@ -13184,7 +13045,8 @@ msgstr "" msgid "Using all edges." msgstr "" -msgid "SQL query, which should return a set of rows with the following columns:" +msgid "" +"SQL query, which should return a set of rows with the following columns:" msgstr "" msgid "" @@ -13201,11 +13063,10 @@ msgid "Identifier of the edge in the original query." msgstr "" msgid "" -"`Boost: maximum_matching " -"`__" +"`Boost: maximum_matching `__" msgstr "" -#, python-format msgid "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" msgstr "" @@ -13216,8 +13077,8 @@ msgid "``pgr_maxFlow``" msgstr "" msgid "" -"``pgr_maxFlow`` — Calculates the maximum flow in a directed graph from " -"the source(s) to the targets(s) using the Push Relabel algorithm." +"``pgr_maxFlow`` — Calculates the maximum flow in a directed graph from the " +"source(s) to the targets(s) using the Push Relabel algorithm." msgstr "" msgid "pgr_maxFlow(Combinations)" @@ -13227,8 +13088,7 @@ msgid "Calculates the maximum flow from the sources to the targets." msgstr "" msgid "" -"When the maximum flow is **0** then there is no flow and **0** is " -"returned." +"When the maximum flow is **0** then there is no flow and **0** is returned." msgstr "" msgid "Uses the :doc:`pgr_pushRelabel ` algorithm." @@ -13259,20 +13119,20 @@ msgid "Maximum flow possible from the source(s) to the target(s)" msgstr "" msgid "" -"`Boost: push relabel max flow " -"`__" +"`Boost: push relabel max flow `__" msgstr "" -#, python-format -msgid "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" +msgid "" +"https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" msgstr "" msgid "``pgr_maxFlowMinCost`` - Experimental" msgstr "" msgid "" -"``pgr_maxFlowMinCost`` — Calculates the edges that minimizes the total " -"cost of the maximum flow on a graph" +"``pgr_maxFlowMinCost`` — Calculates the edges that minimizes the total cost " +"of the maximum flow on a graph" msgstr "" msgid "pgr_maxFlowMinCost(Combinations)" @@ -13300,8 +13160,8 @@ msgid "where :math:`U` is the value of the max flow." msgstr "" msgid "" -":math:`U` is upper bound on number of iterations. In many real world " -"cases number of iterations is much smaller than :math:`U`." +":math:`U` is upper bound on number of iterations. In many real world cases " +"number of iterations is much smaller than :math:`U`." msgstr "" msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vid**)" @@ -13382,8 +13242,17 @@ msgid "Nicolas Ribot, The source code is released under the MIT-X license." msgstr "" msgid "" -"The function reads edges from a not \"noded\" network table and writes " -"the \"noded\" edges into a new table." +"The function reads edges from a not \"noded\" network table and writes the " +"\"noded\" edges into a new table." +msgstr "" + +msgid "Not checking and not creating indexes." +msgstr "" + +msgid "Using ``pgr_separateTouching`` and ``pgr_separateCrossing``." +msgstr "" + +msgid "Created table with ``BIGINT``." msgstr "" msgid "" @@ -13393,19 +13262,19 @@ msgid "" msgstr "" msgid "" -"What we mean by \"noded\" is that at every intersection in the road " -"network all the edges will be broken into separate road segments. There " -"are cases like an over-pass and under-pass intersection where you can not" -" traverse from the over-pass to the under-pass, but this function does " -"not have the ability to detect and accommodate those situations." +"What we mean by \"noded\" is that at every intersection in the road network " +"all the edges will be broken into separate road segments. There are cases " +"like an over-pass and under-pass intersection where you can not traverse " +"from the over-pass to the under-pass, but this function does not have the " +"ability to detect and accommodate those situations." msgstr "" msgid "" -"This function reads the ``edge_table`` table, that has a primary key " -"column ``id`` and geometry column named ``the_geom`` and intersect all " -"the segments in it against all the other segments and then creates a " -"table ``edge_table_noded``. It uses the ``tolerance`` for deciding that " -"multiple nodes within the tolerance are considered the same node." +"This function reads the ``edge_table`` table, that has a primary key column " +"``id`` and geometry column named ``the_geom`` and intersect all the segments " +"in it against all the other segments and then creates a table " +"``edge_table_noded``. It uses the ``tolerance`` for deciding that multiple " +"nodes within the tolerance are considered the same node." msgstr "" msgid "``float8`` tolerance for coincident points (in projection unit)dd" @@ -13435,10 +13304,10 @@ msgstr "" msgid "``integer`` Segment number of the original edge" msgstr "" -msgid "``integer`` Empty source column" +msgid "``bigint`` Empty source column" msgstr "" -msgid "``integer`` Empty target column" +msgid "``bigint`` Empty target column" msgstr "" msgid "the geom" @@ -13463,8 +13332,8 @@ msgid "Calling ``pgr_nodeNetwork``." msgstr "" msgid "" -"Inspecting the generated table, we can see that edges 13 and 18 have been" -" segmented." +"Inspecting the generated table, we can see that edges 13 and 18 have been " +"segmented." msgstr "" msgid "Add new segments to the edges table." @@ -13483,8 +13352,7 @@ msgid "Store the deadends" msgstr "" msgid "" -"Inspecting the generated table, we can see that edge 14 has been " -"segmented." +"Inspecting the generated table, we can see that edge 14 has been segmented." msgstr "" msgid "``pgr_pickDeliver`` - Experimental" @@ -13494,8 +13362,8 @@ msgid "``pgr_pickDeliver`` - Pickup and delivery Vehicle Routing Problem" msgstr "" msgid "" -"Problem: Distribute and optimize the pickup-delivery pairs into a fleet " -"of vehicles." +"Problem: Distribute and optimize the pickup-delivery pairs into a fleet of " +"vehicles." msgstr "" msgid "Optimization problem is NP-hard." @@ -13553,16 +13421,15 @@ msgid "The speed, max_cycles, ma_capacity have illegal values" msgstr "" msgid "" -"Six different initial will be optimized - the best solution found will be" -" result" +"Six different initial will be optimized - the best solution found will be " +"result" msgstr "" msgid "Signature" msgstr "" msgid "" -"pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, " -"[**options**])" +"pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])" msgstr "" msgid "**options:** ``[factor, max_cycles, initial_sol]``" @@ -13607,7 +13474,8 @@ msgstr "" msgid "``pgr_pickDeliverEuclidean`` - Experimental" msgstr "" -msgid "``pgr_pickDeliverEuclidean`` - Pickup and delivery Vehicle Routing Problem" +msgid "" +"``pgr_pickDeliverEuclidean`` - Pickup and delivery Vehicle Routing Problem" msgstr "" msgid "Replaces ``pgr_gsoc_vrppdtw``" @@ -13662,8 +13530,8 @@ msgid "[ end_x, end_y, end_open, end_close, end_service ]" msgstr "" msgid "" -"This data example **lc101** is from data published at " -"https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/" +"This data example **lc101** is from data published at https://www.sintef.no/" +"projectweb/top/pdptw/li-lim-benchmark/" msgstr "" msgid "There are 25 vehicles in the problem all with the same characteristics." @@ -13673,8 +13541,8 @@ msgid "The original orders" msgstr "" msgid "" -"The data comes in different rows for the pickup and the delivery of the " -"same order." +"The data comes in different rows for the pickup and the delivery of the same " +"order." msgstr "" msgid "The original data needs to be converted to an appropriate table:" @@ -13685,8 +13553,8 @@ msgstr "" msgid "" "Showing only the relevant information to compare with the best solution " -"information published on " -"https://www.sintef.no/projectweb/top/pdptw/100-customers/" +"information published on https://www.sintef.no/projectweb/top/pdptw/100-" +"customers/" msgstr "" msgid "The best solution found for **lc101** is a travel time: 828.94" @@ -13698,12 +13566,13 @@ msgstr "" msgid "``pgr_prim``" msgstr "" -msgid "``pgr_prim`` — Minimum spanning forest of a graph using Prim's algorithm." +msgid "" +"``pgr_prim`` — Minimum spanning forest of a graph using Prim's algorithm." msgstr "" msgid "" -"This algorithm finds the minimum spanning forest in a possibly " -"disconnected graph using Prim's algorithm." +"This algorithm finds the minimum spanning forest in a possibly disconnected " +"graph using Prim's algorithm." msgstr "" msgid "Prim's running time: :math:`O(E * log V)`" @@ -13716,8 +13585,8 @@ msgid "Minimum spanning forest of a subgraph" msgstr "" msgid "" -"`Boost: Prim's algorithm documentation " -"`__" +"`Boost: Prim's algorithm documentation `__" msgstr "" msgid "" @@ -13726,8 +13595,8 @@ msgid "" msgstr "" msgid "" -"Visits and extracts the nodes information in Breath First Search ordering" -" of the Minimum Spanning Tree created using Prims's algorithm." +"Visits and extracts the nodes information in Breath First Search ordering of " +"the Minimum Spanning Tree created using Prims's algorithm." msgstr "" msgid "pgr_primBFS(`Edges SQL`_, **root vid**, [``max_depth``])" @@ -13740,8 +13609,8 @@ msgid "``pgr_primDD`` — Catchament nodes using Prim's algorithm." msgstr "" msgid "" -"Using Prim's algorithm, extracts the nodes that have aggregate costs less" -" than or equal to a distance from a root vertex (or vertices) within the " +"Using Prim's algorithm, extracts the nodes that have aggregate costs less " +"than or equal to a distance from a root vertex (or vertices) within the " "calculated minimum spanning tree." msgstr "" @@ -13752,13 +13621,13 @@ msgid "pgr_primDD(`Edges SQL`_, **root vids**, **distance**)" msgstr "" msgid "" -"``pgr_primDFS`` — Prim algorithm for Minimum Spanning Tree with Depth " -"First Search ordering." +"``pgr_primDFS`` — Prim algorithm for Minimum Spanning Tree with Depth First " +"Search ordering." msgstr "" msgid "" -"Visits and extracts the nodes information in Depth First Search ordering " -"of the Minimum Spanning Tree created using Prims's algorithm." +"Visits and extracts the nodes information in Depth First Search ordering of " +"the Minimum Spanning Tree created using Prims's algorithm." msgstr "" msgid "pgr_primDFS(`Edges SQL`_, **root vid**, [``max_depth``])" @@ -13771,9 +13640,8 @@ msgid "``pgr_pushRelabel``" msgstr "" msgid "" -"``pgr_pushRelabel`` — Calculates the flow on the graph edges that " -"maximizes the flow from the sources to the targets using Push Relabel " -"Algorithm." +"``pgr_pushRelabel`` — Calculates the flow on the graph edges that maximizes " +"the flow from the sources to the targets using Push Relabel Algorithm." msgstr "" msgid "pgr_pushRelabel(Combinations)" @@ -13830,9 +13698,9 @@ msgid "Get the code for further refinement." msgstr "" msgid "" -"When there are special details that need to be taken care of because of " -"the final application or the quality of the data, the code can be " -"obtained On a PostgreSQL ``NOTICE`` using the ``dryrun`` flag." +"When there are special details that need to be taken care of because of the " +"final application or the quality of the data, the code can be obtained On a " +"PostgreSQL ``NOTICE`` using the ``dryrun`` flag." msgstr "" msgid "``pgr_separateTouching``" @@ -13844,9 +13712,9 @@ msgid "" msgstr "" msgid "" -"This is an auxiliary function for processing geometries that touch but " -"don't share exact endpoints, splitting them at their intersection points " -"to improve network connectivity." +"This is an auxiliary function for processing geometries that touch but don't " +"share exact endpoints, splitting them at their intersection points to " +"improve network connectivity." msgstr "" msgid "pgr_separateTouching(`Edges SQL`_, [``tolerance``, ``dryrun``])" @@ -13861,18 +13729,16 @@ msgid "" msgstr "" msgid "" -"Sequential vertex coloring algorithm is a graph coloring algorithm in " -"which color identifiers are assigned to the vertices of a graph in a " -"sequential manner, such that no edge connects two identically colored " -"vertices." +"Sequential vertex coloring algorithm is a graph coloring algorithm in which " +"color identifiers are assigned to the vertices of a graph in a sequential " +"manner, such that no edge connects two identically colored vertices." msgstr "" msgid "The implementation is applicable only for **undirected** graphs." msgstr "" msgid "" -"Provides the color to be assigned to all the vertices present in the " -"graph." +"Provides the color to be assigned to all the vertices present in the graph." msgstr "" msgid "Color identifiers values are in the Range :math:`[1, |V|]`" @@ -13884,9 +13750,9 @@ msgstr "" msgid "" "Efficient graph coloring is an NP-Hard problem, and therefore, this " "algorithm does not always produce optimal coloring. It follows a greedy " -"strategy by iterating through all the vertices sequentially, and " -"assigning the smallest possible color that is not used by its neighbors, " -"to each vertex." +"strategy by iterating through all the vertices sequentially, and assigning " +"the smallest possible color that is not used by its neighbors, to each " +"vertex." msgstr "" msgid "The returned rows are ordered in ascending order of the vertex value." @@ -13905,8 +13771,8 @@ msgid "pgr_sequentialVertexColoring(`Edges SQL`_)" msgstr "" msgid "" -"`Boost: Sequential Vertex Coloring " -"`__" +"`Boost: Sequential Vertex Coloring `__" msgstr "" msgid "``pgr_stoerWagner`` - Experimental" @@ -13922,21 +13788,19 @@ msgid "" "In graph theory, the Stoer–Wagner algorithm is a recursive algorithm to " "solve the minimum cut problem in undirected weighted graphs with non-" "negative weights. The essential idea of this algorithm is to shrink the " -"graph by merging the most intensive vertices, until the graph only " -"contains two combined vertex sets. At each phase, the algorithm finds the" -" minimum s-t cut for two vertices s and t chosen as its will. Then the " -"algorithm shrinks the edge between s and t to search for non s-t cuts. " -"The minimum cut found in all phases will be the minimum weighted cut of " -"the graph." +"graph by merging the most intensive vertices, until the graph only contains " +"two combined vertex sets. At each phase, the algorithm finds the minimum s-t " +"cut for two vertices s and t chosen as its will. Then the algorithm shrinks " +"the edge between s and t to search for non s-t cuts. The minimum cut found " +"in all phases will be the minimum weighted cut of the graph." msgstr "" msgid "" -"A cut is a partition of the vertices of a graph into two disjoint " -"subsets. A minimum cut is a cut for which the size or weight of the cut " -"is not larger than the size of any other cut. For an unweighted graph, " -"the minimum cut would simply be the cut with the least edges. For a " -"weighted graph, the sum of all edges' weight on the cut determines " -"whether it is a minimum cut." +"A cut is a partition of the vertices of a graph into two disjoint subsets. A " +"minimum cut is a cut for which the size or weight of the cut is not larger " +"than the size of any other cut. For an unweighted graph, the minimum cut " +"would simply be the cut with the least edges. For a weighted graph, the sum " +"of all edges' weight on the cut determines whether it is a minimum cut." msgstr "" msgid "Sum of the weights of all edges between the two sets is mincut." @@ -13955,9 +13819,8 @@ msgid "When the graph is unconnected then EMPTY SET is return." msgstr "" msgid "" -"Sometimes a graph has multiple min-cuts, but all have the same weight. " -"The this function determines exactly one of the min-cuts as well as its " -"weight." +"Sometimes a graph has multiple min-cuts, but all have the same weight. The " +"this function determines exactly one of the min-cuts as well as its weight." msgstr "" msgid "Running time: :math:`O(V*E + V^2*log V)`." @@ -13997,11 +13860,10 @@ msgid "Using :doc:`pgr_connectedComponents`" msgstr "" msgid "" -"`Boost: Stoer Wagner min cut " -"`__" +"`Boost: Stoer Wagner min cut `__" msgstr "" -#, python-format msgid "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" msgstr "" @@ -14009,13 +13871,13 @@ msgid "``pgr_strongComponents``" msgstr "" msgid "" -"``pgr_strongComponents`` — Strongly connected components of a directed " -"graph using Tarjan's algorithm based on DFS." +"``pgr_strongComponents`` — Strongly connected components of a directed graph " +"using Tarjan's algorithm based on DFS." msgstr "" msgid "" -"A strongly connected component of a directed graph is a set of vertices " -"that are all reachable from each other." +"A strongly connected component of a directed graph is a set of vertices that " +"are all reachable from each other." msgstr "" msgid "Works for **directed** graphs." @@ -14031,13 +13893,13 @@ msgid "The strong components of the graph" msgstr "" msgid "" -"`Boost: Strong components " -"`__" +"`Boost: Strong components `__" msgstr "" msgid "" -"wikipedia: `Strongly connected component " -"`__" +"wikipedia: `Strongly connected component `__" msgstr "" msgid "``pgr_topologicalSort`` - Experimental" @@ -14050,16 +13912,17 @@ msgstr "" msgid "" "The topological sort algorithm creates a linear ordering of the vertices " -"such that if edge :math:`(u,v)` appears in the graph, then :math:`v` " -"comes before :math:`u` in the ordering." +"such that if edge :math:`(u,v)` appears in the graph, then :math:`v` comes " +"before :math:`u` in the ordering." msgstr "" msgid "" -"Process is valid for directed acyclic graphs only. otherwise it will " -"throw warnings." +"Process is valid for directed acyclic graphs only. otherwise it will throw " +"warnings." msgstr "" -msgid "For optimization purposes, if there are more than one answer, the function" +msgid "" +"For optimization purposes, if there are more than one answer, the function" msgstr "" msgid "will return one of them." @@ -14096,19 +13959,19 @@ msgid "Graph is not a DAG" msgstr "" msgid "" -"`Boost: topological sort " -"`__" +"`Boost: topological sort `__" msgstr "" msgid "``pgr_transitiveClosure`` - Experimental" msgstr "" -msgid "``pgr_transitiveClosure`` — Transitive closure graph of a directed graph." +msgid "" +"``pgr_transitiveClosure`` — Transitive closure graph of a directed graph." msgstr "" msgid "" -"Transforms the input directed graph into the transitive closure of the " -"graph." +"Transforms the input directed graph into the transitive closure of the graph." msgstr "" msgid "Process is valid for directed graphs." @@ -14119,14 +13982,13 @@ msgstr "" msgid "" "Reachability between vertices on an undirected graph happens when they " -"belong to the same connected component. (see " -":doc:`pgr_connectedComponents`)" +"belong to the same connected component. (see :doc:`pgr_connectedComponents`)" msgstr "" msgid "The returned values are not ordered" msgstr "" -msgid "The returned graph is compresed" +msgid "The returned graph is compressed" msgstr "" msgid "Running time: :math:`O(|V||E|)`" @@ -14157,8 +14019,8 @@ msgid "Identifiers of the vertices that are reachable from vertex v." msgstr "" msgid "" -"`Boost: transitive closure " -"`__" +"`Boost: transitive closure `__" msgstr "" msgid "https://en.wikipedia.org/wiki/Transitive_closure" @@ -14197,7 +14059,8 @@ msgstr "" msgid "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" msgstr "" -msgid "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +msgid "" +"pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" msgstr "" msgid "New prototypes" @@ -14216,8 +14079,7 @@ msgid "" msgstr "" msgid "" -"It does no guarantee the shortest path as it might contain restriction " -"paths." +"It does no guarantee the shortest path as it might contain restriction paths." msgstr "" msgid "The general algorithm is as follows:" @@ -14248,8 +14110,8 @@ msgid "" msgstr "" msgid "" -"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**," -" [``directed``])" +"pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, " +"[``directed``])" msgstr "" msgid "" @@ -14260,17 +14122,14 @@ msgstr "" msgid "From vertex :math:`6` to vertex :math:`10` on an undirected graph." msgstr "" -#, python-brace-format msgid "" -"From vertex :math:`6` to vertices :math:`\\{10, 1\\}` on an undirected " -"graph." +"From vertex :math:`6` to vertices :math:`\\{10, 1\\}` on an undirected graph." msgstr "" -#, python-brace-format -msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`8` on a directed graph." +msgid "" +"From vertices :math:`\\{6, 1\\}` to vertex :math:`8` on a directed graph." msgstr "" -#, python-brace-format msgid "" "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 8\\}` on an " "undirected graph." @@ -14280,24 +14139,20 @@ msgid "Using a combinations table on an undirected graph." msgstr "" msgid "" -"`Deprecated documentation " -"`_" +"`Deprecated documentation `_" msgstr "" msgid "``pgr_trspVia`` - Proposed" msgstr "" msgid "" -"``pgr_trspVia`` Route that goes through a list of vertices with " -"restrictions." +"``pgr_trspVia`` Route that goes through a list of vertices with restrictions." msgstr "" -#, python-brace-format msgid "" -"Given a list of vertices and a graph, this function is equivalent to " -"finding the shortest path between :math:`vertex_i` and " -":math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)` trying" -" not to use restricted paths." +"Given a list of vertices and a graph, this function is equivalent to finding " +"the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :" +"math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." msgstr "" msgid "The paths represents the sections of the route." @@ -14307,8 +14162,7 @@ msgid "Execute a :doc:`pgr_dijkstraVia`." msgstr "" msgid "" -"For the set of sub paths of the solution that pass through a restriction " -"then" +"For the set of sub paths of the solution that pass through a restriction then" msgstr "" msgid "Execute the **TRSP** algorithm with restrictions for the paths." @@ -14322,10 +14176,9 @@ msgid "" "[**options**])" msgstr "" -#, python-brace-format msgid "" -"All this examples are about the route that visits the vertices " -":math:`\\{5, 7, 1, 8, 15\\}` in that order on a directed graph." +"All this examples are about the route that visits the vertices :math:`\\{5, " +"7, 1, 8, 15\\}` in that order on a directed graph." msgstr "" msgid "Simulation of how algorithm works." @@ -14335,8 +14188,8 @@ msgid "The algorithm performs a :doc:`pgr_dijkstraVia`" msgstr "" msgid "" -"Detects which of the sub paths pass through a restriction in this case is" -" for the ``path_id = 5`` from ``6`` to ``3`` because the path :math:`15 " +"Detects which of the sub paths pass through a restriction in this case is " +"for the ``path_id = 5`` from ``6`` to ``3`` because the path :math:`15 " "\\rightarrow 1` is restricted." msgstr "" @@ -14344,9 +14197,8 @@ msgid "Executes the :doc:`pgr_trsp` algorithm for the conflicting paths." msgstr "" msgid "" -"From the :doc:`pgr_dijkstraVia` result it removes the conflicting paths " -"and builds the solution with the results of the :doc:`pgr_trsp` " -"algorithm:" +"From the :doc:`pgr_dijkstraVia` result it removes the conflicting paths and " +"builds the solution with the results of the :doc:`pgr_trsp` algorithm:" msgstr "" msgid "Getting the same result as ``pgr_trspVia``:" @@ -14356,14 +14208,14 @@ msgid "Sometimes ``U_turn_on_edge`` flag is ignored when is set to ``false``." msgstr "" msgid "" -"The first step, doing a :doc:`pgr_dijkstraVia` does consider not making a" -" U turn on the same edge. But the path :math:`16 \\rightarrow 13` (Rows 4" -" and 5) is restricted and the result is using it." +"The first step, doing a :doc:`pgr_dijkstraVia` does consider not making a U " +"turn on the same edge. But the path :math:`16 \\rightarrow 13` (Rows 4 and " +"5) is restricted and the result is using it." msgstr "" msgid "" -"When executing the :doc:`pgr_trsp` algorithm for the conflicting path, " -"there is no ``U_turn_on_edge`` flag." +"When executing the :doc:`pgr_trsp` algorithm for the conflicting path, there " +"is no ``U_turn_on_edge`` flag." msgstr "" msgid "" @@ -14378,18 +14230,16 @@ msgid "``pgr_trspVia_withPoints`` - Proposed" msgstr "" msgid "" -"``pgr_trspVia_withPoints`` - Route that goes through a list of vertices " -"and/or points with restrictions." +"``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/" +"or points with restrictions." msgstr "" -#, python-brace-format msgid "" -"Given a graph, a set of restriction on the graph edges, a set of points " -"on the graphs edges and a list of vertices, this function is equivalent " -"to finding the shortest path between :math:`vertex_i` and " -":math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on " -"the graph) for all :math:`i < size\\_of(via\\;vertices)` trying not to " -"use restricted paths." +"Given a graph, a set of restriction on the graph edges, a set of points on " +"the graphs edges and a list of vertices, this function is equivalent to " +"finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` " +"(where :math:`vertex` can be a vertex or a point on the graph) for all :math:" +"`i < size\\_of(via\\;vertices)` trying not to use restricted paths." msgstr "" msgid "is a sequence of paths" @@ -14407,7 +14257,8 @@ msgstr "" msgid "Execute a :doc:`pgr_withPointsVia`." msgstr "" -msgid "For the set of paths of the solution that pass through a restriction then" +msgid "" +"For the set of paths of the solution that pass through a restriction then" msgstr "" msgid "Execute the **TRSP** algorithm with restrictions for the path." @@ -14421,7 +14272,6 @@ msgid "" "**via vertices**, [**options**])" msgstr "" -#, python-brace-format msgid "" "Find the route that visits the vertices :math:`\\{-6, 15, -5\\}` in that " "order on an directed graph." @@ -14461,13 +14311,12 @@ msgid "When ``true`` the results will include the points that are in the path." msgstr "" msgid "" -"When ``false`` the results will not include the points that are in the " -"path." +"When ``false`` the results will not include the points that are in the path." msgstr "" msgid "" -"When ``start_vid``, ``end_vid`` and ``node`` columns have negative " -"values, the identifier is for a Point." +"When ``start_vid``, ``end_vid`` and ``node`` columns have negative values, " +"the identifier is for a Point." msgstr "" msgid "Use ``pgr_findCloseEdges`` for points on the fly" @@ -14481,26 +14330,25 @@ msgid "" "`(2.9, 1.8)` in order of closeness to the graph." msgstr "" -msgid "Point :math:`-1` corresponds to the closest edge from point `(2.9, 1.8)`." +msgid "" +"Point :math:`-1` corresponds to the closest edge from point `(2.9, 1.8)`." msgstr "" msgid "" -"Point :math:`-2` corresponds to the next close edge from point `(2.9, " -"1.8)`." +"Point :math:`-2` corresponds to the next close edge from point `(2.9, 1.8)`." msgstr "" msgid "" -"Point :math:`-2` is visited on the route to from vertex :math:`1` to " -"Point :math:`-1` (See row where :math:`seq = 4`)." +"Point :math:`-2` is visited on the route to from vertex :math:`1` to Point :" +"math:`-1` (See row where :math:`seq = 4`)." msgstr "" msgid "Usage variations" msgstr "" -#, python-brace-format msgid "" -"All this examples are about the route that visits the vertices " -":math:`\\{-6, 7, -4, 8, -2\\}` in that order on a directed graph." +"All this examples are about the route that visits the vertices :math:`\\{-6, " +"7, -4, 8, -2\\}` in that order on a directed graph." msgstr "" msgid "Status of \"passes in front\" or \"visits\" of the nodes and points." @@ -14510,40 +14358,39 @@ msgid "The algorithm performs a :doc:`pgr_withPointsVia`" msgstr "" msgid "" -"Detects which of the paths pass through a restriction in this case is for" -" the ``path_id = 1`` from ``-6`` to ``15`` because the path :math:`9 " +"Detects which of the paths pass through a restriction in this case is for " +"the ``path_id = 1`` from ``-6`` to ``15`` because the path :math:`9 " "\\rightarrow 16` is restricted." msgstr "" -msgid "Executes the :ref:`TRSP-family:TRSP algorithm` for the conflicting paths." +msgid "" +"Executes the :ref:`TRSP-family:TRSP algorithm` for the conflicting paths." msgstr "" msgid "" -"From the :doc:`pgr_withPointsVia` result it removes the conflicting paths" -" and builds the solution with the results of the :doc:`pgr_trsp` " -"algorithm:" +"From the :doc:`pgr_withPointsVia` result it removes the conflicting paths " +"and builds the solution with the results of the :doc:`pgr_trsp` algorithm:" msgstr "" msgid "Getting the same result as ``pgr_trspVia_withPoints``:" msgstr "" msgid "" -"The first step, doing a :doc:`pgr_withPointsVia` does consider not making" -" a U turn on the same edge. But the path :math:`9 \\rightarrow 16` (Rows " -"4 and 5) is restricted and the result is using it." +"The first step, doing a :doc:`pgr_withPointsVia` does consider not making a " +"U turn on the same edge. But the path :math:`9 \\rightarrow 16` (Rows 4 and " +"5) is restricted and the result is using it." msgstr "" msgid "" -"When executing the :doc:`pgr_trsp_withPoints` algorithm for the " -"conflicting path, there is no ``U_turn_on_edge`` flag." +"When executing the :doc:`pgr_trsp_withPoints` algorithm for the conflicting " +"path, there is no ``U_turn_on_edge`` flag." msgstr "" msgid "" "Therefore the result ignores the ``U_turn_on_edge`` flag when set to " "``false``. From the :doc:`pgr_withPointsVia` result it removes the " -"conflicting paths and builds the solution with the results of the " -":doc:`pgr_trsp` algorithm. In this case a U turn is been done using the " -"same edge." +"conflicting paths and builds the solution with the results of the :doc:" +"`pgr_trsp` algorithm. In this case a U turn is been done using the same edge." msgstr "" msgid "``pgr_trsp_withPoints`` - Proposed" @@ -14583,7 +14430,8 @@ msgid "" "end_vids are ignored." msgstr "" -msgid "The returned values are ordered: - start_vid ascending - end_vid ascending" +msgid "" +"The returned values are ordered: - start_vid ascending - end_vid ascending" msgstr "" msgid "Running time: :math:`O(|start\\_vids|\\times(V \\log V + E))`" @@ -14610,8 +14458,8 @@ msgid "" msgstr "" msgid "" -"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Combinations " -"SQL`_, `Points SQL`_, [**options**])" +"pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, " +"`Points SQL`_, [**options**])" msgstr "" msgid "**options:** ``[directed, driving_side, details]``" @@ -14629,8 +14477,8 @@ msgid "From point :math:`1` and vertex :math:`6` to point :math:`3`." msgstr "" msgid "" -"From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex " -":math:`1`." +"From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :" +"math:`1`." msgstr "" msgid "" @@ -14639,24 +14487,24 @@ msgid "" msgstr "" msgid "" -"Find the routes from vertex :math:`1` to the two closest locations on the" -" graph of point `(2.9, 1.8)`." +"Find the routes from vertex :math:`1` to the two closest locations on the " +"graph of point `(2.9, 1.8)`." msgstr "" msgid "Pass in front or visits." msgstr "" msgid "" -"Which path (if any) passes in front of point :math:`6` or vertex " -":math:`11` with right side driving topology." +"Which path (if any) passes in front of point :math:`6` or vertex :math:`11` " +"with right side driving topology." msgstr "" msgid "Show details on undirected graph." msgstr "" msgid "" -"From point :math:`1` and vertex :math:`6` to point :math:`3` to vertex " -":math:`1` on an undirected graph, with details." +"From point :math:`1` and vertex :math:`6` to point :math:`3` to vertex :math:" +"`1` on an undirected graph, with details." msgstr "" msgid "``pgr_turnRestrictedPath`` - Experimental" @@ -14668,8 +14516,8 @@ msgid "" msgstr "" msgid "" -"Using Yen's algorithm to obtain K shortest paths and analyze the paths to" -" select the paths that do not use the restrictions" +"Using Yen's algorithm to obtain K shortest paths and analyze the paths to " +"select the paths that do not use the restrictions" msgstr "" msgid "" @@ -14692,7 +14540,8 @@ msgstr "" msgid "``stop_on_first``" msgstr "" -msgid "When ``true`` stops on first path found that dos not violate restrictions" +msgid "" +"When ``true`` stops on first path found that dos not violate restrictions" msgstr "" msgid "When ``false`` returns at most K paths" @@ -14750,8 +14599,8 @@ msgid "``pgr_withPoints`` - Proposed" msgstr "" msgid "" -"``pgr_withPoints`` - Returns the shortest path in a graph with additional" -" temporary vertices." +"``pgr_withPoints`` - Returns the shortest path in a graph with additional " +"temporary vertices." msgstr "" msgid "pgr_withPoints(Combinations)" @@ -14764,13 +14613,13 @@ msgid "**negative** when it belongs to the points_sql" msgstr "" msgid "" -"When the starting vertex and ending vertex are the same, there is no " -"path. - The agg_cost the non included values (v, v) is 0" +"When the starting vertex and ending vertex are the same, there is no path. - " +"The agg_cost the non included values (v, v) is 0" msgstr "" msgid "" -"When the starting vertex and ending vertex are the different and there is" -" no path: - The agg_cost the non included values (u, v) is ∞" +"When the starting vertex and ending vertex are the different and there is no " +"path: - The agg_cost the non included values (u, v) is ∞" msgstr "" msgid "" @@ -14789,8 +14638,8 @@ msgid "" msgstr "" msgid "" -"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**," -" [**options**])" +"pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, " +"[**options**])" msgstr "" msgid "" @@ -14828,8 +14677,8 @@ msgid "Returns set of |pid-m-m|" msgstr "" msgid "" -"From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex " -":math:`1`" +"From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :" +"math:`1`" msgstr "" msgid "Two combinations" @@ -14841,18 +14690,18 @@ msgid "" msgstr "" msgid "" -"Identifier of the starting vertex of the path. Negative value is for " -"point’s identifier." +"Identifier of the starting vertex of the path. Negative value is for point’s " +"identifier." msgstr "" msgid "" -"Array of identifiers of starting vertices. Negative values are for " -"point’s identifiers." +"Array of identifiers of starting vertices. Negative values are for point’s " +"identifiers." msgstr "" msgid "" -"Identifier of the ending vertex of the path. Negative value is for " -"point’s identifier." +"Identifier of the ending vertex of the path. Negative value is for point’s " +"identifier." msgstr "" msgid "" @@ -14875,11 +14724,9 @@ msgstr "" msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_." msgstr "" -#, python-brace-format msgid "" -"All the examples are about traveling from point :math:`1` and vertex " -":math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, " -"11\\}`" +"All the examples are about traveling from point :math:`1` and vertex :math:" +"`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" msgstr "" msgid "Passes in front or visits with right side driving." @@ -14895,9 +14742,9 @@ msgid "``pgr_withPointsCost`` - Proposed" msgstr "" msgid "" -"``pgr_withPointsCost`` - Calculates the shortest path and returns only " -"the aggregate cost of the shortest path found, for the combination of " -"points given." +"``pgr_withPointsCost`` - Calculates the shortest path and returns only the " +"aggregate cost of the shortest path found, for the combination of points " +"given." msgstr "" msgid "pgr_withPointsCost(Combinations)" @@ -14909,8 +14756,8 @@ msgid "" msgstr "" msgid "" -"Returns the sum of the costs of the shortest path for pair combination of" -" vertices in the modified graph." +"Returns the sum of the costs of the shortest path for pair combination of " +"vertices in the modified graph." msgstr "" msgid "" @@ -14925,8 +14772,8 @@ msgid "The `agg_cost` in the non included values `(u, v)` is :math:`\\infty`" msgstr "" msgid "" -"If the values returned are stored in a table, the unique index would be " -"the pair: `(start_vid, end_vid)`." +"If the values returned are stored in a table, the unique index would be the " +"pair: `(start_vid, end_vid)`." msgstr "" msgid "For **undirected** graphs, the results are **symmetric**." @@ -14938,18 +14785,18 @@ msgid "" msgstr "" msgid "" -"pgr_withPointsCost(`Edges SQL`_, 'Points SQL`_, **start vid**, **end " -"vid**, [**options**])" +"pgr_withPointsCost(`Edges SQL`_, 'Points SQL`_, **start vid**, **end vid**, " +"[**options**])" msgstr "" msgid "" -"pgr_withPointsCost(`Edges SQL`_, 'Points SQL`_, **start vid**, **end " -"vids**, [**options**])" +"pgr_withPointsCost(`Edges SQL`_, 'Points SQL`_, **start vid**, **end vids**, " +"[**options**])" msgstr "" msgid "" -"pgr_withPointsCost(`Edges SQL`_, 'Points SQL`_, **start vids**, **end " -"vid**, [**options**])" +"pgr_withPointsCost(`Edges SQL`_, 'Points SQL`_, **start vids**, **end vid**, " +"[**options**])" msgstr "" msgid "" @@ -14977,13 +14824,13 @@ msgid "From point :math:`1` to vertex :math:`10` with defaults" msgstr "" msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end " -"vids**, [**options**])" +"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, " +"[**options**])" msgstr "" msgid "" -"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end " -"vid**, [**options**])" +"pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, " +"[**options**])" msgstr "" msgid "" @@ -14992,8 +14839,8 @@ msgid "" msgstr "" msgid "" -"From point :math:`15` and vertex :math:`6` to point :math:`3` and vertex " -":math:`1`" +"From point :math:`15` and vertex :math:`6` to point :math:`3` and vertex :" +"math:`1`" msgstr "" msgid "" @@ -15024,10 +14871,9 @@ msgstr "" msgid "Right side driving topology" msgstr "" -#, python-brace-format msgid "" -"Traveling from point :math:`1` and vertex :math:`5` to points " -":math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`" +"Traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, " +"3, 6\\}` and vertices :math:`\\{10, 11\\}`" msgstr "" msgid "Left side driving topology" @@ -15040,8 +14886,8 @@ msgid "``pgr_withPointsCostMatrix`` - proposed" msgstr "" msgid "" -"``pgr_withPointsCostMatrix`` - Calculates a cost matrix using " -":doc:`pgr_withPoints`." +"``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:" +"`pgr_withPoints`." msgstr "" msgid "" @@ -15049,10 +14895,9 @@ msgid "" "[**options**])" msgstr "" -#, python-brace-format msgid "" -"Cost matrix for points :math:`\\{1, 6\\}` and vertices :math:`\\{10, " -"11\\}` on an **undirected** graph" +"Cost matrix for points :math:`\\{1, 6\\}` and vertices :math:`\\{10, 11\\}` " +"on an **undirected** graph" msgstr "" msgid "Returning a **symmetrical** cost matrix" @@ -15065,8 +14910,8 @@ msgid "Using the default ``driving_side`` value" msgstr "" msgid "" -"Find the matrix cost of the routes from vertex :math:`1` and the two " -"closest locations on the graph of point `(2.9, 1.8)`." +"Find the matrix cost of the routes from vertex :math:`1` and the two closest " +"locations on the graph of point `(2.9, 1.8)`." msgstr "" msgid "``pgr_withPointsDD`` - Proposed" @@ -15078,8 +14923,8 @@ msgid "" msgstr "" msgid "" -"Signature change: ``driving_side`` parameter changed from named optional " -"to unnamed compulsory **driving side**." +"Signature change: ``driving_side`` parameter changed from named optional to " +"unnamed compulsory **driving side**." msgstr "" msgid "pgr_withPointsDD(Single vertex)" @@ -15098,35 +14943,34 @@ msgid "When ``details`` is ``false``:" msgstr "" msgid "" -"Only points that are visited are removed, that is, points reached within " -"the distance are included" +"Only points that are visited are removed, that is, points reached within the " +"distance are included" 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 "" -"Modify the graph to include points and using Dijkstra algorithm, extracts" -" all the nodes and points that have costs less than or equal to the value" -" ``**distance**`` from the starting point. The edges extracted will " -"conform the corresponding spanning tree." +"Modify the graph to include points and using Dijkstra algorithm, extracts " +"all the nodes and points that have costs less than or equal to the value " +"``**distance**`` from the starting point. The edges extracted will conform " +"the corresponding spanning tree." msgstr "" msgid "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**," -" **driving side**, [**options A**])" +"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, " +"**driving side**, [**options A**])" msgstr "" msgid "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, " -"**distance**, **driving side**, [**options B**])" +"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, " +"**driving side**, [**options B**])" msgstr "" msgid "**options A:** ``[directed, details]``" @@ -15136,29 +14980,29 @@ msgid "**options B:** ``[directed, details, equicost]``" msgstr "" msgid "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**," -" **driving side**, [**options**])" +"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, " +"**driving side**, [**options**])" msgstr "" msgid "**options:** ``[directed, details]``" msgstr "" msgid "" -"Right side driving topology, from point :math:`1` within a distance of " -":math:`3.3` with details." +"Right side driving topology, from point :math:`1` within a distance of :math:" +"`3.3` with details." msgstr "" msgid "" -"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, " -"**distance**, **driving side**, [**options**])" +"pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, " +"**driving side**, [**options**])" msgstr "" msgid "**options:** ``[directed, details, equicost]``" msgstr "" msgid "" -"From point :math:`1` and vertex :math:`16` within a distance of " -":math:`3.3` with ``equicost`` on a directed graph" +"From point :math:`1` and vertex :math:`16` within a distance of :math:`3.3` " +"with ``equicost`` on a directed graph" msgstr "" msgid "Negative values represent a point" @@ -15201,8 +15045,8 @@ msgid "" msgstr "" msgid "" -"Point :math:`-2` corresponds to the next close edge from point " -":math:`(2.9, 1.8)`." +"Point :math:`-2` corresponds to the next close edge from point :math:`(2.9, " +"1.8)`." msgstr "" msgid "Driving side does not matter" @@ -15217,11 +15061,7 @@ msgid "``pgr_withPointsKSP`` - Proposed" msgstr "" msgid "" -"``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using " -"Dijkstra." -msgstr "" - -msgid "Standarizing output columns to |nksp-result|" +"``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." msgstr "" msgid "pgr_withPointsKSP(One to One)" @@ -15239,45 +15079,47 @@ msgstr "" msgid "pgr_withPointsKSP(Combinations)" msgstr "" -msgid "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char,boolean)``" +msgid "" +"pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,char," +"boolean)``" msgstr "" msgid "" -"Modifies the graph to include the points defined in the `Points SQL`_ and" -" using Yen algorithm, finds the :math:`K` shortest paths." +"Modifies the graph to include the points defined in the `Points SQL`_ and " +"using Yen algorithm, finds the :math:`K` shortest paths." msgstr "" msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end " -"vid**, **K**, **driving_side**, [**options**])" +"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, " +"**K**, **driving_side**, [**options**])" msgstr "" msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end " -"vids**, **K**, **driving_side**, [**options**])" +"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, " +"**K**, **driving_side**, [**options**])" msgstr "" msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end " -"vid**, **K**, **driving_side**, [**options**])" +"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, " +"**K**, **driving_side**, [**options**])" msgstr "" msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end " -"vids**, **K**, **driving_side**, [**options**])" +"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, " +"**K**, **driving_side**, [**options**])" msgstr "" msgid "" -"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, " -"**K**, **driving_side**, [**options**])" +"pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, " +"**driving_side**, [**options**])" msgstr "" msgid "**options:** ``[directed, heap_paths, details]``" msgstr "" msgid "" -"Get 2 paths from Point :math:`1` to point :math:`2` on a directed graph " -"with **left** side driving." +"Get 2 paths from Point :math:`1` to point :math:`2` on a directed graph with " +"**left** side driving." msgstr "" msgid "For a directed graph." @@ -15290,20 +15132,20 @@ msgid "No heap paths are returned." msgstr "" msgid "" -"Get 2 paths from point :math:`1` to point :math:`3` and vertex :math:`7` " -"on an undirected graph" +"Get 2 paths from point :math:`1` to point :math:`3` and vertex :math:`7` on " +"an undirected graph" msgstr "" msgid "" -"Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` " -"on a **directed** graph with **right** side driving and **details** set " -"to **True**" +"Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` on a " +"**directed** graph with **right** side driving and **details** set to " +"**True**" msgstr "" msgid "" -"Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` " -"and vertex :math:`1` on a **directed** graph with **left** side driving " -"and **heap_paths** set to **True**" +"Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` and " +"vertex :math:`1` on a **directed** graph with **left** side driving and " +"**heap_paths** set to **True**" msgstr "" msgid "Using a combinations table on an **directed** graph" @@ -15334,41 +15176,39 @@ msgid "withPointsKSP optional parameters" msgstr "" msgid "" -"Get :math:`2` paths using left side driving topology, from vertex " -":math:`1` to the closest location on the graph of point `(2.9, 1.8)`." +"Get :math:`2` paths using left side driving topology, from vertex :math:`1` " +"to the closest location on the graph of point `(2.9, 1.8)`." msgstr "" msgid "Left driving side" msgstr "" msgid "" -"Get :math:`2` paths using left side driving topology, from point " -":math:`1` to point :math:`3` with details." +"Get :math:`2` paths using left side driving topology, from point :math:`1` " +"to point :math:`3` with details." msgstr "" msgid "Right driving side" msgstr "" msgid "" -"Get :math:`2` paths using right side driving topology from, point " -":math:`1` to point :math:`2` with heap paths and details." +"Get :math:`2` paths using right side driving topology from, point :math:`1` " +"to point :math:`2` with heap paths and details." msgstr "" msgid "``pgr_withPointsVia`` - Proposed" msgstr "" msgid "" -"``pgr_withPointsVia`` - Route that goes through a list of vertices and/or" -" points." +"``pgr_withPointsVia`` - Route that goes through a list of vertices and/or " +"points." msgstr "" -#, python-brace-format msgid "" -"Given a graph, a set of points on the graphs edges and a list of " -"vertices, this function is equivalent to finding the shortest path " -"between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` " -"can be a vertex or a point on the graph) for all :math:`i < " -"size\\_of(via\\;vertices)`." +"Given a graph, a set of points on the graphs edges and a list of vertices, " +"this function is equivalent to finding the shortest path between :math:" +"`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or " +"a point on the graph) for all :math:`i < size\\_of(via\\;vertices)`." msgstr "" msgid "" @@ -15376,19 +15216,17 @@ msgid "" "[**options**])" msgstr "" -#, python-brace-format msgid "" -"Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that" -" order on a **directed** graph." +"Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that " +"order on a **directed** graph." msgstr "" msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_" msgstr "" -#, python-brace-format msgid "" -"All this examples are about the route that visits the vertices " -":math:`\\{-1, 7, -3, 16, 15\\}` in that order on a **directed** graph." +"All this examples are about the route that visits the vertices :math:`\\{-1, " +"7, -3, 16, 15\\}` in that order on a **directed** graph." msgstr "" msgid "Prim - Family of functions" @@ -15396,21 +15234,20 @@ msgstr "" msgid "" "The prim algorithm was developed in 1930 by Czech mathematician Vojtěch " -"Jarník. It is a greedy algorithm that finds a minimum spanning tree for a" -" weighted undirected graph. This means it finds a subset of the edges " -"that forms a tree that includes every vertex, where the total weight of " -"all the edges in the tree is minimized. The algorithm operates by " -"building this tree one vertex at a time, from an arbitrary starting " -"vertex, at each step adding the cheapest possible connection from the " -"tree to another vertex." +"Jarník. It is a greedy algorithm that finds a minimum spanning tree for a " +"weighted undirected graph. This means it finds a subset of the edges that " +"forms a tree that includes every vertex, where the total weight of all the " +"edges in the tree is minimized. The algorithm operates by building this tree " +"one vertex at a time, from an arbitrary starting vertex, at each step adding " +"the cheapest possible connection from the tree to another vertex." msgstr "" msgid "" -"This algorithms find the minimum spanning forest in a possibly " -"disconnected graph; in contrast, the most basic form of Prim's algorithm " -"only finds minimum spanning trees in connected graphs. However, running " -"Prim's algorithm separately for each connected component of the graph, " -"then it is called minimum spanning forest." +"This algorithms find the minimum spanning forest in a possibly disconnected " +"graph; in contrast, the most basic form of Prim's algorithm only finds " +"minimum spanning trees in connected graphs. However, running Prim's " +"algorithm separately for each connected component of the graph, then it is " +"called minimum spanning forest." msgstr "" msgid "" @@ -15419,14 +15256,13 @@ msgid "" msgstr "" msgid "" -"Boost: `Prim's algorithm " -"`__" +"Boost: `Prim's algorithm `__" msgstr "" -#, python-format msgid "" -"Wikipedia: `Prim's algorithm " -"`__" +"Wikipedia: `Prim's algorithm `__" msgstr "" msgid "Proposed Functions" @@ -15451,8 +15287,7 @@ msgid ":doc:`pgr_withPointsVia` - Via routing" msgstr "" msgid "" -":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line " -"Graph." +":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." msgstr "" msgid ":doc:`pgr_separateCrossing` - Breaks geometries that cross each other." @@ -15476,8 +15311,8 @@ msgid "Release Notes" msgstr "" msgid "" -"To see the full list of changes check the list of `Git commits " -"`_ on Github." +"To see the full list of changes check the list of `Git commits `_ on Github." msgstr "" msgid "Mayors" @@ -15492,40 +15327,65 @@ msgstr "" msgid "pgRouting 3.8" msgstr "" +msgid "" +"`#2772 `__: Promote to " +"official pgr_extractVertices in 3.8" +msgstr "" + +msgid "" +"`#2760 `__: Promote to " +"official pgr_degree in 3.8" +msgstr "" + +msgid "" +"`#2774 `__: Promote to " +"official pgr_findCloseEdges in 3.8" +msgstr "" + +msgid "New proposed functions" +msgstr "" + +msgid "Deprecation of functions." +msgstr "" + +msgid "Deprecated functions:" +msgstr "" + +msgid "The use removed." +msgstr "" + msgid "pgRouting 3.7" msgstr "" msgid "pgRouting 3.7.3 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.7.3 " -"`__" +"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" +"`#2731 `__ Build Failure " +"on Ubuntu 22" msgstr "" msgid "pgRouting 3.7.2 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.7.2 " -"`__" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.7.2 `__" msgstr "" msgid "Build" msgstr "" msgid "" -"`#2713 `__ cmake " -"missing some policies and min version" +"`#2713 `__ cmake missing " +"some policies and min version" msgstr "" msgid "Using OLD policies: CMP0148, CMP0144, CMP0167" @@ -15535,23 +15395,22 @@ msgid "Minimum cmake version 3.12" msgstr "" msgid "" -"`#2707 `__ Build " -"failure in pgRouting 3.7.1 on Alpine" +"`#2707 `__ Build failure " +"in pgRouting 3.7.1 on Alpine" msgstr "" msgid "" -"`#2706 `__ winnie " -"crashing on pgr_betweennessCentrality" +"`#2706 `__ winnie crashing " +"on pgr_betweennessCentrality" msgstr "" msgid "pgRouting 3.7.1 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.7.1 " -"`__" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.7.1 `__" msgstr "" msgid "" @@ -15560,8 +15419,8 @@ msgid "" msgstr "" msgid "" -"`#2689 `__ When point " -"is a vertex, the withPoints family do not return results." +"`#2689 `__ When point is a " +"vertex, the withPoints family do not return results." msgstr "" msgid "C/C++ code enhancemet" @@ -15573,19 +15432,18 @@ msgstr "" msgid "pgRouting 3.7.0 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.7.0 " -"`__" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.7.0 `__" msgstr "" msgid "Support" msgstr "" msgid "" -"`#2656 `__ Stop support" -" of PostgreSQL12 on pgrouting v3.7" +"`#2656 `__ Stop support of " +"PostgreSQL12 on pgrouting v3.7" msgstr "" msgid "Stopping support of PostgreSQL 12" @@ -15615,9 +15473,8 @@ msgid "Experimental promoted to proposed." msgstr "" msgid "" -"`#2635 `__ " -"pgr_LineGraph ignores directed flag and use negative values for " -"identifiers." +"`#2635 `__ pgr_LineGraph " +"ignores directed flag and use negative values for identifiers." msgstr "" msgid "``pgr_lineGraph``" @@ -15632,13 +15489,13 @@ msgid "" msgstr "" msgid "" -"`#2607 `__ Read " -"postgresql data on C++" +"`#2607 `__ Read postgresql " +"data on C++" msgstr "" msgid "" -"`#2614 `__ Clang tidy " -"does not work" +"`#2614 `__ Clang tidy does " +"not work" msgstr "" msgid "pgRouting 3.6" @@ -15647,11 +15504,10 @@ msgstr "" msgid "pgRouting 3.6.3 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.6.3 " -"`__" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.6.3 `__" msgstr "" msgid "Explicit minimum requirements:" @@ -15682,8 +15538,8 @@ msgid "Add a clang tidy test on changed files." msgstr "" msgid "" -"Update test not done on versions: 3.0.1, 3.0.2, 3.0.3, 3.0.4, 3.1.0, " -"3.1.1, 3.1.2" +"Update test not done on versions: 3.0.1, 3.0.2, 3.0.3, 3.0.4, 3.1.0, 3.1.1, " +"3.1.2" msgstr "" msgid "Documentation" @@ -15707,11 +15563,10 @@ msgstr "" msgid "pgRouting 3.6.2 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.6.2 " -"`__" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.6.2 `__" msgstr "" msgid "Upgrade fix" @@ -15735,26 +15590,24 @@ msgstr "" msgid "pgRouting 3.6.1 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.6.1 " -"`_" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.6.1 `_" msgstr "" msgid "" -"`#2588 `__ pgrouting " -"3.6.0 fails to build on OSX" +"`#2588 `__ pgrouting 3.6.0 " +"fails to build on OSX" msgstr "" msgid "pgRouting 3.6.0 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.6.0 " -"`_" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.6.0 `_" msgstr "" msgid "" @@ -15794,16 +15647,15 @@ msgid "" msgstr "" msgid "" -"`#2504 `__ To C++ pg " -"data get, fetch and check." +"`#2504 `__ To C++ pg data " +"get, fetch and check." msgstr "" msgid "Stopping support for compilation with MSVC." msgstr "" msgid "" -"`#2505 `__ Using " -"namespace." +"`#2505 `__ Using namespace." msgstr "" msgid "" @@ -15817,18 +15669,18 @@ msgid "" msgstr "" msgid "" -"`#2521 `__ Dijkstra " -"code simplification." +"`#2521 `__ Dijkstra code " +"simplification." msgstr "" msgid "" -"`#2522 `__ bdAstar code" -" simplification." +"`#2522 `__ bdAstar code " +"simplification." msgstr "" msgid "" -"`#2490 `__ Automatic " -"page history links." +"`#2490 `__ Automatic page " +"history links." msgstr "" msgid "..rubric:: Standardize SQL" @@ -15840,8 +15692,7 @@ msgid "" msgstr "" msgid "" -"On new internal function: do not use named parameters and default " -"parameters." +"On new internal function: do not use named parameters and default parameters." msgstr "" msgid "pgRouting 3.5" @@ -15850,11 +15701,10 @@ msgstr "" msgid "pgRouting 3.5.1 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.5.1 " -"`_" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.5.1 `_" msgstr "" msgid "Documentation fixes" @@ -15895,8 +15745,8 @@ msgid "" msgstr "" msgid "" -"`#2559 `__ pgtap test" -" using sampledata" +"`#2559 `__ pgtap test " +"using sampledata" msgstr "" msgid "Build fixes" @@ -15914,11 +15764,10 @@ msgstr "" msgid "pgRouting 3.5.0 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.5.0 " -"`_" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.5.0 `_" msgstr "" msgid "Dijkstra" @@ -15930,16 +15779,15 @@ msgstr "" msgid "pgRouting 3.4.2 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.4.2 " -"`_" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.4.2 `_" msgstr "" msgid "" -"`#2394 `__: " -"pgr_bdAstar accumulates heuristic cost in visited node cost." +"`#2394 `__: pgr_bdAstar " +"accumulates heuristic cost in visited node cost." msgstr "" msgid "" @@ -15951,31 +15799,29 @@ msgstr "" msgid "pgRouting 3.4.1 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.4.1 " -"`_" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.4.1 `_" msgstr "" msgid "" -"`#2401 `__: pgRouting" -" 3.4.0 do not build docs when sphinx is too low or missing" +"`#2401 `__: pgRouting " +"3.4.0 do not build docs when sphinx is too low or missing" msgstr "" msgid "" -"`#2398 `__: v3.4.0 " -"does not upgrade from 3.3.3" +"`#2398 `__: v3.4.0 does " +"not upgrade from 3.3.3" msgstr "" msgid "pgRouting 3.4.0 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.4.0 " -"`_" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.4.0 `_" msgstr "" msgid "" @@ -16073,26 +15919,24 @@ msgstr "" msgid "pgRouting 3.3.4 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.3.4 " -"`_" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.3.4 `_" msgstr "" msgid "" -"`#2400 `__: pgRouting" -" 3.3.3 does not build in focal" +"`#2400 `__: pgRouting " +"3.3.3 does not build in focal" msgstr "" msgid "pgRouting 3.3.3 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.3.3 " -"`_" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.3.3 `_" msgstr "" msgid "" @@ -16103,11 +15947,10 @@ msgstr "" msgid "pgRouting 3.3.2 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.3.2 " -"`_" +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.3.2 `_" msgstr "" msgid "Revised documentation" @@ -16151,19 +15994,17 @@ msgid "" msgstr "" msgid "" -"`#2357 `__: Apply " -"clang-tidy performance-*" +"`#2357 `__: Apply clang-" +"tidy performance-*" msgstr "" msgid "pgRouting 3.3.1 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.3.1 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.3.1 `_ on Github." msgstr "" msgid "" @@ -16179,17 +16020,15 @@ msgstr "" msgid "pgRouting 3.3.0 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.3.0 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.3.0 `_ on Github." msgstr "" msgid "" -"`#2057 `__: " -"trspViaEdges columns in different order" +"`#2057 `__: trspViaEdges " +"columns in different order" msgstr "" msgid "" @@ -16272,33 +16111,29 @@ msgstr "" msgid "pgRouting 3.2.2 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.2.2 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.2.2 `_ on Github." msgstr "" msgid "" -"`#2093 `__: " -"Compilation on Visual Studio" +"`#2093 `__: Compilation " +"on Visual Studio" msgstr "" msgid "" -"`#2189 `__: Build " -"error on RHEL 7" +"`#2189 `__: Build error " +"on RHEL 7" msgstr "" msgid "pgRouting 3.2.1 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.2.1 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.2.1 `_ on Github." msgstr "" msgid "" @@ -16320,17 +16155,15 @@ msgstr "" msgid "pgRouting 3.2.0 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.2.0 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.2.0 `_ on Github." msgstr "" msgid "" -"`#1850 `__: Change " -"Boost min version to 1.56" +"`#1850 `__: Change Boost " +"min version to 1.56" msgstr "" msgid "Removing support for Boost v1.53, v1.54 & v1.55" @@ -16369,12 +16202,10 @@ msgstr "" msgid "pgRouting 3.1.4 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.1.4 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.1.4 `_ on Github." msgstr "" msgid "Issues fixes" @@ -16383,12 +16214,10 @@ msgstr "" msgid "pgRouting 3.1.3 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.1.3 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.1.3 `_ on Github." msgstr "" msgid "" @@ -16397,8 +16226,8 @@ msgid "" msgstr "" msgid "" -"`#1849 `__: Boost " -"1.75.0 geometry \"point_xy.hpp\" build error on macOS environment" +"`#1849 `__: Boost 1.75.0 " +"geometry \"point_xy.hpp\" build error on macOS environment" msgstr "" msgid "" @@ -16409,32 +16238,30 @@ msgstr "" msgid "pgRouting 3.1.2 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.1.2 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.1.2 `_ on Github." msgstr "" msgid "" -"`#1304 `__: FreeBSD " -"12 64-bit crashes on pgr_vrOneDepot tests Experimental Function" +"`#1304 `__: FreeBSD 12 " +"64-bit crashes on pgr_vrOneDepot tests Experimental Function" msgstr "" msgid "" -"`#1356 `__: " -"tools/testers/pg_prove_tests.sh fails when PostgreSQL port is not passed" +"`#1356 `__: tools/" +"testers/pg_prove_tests.sh fails when PostgreSQL port is not passed" msgstr "" msgid "" -"`#1725 `__: Server " -"crash on pgr_pickDeliver and pgr_vrpOneDepot on openbsd" +"`#1725 `__: Server crash " +"on pgr_pickDeliver and pgr_vrpOneDepot on openbsd" msgstr "" msgid "" -"`#1760 `__: TSP " -"server crash on ubuntu 20.04 #1760" +"`#1760 `__: TSP server " +"crash on ubuntu 20.04 #1760" msgstr "" msgid "" @@ -16445,18 +16272,15 @@ msgstr "" msgid "pgRouting 3.1.1 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.1.1 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.1.1 `_ on Github." msgstr "" msgid "" -"`#1733 `__: " -"pgr_bdAstar fails when source or target vertex does not exist in the " -"graph" +"`#1733 `__: pgr_bdAstar " +"fails when source or target vertex does not exist in the graph" msgstr "" msgid "" @@ -16482,12 +16306,10 @@ msgstr "" msgid "pgRouting 3.1.0 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.1.0 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.1.0 `_ on Github." msgstr "" msgid "pgr_dijkstra(combinations)" @@ -16508,23 +16330,19 @@ msgstr "" msgid "pgRouting 3.0.6 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.0.6 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.0.6 `_ on Github." msgstr "" msgid "pgRouting 3.0.5 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.0.5 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.0.5 `_ on Github." msgstr "" msgid "Backport issue fixes" @@ -16533,12 +16351,10 @@ msgstr "" msgid "pgRouting 3.0.4 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.0.4 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.0.4 `_ on Github." msgstr "" msgid "pgRouting 3.0.3 Release Notes" @@ -16547,12 +16363,10 @@ msgstr "" msgid "pgRouting 3.0.2 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.0.2 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.0.2 `_ on Github." msgstr "" msgid "" @@ -16563,28 +16377,24 @@ msgstr "" msgid "pgRouting 3.0.1 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.0.1 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.0.1 `_ on Github." msgstr "" msgid "" -"`#232 `__: Honor " -"client cancel requests in C /C++ code" +"`#232 `__: Honor client " +"cancel requests in C /C++ code" msgstr "" msgid "pgRouting 3.0.0 Release Notes" msgstr "" -#, python-format msgid "" -"To see all issues & pull requests closed by this release see the `Git " -"closed milestone for 3.0.0 " -"`_" -" on Github." +"To see all issues & pull requests closed by this release see the `Git closed " +"milestone for 3.0.0 `_ on Github." msgstr "" msgid "Fixed Issues" @@ -16596,8 +16406,8 @@ msgid "" msgstr "" msgid "" -"`#1188 `__: Removed " -"CGAL dependency" +"`#1188 `__: Removed CGAL " +"dependency" msgstr "" msgid "" @@ -16606,18 +16416,18 @@ msgid "" msgstr "" msgid "" -"`#1004 `__: Contracts" -" when forbidden vertices do not belong to graph" +"`#1004 `__: Contracts " +"when forbidden vertices do not belong to graph" msgstr "" msgid "" -"`#1005 `__: " -"Intermideate results eliminated" +"`#1005 `__: Intermideate " +"results eliminated" msgstr "" msgid "" -"`#1006 `__: No loss " -"of information" +"`#1006 `__: No loss of " +"information" msgstr "" msgid "New Functions" @@ -16896,17 +16706,15 @@ msgstr "" msgid "pgRouting 2.6.3 Release Notes" msgstr "" -#, python-format msgid "" -"To see the issues closed by this release see the `Git closed milestone " -"for 2.6.3 " -"`_" -" on Github." +"To see the issues closed by this release see the `Git closed milestone for " +"2.6.3 `_ on Github." msgstr "" msgid "" -"`#1219 `__ Implicit " -"cast for via_path integer to text" +"`#1219 `__ Implicit cast " +"for via_path integer to text" msgstr "" msgid "" @@ -16922,38 +16730,34 @@ msgstr "" msgid "pgRouting 2.6.2 Release Notes" msgstr "" -#, python-format msgid "" -"To see the issues closed by this release see the `Git closed milestone " -"for 2.6.2 " -"`_" -" on Github." +"To see the issues closed by this release see the `Git closed milestone for " +"2.6.2 `_ on Github." msgstr "" msgid "" -"`#1152 `__ Fixes " -"driving distance when vertex is not part of the graph" +"`#1152 `__ Fixes driving " +"distance when vertex is not part of the graph" msgstr "" msgid "" -"`#1098 `__ Fixes " -"windows test" +"`#1098 `__ Fixes windows " +"test" msgstr "" msgid "" -"`#1165 `__ Fixes " -"build for python3 and perl5" +"`#1165 `__ Fixes build " +"for python3 and perl5" msgstr "" msgid "pgRouting 2.6.1 Release Notes" msgstr "" -#, python-format msgid "" -"To see the issues closed by this release see the `Git closed milestone " -"for 2.6.1 " -"`_" -" on Github." +"To see the issues closed by this release see the `Git closed milestone for " +"2.6.1 `_ on Github." msgstr "" msgid "Fixes server crash on several functions." @@ -17046,20 +16850,18 @@ msgstr "" msgid "pgRouting 2.6.0 Release Notes" msgstr "" -#, python-format msgid "" -"To see the issues closed by this release see the `Git closed milestone " -"for 2.6.0 " -"`_" -" on Github." +"To see the issues closed by this release see the `Git closed milestone for " +"2.6.0 `_ on Github." msgstr "" msgid "pgr_lineGraphFull" msgstr "" msgid "" -"Fix pgr_trsp(text,integer,double precision,integer,double " -"precision,boolean,boolean[,text])" +"Fix pgr_trsp(text,integer,double precision,integer,double precision,boolean," +"boolean[,text])" msgstr "" msgid "without restrictions" @@ -17081,8 +16883,8 @@ msgid "Internal code" msgstr "" msgid "" -"Cleaned the internal code of trsp(text,integer,integer,boolean,boolean [," -" text])" +"Cleaned the internal code of trsp(text,integer,integer,boolean,boolean [, " +"text])" msgstr "" msgid "Removed the use of pointers" @@ -17100,12 +16902,10 @@ msgstr "" msgid "pgRouting 2.5.5 Release Notes" msgstr "" -#, python-format msgid "" -"To see the issues closed by this release see the `Git closed milestone " -"for 2.5.5 " -"`_" -" on Github." +"To see the issues closed by this release see the `Git closed milestone for " +"2.5.5 `_ on Github." msgstr "" msgid "Fixes driving distance when vertex is not part of the graph" @@ -17120,23 +16920,19 @@ msgstr "" msgid "pgRouting 2.5.4 Release Notes" msgstr "" -#, python-format msgid "" -"To see the issues closed by this release see the `Git closed milestone " -"for 2.5.4 " -"`_" -" on Github." +"To see the issues closed by this release see the `Git closed milestone for " +"2.5.4 `_ on Github." msgstr "" msgid "pgRouting 2.5.3 Release Notes" msgstr "" -#, python-format msgid "" -"To see the issues closed by this release see the `Git closed milestone " -"for 2.5.3 " -"`_" -" on Github." +"To see the issues closed by this release see the `Git closed milestone for " +"2.5.3 `_ on Github." msgstr "" msgid "" @@ -17147,12 +16943,10 @@ msgstr "" msgid "pgRouting 2.5.2 Release Notes" msgstr "" -#, python-format msgid "" -"To see the issues closed by this release see the `Git closed milestone " -"for 2.5.2 " -"`_" -" on Github." +"To see the issues closed by this release see the `Git closed milestone for " +"2.5.2 `_ on Github." msgstr "" msgid "Fix for postgresql 10.1: Removed a compiler condition" @@ -17161,12 +16955,10 @@ msgstr "" msgid "pgRouting 2.5.1 Release Notes" msgstr "" -#, python-format msgid "" -"To see the issues closed by this release see the `Git closed milestone " -"for 2.5.1 " -"`_" -" on Github." +"To see the issues closed by this release see the `Git closed milestone for " +"2.5.1 `_ on Github." msgstr "" msgid "Fixed prerequisite minimum version of: cmake" @@ -17177,9 +16969,8 @@ msgstr "" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.5.0 " -"`_" -" on Github." +"2.5.0 `_ on Github." msgstr "" msgid "enhancement:" @@ -17242,12 +17033,10 @@ msgstr "" msgid "pgRouting 2.4.2 Release Notes" msgstr "" -#, python-format msgid "" -"To see the issues closed by this release see the `Git closed milestone " -"for 2.4.2 " -"`_" -" on Github." +"To see the issues closed by this release see the `Git closed milestone for " +"2.4.2 `_ on Github." msgstr "" msgid "Improvement" @@ -17259,18 +17048,17 @@ msgstr "" msgid "Fixed: Unexpected error column \"cname\"" msgstr "" -msgid "Replace __linux__ with __GLIBC__ for glibc-specific headers and functions" +msgid "" +"Replace __linux__ with __GLIBC__ for glibc-specific headers and functions" msgstr "" msgid "pgRouting 2.4.1 Release Notes" msgstr "" -#, python-format msgid "" -"To see the issues closed by this release see the `Git closed milestone " -"for 2.4.1 " -"`_" -" on Github." +"To see the issues closed by this release see the `Git closed milestone for " +"2.4.1 `_ on Github." msgstr "" msgid "Fixed compiling error on macOS" @@ -17284,9 +17072,8 @@ msgstr "" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.4.0 " -"`_" -" on Github." +"2.4.0 `_ on Github." msgstr "" msgid "pgr_bdDijkstra" @@ -17318,9 +17105,8 @@ msgstr "" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.3.2 " -"`_" -" on Github." +"2.3.2 `_ on Github." msgstr "" msgid "Fixed pgr_gsoc_vrppdtw crash when all orders fit on one truck." @@ -17340,9 +17126,8 @@ msgstr "" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.3.1 " -"`_" -" on Github." +"2.3.1 `_ on Github." msgstr "" msgid "Leaks on proposed max_flow functions" @@ -17359,9 +17144,8 @@ msgstr "" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.3.0 " -"`_" -" on Github." +"2.3.0 `_ on Github." msgstr "" msgid "pgr_TSP" @@ -17441,9 +17225,8 @@ msgstr "" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.2.4 " -"`_" -" on Github." +"2.2.4 `_ on Github." msgstr "" msgid "Bogus uses of extern \"C\"" @@ -17460,9 +17243,8 @@ msgstr "" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.2.3 " -"`_" -" on Github." +"2.2.3 `_ on Github." msgstr "" msgid "Fixed compatibility issues with PostgreSQL 9.6." @@ -17473,9 +17255,8 @@ msgstr "" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.2.2 " -"`_" -" on Github." +"2.2.2 `_ on Github." msgstr "" msgid "Fixed regression error on pgr_drivingDistance" @@ -17486,9 +17267,8 @@ msgstr "" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.2.1 " -"`_" -" on Github." +"2.2.1 `_ on Github." msgstr "" msgid "Server crash fix on pgr_alphaShape" @@ -17502,9 +17282,8 @@ msgstr "" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.2.0 " -"`_" -" on Github." +"2.2.0 `_ on Github." msgstr "" msgid "Improvements" @@ -17602,9 +17381,8 @@ msgstr "" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.1.0 " -"`_" -" on Github." +"2.1.0 `_ on Github." msgstr "" msgid "Refactored" @@ -17614,13 +17392,13 @@ msgid "pgr_dijkstra(One to One)" msgstr "" msgid "" -"pgr_alphaShape function now can generate better (multi)polygon with holes" -" and alpha parameter." +"pgr_alphaShape function now can generate better (multi)polygon with holes " +"and alpha parameter." msgstr "" msgid "" -"Proposed functions from Steve Woodbridge, (Classified as Convenience by " -"the author.)" +"Proposed functions from Steve Woodbridge, (Classified as Convenience by the " +"author.)" msgstr "" msgid "" @@ -17629,8 +17407,8 @@ msgid "" msgstr "" msgid "" -"pgr_flipEdges - flip the edges in an array of geometries so the connect " -"end to end." +"pgr_flipEdges - flip the edges in an array of geometries so the connect end " +"to end." msgstr "" msgid "" @@ -17638,13 +17416,15 @@ msgid "" "geometries." msgstr "" -msgid "pgr_pointsToVids - convert an array of point geometries into vertex ids." +msgid "" +"pgr_pointsToVids - convert an array of point geometries into vertex ids." msgstr "" msgid "pgr_pointsToDMatrix - Create a distance matrix from an array of points." msgstr "" -msgid "pgr_vidsToDMatrix - Create a distance matrix from an array of vertix_id." +msgid "" +"pgr_vidsToDMatrix - Create a distance matrix from an array of vertix_id." msgstr "" msgid "Added proposed functions from GSoc Projects:" @@ -17717,8 +17497,8 @@ msgid "allow any-numerical on the cost/reverse_cost columns" msgstr "" msgid "" -"Instead of generating many libraries: - All functions are encapsulated in" -" one library - The library has the prefix 2-1-0" +"Instead of generating many libraries: - All functions are encapsulated in " +"one library - The library has the prefix 2-1-0" msgstr "" msgid "pgRouting 2.0" @@ -17738,15 +17518,14 @@ msgstr "" msgid "" "To see the issues closed by this release see the `Git closed issues for " -"2.0.0 " -"`_" -" on Github." +"2.0.0 `_ on Github." msgstr "" msgid "" "With the release of pgRouting 2.0.0 the library has abandoned backwards " -"compatibility to `pgRouting 1.0`_ releases. The main Goals for this " -"release are:" +"compatibility to `pgRouting 1.0`_ releases. The main Goals for this release " +"are:" msgstr "" msgid "Major restructuring of pgRouting." @@ -17780,16 +17559,15 @@ msgid "Important Changes" msgstr "" msgid "" -"Graph Analytics - tools for detecting and fixing connection some problems" -" in a graph" +"Graph Analytics - tools for detecting and fixing connection some problems in " +"a graph" msgstr "" msgid "A collection of useful utility functions" msgstr "" msgid "" -"Two new All Pairs Short Path algorithms (pgr_apspJohnson, " -"pgr_apspWarshall)" +"Two new All Pairs Short Path algorithms (pgr_apspJohnson, pgr_apspWarshall)" msgstr "" msgid "" @@ -17820,14 +17598,15 @@ msgid "" msgstr "" msgid "" -"Tested and fixed most all of the outstanding bugs reported against 1.x " -"that existing in the 2.0-dev code base." +"Tested and fixed most all of the outstanding bugs reported against 1.x that " +"existing in the 2.0-dev code base." msgstr "" msgid "Improved build process for Windows" msgstr "" -msgid "Automated testing on Linux and Windows platforms trigger by every commit" +msgid "" +"Automated testing on Linux and Windows platforms trigger by every commit" msgstr "" msgid "Modular library design" @@ -17867,11 +17646,10 @@ msgid "pgRouting 1.0" msgstr "" msgid "" -"To see the issues closed by this release see the `Git closed issues for " -"1.x " -"`_" -" on Github. The following release notes have been copied from the " -"previous ``RELEASE_NOTES`` file and are kept as a reference." +"To see the issues closed by this release see the `Git closed issues for 1.x " +"`_ on Github. The following release notes have been copied " +"from the previous ``RELEASE_NOTES`` file and are kept as a reference." msgstr "" msgid "Changes for release 1.05" @@ -17926,8 +17704,7 @@ msgid "PostgreSQL 8.2 support" msgstr "" msgid "" -"Shortest path functions return empty result if they could not find any " -"path" +"Shortest path functions return empty result if they could not find any path" msgstr "" msgid "Changes for release 0.9.8" @@ -17950,8 +17727,8 @@ msgstr "" msgid "" "The documentation provides very simple example queries based on a small " -"sample network that resembles a city. To be able to execute the majority " -"of the examples queries, follow the instructions below." +"sample network that resembles a city. To be able to execute the majority of " +"the examples queries, follow the instructions below." msgstr "" msgid "Main graph" @@ -17964,22 +17741,21 @@ msgid "The following city is to be inserted into the database:" msgstr "" msgid "" -"Information known at this point is the geometry of the edges, cost " -"values, capacity values, category values and some locations that are not " -"in the graph." +"Information known at this point is the geometry of the edges, cost values, " +"capacity values, category values and some locations that are not in the " +"graph." msgstr "" msgid "" -"The process to have working topology starts by inserting the edges. After" -" that everything else is calculated." +"The process to have working topology starts by inserting the edges. After " +"that everything else is calculated." msgstr "" msgid "" -"The database design for the documentation of pgRouting, keeps in the same" -" row 2 segments, one in the direction of the geometry and the second in " -"the opposite direction. Therefore some information has the ``reverse_`` " -"prefix which corresponds to the segment on the opposite direction of the " -"geometry." +"The database design for the documentation of pgRouting, keeps in the same " +"row 2 segments, one in the direction of the geometry and the second in the " +"opposite direction. Therefore some information has the ``reverse_`` prefix " +"which corresponds to the segment on the opposite direction of the geometry." msgstr "" msgid "Identifier of the starting vertex of the geometry ``geom``." @@ -18029,19 +17805,20 @@ msgid "Starting on PostgreSQL 12::" msgstr "" msgid "" -"Optionally indexes on different columns can be created. The " -"recommendation is to have" +"Optionally indexes on different columns can be created. The recommendation " +"is to have" msgstr "" msgid "``id`` indexed." msgstr "" -msgid "``source`` and ``target`` columns indexed to speed up pgRouting queries." +msgid "" +"``source`` and ``target`` columns indexed to speed up pgRouting queries." msgstr "" msgid "" -"``geom`` indexed to speed up geometry processes that might be needed in " -"the front end." +"``geom`` indexed to speed up geometry processes that might be needed in the " +"front end." msgstr "" msgid "For this small example the indexes are skipped, except for ``id``" @@ -18054,17 +17831,17 @@ msgid "Inserting into the database the information of the edges:" msgstr "" msgid "" -"Negative values on the cost, capacity and category means that the edge do" -" not exist." +"Negative values on the cost, capacity and category means that the edge do " +"not exist." msgstr "" msgid "Vertices" msgstr "" msgid "" -"The vertex information is calculated based on the identifier of the edge " -"and the geometry and saved on a table. Saving all the information " -"provided by :doc:`pgr_extractVertices`:" +"The vertex information is calculated based on the identifier of the edge and " +"the geometry and saved on a table. Saving all the information provided by :" +"doc:`pgr_extractVertices`:" msgstr "" msgid "" @@ -18104,13 +17881,13 @@ msgid "Support tables" msgstr "" msgid "" -"Many functions can be used with a combinations of ``(source, target)`` " -"pairs when wanting a route from ``source`` to ``target``." +"Many functions can be used with a combinations of ``(source, target)`` pairs " +"when wanting a route from ``source`` to ``target``." msgstr "" msgid "" -"For convenience of this documentation, some combinations will be stored " -"on a table:" +"For convenience of this documentation, some combinations will be stored on a " +"table:" msgstr "" msgid "Inserting the data:" @@ -18141,8 +17918,8 @@ msgid "Directed graph with ``cost`` and ``reverse_cost``" msgstr "" msgid "" -"When working with city networks, this is recommended for point of view of" -" vehicles." +"When working with city networks, this is recommended for point of view of " +"vehicles." msgstr "" msgid "Directed, with cost and reverse_cost" @@ -18152,8 +17929,8 @@ msgid "Undirected graph with ``cost`` and ``reverse_cost``" msgstr "" msgid "" -"When working with city networks, this is recommended for point of view of" -" pedestrians." +"When working with city networks, this is recommended for point of view of " +"pedestrians." msgstr "" msgid "Undirected, with cost and reverse cost" @@ -18189,42 +17966,39 @@ msgstr "" msgid "" "pgRouting community support is available through the `pgRouting website " -"`_, `documentation " -"`_, tutorials, mailing lists and others. If " -"you’re looking for :ref:`commercial support `, find " -"below a list of companies providing pgRouting development and consulting " -"services." +"`_, `documentation `_, tutorials, mailing lists and others. If you’re looking " +"for :ref:`commercial support `, find below a list of " +"companies providing pgRouting development and consulting services." msgstr "" msgid "Reporting Problems" msgstr "" msgid "" -"Bugs are reported and managed in an `issue tracker " -"`_. Please follow these " -"steps:" +"Bugs are reported and managed in an `issue tracker `_. Please follow these steps:" msgstr "" msgid "" -"Search the tickets to see if your problem has already been reported. If " -"so, add any extra context you might have found, or at least indicate that" -" you too are having the problem. This will help us prioritize common " -"issues." +"Search the tickets to see if your problem has already been reported. If so, " +"add any extra context you might have found, or at least indicate that you " +"too are having the problem. This will help us prioritize common issues." msgstr "" msgid "" -"If your problem is unreported, create a `new issue " -"`__ for it." +"If your problem is unreported, create a `new issue `__ for it." msgstr "" msgid "" -"In your report include explicit instructions to replicate your issue. The" -" best tickets include the exact SQL necessary to replicate a problem." +"In your report include explicit instructions to replicate your issue. The " +"best tickets include the exact SQL necessary to replicate a problem." msgstr "" msgid "" -"If you can test older versions of PostGIS for your problem, please do. On" -" your ticket, note the earliest version the problem appears." +"If you can test older versions of PostGIS for your problem, please do. On " +"your ticket, note the earliest version the problem appears." msgstr "" msgid "" @@ -18233,8 +18007,8 @@ msgid "" msgstr "" msgid "" -"It is recommended to use the following wrapper on the problem to pin " -"point the step that is causing the problem." +"It is recommended to use the following wrapper on the problem to pin point " +"the step that is causing the problem." msgstr "" msgid "Mailing List and GIS StackExchange" @@ -18246,30 +18020,28 @@ msgid "" msgstr "" msgid "" -"User mailing list: https://lists.osgeo.org/mailman/listinfo/pgrouting-" -"users" +"User mailing list: https://lists.osgeo.org/mailman/listinfo/pgrouting-users" msgstr "" msgid "" -"Developer mailing list: https://discourse.osgeo.org/c/pgrouting" -"/pgrouting-dev/" +"Developer mailing list: https://discourse.osgeo.org/c/pgrouting/pgrouting-" +"dev/" msgstr "" msgid "Subscribe: https://discourse.osgeo.org/g/pgrouting-dev" msgstr "" msgid "" -"For general questions and topics about how to use pgRouting, please write" -" to the user mailing list." +"For general questions and topics about how to use pgRouting, please write to " +"the user mailing list." msgstr "" msgid "" -"You can also ask at `GIS StackExchange `_" -" and tag the question with ``pgrouting``. Find all questions tagged with " -"``pgrouting`` under " -"https://gis.stackexchange.com/questions/tagged/pgrouting or subscribe to " -"the `pgRouting questions feed " -"`_." +"You can also ask at `GIS StackExchange `_ " +"and tag the question with ``pgrouting``. Find all questions tagged with " +"``pgrouting`` under https://gis.stackexchange.com/questions/tagged/pgrouting " +"or subscribe to the `pgRouting questions feed `_." msgstr "" msgid "Commercial Support" @@ -18277,8 +18049,8 @@ msgstr "" msgid "" "For users who require professional support, development and consulting " -"services, consider contacting any of the following organizations, which " -"have significantly contributed to the development of pgRouting:" +"services, consider contacting any of the following organizations, which have " +"significantly contributed to the development of pgRouting:" msgstr "" msgid "**Company**" @@ -18315,15 +18087,15 @@ msgid "Topology - Family of Functions" msgstr "" msgid "" -"The pgRouting's topology of a network represented with a graph in form of" -" two tables: and edge table and a vertex table." +"The pgRouting's topology of a network represented with a graph in form of " +"two tables: and edge table and a vertex table." msgstr "" msgid "" "Attributes associated to the tables help to indicate if the graph is " "directed or undirected, if an edge is one way on a directed graph, and " -"depending on the final application needs, suitable topology(s) need to be" -" created." +"depending on the final application needs, suitable topology(s) need to be " +"created." msgstr "" msgid "Utility functions" @@ -18333,8 +18105,8 @@ msgid "Transformation - Family of functions" msgstr "" msgid "" -"This family of functions is used for transforming a given input graph " -":math:`G(V,E)` into a new graph :math:`G'(V',E')`." +"This family of functions is used for transforming a given input graph :math:" +"`G(V,E)` into a new graph :math:`G'(V',E')`." msgstr "" msgid "Traversal - Family of functions" @@ -18349,15 +18121,14 @@ msgstr "" msgid "This category intends to solve the general problem:" msgstr "" -#, python-brace-format msgid "" -"Given a graph and a list of vertices, find the shortest path between " -":math:`vertex_i` and :math:`vertex_{i+1}` for all vertices" +"Given a graph and a list of vertices, find the shortest path between :math:" +"`vertex_i` and :math:`vertex_{i+1}` for all vertices" msgstr "" msgid "" -"In other words, find a continuous route that visits all the vertices in " -"the order given." +"In other words, find a continuous route that visits all the vertices in the " +"order given." msgstr "" msgid "path" @@ -18393,8 +18164,8 @@ msgid "When points are added to the graph." msgstr "" msgid "" -"The **with points** category modifies the graph on the fly by adding " -"points on edges as required by the `Points SQL`_ query." +"The **with points** category modifies the graph on the fly by adding points " +"on edges as required by the `Points SQL`_ query." msgstr "" msgid "" @@ -18403,16 +18174,16 @@ msgid "" msgstr "" msgid "" -"This category of functions was thought for routing vehicles, but might as" -" well work for some other application not involving vehicles." +"This category of functions was thought for routing vehicles, but might as " +"well work for some other application not involving vehicles." msgstr "" msgid "" -"When given a point identifier ``pid`` that its being mapped to an edge " -"with an identifier ``edge_id``, with a fraction from the source to the " -"target along the edge ``fraction`` and some additional information about " -"which side of the edge the point is on ``side``, then processing from " -"arbitrary points can be done on fixed networks." +"When given a point identifier ``pid`` that its being mapped to an edge with " +"an identifier ``edge_id``, with a fraction from the source to the target " +"along the edge ``fraction`` and some additional information about which side " +"of the edge the point is on ``side``, then processing from arbitrary points " +"can be done on fixed networks." msgstr "" msgid "" @@ -18432,7 +18203,8 @@ msgstr "" msgid "Arriving at the point:" msgstr "" -msgid "Compulsory arrival on the side of the segment where the point is located." +msgid "" +"Compulsory arrival on the side of the segment where the point is located." msgstr "" msgid "On either side of the segment." @@ -18451,11 +18223,12 @@ msgid "Some points are:" msgstr "" msgid "" -"**Permanent**: for example the set of points of clients stored in a table" -" in the data base." +"**Permanent**: for example the set of points of clients stored in a table in " +"the data base." msgstr "" -msgid "The graph has been modified to permanently have those points as vertices." +msgid "" +"The graph has been modified to permanently have those points as vertices." msgstr "" msgid "There is a table on the database that describes the points" @@ -18468,8 +18241,8 @@ msgid "The numbering of the points are handled with negative sign." msgstr "" msgid "" -"This sign change is to avoid confusion when there is a vertex with the " -"same identifier as the point identifier." +"This sign change is to avoid confusion when there is a vertex with the same " +"identifier as the point identifier." msgstr "" msgid "Original point identifiers are to be positive." @@ -18491,9 +18264,9 @@ msgid "About points" msgstr "" msgid "" -"For this section the following city (see :doc:`sampledata`) some " -"interesing points such as restaurant, supermarket, post office, etc. will" -" be used as example." +"For this section the following city (see :doc:`sampledata`) some interesting " +"points such as restaurant, supermarket, post office, etc. will be used as " +"example." msgstr "" msgid "The graph is **directed**" @@ -18520,14 +18293,14 @@ msgid "On both sides for point **6**." msgstr "" msgid "" -"The representation on the data base follows the `Points SQL`_ " -"description, and for this example:" +"The representation on the data base follows the `Points SQL`_ description, " +"and for this example:" msgstr "" msgid "Driving side" msgstr "" -msgid "In the the folowwing images:" +msgid "In the following images:" msgstr "" msgid "The squared vertices are the temporary vertices," @@ -18537,8 +18310,8 @@ msgid "The temporary vertices are added according to the driving side," msgstr "" msgid "" -"visually showing the differences on how depending on the driving side the" -" data is interpreted." +"visually showing the differences on how depending on the driving side the " +"data is interpreted." msgstr "" msgid "Point **1** located on edge ``(6, 5)``" @@ -18571,7 +18344,7 @@ msgstr "" msgid "Like having all points to be considered in both sides ``b``" msgstr "" -msgid "Prefered usage on **undirected** graphs" +msgid "Preferred usage on **undirected** graphs" msgstr "" msgid "On the :doc:`TRSP-family` this option is not valid" @@ -18590,8 +18363,8 @@ msgid "Creating temporary vertices" msgstr "" msgid "" -"This section will demonstrate how a temporary vertex is created " -"internally on the graph." +"This section will demonstrate how a temporary vertex is created internally " +"on the graph." msgstr "" msgid "Problem" @@ -18606,7 +18379,7 @@ msgstr "" msgid "On a right hand side driving network" msgstr "" -msgid "Arrival to point ``-2`` can be achived only via vertex **16**." +msgid "Arrival to point ``-2`` can be achieved only via vertex **16**." msgstr "" msgid "Does not affects edge ``(17, 16)``, therefore the edge is kept." @@ -18619,23 +18392,24 @@ msgid "Create two new edges:" msgstr "" msgid "" -"Edge ``(16, -2)`` with cost ``0.4`` (original cost * fraction == :math:`1" -" * 0.4`)" +"Edge ``(16, -2)`` with cost ``0.4`` (original cost * fraction == :math:`1 * " +"0.4`)" msgstr "" -msgid "Edge ``(-2, 17)`` with cost ``0.6`` (the remaing cost)" +msgid "Edge ``(-2, 17)`` with cost ``0.6`` (the remaining cost)" msgstr "" msgid "The total cost of the additional edges is equal to the original cost." msgstr "" -msgid "If more points are on the same edge, the process is repeated recursevly." +msgid "" +"If more points are on the same edge, the process is repeated recursevly." msgstr "" msgid "On a left hand side driving network" msgstr "" -msgid "Arrival to point ``-2`` can be achived only via vertex **17**." +msgid "Arrival to point ``-2`` can be achieved only via vertex **17**." msgstr "" msgid "Does not affects edge ``(16, 17)``, therefore the edge is kept." @@ -18645,27 +18419,27 @@ msgid "It only affects the edge ``(17, 16)``, therefore the edge is removed." msgstr "" msgid "" -"Work with the original edge ``(16, 17)`` as the fraction is a fraction of" -" the original:" +"Work with the original edge ``(16, 17)`` as the fraction is a fraction of " +"the original:" msgstr "" msgid "Flip the Edges and add them to the graph:" msgstr "" msgid "" -"Edge ``(17, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to " -"the graph." +"Edge ``(17, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the " +"graph." msgstr "" msgid "" -"Edge ``(-2, 16)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to " -"the graph." +"Edge ``(-2, 16)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the " +"graph." msgstr "" msgid "When driving side does not matter" msgstr "" -msgid "Arrival to point ``-2`` can be achived via vertices **16** or **17**." +msgid "Arrival to point ``-2`` can be achieved via vertices **16** or **17**." msgstr "" msgid "" @@ -18686,21 +18460,21 @@ msgid "Edge ``(-2, 17)`` is added to the graph." msgstr "" msgid "" -"Edge ``(16, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to " -"the graph." +"Edge ``(16, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the " +"graph." msgstr "" msgid "" -"Edge ``(-2, 17)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to " -"the graph." +"Edge ``(-2, 17)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the " +"graph." msgstr "" msgid "withPoints - Family of functions" msgstr "" msgid "" -"This family of functions belongs to the :doc:`withPoints-category` and " -"the functions that compose them are based one way or another on dijkstra " +"This family of functions belongs to the :doc:`withPoints-category` and the " +"functions that compose them are based one way or another on dijkstra " "algorithm." msgstr "" @@ -18724,4 +18498,3 @@ msgstr "" msgid "pgr_withPointsvia is pgr_dijkstraVia **with points**" msgstr "" - diff --git a/locale/es/LC_MESSAGES/pgrouting_doc_strings.po b/locale/es/LC_MESSAGES/pgrouting_doc_strings.po index c3c916f1a35..be02a75ebe0 100644 --- a/locale/es/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/es/LC_MESSAGES/pgrouting_doc_strings.po @@ -10,7 +10,7 @@ msgid "" msgstr "" "Project-Id-Version: pgRouting v3.8\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2025-04-08 20:49+0000\n" +"POT-Creation-Date: 2025-04-22 16:17-0600\n" "PO-Revision-Date: 2025-04-09 00:16+0000\n" "Last-Translator: Celia Virginia Vergara Castillo \n" "Language-Team: Spanish `__" +"milestone for 3.8.0 `__" msgstr "" "Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 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" +"versión, consulte la `meta cerrada 3.8.0 `_" -msgid "pgr_trspVia_withPoints" -msgstr "pgr_trspVia_withPoints" +msgid "Promotion to official function of pgRouting." +msgstr "Promoción a función oficial de pgRouting." -msgid "pgr_trsp_withPoints" -msgstr "pgr_trsp_withPoints" +#, fuzzy +msgid "" +"`#2772 `__: Promoted to " +"official pgr_extractVertices in version 3.8" +msgstr "" +"`#2772 `__: " +"pgr_extractVertices" -msgid "pgr_withPoints" -msgstr "pgr_withPoints" +msgid "Error messages adjustment." +msgstr "" -msgid "pgr_withPointsCost" -msgstr "pgr_withPointsCost" +msgid "Function promoted to official." +msgstr "Función promovida a oficial." -msgid "pgr_withPointsCostMatrix" -msgstr "pgr_withPointsCostMatrix" +#, fuzzy +msgid "" +"`#2760 `__: Promoted to " +"official pgr_degree in version 3.8" +msgstr "" +"`#2760 `__: pgr_degree" -msgid "pgr_withPointsDD" -msgstr "pgr_withPointsDD" +msgid "New signature with only Edges SQL." +msgstr "" -msgid "pgr_withPointsKSP" -msgstr "pgr_withPointsKSP" +#, fuzzy +msgid "" +"`#2774 `__: Promoted to " +"official pgr_findCloseEdges in version 3.8" +msgstr "" +"`#2774 `__: " +"pgr_findCloseEdges" -msgid "pgr_withPointsVia" -msgstr "pgr_withPointsVia" +msgid "``partial`` option is removed." +msgstr "Opción ``partial`` se elimina." -msgid "Signatures promoted to official" -msgstr "Firmas promovidas a oficial" +#, fuzzy +msgid "Proposed functions" +msgstr "Funciones propuestas" -msgid "pgr_aStar(Combinations)" -msgstr "pgr_aStar(Combinaciones)" +msgid "Contraction" +msgstr "Contracción" -msgid "pgr_aStarCost(Combinations)" -msgstr "pgr_aStarCost(Combinaciones)" +#, fuzzy +msgid "" +"`#2790 `__: " +"pgr_contractionDeadEnd new contraction function" +msgstr "" +"`#2790 `__: " +"pgr_contractionDeadEnd" -msgid "pgr_bdAstar(Combinations)" -msgstr "pgr_bdAstar(Combinaciones)" +#, fuzzy +msgid "" +"`#2791 `__: " +"pgr_contractionLinear new contraction function" +msgstr "" +"`#2791 `__: " +"pgr_contractionLinear" -msgid "pgr_bdAstarCost(Combinations)" -msgstr "pgr_bdAstarCost(Combinaciones)" +#, fuzzy +msgid "" +"`#2848 `__: Create " +"pgr_separateCrossing new utility function" +msgstr "" +"`#2786 `__: " +"pgr_contraction" -msgid "pgr_bdDijkstra(Combinations)" -msgstr "pgr_bdDijkstra(Combinaciones)" +#, fuzzy +msgid "" +"`#2849 `__: Create of " +"pgr_separateTouching new utility function" +msgstr "" +"`#2786 `__: " +"pgr_contraction" -msgid "pgr_bdDijkstraCost(Combinations)" -msgstr "pgr_bdDijkstraCost(Combinaciones)" +msgid "Official functions changes" +msgstr "Cambios en las funciones oficiales" -msgid "pgr_dijkstra(Combinations)" -msgstr "pgr_dijkstra(Combinaciones)" +#, fuzzy +msgid "" +"`#2786 `__: " +"pgr_contraction(edges) new signature" +msgstr "" +"`#2786 `__: " +"pgr_contraction" -msgid "pgr_dijkstraCost(Combinations)" -msgstr "pgr_dijkstraCost(Combinaciones)" +msgid "New signature:" +msgstr "Nueva firma:" -msgid "pgr_KSP(All signatures)" -msgstr "pgr_KSP(todas las firmas)" +msgid "" +"Previously compulsory parameter **Contraction order** is now optional with " +"name ``methods``." +msgstr "" +"El parámetro **Orden de contracción**, antes obligatorio, es ahora opcional " +"con el nombre ``methods``." -msgid "pgr_boykovKolmogorov(Combinations)" -msgstr "pgr_boykovKolmogorov(Combinaciones)" +msgid "New name and order of optional parameters." +msgstr "Nuevo nombre y orden de parámetros opcionales." -msgid "pgr_edmondsKarp(Combinations)" -msgstr "pgr_edmondsKarp(Combinaciones)" +msgid "" +"Deprecated signature pgr_contraction(text,bigint[],integer,bigint[],boolean)" +msgstr "Firma obsoleta pgr_contraction(text,bigint[],integer,bigint[],boolean)" -msgid "pgr_maxFlow(Combinations)" -msgstr "pgr_maxFlow(Combinaciones)" +msgid "C/C++ code enhancements" +msgstr "Mejora de código C/C++" -msgid "pgr_pushRelabel(Combinations)" -msgstr "pgr_pushRelabel(Combinaciones)" +#, fuzzy +msgid "" +"`#2802 `__: Code " +"reorganization on pgr_contraction" +msgstr "" +"`#2786 `__: " +"pgr_contraction" -msgid "code enhancements:" +#, fuzzy +msgid "SQL 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_contraction(text,bigint[],integer,bigint[],boolean)" -msgstr "pgr_contraction(text,bigint[],integer,bigint[],boolean)" - +#, fuzzy msgid "" -"pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean,text)" +"`#2850 `__: Rewrite " +"pgr_nodeNetwork" msgstr "" -"pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean,text)" +"`#2760 `__: pgr_degree" -msgid "pgr_trsp(text,integer,integer,boolean,boolean,text)" -msgstr "pgr_trsp(text,integer,integer,boolean,boolean,text)" +#, fuzzy +msgid "Deprecation of SQL functions" +msgstr "Funciones obsoletas." +#, fuzzy msgid "" -"pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +"`#2749 `__: Deprecate " +"pgr_AlphaShape in 3.8" msgstr "" -"pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" - -msgid "pgr_trspviavertices(text,anyarray,boolean,boolean,text)" -msgstr "pgr_trspviavertices(text,anyarray,boolean,boolean,text)" - -msgid "Removal of SQL deprecated internal functions" -msgstr "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)" +"`#2754 `__: " +"pgr_analyzeOneWay" +#, fuzzy msgid "" -"_pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean,text)" +"`#2750 `__: Deprecate " +"pgr_CreateTopology in 3.8" 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)" +"`#2750 `__: " +"pgr_createTopology" -msgid "_pgr_withpointsvia(text,bigint[],double precision[],boolean)" -msgstr "_pgr_withpointsvia(text,bigint[],double precision[],boolean)" +#, fuzzy +msgid "" +"`#2753 `__: Deprecate " +"pgr_analyzeGraph in 3.8" +msgstr "" +"`#2753 `__: " +"pgr_analyzeGraph" -msgid "_trsp(text,text,anyarray,anyarray,boolean)" -msgstr "_trsp(text,text,anyarray,anyarray,boolean)" +#, fuzzy +msgid "" +"`#2754 `__: Deprecate " +"pgr_analyzeOneWay in 3.8" +msgstr "" +"`#2754 `__: " +"pgr_analyzeOneWay" -msgid "_v4trsp(text,text,anyarray,anyarray,boolean)" -msgstr "_v4trsp(text,text,anyarray,anyarray,boolean)" +#, fuzzy +msgid "" +"`#2826 `__: Deprecate " +"pgr_createVerticesTable in 3.8" +msgstr "" +"`#2826 `__: " +"pgr_createVerticesTable" -msgid "_v4trsp(text,text,text,boolean)" -msgstr "_v4trsp(text,text,text,boolean)" +#, fuzzy +msgid "In the deprecated functions:" +msgstr "Función obsoleta." -msgid "Deprecation of internal C/C++ functions" -msgstr "Obsolescencia de funciones internas C/C++" +#, fuzzy +msgid "Migration section is created." +msgstr "Migración de restricciones" -msgid "Internal C/C++ functions in legacy" -msgstr "Funciones C/C++ internas en legado" +#, fuzzy +msgid "The use of the functions is removed in the documentation." +msgstr "La respuesta a esta pregunta dependerá de la aplicación." msgid "All releases" msgstr "Todas las versiones" @@ -5576,12 +5592,6 @@ msgstr "Obsoleto" msgid "`v3.4.0 `__" msgstr "`v3.4.0 `__" -msgid "Removed" -msgstr "Eliminado" - -msgid "`v4.0.0 `__" -msgstr "`v4.0.0 `__" - msgid ":doc:`pgr_dijkstra`" msgstr ":doc:`pgr_dijkstra`" @@ -6556,144 +6566,125 @@ msgstr "" "de atributos en las nuevas aristas, eliminar las aristas antiguas y " "actualizar la topología de encaminamiento." -msgid "Adding split edges" -msgstr "Añadir aristas divididas" +msgid "Fixing an intersection" +msgstr "Arreglando una intersección" msgid "" -"For each pair of crossing edges a process similar to this one must be " -"performed." +"In this example the original edge table will be used to store the additional " +"geometries." msgstr "" -"Para cada par de aristas de cruce debe realizarse un proceso similar a éste." -msgid "" -"The columns inserted and the way are calculated are based on the " -"application. For example, if the edges have a trait **name**, then that " -"column is to be copied." +msgid "An example use without results" msgstr "" -"Las columnas insertadas y la forma en que se calculan se basan en la " -"aplicación. Por ejemplo, si las aristas tienen un rasgo **nombre**, se " -"copiará esa columna." -msgid "For pgRouting calculations" -msgstr "Para llos cálculos de pgRouting" +msgid "Routing from :math:`1` to :math:`18` gives no solution." +msgstr "" -msgid "" -"**factor** based on the position of the intersection of the edges can be " -"used to adjust the ``cost`` and ``reverse_cost`` columns." +msgid "Analyze the network for intersections." msgstr "" -"Se puede utilizar un **factor** basado en la posición de la intersección de " -"las aristas para ajustar las columnas ``cost`` y ``reverse_cost``." -msgid "" -"Capacity information, used in the :doc:`flow-family` functions does not need " -"to change when splitting edges." +#, fuzzy +msgid "The analysis tell us that the network has an intersection." +msgstr "El análisis dice que la red tiene un hueco y una intersección." + +msgid "Prepare tables" +msgstr "Preparar tablas" + +msgid "Additional columns to control the origin of the segments." msgstr "" -"La información de capacidad, utilizada en las funciones :doc:`flow-family` " -"no necesita cambiar al dividir aristas." -msgid "Adding new vertices" +#, fuzzy +msgid "Adding new segments." msgstr "Añadiendo nuevos vértices" msgid "" -"After adding all the split edges required by the application, the newly " -"created vertices need to be added to the vertices table." +"Calling :doc:`pgr_separateCrossing` and adding the new segments to the edges " +"table." msgstr "" -"Después de añadir todas las aristas de división requeridas por la " -"aplicación, es necesario añadir los vértices recién creados a la tabla de " -"vértices." - -msgid "Updating edges topology" -msgstr "Actualizar la topología de aristas" -msgid "Removing the surplus edges" -msgstr "Eliminar las aristas sobrantes" +#, fuzzy +msgid "Update other values" +msgstr "Actualizar la topología" +#, fuzzy msgid "" -"Once all significant information needed by the application has been " -"transported to the new edges, then the crossing edges can be deleted." +"In this example only ``cost`` and ``reverse_cost`` are updated, where they " +"are based on the length of the geometry and the directionality is kept using " +"the ``sign`` function." msgstr "" -"Una vez que toda la información significativa que necesita la aplicación se " -"ha transportado a las nuevas aristas, se pueden eliminar las aristas de " -"cruce." +"Para este ejemplo los valores ``coste`` y ``coste_inverso`` van a ser el " +"doble de la longitud de la geometría." -msgid "" -"There are other options to do this task, like creating a view, or a " -"materialized view." -msgstr "" -"Existen otras opciones para realizar esta tarea, como crear una vista, o una " -"vista materializada." +msgid "Update the topology" +msgstr "Actualizar la topología" -msgid "Updating vertices topology" -msgstr "Actializar la topología de vértices" +#, fuzzy +msgid "Insert the new vertices if any." +msgstr "Inspeccionar la tabla de vértices" -msgid "To keep the graph consistent, the vertices topology needs to be updated" -msgstr "" -"Para mantener la coherencia del grafo, es necesario actualizar la topología " -"de los vértices" +msgid "Update source and target information on the edges table." +msgstr "Actualizar la salida y el destino en la tabla de aristas." -msgid "Checking for crossing edges" -msgstr "Comprobación del cruce de aristas" +msgid "The example has results" +msgstr "" -msgid "There are no crossing edges on the graph." -msgstr "No hay aristas que se crucen en el grafo." +#, fuzzy +msgid "Routing from :math:`1` to :math:`18` gives a solution." +msgstr "``agg_cost`` de :math:`v` a :math:`u` es :math:`\\infty`" -msgid "Disconnected graphs" -msgstr "Grafos desconectados" +#, fuzzy +msgid "Touching edges" +msgstr "Aristas que se cruzan" -msgid "To get the graph connectivity:" -msgstr "Para obtener la conectividad del grafo:" +msgid "Visually the edges seem to be connected, but internally they are not." +msgstr "" -msgid "" -"In this example, the component :math:`2` consists of vertices :math:`\\{2, " -"4\\}` and both vertices are also part of the dead end result set." +msgid "The validity of the information is application dependent." msgstr "" -"En este ejemplo, el componente :math:`2` está formado por vértices :math:" -"`\\{2, 4\\}` y ambos vértices también forman parte del conjunto de " -"resultados sin salida." -msgid "This graph needs to be connected." -msgstr "Este grafo debe estar conectado." +msgid "Maybe there is a small barrier for vehicles but not for pedestrians." +msgstr "" +#, fuzzy msgid "" -"With the original graph of this documentation, there would be 3 components " -"as the crossing edge in this graph is a different component." +"Once analyzed one by one the touchings, for the ones that need a local fix, " +"the edges need to be `split `__." msgstr "" -"Con el grafo original de esta documentación, habría 3 componentes, ya que la " -"arista de cruce en este grafo es un componente diferente." +"Una vez analizados uno a uno los cruces, para los que necesitan un arreglo " +"local, hay que `dividir las aristas `__." -msgid "Prepare storage for connection information" -msgstr "Preparar el almacenamiento de la información de conexión" +msgid "Fixing a gap" +msgstr "" -msgid "Save the vertices connection information" -msgstr "Guardar la información de conexión de los vértices" +#, fuzzy +msgid "Routing from :math:`1` to :math:`2` gives no solution." +msgstr "``agg_cost`` de :math:`v` a :math:`u` es :math:`\\infty`" -msgid "Save the edges connection information" -msgstr "Guardar la información de conexión de las aristas" +msgid "Analyze the network for gaps." +msgstr "Analizar la red por espacios." -msgid "Get the closest vertex" -msgstr "Obtener el vértice más cercano" +#, fuzzy +msgid "The analysis tell us that the network has a gap." +msgstr "El análisis dice que la red tiene un hueco y una intersección." msgid "" -"Using :doc:`pgr_findCloseEdges` the closest vertex to component :math:`1` is " -"vertex :math:`4`. And the closest edge to vertex :math:`4` is edge :math:" -"`14`." +"Calling :doc:`pgr_separateTouching` and adding the new segments to the edges " +"table." msgstr "" -"Usando :doc:`pgr_findCloseEdges` el vértice más cercano al componente :math:" -"`1` es el vértice :math:`4`. Y la arista más cercana al vértice :math:`4` es " -"la arista :math:`14`." -msgid "" -"The ``edge`` can be used to connect the components, using the ``fraction`` " -"information about the edge :math:`14` to split the connecting edge." -msgstr "" -"La arista ``edge`` se puede utilizar para conectar los componentes, " -"utilizando la información ``fraction`` sobre la arista :math:`14` para " -"dividir la arista de conexión." +#, fuzzy +msgid "Routing from :math:`1` to :math:`2` gives a solution." +msgstr "``agg_cost`` de :math:`v` a :math:`u` es :math:`\\infty`" msgid "Connecting components" msgstr "Conectando componentes" -msgid "There are three basic ways to connect the components" +msgid "To get the graph connectivity:" +msgstr "Para obtener la conectividad del grafo:" + +#, fuzzy +msgid "There are three basic ways to connect components:" msgstr "Existen tres formas básicas de conectar los componentes" msgid "From the vertex to the starting point of the edge" @@ -6708,19 +6699,35 @@ msgstr "Del vértice al vértice más cercano de la arista" msgid "This solution requires the edge to be split." msgstr "Esta solución requiere dividir el borde." -msgid "The following query shows the three ways to connect the components:" +msgid "" +"In this example :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` " +"will be used." msgstr "" -"La siguiente consulta muestra las tres formas de conectar los componentes:" -msgid "Checking components" -msgstr "Revisando componentes" +#, fuzzy +msgid "Get the connectivity" +msgstr "Para obtener la conectividad del grafo:" msgid "" -"Ignoring the edge that requires further work. The graph is now fully " -"connected as there is only one component." +"In this example: the edges table will need an additional column and the " +"vertex table will be rebuilt completely." msgstr "" -"Ignorando la arista que requiere más trabajo. El grafo está ahora totalmente " -"conectado, ya que sólo hay un componente." + +#, fuzzy +msgid "Insert new edges" +msgstr "Crear dos aristas nuevas:" + +msgid "" +"Using :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` insert the " +"results into the edges table." +msgstr "" + +msgid "Create the vertices table" +msgstr "Crear la tabla de vértices" + +#, fuzzy +msgid "Using :doc:`pgr_extractVertices` create the table." +msgstr ":doc:`pgr_extractVertices`" msgid "Contraction of a graph" msgstr "Contracción de un grafo" @@ -7590,10 +7597,10 @@ msgid "Upgrading the database" msgstr "Actualización de la base de datos" msgid "" -"To upgrade pgRouting in the database to version 4.0.0 use the following " +"To upgrade pgRouting in the database to version 3.8.0 use the following " "command:" msgstr "" -"Para actualizar pgRouting en la base de datos a la versión 4.0.0 utilice el " +"Para actualizar pgRouting en la base de datos a la versión 3.8.0 utilice el " "siguiente comando:" msgid "" @@ -8131,17 +8138,11 @@ 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 "Standardizing output columns to |nksp-result|" +msgstr "Estandarización de columnas de resultados a |nksp-result|" msgid "pgr_ksp(One to One)" msgstr "pgr_ksp(Uno a Uno)" @@ -8189,9 +8190,6 @@ msgstr "" msgid "|Boost| Boost Graph Inside" msgstr "|Boost| Adentro: Boost Graph" -msgid "Boost Graph Inside" -msgstr "Adentro: Boost Graph" - msgid "Signatures" msgstr "Firmas" @@ -8399,8 +8397,9 @@ msgstr "" msgid "When ``start_vid = 0 OR end_vid = 0``" msgstr "Cuando ``start_vid = 0 Ó end_vid = 0``" +#, fuzzy msgid "" -"The solutions generated is garanteed to be *twice as long as the optimal " +"The solutions generated are guaranteed to be *twice as long as the optimal " "tour in the worst case*" msgstr "" "Las soluciones generadas están garantizadas para ser *el doble de largas que " @@ -8409,8 +8408,9 @@ msgstr "" msgid "When ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``" msgstr "Cuando ``start_vid != 0 Y end_vid != 0 Y start_vid != end_vid``" +#, fuzzy msgid "" -"It is **not garanteed** that the solution will be, in the worse case, twice " +"It is **not guaranteed** that the solution will be, in the worst case, twice " "as long as the optimal tour, due to the fact that `end_vid` is forced to be " "in a fixed position." msgstr "" @@ -8421,8 +8421,9 @@ msgstr "" msgid "With ``directed => true``" msgstr "Con ``directed => true``" +#, fuzzy msgid "" -"It is **not garanteed** that the solution will be, in the worse case, twice " +"It is **not guaranteed** that the solution will be, in the worst case, twice " "as long as the optimal tour" msgstr "" "**No está garantizado** que la solución sea, en el peor de los casos, el " @@ -8483,9 +8484,6 @@ msgstr "pgr_TSP(`SQL de martiz`_, ``[start_id, end_id]``)" msgid "Returns set of |tsp-result|" msgstr "Regresa el conjunto de |nksp-result|" -msgid "OR EMTPY SET" -msgstr "O CONJUNTO VACÍO" - msgid "Using :doc:`pgr_dijkstraCostMatrix` to generate the matrix information" msgstr "" "Usando :doc:`pgr_dijkstraCostMatrix` para generar la información de la matriz" @@ -8543,7 +8541,7 @@ msgstr "Inicio en el vértice :math:`1`" msgid "**Line 6** ``start_vid => 1``" msgstr "**Linea 6** ``start_vid => 1``" -msgid "Using points of interest to generate an asymetric matrix." +msgid "Using points of interest to generate an asymmetric matrix." msgstr "Uso de puntos de interés para generar una matriz asimétrica." msgid "To generate an asymmetric matrix:" @@ -8556,7 +8554,7 @@ msgstr "" "**Línea 4** La información ``side`` de ``pointsOfInterset`` se ignora al no " "incluirla en la consulta" -msgid "**Line 6** Generating an asymetric matrix with ``directed => true``" +msgid "**Line 6** Generating an asymmetric matrix with ``directed => true``" msgstr "" "**Línea 6** Generación de una matriz asimétrica con ``directed => true``" @@ -8630,14 +8628,13 @@ msgstr "Cambio de nombre de pgr_eucledianTSP" msgid "New official function." msgstr "Nueva función oficial." +#, fuzzy msgid "" -"Any duplicated identifier will be ignored. The coordinates that will be kept" +"Any duplicated identifier will be ignored. The coordinates than will be kept " +"is arbitrarily." msgstr "" "Cualquier identificador duplicado será ignorado. Las coordenadas que se " -"mantendrán" - -msgid "is arbitrarly." -msgstr "es arbitrario." +"mantendrán son arbitrarias" msgid "" "The coordinates are quite similar for the same identifier, for example ::" @@ -8715,7 +8712,7 @@ msgid "Visual results" msgstr "Resultados visuales" msgid "" -"Visualy, The first image is the `optimal solution `__ and the second image is the solution " "obtained with ``pgr_TSPeuclidean``." msgstr "" @@ -8729,10 +8726,7 @@ 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|" +msgid "Standardizing output columns to |short-generic-result|" msgstr "Estandarización de las columnas de salida a |short-generic-result|" msgid "pgr_aStar(One to One) added ``start_vid`` and ``end_vid`` columns." @@ -8751,8 +8745,8 @@ msgstr "Versión 3.2.0" msgid "New proposed signature:" msgstr "Nuevas firmas propuesta:" -msgid "Function promoted to official." -msgstr "Función promovida a oficial." +msgid "pgr_aStar(Combinations)" +msgstr "pgr_aStar(Combinaciones)" msgid "Version 2.4.0" msgstr "Versión 2.4.0" @@ -8868,11 +8862,14 @@ 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 "" -"The ``pgr_aStarCost`` function sumarizes of the cost of the shortest path " +"The ``pgr_aStarCost`` function summarizes of the cost of the shortest path " "using the A* algorithm." msgstr "" "La función ``pgr_aStarCost`` suma el coste del camino más corto utilizando " @@ -8935,7 +8932,7 @@ msgstr "" "``pgr_aStarCostMatrix`` - Calcula la matriz de costes utilizando :doc:" "`pgr_aStar`." -msgid "Using internaly the :doc:`pgr_aStar` algorithm" +msgid "Using internally the :doc:`pgr_aStar` algorithm" msgstr "Usando internamente el algoritmo :doc:`pgr_aStar`" msgid "Returns a cost matrix." @@ -9622,6 +9619,9 @@ 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)" @@ -9671,8 +9671,11 @@ msgstr "" "``pgr_bdAstarCost`` - Coste total del camino más corto utilizando el " "algoritmo bidireccional A*." +msgid "pgr_bdAstarCost(Combinations)" +msgstr "pgr_bdAstarCost(Combinaciones)" + msgid "" -"The ``pgr_bdAstarCost`` function sumarizes of the cost of the shortest path " +"The ``pgr_bdAstarCost`` function summarizes of the cost of the shortest path " "using the bidirectional A* algorithm." msgstr "" "La función ``pgr_bdAstarCost`` suma el coste del camino más corto utilizando " @@ -9712,7 +9715,7 @@ msgstr "" "``pgr_bdAstarCostMatrix`` - Calcula la matriz de costes utilizando :doc:" "`pgr_aStar`." -msgid "Using internaly the :doc:`pgr_bdAstar` algorithm" +msgid "Using internally the :doc:`pgr_bdAstar` algorithm" msgstr "Usando internamente el algoritmo :doc:`pgr_bdAstar`" msgid "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" @@ -9728,6 +9731,9 @@ msgstr "" "``pgr_bdDijkstra`` - Devuelve el camino más corto utilizando el algoritmo " "Bidireccional de Dijkstra." +msgid "pgr_bdDijkstra(Combinations)" +msgstr "pgr_bdDijkstra(Combinaciones)" + msgid "pgr_bdDijkstra(One to Many)" msgstr "pgr_bdDijkstra(Uno a Muchos)" @@ -9815,8 +9821,11 @@ msgstr "" "``pgr_bdDijkstraCost`` - Devuelve el coste del camino más corto utilizando " "el algoritmo Bidireccional de Dijkstra." +msgid "pgr_bdDijkstraCost(Combinations)" +msgstr "pgr_bdDijkstraCost(Combinaciones)" + msgid "" -"The ``pgr_bdDijkstraCost`` function sumarizes of the cost of the shortest " +"The ``pgr_bdDijkstraCost`` function summarizes of the cost of the shortest " "path using the bidirectional Dijkstra Algorithm." msgstr "" "La función ``pgr_bdDijkstraCost`` sumarisa el costo de la ruta más corta " @@ -10014,6 +10023,9 @@ msgstr "" msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" msgstr "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" +msgid "Boost Graph Inside" +msgstr "Adentro: Boost Graph" + msgid "``pgr_betweennessCentrality`` - Experimental" msgstr "``pgr_betweennessCentrality`` - Experimental" @@ -10397,6 +10409,9 @@ msgstr "" "maximiza el flujo de las fuentes a los objetivos utilizando el algoritmo " "Boykov Kolmogorov." +msgid "pgr_boykovKolmogorov(Combinations)" +msgstr "pgr_boykovKolmogorov(Combinaciones)" + msgid "Renamed from ``pgr_maxFlowBoykovKolmogorov``" msgstr "Renombrado de ``pgr_maxFlowBoykovKolmogorov``" @@ -10709,23 +10724,6 @@ msgstr "" "``pgr_contraction`` — Realiza la contracción del grafo y devuelve los " "vértices y aristas contraídos.." -msgid "New signature:" -msgstr "Nueva firma:" - -msgid "" -"Previously compulsory parameter **Contraction order** is now optional with " -"name ``methods``." -msgstr "" -"El parámetro **Orden de contracción**, antes obligatorio, es ahora opcional " -"con el nombre ``methods``." - -msgid "New name and order of optional parameters." -msgstr "Nuevo nombre y orden de parámetros opcionales." - -msgid "" -"Deprecated signature pgr_contraction(text,bigint[],integer,bigint[],boolean)" -msgstr "Firma obsoleta pgr_contraction(text,bigint[],integer,bigint[],boolean)" - msgid "Name change from ``pgr_contractGraph``" msgstr "Cambio de nombre de ``pgr_contractGraph``" @@ -11666,9 +11664,6 @@ msgstr "Asegurarse de que la base de datos no tiene ``vertices_table``" msgid "Clean up the columns of the routing topology to be created" msgstr "Limpieza de las columnas de la topología de ruteo que se creará" -msgid "Create the vertices table" -msgstr "Crear la tabla de vértices" - msgid "" "When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, )``" msgstr "" @@ -12063,12 +12058,6 @@ msgstr "" "``pgr_degree`` - Para cada vértice de un grafo no dirigido, devuelve el " "número de aristas incidentes en el vértice." -msgid "Error messages adjustment." -msgstr "" - -msgid "New signature with only Edges SQL." -msgstr "" - msgid "Calculates the degree of the vertices of an undirected graph" msgstr "Calcula el grado de los vértices de un grafo no dirigido" @@ -12415,6 +12404,9 @@ msgstr "pgr_dijkstra(Muchos a Uno) ha añadido la columna ``start_vid``." msgid "Version 3.1.0" msgstr "Versión 3.1.0" +msgid "pgr_dijkstra(Combinations)" +msgstr "pgr_dijkstra(Combinaciones)" + msgid "Version 2.2.0" msgstr "Version 2.2.0" @@ -12661,9 +12653,12 @@ 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." +"The ``pgr_dijkstraCost`` function summarizes of the cost of the shortest " +"path using Dijkstra Algorithm." msgstr "" "La función ``pgr_dijkstraCost`` suma el coste del camino más corto " "utilizando el Algoritmo de Dijkstra." @@ -12880,7 +12875,7 @@ msgstr "**opcionales:** ``[directed, cap, global]``" msgid "Find the best pedestrian connection between two lines of buses" msgstr "Encuentra la mejor conexión peatonal entre dos líneas de autobuses" -msgid "Unsing an **undirected** graph for pedestrian routing" +msgid "Using an **undirected** graph for pedestrian routing" msgstr "Usando un grafo **no dirigido** para el ruteo de peatones" msgid "The first subway line stations are at :math:`\\{15, 16\\}`" @@ -12989,7 +12984,7 @@ msgstr "" "math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" msgid "" -"Both are equaly good as they have the same cost. (lines: `13` and `14` and " +"Both are equally good as they have the same cost. (lines: `13` and `14` and " "lines: `15` and `16`)" msgstr "" "Ambas son igualmente buenas, como también tienen el mismo costo. (lines: " @@ -13091,13 +13086,6 @@ msgstr "" "pgr_dijkstraNearCost(`SQL de aristas`_, `SQL de combinaciones`_, " "[**opciones**])" -msgid "" -"lines `3~4` sets the start vertices to be from the fisrt subway line and the " -"ending vertices to be from the second subway line" -msgstr "" -"líneas `3~4` establecen los vértices de inicio de la primera línea de metro " -"y los vértices finales de la segunda línea de metro" - msgid "" "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` " "(lines: `1`)" @@ -13105,7 +13093,8 @@ msgstr "" "La mejor es :math:`(11 \\rightarrow 16)` con un costo de :math:`1` (line: " "`1`)" -msgid "Both are equaly good as they have the same cost. (lines: `12` and `13`)" +msgid "" +"Both are equally good as they have the same cost. (lines: `12` and `13`)" msgstr "" "Ambos son igualmente buenos ya que tienen el mismo costo. (lines: `12` and " "`13`)" @@ -13222,7 +13211,7 @@ msgstr "" "``pgr_drivingDistance`` - Devuelve la distancia de manejo desde un nodo de " "inicio." -msgid "Standarizing output columns to |result-spantree|" +msgid "Standardizing output columns to |result-spantree|" msgstr "Estandarización de columnas de resultados a |result-spantree|" msgid "Added ``depth`` and ``start_vid`` result columns." @@ -13250,7 +13239,7 @@ msgstr "pgr_drivingDistance(múltiples vértices)" msgid "" "Using the Dijkstra algorithm, extracts all the nodes that have costs less " "than or equal to the value ``distance``. The edges extracted will conform to " -"the corresponding spaning tree." +"the corresponding spanning tree." msgstr "" "Usando el algoritmo Dijkstra, se extraen todos los nodos que tienen costes " "menores o iguales al valor ``distance``. Los bordes extraídos se ajustarán " @@ -13528,6 +13517,9 @@ 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``" @@ -13773,9 +13765,6 @@ msgstr "" "``pgr_findCloseEdges`` - Encuentra las aristas cercanas a una geometría " "puntual." -msgid "``partial`` option is removed." -msgstr "Opción ``partial`` se elimina." - msgid "" "``pgr_findCloseEdges`` - An utility function that finds the closest edge to " "a point geometry." @@ -14178,7 +14167,7 @@ msgid "``pgr_hawickCircuits`` - Experimental" msgstr "``pgr_hawickCircuits`` - Experimental" msgid "" -"``pgr_hawickCircuits`` — Returns the list of ciruits using hawick circuits " +"``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits " "algorithm." msgstr "" "``pgr_hawickCircuits`` — Enumeración de circuitos usando el algoritmo de " @@ -14227,8 +14216,8 @@ msgstr "" msgid "Time Complexity: :math:`O((V + E) (c + 1))`" msgstr "Complejidad temporal: :math:`O((V + E) (c + 1))`" -msgid ":math:`|c|` is the number of circuts in the graph." -msgstr ":math:`|c|` es la cantidad de vertices del grafo." +msgid ":math:`|c|` is the number of circuits in the graph." +msgstr ":math:`|c|` es la cantidad de circuitos en el grafo." msgid "pgr_hawickCircuits(`Edges SQL`_)" msgstr "pgr_hawickCircuits(`SQL de aristas`_)" @@ -14242,7 +14231,8 @@ msgstr "Circuitos dentro de los :doc:`sampledata` de pgRouting" msgid "Id of the circuit starting from ``1``" msgstr "Identificador del circuito comenzando con ``1``" -msgid "Relative postion in the path. Has value ``0`` for beginning of the path" +msgid "" +"Relative position in the path. Has value ``0`` for beginning of the path" msgstr "" "Posición relativa en la camino. Tiene el valor ``0`` para el inicio de la " "ruta" @@ -14355,8 +14345,7 @@ msgstr "" msgid "" "The Johnson algorithm, is a good choice to calculate the sum of the costs of " "the shortest path for each pair of nodes in the graph, for *sparse graphs*. " -"It usees the Boost's implementation which runs in :math:`O(V E \\log V)` " -"time," +"It uses the Boost's implementation which runs in :math:`O(V E \\log V)` time," msgstr "" "El algoritmo Johnson, es una buena opción para calcular la suma de los " "costos de la ruta más corta para cada par de nodos en el grafo, para *grafos " @@ -14521,7 +14510,7 @@ msgstr "" "todos los vértices." msgid "" -"The algorithm calculates the *immidiate dominator* of each vertex called " +"The algorithm calculates the *immediate dominator* of each vertex called " "**idom**, once **idom** of each vertex is calculated then by making every " "**idom** of each vertex as its parent, the dominator tree can be built." msgstr "" @@ -15026,8 +15015,8 @@ msgid "" "wanted." msgstr "" -msgid "Idenifying the restriction" -msgstr "" +msgid "Identifying the restriction" +msgstr "Identificando las restricciones" msgid "" "Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where the " @@ -15036,7 +15025,7 @@ msgstr "" msgid "" "The edge to be altered is ``WHERE cost = 0 AND seq != 1 AND edge != -1`` " -"from the previus query:" +"from the previous query:" msgstr "" msgid "Adding a value to the restriction" @@ -15268,6 +15257,9 @@ 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 "Calculates the maximum flow from the sources to the targets." msgstr "Calcula el flujo máximo de las fuentes a los objetivos." @@ -15451,6 +15443,15 @@ msgstr "" "La función carga los bordes de una tabla que no tiene los nodos en las " "intersecciones y reescribe los bordes con los nodos en una nueva tabla." +msgid "Not checking and not creating indexes." +msgstr "" + +msgid "Using ``pgr_separateTouching`` and ``pgr_separateCrossing``." +msgstr "" + +msgid "Created table with ``BIGINT``." +msgstr "" + msgid "" "A common problem associated with bringing GIS data into pgRouting is the " "fact that the data is often not \"noded\" correctly. This will create " @@ -15516,10 +15517,10 @@ msgstr "sub_id" msgid "``integer`` Segment number of the original edge" msgstr "``integer`` número del segmento del borde original" -msgid "``integer`` Empty source column" +msgid "``bigint`` Empty source column" msgstr "" -msgid "``integer`` Empty target column" +msgid "``bigint`` Empty target column" msgstr "" msgid "the geom" @@ -15534,18 +15535,9 @@ msgstr "Ejemplos" msgid "Create the topology for the data in :doc:`sampledata`" msgstr "Crear la topología para los datos en :doc:`sampledata`" -msgid "Analyze the network for intersections." -msgstr "" - -msgid "Analyze the network for gaps." -msgstr "Analizar la red por espacios." - msgid "The analysis tell us that the network has a gap and an intersection." msgstr "El análisis dice que la red tiene un hueco y una intersección." -msgid "Fixing an intersection" -msgstr "Encontrando una intersección" - msgid "Storing the intersections." msgstr "Almacenando las intersecciones." @@ -15559,27 +15551,18 @@ msgstr "" "Inspeccionar la tabla generada, podemos ver que las aristas 13 y 18 ha sido " "segmentados." -msgid "Update the topology" -msgstr "Actualizar la topología" - msgid "Add new segments to the edges table." msgstr "Agregar segmentos a la tabla de aristas." msgid "Insert the intersection as new vertices." msgstr "Insertar las intersecciones como nuevos vértices." -msgid "Update source and target information on the edges table." -msgstr "Actualizar la salida y el destino en la tabla de aristas." - msgid "Delete original edge." msgstr "Eliminar la arista original original." msgid "Update the vertex topology" msgstr "Actualizar la topología de vértices" -msgid "Fixing a gap" -msgstr "" - msgid "Store the deadends" msgstr "Almacenar los callejones sin salida" @@ -15912,6 +15895,9 @@ 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``" @@ -15930,6 +15916,61 @@ 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_separateCrossing``" +msgstr "``pgr_separateCrossing``" + +msgid "" +"``pgr_separateCrossing`` - From crossing geometries generates geometries " +"that do not cross." +msgstr "" + +msgid "This is an auxiliary function for separating crossing edges." +msgstr "Esta es una función auxiliar para separar aristas que se cruzan." + +msgid "pgr_separateCrossing(`Edges SQL`_, [``tolerance``, ``dryrun``])" +msgstr "pgr_separateCrossing(`Edges SQL`_, [``tolerance``, ``dryrun``])" + +msgid "RETURNS |result-separate|" +msgstr "REGRESA |result-separate|" + +msgid "Get the segments of the crossing geometries" +msgstr "" + +msgid "``tolerance``" +msgstr "``tolerance``" + +msgid "0.01" +msgstr "0.01" + +msgid "Used in ST_Snap before ST_Split" +msgstr "" + +msgid "Get the code for further refinement." +msgstr "" + +msgid "" +"When there are special details that need to be taken care of because of the " +"final application or the quality of the data, the code can be obtained On a " +"PostgreSQL ``NOTICE`` using the ``dryrun`` flag." +msgstr "" + +msgid "``pgr_separateTouching``" +msgstr "``pgr_separateTouching``" + +msgid "" +"``pgr_separateTouching`` - From touching geometries generates geometries " +"that are properly connected at endpoints" +msgstr "" + +msgid "" +"This is an auxiliary function for processing geometries that touch but don't " +"share exact endpoints, splitting them at their intersection points to " +"improve network connectivity." +msgstr "" + +msgid "pgr_separateTouching(`Edges SQL`_, [``tolerance``, ``dryrun``])" +msgstr "pgr_separateTouching(`Edges SQL`_, [``tolerance``, ``dryrun``])" + msgid "``pgr_sequentialVertexColoring`` - Proposed" msgstr "``pgr_sequentialVertexColoring`` - Propuesto" @@ -16260,7 +16301,7 @@ msgstr "" msgid "The returned values are not ordered" msgstr "Los valores devueltos no se ordenan" -msgid "The returned graph is compresed" +msgid "The returned graph is compressed" msgstr "" msgid "Running time: :math:`O(|V||E|)`" @@ -16301,8 +16342,8 @@ msgstr "" msgid "https://en.wikipedia.org/wiki/Transitive_closure" msgstr "https://en.wikipedia.org/wiki/Transitive_closure" -msgid "``pgr_trsp``" -msgstr "``pgr_trsp``" +msgid "``pgr_trsp`` - Proposed" +msgstr "``pgr_trsp`` - Propuesto" msgid "``pgr_trsp`` - routing vertices with restrictions." msgstr "``pgr_trsp`` - Ruteo con restricciones." @@ -16325,12 +16366,20 @@ msgstr "pgr_trsp(Combinaciones)" msgid "Deprecated signatures" msgstr "Firmas obsoletas" +msgid "pgr_trsp(text,integer,integer,boolean,boolean,text)" +msgstr "pgr_trsp(text,integer,integer,boolean,boolean,text)" + msgid "pgr_trsp(text,integer,float,integer,float,boolean,boolean,text)" msgstr "pgr_trsp(text,integer,float,integer,float,boolean,boolean,text)" msgid "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" msgstr "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" +msgid "" +"pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +msgstr "" +"pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" + msgid "New prototypes" msgstr "Nuevos prototipos" @@ -16421,8 +16470,8 @@ msgid "" msgstr "" "`Documentación obsoleta `_" -msgid "``pgr_trspVia``" -msgstr "``pgr_trspVia``" +msgid "``pgr_trspVia`` - Proposed" +msgstr "``pgr_trspVia`` - Propuesto" msgid "" "``pgr_trspVia`` Route that goes through a list of vertices with restrictions." @@ -16509,8 +16558,8 @@ msgstr "" msgid ":doc:`via-category`" msgstr ":doc:`via-category`" -msgid "``pgr_trspVia_withPoints``" -msgstr "``pgr_trspVia_withPoints``" +msgid "``pgr_trspVia_withPoints`` - Proposed" +msgstr "``pgr_trspVia_withPoints`` - Propuesto" msgid "" "``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/" @@ -16686,8 +16735,8 @@ msgid "" "`pgr_trsp` algorithm. In this case a U turn is been done using the same edge." msgstr "" -msgid "``pgr_trsp_withPoints``" -msgstr "``pgr_trsp_withPoints``" +msgid "``pgr_trsp_withPoints`` - Proposed" +msgstr "``pgr_trsp_withPoints`` - Propuesto" msgid "``pgr_trsp_withPoints`` Routing Vertex/Point with restrictions." msgstr "" @@ -16928,8 +16977,9 @@ msgstr "**No hay documentación disponible**" msgid "**TBD**" msgstr "**TBD**" -msgid "``pgr_withPoints``" -msgstr "``pgr_withPoints``" +#, fuzzy +msgid "``pgr_withPoints`` - Proposed" +msgstr "``pgr_withPoints`` - Propuesto" msgid "" "``pgr_withPoints`` - Returns the shortest path in a graph with additional " @@ -17104,8 +17154,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``" -msgstr "``pgr_withPointsCost``" +msgid "``pgr_withPointsCost`` - Proposed" +msgstr "``pgr_withPointsCost`` - Propuesto" msgid "" "``pgr_withPointsCost`` - Calculates the shortest path and returns only the " @@ -17288,8 +17338,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``" -msgstr "``pgr_withPointsCostMatrix``" +msgid "``pgr_withPointsCostMatrix`` - proposed" +msgstr "``pgr_withPointsCostMatrix`` - Propiesto" msgid "" "``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:" @@ -17328,8 +17378,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``" -msgstr "``pgr_withPointsDD``" +msgid "``pgr_withPointsDD`` - Proposed" +msgstr "``pgr_withPointsDD`` - Propuesto" msgid "" "``pgr_withPointsDD`` - Returns the driving **distance** from a starting " @@ -17502,8 +17552,8 @@ msgstr "" "Desde el punto :math:`1` dentro de una distancia de :math:`3.3`, sin " "importar el lado de manejo, detallada." -msgid "``pgr_withPointsKSP``" -msgstr "``pgr_withPointsKSP``" +msgid "``pgr_withPointsKSP`` - Proposed" +msgstr "``pgr_withPointsKSP`` - Propuesto" msgid "" "``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." @@ -17511,9 +17561,6 @@ msgstr "" "``pgr_withPointsKSP`` - Encuentra las rutas más cortas de K usando el " "algoritmo de Yen." -msgid "Standarizing output columns to |nksp-result|" -msgstr "" - msgid "pgr_withPointsKSP(One to One)" msgstr "pgr_withPointsKSP(Uno a Uno)" @@ -17686,8 +17733,8 @@ msgstr "" "Obtener :math:`2` rutas, usando topología de manejo por la derecha, desde el " "punto :math:`1` al punto :math:`2`, detallado y con rutas procesadas." -msgid "``pgr_withPointsVia``" -msgstr "``pgr_withPointsVia``" +msgid "``pgr_withPointsVia`` - Proposed" +msgstr "``pgr_withPointsVia`` - Propuesto" msgid "" "``pgr_withPointsVia`` - Route that goes through a list of vertices and/or " @@ -17805,6 +17852,14 @@ msgstr "" ":doc:`pgr_lineGraph` - Algoritmo de transformación para generar un grafo de " "líneas." +msgid ":doc:`pgr_separateCrossing` - Breaks geometries that cross each other." +msgstr "" + +msgid "" +":doc:`pgr_separateTouching` - Breaks geometries that (almost) touch each " +"other." +msgstr "" + msgid ":doc:`withPoints-family` - Functions based on Dijkstra algorithm." msgstr ":doc:`withPoints-family` - Funciones basadas en el algoritmo Dijkstra." @@ -17827,15 +17882,6 @@ msgstr "" msgid "Mayors" msgstr "" -msgid "pgRouting 4" -msgstr "pgRouting 4" - -msgid "Minors 4.x" -msgstr "" - -msgid "pgRouting 4.0" -msgstr "pgRouting 4.0" - msgid "pgRouting 3" msgstr "pgRouting 3" @@ -17845,108 +17891,42 @@ msgstr "" msgid "pgRouting 3.8" msgstr "pgRouting 3.8" -msgid "pgRouting 3.8.0 Release Notes" -msgstr "Notas de la versión de pgRouting 3.8.0" - -msgid "" -"To see all issues & pull requests closed by this release see the `Git closed " -"milestone for 3.8.0 `__" -msgstr "" -"Para ver todos los problemas y solicitudes de extracción cerrados para ésta " -"versión, consulte la `meta cerrada 3.8.0 `_" - -msgid "Promotion to official function of pgRouting." -msgstr "Promoción a función oficial de pgRouting." - +#, fuzzy msgid "" -"`#2772 `__: " -"pgr_extractVertices" +"`#2772 `__: Promote to " +"official pgr_extractVertices in 3.8" msgstr "" "`#2772 `__: " "pgr_extractVertices" +#, fuzzy msgid "" -"`#2760 `__: pgr_degree" +"`#2760 `__: Promote to " +"official pgr_degree in 3.8" msgstr "" "`#2760 `__: pgr_degree" +#, fuzzy msgid "" -"`#2774 `__: " -"pgr_findCloseEdges" +"`#2774 `__: Promote to " +"official pgr_findCloseEdges in 3.8" msgstr "" "`#2774 `__: " "pgr_findCloseEdges" -msgid "Deprecation of functions." -msgstr "Funciones obsoletas." - -#, fuzzy -msgid "" -"`#2749 `__: " -"pgr_alphaShape" -msgstr "" -"`#2754 `__: " -"pgr_analyzeOneWay" - -msgid "" -"`#2754 `__: " -"pgr_analyzeOneWay" -msgstr "" -"`#2754 `__: " -"pgr_analyzeOneWay" - -msgid "" -"`#2753 `__: " -"pgr_analyzeGraph" -msgstr "" -"`#2753 `__: " -"pgr_analyzeGraph" - -msgid "" -"`#2750 `__: " -"pgr_createTopology" -msgstr "" -"`#2750 `__: " -"pgr_createTopology" - -msgid "" -"`#2826 `__: " -"pgr_createVerticesTable" -msgstr "" -"`#2826 `__: " -"pgr_createVerticesTable" - -msgid "Official functions changes" -msgstr "Cambios en las funciones oficiales" - -msgid "" -"`#2786 `__: " -"pgr_contraction" -msgstr "" -"`#2786 `__: " -"pgr_contraction" - msgid "New proposed functions" msgstr "Nuevas funciones propuestas" -msgid "Contraction" -msgstr "Contracción" +msgid "Deprecation of functions." +msgstr "Funciones obsoletas." -msgid "" -"`#2790 `__: " -"pgr_contractionDeadEnd" -msgstr "" -"`#2790 `__: " -"pgr_contractionDeadEnd" +#, fuzzy +msgid "Deprecated functions:" +msgstr "Función obsoleta." -msgid "" -"`#2791 `__: " -"pgr_contractionLinear" -msgstr "" -"`#2791 `__: " -"pgr_contractionLinear" +#, fuzzy +msgid "The use removed." +msgstr "``n_seq`` se elimina" msgid "pgRouting 3.7" msgstr "pgRouting 3.7" @@ -18302,9 +18282,6 @@ msgstr "" "`#2546 `__ Estandarización " "de resultados y modificación de firmas de pgr_withPointsKSP" -msgid "C/C++ code enhancements" -msgstr "Mejora de código C/C++" - msgid "" "`#2504 `__ To C++ pg data " "get, fetch and check." @@ -18555,6 +18532,12 @@ msgstr "pgr_trspVia(Una Vía)" msgid "pgr_trspVia_withPoints(One Via)" msgstr "pgr_trspVia_withPoints(Una Vía)" +msgid "pgr_trsp" +msgstr "pgr_trsp" + +msgid "``pgr_trsp_withPoints``" +msgstr "``pgr_trsp_withPoints``" + msgid "pgr_trsp_withPoints(One to One)" msgstr "pgr_trsp_withPoints(Uno a Uno)" @@ -18573,9 +18556,6 @@ msgstr "pgr_trsp_withPoints(Combinaciones)" msgid "Topology" msgstr "Topología" -msgid "Utilities" -msgstr "Utilidades" - msgid "pgr_findCloseEdges(One point)" msgstr "pgr_findCloseEdges(Un punto)" @@ -20072,6 +20052,9 @@ msgstr "pgr_TSP" msgid "pgr_eucledianTSP" msgstr "pgr_eucledianTSP" +msgid "pgr_withPointsCostMatrix" +msgstr "pgr_withPointsCostMatrix" + msgid "pgr_maxFlowPushRelabel(One to One)" msgstr "pgr_maxFlowPushRelabel(Uno a Uno)" @@ -20279,6 +20262,9 @@ 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" @@ -21139,16 +21125,8 @@ msgid "" "created." msgstr "" -msgid "" -"pgRouting supplies some functions to create a routing topology and to " -"analyze the topology." -msgstr "" - -msgid "Additional functions to create a graph:" -msgstr "" - -msgid "Additional functions to analyze a graph:" -msgstr "" +msgid "Utility functions" +msgstr "Funciones utilitarias" msgid "Transformation - Family of functions" msgstr "Transformación - Familia de funciones" @@ -21342,7 +21320,7 @@ msgid "About points" msgstr "Sobre los puntos" msgid "" -"For this section the following city (see :doc:`sampledata`) some interesing " +"For this section the following city (see :doc:`sampledata`) some interesting " "points such as restaurant, supermarket, post office, etc. will be used as " "example." msgstr "" @@ -21389,7 +21367,8 @@ msgstr "" msgid "Driving side" msgstr "Lado de manejo" -msgid "In the the folowwing images:" +#, fuzzy +msgid "In the following images:" msgstr "En las siguientes imágenes:" msgid "The squared vertices are the temporary vertices," @@ -21436,7 +21415,7 @@ msgid "Like having all points to be considered in both sides ``b``" msgstr "" "Como si se tuvieran todos los puntos en ambos lados considerados como ``b``" -msgid "Prefered usage on **undirected** graphs" +msgid "Preferred usage on **undirected** graphs" msgstr "Uso preferido en grafos **no dirigidos**" msgid "On the :doc:`TRSP-family` this option is not valid" @@ -21471,7 +21450,7 @@ msgstr "" msgid "On a right hand side driving network" msgstr "En una red de conducción del lado derecho" -msgid "Arrival to point ``-2`` can be achived only via vertex **16**." +msgid "Arrival to point ``-2`` can be achieved only via vertex **16**." msgstr "Llegada al punto ``-2`` se logra solo vía el vértice **16**." msgid "Does not affects edge ``(17, 16)``, therefore the edge is kept." @@ -21488,7 +21467,7 @@ msgid "" "0.4`)" msgstr "" -msgid "Edge ``(-2, 17)`` with cost ``0.6`` (the remaing cost)" +msgid "Edge ``(-2, 17)`` with cost ``0.6`` (the remaining cost)" msgstr "" msgid "The total cost of the additional edges is equal to the original cost." @@ -21501,7 +21480,7 @@ msgstr "" msgid "On a left hand side driving network" msgstr "En una red de conducción del lado izquierdo" -msgid "Arrival to point ``-2`` can be achived only via vertex **17**." +msgid "Arrival to point ``-2`` can be achieved only via vertex **17**." msgstr "Llegada al punto ``-2`` se logra solo vía el vértice **17**." msgid "Does not affects edge ``(16, 17)``, therefore the edge is kept." @@ -21531,8 +21510,8 @@ msgstr "" msgid "When driving side does not matter" msgstr "Cuando el lado de conducción no importa" -msgid "Arrival to point ``-2`` can be achived via vertices **16** or **17**." -msgstr "" +msgid "Arrival to point ``-2`` can be achieved via vertices **16** or **17**." +msgstr "Llegada al punto ``-2`` se logra vía el vértice **16** o **17**." msgid "" "Affects the edges ``(16, 17)`` and ``(17, 16)``, therefore the edges are " @@ -21592,4 +21571,3 @@ msgstr "pgr_withPointsDD es pgr_drivingDistance **con puntos**" msgid "pgr_withPointsvia is pgr_dijkstraVia **with points**" msgstr "pgr_withPoints es pgr_dijkstraVia **con puntos**" - diff --git a/locale/pot/pgrouting_doc_strings.pot b/locale/pot/pgrouting_doc_strings.pot index fea6f2df249..6a8b6195d67 100644 --- a/locale/pot/pgrouting_doc_strings.pot +++ b/locale/pot/pgrouting_doc_strings.pot @@ -8,7 +8,7 @@ msgid "" msgstr "" "Project-Id-Version: pgRouting v3.8\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2025-04-18 23:09+0000\n" +"POT-Creation-Date: 2025-04-22 16:17-0600\n" "PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n" "Last-Translator: FULL NAME \n" "Language-Team: LANGUAGE \n" @@ -268,6 +268,9 @@ msgstr "" msgid ":ref:`search`" msgstr "" +msgid "Boost Graph inside" +msgstr "" + msgid "DFS - Category" msgstr "" @@ -1036,7 +1039,7 @@ msgstr "" msgid "Current vehicle identifier." msgstr "" -msgid "Sumary row has the **total capacity violations**." +msgid "Summary row has the **total capacity violations**." msgstr "" msgid "A capacity violation happens when overloading or underloading a vehicle." @@ -1051,7 +1054,7 @@ msgstr "" msgid "Sequential value starting from **1** for the stops made by the current vehicle. The :math:`m_{th}` stop of the current vehicle." msgstr "" -msgid "Sumary row has the **total time windows violations**." +msgid "Summary row has the **total time windows violations**." msgstr "" msgid "A time window violation happens when arriving after the location has closed." @@ -1423,7 +1426,7 @@ msgstr "" msgid "For the following equivalences :math:`10m/s \\approx 600m/min \\approx 36 km/hr`" msgstr "" -msgid "Working with time units in seconds and the matrix been in meters: For a 1000m lenght value on the matrix:" +msgid "Working with time units in seconds and the matrix been in meters: For a 1000m length value on the matrix:" msgstr "" msgid "Units" @@ -1714,7 +1717,7 @@ msgstr "" msgid "trusty" msgstr "" -msgid "posgreSQL version 9.3" +msgid "PostgreSQL version 9.3" msgstr "" msgid "Data" @@ -3526,7 +3529,7 @@ msgstr "" msgid "Promotion to official function of pgRouting." msgstr "" -msgid "`#2772 `__: pgr_extractVertices" +msgid "`#2772 `__: Promoted to official pgr_extractVertices in version 3.8" msgstr "" msgid "Error messages adjustment." @@ -3535,40 +3538,40 @@ msgstr "" msgid "Function promoted to official." msgstr "" -msgid "`#2760 `__: pgr_degree" +msgid "`#2760 `__: Promoted to official pgr_degree in version 3.8" msgstr "" msgid "New signature with only Edges SQL." msgstr "" -msgid "`#2774 `__: pgr_findCloseEdges" +msgid "`#2774 `__: Promoted to official pgr_findCloseEdges in version 3.8" msgstr "" msgid "``partial`` option is removed." msgstr "" -msgid "Deprecation of functions." +msgid "Proposed functions" msgstr "" -msgid "`#2749 `__: pgr_alphaShape" +msgid "Contraction" msgstr "" -msgid "`#2754 `__: pgr_analyzeOneWay" +msgid "`#2790 `__: pgr_contractionDeadEnd new contraction function" msgstr "" -msgid "`#2753 `__: pgr_analyzeGraph" +msgid "`#2791 `__: pgr_contractionLinear new contraction function" msgstr "" -msgid "`#2750 `__: pgr_createTopology" +msgid "`#2848 `__: Create pgr_separateCrossing new utility function" msgstr "" -msgid "`#2826 `__: pgr_createVerticesTable" +msgid "`#2849 `__: Create of pgr_separateTouching new utility function" msgstr "" msgid "Official functions changes" msgstr "" -msgid "`#2786 `__: pgr_contraction" +msgid "`#2786 `__: pgr_contraction(edges) new signature" msgstr "" msgid "New signature:" @@ -3586,25 +3589,40 @@ msgstr "" msgid "C/C++ code enhancements" msgstr "" -msgid "`#2802 `__: Code factorization on pgr_contraction family" +msgid "`#2802 `__: Code reorganization on pgr_contraction" msgstr "" -msgid "New proposed functions" +msgid "SQL code enhancements" msgstr "" -msgid "Contraction" +msgid "`#2850 `__: Rewrite pgr_nodeNetwork" +msgstr "" + +msgid "Deprecation of SQL functions" +msgstr "" + +msgid "`#2749 `__: Deprecate pgr_AlphaShape in 3.8" +msgstr "" + +msgid "`#2750 `__: Deprecate pgr_CreateTopology in 3.8" msgstr "" -msgid "`#2790 `__: pgr_contractionDeadEnd" +msgid "`#2753 `__: Deprecate pgr_analyzeGraph in 3.8" msgstr "" -msgid "`#2791 `__: pgr_contractionLinear" +msgid "`#2754 `__: Deprecate pgr_analyzeOneWay in 3.8" msgstr "" -msgid "`#2848 `__: pgr_separateCrossing" +msgid "`#2826 `__: Deprecate pgr_createVerticesTable in 3.8" msgstr "" -msgid "`#2849 `__: pgr_separateTouching" +msgid "In the deprecated functions:" +msgstr "" + +msgid "Migration section is created." +msgstr "" + +msgid "The use of the functions is removed in the documentation." msgstr "" msgid "All releases" @@ -6235,7 +6253,7 @@ msgstr "" msgid "Version 3.6.0" msgstr "" -msgid "Result columns standarized to: |nksp-result|" +msgid "Standardizing output columns to |nksp-result|" msgstr "" msgid "pgr_ksp(One to One)" @@ -6280,9 +6298,6 @@ msgstr "" msgid "|Boost| Boost Graph Inside" msgstr "" -msgid "Boost Graph inside" -msgstr "" - msgid "Signatures" msgstr "" @@ -6436,19 +6451,19 @@ msgstr "" msgid "When ``start_vid = 0 OR end_vid = 0``" msgstr "" -msgid "The solutions generated is garanteed to be *twice as long as the optimal tour in the worst case*" +msgid "The solutions generated are guaranteed to be *twice as long as the optimal tour in the worst case*" msgstr "" msgid "When ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``" msgstr "" -msgid "It is **not garanteed** that the solution will be, in the worse case, twice as long as the optimal tour, due to the fact that `end_vid` is forced to be in a fixed position." +msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour, due to the fact that `end_vid` is forced to be in a fixed position." msgstr "" msgid "With ``directed => true``" msgstr "" -msgid "It is **not garanteed** that the solution will be, in the worse case, twice as long as the optimal tour" +msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour" msgstr "" msgid "is directed" @@ -6484,9 +6499,6 @@ msgstr "" msgid "Returns set of |tsp-result|" msgstr "" -msgid "OR EMTPY SET" -msgstr "" - msgid "Using :doc:`pgr_dijkstraCostMatrix` to generate the matrix information" msgstr "" @@ -6535,7 +6547,7 @@ msgstr "" msgid "**Line 6** ``start_vid => 1``" msgstr "" -msgid "Using points of interest to generate an asymetric matrix." +msgid "Using points of interest to generate an asymmetric matrix." msgstr "" msgid "To generate an asymmetric matrix:" @@ -6544,7 +6556,7 @@ msgstr "" msgid "**Line 4** The ``side`` information of ``pointsOfInterset`` is ignored by not including it in the query" msgstr "" -msgid "**Line 6** Generating an asymetric matrix with ``directed => true``" +msgid "**Line 6** Generating an asymmetric matrix with ``directed => true``" msgstr "" msgid ":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered as the ``agg_cost``" @@ -6589,10 +6601,7 @@ msgstr "" msgid "New official function." msgstr "" -msgid "Any duplicated identifier will be ignored. The coordinates that will be kept" -msgstr "" - -msgid "is arbitrarly." +msgid "Any duplicated identifier will be ignored. The coordinates than will be kept is arbitrarily." msgstr "" msgid "The coordinates are quite similar for the same identifier, for example ::" @@ -6652,7 +6661,7 @@ msgstr "" msgid "Visual results" msgstr "" -msgid "Visualy, The first image is the `optimal solution `__ and the second image is the solution obtained with ``pgr_TSPeuclidean``." +msgid "Visually, The first image is the `optimal solution `__ and the second image is the solution obtained with ``pgr_TSPeuclidean``." msgstr "" msgid "``pgr_aStar``" @@ -6661,7 +6670,7 @@ msgstr "" msgid "``pgr_aStar`` — Shortest path using the A* algorithm." msgstr "" -msgid "Standarizing output columns to |short-generic-result|" +msgid "Standardizing output columns to |short-generic-result|" msgstr "" msgid "pgr_aStar(One to One) added ``start_vid`` and ``end_vid`` columns." @@ -6769,7 +6778,7 @@ msgstr "" msgid "New proposed function." msgstr "" -msgid "The ``pgr_aStarCost`` function sumarizes of the cost of the shortest path using the A* algorithm." +msgid "The ``pgr_aStarCost`` function summarizes of the cost of the shortest path using the A* algorithm." msgstr "" msgid "Let be the case the values returned are stored in a table, so the unique index would be the pair: `(start_vid, end_vid)`" @@ -6814,7 +6823,7 @@ msgstr "" msgid "``pgr_aStarCostMatrix`` - Calculates the a cost matrix using :doc:`pgr_aStar`." msgstr "" -msgid "Using internaly the :doc:`pgr_aStar` algorithm" +msgid "Using internally the :doc:`pgr_aStar` algorithm" msgstr "" msgid "Returns a cost matrix." @@ -7333,7 +7342,7 @@ msgstr "" msgid "pgr_bdAstarCost(Combinations)" msgstr "" -msgid "The ``pgr_bdAstarCost`` function sumarizes of the cost of the shortest path using the bidirectional A* algorithm." +msgid "The ``pgr_bdAstarCost`` function summarizes of the cost of the shortest path using the bidirectional A* algorithm." msgstr "" msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])" @@ -7357,7 +7366,7 @@ msgstr "" msgid "``pgr_bdAstarCostMatrix`` - Calculates the a cost matrix using :doc:`pgr_aStar`." msgstr "" -msgid "Using internaly the :doc:`pgr_bdAstar` algorithm" +msgid "Using internally the :doc:`pgr_bdAstar` algorithm" msgstr "" msgid "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" @@ -7438,7 +7447,7 @@ msgstr "" msgid "pgr_bdDijkstraCost(Combinations)" msgstr "" -msgid "The ``pgr_bdDijkstraCost`` function sumarizes of the cost of the shortest path using the bidirectional Dijkstra Algorithm." +msgid "The ``pgr_bdDijkstraCost`` function summarizes of the cost of the shortest path using the bidirectional Dijkstra Algorithm." msgstr "" msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])" @@ -9424,9 +9433,6 @@ msgstr "" msgid "37) Using `Combinations`_" msgstr "" -msgid "e Also" -msgstr "" - msgid "`Boost: Dijkstra shortest paths `__" msgstr "" @@ -9442,7 +9448,7 @@ msgstr "" msgid "pgr_dijkstraCost(Combinations)" msgstr "" -msgid "The ``pgr_dijkstraCost`` function sumarizes of the cost of the shortest path using Dijkstra Algorithm." +msgid "The ``pgr_dijkstraCost`` function summarizes of the cost of the shortest path using Dijkstra Algorithm." msgstr "" msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" @@ -9595,7 +9601,7 @@ msgstr "" msgid "Find the best pedestrian connection between two lines of buses" msgstr "" -msgid "Unsing an **undirected** graph for pedestrian routing" +msgid "Using an **undirected** graph for pedestrian routing" msgstr "" msgid "The first subway line stations are at :math:`\\{15, 16\\}`" @@ -9658,7 +9664,7 @@ msgstr "" msgid "The best connections from all the stations from the second line are: :math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" msgstr "" -msgid "Both are equaly good as they have the same cost. (lines: `13` and `14` and lines: `15` and `16`)" +msgid "Both are equally good as they have the same cost. (lines: `13` and `14` and lines: `15` and `16`)" msgstr "" msgid "Dijkstra optional parameters" @@ -9718,13 +9724,10 @@ msgstr "" msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" -msgid "lines `3~4` sets the start vertices to be from the fisrt subway line and the ending vertices to be from the second subway line" -msgstr "" - msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `1`)" msgstr "" -msgid "Both are equaly good as they have the same cost. (lines: `12` and `13`)" +msgid "Both are equally good as they have the same cost. (lines: `12` and `13`)" msgstr "" msgid "``pgr_dijkstraVia`` - Proposed" @@ -9817,7 +9820,7 @@ msgstr "" msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." msgstr "" -msgid "Standarizing output columns to |result-spantree|" +msgid "Standardizing output columns to |result-spantree|" msgstr "" msgid "Added ``depth`` and ``start_vid`` result columns." @@ -9841,7 +9844,7 @@ msgstr "" msgid "pgr_drivingDistance(multiple vertices)" msgstr "" -msgid "Using the Dijkstra algorithm, extracts all the nodes that have costs less than or equal to the value ``distance``. The edges extracted will conform to the corresponding spaning tree." +msgid "Using the Dijkstra algorithm, extracts all the nodes that have costs less than or equal to the value ``distance``. The edges extracted will conform to the corresponding spanning tree." msgstr "" msgid "pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])" @@ -10039,7 +10042,7 @@ msgstr "" msgid "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -msgid "`Boost: edmonds_karp_max_flow `__" +msgid "`Boost: Edmonds Karp max flow `__" msgstr "" msgid "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" @@ -10501,7 +10504,7 @@ msgstr "" msgid "``pgr_hawickCircuits`` - Experimental" msgstr "" -msgid "``pgr_hawickCircuits`` — Returns the list of ciruits using hawick circuits algorithm." +msgid "``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits algorithm." msgstr "" msgid "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. James. This algorithm solves the problem of detecting and enumerating circuits in graphs. It is capable of circuit enumeration in graphs with directed-arcs, multiple-arcs and self-arcs with a memory efficient and high-performance im-plementation. It is an extension of Johnson's Algorithm of finding all the elementary circuits of a directed graph." @@ -10522,7 +10525,7 @@ msgstr "" msgid "Time Complexity: :math:`O((V + E) (c + 1))`" msgstr "" -msgid ":math:`|c|` is the number of circuts in the graph." +msgid ":math:`|c|` is the number of circuits in the graph." msgstr "" msgid "pgr_hawickCircuits(`Edges SQL`_)" @@ -10537,7 +10540,7 @@ msgstr "" msgid "Id of the circuit starting from ``1``" msgstr "" -msgid "Relative postion in the path. Has value ``0`` for beginning of the path" +msgid "Relative position in the path. Has value ``0`` for beginning of the path" msgstr "" msgid "Identifier of the starting vertex of the circuit." @@ -10609,7 +10612,7 @@ msgstr "" msgid "``pgr_johnson`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Floyd-Warshall algorithm." msgstr "" -msgid "The Johnson algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *sparse graphs*. It usees the Boost's implementation which runs in :math:`O(V E \\log V)` time," +msgid "The Johnson algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *sparse graphs*. It uses the Boost's implementation which runs in :math:`O(V E \\log V)` time," msgstr "" msgid "pgr johnson(`Edges SQL`_, [``directed``])" @@ -10711,7 +10714,7 @@ msgstr "" msgid "``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all vertices." msgstr "" -msgid "The algorithm calculates the *immidiate dominator* of each vertex called **idom**, once **idom** of each vertex is calculated then by making every **idom** of each vertex as its parent, the dominator tree can be built." +msgid "The algorithm calculates the *immediate dominator* of each vertex called **idom**, once **idom** of each vertex is calculated then by making every **idom** of each vertex as its parent, the dominator tree can be built." msgstr "" msgid "The algorithm works in directed graph only." @@ -11053,13 +11056,13 @@ msgstr "" msgid "A soft restriction going from vertex 6 to vertex 3 using edges 4 -> 7 is wanted." msgstr "" -msgid "Idenifying the restriction" +msgid "Identifying the restriction" msgstr "" msgid "Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where the cost will be increased" msgstr "" -msgid "The edge to be altered is ``WHERE cost = 0 AND seq != 1 AND edge != -1`` from the previus query:" +msgid "The edge to be altered is ``WHERE cost = 0 AND seq != 1 AND edge != -1`` from the previous query:" msgstr "" msgid "Adding a value to the restriction" @@ -11383,6 +11386,15 @@ msgstr "" msgid "The function reads edges from a not \"noded\" network table and writes the \"noded\" edges into a new table." msgstr "" +msgid "Not checking and not creating indexes." +msgstr "" + +msgid "Using ``pgr_separateTouching`` and ``pgr_separateCrossing``." +msgstr "" + +msgid "Created table with ``BIGINT``." +msgstr "" + msgid "A common problem associated with bringing GIS data into pgRouting is the fact that the data is often not \"noded\" correctly. This will create invalid topologies, which will result in routes that are incorrect." msgstr "" @@ -11419,10 +11431,10 @@ msgstr "" msgid "``integer`` Segment number of the original edge" msgstr "" -msgid "``integer`` Empty source column" +msgid "``bigint`` Empty source column" msgstr "" -msgid "``integer`` Empty target column" +msgid "``bigint`` Empty target column" msgstr "" msgid "the geom" @@ -12007,7 +12019,7 @@ msgstr "" msgid "The returned values are not ordered" msgstr "" -msgid "The returned graph is compresed" +msgid "The returned graph is compressed" msgstr "" msgid "Running time: :math:`O(|V||E|)`" @@ -12766,10 +12778,10 @@ msgstr "" msgid "Only points that are visited are removed, that is, points reached within the distance are included" msgstr "" -msgid "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)``" +msgid "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)" msgstr "" -msgid "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)``" +msgid "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)" msgstr "" msgid "Modify the graph to include points and using Dijkstra algorithm, extracts all the nodes and points that have costs less than or equal to the value ``**distance**`` from the starting point. The edges extracted will conform the corresponding spanning tree." @@ -12853,9 +12865,6 @@ msgstr "" msgid "``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." msgstr "" -msgid "Standarizing output columns to |nksp-result|" -msgstr "" - msgid "pgr_withPointsKSP(One to One)" msgstr "" @@ -13054,6 +13063,27 @@ msgstr "" msgid "pgRouting 3.8" msgstr "" +msgid "`#2772 `__: Promote to official pgr_extractVertices in 3.8" +msgstr "" + +msgid "`#2760 `__: Promote to official pgr_degree in 3.8" +msgstr "" + +msgid "`#2774 `__: Promote to official pgr_findCloseEdges in 3.8" +msgstr "" + +msgid "New proposed functions" +msgstr "" + +msgid "Deprecation of functions." +msgstr "" + +msgid "Deprecated functions:" +msgstr "" + +msgid "The use removed." +msgstr "" + msgid "pgRouting 3.7" msgstr "" @@ -15484,7 +15514,7 @@ msgstr "" msgid "About points" msgstr "" -msgid "For this section the following city (see :doc:`sampledata`) some interesing points such as restaurant, supermarket, post office, etc. will be used as example." +msgid "For this section the following city (see :doc:`sampledata`) some interesting points such as restaurant, supermarket, post office, etc. will be used as example." msgstr "" msgid "The graph is **directed**" @@ -15514,7 +15544,7 @@ msgstr "" msgid "Driving side" msgstr "" -msgid "In the the folowwing images:" +msgid "In the following images:" msgstr "" msgid "The squared vertices are the temporary vertices," @@ -15556,7 +15586,7 @@ msgstr "" msgid "Like having all points to be considered in both sides ``b``" msgstr "" -msgid "Prefered usage on **undirected** graphs" +msgid "Preferred usage on **undirected** graphs" msgstr "" msgid "On the :doc:`TRSP-family` this option is not valid" @@ -15589,7 +15619,7 @@ msgstr "" msgid "On a right hand side driving network" msgstr "" -msgid "Arrival to point ``-2`` can be achived only via vertex **16**." +msgid "Arrival to point ``-2`` can be achieved only via vertex **16**." msgstr "" msgid "Does not affects edge ``(17, 16)``, therefore the edge is kept." @@ -15604,7 +15634,7 @@ msgstr "" msgid "Edge ``(16, -2)`` with cost ``0.4`` (original cost * fraction == :math:`1 * 0.4`)" msgstr "" -msgid "Edge ``(-2, 17)`` with cost ``0.6`` (the remaing cost)" +msgid "Edge ``(-2, 17)`` with cost ``0.6`` (the remaining cost)" msgstr "" msgid "The total cost of the additional edges is equal to the original cost." @@ -15616,7 +15646,7 @@ msgstr "" msgid "On a left hand side driving network" msgstr "" -msgid "Arrival to point ``-2`` can be achived only via vertex **17**." +msgid "Arrival to point ``-2`` can be achieved only via vertex **17**." msgstr "" msgid "Does not affects edge ``(16, 17)``, therefore the edge is kept." @@ -15640,7 +15670,7 @@ msgstr "" msgid "When driving side does not matter" msgstr "" -msgid "Arrival to point ``-2`` can be achived via vertices **16** or **17**." +msgid "Arrival to point ``-2`` can be achieved via vertices **16** or **17**." msgstr "" msgid "Affects the edges ``(16, 17)`` and ``(17, 16)``, therefore the edges are removed." diff --git a/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po b/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po index 33b5a8ed527..7ebd9559eb0 100644 --- a/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po @@ -11,7 +11,7 @@ msgid "" msgstr "" "Project-Id-Version: pgRouting v3.8\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2025-04-08 20:49+0000\n" +"POT-Creation-Date: 2025-04-22 16:17-0600\n" "PO-Revision-Date: 2025-04-09 00:16+0000\n" "Last-Translator: Celia Virginia Vergara Castillo \n" "Language-Team: Chinese (Simplified) `__" +"milestone for 3.8.0 `__" msgstr "" -"查看本版本已关闭的所有议题和拉取请求,请访问：`GitHub 4.0.0版本里程碑关闭列表 " -"`__" - -msgid "Functions promoted to official" -msgstr "正式版功能函数" - -msgid "pgr_trsp" -msgstr "pgr_trsp" - -msgid "pgr_trspVia" -msgstr "pgr_trspVia" - -msgid "pgr_trspVia_withPoints" -msgstr "pgr_trspVia_withPoints" - -msgid "pgr_trsp_withPoints" -msgstr "pgr_trsp_withPoints" - -msgid "pgr_withPoints" -msgstr "pgr_withPoints" - -msgid "pgr_withPointsCost" -msgstr "pgr_withPointsCost" - -msgid "pgr_withPointsCostMatrix" -msgstr "pgr_withPointsCostMatrix" - -msgid "pgr_withPointsDD" -msgstr "pgr_withPointsDD" - -msgid "pgr_withPointsKSP" -msgstr "pgr_withPointsKSP" - -msgid "pgr_withPointsVia" -msgstr "pgr_withPointsVia" - -msgid "Signatures promoted to official" -msgstr "正式版函数签名" - -msgid "pgr_aStar(Combinations)" -msgstr "pgr_aStar(组合)" - -msgid "pgr_aStarCost(Combinations)" -msgstr "pgr_aStarCost(组合)" - -msgid "pgr_bdAstar(Combinations)" -msgstr "pgr_bdAstar(组合)" - -msgid "pgr_bdAstarCost(Combinations)" -msgstr "pgr_bdAstarCost(组合)" +"查看本版本已关闭的所有议题和拉取请求，请访问：`GitHub 3.7.0版本里程碑关闭列" +"表 >`__" -msgid "pgr_bdDijkstra(Combinations)" -msgstr "pgr_bdDijkstra(组合)" +#, fuzzy +msgid "Promotion to official function of pgRouting." +msgstr "pgRouting 中的拟议已升级为正式版本" -msgid "pgr_bdDijkstraCost(Combinations)" -msgstr "pgr_bdDijkstraCost(组合)" +#, fuzzy +msgid "" +"`#2772 `__: Promoted to " +"official pgr_extractVertices in version 3.8" +msgstr "" +"`#2087 `__:拟议的 " +"pgr_extractVertices" -msgid "pgr_dijkstra(Combinations)" -msgstr "pgr_dijkstra(组合)" +msgid "Error messages adjustment." +msgstr "" -msgid "pgr_dijkstraCost(Combinations)" -msgstr "pgr_dijkstraCost(组合)" +msgid "Function promoted to official." +msgstr "函数正式发布。" -msgid "pgr_KSP(All signatures)" -msgstr "pgr_KSP（所有函数签名版本）" +#, fuzzy +msgid "" +"`#2760 `__: Promoted to " +"official pgr_degree in version 3.8" +msgstr "" +"`#2266 `__：错误处理限制" -msgid "pgr_boykovKolmogorov(Combinations)" -msgstr "pgr_boykovKolmogorov (组合)" +msgid "New signature with only Edges SQL." +msgstr "" -msgid "pgr_edmondsKarp(Combinations)" -msgstr "pgr_edmondsKarp(组合)" +#, fuzzy +msgid "" +"`#2774 `__: Promoted to " +"official pgr_findCloseEdges in version 3.8" +msgstr "" +"`#2087 `__:拟议的 " +"pgr_extractVertices" -msgid "pgr_maxFlow(Combinations)" -msgstr "pgr_maxFlow(组合)" +#, fuzzy +msgid "``partial`` option is removed." +msgstr "``n_seq`` 被删除" -msgid "pgr_pushRelabel(Combinations)" -msgstr "pgr_pushRelabel(组合)" +#, fuzzy +msgid "Proposed functions" +msgstr "拟议的功能" -msgid "code enhancements:" -msgstr "代码改进：" +#, fuzzy +msgid "Contraction" +msgstr "收缩：" -msgid "Removal of unused C/C++ code" -msgstr "移除未使用的C/C++代码" +#, fuzzy +msgid "" +"`#2790 `__: " +"pgr_contractionDeadEnd new contraction function" +msgstr "" +"`#2087 `__:拟议的 " +"pgr_extractVertices" -msgid "Removal of SQL deprecated functions" -msgstr "移除已弃用的SQL函数" +#, fuzzy +msgid "" +"`#2791 `__: " +"pgr_contractionLinear new contraction function" +msgstr "" +"`#1002 `__：修复收缩问" +"题：" #, fuzzy -msgid "pgr_contraction(text,bigint[],integer,bigint[],boolean)" -msgstr "_pgr_dijkstranear(text,bigint,anyarray,bigint,boolean)" +msgid "" +"`#2848 `__: Create " +"pgr_separateCrossing new utility function" +msgstr "" +"`#2266 `__：错误处理限制" +#, fuzzy msgid "" -"pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean,text)" +"`#2849 `__: Create of " +"pgr_separateTouching new utility function" msgstr "" -"pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean,text)" +"`#2266 `__：错误处理限制" -msgid "pgr_trsp(text,integer,integer,boolean,boolean,text)" -msgstr "pgr_trsp(text,integer,integer,boolean,boolean,text)" +msgid "Official functions changes" +msgstr "官方功能变更" +#, fuzzy msgid "" -"pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +"`#2786 `__: " +"pgr_contraction(edges) new signature" msgstr "" -"pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" - -msgid "pgr_trspviavertices(text,anyarray,boolean,boolean,text)" -msgstr "pgr_trspviavertices(text,anyarray,boolean,boolean,text)" +"`#2266 `__：错误处理限制" -msgid "Removal of SQL deprecated internal functions" -msgstr "移除已弃用的SQL内部函数" +#, fuzzy +msgid "New signature:" +msgstr "新签名" -msgid "_pgr_dijkstranear(text,anyarray,anyarray,bigint,boolean)" -msgstr "_pgr_dijkstranear(text,anyarray,anyarray,bigint,boolean)" +msgid "" +"Previously compulsory parameter **Contraction order** is now optional with " +"name ``methods``." +msgstr "" +"之前必需的参数 **Contraction order** 现在已变为可选参数，并更名为 " +"``methods``。" -msgid "_pgr_dijkstranear(text,anyarray,bigint,bigint,boolean)" -msgstr "_pgr_dijkstranear(text,anyarray,bigint,bigint,boolean)" +#, fuzzy +msgid "New name and order of optional parameters." +msgstr "接近可选参数" -msgid "_pgr_dijkstranear(text,bigint,anyarray,bigint,boolean)" +#, fuzzy +msgid "" +"Deprecated signature pgr_contraction(text,bigint[],integer,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 "C/C++ code enhancements" +msgstr "C/C++ 代码增强" +#, fuzzy msgid "" -"_pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean,text)" +"`#2802 `__: Code " +"reorganization on pgr_contraction" msgstr "" -"_pgr_trsp(text,integer,double precision,integer,double precision,boolean," -"boolean,text)" +"`#2266 `__：错误处理限制" -msgid "_pgr_trsp(text,text,anyarray,anyarray,boolean)" -msgstr "_pgr_trsp(text,text,anyarray,anyarray,boolean)" +#, fuzzy +msgid "SQL code enhancements" +msgstr "代码改进：" -msgid "_pgr_trsp(text,text,anyarray,bigint,boolean)" -msgstr "_pgr_trsp(text,text,anyarray,bigint,boolean)" +#, fuzzy +msgid "" +"`#2850 `__: Rewrite " +"pgr_nodeNetwork" +msgstr "" +"`#2266 `__：错误处理限制" -msgid "_pgr_trsp(text,text,bigint,anyarray,boolean)" -msgstr "_pgr_trsp(text,text,bigint,anyarray,boolean)" +#, fuzzy +msgid "Deprecation of SQL functions" +msgstr "已废弃的函数" -msgid "_pgr_trsp(text,text,bigint,bigint,boolean)" -msgstr "_pgr_trsp(text,text,bigint,bigint,boolean)" +#, fuzzy +msgid "" +"`#2749 `__: Deprecate " +"pgr_AlphaShape in 3.8" +msgstr "" +"`#2266 `__：错误处理限制" -msgid "_pgr_trspviavertices(text,integer[],boolean,boolean,text)" -msgstr "_pgr_trspviavertices(text,integer[],boolean,boolean,text)" +#, fuzzy +msgid "" +"`#2750 `__: Deprecate " +"pgr_CreateTopology in 3.8" +msgstr "" +"`#2266 `__：错误处理限制" -msgid "_pgr_withpointsvia(text,bigint[],double precision[],boolean)" -msgstr "_pgr_withpointsvia(text,bigint[],double precision[],boolean)" +#, fuzzy +msgid "" +"`#2753 `__: Deprecate " +"pgr_analyzeGraph in 3.8" +msgstr "" +"`#2266 `__：错误处理限制" -msgid "_trsp(text,text,anyarray,anyarray,boolean)" -msgstr "_trsp(text,text,anyarray,anyarray,boolean)" +#, fuzzy +msgid "" +"`#2754 `__: Deprecate " +"pgr_analyzeOneWay in 3.8" +msgstr "" +"`#2266 `__：错误处理限制" -msgid "_v4trsp(text,text,anyarray,anyarray,boolean)" -msgstr "_v4trsp(text,text,anyarray,anyarray,boolean)" +#, fuzzy +msgid "" +"`#2826 `__: Deprecate " +"pgr_createVerticesTable in 3.8" +msgstr "" +"`#2087 `__:拟议的 " +"pgr_extractVertices" -msgid "_v4trsp(text,text,text,boolean)" -msgstr "_v4trsp(text,text,text,boolean)" +#, fuzzy +msgid "In the deprecated functions:" +msgstr "已废弃的功能" -msgid "Deprecation of internal C/C++ functions" -msgstr "弃用内部C/C++函数" +#, fuzzy +msgid "Migration section is created." +msgstr "限制迁移" #, fuzzy -msgid "Internal C/C++ functions in legacy" -msgstr "已废弃的函数" +msgid "The use of the functions is removed in the documentation." +msgstr "这个问题的答案将取决于应用情况。" msgid "All releases" msgstr "所有版本" @@ -5225,12 +5237,6 @@ msgstr "已废弃的功能" msgid "`v3.4.0 `__" msgstr "`v3.4.0 `__" -msgid "Removed" -msgstr "已删除的功能" - -msgid "`v4.0.0 `__" -msgstr "`v4.0.0 `__" - msgid ":doc:`pgr_dijkstra`" msgstr ":doc:`pgr_dijkstra`" @@ -6158,122 +6164,127 @@ msgstr "" "需要将新边添加到边表中，需要更新新边中的其余属性，需要删除旧边并需要更新路由" "拓扑。" -msgid "Adding split edges" -msgstr "添加分割边" +#, fuzzy +msgid "Fixing an intersection" +msgstr "交叉口" msgid "" -"For each pair of crossing edges a process similar to this one must be " -"performed." -msgstr "对于每一对交叉边，必须执行与此类似的过程。" +"In this example the original edge table will be used to store the additional " +"geometries." +msgstr "" -msgid "" -"The columns inserted and the way are calculated are based on the " -"application. For example, if the edges have a trait **name**, then that " -"column is to be copied." +msgid "An example use without results" msgstr "" -"插入的列和计算方式取决于应用程序。 例如，如果边具有特征 **名称** ，则将复制该" -"列。" -msgid "For pgRouting calculations" -msgstr "用于 pgRouting 计算" +msgid "Routing from :math:`1` to :math:`18` gives no solution." +msgstr "" -msgid "" -"**factor** based on the position of the intersection of the edges can be " -"used to adjust the ``cost`` and ``reverse_cost`` columns." -msgstr "基于边相交位置的 **因子** 可用于调整 ``cost`` 和 ``reverse_cost`` 列。" +msgid "Analyze the network for intersections." +msgstr "" -msgid "" -"Capacity information, used in the :doc:`flow-family` functions does not need " -"to change when splitting edges." -msgstr "分割边时，在 :doc:`flow-family` 函数中使用的容量信息不需要改变。" +#, fuzzy +msgid "The analysis tell us that the network has an intersection." +msgstr "分析告诉我们，网络存在缺口和交叉点。 我们尝试使用以下方法解决该问题：" -msgid "Adding new vertices" +#, fuzzy +msgid "Prepare tables" +msgstr "创建表" + +msgid "Additional columns to control the origin of the segments." +msgstr "" + +#, fuzzy +msgid "Adding new segments." msgstr "添加新的顶点" msgid "" -"After adding all the split edges required by the application, the newly " -"created vertices need to be added to the vertices table." -msgstr "添加应用程序所需的所有分割边后，需要将新创建的顶点添加到顶点表中。" +"Calling :doc:`pgr_separateCrossing` and adding the new segments to the edges " +"table." +msgstr "" -msgid "Updating edges topology" +#, fuzzy +msgid "Update other values" msgstr "更新边拓扑" -msgid "Removing the surplus edges" -msgstr "去除多余的边" - +#, fuzzy msgid "" -"Once all significant information needed by the application has been " -"transported to the new edges, then the crossing edges can be deleted." -msgstr "一旦应用程序所需的所有重要信息都已传输到新边，则可以删除交叉边。" +"In this example only ``cost`` and ``reverse_cost`` are updated, where they " +"are based on the length of the geometry and the directionality is kept using " +"the ``sign`` function." +msgstr "对于本示例， ``cost`` 和 ``reverse_cost`` 值将是几何体长度的两倍。" -msgid "" -"There are other options to do this task, like creating a view, or a " -"materialized view." -msgstr "还有其他选项可以完成此任务，例如创建视图或物化视图。" +#, fuzzy +msgid "Update the topology" +msgstr "更新边拓扑" -msgid "Updating vertices topology" -msgstr "更新顶点拓扑" +#, fuzzy +msgid "Insert the new vertices if any." +msgstr "检查顶点表" -msgid "To keep the graph consistent, the vertices topology needs to be updated" -msgstr "为了保持图的一致性，需要更新顶点拓扑" +#, fuzzy +msgid "Update source and target information on the edges table." +msgstr "红色箭头显示边表上的边 ``(source, target)``" -msgid "Checking for crossing edges" -msgstr "检查交叉边" +msgid "The example has results" +msgstr "" -msgid "There are no crossing edges on the graph." -msgstr "图上没有交叉边。" +#, fuzzy +msgid "Routing from :math:`1` to :math:`18` gives a solution." +msgstr "路由从 :math:`5` 到 :math:`1`" -msgid "Disconnected graphs" -msgstr "断开连接的图" +#, fuzzy +msgid "Touching edges" +msgstr "交叉边" -msgid "To get the graph connectivity:" -msgstr "要获取图的连通性：" +msgid "Visually the edges seem to be connected, but internally they are not." +msgstr "" -msgid "" -"In this example, the component :math:`2` consists of vertices :math:`\\{2, " -"4\\}` and both vertices are also part of the dead end result set." +msgid "The validity of the information is application dependent." msgstr "" -"在此示例中，组件 :math:`2`由顶点 :math:`\\{2, 4\\}` 组成，并且两个顶点也是死" -"端结果集的一部分。" -msgid "This graph needs to be connected." -msgstr "这个图需要连接起来。" +msgid "Maybe there is a small barrier for vehicles but not for pedestrians." +msgstr "" +#, fuzzy msgid "" -"With the original graph of this documentation, there would be 3 components " -"as the crossing edge in this graph is a different component." -msgstr "对于本文档的原始图，将有 3 个组件，因为该图中的交叉边是不同的组件。" +"Once analyzed one by one the touchings, for the ones that need a local fix, " +"the edges need to be `split `__." +msgstr "" +"对交叉点进行一一分析后，对于需要局部修复的交叉点，需要 `分割 `__ 边。" -msgid "Prepare storage for connection information" -msgstr "为连接信息准备存储" +msgid "Fixing a gap" +msgstr "" -msgid "Save the vertices connection information" -msgstr "保存顶点连接信息" +#, fuzzy +msgid "Routing from :math:`1` to :math:`2` gives no solution." +msgstr "路由从 :math:`5` 到 :math:`1`" -msgid "Save the edges connection information" -msgstr "保存边连接信息" +#, fuzzy +msgid "Analyze the network for gaps." +msgstr "现在我们可以分析网络了。" -msgid "Get the closest vertex" -msgstr "获取最近的顶点" +#, fuzzy +msgid "The analysis tell us that the network has a gap." +msgstr "分析告诉我们，网络存在缺口和交叉点。 我们尝试使用以下方法解决该问题：" msgid "" -"Using :doc:`pgr_findCloseEdges` the closest vertex to component :math:`1` is " -"vertex :math:`4`. And the closest edge to vertex :math:`4` is edge :math:" -"`14`." +"Calling :doc:`pgr_separateTouching` and adding the new segments to the edges " +"table." msgstr "" -"使用 :doc:`pgr_findCloseEdges` 距离组件 :math:`1` 最近的顶点是顶点 :math:" -"`4`。 距离顶点 :math:`4` 最近的边是 边 :math:`14`。" -msgid "" -"The ``edge`` can be used to connect the components, using the ``fraction`` " -"information about the edge :math:`14` to split the connecting edge." -msgstr "" -"``edge``可用于连接组件，利用边 :math:`14` 的``fraction`` 信息来分割连接边。" +#, fuzzy +msgid "Routing from :math:`1` to :math:`2` gives a solution." +msgstr "路由从 :math:`5` 到 :math:`1`" msgid "Connecting components" msgstr "连接组件" -msgid "There are three basic ways to connect the components" +msgid "To get the graph connectivity:" +msgstr "要获取图的连通性：" + +#, fuzzy +msgid "There are three basic ways to connect components:" msgstr "连接组件有三种基本方法" msgid "From the vertex to the starting point of the edge" @@ -6288,16 +6299,35 @@ msgstr "从边上的顶点到最近的顶点" msgid "This solution requires the edge to be split." msgstr "该解决方案需要将边缘分割。" -msgid "The following query shows the three ways to connect the components:" -msgstr "以下查询显示了连接组件的三种方式：" +msgid "" +"In this example :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` " +"will be used." +msgstr "" + +#, fuzzy +msgid "Get the connectivity" +msgstr "要获取图的连通性：" -msgid "Checking components" -msgstr "检查组件" +msgid "" +"In this example: the edges table will need an additional column and the " +"vertex table will be rebuilt completely." +msgstr "" + +#, fuzzy +msgid "Insert new edges" +msgstr "创建两条新边：" msgid "" -"Ignoring the edge that requires further work. The graph is now fully " -"connected as there is only one component." -msgstr "忽略需要进一步工作的边缘。 该图现在已完全连接，因为只有一个组件。" +"Using :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` insert the " +"results into the edges table." +msgstr "" + +msgid "Create the vertices table" +msgstr "创建顶点表" + +#, fuzzy +msgid "Using :doc:`pgr_extractVertices` create the table." +msgstr "使用 ``pgr_extractVertices`` 创建路由拓扑" msgid "Contraction of a graph" msgstr "图的收缩" @@ -7093,9 +7123,9 @@ msgid "Upgrading the database" msgstr "升级数据库" msgid "" -"To upgrade pgRouting in the database to version 4.0.0 use the following " +"To upgrade pgRouting in the database to version 3.8.0 use the following " "command:" -msgstr "要将数据库中的 pgRouting 升级到 4.0.0 版本，请使用以下命令：" +msgstr "要将数据库中的 pgRouting 升级到 3.8.0 版本，请使用以下命令：" msgid "" "More information can be found in https://www.postgresql.org/docs/current/sql-" @@ -7590,18 +7620,11 @@ 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 "Standardizing output columns to |nksp-result|" +msgstr "标准化输出列为 |nksp-result|" msgid "pgr_ksp(One to One)" msgstr "pgr_ksp(一对一)" @@ -7647,9 +7670,6 @@ msgstr "基于Yen算法的K最短路径路由算法。 “K”是所需的最短 msgid "|Boost| Boost Graph Inside" msgstr "|Boost| Boost 图内部" -msgid "Boost Graph Inside" -msgstr "Boost 图内部" - msgid "Signatures" msgstr "签名" @@ -7841,16 +7861,18 @@ msgstr "所有边上的旅行成本都遵循三角不等式。" msgid "When ``start_vid = 0 OR end_vid = 0``" msgstr "当 ``start_vid = 0 OR end_vid = 0``" +#, fuzzy msgid "" -"The solutions generated is garanteed to be *twice as long as the optimal " +"The solutions generated are guaranteed to be *twice as long as the optimal " "tour in the worst case*" msgstr "生成的解决方案保证是*最坏情况下最优路径时间的两倍*" msgid "When ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``" msgstr "当 ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``" +#, fuzzy msgid "" -"It is **not garanteed** that the solution will be, in the worse case, twice " +"It is **not guaranteed** that the solution will be, in the worst case, twice " "as long as the optimal tour, due to the fact that `end_vid` is forced to be " "in a fixed position." msgstr "" @@ -7860,8 +7882,9 @@ msgstr "" msgid "With ``directed => true``" msgstr "当 ``directed => true``" +#, fuzzy msgid "" -"It is **not garanteed** that the solution will be, in the worse case, twice " +"It is **not guaranteed** that the solution will be, in the worst case, twice " "as long as the optimal tour" msgstr "**不能保证** 在最坏情况下解决方案将是最优路径的两倍长" @@ -7910,9 +7933,6 @@ msgstr "pgr_TSP(`Matrix SQL`_, ``[start_id, end_id]``)" msgid "Returns set of |tsp-result|" msgstr "返回 |tsp-result| 的集合" -msgid "OR EMTPY SET" -msgstr "OR EMTPY SET" - msgid "Using :doc:`pgr_dijkstraCostMatrix` to generate the matrix information" msgstr "使用 :doc:`pgr_dijkstraCostMatrix` 生成矩阵信息" @@ -7966,7 +7986,7 @@ msgstr "从顶点 :math:`1` 开始" msgid "**Line 6** ``start_vid => 1``" msgstr "**Line 6** ``start_vid => 1``" -msgid "Using points of interest to generate an asymetric matrix." +msgid "Using points of interest to generate an asymmetric matrix." msgstr "使用兴趣点生成不对称矩阵。" msgid "To generate an asymmetric matrix:" @@ -7978,7 +7998,7 @@ msgid "" msgstr "" "**Line 4** 通过未在查询中包括 ``pointsOfInterset`` 中的``side`` 信息而被忽略" -msgid "**Line 6** Generating an asymetric matrix with ``directed => true``" +msgid "**Line 6** Generating an asymmetric matrix with ``directed => true``" msgstr "**Line 6** 使用 ``directed => true`` 生成一个非对称矩阵" msgid "" @@ -8049,12 +8069,10 @@ msgid "New official function." msgstr "新函数 official。" msgid "" -"Any duplicated identifier will be ignored. The coordinates that will be kept" +"Any duplicated identifier will be ignored. The coordinates than will be kept " +"is arbitrarily." msgstr "任何重复的标识符都将被忽略。 将保留的坐标" -msgid "is arbitrarly." -msgstr "是任意的。" - msgid "" "The coordinates are quite similar for the same identifier, for example ::" msgstr "对于相同的标识符，坐标非常相似，例如 ::" @@ -8124,7 +8142,7 @@ msgid "Visual results" msgstr "视觉效果" msgid "" -"Visualy, The first image is the `optimal solution `__ and the second image is the solution " "obtained with ``pgr_TSPeuclidean``." msgstr "" @@ -8137,10 +8155,7 @@ 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|" +msgid "Standardizing output columns to |short-generic-result|" msgstr "标准输出列|short-generic-result|" #, fuzzy @@ -8160,8 +8175,8 @@ msgstr "版本3.2.0" msgid "New proposed signature:" msgstr "新拟议的签名：" -msgid "Function promoted to official." -msgstr "函数正式发布。" +msgid "pgr_aStar(Combinations)" +msgstr "pgr_aStar(组合)" msgid "Version 2.4.0" msgstr "版本2.4.0" @@ -8265,11 +8280,14 @@ 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 "" -"The ``pgr_aStarCost`` function sumarizes of the cost of the shortest path " +"The ``pgr_aStarCost`` function summarizes of the cost of the shortest path " "using the A* algorithm." msgstr "``pgr_aStarCost`` 函数总结了使用 A* 算法计算最短路径的成本。" @@ -8323,7 +8341,7 @@ msgid "" "`pgr_aStar`." msgstr "``pgr_aStarCostMatrix`` - 使用 :doc:`pgr_aStar` 计算成本矩阵。" -msgid "Using internaly the :doc:`pgr_aStar` algorithm" +msgid "Using internally the :doc:`pgr_aStar` algorithm" msgstr "内部使用 :doc:`pgr_aStar` 算法" msgid "Returns a cost matrix." @@ -8936,6 +8954,9 @@ 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（一对多）" @@ -8978,8 +8999,11 @@ msgid "" "bidirectional A* algorithm." msgstr "``pgr_bdAstarCost`` - 使用双向 A* 算法计算的最短路径的总成本。" +msgid "pgr_bdAstarCost(Combinations)" +msgstr "pgr_bdAstarCost(组合)" + msgid "" -"The ``pgr_bdAstarCost`` function sumarizes of the cost of the shortest path " +"The ``pgr_bdAstarCost`` function summarizes of the cost of the shortest path " "using the bidirectional A* algorithm." msgstr "``pgr_bdAstarCost`` 函数总结了使用双向 A* 算法计算最短路径的成本。" @@ -9014,7 +9038,7 @@ msgid "" "`pgr_aStar`." msgstr "``pgr_bdAstarCostMatrix`` - 使用 :doc:`pgr_aStar` 计算成本矩阵。" -msgid "Using internaly the :doc:`pgr_bdAstar` algorithm" +msgid "Using internally the :doc:`pgr_bdAstar` algorithm" msgstr "内部使用 :doc:`pgr_bdAstar` 算法" msgid "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])" @@ -9028,6 +9052,9 @@ msgid "" "algorithm." msgstr "``pgr_bdDijkstra`` — 返回使用双向 Dijkstra 算法计算的最短路径。" +msgid "pgr_bdDijkstra(Combinations)" +msgstr "pgr_bdDijkstra(组合)" + #, fuzzy msgid "pgr_bdDijkstra(One to Many)" msgstr "pgr_bdDijkstra（一对多）" @@ -9108,8 +9135,11 @@ msgid "" "Bidirectional Dijkstra algorithm." msgstr "``pgr_bdDijkstraCost`` —返回使用双向 Dijkstra 算法计算最短路径的成本。" +msgid "pgr_bdDijkstraCost(Combinations)" +msgstr "pgr_bdDijkstraCost(组合)" + msgid "" -"The ``pgr_bdDijkstraCost`` function sumarizes of the cost of the shortest " +"The ``pgr_bdDijkstraCost`` function summarizes of the cost of the shortest " "path using the bidirectional Dijkstra Algorithm." msgstr "``pgr_bdDijkstraCost`` 函数使用双向 Dijkstra 算法汇总最短路径的成本。" @@ -9279,6 +9309,9 @@ msgstr "" msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" msgstr "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" +msgid "Boost Graph Inside" +msgstr "Boost 图内部" + #, fuzzy msgid "``pgr_betweennessCentrality`` - Experimental" msgstr "``pgr_betweennessCentrality``" @@ -9630,6 +9663,9 @@ msgstr "" "`pgr_boykovKolmogorov`` - 使用 Boykov Kolmogorov 算法计算图边的流量，使从源到" "目标的流量最大。" +msgid "pgr_boykovKolmogorov(Combinations)" +msgstr "pgr_boykovKolmogorov (组合)" + msgid "Renamed from ``pgr_maxFlowBoykovKolmogorov``" msgstr "从 ``pgr_maxFlowBoykovKolmogorov`` 更名而来" @@ -9925,26 +9961,6 @@ msgid "" "vertices and edges." msgstr "``pgr_contraction`` — 执行图收缩操作并返回收缩后的顶点和边。" -#, fuzzy -msgid "New signature:" -msgstr "新签名" - -msgid "" -"Previously compulsory parameter **Contraction order** is now optional with " -"name ``methods``." -msgstr "" -"之前必需的参数 **Contraction order** 现在已变为可选参数，并更名为 " -"``methods``。" - -#, fuzzy -msgid "New name and order of optional parameters." -msgstr "接近可选参数" - -#, fuzzy -msgid "" -"Deprecated signature pgr_contraction(text,bigint[],integer,bigint[],boolean)" -msgstr "_pgr_dijkstranear(text,bigint,anyarray,bigint,boolean)" - msgid "Name change from ``pgr_contractGraph``" msgstr "``pgr_contractGraph`` 的名称更改" @@ -10900,9 +10916,6 @@ msgstr "确保数据库没有 ``vertices_table``" msgid "Clean up the columns of the routing topology to be created" msgstr "清理要创建的路由拓扑的列" -msgid "Create the vertices table" -msgstr "创建顶点表" - msgid "" "When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, )``" msgstr "" @@ -11263,12 +11276,6 @@ msgid "" "edges incident to the vertex." msgstr "``pgr_degree`` —对于无向图中的每个顶点，返回与该顶点关联的边的计数。" -msgid "Error messages adjustment." -msgstr "" - -msgid "New signature with only Edges SQL." -msgstr "" - #, fuzzy msgid "Calculates the degree of the vertices of an undirected graph" msgstr "计算 **无向** 图顶点的度数" @@ -11614,6 +11621,9 @@ msgstr "pgr_dijkstra（多对一）添加了 ``start_vid`` 列。" msgid "Version 3.1.0" msgstr "版本 3.1.0" +msgid "pgr_dijkstra(Combinations)" +msgstr "pgr_dijkstra(组合)" + msgid "Version 2.2.0" msgstr "版本 2.2.0" @@ -11834,9 +11844,12 @@ 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." +"The ``pgr_dijkstraCost`` function summarizes of the cost of the shortest " +"path using Dijkstra Algorithm." msgstr "``pgr_dijkstraCost`` 函数总结了使用 Dijkstra 算法计算最短路径的成本。" msgid "" @@ -12023,7 +12036,7 @@ msgstr "**选项：** ``[定向、上限、全局]``" msgid "Find the best pedestrian connection between two lines of buses" msgstr "在两条公交线路之间寻找最佳的行人通道" -msgid "Unsing an **undirected** graph for pedestrian routing" +msgid "Using an **undirected** graph for pedestrian routing" msgstr "使用 **无向** 图进行行人路线规划" msgid "The first subway line stations are at :math:`\\{15, 16\\}`" @@ -12119,7 +12132,7 @@ msgstr "" "rightarrow 11)}`" msgid "" -"Both are equaly good as they have the same cost. (lines: `13` and `14` and " +"Both are equally good as they have the same cost. (lines: `13` and `14` and " "lines: `15` and `16`)" msgstr "" "它们都一样好，因为它们具有相同的成本（线路：`13` 和`14`以及线路：`15` 和" @@ -12211,17 +12224,13 @@ msgstr "" msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options**])" -msgid "" -"lines `3~4` sets the start vertices to be from the fisrt subway line and the " -"ending vertices to be from the second subway line" -msgstr "行 `3~4` 设置地铁三号线的起始顶点和地铁二号线的终点顶点" - msgid "" "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` " "(lines: `1`)" msgstr "最好的方法是 :math:`(11/rightarrow 16)`，成本是 :math:`1` (lines: `1`)" -msgid "Both are equaly good as they have the same cost. (lines: `12` and `13`)" +msgid "" +"Both are equally good as they have the same cost. (lines: `12` and `13`)" msgstr "由于成本相同，所以两者同样好。(线路：`12` 和 `13`）" msgid "``pgr_dijkstraVia`` - Proposed" @@ -12329,7 +12338,7 @@ msgid "" "``pgr_drivingDistance`` - Returns the driving distance from a start node." msgstr "``pgr_drivingDistance`` - 返回起始节点的行驶距离。" -msgid "Standarizing output columns to |result-spantree|" +msgid "Standardizing output columns to |result-spantree|" msgstr "将输出列标准化为 |result-spantree|" msgid "Added ``depth`` and ``start_vid`` result columns." @@ -12356,7 +12365,7 @@ msgstr "pgr_drivingDistance （多顶点）" msgid "" "Using the Dijkstra algorithm, extracts all the nodes that have costs less " "than or equal to the value ``distance``. The edges extracted will conform to " -"the corresponding spaning tree." +"the corresponding spanning tree." msgstr "" "使用Dijkstra算法，提取所有成本小于或等于值 ``distance`` 的节点。提取的边将符" "合相应的生成树。" @@ -12606,6 +12615,9 @@ msgstr "" "``pgr_edmondsKarp`` —使用 Edmonds Karp 算法计算图边上的流量，以最大化从源到目" "标的流量。" +msgid "pgr_edmondsKarp(Combinations)" +msgstr "pgr_edmondsKarp(组合)" + msgid "Renamed from ``pgr_maxFlowEdmondsKarp``" msgstr "从 ``pgr_maxFlowEdmondsKarp`` 更名而来" @@ -12627,11 +12639,10 @@ msgstr "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vids**)" msgid "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" msgstr "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" -#, fuzzy msgid "" "`Boost: Edmonds Karp max flow `__" -msgstr "https://www.boost.org/libs/graph/doc/edmonds_karp_max_flow.html" +msgstr "" msgid "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" msgstr "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" @@ -12829,10 +12840,6 @@ msgstr "``pgr_findCloseEdges``" msgid "``pgr_findCloseEdges`` - Finds the close edges to a point geometry." msgstr "``pgr_findCloseEdges`` -查找点几何图形的闭合边。" -#, fuzzy -msgid "``partial`` option is removed." -msgstr "``n_seq`` 被删除" - msgid "" "``pgr_findCloseEdges`` - An utility function that finds the closest edge to " "a point geometry." @@ -13234,9 +13241,8 @@ msgstr "pgRouting 构建的 Git 哈希" msgid "``pgr_hawickCircuits`` - Experimental" msgstr "``pgr_hawickCircuits - 实验``" -#, fuzzy msgid "" -"``pgr_hawickCircuits`` — Returns the list of ciruits using hawick circuits " +"``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits " "algorithm." msgstr "``pgr_hawickCircuits`` — 使用 Hawick 回路算法返回回路列表。" @@ -13278,7 +13284,7 @@ msgstr "该算法输出图中存在的不同电路。" msgid "Time Complexity: :math:`O((V + E) (c + 1))`" msgstr "时间复杂度： :math:`O((V + E) (c + 1))`" -msgid ":math:`|c|` is the number of circuts in the graph." +msgid ":math:`|c|` is the number of circuits in the graph." msgstr ":math:`|c|` 是图中的电路数量。" msgid "pgr_hawickCircuits(`Edges SQL`_)" @@ -13293,7 +13299,8 @@ msgstr "pgRouting :doc:`sampledata` 中存在的电路" msgid "Id of the circuit starting from ``1``" msgstr "电路id从 ``1`` 开始" -msgid "Relative postion in the path. Has value ``0`` for beginning of the path" +msgid "" +"Relative position in the path. Has value ``0`` for beginning of the path" msgstr "路径中的相对位置。 路径开头的值为 ``0``" msgid "Identifier of the starting vertex of the circuit." @@ -13398,8 +13405,7 @@ msgstr "" msgid "" "The Johnson algorithm, is a good choice to calculate the sum of the costs of " "the shortest path for each pair of nodes in the graph, for *sparse graphs*. " -"It usees the Boost's implementation which runs in :math:`O(V E \\log V)` " -"time," +"It uses the Boost's implementation which runs in :math:`O(V E \\log V)` time," msgstr "" "Johnson算法是计算图中每一对节点的最短路径成本之和的好选择，特别适用于 *稀疏图" "*。它使用了Boost的实现，其运行时间为 :math:`O(V E \\log V)`" @@ -13538,7 +13544,7 @@ msgid "" msgstr "``pgr_lengauerTarjanDominatorTree`` — 返回所有顶点的直接支配者。" msgid "" -"The algorithm calculates the *immidiate dominator* of each vertex called " +"The algorithm calculates the *immediate dominator* of each vertex called " "**idom**, once **idom** of each vertex is calculated then by making every " "**idom** of each vertex as its parent, the dominator tree can be built." msgstr "" @@ -13998,7 +14004,7 @@ msgid "" "wanted." msgstr "需要使用边 4 -> 7 从顶点 6 到顶点 3 的软限制。" -msgid "Idenifying the restriction" +msgid "Identifying the restriction" msgstr "识别限制" msgid "" @@ -14008,7 +14014,7 @@ msgstr "运行 :doc:`pgr_dijkstraNear` 时，成本将会增加的地方是边 8 msgid "" "The edge to be altered is ``WHERE cost = 0 AND seq != 1 AND edge != -1`` " -"from the previus query:" +"from the previous query:" msgstr "" "要更改的边是上一个查询中的 ``WHERE cost = 0 AND seq != 1 AND edge != -1`` ：" @@ -14223,6 +14229,9 @@ msgid "" msgstr "" "``pgr_maxFlow`` —使用 Push Relabel 算法计算有向图中从源到目标的最大流量。" +msgid "pgr_maxFlow(Combinations)" +msgstr "pgr_maxFlow(组合)" + msgid "Calculates the maximum flow from the sources to the targets." msgstr "计算从源头到目标的最大流量。" @@ -14389,6 +14398,16 @@ msgid "" "\"noded\" edges into a new table." msgstr "该函数从非\"noded\"网络表中读取边，并将\"noded\"边写入新表中。" +msgid "Not checking and not creating indexes." +msgstr "" + +msgid "Using ``pgr_separateTouching`` and ``pgr_separateCrossing``." +msgstr "" + +#, fuzzy +msgid "Created table with ``BIGINT``." +msgstr "``seq`` 将类型更改为``BIGINT``" + msgid "" "A common problem associated with bringing GIS data into pgRouting is the " "fact that the data is often not \"noded\" correctly. This will create " @@ -14447,11 +14466,11 @@ msgid "``integer`` Segment number of the original edge" msgstr "``integer`` 原边的段号" #, fuzzy -msgid "``integer`` Empty source column" +msgid "``bigint`` Empty source column" msgstr "在source 列" #, fuzzy -msgid "``integer`` Empty target column" +msgid "``bigint`` Empty target column" msgstr "在target列" msgid "the geom" @@ -14467,21 +14486,10 @@ msgstr "示例" msgid "Create the topology for the data in :doc:`sampledata`" msgstr "让我们为 :doc:`sampledata` 中的数据创建拓扑" -msgid "Analyze the network for intersections." -msgstr "" - -#, fuzzy -msgid "Analyze the network for gaps." -msgstr "现在我们可以分析网络了。" - #, fuzzy msgid "The analysis tell us that the network has a gap and an intersection." msgstr "分析告诉我们，网络存在缺口和交叉点。 我们尝试使用以下方法解决该问题：" -#, fuzzy -msgid "Fixing an intersection" -msgstr "交叉口" - #, fuzzy msgid "Storing the intersections." msgstr "添加限制" @@ -14496,10 +14504,6 @@ msgid "" "segmented." msgstr "检查生成的表，我们可以看到边 13,14 和 18 已被分段" -#, fuzzy -msgid "Update the topology" -msgstr "更新边拓扑" - #, fuzzy msgid "Add new segments to the edges table." msgstr "在边表上" @@ -14508,10 +14512,6 @@ msgstr "在边表上" msgid "Insert the intersection as new vertices." msgstr "兴趣点" -#, fuzzy -msgid "Update source and target information on the edges table." -msgstr "红色箭头显示边表上的边 ``(source, target)``" - #, fuzzy msgid "Delete original edge." msgstr "原始订单" @@ -14520,9 +14520,6 @@ msgstr "原始订单" msgid "Update the vertex topology" msgstr "更新顶点拓扑" -msgid "Fixing a gap" -msgstr "" - #, fuzzy msgid "Store the deadends" msgstr "获取死端：" @@ -14838,6 +14835,9 @@ msgstr "" "``pgr_pushRelabel`` — 使用 Push Relabel 算法计算图边上的流量，以最大化从源到" "目标的流量。" +msgid "pgr_pushRelabel(Combinations)" +msgstr "pgr_pushRelabel(组合)" + msgid "Renamed from ``pgr_maxFlowPushRelabel``" msgstr "由 ``pgr_maxFlowPushRelabel`` 重命名" @@ -14856,6 +14856,63 @@ 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_separateCrossing``" +msgstr "``pgr_separateCrossing``" + +msgid "" +"``pgr_separateCrossing`` - From crossing geometries generates geometries " +"that do not cross." +msgstr "" + +msgid "This is an auxiliary function for separating crossing edges." +msgstr "" + +msgid "pgr_separateCrossing(`Edges SQL`_, [``tolerance``, ``dryrun``])" +msgstr "pgr_separateCrossing(`Edges SQL`_, [``tolerance``, ``dryrun``])" + +msgid "RETURNS |result-separate|" +msgstr "RETURNS |result-separate|" + +#, fuzzy +msgid "Get the segments of the crossing geometries" +msgstr "该点位于边的哪个位置。" + +msgid "``tolerance``" +msgstr "``tolerance``" + +msgid "0.01" +msgstr "0.01" + +msgid "Used in ST_Snap before ST_Split" +msgstr "" + +#, fuzzy +msgid "Get the code for further refinement." +msgstr "位于该段的两侧。" + +msgid "" +"When there are special details that need to be taken care of because of the " +"final application or the quality of the data, the code can be obtained On a " +"PostgreSQL ``NOTICE`` using the ``dryrun`` flag." +msgstr "" + +msgid "``pgr_separateTouching``" +msgstr "``pgr_separateTouching``" + +msgid "" +"``pgr_separateTouching`` - From touching geometries generates geometries " +"that are properly connected at endpoints" +msgstr "" + +msgid "" +"This is an auxiliary function for processing geometries that touch but don't " +"share exact endpoints, splitting them at their intersection points to " +"improve network connectivity." +msgstr "" + +msgid "pgr_separateTouching(`Edges SQL`_, [``tolerance``, ``dryrun``])" +msgstr "pgr_separateTouching(`Edges SQL`_, [``tolerance``, ``dryrun``])" + msgid "``pgr_sequentialVertexColoring`` - Proposed" msgstr "``pgr_sequentialVertexColoring`` - 拟议" @@ -15158,7 +15215,7 @@ msgstr "" msgid "The returned values are not ordered" msgstr "返回值未排序" -msgid "The returned graph is compresed" +msgid "The returned graph is compressed" msgstr "返回的图被压缩" msgid "Running time: :math:`O(|V||E|)`" @@ -15199,8 +15256,9 @@ msgstr "" msgid "https://en.wikipedia.org/wiki/Transitive_closure" msgstr "https://en.wikipedia.org/wiki/Transitive_closure" -msgid "``pgr_trsp``" -msgstr "``pgr_trsp``" +#, fuzzy +msgid "``pgr_trsp`` - Proposed" +msgstr "``pgr_trsp`` - 提议" msgid "``pgr_trsp`` - routing vertices with restrictions." msgstr "``pgr_trsp`` -有限制的路由顶点。" @@ -15223,12 +15281,20 @@ msgstr "pgr_trsp （组合）" msgid "Deprecated signatures" msgstr "弃用签名" +msgid "pgr_trsp(text,integer,integer,boolean,boolean,text)" +msgstr "pgr_trsp(text,integer,integer,boolean,boolean,text)" + msgid "pgr_trsp(text,integer,float,integer,float,boolean,boolean,text)" msgstr "pgr_trsp(text,integer,float,integer,float,boolean,boolean,text)" msgid "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" msgstr "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" +msgid "" +"pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" +msgstr "" +"pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" + msgid "New prototypes" msgstr "新原型" @@ -15320,8 +15386,9 @@ msgid "" "`Deprecated documentation `_" msgstr "` 已弃用文档 `_" -msgid "``pgr_trspVia``" -msgstr "``pgr_trspVia``" +#, fuzzy +msgid "``pgr_trspVia`` - Proposed" +msgstr "``pgr_trspVia`` -拟议" msgid "" "``pgr_trspVia`` Route that goes through a list of vertices with restrictions." @@ -15419,7 +15486,8 @@ msgstr "因此，当设置为 ``false`` 时，结果会忽略 ``U_turn_on_edge`` msgid ":doc:`via-category`" msgstr ":doc:`via-category`" -msgid "``pgr_trspVia_withPoints``" +#, fuzzy +msgid "``pgr_trspVia_withPoints`` - Proposed" msgstr "``pgr_trspVia_withPoints``" msgid "" @@ -15610,8 +15678,8 @@ msgstr "" "`pgr_withPointsVia` 结果中，它删除了冲突路径，并使用 :doc:`pgr_trsp` 算法的结" "果构建解决方案。 在这种情况下，使用相同的边缘完成 U 形转弯。" -msgid "``pgr_trsp_withPoints``" -msgstr "``pgr_trsp_withPoints``" +msgid "``pgr_trsp_withPoints`` - Proposed" +msgstr "``pgr_trsp_withPoints`` - 拟议" msgid "``pgr_trsp_withPoints`` Routing Vertex/Point with restrictions." msgstr "``pgr_trsp_withPoints`` 有限制的路由顶点/点。" @@ -15832,8 +15900,8 @@ msgstr "**无可用文档**" msgid "**TBD**" msgstr "**TBD**" -msgid "``pgr_withPoints``" -msgstr "``pgr_withPoints``" +msgid "``pgr_withPoints`` - Proposed" +msgstr "``pgr_withPoints`` - 拟议" msgid "" "``pgr_withPoints`` - Returns the shortest path in a graph with additional " @@ -15991,8 +16059,8 @@ msgstr "对于点 :math:`6` 和顶点 :math:`11`。" msgid "Passes in front or visits with left side driving." msgstr "从前方超车或以左侧驾驶方式行驶。" -msgid "``pgr_withPointsCost``" -msgstr "``pgr_withPointsCost``" +msgid "``pgr_withPointsCost`` - Proposed" +msgstr "``pgr_withPointsCost`` - 拟议" msgid "" "``pgr_withPointsCost`` - Calculates the shortest path and returns only the " @@ -16159,8 +16227,8 @@ msgstr "左侧驾驶拓扑" msgid "Does not matter driving side driving topology" msgstr "与驱动端驱动拓扑无关" -msgid "``pgr_withPointsCostMatrix``" -msgstr "``pgr_withPointsCostMatrix``" +msgid "``pgr_withPointsCostMatrix`` - proposed" +msgstr "``pgr_withPointsCostMatrix`` - 拟议" msgid "" "``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:" @@ -16196,8 +16264,8 @@ msgid "" msgstr "" "求从顶点 :math:`1` 到图上点 `(2.9, 1.8)` 的两个最近位置的路线的矩阵成本。" -msgid "``pgr_withPointsDD``" -msgstr "``pgr_withPointsDD``" +msgid "``pgr_withPointsDD`` - Proposed" +msgstr "``pgr_withPointsDD`` - 拟议" msgid "" "``pgr_withPointsDD`` - Returns the driving **distance** from a starting " @@ -16361,16 +16429,13 @@ msgstr "" "从点 :math:`1` 开始，在距离不超过 :math:`3.3` 的范围内，无论驾驶方向如何，提" "供详细信息。" -msgid "``pgr_withPointsKSP``" -msgstr "``pgr_withPointsKSP``" +msgid "``pgr_withPointsKSP`` - Proposed" +msgstr "``pgr_withPointsKSP``- 拟议" msgid "" "``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." 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(一对一)" @@ -16527,8 +16592,8 @@ msgstr "" "使用右侧驾驶拓扑，从点 :math:`1` 到点 :math:`2` 获取 :math:`2` 条路径，同时使" "用堆路径（heap paths）并包含详细信息。" -msgid "``pgr_withPointsVia``" -msgstr "``pgr_withPointsVia``" +msgid "``pgr_withPointsVia`` - Proposed" +msgstr "``pgr_withPointsVia`` - 拟议" msgid "" "``pgr_withPointsVia`` - Route that goes through a list of vertices and/or " @@ -16641,6 +16706,14 @@ msgid "" ":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." msgstr ":doc:`pgr_lineGraph` - 用于生成折线图的转换算法。" +msgid ":doc:`pgr_separateCrossing` - Breaks geometries that cross each other." +msgstr "" + +msgid "" +":doc:`pgr_separateTouching` - Breaks geometries that (almost) touch each " +"other." +msgstr "" + msgid ":doc:`withPoints-family` - Functions based on Dijkstra algorithm." msgstr ":doc:`withPoints-family` -基于 Dijkstra 算法的函数。" @@ -16663,15 +16736,6 @@ msgstr "" msgid "Mayors" msgstr "主要版本" -msgid "pgRouting 4" -msgstr "pgRouting 4" - -msgid "Minors 4.x" -msgstr "Minors 4.x" - -msgid "pgRouting 4.0" -msgstr "pgRouting 4.0" - msgid "pgRouting 3" msgstr "pgRouting 3" @@ -16682,118 +16746,43 @@ msgstr "3.x小版本" msgid "pgRouting 3.8" msgstr "pgRouting 3.7" -#, fuzzy -msgid "pgRouting 3.8.0 Release Notes" -msgstr "pgRouting 3.7.0 发布说明" - #, fuzzy msgid "" -"To see all issues & pull requests closed by this release see the `Git closed " -"milestone for 3.8.0 `__" -msgstr "" -"查看本版本已关闭的所有议题和拉取请求，请访问：`GitHub 3.7.0版本里程碑关闭列" -"表 >`__" - -#, fuzzy -msgid "Promotion to official function of pgRouting." -msgstr "pgRouting 中的拟议已升级为正式版本" - -#, fuzzy -msgid "" -"`#2772 `__: " -"pgr_extractVertices" -msgstr "" -"`#2087 `__:拟议的 " -"pgr_extractVertices" - -#, fuzzy -msgid "" -"`#2760 `__: pgr_degree" -msgstr "" -"`#2266 `__：错误处理限制" - -#, fuzzy -msgid "" -"`#2774 `__: " -"pgr_findCloseEdges" +"`#2772 `__: Promote to " +"official pgr_extractVertices in 3.8" msgstr "" "`#2087 `__:拟议的 " "pgr_extractVertices" -#, fuzzy -msgid "Deprecation of functions." -msgstr "已废弃的函数" - -#, fuzzy -msgid "" -"`#2749 `__: " -"pgr_alphaShape" -msgstr "" -"`#2266 `__：错误处理限制" - -#, fuzzy -msgid "" -"`#2754 `__: " -"pgr_analyzeOneWay" -msgstr "" -"`#2266 `__：错误处理限制" - #, fuzzy msgid "" -"`#2753 `__: " -"pgr_analyzeGraph" +"`#2760 `__: Promote to " +"official pgr_degree in 3.8" msgstr "" "`#2266 `__：错误处理限制" #, fuzzy msgid "" -"`#2750 `__: " -"pgr_createTopology" -msgstr "" -"`#2266 `__：错误处理限制" - -#, fuzzy -msgid "" -"`#2826 `__: " -"pgr_createVerticesTable" +"`#2774 `__: Promote to " +"official pgr_findCloseEdges in 3.8" msgstr "" "`#2087 `__:拟议的 " "pgr_extractVertices" -msgid "Official functions changes" -msgstr "官方功能变更" - -#, fuzzy -msgid "" -"`#2786 `__: " -"pgr_contraction" -msgstr "" -"`#2266 `__：错误处理限制" - msgid "New proposed functions" msgstr "新的拟议函数" #, fuzzy -msgid "Contraction" -msgstr "收缩：" +msgid "Deprecation of functions." +msgstr "已废弃的函数" #, fuzzy -msgid "" -"`#2790 `__: " -"pgr_contractionDeadEnd" -msgstr "" -"`#2087 `__:拟议的 " -"pgr_extractVertices" +msgid "Deprecated functions:" +msgstr "已废弃的功能" #, fuzzy -msgid "" -"`#2791 `__: " -"pgr_contractionLinear" -msgstr "" -"`#1002 `__：修复收缩问" -"题：" +msgid "The use removed." +msgstr "哪些可以删除" msgid "pgRouting 3.7" msgstr "pgRouting 3.7" @@ -16870,9 +16859,9 @@ msgid "" "milestone for 3.7.1 `__" msgstr "" -"查看本版本已关闭的所有议题和拉取请求，请访问：`GitHub " -"3.7.1版本里程碑关闭列表 `__" +"查看本版本已关闭的所有议题和拉取请求，请访问：`GitHub 3.7.1版本里程碑关闭列" +"表 `__" msgid "" "`#2680 `__ fails to " @@ -17162,9 +17151,6 @@ msgstr "" "`#2546 `__ 标准化输出并修改" "签名pgr_withPointsKSP" -msgid "C/C++ code enhancements" -msgstr "C/C++ 代码增强" - msgid "" "`#2504 `__ To C++ pg data " "get, fetch and check." @@ -17418,6 +17404,12 @@ msgstr "pgr_trspVia(One Via)" msgid "pgr_trspVia_withPoints(One Via)" msgstr "pgr_trspVia_withPoints（一次通过）" +msgid "pgr_trsp" +msgstr "pgr_trsp" + +msgid "``pgr_trsp_withPoints``" +msgstr "``pgr_trsp_withPoints``" + msgid "pgr_trsp_withPoints(One to One)" msgstr "pgr_trsp_withPoints（一对一）" @@ -17436,9 +17428,6 @@ msgstr "pgr_trsp_withPoints（组合）" msgid "Topology" msgstr "拓扑结构" -msgid "Utilities" -msgstr "实用程序" - msgid "pgr_findCloseEdges(One point)" msgstr "pgr_findCloseEdges（单点）" @@ -18939,6 +18928,9 @@ msgstr "pgr_TSP" msgid "pgr_eucledianTSP" msgstr "pgr_eucledianTSP" +msgid "pgr_withPointsCostMatrix" +msgstr "pgr_withPointsCostMatrix" + #, fuzzy msgid "pgr_maxFlowPushRelabel(One to One)" msgstr "pgr_maxFlowPushRelabel(一对一)" @@ -19170,6 +19162,9 @@ msgstr "pgr_withPointsDD （单顶点）" msgid "pgr_withPointsDD(multiple vertices)" msgstr "pgr_withPointsDD（多顶点）" +msgid "pgr_withPointsKSP" +msgstr "pgr_withPointsKSP" + msgid "pgr_dijkstraVia" msgstr "pgr_dijkstraVia" @@ -19982,16 +19977,8 @@ msgstr "" "据最终应用程序的需要，需要创建合适的拓扑。" #, fuzzy -msgid "" -"pgRouting supplies some functions to create a routing topology and to " -"analyze the topology." -msgstr "pgRouting 提供一些函数来创建路由拓扑并分析拓扑。" - -msgid "Additional functions to create a graph:" -msgstr "创建图表的附加函数：" - -msgid "Additional functions to analyze a graph:" -msgstr "用于分析图表的附加函数：" +msgid "Utility functions" +msgstr "流程函数" msgid "Transformation - Family of functions" msgstr "转换 - 函数族" @@ -20167,7 +20154,7 @@ msgid "About points" msgstr "关于积分" msgid "" -"For this section the following city (see :doc:`sampledata`) some interesing " +"For this section the following city (see :doc:`sampledata`) some interesting " "points such as restaurant, supermarket, post office, etc. will be used as " "example." msgstr "" @@ -20205,7 +20192,8 @@ msgstr "数据库上的表示遵循 `Points SQL`_ 描述，对于本示例：" msgid "Driving side" msgstr "驾驶侧" -msgid "In the the folowwing images:" +#, fuzzy +msgid "In the following images:" msgstr "在下面的图片中：" msgid "The squared vertices are the temporary vertices," @@ -20249,7 +20237,7 @@ msgstr "点 **4** 位于边 ``(3, 1)``" msgid "Like having all points to be considered in both sides ``b``" msgstr "就像双方都要考虑所有点 ``b``" -msgid "Prefered usage on **undirected** graphs" +msgid "Preferred usage on **undirected** graphs" msgstr "**无向** 图上的首选用法" msgid "On the :doc:`TRSP-family` this option is not valid" @@ -20284,7 +20272,7 @@ msgstr "插入点：" msgid "On a right hand side driving network" msgstr "在右侧行驶网络" -msgid "Arrival to point ``-2`` can be achived only via vertex **16**." +msgid "Arrival to point ``-2`` can be achieved only via vertex **16**." msgstr "只能通过顶点 **16** 才能到达点 ``-2``。" msgid "Does not affects edge ``(17, 16)``, therefore the edge is kept." @@ -20301,7 +20289,7 @@ msgid "" "0.4`)" msgstr "边 ``(16, -2)`` 的成本为``0.4`` （原始成本*分数 == :math:`1 * 0.4`）" -msgid "Edge ``(-2, 17)`` with cost ``0.6`` (the remaing cost)" +msgid "Edge ``(-2, 17)`` with cost ``0.6`` (the remaining cost)" msgstr "边 ``(-2, 17)`` 的成本为``0.6`` （剩余成本）" msgid "The total cost of the additional edges is equal to the original cost." @@ -20314,7 +20302,7 @@ msgstr "如果同一条边上有更多点，则递归地重复该过程。" msgid "On a left hand side driving network" msgstr "在左侧驾驶网络上" -msgid "Arrival to point ``-2`` can be achived only via vertex **17**." +msgid "Arrival to point ``-2`` can be achieved only via vertex **17**." msgstr "只能通过顶点 **17** 才能到达点 ``-2``。" msgid "Does not affects edge ``(16, 17)``, therefore the edge is kept." @@ -20344,7 +20332,7 @@ msgstr "边 ``(-2, 16)`` 变为 ``(17, -2)``，成本为 ``0.6`` ，并添加到 msgid "When driving side does not matter" msgstr "当驾驶侧无关紧要时" -msgid "Arrival to point ``-2`` can be achived via vertices **16** or **17**." +msgid "Arrival to point ``-2`` can be achieved via vertices **16** or **17**." msgstr "可以通过顶点 **16** 或 **17** 到达点 ``-2``。" msgid "" @@ -20405,4 +20393,3 @@ msgstr "pgr_withPointsDD 是 **带有点** 的 pgr_drivenDistance" msgid "pgr_withPointsvia is pgr_dijkstraVia **with points**" msgstr "pgr_withPointsvia 是 pgr_dijkstraVia **with points** 的版本" - diff --git a/tools/release-scripts/notes2news.pl b/tools/release-scripts/notes2news.pl index b02d084ff02..13ffd228afb 100755 --- a/tools/release-scripts/notes2news.pl +++ b/tools/release-scripts/notes2news.pl @@ -46,29 +46,57 @@ sub Usage { my $file = ''; my $start = ''; my $end = ''; +my $major = ''; +my $found_micro = 0; +my $found_minor; +my $title; + +print $ofh "To read all history of releases go to the latest " . + "[release notes](https://docs.pgrouting.org/latest/en/release_notes.html)\n\n"; while (my $line = <$ifh>) { next if $skipping and $line !~ /^pgRouting/; $skipping = 0; - next if $line =~ /contents|:local:|:depth:|\*\*\*\*\*\*\*|\=\=\=\=\=\=\=|\-\-\-\-\-\-\-|\+\+\+\+\+\+\+\+/; + next if $line =~ /current|contents|:local:|:depth:|\*\*\*\*\*\*\*|\=\=\=\=\=\=\=|\-\-\-\-\-\-\-|\+\+\+\+\+\+\+\+/; $line =~ s/[\|]+//g; $line =~ s/($check)/$conversions{$1}/go; # Handling the headers if ($line =~ m/^pgRouting [0-9]$/i) { + if ($major ne '') { + print $ofh "\n"; + last; + } + if ($found_micro > 1 && $title eq 'micro') { + print $ofh "\n\n"; + } + ($major = $line) =~ s/[^\d]//g if $major eq ''; print $ofh "# $line"; + $title='major'; next; }; if ($line =~ m/^pgRouting [0-9].[0-9]$/i) { + if ($found_micro > 1 && $title eq 'micro') { + print $ofh "\n\n"; + } print $ofh "## $line"; + $title='minor'; next; }; if ($line =~ m/^pgRouting [0-9].[0-9].[0-9] Release Notes$/i) { - print $ofh "### $line"; + if ($found_micro != 0 && $title eq 'micro') { + print $ofh "\n\n"; + } + print $ofh "### $line" if $found_micro == 0; + chomp($line); + print $ofh "
$line\n" if $found_micro; + $found_micro += 1; + $title='micro'; next; }; + # get include filename if ($line =~ /include/) { $line =~ s/^.*include\:\: (.*)/$1/; @@ -126,7 +154,6 @@ sub Usage { print $ofh $line; } - close($ifh); close($ofh);