diff --git a/.github/workflows/boost_version.yml b/.github/workflows/boost_version.yml index 03b703eb736..9ce684a5226 100644 --- a/.github/workflows/boost_version.yml +++ b/.github/workflows/boost_version.yml @@ -131,5 +131,5 @@ jobs: sudo service postgresql start psql -c "CREATE DATABASE ___pgr___test___;" DIR=$(git rev-parse --show-toplevel) - bash "${DIR}/tools/testers/setup_db.sh" "${PGPORT}" ___pgr___test___ "${PG_RUNNER_USER}" "3.7.3" + bash "${DIR}/tools/testers/setup_db.sh" "${PGPORT}" ___pgr___test___ "${PG_RUNNER_USER}" "3.8.0" pg_prove -Q -f --normalize --directives --recurse -U "${PG_RUNNER_USER}" -d ___pgr___test___ "pgtap" diff --git a/.github/workflows/update-locale.yml b/.github/workflows/update-locale.yml index 9e932084838..912abe38be6 100644 --- a/.github/workflows/update-locale.yml +++ b/.github/workflows/update-locale.yml @@ -8,8 +8,12 @@ name: Update Locale on: workflow_dispatch: push: - branches: - - 'develop' + paths: + - '.github/workflows/update-locale.yml' + - 'doc/**' + + branches-ignore: + - 'gh-pages' permissions: contents: read @@ -20,7 +24,6 @@ jobs: contents: write # for Git to git push name: Update Locale runs-on: ubuntu-latest - if: ${{ github.repository_owner == 'pgRouting' }} strategy: fail-fast: false diff --git a/.github/workflows/update.yml b/.github/workflows/update.yml index 8784c017c51..3f6c97fd1f3 100644 --- a/.github/workflows/update.yml +++ b/.github/workflows/update.yml @@ -29,7 +29,7 @@ jobs: fail-fast: false matrix: boost_minor: [56] - old_pgr: [3.7.2, 3.7.1, 3.7.0, 3.6.3, 3.6.2, 3.6.1, 3.6.0, 3.5.1, 3.5.0, 3.4.2, 3.4.1, 3.4.0, 3.3.5, 3.3.4, 3.3.3, 3.3.2, 3.3.1, 3.3.0, 3.0.0, 3.0.1, 3.0.2, 3.0.3, 3.0.4, 3.0.6, 3.1.0, 3.1.1, 3.1.2, 3.1.3, 3.2.0, 3.2.1, 3.2.2] + old_pgr: [3.7.3, 3.7.2, 3.7.1, 3.7.0, 3.6.3, 3.6.2, 3.6.1, 3.6.0, 3.5.1, 3.5.0, 3.4.2, 3.4.1, 3.4.0, 3.3.5, 3.3.4, 3.3.3, 3.3.2, 3.3.1, 3.3.0, 3.0.0, 3.0.1, 3.0.2, 3.0.3, 3.0.4, 3.0.6, 3.1.0, 3.1.1, 3.1.2, 3.1.3, 3.2.0, 3.2.1, 3.2.2] steps: - uses: actions/checkout@v4 @@ -126,6 +126,6 @@ jobs: run: | sudo service postgresql start psql -p "${PGPORT}" -d ___pgr___test___ -c "SELECT * FROM pgr_full_version();" - psql -p "${PGPORT}" -d ___pgr___test___ -c "ALTER EXTENSION pgrouting UPDATE TO '3.7.3';" + psql -p "${PGPORT}" -d ___pgr___test___ -c "ALTER EXTENSION pgrouting UPDATE TO '3.8.0';" psql -p "${PGPORT}" -d ___pgr___test___ -c "SELECT * FROM pgr_full_version();" pg_prove -Q -f --normalize --directives --recurse -U "${PG_RUNNER_USER}" -d ___pgr___test___ "pgtap" diff --git a/CMakeLists.txt b/CMakeLists.txt index 9fd92c90b59..58a4e0c0f4a 100644 --- a/CMakeLists.txt +++ b/CMakeLists.txt @@ -30,7 +30,7 @@ include(pgr/BuildType) #--------------------------------------------- #--------------------------------------------- -project(PGROUTING VERSION 3.7.3 +project(PGROUTING VERSION 3.8.0 LANGUAGES C CXX ) set(PROJECT_VERSION_DEV "") string(TOLOWER "${PROJECT_NAME}" PROJECT_NAME_LOWER) @@ -43,8 +43,9 @@ set(PROJECT_LIB_NAME "${PROJECT_NAME_LOWER}-${PROJECT_LIB_VERSION}") string(TIMESTAMP COMPILATION_DATE "%Y/%m/%d" UTC) -set(MINORS 3.7 3.6 3.5 3.4 3.3 3.2 3.1 3.0 2.6) +set(MINORS 3.8 3.7 3.6 3.5 3.4 3.3 3.2 3.1 3.0 2.6) set(OLD_SIGNATURES + 3.7.3 3.7.2 3.7.1 3.7.0 diff --git a/NEWS.md b/NEWS.md index 2dd32ff8665..07445be9e4b 100644 --- a/NEWS.md +++ b/NEWS.md @@ -1,11 +1,17 @@ # pgRouting 3 -## pgRouting 3.7 +## pgRouting 3.8 .. current +### pgRouting 3.8.0 Release Notes + +No Changes Yet + +## pgRouting 3.7 + ### pgRouting 3.7.3 Release Notes To see all issues & pull requests closed by this release see the [Git closed @@ -218,12 +224,12 @@ milestone for 3.6.0 * pgr_ksp(Combinations) * [#2548](https://github.com/pgRouting/pgrouting/pull/2548) Standarize output - pgr_drivingdistance + pgr_drivingDistance * Standarizing output columns to ``(seq, depth, start_vid, pred, node, edge, cost, agg_cost)`` - * pgr_drivingdistance(Single vertex) + * pgr_drivingDistance(Single vertex) * Added ``depth`` and ``start_vid`` result columns. - * pgr_drivingdistance(Multiple vertices) + * pgr_drivingDistance(Multiple vertices) * Result column name change: ``from_v`` to ``start_vid``. * Added ``depth`` and ``pred`` result columns. @@ -444,9 +450,9 @@ milestone for 3.4.0 * Flow functions - * pgr_maxCardinalityMatch(text)`` + * pgr_maxCardinalityMatch(text) - * Deprecating ``pgr_maxCardinalityMatch(text,boolean)`` + * Deprecating: pgr_maxCardinalityMatch(text,boolean) **Deprecated Functions** @@ -919,7 +925,7 @@ on Github. * [#1006](https://github.com/pgRouting/pgrouting/issues/1006): No loss of information -**New functions** +**New Functions** * Kruskal family @@ -940,66 +946,57 @@ on Github. * aStar Family - * 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(one to one) - * pgr_aStarCostMatrix(one to many) - * pgr_aStarCostMatrix(many to one) - * pgr_aStarCostMatrix(many to many) + * 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 * bdAstar Family - * 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(one to one) - * pgr_bdAstarCostMatrix(one to many) - * pgr_bdAstarCostMatrix(many to one) - * pgr_bdAstarCostMatrix(many to many) + * 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 * bdDijkstra Family - * 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(one to one) - * pgr_bdDijkstraCostMatrix(one to many) - * pgr_bdDijkstraCostMatrix(many to one) - * pgr_bdDijkstraCostMatrix(many to many) + * 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 * Flow Family - * pgr_pushRelabel(one to one) - * pgr_pushRelabel(one to many) - * pgr_pushRelabel(many to one) - * pgr_pushRelabel(many to many) - * pgr_edmondsKarp(one to one) - * pgr_edmondsKarp(one to many) - * pgr_edmondsKarp(many to one) - * pgr_edmondsKarp(many to many) - * pgr_boykovKolmogorov (one to one) - * pgr_boykovKolmogorov (one to many) - * pgr_boykovKolmogorov (many to one) - * pgr_boykovKolmogorov (many to many) + * pgr_pushRelabel(One to One) + * pgr_pushRelabel(One to Many) + * pgr_pushRelabel(Many to One) + * pgr_pushRelabel(Many to Many) + * pgr_edmondsKarp(One to One) + * pgr_edmondsKarp(One to Many) + * pgr_edmondsKarp(Many to One) + * pgr_edmondsKarp(Many to Many) + * pgr_boykovKolmogorov (One to One) + * pgr_boykovKolmogorov (One to Many) + * pgr_boykovKolmogorov (Many to One) + * pgr_boykovKolmogorov (Many to Many) * pgr_maxCardinalityMatching * pgr_maxFlow - * pgr_edgeDisjointPaths(one to one) - * pgr_edgeDisjointPaths(one to many) - * pgr_edgeDisjointPaths(many to one) - * pgr_edgeDisjointPaths(many to many) + * pgr_edgeDisjointPaths(One to One) + * pgr_edgeDisjointPaths(One to Many) + * pgr_edgeDisjointPaths(Many to One) + * pgr_edgeDisjointPaths(Many to Many) * Components family @@ -1114,7 +1111,7 @@ on Github. * pgr_floydWarshall * pgr_johnson - * pgr_astar + * pgr_aStar * pgr_bdAstar * pgr_bdDijstra * pgr_alphashape @@ -1197,13 +1194,15 @@ on Github. ### 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. +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_aStar * pgr_bdAstar * pgr_bdDijstra * pgr_alphashape @@ -1284,29 +1283,29 @@ on Github. * 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 + * The many version results are the union of the One to One version **New Signatures** -* pgr_bdAstar(one to one) +* 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_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_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 @@ -1371,7 +1370,7 @@ 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 Function.** +**New Functions** * pgr_bdDijkstra @@ -1379,14 +1378,14 @@ on Github. **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 +* 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.** @@ -1456,30 +1455,30 @@ on Github. * 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_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_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 +* pgr_aStar - use pgr_aStar instead **Deprecated Functions** @@ -1563,21 +1562,21 @@ on Github. - pgr_floydWarshall - pgr_Johnson -- pgr_dijkstraCost(one to one) -- pgr_dijkstraCost(one to many) -- pgr_dijkstraCost(many to one) -- pgr_dijkstraCost(many to many) +- 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_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 @@ -1606,14 +1605,14 @@ on Github. **New Signatures** -- pgr_dijkstra(one to many) -- pgr_dijkstra(many to one) -- pgr_dijkstra(many to many) +- 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_dijkstra(One to One) - pgr_ksp - pgr_drivingDistance(single vertex) diff --git a/doc/CMakeLists.txt b/doc/CMakeLists.txt index 75e79524e2f..9608406041e 100644 --- a/doc/CMakeLists.txt +++ b/doc/CMakeLists.txt @@ -264,7 +264,7 @@ if (LOCALE) "${PGR_DOCUMENTATION_SOURCE_DIR}" "${CMAKE_SOURCE_DIR}/locale/pot" - COMMAND sphinx-intl update -d ${CMAKE_SOURCE_DIR}/locale -l en > locale_changes.txt + COMMAND sphinx-intl update -p ${CMAKE_SOURCE_DIR}/locale/pot -d ${CMAKE_SOURCE_DIR}/locale -l en > locale_changes.txt #COMMAND sphinx-intl update -p ${CMAKE_SOURCE_DIR}/locale/pot -d ${CMAKE_SOURCE_DIR}/locale --language=${SPHINXINTL_LANGUAGE} #COMMAND sphinx-intl update-txconfig-resources --locale-dir ${CMAKE_SOURCE_DIR}/locale --pot-dir ${CMAKE_SOURCE_DIR}/locale/pot --transifex-project-name pgrouting @@ -295,6 +295,8 @@ foreach (target ${PROJECT_DOC_TARGETS}) #-q # Enable for quiet mode #-Q # Enable for even more quiet mode -v # increase verbosity + -n # warn about all missing references + --color -W --keep-going -j auto diff --git a/doc/_static/page_history.js b/doc/_static/page_history.js index c29bbf5d25f..7ca90a091ae 100644 --- a/doc/_static/page_history.js +++ b/doc/_static/page_history.js @@ -4,7 +4,7 @@ function createInfo(file, newat, altnames = '') { this.altnames = altnames; } -var versionsArr = ['3.7', '3.6', '3.5', '3.4', '3.3', '3.2', '3.1', '3.0']; +const versionsArr = ['3.8','3.7', '3.6', '3.5', '3.4', '3.3', '3.2', '3.1', '3.0']; var unsuportedArr = ['2.6', '2.5', '2.4', '2.3', '2.2', '2.1', '2.0']; var titles = [ {k: 'en', v: ['Supported versions', 'Unsupported versions']}, diff --git a/doc/allpairs/pgr_floydWarshall.rst b/doc/allpairs/pgr_floydWarshall.rst index d23f2a1096a..c9709d91c2d 100644 --- a/doc/allpairs/pgr_floydWarshall.rst +++ b/doc/allpairs/pgr_floydWarshall.rst @@ -28,7 +28,7 @@ each pair of nodes in the graph using Floyd-Warshall algorithm. * Version 2.0.0 - * Official function. + * New official function. Description ------------------------------------------------------------------------------- diff --git a/doc/allpairs/pgr_johnson.rst b/doc/allpairs/pgr_johnson.rst index 2e4f094e47d..d489b26a505 100644 --- a/doc/allpairs/pgr_johnson.rst +++ b/doc/allpairs/pgr_johnson.rst @@ -28,7 +28,7 @@ pair of nodes in the graph using Floyd-Warshall algorithm. * Version 2.0.0 - * Official function. + * New official function. Description ------------------------------------------------------------------------------- diff --git a/doc/alpha_shape/pgr_alphaShape.rst b/doc/alpha_shape/pgr_alphaShape.rst index 91e7ccf2e23..e57f1a75ad2 100644 --- a/doc/alpha_shape/pgr_alphaShape.rst +++ b/doc/alpha_shape/pgr_alphaShape.rst @@ -36,7 +36,7 @@ * Version 2.0.0 - * Official function. + * New official function. * Renamed from version 1.x .. rubric:: Support @@ -64,7 +64,7 @@ Characteristics Signatures ------------------------------------------------------------------------------- -.. rubric:: Summary + .. admonition:: \ \ :class: signatures diff --git a/doc/astar/pgr_aStar.rst b/doc/astar/pgr_aStar.rst index 6cd85f73137..15e057a179e 100644 --- a/doc/astar/pgr_aStar.rst +++ b/doc/astar/pgr_aStar.rst @@ -48,13 +48,13 @@ * Version 2.3.0 - * Signature change on pgr_astar(One to One) + * Signature change on pgr_aStar(One to One) * Old signature no longer supported * Version 2.0.0 - * Official function. + * New official function. Description ------------------------------------------------------------------------------- @@ -285,7 +285,7 @@ See Also * :doc:`aStar-family` * :doc:`bdAstar-family` * :doc:`sampledata` -* https://www.boost.org/libs/graph/doc/astar_search.html +* `Boost: A* search `__ * https://en.wikipedia.org/wiki/A*_search_algorithm .. rubric:: Indices and tables diff --git a/doc/bdAstar/bdAstar-family.rst b/doc/bdAstar/bdAstar-family.rst index ce6d03aad0b..71086c8d0f8 100644 --- a/doc/bdAstar/bdAstar-family.rst +++ b/doc/bdAstar/bdAstar-family.rst @@ -53,7 +53,7 @@ The main Characteristics are: * For large graphs where there is a path bewtween the starting vertex and ending vertex: - * It is expected to terminate faster than pgr_astar + * It is expected to terminate faster than pgr_aStar See :ref:`heuristics ` available and :ref:`factor ` handling. @@ -62,7 +62,7 @@ See Also ------------------------------------------------------------------------------- * :doc:`aStar-family` -* `Boost `__ +* `Boost: A* search `__ * https://en.wikipedia.org/wiki/A*_search_algorithm .. rubric:: Indices and tables diff --git a/doc/bdAstar/pgr_bdAstar.rst b/doc/bdAstar/pgr_bdAstar.rst index 3aa0b918894..53b3a5914f7 100644 --- a/doc/bdAstar/pgr_bdAstar.rst +++ b/doc/bdAstar/pgr_bdAstar.rst @@ -52,7 +52,7 @@ * Version 2.0.0 - * Official function. + * New official function. Description ------------------------------------------------------------------------------- @@ -103,7 +103,7 @@ One to One :class: signatures | pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**]) - | **options:** [directed, heuristic, factor, epsilon]`` + | **options:** ``[directed, heuristic, factor, epsilon]`` | Returns set of |short-generic-result| | OR EMPTY SET diff --git a/doc/bdAstar/pgr_bdAstarCostMatrix.rst b/doc/bdAstar/pgr_bdAstarCostMatrix.rst index f3521951a6d..c0464bc4f3b 100644 --- a/doc/bdAstar/pgr_bdAstarCostMatrix.rst +++ b/doc/bdAstar/pgr_bdAstarCostMatrix.rst @@ -56,8 +56,6 @@ Description Signatures ------------------------------------------------------------------------------- -.. rubric:: Summary - .. admonition:: \ \ :class: signatures diff --git a/doc/bdDijkstra/pgr_bdDijkstra.rst b/doc/bdDijkstra/pgr_bdDijkstra.rst index 2a4fc7943bd..67379e72bdb 100644 --- a/doc/bdDijkstra/pgr_bdDijkstra.rst +++ b/doc/bdDijkstra/pgr_bdDijkstra.rst @@ -33,7 +33,7 @@ algorithm. * Version 2.5.0 - * New Proposed signatures: + * New proposed signatures: * pgr_bdDijkstra(One to Many) * pgr_bdDijkstra(Many to One) @@ -47,7 +47,7 @@ algorithm. * Version 2.0.0 - * Official function. + * New official function. Description diff --git a/doc/bellman_ford/pgr_bellmanFord.rst b/doc/bellman_ford/pgr_bellmanFord.rst index 6bd80b9070a..9c185a95a42 100644 --- a/doc/bellman_ford/pgr_bellmanFord.rst +++ b/doc/bellman_ford/pgr_bellmanFord.rst @@ -264,7 +264,7 @@ See Also ------------------------------------------------------------------------------- * :doc:`sampledata` -* `Boost: Belman Ford `__ +* `Boost: Bellman Ford `__ * https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm Boost Graph Inside diff --git a/doc/circuits/pgr_hawickCircuits.rst b/doc/circuits/pgr_hawickCircuits.rst index 9dc6d657a11..30a7c42fdda 100644 --- a/doc/circuits/pgr_hawickCircuits.rst +++ b/doc/circuits/pgr_hawickCircuits.rst @@ -13,10 +13,10 @@ | -``pgr_hawickCircuits - Experimental`` +``pgr_hawickCircuits`` - Experimental =============================================================================== -``pgr_hawickCircuits`` — Returns the list of cirucits using hawick circuits algorithm. +``pgr_hawickCircuits`` — Returns the list of ciruits using hawick circuits algorithm. .. include:: experimental.rst :start-after: warning-begin @@ -60,8 +60,6 @@ implemenent this variation. Signatures ------------------------------------------------------------------------------- -.. rubric:: Summary - .. admonition:: \ \ :class: signatures diff --git a/doc/components/pgr_biconnectedComponents.rst b/doc/components/pgr_biconnectedComponents.rst index c4b08868f35..edce2172d4b 100644 --- a/doc/components/pgr_biconnectedComponents.rst +++ b/doc/components/pgr_biconnectedComponents.rst @@ -25,8 +25,8 @@ * Result columns change: - * n_seq`` is removed - * seq`` changed type to ``BIGINT`` + * ``n_seq`` is removed + * ``seq`` changed type to ``BIGINT`` * Function promoted to official. diff --git a/doc/components/pgr_bridges.rst b/doc/components/pgr_bridges.rst index 8aab2929484..ee459a11211 100644 --- a/doc/components/pgr_bridges.rst +++ b/doc/components/pgr_bridges.rst @@ -106,7 +106,8 @@ See Also * https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29 * :doc:`sampledata` -* `Boost: connected components `__ +* `Boost: Connected components + `__ .. rubric:: Indices and tables diff --git a/doc/components/pgr_connectedComponents.rst b/doc/components/pgr_connectedComponents.rst index a2d932595a7..d4d787edcb5 100644 --- a/doc/components/pgr_connectedComponents.rst +++ b/doc/components/pgr_connectedComponents.rst @@ -25,8 +25,8 @@ a DFS-based approach. * Result columns change: - * n_seq`` is removed - * seq`` changed type to ``BIGINT`` + * ``n_seq`` is removed + * ``seq`` changed type to ``BIGINT`` * Function promoted to official. diff --git a/doc/conf.py.in b/doc/conf.py.in index afd1b30d952..3b5ae03cd78 100644 --- a/doc/conf.py.in +++ b/doc/conf.py.in @@ -73,14 +73,14 @@ master_doc = 'index' # General information about the project. project = u'pgRouting' -copyright = u'pgRouting Contributors - Version @PROJECT_FULL_VERSION@' +copyright = u'pgRouting Contributors - Version v@PROJECT_LIB_VERSION@' # The version info for the project you're documenting, acts as replacement for # |version| and |release|, also used in various other places throughout the # built documents. # # The short X.Y version. -version = '@PROJECT_FULL_VERSION@' +version = 'v@PROJECT_LIB_VERSION@' # The full version, including alpha/beta/rc tags. release = '@PROJECT_FULL_VERSION@' diff --git a/doc/contraction/contraction-family.rst b/doc/contraction/contraction-family.rst index 0c79ee1dbc1..5d54ef45928 100644 --- a/doc/contraction/contraction-family.rst +++ b/doc/contraction/contraction-family.rst @@ -99,7 +99,7 @@ Dead end vertex on undirected graph :header-rows: 1 * - Node - - Adjecent nodes + - Adjacent nodes - Number of adjacent nodes * - :math:`a` - :math:`\{u\}` @@ -140,7 +140,7 @@ Dead end vertex on directed graph :header-rows: 1 * - Node - - Adjecent nodes + - Adjacent nodes - Number of adjacent nodes - Number of incoming edges - Number of outgoing edges @@ -282,7 +282,7 @@ Linear vertex on undirected graph :header-rows: 1 * - Node - - Adjecent nodes + - Adjacent nodes - Number of adjacent nodes * - :math:`v` - :math:`\{u, w\}` @@ -320,7 +320,7 @@ Linear vertex on directed graph :header-rows: 1 * - Node - - Adjecent nodes + - Adjacent nodes - Number of adjacent nodes - Is symmetrical? * - :math:`a` diff --git a/doc/dominator/pgr_lengauerTarjanDominatorTree.rst b/doc/dominator/pgr_lengauerTarjanDominatorTree.rst index 0768112e0d9..b32d04f5cef 100644 --- a/doc/dominator/pgr_lengauerTarjanDominatorTree.rst +++ b/doc/dominator/pgr_lengauerTarjanDominatorTree.rst @@ -13,7 +13,7 @@ | -``pgr_lengauerTarjanDominatorTree`` -Experimental +``pgr_lengauerTarjanDominatorTree`` - Experimental =============================================================================== ``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all diff --git a/doc/driving_distance/pgr_drivingDistance.rst b/doc/driving_distance/pgr_drivingDistance.rst index 5cb648bdc54..437e35765fa 100644 --- a/doc/driving_distance/pgr_drivingDistance.rst +++ b/doc/driving_distance/pgr_drivingDistance.rst @@ -24,11 +24,11 @@ * Standarizing output columns to |result-spantree| - * pgr_drivingdistance(Single vertex) + * pgr_drivingDistance(Single vertex) * Added ``depth`` and ``start_vid`` result columns. - * pgr_drivingdistance(Multiple vertices) + * pgr_drivingDistance(Multiple vertices) * Result column name change: ``from_v`` to ``start_vid``. * Added ``depth`` and ``pred`` result columns. diff --git a/doc/lineGraph/pgr_lineGraphFull.rst b/doc/lineGraph/pgr_lineGraphFull.rst index c14af36feba..3d98206e810 100644 --- a/doc/lineGraph/pgr_lineGraphFull.rst +++ b/doc/lineGraph/pgr_lineGraphFull.rst @@ -143,9 +143,9 @@ Additional Examples .. contents:: :local: -The examples of this section are based on the :doc:`sampledata` -The examples include the subgraph including edges 4, 7, 8, and 10 with -``reverse_cost``. +* The examples of this section are based on the :doc:`sampledata` network. +* The examples include the subgraph including edges 4, 7, 8, and 10 with + ``reverse_cost``. The data ............................................................................... diff --git a/doc/max_flow/pgr_maxCardinalityMatch.rst b/doc/max_flow/pgr_maxCardinalityMatch.rst index e60359d7533..86aac8566ee 100644 --- a/doc/max_flow/pgr_maxCardinalityMatch.rst +++ b/doc/max_flow/pgr_maxCardinalityMatch.rst @@ -28,13 +28,13 @@ graph. * Works for undirected graphs. * New signature - * pgr_maxCardinalityMatch(text)`` returns only ``edge`` column. + * pgr_maxCardinalityMatch(text) returns only ``edge`` column. * Deprecated signature - * pgr_maxCardinalityMatch(text,boolean)`` + * pgr_maxCardinalityMatch(text,boolean) - * directed => false`` when used. + * directed => ``false`` when used. * Version 3.0.0 diff --git a/doc/metrics/pgr_betweennessCentrality.rst b/doc/metrics/pgr_betweennessCentrality.rst index 91f16170a54..ffee73eb18d 100644 --- a/doc/metrics/pgr_betweennessCentrality.rst +++ b/doc/metrics/pgr_betweennessCentrality.rst @@ -16,7 +16,7 @@ ``pgr_betweennessCentrality`` - Experimental =============================================================================== -``pgr_betweennessCentrality`` - Calculates the relative betweeness centrality +``pgr_betweennessCentrality`` - Calculates the relative betweenness centrality using Brandes Algorithm .. rubric:: Availability @@ -25,8 +25,6 @@ using Brandes Algorithm * New experimental function. - * pgr_betweennessCentrality`` - Description ------------------------------------------------------------------------------- @@ -140,7 +138,7 @@ See Also * :doc:`sampledata` * `Boost: betweenness centrality - `_ + `_ .. rubric:: Indices and tables diff --git a/doc/src/index.rst b/doc/src/index.rst index 32579ef430c..34aa2eb40a4 100644 --- a/doc/src/index.rst +++ b/doc/src/index.rst @@ -89,12 +89,9 @@ Available Functions but not official pgRouting functions :doc:`release_notes` =============================================================================== -Current release -------------------------------------------------------------------------------- - .. include:: release_notes.rst :start-after: current - :end-before: pgRouting 3.6 + :end-before: pgRouting 3.7 All releases ------------------------------------------------------------------------------- diff --git a/doc/src/migration.rst b/doc/src/migration.rst index d8771c4f870..606e035fec3 100644 --- a/doc/src/migration.rst +++ b/doc/src/migration.rst @@ -9,6 +9,7 @@ | + Migration guide =============================================================================== @@ -21,24 +22,18 @@ Results can be different because of the changes. All deprecated functions will be removed on next mayor version 4.0.0 .. contents:: Contents + :depth: 2 -Migration of functions -******************************************************************************* - -.. contents:: Migrating functions - :local: - - -Migration of pgr_aStar`` +Migration of ``pgr_aStar`` ------------------------------------------------------------------------------- Starting from `v3.6.0 `__ Signatures to be migrated: -* pgr_aStar(One to One) -* pgr_aStar(One to Many) -* pgr_aStar(Many to One) +* ``pgr_aStar`` (`One to One`) +* ``pgr_aStar`` (`One to Many`) +* ``pgr_aStar`` (`Many to One`) :Before Migration: @@ -47,24 +42,24 @@ Signatures to be migrated: * Depending on the overload used, the columns ``start_vid`` and ``end_vid`` might be missing: - * pgr_aStar(One to One) does not have ``start_vid`` and ``end_vid``. - * pgr_aStar(One to Many) does not have ``start_vid``. - * pgr_aStar(Many to One) does not have ``end_vid``. + * ``pgr_aStar`` (`One to One`) does not have ``start_vid`` and ``end_vid``. + * ``pgr_aStar`` (`One to Many`) does not have ``start_vid``. + * ``pgr_aStar`` (`Many to One`) does not have ``end_vid``. :Migration: * Be aware of the existence of the additional columns. -* In pgr_aStar(One to One) +* In ``pgr_aStar`` (`One to One`) - * start_vid`` contains the **start vid** parameter value. - * end_vid`` contains the **end vid** parameter value. + * ``start_vid`` contains the **start vid** parameter value. + * ``end_vid`` contains the **end vid** parameter value. .. literalinclude:: migration.queries :start-after: --astar1 :end-before: --astar2 -* In pgr_aStar(One to Many) +* In ``pgr_aStar`` (`One to Many`) * ``start_vid`` contains the **start vid** parameter value. @@ -72,7 +67,7 @@ Signatures to be migrated: :start-after: --astar2 :end-before: --astar3 -* In pgr_aStar(Many to One) +* In ``pgr_aStar`` (`Many to One`) * ``end_vid`` contains the **end vid** parameter value. @@ -105,9 +100,9 @@ Starting from `v3.6.0 `__ Signatures to be migrated: -* pgr_bdAstar(One to One) -* pgr_bdAstar(One to Many) -* pgr_bdAstar(Many to One) +* ``pgr_bdAstar`` (`One to One`) +* ``pgr_bdAstar`` (`One to Many`) +* ``pgr_bdAstar`` (`Many to One`) :Before Migration: @@ -116,15 +111,15 @@ Signatures to be migrated: * Depending on the overload used, the columns ``start_vid`` and ``end_vid`` might be missing: - * pgr_bdAstar(One to One) does not have ``start_vid`` and ``end_vid``. - * pgr_bdAstar(One to Many) does not have ``start_vid``. - * pgr_bdAstar(Many to One) does not have ``end_vid``. + * ``pgr_bdAstar`` (`One to One`) does not have ``start_vid`` and ``end_vid``. + * ``pgr_bdAstar`` (`One to Many`) does not have ``start_vid``. + * ``pgr_bdAstar`` (`Many to One`) does not have ``end_vid``. :Migration: * Be aware of the existence of the additional columns. -* In pgr_bdAstar(One to One) +* In ``pgr_bdAstar`` (`One to One`) * ``start_vid`` contains the **start vid** parameter value. * ``end_vid`` contains the **end vid** parameter value. @@ -133,7 +128,7 @@ Signatures to be migrated: :start-after: --bdastar1 :end-before: --bdastar2 -* In pgr_bdAstar(One to Many) +* In ``pgr_bdAstar`` (`One to Many`) * ``start_vid`` contains the **start vid** parameter value. @@ -141,7 +136,7 @@ Signatures to be migrated: :start-after: --bdastar2 :end-before: --bdastar3 -* In pgr_bdAstar(Many to One) +* In ``pgr_bdAstar`` (`Many to One`) * ``end_vid`` contains the **end vid** parameter value. @@ -173,9 +168,9 @@ Starting from `v3.5.0 `__ Signatures to be migrated: -* pgr_dijkstra(One to One) -* pgr_dijkstra(One to Many) -* pgr_dijkstra(Many to One) +* ``pgr_dijkstra`` (`One to One`) +* ``pgr_dijkstra`` (`One to Many`) +* ``pgr_dijkstra`` (`Many to One`) :Before Migration: @@ -184,16 +179,16 @@ Signatures to be migrated: * Depending on the overload used, the columns ``start_vid`` and ``end_vid`` might be missing: - * pgr_dijkstra(One to One) does not have ``start_vid`` and + * ``pgr_dijkstra`` (`One to One`) does not have ``start_vid`` and ``end_vid``. - * pgr_dijkstra(One to Many) does not have ``start_vid``. - * pgr_dijkstra(Many to One) does not have ``end_vid``. + * ``pgr_dijkstra`` (`One to Many`) does not have ``start_vid``. + * ``pgr_dijkstra`` (`Many to One`) does not have ``end_vid``. :Migration: * Be aware of the existence of the additional columns. -* In pgr_dijkstra(One to One) +* In ``pgr_dijkstra`` (`One to One`) * ``start_vid`` contains the **start vid** parameter value. * ``end_vid`` contains the **end vid** parameter value. @@ -202,7 +197,7 @@ Signatures to be migrated: :start-after: --dijkstra1 :end-before: --dijkstra2 -* In pgr_dijkstra(One to Many) +* In ``pgr_dijkstra`` (`One to Many`) * ``start_vid`` contains the **start vid** parameter value. @@ -210,7 +205,7 @@ Signatures to be migrated: :start-after: --dijkstra2 :end-before: --dijkstra3 -* In pgr_dijkstra(Many to One) +* In ``pgr_dijkstra`` (`Many to One`) * ``end_vid`` contains the **end vid** parameter value. @@ -232,7 +227,7 @@ Signatures to be migrated: the function ``my_dijkstra`` returns the new additional columns of ``pgr_dijkstra``. -Migration of ``pgr_drivingdistance`` +Migration of ``pgr_drivingDistance`` ------------------------------------------------------------------------------- Starting from `v3.6.0 `__ @@ -243,18 +238,18 @@ Starting from `v3.6.0 `__ Signatures to be migrated: -* pgr_drivingdistance(Single vertex) -* pgr_drivingdistance(Multiple vertices) +* pgr_drivingDistance(Single vertex) +* pgr_drivingDistance(Multiple vertices) :Before Migration: Output columns were |result-dij-dd| -* pgr_drivingdistance(Single vertex) +* pgr_drivingDistance(Single vertex) * Does not have ``start_vid`` and ``depth`` result columns. -* pgr_drivingdistance(Multiple vertices) +* pgr_drivingDistance(Multiple vertices) * Has ``from_v`` instead of ``start_vid`` result column. * does not have ``depth`` result column. @@ -263,7 +258,7 @@ Output columns were |result-dij-dd| * Be aware of the existence and name change of the result columns. -``pgr_drivingdistance`` (Single vertex) +pgr_drivingDistance(Single vertex) ............................................................................... Using `this @@ -284,7 +279,7 @@ If needed filter out the added columns, for example, to return the original colu :start-after: --drivingdistance2 :end-before: --drivingdistance3 -``pgr_drivingdistance`` (Multiple vertices) +pgr_drivingDistance(Multiple vertices) ............................................................................... Using `this @@ -348,7 +343,7 @@ Output columns were |result-bfs| Kruskal single vertex ............................................................................... -Using pgr_KruskalDD`` as example. +Using ``pgr_KruskalDD`` as example. Migration is similar to al the affected functions. Comparing with `this @@ -401,7 +396,7 @@ Starting from `v3.6.0 `__ Signatures to be migrated: -* pgr_KSP(One to One) +* ``pgr_KSP`` (One to One) :Before Migration: @@ -409,7 +404,7 @@ Signatures to be migrated: * the columns ``start_vid`` and ``end_vid`` do not exist. - * pgr_KSP(One to One) does not have ``start_vid`` and ``end_vid``. + * ``pgr_KSP`` (One to One) does not have ``start_vid`` and ``end_vid``. :Migration: @@ -458,7 +453,7 @@ Migration is needed, because: * Works for undirected graphs. * New signature - * pgr_maxCardinalityMatch(text)`` returns only ``edge`` column. + * ``pgr_maxCardinalityMatch(text)`` returns only ``edge`` column. * The optional flag ``directed`` is removed. :Before migration: @@ -488,7 +483,7 @@ Migration is needed, because: :start-after: --maxcard2 :end-before: --maxcard3 -Migration of pgr_primDD`` / ``pgr_primBFS`` / ``pgr_primDFS`` +Migration of ``pgr_primDD`` / ``pgr_primBFS`` / ``pgr_primDFS`` ------------------------------------------------------------------------------- Starting from `v3.7.0 `__ @@ -552,7 +547,7 @@ columns Prim multiple vertices ............................................................................... -Using pgr_primDD`` as example. +Using ``pgr_primDD`` as example. Migration is similar to al the affected functions. Comparing with `this @@ -597,7 +592,7 @@ Signatures to be migrated: * Does not have ``start_vid``, ``pred`` and ``depth`` result columns. * ``driving_side`` parameter was named optional now it is compulsory unnamed. -* ``pgr_withPointsDD`` (Multiple vertices) +* ``pgr_withPointsDD`` (`Multiple vertices`) * Output columns were |result-m-1-no-seq| * Does not have ``depth`` and ``pred`` result columns. @@ -727,7 +722,7 @@ And ``driving side`` parameter changed from named optional to unnamed compulsory Signatures to be migrated: -* pgr_withPointsKSP(One to One) +* ``pgr_withPointsKSP`` (`One to One`) :Before Migration: @@ -748,7 +743,7 @@ Signatures to be migrated: * In undirected graph: valid values are [``b``, ``B``] * Using an invalid value throws an ``ERROR``. -``pgr_withPointsKSP`` (One to One) +``pgr_withPointsKSP`` (`One to One`) ............................................................................... Using @@ -769,200 +764,39 @@ columns: :start-after: --withPointsKSP2 :end-before: --withPointsKSP3 -Migration of turn restrictions -******************************************************************************* - -.. contents:: Contents - :local: - -Migration of restrictions -------------------------------------------------------------------------------- - -Starting from `v3.4.0 `__ - -The structure of the restrictions have changed: - -Old restrictions structure -............................................................................... - -On the deprecated signatures: - -* Column ``rid`` is ignored -* ``via_path`` - - * Must be in reverse order. - * Is of type ``TEXT``. - * When more than one via edge must be separated with ``,``. - -* ``target_id`` - - * Is the last edge of the forbidden path. - * Is of type ``INTEGER``. - -* ``to_cost`` - - * Is of type ``FLOAT``. - -Creation of the old restrictions table - -.. literalinclude:: migration.queries - :start-after: --rest00 - :end-before: --rest01 - -Old restrictions fill up - -.. literalinclude:: migration.queries - :start-after: --rest01 - :end-before: --rest1 - -Old restrictions contents -+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ - -.. literalinclude:: migration.queries - :start-after: --rest1 - :end-before: --rest2 - -The restriction with ``rid = 2`` is representing :math:`3 \rightarrow 5 -\rightarrow9` - -* :math:`3\rightarrow5` - - * is on column ``via_path`` in reverse order - * is of type ``TEXT`` - -* :math:`9` - - * is on column ``target_id`` - * is of type ``INTEGER`` - - -New restrictions structure -............................................................................... - -* Column ``id`` is ignored -* Column ``path`` - - * Is of type ``ARRAY[ANY-INTEGER]``. - * Contains all the edges involved on the restriction. - * The array has the ordered edges of the restriction. - -* Column ``cost`` - - * Is of type ``ANY-NUMERICAL`` - -.. include:: sampledata.rst - :start-after: the_restrictions_start - :end-before: the_restrictions_end - - -The restriction with ``rid = 2`` represents the path :math:`3 \rightarrow5 -\rightarrow9`. - -* By inspection the path is clear. - -Migration -............................................................................... - -To transform the old restrictions table to the new restrictions structure, - -* Create a new table with the new restrictions structure. - - * In this migration guide ``new_restrictions`` is been used. - -* For this migration pgRouting supplies an auxiliary function for reversal of an - array ``_pgr_array_reverse`` needed for the migration. - - * ``_pgr_array_reverse``: - - * Was created temporally for this migration - * Is not documented. - * Will be removed on the next mayor version 4.0.0 - -.. literalinclude:: migration.queries - :start-after: --rest3 - :end-before: --rest4 - -The migrated table contents: - -.. literalinclude:: migration.queries - :start-after: --rest4 - :end-before: --rest5 - Migration of ``pgr_trsp`` (Vertices) ------------------------------------------------------------------------------- -:doc:`pgr_trsp` signatures have changed and many issues have been fixed in the -new signatures. This section will show how to migrate from the old signatures to -the new replacement functions. This also affects the restrictions. - -Starting from `v3.4.0 `__ - -Signature to be migrated: +Signature: .. parsed-literal:: - pgr_trsp(Edges SQL, source, target, - directed boolean, has_rcost boolean + pgr_trsp(Edges SQL, source, target, directed boolean, has_rcost boolean [,restrict_sql text]); RETURNS SETOF (seq, id1, id2, cost) -* The integral type of the ``Edges SQL`` can only be ``INTEGER``. -* The floating point type of the ``Edges SQL`` can only be ``FLOAT``. -* ``directed`` flag is compulsory. +:Deprecated: `v3.4.0 `__ - * Does not have a default value. - -* Does not autodetect if ``reverse_cost`` column exist. - - * User must be careful to match the existence of the column with the value of - ``has_rcost`` parameter. - -* The restrictions inner query is optional. -* The output column names are meaningless - -Migrate by using: +.. contents:: + :local: -* :doc:`pgr_dijkstra` when there are no restrictions, -* :doc:`pgr_trsp` (One to One) when there are restrictions. +.. rubric:: See Also +- :doc:`pgr_dijkstra` +- :doc:`pgr_trsp` +- `Migration of restrictions`_ -Migrating ``pgr_trsp`` (Vertices) using ``pgr_dijkstra`` +Use ``pgr_dijkstra`` when there are no restrictions. ............................................................................... -The following query does not have restrictions. - -.. literalinclude:: migration.queries - :start-after: --verticesv1 - :end-before: --verticesv2 - -* A message about deprecation is shown - - * Deprecated functions will be removed on the next mayor version 4.0.0 - Use :doc:`pgr_dijkstra` instead. - .. literalinclude:: migration.queries :start-after: --verticesv2 :end-before: --verticesv3 -* The types casting has been removed. -* :doc:`pgr_dijkstra`: - - * Autodetects if ``reverse_cost`` column is in the edges - SQL. - * Accepts ``ANY-INTEGER`` on integral types - * Accepts ``ANY-NUMERICAL`` on floating point types - * ``directed`` flag has a default value of ``true``. - - * Use the same value that on the original query. - * In this example it is ``true`` which is the default value. - - * The flag has been omitted and the default is been used. - -When the need of using strictly the same (meaningless) names and types of the -function been migrated then: +To get the original column names: .. literalinclude:: migration.queries :start-after: --verticesv3 @@ -971,50 +805,16 @@ function been migrated then: * ``id1`` is the node * ``id2`` is the edge - -Migrating ``pgr_trsp`` (Vertices) using ``pgr_trsp`` +Use ``pgr_trsp`` when there are restrictions. ............................................................................... -The following query has restrictions. - -.. literalinclude:: migration.queries - :start-after: --verticesv4 - :end-before: --verticesv5 - -* A message about deprecation is shown - - * Deprecated functions will be removed on the next mayor version 4.0.0 - -* The restrictions are the last parameter of the function - - * Using the old structure of restrictions - Use :doc:`pgr_trsp` (One to One) instead. .. literalinclude:: migration.queries :start-after: --verticesv5 :end-before: --verticesv6 -* The new structure of restrictions is been used. - - * It is the second parameter. - -* The types casting has been removed. -* :doc:`pgr_trsp`: - - * Autodetects if ``reverse_cost`` column is in the edges - SQL. - * Accepts ``ANY-INTEGER`` on integral types - * Accepts ``ANY-NUMERICAL`` on floating point types - * ``directed`` flag has a default value of ``true``. - - * Use the same value that on the original query. - * In this example it is ``true`` which is the default value. - - * The flag has been omitted and the default is been used. - -When the need of using strictly the same (meaningless) names and types of the -function been migrated then: +To get the original column names: .. literalinclude:: migration.queries :start-after: --verticesv6 @@ -1023,10 +823,10 @@ function been migrated then: * ``id1`` is the node * ``id2`` is the edge -Migration of pgr_trsp(Edges) +Migration of ``pgr_trsp`` (Edges) ------------------------------------------------------------------------------- -Signature to be migrated: +Signature: .. parsed-literal:: @@ -1036,67 +836,27 @@ Signature to be migrated: [,restrict_sql text]); RETURNS SETOF (seq, id1, id2, cost) -* The integral types of the ``sql`` can only be ``INTEGER``. -* The floating point type of the ``sql`` can only be ``FLOAT``. -* ``directed`` flag is compulsory. - - * Does not have a default value. - -* Does not autodetect if ``reverse_cost`` column exist. +:Deprecated: `v3.4.0 `__ - * User must be careful to match the existence of the column with the value of - ``has_rcost`` parameter. - -* The restrictions inner query is optional. - -For these migration guide the following points will be used: - -.. literalinclude:: migration.queries - :start-after: --verticesv7 - :end-before: --edgesv1 +.. contents:: + :local: -Migrate by using: +.. rubric:: See Also -* :doc:`pgr_withPoints` when there are no restrictions, -* :doc:`pgr_trsp_withPoints` (One to One) when there are restrictions. +- :doc:`pgr_withPoints` +- :doc:`pgr_trsp_withPoints` +- `Migration of restrictions`_ -Migrating ``pgr_trsp`` (Edges) using ``pgr_withPoints`` +Use ``pgr_withPoints`` when there are no restrictions. ............................................................................... -The following query does not have restrictions. - -.. literalinclude:: migration.queries - :start-after: --edgesv1 - :end-before: --edgesv2 - -* A message about deprecation is shown - - * Deprecated functions will be removed on the next mayor version 4.0.0 - -Use :doc:`pgr_withPoints` instead. +Use :doc:`pgr_withPoints` (One to One) instead. .. literalinclude:: migration.queries :start-after: --edgesv2 :end-before: --edgesv3 -* The types casting has been removed. -* Do not show details, as the deprecated function does not show details. -* :doc:`pgr_withPoints`: - - * Autodetects if ``reverse_cost`` column is in the edges - SQL. - * Accepts ``ANY-INTEGER`` on integral types - * Accepts ``ANY-NUMERICAL`` on floating point types - * ``directed`` flag has a default value of ``true``. - - * Use the same value that on the original query. - * In this example it is ``true`` which is the default value. - - * The flag has been omitted and the default is been used. - * On the points query do not include the ``side`` column. - -When the need of using strictly the same (meaningless) names and types, and node -values of the function been migrated then: +To get the original column names: .. literalinclude:: migration.queries :start-after: --edgesv3 @@ -1105,52 +865,16 @@ values of the function been migrated then: * ``id1`` is the node * ``id2`` is the edge - -Migrating ``pgr_trsp`` (Edges) using ``pgr_trsp_withPoints`` +Use ``pgr_trsp_withPoints`` when there are restrictions. ............................................................................... -The following query has restrictions. - -.. literalinclude:: migration.queries - :start-after: --edgesv4 - :end-before: --edgesv5 - -* A message about deprecation is shown - - * Deprecated functions will be removed on the next mayor version 4.0.0 - -* The restrictions are the last parameter of the function - - * Using the old structure of restrictions - Use :doc:`pgr_trsp_withPoints` instead. .. literalinclude:: migration.queries :start-after: --edgesv5 :end-before: --edgesv6 -* The new structure of restrictions is been used. - - * It is the second parameter. - -* The types casting has been removed. -* Do not show details, as the deprecated function does not show details. -* :doc:`pgr_trsp_withPoints`: - - * Autodetects if ``reverse_cost`` column is in the edges - SQL. - * Accepts ``ANY-INTEGER`` on integral types - * Accepts ``ANY-NUMERICAL`` on floating point types - * ``directed`` flag has a default value of ``true``. - - * Use the same value that on the original query. - * In this example it is ``true`` which is the default value. - - * The flag has been omitted and the default is been used. - * On the points query do not include the ``side`` column. - -When the need of using strictly the same (meaningless) names and types, and node -values of the function been migrated then: +To get the original column names: .. literalinclude:: migration.queries :start-after: --edgesv6 @@ -1162,7 +886,7 @@ values of the function been migrated then: Migration of ``pgr_trspViaVertices`` ------------------------------------------------------------------------------- -Signature to be migrated: +Signature: .. parsed-literal:: @@ -1171,62 +895,28 @@ Signature to be migrated: [, turn_restrict_sql text]); RETURNS SETOF (seq, id1, id2, id3, cost) +:Deprecated: `v3.4.0 `__ -* The integral types of the ``Edges SQL`` can only be ``INTEGER``. -* The floating point type of the ``Edges SQL`` can only be ``FLOAT``. -* ``directed`` flag is compulsory. - - * Does not have a default value. - -* Does not autodetect if ``reverse_cost`` column exist. - - * User must be careful to match the existence of the column with the value of - ``has_rcost`` parameter. - -* The restrictions inner query is optional. - +.. contents:: + :local: + :depth: 1 -Migrate by using: +.. rubric:: See Also -* :doc:`pgr_dijkstraVia` when there are no restrictions, -* :doc:`pgr_trspVia` when there are restrictions. +- :doc:`pgr_dijkstraVia` +- :doc:`pgr_trspVia` +- `Migration of restrictions`_ -Migrating ``pgr_trspViaVertices`` using ``pgr_dijkstraVia`` +Use ``pgr_dijkstraVia`` when there are no restrictions ............................................................................... -The following query does not have restrictions. - -.. literalinclude:: migration.queries - :start-after: --viav1 - :end-before: --viav2 - -* A message about deprecation is shown - - * Deprecated functions will be removed on the next mayor version 4.0.0 - Use :doc:`pgr_dijkstraVia` instead. .. literalinclude:: migration.queries :start-after: --viav2 :end-before: --viav3 -* The types casting has been removed. -* :doc:`pgr_dijkstraVia`: - - * Autodetects if ``reverse_cost`` column is in the edges - SQL. - * Accepts ``ANY-INTEGER`` on integral types - * Accepts ``ANY-NUMERICAL`` on floating point types - * ``directed`` flag has a default value of ``true``. - - * Use the same value that on the original query. - * In this example it is ``true`` which is the default value. - - * The flag has been omitted and the default is been used. - * On the points query do not include the ``side`` column. - -When the need of using strictly the same (meaningless) names and types of the -function been migrated then: +To get the original column names: .. literalinclude:: migration.queries :start-after: --viav3 @@ -1236,51 +926,16 @@ function been migrated then: * ``id2`` is the node * ``id3`` is the edge - -Migrating ``pgr_trspViaVertices`` using ``pgr_trspVia`` +Use ``pgr_trspVia`` when there are restrictions ............................................................................... -The following query has restrictions. - -.. literalinclude:: migration.queries - :start-after: --viav4 - :end-before: --viav5 - -* A message about deprecation is shown - - * Deprecated functions will be removed on the next mayor version 4.0.0 - -* The restrictions are the last parameter of the function - - * Using the old structure of restrictions - Use :doc:`pgr_trspVia` instead. .. literalinclude:: migration.queries :start-after: --viav5 :end-before: --viav6 -* The new structure of restrictions is been used. - - * It is the second parameter. - -* The types casting has been removed. -* :doc:`pgr_trspVia`: - - * Autodetects if ``reverse_cost`` column is in the edges - SQL. - * Accepts ``ANY-INTEGER`` on integral types - * Accepts ``ANY-NUMERICAL`` on floating point types - * ``directed`` flag has a default value of ``true``. - - * Use the same value that on the original query. - * In this example it is ``true`` which is the default value. - - * The flag has been omitted and the default is been used. - * On the points query do not include the ``side`` column. - -When the need of using strictly the same (meaningless) names and types of the -function been migrated then: +To get the original column names: .. literalinclude:: migration.queries :start-after: --viav6 @@ -1293,7 +948,7 @@ function been migrated then: Migration of ``pgr_trspViaEdges`` ------------------------------------------------------------------------------- -Signature to be migrated: +Signature: .. parsed-literal:: @@ -1302,132 +957,168 @@ Signature to be migrated: [, turn_restrict_sql text]); RETURNS SETOF (seq, id1, id2, id3, cost) +:Deprecated: `v3.4.0 `__ -* The integral types of the ``Edges SQL`` can only be ``INTEGER``. -* The floating point type of the ``Edges SQL`` can only be ``FLOAT``. -* ``directed`` flag is compulsory. - - * Does not have a default value. +.. contents:: + :local: + :depth: 1 -* Does not autodetect if ``reverse_cost`` column exist. +.. rubric:: See Also - * User must be careful to match the existence of the column with the value of - ``has_rcost`` parameter. +- :doc:`pgr_withPointsVia` +- :doc:`pgr_trspVia_withPoints` +- `Migration of restrictions`_ -* The restrictions inner query is optional. +Use ``pgr_withPointsVia`` when there are no restrictions +............................................................................... -For these migration guide the following points will be used: +Use :doc:`pgr_withPointsVia` instead. .. literalinclude:: migration.queries - :start-after: --viav7 - :end-before: --edgesvia1 + :start-after: --edgesvia2 + :end-before: --edgesvia3 -And will travel thru the following Via points :math:`4\rightarrow3\rightarrow6` +To get the original column names: -Migrate by using: +.. literalinclude:: migration.queries + :start-after: --edgesvia3 + :end-before: --edgesvia4 -* :doc:`pgr_withPointsVia` when there are no restrictions, -* :doc:`pgr_trspVia_withPoints` when there are restrictions. +* ``id1`` is the path identifier +* ``id2`` is the node +* ``id3`` is the edge -Migrating ``pgr_trspViaEdges`` using ``pgr_withPointsVia`` +Use ``pgr_trspVia_withPoints`` when there are restrictions ............................................................................... -The following query does not have restrictions. +Use :doc:`pgr_trspVia_withPoints` instead. .. literalinclude:: migration.queries - :start-after: --edgesvia1 - :end-before: --edgesvia2 + :start-after: --edgesvia5 + :end-before: --edgesvia6 -* A message about deprecation is shown +To get the original column names: - * Deprecated functions will be removed on the next mayor version 4.0.0 +.. literalinclude:: migration.queries + :start-after: --edgesvia6 + :end-before: --edgesvia7 -Use :doc:`pgr_withPointsVia` instead. +* ``id1`` is the path identifier +* ``id2`` is the node +* ``id3`` is the edge -.. literalinclude:: migration.queries - :start-after: --edgesvia2 - :end-before: --edgesvia3 +Migration of restrictions +------------------------------------------------------------------------------- -* The types casting has been removed. -* Do not show details, as the deprecated function does not show details. -* :doc:`pgr_withPointsVia`: +Starting from `v3.4.0 `__ - * Autodetects if ``reverse_cost`` column is in the edges - SQL. - * Accepts ``ANY-INTEGER`` on integral types - * Accepts ``ANY-NUMERICAL`` on floating point types - * ``directed`` flag has a default value of ``true``. +The structure of the restrictions have changed: - * Use the same value that on the original query. - * In this example it is ``true`` which is the default value. +Old restrictions structure +............................................................................... - * The flag has been omitted and the default is been used. - * On the points query do not include the ``side`` column. +On the deprecated signatures: -When the need of using strictly the same (meaningless) names and types, and node -values of the function been migrated then: +* Column ``rid`` is ignored +* ``via_path`` + + * Must be in reverse order. + * Is of type ``TEXT``. + * When more than one via edge must be separated with ``,``. + +* ``target_id`` + + * Is the last edge of the forbidden path. + * Is of type ``INTEGER``. + +* ``to_cost`` + + * Is of type ``FLOAT``. + +Creation of the old restrictions table .. literalinclude:: migration.queries - :start-after: --edgesvia3 - :end-before: --edgesvia4 + :start-after: --rest00 + :end-before: --rest01 -* ``id1`` is the path identifier -* ``id2`` is the node -* ``id3`` is the edge +Old restrictions fill up -Migrating ``pgr_trspViaEdges`` using ``pgr_trspVia_withPoints`` -............................................................................... +.. literalinclude:: migration.queries + :start-after: --rest01 + :end-before: --rest1 -The following query has restrictions. +Old restrictions contents ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ .. literalinclude:: migration.queries - :start-after: --edgesvia4 - :end-before: --edgesvia5 + :start-after: --rest1 + :end-before: --rest2 -* A message about deprecation is shown +The restriction with ``rid = 2`` is representing :math:`3 \rightarrow 5 +\rightarrow9` - * Deprecated functions will be removed on the next mayor version 4.0.0 +* :math:`3\rightarrow5` -* The restrictions are the last parameter of the function + * is on column ``via_path`` in reverse order + * is of type ``TEXT`` - * Using the old structure of restrictions +* :math:`9` -Use :doc:`pgr_trspVia_withPoints` instead. + * is on column ``target_id`` + * is of type ``INTEGER`` -.. literalinclude:: migration.queries - :start-after: --edgesvia5 - :end-before: --edgesvia6 -* The new structure of restrictions is been used. +New restrictions structure +............................................................................... - * It is the second parameter. +* Column ``id`` is ignored +* Column ``path`` -* The types casting has been removed. -* Do not show details, as the deprecated function does not show details. -* :doc:`pgr_trspVia_withPoints`: + * Is of type ``ARRAY[ANY-INTEGER]``. + * Contains all the edges involved on the restriction. + * The array has the ordered edges of the restriction. + +* Column ``cost`` + + * Is of type ``ANY-NUMERICAL`` + +.. include:: sampledata.rst + :start-after: the_restrictions_start + :end-before: the_restrictions_end - * Autodetects if ``reverse_cost`` column is in the edges - SQL. - * Accepts ``ANY-INTEGER`` on integral types - * Accepts ``ANY-NUMERICAL`` on floating point types - * ``directed`` flag has a default value of ``true``. - * Use the same value that on the original query. - * In this example it is ``true`` which is the default value. +The restriction with ``rid = 2`` represents the path :math:`3 \rightarrow5 +\rightarrow9`. + +* By inspection the path is clear. - * The flag has been omitted and the default is been used. - * On the points query do not include the ``side`` column. +Migration +............................................................................... -When the need of using strictly the same (meaningless) names and types, and node -values of the function been migrated then: +To transform the old restrictions table to the new restrictions structure, + +* Create a new table with the new restrictions structure. + + * In this migration guide ``new_restrictions`` is been used. + +* For this migration pgRouting supplies an auxiliary function for reversal of an + array ``_pgr_array_reverse`` needed for the migration. + + * ``_pgr_array_reverse``: + + * Was created temporally for this migration + * Is not documented. + * Will be removed on the next mayor version 4.0.0 .. literalinclude:: migration.queries - :start-after: --edgesvia6 - :end-before: --edgesvia7 + :start-after: --rest3 + :end-before: --rest4 -* ``id1`` is the path identifier -* ``id2`` is the node -* ``id3`` is the edge +The migrated table contents: + +.. literalinclude:: migration.queries + :start-after: --rest4 + :end-before: --rest5 See Also diff --git a/doc/src/release_notes.rst b/doc/src/release_notes.rst index fd452677e84..f621169b4f6 100644 --- a/doc/src/release_notes.rst +++ b/doc/src/release_notes.rst @@ -27,7 +27,7 @@ pgRouting 3 :local: :depth: 1 -pgRouting 3.7 +pgRouting 3.8 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ .. contents:: Contents @@ -36,6 +36,14 @@ pgRouting 3.7 .. current +pgRouting 3.8.0 Release Notes +------------------------------------------------------------------------------- + +No Changes Yet + +pgRouting 3.7 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ + pgRouting 3.7.3 Release Notes ------------------------------------------------------------------------------- @@ -257,7 +265,7 @@ milestone for 3.6.0 :end-before: .. rubric * `#2548 `__ Standarize output - pgr_drivingdistance + pgr_drivingDistance .. include:: pgr_drivingDistance.rst :start-after: Version 3.6.0 @@ -472,9 +480,9 @@ milestone for 3.4.0 * Flow functions - * pgr_maxCardinalityMatch(text)`` + * pgr_maxCardinalityMatch(text) - * Deprecating ``pgr_maxCardinalityMatch(text,boolean)`` + * Deprecating: pgr_maxCardinalityMatch(text,boolean) .. rubric:: Deprecated Functions @@ -987,7 +995,7 @@ on Github. * `#1006 `__: No loss of information -.. rubric:: New functions +.. rubric:: New Functions * Kruskal family @@ -1008,66 +1016,57 @@ on Github. * aStar Family - * 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(one to one) - * pgr_aStarCostMatrix(one to many) - * pgr_aStarCostMatrix(many to one) - * pgr_aStarCostMatrix(many to many) + * 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 * bdAstar Family - * 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(one to one) - * pgr_bdAstarCostMatrix(one to many) - * pgr_bdAstarCostMatrix(many to one) - * pgr_bdAstarCostMatrix(many to many) + * 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 * bdDijkstra Family - * 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(one to one) - * pgr_bdDijkstraCostMatrix(one to many) - * pgr_bdDijkstraCostMatrix(many to one) - * pgr_bdDijkstraCostMatrix(many to many) + * 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 * Flow Family - * pgr_pushRelabel(one to one) - * pgr_pushRelabel(one to many) - * pgr_pushRelabel(many to one) - * pgr_pushRelabel(many to many) - * pgr_edmondsKarp(one to one) - * pgr_edmondsKarp(one to many) - * pgr_edmondsKarp(many to one) - * pgr_edmondsKarp(many to many) - * pgr_boykovKolmogorov (one to one) - * pgr_boykovKolmogorov (one to many) - * pgr_boykovKolmogorov (many to one) - * pgr_boykovKolmogorov (many to many) + * pgr_pushRelabel(One to One) + * pgr_pushRelabel(One to Many) + * pgr_pushRelabel(Many to One) + * pgr_pushRelabel(Many to Many) + * pgr_edmondsKarp(One to One) + * pgr_edmondsKarp(One to Many) + * pgr_edmondsKarp(Many to One) + * pgr_edmondsKarp(Many to Many) + * pgr_boykovKolmogorov (One to One) + * pgr_boykovKolmogorov (One to Many) + * pgr_boykovKolmogorov (Many to One) + * pgr_boykovKolmogorov (Many to Many) * pgr_maxCardinalityMatching * pgr_maxFlow - * pgr_edgeDisjointPaths(one to one) - * pgr_edgeDisjointPaths(one to many) - * pgr_edgeDisjointPaths(many to one) - * pgr_edgeDisjointPaths(many to many) + * pgr_edgeDisjointPaths(One to One) + * pgr_edgeDisjointPaths(One to Many) + * pgr_edgeDisjointPaths(Many to One) + * pgr_edgeDisjointPaths(Many to Many) * Components family @@ -1193,7 +1192,7 @@ on Github. * pgr_floydWarshall * pgr_johnson - * pgr_astar + * pgr_aStar * pgr_bdAstar * pgr_bdDijstra * pgr_alphashape @@ -1283,13 +1282,15 @@ on Github. pgRouting 2.5.4 Release Notes ------------------------------------------------------------------------------- -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. * Fixes server crash on several functions. * pgr_floydWarshall * pgr_johnson - * pgr_astar + * pgr_aStar * pgr_bdAstar * pgr_bdDijstra * pgr_alphashape @@ -1374,29 +1375,29 @@ on Github. * 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 + * The many version results are the union of the One to One version .. rubric:: New Signatures -* pgr_bdAstar(one to one) +* pgr_bdAstar(One to One) .. rubric:: 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_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_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 @@ -1468,7 +1469,7 @@ To see the issues closed by this release see the `Git closed issues for 2.4.0 `_ on Github. -.. rubric:: New Function. +.. rubric:: New Functions * pgr_bdDijkstra @@ -1476,14 +1477,14 @@ on Github. .. rubric:: 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 +* 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 .. rubric:: Deprecated signatures. @@ -1557,30 +1558,30 @@ on Github. * 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_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_edgeDisjointPaths(One to One) +* pgr_edgeDisjointPaths(One to Many) +* pgr_edgeDisjointPaths(Many to One) +* pgr_edgeDisjointPaths(Many to Many) * pgr_contractGraph .. rubric:: Deprecated signatures * pgr_tsp - use pgr_TSP or pgr_eucledianTSP instead -* pgr_astar - use pgr_aStar instead +* pgr_aStar - use pgr_aStar instead .. rubric:: Deprecated Functions @@ -1673,21 +1674,21 @@ on Github. - pgr_floydWarshall - pgr_Johnson -- pgr_dijkstraCost(one to one) -- pgr_dijkstraCost(one to many) -- pgr_dijkstraCost(many to one) -- pgr_dijkstraCost(many to many) +- pgr_dijkstraCost(One to One) +- pgr_dijkstraCost(One to Many) +- pgr_dijkstraCost(Many to One) +- pgr_dijkstraCost(Many to Many) .. rubric:: 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_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 @@ -1721,14 +1722,14 @@ on Github. .. rubric:: New Signatures -- pgr_dijkstra(one to many) -- pgr_dijkstra(many to one) -- pgr_dijkstra(many to many) +- pgr_dijkstra(One to Many) +- pgr_dijkstra(Many to One) +- pgr_dijkstra(Many to Many) - pgr_drivingDistance(multiple vertices) .. rubric:: Refactored -- pgr_dijkstra(one to one) +- pgr_dijkstra(One to One) - pgr_ksp - pgr_drivingDistance(single vertex) diff --git a/doc/traversal/pgr_breadthFirstSearch.rst b/doc/traversal/pgr_breadthFirstSearch.rst index 8708b0c063a..d8638e6dd0b 100644 --- a/doc/traversal/pgr_breadthFirstSearch.rst +++ b/doc/traversal/pgr_breadthFirstSearch.rst @@ -55,7 +55,7 @@ Signatures | pgr_breadthFirstSearch(`Edges SQL`_, **root vid**, [**options**]) | pgr_breadthFirstSearch(`Edges SQL`_, **root vids**, [**options**]) - | **options:** [max_depth, directed]`` + | **options:** ``[max_depth, directed]`` | Returns set of |result-bfs| @@ -69,7 +69,7 @@ Single vertex :class: signatures | pgr_breadthFirstSearch(`Edges SQL`_, **root vid**, [**options**]) - | **options:** [max_depth, directed]`` + | **options:** ``[max_depth, directed]`` | Returns set of |result-bfs| @@ -90,7 +90,7 @@ Multiple vertices :class: signatures | pgr_breadthFirstSearch(`Edges SQL`_, **root vids**, [**options**]) - | **options:** [max_depth, directed]`` + | **options:** ``[max_depth, directed]`` | Returns set of |result-bfs| diff --git a/doc/trsp/pgr_trsp.rst b/doc/trsp/pgr_trsp.rst index 2f3bc67f5b8..005ffbc6530 100644 --- a/doc/trsp/pgr_trsp.rst +++ b/doc/trsp/pgr_trsp.rst @@ -38,17 +38,17 @@ * Deprecated signatures - * pgr_trsp(text,integer,integer,boolean,boolean,text)`` - * pgr_trsp(text,integer,float,integer,float,boolean,boolean,text)`` - * pgr_trspViaVertices(text,anyarray,boolean,boolean,text)`` - * pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)`` + * pgr_trsp(text,integer,integer,boolean,boolean,text) + * pgr_trsp(text,integer,float,integer,float,boolean,boolean,text) + * pgr_trspViaVertices(text,anyarray,boolean,boolean,text) + * pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text) * Version 2.1.0 * New prototypes - * pgr_trspViaVertices`` - * pgr_trspViaEdges`` + * pgr_trspViaVertices + * pgr_trspViaEdges * Version 2.0.0 @@ -77,7 +77,7 @@ The general algorithm is as follows: Signatures ------------------------------------------------------------------------------- -.. rubric:: Proposed +.. rubric:: Summary .. admonition:: \ \ :class: signatures diff --git a/doc/trsp/pgr_trspVia.rst b/doc/trsp/pgr_trspVia.rst index 99f0f5a0601..e578332a539 100644 --- a/doc/trsp/pgr_trspVia.rst +++ b/doc/trsp/pgr_trspVia.rst @@ -30,8 +30,6 @@ * New proposed function. - * pgr_trspVia(One Via) - Description ------------------------------------------------------------------------------- diff --git a/doc/tsp/pgr_TSP.rst b/doc/tsp/pgr_TSP.rst index b0f8e9b47c9..28feb2bc26d 100644 --- a/doc/tsp/pgr_TSP.rst +++ b/doc/tsp/pgr_TSP.rst @@ -16,7 +16,7 @@ ``pgr_TSP`` =============================================================================== -* pgr_TSP`` - Aproximation using *metric* algorithm. +* ``pgr_TSP`` - Approximation using *metric* algorithm. .. rubric:: Availability: diff --git a/doc/tsp/pgr_TSPeuclidean.rst b/doc/tsp/pgr_TSPeuclidean.rst index b803633f997..8de9f3817c6 100644 --- a/doc/tsp/pgr_TSPeuclidean.rst +++ b/doc/tsp/pgr_TSPeuclidean.rst @@ -16,13 +16,13 @@ ``pgr_TSPeuclidean`` ============================================================================= -* pgr_TSPeuclidean`` - Aproximation using *metric* algorithm. +* ``pgr_TSPeuclidean`` - Approximation using *metric* algorithm. .. rubric:: Availability: * Version 3.2.1 - * Metric Algorithm from `Boost library + * Using `Boost: metric TSP approx `__ * Simulated Annealing Algorithm no longer supported diff --git a/doc/utilities/pgr_findCloseEdges.rst b/doc/utilities/pgr_findCloseEdges.rst index 5a3afe9fbf3..f52c3634de1 100644 --- a/doc/utilities/pgr_findCloseEdges.rst +++ b/doc/utilities/pgr_findCloseEdges.rst @@ -33,7 +33,7 @@ point geometry. * The geometries must be in the same coordinate system (have the same SRID). * The code to do the calculations can be obtained for further specific adjustments needed by the application. -* EMTPY SET`` is returned on dryrun executions +* ``EMTPY SET`` is returned on dryrun executions |Boost| Boost Graph Inside @@ -47,7 +47,7 @@ Signatures | pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**]) | pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**]) - | **options:** [cap, partial, dryrun]`` + | **options:** ``[cap, partial, dryrun]`` | Returns set of |result-find| | OR EMPTY SET diff --git a/doc/withPoints/pgr_withPoints.rst b/doc/withPoints/pgr_withPoints.rst index e9bd1ccf535..4925007c11a 100644 --- a/doc/withPoints/pgr_withPoints.rst +++ b/doc/withPoints/pgr_withPoints.rst @@ -29,7 +29,7 @@ temporary vertices. * Version 3.2.0 - * New proposed function. + * New proposed signature: * pgr_withPoints(Combinations) diff --git a/doc/withPoints/pgr_withPointsCost.rst b/doc/withPoints/pgr_withPointsCost.rst index 94efbb45cb3..43d3d52f28c 100644 --- a/doc/withPoints/pgr_withPointsCost.rst +++ b/doc/withPoints/pgr_withPointsCost.rst @@ -111,7 +111,7 @@ Signatures withPoints family of functions. .. index:: - single: withPointsCost - Proposed ; One To One - Proposed on v2.2 + single: withPointsCost - Proposed ; One to One - Proposed on v2.2 One to One ............................................................................... @@ -132,7 +132,7 @@ One to One :end-before: -- q2 .. index:: - single: withPointsCost - Proposed ; One To Many - Proposed on v2.2 + single: withPointsCost - Proposed ; One to Many - Proposed on v2.2 One to Many ............................................................................... @@ -154,7 +154,7 @@ One to Many :end-before: -- q3 .. index:: - single: withPointsCost - Proposed ; Many To One - Proposed on v2.2 + single: withPointsCost - Proposed ; Many to One - Proposed on v2.2 Many to One ............................................................................... @@ -175,7 +175,7 @@ Many to One :end-before: -- q4 .. index:: - single: withPointsCost - Proposed ; Many To Many - Proposed on v2.2 + single: withPointsCost - Proposed ; Many to Many - Proposed on v2.2 Many to Many ............................................................................... diff --git a/doc/withPoints/pgr_withPointsCostMatrix.rst b/doc/withPoints/pgr_withPointsCostMatrix.rst index 707055c4026..30f4592148b 100644 --- a/doc/withPoints/pgr_withPointsCostMatrix.rst +++ b/doc/withPoints/pgr_withPointsCostMatrix.rst @@ -49,8 +49,6 @@ Using Dijkstra algorithm, calculate and return a cost matrix. Signatures ------------------------------------------------------------------------------- -.. rubric:: Summary - .. admonition:: \ \ :class: signatures diff --git a/doc/withPoints/pgr_withPointsKSP.rst b/doc/withPoints/pgr_withPointsKSP.rst index 9355b7969aa..4a11bdafabb 100644 --- a/doc/withPoints/pgr_withPointsKSP.rst +++ b/doc/withPoints/pgr_withPointsKSP.rst @@ -15,7 +15,7 @@ | -pgr_withPointsKSP - Proposed +``pgr_withPointsKSP`` - Proposed =============================================================================== ``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra. diff --git a/docqueries/version/full_version.result b/docqueries/version/full_version.result index c13195ad425..ba1ce30f169 100644 --- a/docqueries/version/full_version.result +++ b/docqueries/version/full_version.result @@ -6,7 +6,7 @@ SET SELECT version, library FROM pgr_full_version(); version | library ---------+----------------- - 3.7.3 | pgrouting-3.7.3 + 3.8.0 | pgrouting-3.8.0 (1 row) /* -- q2 */ diff --git a/docqueries/version/version.result b/docqueries/version/version.result index 7ee29612385..088d0c3eb2e 100644 --- a/docqueries/version/version.result +++ b/docqueries/version/version.result @@ -6,7 +6,7 @@ SET SELECT pgr_version(); pgr_version ------------- - 3.7.3 + 3.8.0 (1 row) /* -- q2 */ diff --git a/locale/de/LC_MESSAGES/index.po b/locale/de/LC_MESSAGES/index.po index 1535e61abb3..1536bd3127e 100644 --- a/locale/de/LC_MESSAGES/index.po +++ b/locale/de/LC_MESSAGES/index.po @@ -1,11 +1,11 @@ # SOME DESCRIPTIVE TITLE. -# Copyright (C) pgRouting Contributors - Version v3.7.2 +# Copyright (C) pgRouting Contributors - Version v3.8 # This file is distributed under the same license as the pgRouting package. # FIRST AUTHOR , YEAR. # msgid "" msgstr "" -"Project-Id-Version: pgRouting v3.7.2\n" +"Project-Id-Version: pgRouting v3.8\n" "Report-Msgid-Bugs-To: \n" "POT-Creation-Date: 2022-06-25 12:55-0500\n" "PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n" diff --git a/locale/de/LC_MESSAGES/pgrouting_doc_strings.po b/locale/de/LC_MESSAGES/pgrouting_doc_strings.po index ccfebb19400..167f0c0d453 100644 --- a/locale/de/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/de/LC_MESSAGES/pgrouting_doc_strings.po @@ -1,10 +1,10 @@ # SOME DESCRIPTIVE TITLE. -# Copyright (C) pgRouting Contributors - Version v3.7.2 +# Copyright (C) pgRouting Contributors - Version v3.8 # This file is distributed under the same license as the pgRouting package. # Regina Obe , 2023. msgid "" msgstr "" -"Project-Id-Version: pgRouting v3.7.2\n" +"Project-Id-Version: pgRouting v3.8\n" "Report-Msgid-Bugs-To: \n" "POT-Creation-Date: 2024-10-17 00:50+0000\n" "PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n" diff --git a/locale/en/LC_MESSAGES/index.po b/locale/en/LC_MESSAGES/index.po index f160fd6b734..f1a267e61db 100644 --- a/locale/en/LC_MESSAGES/index.po +++ b/locale/en/LC_MESSAGES/index.po @@ -1,12 +1,12 @@ # SOME DESCRIPTIVE TITLE. -# Copyright (C) pgRouting Contributors - Version v3.7.2 +# Copyright (C) pgRouting Contributors - Version v3.8 # This file is distributed under the same license as the pgRouting package. # FIRST AUTHOR , 2022. # #, fuzzy msgid "" msgstr "" -"Project-Id-Version: pgRouting v3.7.2\n" +"Project-Id-Version: pgRouting v3.8\n" "Report-Msgid-Bugs-To: \n" "POT-Creation-Date: 2022-06-25 12:55-0500\n" "PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n" diff --git a/locale/en/LC_MESSAGES/pgrouting_doc_strings.po b/locale/en/LC_MESSAGES/pgrouting_doc_strings.po index ecd3c5b6b49..85bf160908c 100644 --- a/locale/en/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/en/LC_MESSAGES/pgrouting_doc_strings.po @@ -1,21 +1,21 @@ # SOME DESCRIPTIVE TITLE. -# Copyright (C) pgRouting Contributors - Version v3.7.2 +# Copyright (C) pgRouting Contributors - Version v3.8 # This file is distributed under the same license as the pgRouting package. # FIRST AUTHOR , 2022. # #, fuzzy msgid "" msgstr "" -"Project-Id-Version: pgRouting v3.7.2\n" +"Project-Id-Version: pgRouting v3.8\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2025-01-06 09:19-0600\n" +"POT-Creation-Date: 2025-02-27 16:46+0000\n" "PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n" "Last-Translator: FULL NAME \n" "Language-Team: LANGUAGE \n" "MIME-Version: 1.0\n" "Content-Type: text/plain; charset=utf-8\n" "Content-Transfer-Encoding: 8bit\n" -"Generated-By: Babel 2.16.0\n" +"Generated-By: Babel 2.17.0\n" msgid "BFS - Category" msgstr "" @@ -655,7 +655,7 @@ msgid "References" msgstr "" msgid "" -"`Boost's metric appro's metric approximation " +"`Boost: metric TSP approx " "`__" msgstr "" @@ -1119,6 +1119,7 @@ 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." @@ -1148,6 +1149,7 @@ 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." @@ -1576,6 +1578,7 @@ msgstr "" msgid ":math:`10 m/s`" msgstr "" +#, python-brace-format msgid ":math:`\\frac{1}{10m/s}`" msgstr "" @@ -1588,6 +1591,7 @@ msgstr "" msgid ":math:`600 m/min`" msgstr "" +#, python-brace-format msgid ":math:`\\frac{1}{600m/min}`" msgstr "" @@ -1603,6 +1607,7 @@ msgstr "" msgid ":math:`36 km/hr`" msgstr "" +#, python-brace-format msgid ":math:`\\frac{1}{36 km/hr}`" msgstr "" @@ -1615,7 +1620,7 @@ msgstr "" msgid "https://en.wikipedia.org/wiki/Vehicle_routing_problem" msgstr "" -msgid "The queries use the :doc:`sampledata` network." +msgid ":doc:`sampledata`" msgstr "" msgid "A* - Family of functions" @@ -1777,7 +1782,9 @@ msgstr "" msgid ":doc:`bdAstar-family`" msgstr "" -msgid "https://www.boost.org/libs/graph/doc/astar_search.html" +msgid "" +"`Boost: A* search " +"`__" msgstr "" msgid "https://en.wikipedia.org/wiki/A*_search_algorithm" @@ -1914,6 +1921,7 @@ msgstr "" msgid "DENSITY" msgstr "" +#, python-brace-format msgid "is the density of the data :math:`\\dfrac{E}{V \\times (V-1)}`." msgstr "" @@ -2581,7 +2589,7 @@ msgid "" "ending vertex:" msgstr "" -msgid "It is expected to terminate faster than pgr_astar" +msgid "It is expected to terminate faster than pgr_aStar" msgstr "" msgid ":doc:`aStar-family`" @@ -2729,29 +2737,7 @@ msgstr "" msgid "Identifier of the color of the edge." msgstr "" -msgid "" -"`Boost: Sequential Vertex Coloring algorithm documentation " -"`__" -msgstr "" - -msgid "" -"`Wikipedia: Graph coloring " -"`__" -msgstr "" - -msgid "" -"`Boost: is_bipartite " -"`__" -msgstr "" - -msgid "" -"`Wikipedia: bipartite graph " -"`__" -msgstr "" - -msgid "" -"`Boost: Edge Coloring Algorithm documentation " -"`__" +msgid "`Boost: `__" msgstr "" msgid "Components - Family of functions" @@ -2860,7 +2846,7 @@ msgstr "" msgid "Node" msgstr "" -msgid "Adjecent nodes" +msgid "Adjacent nodes" msgstr "" msgid "Number of adjacent nodes" @@ -2869,12 +2855,14 @@ msgstr "" msgid ":math:`a`" msgstr "" +#, python-brace-format msgid ":math:`\\{u\\}`" msgstr "" msgid ":math:`b`" msgstr "" +#, python-brace-format msgid ":math:`\\{v\\}`" msgstr "" @@ -2893,6 +2881,7 @@ msgstr "" msgid ":math:`c`" msgstr "" +#, python-brace-format msgid ":math:`\\{v, w\\}`" msgstr "" @@ -2902,20 +2891,24 @@ msgstr "" msgid ":math:`d`" msgstr "" +#, python-brace-format msgid ":math:`\\{x\\}`" msgstr "" msgid ":math:`e`" msgstr "" +#, python-brace-format msgid ":math:`\\{x, y\\}`" msgstr "" +#, python-brace-format msgid "" "From above, nodes :math:`\\{a, b, d\\}` are dead ends because the number " "of adjacent vertices is 1. No further checks are needed for those nodes." msgstr "" +#, python-brace-format msgid "" "On the following table, nodes :math:`\\{c, e\\}` because the even that " "the number of adjacent vertices is not 1 for" @@ -2976,6 +2969,7 @@ msgstr "" msgid ":math:`v`" msgstr "" +#, python-brace-format msgid ":math:`\\{u, w\\}`" msgstr "" @@ -2994,15 +2988,18 @@ msgstr "" msgid "Is symmetrical?" msgstr "" +#, python-brace-format msgid ":math:`\\{u, v\\}`" msgstr "" msgid "yes" msgstr "" +#, python-brace-format msgid ":math:`\\{w, x\\}`" msgstr "" +#, python-brace-format msgid ":math:`\\{y, z\\}`" msgstr "" @@ -3301,9 +3298,6 @@ msgstr "" msgid "Now, the routing graph has an edge connecting with node :math:`7`." msgstr "" -msgid ":doc:`sampledata`" -msgstr "" - msgid "https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/lecture16.pdf" msgstr "" @@ -3619,9 +3613,11 @@ 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)\\}`" @@ -3693,12 +3689,15 @@ 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 \\\\ " @@ -3708,6 +3707,7 @@ msgstr "" msgid "Then:" msgstr "" +#, python-brace-format msgid "" ":math:`\\boldsymbol{\\pi} = \\{(path\\_seq_i, node_i, edge_i, cost_i, " "agg\\_cost_i)\\}`" @@ -3719,18 +3719,22 @@ 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`" @@ -3751,6 +3755,7 @@ msgid "" " \\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 " @@ -3765,6 +3770,7 @@ 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." @@ -4185,6 +4191,7 @@ 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)\\}`" @@ -4226,14 +4233,17 @@ 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 " @@ -4391,157 +4401,18 @@ msgstr "" msgid ":doc:`release_notes`" msgstr "" -msgid "Current release" -msgstr "" - -msgid "pgRouting 3.7.2 Release Notes" +msgid "pgRouting 3.8.0 Release Notes" msgstr "" msgid "No Changes Yet" 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 " -"`__" -msgstr "" - -msgid "Bug fixes" -msgstr "" - -msgid "" -"`#2680 `__ fails to " -"compile under mingw64 gcc 13.2" -msgstr "" - -msgid "" -"`#2689 `__ When point " -"is a vertex, the withPoints family do not return results." -msgstr "" - -msgid "C/C++ code enhancemet" -msgstr "" - -msgid "TRSP family" -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 " -"`__" -msgstr "" - -msgid "Support" -msgstr "" - -msgid "" -"`#2656 `__ Stop support" -" of PostgreSQL12 on pgrouting v3.7" -msgstr "" - -msgid "Stopping support of PostgreSQL 12" -msgstr "" - -msgid "CI does not test for PostgreSQL 12" -msgstr "" - -msgid "New experimental functions" -msgstr "" - -msgid "Metrics" -msgstr "" - -msgid "pgr_betweennessCentrality" -msgstr "" - -msgid "Official functions changes" -msgstr "" - -msgid "" -"`#2605 `__ Standarize " -"spanning tree functions output" -msgstr "" - -msgid "Functions:" -msgstr "" - -msgid "``pgr_kruskalDD``" -msgstr "" - -msgid "``pgr_kruskalDFS``" -msgstr "" - -msgid "``pgr_kruskalBFS``" -msgstr "" - -msgid "``pgr_primDD``" -msgstr "" - -msgid "``pgr_primDFS``" -msgstr "" - -msgid "``pgr_primBFS``" -msgstr "" - -msgid "Standarizing output columns to |result-spantree|" -msgstr "" - -msgid "Added ``pred`` result columns." -msgstr "" - -msgid "Experimental promoted to proposed." -msgstr "" - -msgid "" -"`#2635 `__ " -"pgr_LineGraph ignores directed flag and use negative values for " -"identifiers." -msgstr "" - -msgid "``pgr_lineGraph``" -msgstr "" - -msgid "Promoted to **proposed** signature." -msgstr "" - -msgid "Works for directed and undirected graphs." -msgstr "" - -msgid "Code enhancement" -msgstr "" - -msgid "" -"`#2599 `__ Driving " -"distance cleanup" -msgstr "" - -msgid "" -"`#2607 `__ Read " -"postgresql data on C++" -msgstr "" - -msgid "" -"`#2614 `__ Clang tidy " -"does not work" -msgstr "" - msgid "All releases" msgstr "" msgid "Kruskal - Family of functions" msgstr "" -msgid "Boost Graph Inside" -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 " @@ -4574,12 +4445,6 @@ msgstr "" msgid "All deprecated functions will be removed on next mayor version 4.0.0" msgstr "" -msgid "Migration of functions" -msgstr "" - -msgid "Migrating functions" -msgstr "" - msgid "Migration of ``pgr_aStar``" msgstr "" @@ -4735,7 +4600,7 @@ msgstr "" msgid "If needed add the new columns, for example:" msgstr "" -msgid "Migration of ``pgr_drivingdistance``" +msgid "Migration of ``pgr_drivingDistance``" msgstr "" msgid "" @@ -4756,10 +4621,10 @@ msgstr "" msgid "|result-spantree|" msgstr "" -msgid "``pgr_drivingdistance`` (Single vertex)" +msgid "pgr_drivingDistance(Single vertex)" msgstr "" -msgid "``pgr_drivingdistance`` (Multiple vertices)" +msgid "pgr_drivingDistance(Multiple vertices)" msgstr "" msgid "Output columns were |result-dij-dd|" @@ -4819,12 +4684,21 @@ msgstr "" msgid "|result-bfs|" msgstr "" +msgid "``pgr_kruskalDD``" +msgstr "" + msgid "Single vertex" msgstr "" msgid "Multiple vertices" msgstr "" +msgid "``pgr_kruskalDFS``" +msgstr "" + +msgid "``pgr_kruskalBFS``" +msgstr "" + msgid "Output columns were |result-bfs|" msgstr "" @@ -4982,6 +4856,15 @@ msgid "" "standardized." msgstr "" +msgid "``pgr_primDD``" +msgstr "" + +msgid "``pgr_primDFS``" +msgstr "" + +msgid "``pgr_primBFS``" +msgstr "" + msgid "Prim single vertex" msgstr "" @@ -5178,388 +5061,262 @@ msgid "" "original columns:" msgstr "" -msgid "Migration of turn restrictions" +msgid "Migration of ``pgr_trsp`` (Vertices)" msgstr "" -msgid "Migration of restrictions" +msgid "Signature:" msgstr "" -msgid "The structure of the restrictions have changed:" +msgid "Deprecated" msgstr "" -msgid "Old restrictions structure" +msgid "`v3.4.0 `__" msgstr "" -msgid "On the deprecated signatures:" +msgid ":doc:`pgr_dijkstra`" msgstr "" -msgid "Column ``rid`` is ignored" +msgid ":doc:`pgr_trsp`" msgstr "" -msgid "``via_path``" +msgid "`Migration of restrictions`_" msgstr "" -msgid "Must be in reverse order." +msgid "Use ``pgr_dijkstra`` when there are no restrictions." msgstr "" -msgid "Is of type ``TEXT``." +msgid "Use :doc:`pgr_dijkstra` instead." msgstr "" -msgid "When more than one via edge must be separated with ``,``." +msgid "To get the original column names:" msgstr "" -msgid "``target_id``" +msgid "``id1`` is the node" msgstr "" -msgid "Is the last edge of the forbidden path." +msgid "``id2`` is the edge" msgstr "" -msgid "Is of type ``INTEGER``." +msgid "Use ``pgr_trsp`` when there are restrictions." msgstr "" -msgid "``to_cost``" +msgid "Use :doc:`pgr_trsp` (One to One) instead." msgstr "" -msgid "Is of type ``FLOAT``." +msgid "Migration of ``pgr_trsp`` (Edges)" msgstr "" -msgid "Creation of the old restrictions table" +msgid ":doc:`pgr_withPoints`" msgstr "" -msgid "Old restrictions fill up" +msgid ":doc:`pgr_trsp_withPoints`" msgstr "" -msgid "Old restrictions contents" +msgid "Use ``pgr_withPoints`` when there are no restrictions." msgstr "" -msgid "" -"The restriction with ``rid = 2`` is representing :math:`3 \\rightarrow 5 " -"\\rightarrow9`" +msgid "Use :doc:`pgr_withPoints` (One to One) instead." msgstr "" -msgid ":math:`3\\rightarrow5`" +msgid "Use ``pgr_trsp_withPoints`` when there are restrictions." msgstr "" -msgid "is on column ``via_path`` in reverse order" +msgid "Use :doc:`pgr_trsp_withPoints` instead." msgstr "" -msgid "is of type ``TEXT``" +msgid "Migration of ``pgr_trspViaVertices``" msgstr "" -msgid ":math:`9`" +msgid ":doc:`pgr_dijkstraVia`" msgstr "" -msgid "is on column ``target_id``" +msgid ":doc:`pgr_trspVia`" msgstr "" -msgid "is of type ``INTEGER``" +msgid "Use ``pgr_dijkstraVia`` when there are no restrictions" msgstr "" -msgid "New restrictions structure" +msgid "Use :doc:`pgr_dijkstraVia` instead." msgstr "" -msgid "Column ``id`` is ignored" +msgid "``id1`` is the path identifier" msgstr "" -msgid "Column ``path``" +msgid "``id2`` is the node" msgstr "" -msgid "Is of type ``ARRAY[ANY-INTEGER]``." +msgid "``id3`` is the edge" msgstr "" -msgid "Contains all the edges involved on the restriction." +msgid "Use ``pgr_trspVia`` when there are restrictions" msgstr "" -msgid "The array has the ordered edges of the restriction." +msgid "Use :doc:`pgr_trspVia` instead." msgstr "" -msgid "Column ``cost``" +msgid "Migration of ``pgr_trspViaEdges``" msgstr "" -msgid "Is of type ``ANY-NUMERICAL``" +msgid ":doc:`pgr_withPointsVia`" msgstr "" -msgid "The creation of the restrictions table" +msgid ":doc:`pgr_trspVia_withPoints`" msgstr "" -msgid "Adding the restrictions" +msgid "Use ``pgr_withPointsVia`` when there are no restrictions" msgstr "" -msgid "Restrictions data" +msgid "Use :doc:`pgr_withPointsVia` instead." msgstr "" -msgid "" -"The restriction with ``rid = 2`` represents the path :math:`3 " -"\\rightarrow5 \\rightarrow9`." +msgid "Use ``pgr_trspVia_withPoints`` when there are restrictions" msgstr "" -msgid "By inspection the path is clear." +msgid "Use :doc:`pgr_trspVia_withPoints` instead." msgstr "" -msgid "To transform the old restrictions table to the new restrictions structure," +msgid "Migration of restrictions" msgstr "" -msgid "Create a new table with the new restrictions structure." +msgid "The structure of the restrictions have changed:" msgstr "" -msgid "In this migration guide ``new_restrictions`` is been used." +msgid "Old restrictions structure" msgstr "" -msgid "" -"For this migration pgRouting supplies an auxiliary function for reversal " -"of an array ``_pgr_array_reverse`` needed for the migration." -msgstr "" - -msgid "``_pgr_array_reverse``:" -msgstr "" - -msgid "Was created temporally for this migration" -msgstr "" - -msgid "Is not documented." -msgstr "" - -msgid "Will be removed on the next mayor version 4.0.0" -msgstr "" - -msgid "The migrated table contents:" -msgstr "" - -msgid "Migration of ``pgr_trsp`` (Vertices)" -msgstr "" - -msgid "" -":doc:`pgr_trsp` signatures have changed and many issues have been fixed " -"in the new signatures. This section will show how to migrate from the old" -" signatures to the new replacement functions. This also affects the " -"restrictions." -msgstr "" - -msgid "The integral type of the ``Edges SQL`` can only be ``INTEGER``." -msgstr "" - -msgid "The floating point type of the ``Edges SQL`` can only be ``FLOAT``." -msgstr "" - -msgid "``directed`` flag is compulsory." -msgstr "" - -msgid "Does not autodetect if ``reverse_cost`` column exist." -msgstr "" - -msgid "" -"User must be careful to match the existence of the column with the value " -"of ``has_rcost`` parameter." -msgstr "" - -msgid "The restrictions inner query is optional." -msgstr "" - -msgid "The output column names are meaningless" -msgstr "" - -msgid "Migrate by using:" -msgstr "" - -msgid ":doc:`pgr_dijkstra` when there are no restrictions," -msgstr "" - -msgid ":doc:`pgr_trsp` (One to One) when there are restrictions." -msgstr "" - -msgid "Migrating ``pgr_trsp`` (Vertices) using ``pgr_dijkstra``" +msgid "On the deprecated signatures:" msgstr "" -msgid "The following query does not have restrictions." +msgid "Column ``rid`` is ignored" msgstr "" -msgid "A message about deprecation is shown" +msgid "``via_path``" msgstr "" -msgid "Deprecated functions will be removed on the next mayor version 4.0.0" +msgid "Must be in reverse order." msgstr "" -msgid "Use :doc:`pgr_dijkstra` instead." +msgid "Is of type ``TEXT``." msgstr "" -msgid "The types casting has been removed." +msgid "When more than one via edge must be separated with ``,``." msgstr "" -msgid ":doc:`pgr_dijkstra`:" +msgid "``target_id``" msgstr "" -msgid "Autodetects if ``reverse_cost`` column is in the edges SQL." +msgid "Is the last edge of the forbidden path." msgstr "" -msgid "Accepts ``ANY-INTEGER`` on integral types" +msgid "Is of type ``INTEGER``." msgstr "" -msgid "Accepts ``ANY-NUMERICAL`` on floating point types" +msgid "``to_cost``" msgstr "" -msgid "``directed`` flag has a default value of ``true``." +msgid "Is of type ``FLOAT``." msgstr "" -msgid "Use the same value that on the original query." +msgid "Creation of the old restrictions table" msgstr "" -msgid "In this example it is ``true`` which is the default value." +msgid "Old restrictions fill up" msgstr "" -msgid "The flag has been omitted and the default is been used." +msgid "Old restrictions contents" msgstr "" msgid "" -"When the need of using strictly the same (meaningless) names and types of" -" the function been migrated then:" -msgstr "" - -msgid "``id1`` is the node" -msgstr "" - -msgid "``id2`` is the edge" -msgstr "" - -msgid "Migrating ``pgr_trsp`` (Vertices) using ``pgr_trsp``" -msgstr "" - -msgid "The following query has restrictions." +"The restriction with ``rid = 2`` is representing :math:`3 \\rightarrow 5 " +"\\rightarrow9`" msgstr "" -msgid "The restrictions are the last parameter of the function" +msgid ":math:`3\\rightarrow5`" msgstr "" -msgid "Using the old structure of restrictions" +msgid "is on column ``via_path`` in reverse order" msgstr "" -msgid "Use :doc:`pgr_trsp` (One to One) instead." +msgid "is of type ``TEXT``" msgstr "" -msgid "The new structure of restrictions is been used." +msgid ":math:`9`" msgstr "" -msgid "It is the second parameter." +msgid "is on column ``target_id``" msgstr "" -msgid ":doc:`pgr_trsp`:" +msgid "is of type ``INTEGER``" msgstr "" -msgid "Migration of ``pgr_trsp`` (Edges)" +msgid "New restrictions structure" msgstr "" -msgid "The integral types of the ``sql`` can only be ``INTEGER``." +msgid "Column ``id`` is ignored" msgstr "" -msgid "The floating point type of the ``sql`` can only be ``FLOAT``." +msgid "Column ``path``" msgstr "" -msgid "For these migration guide the following points will be used:" +msgid "Is of type ``ARRAY[ANY-INTEGER]``." msgstr "" -msgid ":doc:`pgr_withPoints` when there are no restrictions," +msgid "Contains all the edges involved on the restriction." msgstr "" -msgid ":doc:`pgr_trsp_withPoints` (One to One) when there are restrictions." +msgid "The array has the ordered edges of the restriction." msgstr "" -msgid "Migrating ``pgr_trsp`` (Edges) using ``pgr_withPoints``" +msgid "Column ``cost``" msgstr "" -msgid "Use :doc:`pgr_withPoints` instead." +msgid "Is of type ``ANY-NUMERICAL``" msgstr "" -msgid "Do not show details, as the deprecated function does not show details." +msgid "The creation of the restrictions table" msgstr "" -msgid ":doc:`pgr_withPoints`:" +msgid "Adding the restrictions" msgstr "" -msgid "On the points query do not include the ``side`` column." +msgid "Restrictions data" msgstr "" msgid "" -"When the need of using strictly the same (meaningless) names and types, " -"and node values of the function been migrated then:" -msgstr "" - -msgid "Migrating ``pgr_trsp`` (Edges) using ``pgr_trsp_withPoints``" -msgstr "" - -msgid "Use :doc:`pgr_trsp_withPoints` instead." -msgstr "" - -msgid ":doc:`pgr_trsp_withPoints`:" -msgstr "" - -msgid "Migration of ``pgr_trspViaVertices``" -msgstr "" - -msgid "The integral types of the ``Edges SQL`` can only be ``INTEGER``." -msgstr "" - -msgid ":doc:`pgr_dijkstraVia` when there are no restrictions," -msgstr "" - -msgid ":doc:`pgr_trspVia` when there are restrictions." -msgstr "" - -msgid "Migrating ``pgr_trspViaVertices`` using ``pgr_dijkstraVia``" -msgstr "" - -msgid "Use :doc:`pgr_dijkstraVia` instead." -msgstr "" - -msgid ":doc:`pgr_dijkstraVia`:" -msgstr "" - -msgid "``id1`` is the path identifier" -msgstr "" - -msgid "``id2`` is the node" -msgstr "" - -msgid "``id3`` is the edge" +"The restriction with ``rid = 2`` represents the path :math:`3 " +"\\rightarrow5 \\rightarrow9`." msgstr "" -msgid "Migrating ``pgr_trspViaVertices`` using ``pgr_trspVia``" +msgid "By inspection the path is clear." msgstr "" -msgid "Use :doc:`pgr_trspVia` instead." +msgid "To transform the old restrictions table to the new restrictions structure," msgstr "" -msgid ":doc:`pgr_trspVia`:" +msgid "Create a new table with the new restrictions structure." msgstr "" -msgid "Migration of ``pgr_trspViaEdges``" +msgid "In this migration guide ``new_restrictions`` is been used." msgstr "" msgid "" -"And will travel thru the following Via points " -":math:`4\\rightarrow3\\rightarrow6`" -msgstr "" - -msgid ":doc:`pgr_withPointsVia` when there are no restrictions," -msgstr "" - -msgid ":doc:`pgr_trspVia_withPoints` when there are restrictions." -msgstr "" - -msgid "Migrating ``pgr_trspViaEdges`` using ``pgr_withPointsVia``" +"For this migration pgRouting supplies an auxiliary function for reversal " +"of an array ``_pgr_array_reverse`` needed for the migration." msgstr "" -msgid "Use :doc:`pgr_withPointsVia` instead." +msgid "``_pgr_array_reverse``:" msgstr "" -msgid ":doc:`pgr_withPointsVia`:" +msgid "Was created temporally for this migration" msgstr "" -msgid "Migrating ``pgr_trspViaEdges`` using ``pgr_trspVia_withPoints``" +msgid "Is not documented." msgstr "" -msgid "Use :doc:`pgr_trspVia_withPoints` instead." +msgid "Will be removed on the next mayor version 4.0.0" msgstr "" -msgid ":doc:`pgr_trspVia_withPoints`:" +msgid "The migrated table contents:" msgstr "" msgid ":doc:`withPoints-category`" @@ -5585,27 +5342,32 @@ 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\\}`" msgstr "" @@ -5686,6 +5448,7 @@ 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 " @@ -5701,17 +5464,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}`" msgstr "" +#, python-brace-format msgid "" "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." @@ -5752,11 +5518,13 @@ 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}`" msgstr "" +#, python-brace-format msgid "" "edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` has " "directionality: :math:`target_{id} \\rightarrow source_{id}`" @@ -5774,11 +5542,13 @@ 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}`" @@ -5793,9 +5563,11 @@ 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 "" @@ -5831,12 +5603,14 @@ 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), " @@ -6289,6 +6063,7 @@ msgstr "" msgid "To get the graph connectivity:" msgstr "" +#, python-brace-format 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" @@ -6696,9 +6471,6 @@ msgstr "" msgid "Parameters for the Via functions" msgstr "" -msgid ":doc:`pgr_dijkstraVia`" -msgstr "" - msgid "SQL query as described." msgstr "" @@ -6738,9 +6510,6 @@ msgstr "" msgid "For the TRSP functions" msgstr "" -msgid ":doc:`pgr_trsp`" -msgstr "" - msgid "Array of identifiers of destination vertices." msgstr "" @@ -6792,9 +6561,6 @@ msgstr "" msgid "Used in functions the following:" msgstr "" -msgid ":doc:`pgr_withPoints`" -msgstr "" - msgid "" "Returns set of ``(seq, path_seq [, start_pid] [, end_pid], node, edge, " "cost, agg_cost)``" @@ -7080,7 +6846,7 @@ msgid "Upgrading the database" msgstr "" msgid "" -"To upgrade pgRouting in the database to version 3.7.2 use the following " +"To upgrade pgRouting in the database to version 3.8.0 use the following " "command:" msgstr "" @@ -7533,7 +7299,7 @@ msgstr "" msgid ":doc:`migration`" msgstr "" -msgid "pgr_KSP" +msgid "``pgr_KSP``" msgstr "" msgid "``pgr_KSP`` — Yen's algorithm for K shortest paths using Dijkstra." @@ -7548,25 +7314,25 @@ msgstr "" msgid "Result columns standarized to: |nksp-result|" msgstr "" -msgid "``pgr_ksp`` (One to One)" +msgid "pgr_ksp(One to One)" msgstr "" msgid "Added ``start_vid`` and ``end_vid`` result columns." msgstr "" -msgid "New overload functions:" +msgid "New proposed signatures:" msgstr "" -msgid "``pgr_ksp`` (One to Many)" +msgid "pgr_ksp(One to Many)" msgstr "" -msgid "``pgr_ksp`` (Many to One)" +msgid "pgr_ksp(Many to One)" msgstr "" -msgid "``pgr_ksp`` (Many to Many)" +msgid "pgr_ksp(Many to Many)" msgstr "" -msgid "``pgr_ksp`` (Combinations)" +msgid "pgr_ksp(Combinations)" msgstr "" msgid "Version 2.1.0" @@ -7581,7 +7347,7 @@ msgstr "" msgid "Version 2.0.0" msgstr "" -msgid "**Official** function" +msgid "Official function." msgstr "" msgid "" @@ -7589,6 +7355,12 @@ msgid "" "the number of shortest paths desired." msgstr "" +msgid "|Boost| Boost Graph Inside" +msgstr "" + +msgid "Boost Graph inside" +msgstr "" + msgid "Signatures" msgstr "" @@ -7625,16 +7397,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." @@ -7699,6 +7474,7 @@ 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." @@ -7710,7 +7486,7 @@ msgstr "" msgid "``pgr_TSP``" msgstr "" -msgid "``pgr_TSP`` - Aproximation using *metric* algorithm." +msgid "``pgr_TSP`` - Approximation using *metric* algorithm." msgstr "" msgid "Availability:" @@ -7831,6 +7607,7 @@ 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." @@ -7913,6 +7690,7 @@ 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." @@ -7926,7 +7704,12 @@ msgstr "" msgid "``pgr_TSPeuclidean``" msgstr "" -msgid "``pgr_TSPeuclidean`` - Aproximation using *metric* algorithm." +msgid "``pgr_TSPeuclidean`` - Approximation using *metric* algorithm." +msgstr "" + +msgid "" +"Using `Boost: metric TSP approx " +"`__" msgstr "" msgid "" @@ -7942,7 +7725,7 @@ msgstr "" msgid "Name change from pgr_eucledianTSP" msgstr "" -msgid "New **Official** function" +msgid "New official function." msgstr "" msgid "" @@ -8025,9 +7808,6 @@ msgid "" "image is the solution obtained with ``pgr_TSPeuclidean``." msgstr "" -msgid ":doc:`sampledata` network." -msgstr "" - msgid "``pgr_aStar``" msgstr "" @@ -8037,43 +7817,40 @@ msgstr "" msgid "Standarizing output columns to |short-generic-result|" msgstr "" -msgid "``pgr_aStar`` (`One to One`_) added ``start_vid`` and ``end_vid`` columns." +msgid "pgr_aStar(One to One) added ``start_vid`` and ``end_vid`` columns." msgstr "" -msgid "``pgr_aStar`` (`One to Many`_) added ``end_vid`` column." +msgid "pgr_aStar(One to Many) added ``end_vid`` column." msgstr "" -msgid "``pgr_aStar`` (`Many to One`_) added ``start_vid`` column." +msgid "pgr_aStar(Many to One) added ``start_vid`` column." msgstr "" msgid "Version 3.2.0" msgstr "" -msgid "New **proposed** signature:" -msgstr "" - -msgid "``pgr_aStar`` (`Combinations`_)" +msgid "New proposed signature:" msgstr "" -msgid "Version 2.4.0" +msgid "pgr_aStar(Combinations)" msgstr "" -msgid "New **Proposed** signatures:" +msgid "Function promoted to official." msgstr "" -msgid "``pgr_aStar`` (`One to Many`_)" +msgid "Version 2.4.0" msgstr "" -msgid "``pgr_aStar`` (`Many to One`_)" +msgid "pgr_aStar(One to Many)" msgstr "" -msgid "``pgr_aStar`` (`Many to Many`_)" +msgid "pgr_aStar(Many to One)" msgstr "" -msgid "Signature change on ``pgr_astar`` (`One to One`_)" +msgid "pgr_aStar(Many to Many)" msgstr "" -msgid "**Official** ``pgr_aStar`` (`One to One`_)" +msgid "Signature change on pgr_aStar(One to One)" msgstr "" msgid "" @@ -8110,16 +7887,19 @@ 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`" msgstr "" +#, python-brace-format msgid "" "From vertices :math:`\\{6, 8\\}` to vertices :math:`\\{10, 12\\}` on a " "**directed** graph with factor :math:`0.5`" @@ -8148,7 +7928,7 @@ msgstr "" msgid "Manually assigned vertex combinations." msgstr "" -msgid "pgr_aStarCost" +msgid "``pgr_aStarCost``" msgstr "" msgid "" @@ -8156,10 +7936,10 @@ msgid "" "algorithm." msgstr "" -msgid "``pgr_aStarCost`` (`Combinations`_)" +msgid "pgr_aStarCost(Combinations)" msgstr "" -msgid "New **proposed** function" +msgid "New proposed function." msgstr "" msgid "" @@ -8243,6 +8023,7 @@ 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`" @@ -8278,6 +8059,9 @@ msgstr "" msgid "Renamed from version 1.x" msgstr "" +msgid "Support" +msgstr "" + msgid "Returns the polygon part of an alpha shape." msgstr "" @@ -8348,7 +8132,7 @@ msgstr "" msgid "`ST_ConcaveHull `__" msgstr "" -msgid "pgr_analyzeGraph" +msgid "``pgr_analyzeGraph``" msgstr "" msgid "``pgr_analyzeGraph`` — Analyzes the network topology." @@ -8612,9 +8396,6 @@ msgid "" "table ``othertable``. (note the use of quote_literal)" msgstr "" -msgid "The examples use the :doc:`sampledata` network." -msgstr "" - msgid ":doc:`pgr_analyzeOneWay`" msgstr "" @@ -8624,7 +8405,7 @@ msgstr "" msgid ":doc:`pgr_nodeNetwork` to create nodes to a not noded edge table." msgstr "" -msgid "pgr_analyzeOneWay" +msgid "``pgr_analyzeOneWay``" msgstr "" msgid "" @@ -8775,7 +8556,7 @@ msgstr "" msgid "Version 2.5.0" msgstr "" -msgid "New **experimental** function" +msgid "New experimental function." msgstr "" msgid "" @@ -8808,7 +8589,7 @@ msgid "Nodes in red are the articulation points." msgstr "" msgid "" -"Boost: `Biconnected components & articulation points " +"`Boost: Biconnected components & articulation points " "`__" msgstr "" @@ -8823,38 +8604,33 @@ msgstr "" msgid "``pgr_bdAstar`` — Shortest path using the bidirectional A* algorithm." msgstr "" -msgid "" -"``pgr_bdAstar`` (`One to One`_) added ``start_vid`` and ``end_vid`` " -"columns." -msgstr "" - -msgid "``pgr_bdAstar`` (`One to Many`_) added ``end_vid`` column." +msgid "pgr_bdAstar(One to One) added ``start_vid`` and ``end_vid`` columns." msgstr "" -msgid "``pgr_bdAstar`` (`Many to One`_) added ``start_vid`` column." +msgid "pgr_bdAstar(One to Many) added ``end_vid`` column." msgstr "" -msgid "``pgr_bdAstar`` (`Combinations`_)" +msgid "pgr_bdAstar(Many to One) added ``start_vid`` column." msgstr "" -msgid "``pgr_bdAstar`` (`One to Many`_)" +msgid "pgr_bdAstar(Combinations)" msgstr "" -msgid "``pgr_bdAstar`` (`Many to One`_)" +msgid "pgr_bdAstar(One to Many)" msgstr "" -msgid "``pgr_bdAstar`` (`Many to Many`_)" +msgid "pgr_bdAstar(Many to One)" msgstr "" -msgid "Signature change on ``pgr_bdAstar`` (`One to One`_)" +msgid "pgr_bdAstar(Many to Many)" msgstr "" -msgid "**Official** ``pgr_bdAstar`` (`One to One`_)" +msgid "Signature change on pgr_bdAstar(One to One)" msgstr "" msgid "" "The results are equivalent to the union of the results of the " -"`pgr_bdAStar(` `One to One`_ `)` on the:" +"pgr_bdAStar(One to One) on the:" msgstr "" msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" @@ -8872,7 +8648,7 @@ msgstr "" msgid "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" -msgid "pgr_bdAstarCost" +msgid "``pgr_bdAstarCost``" msgstr "" msgid "" @@ -8880,7 +8656,7 @@ msgid "" "bidirectional A* algorithm." msgstr "" -msgid "``pgr_bdAstarCost`` (`Combinations`_)" +msgid "pgr_bdAstarCost(Combinations)" msgstr "" msgid "" @@ -8925,25 +8701,19 @@ msgid "" "Dijkstra algorithm." msgstr "" -msgid "pgr_bdDijkstra(`Combinations`_)" -msgstr "" - -msgid "New **Proposed** functions:" -msgstr "" - -msgid "``pgr_bdDijkstra`` (`One to Many`_)" +msgid "pgr_bdDijkstra(Combinations)" msgstr "" -msgid "``pgr_bdDijkstra`` (`Many to One`_)" +msgid "pgr_bdDijkstra(One to Many)" msgstr "" -msgid "``pgr_bdDijkstra`` (`Many to Many`_)" +msgid "pgr_bdDijkstra(Many to One)" msgstr "" -msgid "Signature change on ``pgr_bdDijsktra`` (`One to One`_)" +msgid "pgr_bdDijkstra(Many to Many)" msgstr "" -msgid "**Official** ``pgr_bdDijkstra`` (`One to One`_)" +msgid "Signature change on pgr_bdDijsktra(One to One)" msgstr "" msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" @@ -8973,6 +8743,7 @@ 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" @@ -8981,11 +8752,13 @@ 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" msgstr "" +#, python-brace-format msgid "" "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an " "**undirected** graph" @@ -8994,10 +8767,6 @@ msgstr "" msgid "Using a combinations table on an **undirected** graph" msgstr "" -#, python-format -msgid "https://www.cs.princeton.edu/courses/archive/spr06/cos423/Handouts/EPP%20shortest%20path%20algorithms.pdf" -msgstr "" - msgid "https://en.wikipedia.org/wiki/Bidirectional_search" msgstr "" @@ -9009,7 +8778,7 @@ msgid "" "Bidirectional Dijkstra algorithm." msgstr "" -msgid "``pgr_bdDijkstraCost`` (`Combinations`_)" +msgid "pgr_bdDijkstraCost(Combinations)" msgstr "" msgid "" @@ -9059,6 +8828,7 @@ 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" @@ -9073,25 +8843,10 @@ msgstr "" msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm." msgstr "" -msgid "New **experimental** signature:" -msgstr "" - -msgid "``pgr_bellmanFord`` (`Combinations`_)" -msgstr "" - -msgid "New **experimental** signatures:" -msgstr "" - -msgid "``pgr_bellmanFord`` (`One to One`_)" +msgid "New experimental signature:" msgstr "" -msgid "``pgr_bellmanFord`` (`One to Many`_)" -msgstr "" - -msgid "``pgr_bellmanFord`` (`Many to One`_)" -msgstr "" - -msgid "``pgr_bellmanFord`` (`Many to Many`_)" +msgid "pgr_bellmanFord(Combinations)" msgstr "" msgid "" @@ -9155,6 +8910,7 @@ 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" @@ -9163,24 +8919,29 @@ msgstr "" msgid "Using a combinations table on an **undirected** graph." msgstr "" +msgid "" +"`Boost: Bellman Ford " +"`__" +msgstr "" + #, python-format msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" msgstr "" -msgid "``pgr_betweennessCentrality``" +msgid "Boost Graph Inside" +msgstr "" + +msgid "``pgr_betweennessCentrality`` - Experimental" msgstr "" msgid "" -"``pgr_betweennessCentrality`` - Calculates the relative betweeness " +"``pgr_betweennessCentrality`` - Calculates the relative betweenness " "centrality using Brandes Algorithm" msgstr "" msgid "Version 3.7.0" msgstr "" -msgid "New **experimental** function:" -msgstr "" - msgid "" "The Brandes Algorithm takes advantage of the sparse graphs for evaluating" " the betweenness centrality score of all vertices." @@ -9217,6 +8978,7 @@ msgstr "" msgid "Returns set of ``(vid, centrality)``" msgstr "" +#, python-brace-format msgid "For a directed graph with edges :math:`\\{1, 2, 3, 4\\}`." msgstr "" @@ -9252,11 +9014,8 @@ msgid "" msgstr "" msgid "" -"Boost's `betweenness_centrality " -"`_" -msgstr "" - -msgid "Queries use the :doc:`sampledata` network." +"`Boost: betweenness centrality " +"`_" msgstr "" msgid "``pgr_biconnectedComponents``" @@ -9315,11 +9074,6 @@ msgstr "" msgid "Identifier of the edge that belongs to the ``component``." msgstr "" -msgid "" -"Boost: `Biconnected components " -"`__" -msgstr "" - msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" msgstr "" @@ -9328,24 +9082,13 @@ 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'." msgstr "" -msgid "pgr_binaryBreadthFirstSearch(`Combinations`_)" -msgstr "" - -msgid "pgr_binaryBreadthFirstSearch(`One to One`_)" -msgstr "" - -msgid "pgr_binaryBreadthFirstSearch(`One to Many`_)" -msgstr "" - -msgid "pgr_binaryBreadthFirstSearch(`Many to One`_)" -msgstr "" - -msgid "pgr_binaryBreadthFirstSearch(`Many to Many`_)" +msgid "pgr_binaryBreadthFirstSearch(Combinations)" msgstr "" msgid "" @@ -9359,6 +9102,7 @@ msgid "" ":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 " @@ -9368,6 +9112,7 @@ msgid "" "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 " @@ -9407,6 +9152,11 @@ msgid "" "(i.e :math:`1``)" msgstr "" +msgid "" +"`Boost: Breadth First Search " +"`__" +msgstr "" + msgid "https://cp-algorithms.com/graph/01_bfs.html" msgstr "" @@ -9414,7 +9164,7 @@ msgstr "" msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" msgstr "" -msgid "pgr_bipartite -Experimental" +msgid "``pgr_bipartite`` - Experimental" msgstr "" msgid "" @@ -9422,9 +9172,6 @@ msgid "" "within the same set are adjacent." msgstr "" -msgid "New **experimental** signature" -msgstr "" - msgid "" "A bipartite graph is a graph with two sets of vertices which are " "connected to each other, but not within themselves. A bipartite graph is " @@ -9462,6 +9209,7 @@ 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 " @@ -9471,6 +9219,16 @@ msgstr "" msgid "Edges in blue represent odd length cycle subgraph." msgstr "" +msgid "" +"`Boost: is_bipartite " +"`__" +msgstr "" + +msgid "" +"`Wikipedia: bipartite graph " +"`__" +msgstr "" + msgid "``pgr_boykovKolmogorov``" msgstr "" @@ -9480,19 +9238,13 @@ msgid "" "Kolmogorov algorithm." msgstr "" -msgid "New **proposed** signature" -msgstr "" - -msgid "``pgr_boykovKolmogorov`` (`Combinations`_)" +msgid "pgr_boykovKolmogorov(Combinations)" msgstr "" msgid "Renamed from ``pgr_maxFlowBoykovKolmogorov``" msgstr "" -msgid "**Proposed** function" -msgstr "" - -msgid "New **Experimental** function" +msgid "Function promoted to proposed." msgstr "" msgid "Running time: Polynomial" @@ -9519,21 +9271,27 @@ 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\\}`" msgstr "" +#, python-brace-format msgid "" "Using a combinations table, equivalent to calculating result from " "vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`." msgstr "" -msgid "https://www.boost.org/libs/graph/doc/boykov_kolmogorov_max_flow.html" +msgid "" +"`Boost: Boykov Kolmogorov max flow " +"`__" msgstr "" msgid "``pgr_breadthFirstSearch`` - Experimental" @@ -9544,12 +9302,6 @@ msgid "" " First Search algorithm." msgstr "" -msgid "``pgr_breadthFirstSearch`` (`Single Vertex`_)" -msgstr "" - -msgid "``pgr_breadthFirstSearch`` (`Multiple Vertices`_)" -msgstr "" - msgid "" "Provides the Breadth First Search traversal order from a root vertex to a" " particular depth." @@ -9583,6 +9335,7 @@ msgid "" "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``" @@ -9614,11 +9367,6 @@ msgstr "" msgid "descending" msgstr "" -msgid "" -"`Boost: Breadth First Search algorithm documentation " -"`__" -msgstr "" - msgid "" "`Wikipedia: Breadth First Search algorithm `__" @@ -9658,7 +9406,9 @@ msgstr "" msgid "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" msgstr "" -msgid "**Supported versions**" +msgid "" +"`Boost: Connected components " +"`__" msgstr "" msgid "``pgr_chinesePostman`` - Experimental" @@ -9717,7 +9467,7 @@ msgstr "" msgid "Minimum costs of a circuit path." msgstr "" -msgid "pgr_connectedComponents" +msgid "``pgr_connectedComponents``" msgstr "" msgid "" @@ -9754,11 +9504,6 @@ msgstr "" msgid "Connecting disconnected components" msgstr "" -msgid "" -"Boost: `Connected components " -"`__" -msgstr "" - msgid "" "wikipedia: `Connected component " "`__" @@ -9775,6 +9520,9 @@ msgstr "" msgid "Name change from ``pgr_contractGraph``" msgstr "" +msgid "Bug fixes" +msgstr "" + msgid "" "Contraction reduces the size of the graph by removing some of the " "vertices and edges and, for example, might add edges that represent a " @@ -9932,7 +9680,7 @@ msgstr "" msgid "Only linear contraction" msgstr "" -msgid "pgr_createTopology" +msgid "``pgr_createTopology``" msgstr "" msgid "" @@ -10136,10 +9884,7 @@ msgid "" "incremented to the rest of the edges." msgstr "" -msgid "The example uses the :doc:`sampledata` network." -msgstr "" - -msgid "pgr_createVerticesTable" +msgid "``pgr_createVerticesTable``" msgstr "" msgid "" @@ -10357,7 +10102,7 @@ msgid "" "`__" msgstr "" -msgid "pgr_dagShortestPath - Experimental" +msgid "``pgr_dagShortestPath`` - Experimental" msgstr "" msgid "" @@ -10419,12 +10164,15 @@ 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" @@ -10436,6 +10184,11 @@ msgstr "" msgid "Making **start_vids** the same as **end_vids**" msgstr "" +msgid "" +"`Boost: DAG shortest paths " +"`__" +msgstr "" + msgid "https://en.wikipedia.org/wiki/Topological_sorting" msgstr "" @@ -10555,15 +10308,6 @@ msgstr "" msgid "Version 3.3.0" msgstr "" -msgid "Promoted to **proposed** function" -msgstr "" - -msgid "``pgr_depthFirstSearch`` (`Single Vertex`_)" -msgstr "" - -msgid "``pgr_depthFirstSearch`` (`Multiple Vertices`_)" -msgstr "" - msgid "" "Depth First Search algorithm is a traversal algorithm which starts from a" " root vertex, goes as deep as possible, and backtracks once a vertex is " @@ -10617,12 +10361,12 @@ msgid "Same as `Single vertex`_ but with edges in descending order of ``id``." msgstr "" msgid "" -"`Boost: Depth First Search algorithm documentation " +"`Boost: Depth First Search " "`__" msgstr "" msgid "" -"`Boost: Undirected DFS algorithm documentation " +"`Boost: Undirected DFS " "`__" msgstr "" @@ -10640,45 +10384,34 @@ msgstr "" msgid "Version 3.5.0" msgstr "" -msgid "" -"``pgr_dijkstra`` (`One to One`_) added ``start_vid`` and ``end_vid`` " -"columns." +msgid "pgr_dijkstra(One to One) added ``start_vid`` and ``end_vid`` columns." msgstr "" -msgid "``pgr_dijkstra`` (`One to Many`_) added ``end_vid`` column." +msgid "pgr_dijkstra(One to Many) added ``end_vid`` column." msgstr "" -msgid "``pgr_dijkstra`` (`Many to One`_) added ``start_vid`` column." +msgid "pgr_dijkstra(Many to One) added ``start_vid`` column." msgstr "" msgid "Version 3.1.0" msgstr "" -msgid "``pgr_dijkstra`` (`Combinations`_)" -msgstr "" - -msgid "**Official** functions" +msgid "pgr_dijkstra(Combinations)" msgstr "" msgid "Version 2.2.0" msgstr "" -msgid "New **proposed** functions:" -msgstr "" - -msgid "``pgr_dijkstra`` (`One to Many`_)" -msgstr "" - -msgid "``pgr_dijkstra`` (`Many to One`_)" +msgid "pgr_dijkstra(One to Many)" msgstr "" -msgid "``pgr_dijkstra`` (`Many to Many`_)" +msgid "pgr_dijkstra(Many to One)" msgstr "" -msgid "Signature change on ``pgr_dijkstra`` (`One to One`_)" +msgid "pgr_dijkstra(Many to Many)" msgstr "" -msgid "**Official** ``pgr_dijkstra`` (`One to One`_)" +msgid "Signature change on pgr_dijkstra(One to One)" msgstr "" msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" @@ -10701,6 +10434,7 @@ msgid "" "columns to the new result columns." msgstr "" +#, python-brace-format msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed**" msgstr "" @@ -10728,24 +10462,28 @@ 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\\}`" @@ -10844,6 +10582,7 @@ msgstr "" msgid "Equvalences between signatures" msgstr "" +#, python-brace-format msgid "" "The following examples find the path for " ":math:`\\{6\\}\\rightarrow\\{10\\}`" @@ -10864,6 +10603,14 @@ msgstr "" msgid "37) Using `Combinations`_" msgstr "" +msgid "e Also" +msgstr "" + +msgid "" +"`Boost: Dijkstra shortest paths " +"`__" +msgstr "" + #, python-format msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgstr "" @@ -10876,7 +10623,7 @@ msgid "" "algorithm." msgstr "" -msgid "``pgr_dijkstraCost`` (`Combinations`_)" +msgid "pgr_dijkstraCost(Combinations)" msgstr "" msgid "" @@ -11014,6 +10761,7 @@ 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\\}`" msgstr "" @@ -11062,9 +10810,11 @@ msgstr "" msgid "Unsing 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 "" @@ -11091,9 +10841,11 @@ msgstr "" 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 "" @@ -11116,11 +10868,13 @@ 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\\}`:" 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)}`" @@ -11131,11 +10885,13 @@ 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\\}`:" msgstr "" +#, python-brace-format msgid "" "The best connections from all the stations from the second line are: " ":math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`" @@ -11167,9 +10923,6 @@ msgstr "" msgid "When ``false``: ``cap`` limit per ``Start vid`` will be returned" msgstr "" -msgid "boost: https://www.boost.org/libs/graph/doc/table_of_contents.html" -msgstr "" - #, python-format msgid "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgstr "" @@ -11242,6 +10995,7 @@ 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 " @@ -11272,6 +11026,7 @@ 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." @@ -11300,6 +11055,7 @@ msgid "" "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." @@ -11335,6 +11091,9 @@ msgstr "" msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." msgstr "" +msgid "Standarizing output columns to |result-spantree|" +msgstr "" + msgid "Added ``depth`` and ``start_vid`` result columns." msgstr "" @@ -11344,13 +11103,16 @@ msgstr "" msgid "Added ``depth`` and ``pred`` result columns." msgstr "" -msgid "Signature change pgr_drivingDistance(single vertex)" +msgid "Signature change:" msgstr "" -msgid "New **Official** pgr_drivingDistance(multiple vertices)" +msgid "pgr_drivingDistance(single vertex)" msgstr "" -msgid "Official:: pgr_drivingDistance(single vertex)" +msgid "New official signature:" +msgstr "" + +msgid "pgr_drivingDistance(multiple vertices)" msgstr "" msgid "" @@ -11381,6 +11143,7 @@ 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" @@ -11402,12 +11165,13 @@ msgid "" "signature." msgstr "" +#, python-brace-format msgid "" "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` on an " "undirected graph" msgstr "" -msgid "pgr_edgeColoring - Experimental" +msgid "``pgr_edgeColoring`` - Experimental" msgstr "" msgid "" @@ -11479,6 +11243,16 @@ msgstr "" msgid "Graph coloring of pgRouting :doc:`sampledata`" msgstr "" +msgid "" +"`Boost: Edge Coloring " +"`__" +msgstr "" + +msgid "" +"`Wikipedia: Graph coloring " +"`__" +msgstr "" + msgid "``pgr_edgeDisjointPaths``" msgstr "" @@ -11487,9 +11261,6 @@ msgid "" "groups of vertices." msgstr "" -msgid "New **proposed** function:" -msgstr "" - msgid "pgr_edgeDisjointPaths(Combinations)" msgstr "" @@ -11553,6 +11324,7 @@ 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 " @@ -11571,7 +11343,7 @@ msgid "" "Algorithm." msgstr "" -msgid "``pgr_edmondsKarp`` (`Combinations`_)" +msgid "pgr_edmondsKarp(Combinations)" msgstr "" msgid "Renamed from ``pgr_maxFlowEdmondsKarp``" @@ -11595,14 +11367,16 @@ msgstr "" msgid "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -msgid "https://www.boost.org/libs/graph/doc/edmonds_karp_max_flow.html" +msgid "" +"`Boost: edmonds_karp_max_flow " +"`__" msgstr "" #, python-format msgid "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" msgstr "" -msgid "``pgr_edwardMoore - Experimental``" +msgid "``pgr_edwardMoore`` - Experimental" msgstr "" msgid "" @@ -11610,19 +11384,7 @@ msgid "" "algorithm." msgstr "" -msgid "``pgr_edwardMoore`` (`Combinations`_)" -msgstr "" - -msgid "``pgr_edwardMoore`` (`One to One`_)" -msgstr "" - -msgid "``pgr_edwardMoore`` (`One to Many`_)" -msgstr "" - -msgid "``pgr_edwardMoore`` (`Many to One`_)" -msgstr "" - -msgid "``pgr_edwardMoore`` (`Many to Many`_)" +msgid "pgr_edwardMoore(Combinations)" msgstr "" msgid "" @@ -11683,7 +11445,7 @@ msgstr "" msgid "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" msgstr "" -msgid "pgr_extractVertices -- Proposed" +msgid "``pgr_extractVertices`` -- Proposed" msgstr "" msgid "``pgr_extractVertices`` — Extracts the vertices information" @@ -11785,21 +11547,12 @@ msgid "" "``dryrun := true``." msgstr "" -msgid "``pgr_findCloseEdges``" +msgid "``pgr_findCloseEdges`` - Proposed" msgstr "" msgid "``pgr_findCloseEdges`` - Finds the close edges to a point geometry." msgstr "" -msgid "New **proposed** signatures:" -msgstr "" - -msgid "``pgr_findCloseEdges`` (`One point`_)" -msgstr "" - -msgid "``pgr_findCloseEdges`` (`Many points`_)" -msgstr "" - msgid "" "``pgr_findCloseEdges`` - An utility function that finds the closest edge " "to a point geometry." @@ -11831,6 +11584,9 @@ msgstr "" msgid "One point" msgstr "" +msgid "**options:** [cap, partial, dryrun]``" +msgstr "" + msgid "Default: ``cap => 1``" msgstr "" @@ -12022,6 +11778,7 @@ msgstr "" msgid "``edge_id`` identifier of the edge close to the **original point**" msgstr "" +#, python-brace-format msgid "" "Two edges are withing :math:`0.5` distance units from the **original " "point**: :math:`{5, 8}`" @@ -12075,6 +11832,7 @@ msgstr "" msgid "``edge_id`` identifier of the edge **closest** to the **original point**" msgstr "" +#, python-brace-format msgid "" "From all edges within :math:`0.5` distance units from the **original " "point**: :math:`{5}` is the closest one." @@ -12265,6 +12023,7 @@ msgstr "" msgid "pgr_floydWarshall(`Edges SQL`_, [``directed``])" msgstr "" +#, python-brace-format msgid "For a directed subgraph with edges :math:`\\{1, 2, 3, 4\\}`." msgstr "" @@ -12273,18 +12032,12 @@ msgid "" "`_" msgstr "" -msgid "Queries uses the :doc:`sampledata` network." -msgstr "" - msgid "``pgr_full_version``" msgstr "" msgid "``pgr_full_version`` — Get the details of pgRouting version information." msgstr "" -msgid "New **official** function" -msgstr "" - msgid "Get complete details of pgRouting version information" msgstr "" @@ -12351,17 +12104,14 @@ msgstr "" msgid "Git hash of pgRouting build" msgstr "" -msgid "``pgr_hawickCircuits - Experimental``" +msgid "``pgr_hawickCircuits`` - Experimental" msgstr "" msgid "" -"``pgr_hawickCircuits`` — Returns the list of cirucits using hawick " +"``pgr_hawickCircuits`` — Returns the list of ciruits using hawick " "circuits algorithm." msgstr "" -msgid "``pgr_hawickCircuits``" -msgstr "" - msgid "" "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health " "A. James. This algorithm solves the problem of detecting and enumerating " @@ -12432,6 +12182,7 @@ 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 " @@ -12474,6 +12225,7 @@ 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." @@ -12484,7 +12236,9 @@ msgid "" "in blue represent :math:`K_5` subgraph." msgstr "" -msgid "https://www.boost.org/libs/graph/doc/boyer_myrvold.html" +msgid "" +"`Boost: Boyer Myrvold " +"`__" msgstr "" msgid "``pgr_johnson``" @@ -12540,6 +12294,9 @@ msgid "" "breadth First Search ordering." msgstr "" +msgid "Added ``pred`` result columns." +msgstr "" + msgid "" "Visits and extracts the nodes information in Breath First Search ordering" " of the Minimum Spanning Tree created using Kruskal's algorithm." @@ -12560,6 +12317,7 @@ 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`" @@ -12591,6 +12349,7 @@ msgid "" ":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`" @@ -12615,7 +12374,7 @@ msgstr "" msgid "pgr_kruskalDFS(`Edges SQL`_, **root vids**, [``max_depth``])" msgstr "" -msgid "pgr_lengauerTarjanDominatorTree -Experimental" +msgid "``pgr_lengauerTarjanDominatorTree`` - Experimental" msgstr "" msgid "" @@ -12672,7 +12431,7 @@ msgid "Dominator tree of another component." msgstr "" msgid "" -"`Boost: Lengauer-Tarjan dominator tree algorithm " +"`Boost: Lengauer-Tarjan dominator " "`__" msgstr "" @@ -12681,7 +12440,7 @@ msgid "" "`__" msgstr "" -msgid "pgr_lineGraph - Proposed" +msgid "``pgr_lineGraph`` - Proposed" msgstr "" msgid "" @@ -12689,6 +12448,9 @@ msgid "" "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:" msgstr "" @@ -12725,6 +12487,7 @@ msgstr "" msgid "Returns set of |result-lineg|" msgstr "" +#, python-brace-format msgid "For an undirected graph with edges :math:'{2,4,5,8}'" msgstr "" @@ -12762,6 +12525,7 @@ 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 " @@ -12808,11 +12572,13 @@ msgid "" "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`." msgstr "" +#, python-brace-format msgid "" "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with " "one edge row with :math:`id=304`." @@ -12860,11 +12626,13 @@ 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." 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." @@ -12948,11 +12716,11 @@ 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 "" msgid "" -"The examples of this section are based on the :doc:`sampledata` network. " "The examples include the subgraph including edges 4, 7, 8, and 10 with " "``reverse_cost``." msgstr "" @@ -13171,15 +12939,15 @@ msgstr "" msgid "Returns set of |result-component-make|" msgstr "" -msgid "" -"Query done on :doc:`sampledata` network gives the list of edges that are " -"needed to connect the graph." +msgid "List of edges that are needed to connect the graph." msgstr "" -msgid "https://www.boost.org/libs/graph/doc/make_connected.html" +msgid "" +"`Boost: make connected " +"`__" msgstr "" -msgid "pgr_maxCardinalityMatch" +msgid "``pgr_maxCardinalityMatch``" msgstr "" msgid "" @@ -13187,13 +12955,16 @@ msgid "" "in a graph." msgstr "" +msgid "pgr_maxCardinalityMatch(text) returns only ``edge`` column." +msgstr "" + msgid "Deprecated signature" msgstr "" -msgid "``pgr_maxCardinalityMatch(text,boolean)``" +msgid "pgr_maxCardinalityMatch(text,boolean)" msgstr "" -msgid "``directed => false`` when used." +msgid "directed => ``false`` when used." msgstr "" msgid "Renamed from ``pgr_maximumCardinalityMatching``" @@ -13243,7 +13014,9 @@ msgstr "" msgid "Identifier of the edge in the original query." msgstr "" -msgid "https://www.boost.org/libs/graph/doc/maximum_matching.html" +msgid "" +"`Boost: maximum_matching " +"`__" msgstr "" #, python-format @@ -13261,10 +13034,7 @@ msgid "" "the source(s) to the targets(s) using the Push Relabel algorithm." msgstr "" -msgid "``pgr_maxFlow`` (`Combinations`_)" -msgstr "" - -msgid "New **Proposed** function" +msgid "pgr_maxFlow(Combinations)" msgstr "" msgid "Calculates the maximum flow from the sources to the targets." @@ -13302,7 +13072,9 @@ msgstr "" msgid "Maximum flow possible from the source(s) to the target(s)" msgstr "" -msgid "https://www.boost.org/libs/graph/doc/push_relabel_max_flow.html" +msgid "" +"`Boost: push relabel max flow " +"`__" msgstr "" #, python-format @@ -13317,7 +13089,10 @@ msgid "" "cost of the maximum flow on a graph" msgstr "" -msgid "``pgr_maxFlowMinCost`` (`Combinations`_)" +msgid "pgr_maxFlowMinCost(Combinations)" +msgstr "" + +msgid "|boost| graph inside." msgstr "" msgid "**TODO** check which statement is true:" @@ -13361,9 +13136,6 @@ msgstr "" msgid "Returns set of |result-flow-mincost|" msgstr "" -msgid "https://www.boost.org/libs/graph/doc/successive_shortest_path_nonnegative_weights.html" -msgstr "" - msgid "``pgr_maxFlowMinCost_Cost`` - Experimental" msgstr "" @@ -13372,7 +13144,7 @@ msgid "" "maximum flow on a graph" msgstr "" -msgid "``pgr_maxFlowMinCost_Cost`` (`Combinations`_)" +msgid "pgr_maxFlowMinCost_Cost(Combinations)" msgstr "" msgid "**The cost value of all input edges must be nonnegative.**" @@ -13405,7 +13177,7 @@ msgstr "" msgid "Minimum Cost Maximum Flow possible from the source(s) to the target(s)" msgstr "" -msgid "pgr_nodeNetwork" +msgid "``pgr_nodeNetwork``" msgstr "" msgid "``pgr_nodeNetwork`` - Nodes an network edge table." @@ -13943,7 +13715,7 @@ msgid "" "Algorithm." msgstr "" -msgid "``pgr_pushRelabel`` (`Combinations`_)" +msgid "pgr_pushRelabel(Combinations)" msgstr "" msgid "Renamed from ``pgr_maxFlowPushRelabel``" @@ -13964,7 +13736,7 @@ msgstr "" msgid "pgr_pushRelabel(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -msgid "pgr_sequentialVertexColoring - Proposed" +msgid "``pgr_sequentialVertexColoring`` - Proposed" msgstr "" msgid "" @@ -13972,9 +13744,6 @@ msgid "" "undirected graph, using greedy approach." msgstr "" -msgid "Promoted to **proposed** signature" -msgstr "" - msgid "" "Sequential vertex coloring algorithm is a graph coloring algorithm in " "which color identifiers are assigned to the vertices of a graph in a " @@ -14019,7 +13788,12 @@ msgstr "" msgid "pgr_sequentialVertexColoring(`Edges SQL`_)" msgstr "" -msgid "pgr_stoerWagner - Experimental" +msgid "" +"`Boost: Sequential Vertex Coloring " +"`__" +msgstr "" + +msgid "``pgr_stoerWagner`` - Experimental" msgstr "" msgid "``pgr_stoerWagner`` — The min-cut of graph using stoerWagner algorithm." @@ -14106,6 +13880,11 @@ msgstr "" msgid "Using :doc:`pgr_connectedComponents`" msgstr "" +msgid "" +"`Boost: Stoer Wagner min cut " +"`__" +msgstr "" + #, python-format msgid "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" msgstr "" @@ -14136,7 +13915,7 @@ msgid "The strong components of the graph" msgstr "" msgid "" -"Boost: `Strong components " +"`Boost: Strong components " "`__" msgstr "" @@ -14200,6 +13979,11 @@ msgstr "" msgid "Graph is not a DAG" msgstr "" +msgid "" +"`Boost: topological sort " +"`__" +msgstr "" + msgid "``pgr_transitiveClosure`` - Experimental" msgstr "" @@ -14256,57 +14040,57 @@ msgstr "" msgid "Identifiers of the vertices that are reachable from vertex v." msgstr "" -msgid "https://en.wikipedia.org/wiki/Transitive_closure" +msgid "" +"`Boost: transitive closure " +"`__" msgstr "" -msgid "pgr_trsp - Proposed" +msgid "https://en.wikipedia.org/wiki/Transitive_closure" msgstr "" -msgid "``pgr_trsp`` - routing vertices with restrictions." +msgid "``pgr_trsp`` - Proposed" msgstr "" -msgid "New proposed signatures" +msgid "``pgr_trsp`` - routing vertices with restrictions." msgstr "" -msgid "``pgr_trsp`` (`One to One`_)" +msgid "pgr_trsp(One to One)" msgstr "" -msgid "``pgr_trsp`` (`One to Many`_)" +msgid "pgr_trsp(One to Many)" msgstr "" -msgid "``pgr_trsp`` (`Many to One`_)" +msgid "pgr_trsp(Many to One)" msgstr "" -msgid "``pgr_trsp`` (`Many to Many`_)" +msgid "pgr_trsp(Many to Many)" msgstr "" -msgid "``pgr_trsp`` (`Combinations`_)" +msgid "pgr_trsp(Combinations)" msgstr "" msgid "Deprecated signatures" msgstr "" -msgid "``pgr_trsp(text,integer,integer,boolean,boolean,text)``" +msgid "pgr_trsp(text,integer,integer,boolean,boolean,text)" msgstr "" -msgid "``pgr_trsp(text,integer,float,integer,float,boolean,boolean,text)``" +msgid "pgr_trsp(text,integer,float,integer,float,boolean,boolean,text)" msgstr "" -msgid "``pgr_trspViaVertices(text,anyarray,boolean,boolean,text)``" +msgid "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" msgstr "" -msgid "" -"``pgr_trspviaedges(text,integer[],double " -"precision[],boolean,boolean,text)``" +msgid "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" msgstr "" msgid "New prototypes" msgstr "" -msgid "``pgr_trspViaVertices``" +msgid "pgr_trspViaVertices" msgstr "" -msgid "``pgr_trspViaEdges``" +msgid "pgr_trspViaEdges" msgstr "" msgid "" @@ -14360,14 +14144,17 @@ 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." msgstr "" +#, python-brace-format 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." @@ -14389,12 +14176,7 @@ msgid "" "restrictions." msgstr "" -msgid "New proposed function:" -msgstr "" - -msgid "``pgr_trspVia`` (`One Via`_)" -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 " @@ -14424,6 +14206,7 @@ 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." @@ -14483,9 +14266,7 @@ msgid "" "and/or points with restrictions." msgstr "" -msgid "``pgr_trspVia_withPoints`` (`One Via`_)" -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 " @@ -14524,6 +14305,7 @@ 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." @@ -14599,6 +14381,7 @@ 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." @@ -14647,30 +14430,12 @@ msgid "" "same edge." msgstr "" -msgid "pgr_trsp_withPoints - Proposed" +msgid "``pgr_trsp_withPoints`` - Proposed" msgstr "" msgid "``pgr_trsp_withPoints`` Routing Vertex/Point with restrictions." msgstr "" -msgid "New proposed signatures:" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (`One to One`_)" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (`One to Many`_)" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (`Many to One`_)" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (`Many to Many`_)" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (`Combinations`_)" -msgstr "" - msgid "" "Modify the graph to include points defined by points_sql. Using Dijkstra " "algorithm, find the shortest path" @@ -14778,7 +14543,7 @@ msgid "" ":math:`1` on an undirected graph, with details." msgstr "" -msgid "pgr_turnRestrictedPath - Experimental" +msgid "``pgr_turnRestrictedPath`` - Experimental" msgstr "" msgid "" @@ -14786,9 +14551,6 @@ msgid "" "with restrictions" msgstr "" -msgid "New experimental function" -msgstr "" - msgid "" "Using Yen's algorithm to obtain K shortest paths and analyze the paths to" " select the paths that do not use the restrictions" @@ -14859,7 +14621,7 @@ msgstr "" msgid "pgRouting Version for this documentation" msgstr "" -msgid "pgr_vrpOneDepot - Experimental" +msgid "``pgr_vrpOneDepot`` - Experimental" msgstr "" msgid "**No documentation available**" @@ -14997,6 +14759,7 @@ 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, " @@ -15145,6 +14908,7 @@ 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\\}`" @@ -15169,6 +14933,7 @@ msgid "" "[**options**])" msgstr "" +#, python-brace-format msgid "" "Cost matrix for points :math:`\\{1, 6\\}` and vertices :math:`\\{10, " "11\\}` on an **undirected** graph" @@ -15201,7 +14966,10 @@ msgid "" "to unnamed compulsory **driving side**." msgstr "" -msgid "``pgr_withPointsDD`` (`Single vertex`)" +msgid "pgr_withPointsDD(Single vertex)" +msgstr "" + +msgid "pgr_withPointsDD(Multiple vertices)" msgstr "" msgid "Added ``depth``, ``pred`` and ``start_vid`` column." @@ -15219,12 +14987,12 @@ msgid "" msgstr "" msgid "" -"``pgr_withpointsdd(text,text,bigint,double " +"pgr_withpointsdd(text,text,bigint,double " "precision,boolean,character,boolean)``" msgstr "" msgid "" -"``pgr_withpointsdd(text,text,anyarray,double " +"pgr_withpointsdd(text,text,anyarray,double " "precision,boolean,character,boolean,boolean)``" msgstr "" @@ -15332,7 +15100,7 @@ msgstr "" msgid ":doc:`pgr_alphaShape`" msgstr "" -msgid "pgr_withPointsKSP - Proposed" +msgid "``pgr_withPointsKSP`` - Proposed" msgstr "" msgid "" @@ -15343,25 +15111,22 @@ msgstr "" msgid "Standarizing output columns to |nksp-result|" msgstr "" -msgid "``pgr_withPointsKSP`` (One to One)" +msgid "pgr_withPointsKSP(One to One)" msgstr "" -msgid "New overload functions" +msgid "pgr_withPointsKSP(One to Many)" msgstr "" -msgid "``pgr_withPointsKSP`` (One to Many)" +msgid "pgr_withPointsKSP(Many to One)" msgstr "" -msgid "``pgr_withPointsKSP`` (Many to One)" +msgid "pgr_withPointsKSP(Many to Many)" msgstr "" -msgid "``pgr_withPointsKSP`` (Many to Many)" +msgid "pgr_withPointsKSP(Combinations)" 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 "" @@ -15484,9 +15249,7 @@ msgid "" " points." msgstr "" -msgid "New **proposed** function ``pgr_withPointsVia`` (`One Via`_)" -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 " @@ -15500,6 +15263,7 @@ 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." @@ -15508,6 +15272,7 @@ 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." @@ -15590,15 +15355,6 @@ msgid "" "Graph." msgstr "" -msgid ":doc:`pgr_withPointsVia`" -msgstr "" - -msgid ":doc:`pgr_trspVia`" -msgstr "" - -msgid ":doc:`pgr_trspVia_withPoints`" -msgstr "" - msgid ":doc:`withPoints-family` - Functions based on Dijkstra algorithm." msgstr "" @@ -15631,9 +15387,158 @@ msgstr "" msgid "Minors 3.x" msgstr "" +msgid "pgRouting 3.8" +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 " +"`__" +msgstr "" + +msgid "" +"`#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 " +"`__" +msgstr "" + +msgid "Build" +msgstr "" + +msgid "" +"`#2713 `__ cmake " +"missing some policies and min version" +msgstr "" + +msgid "Using OLD policies: CMP0148, CMP0144, CMP0167" +msgstr "" + +msgid "Minimum cmake version 3.12" +msgstr "" + +msgid "" +"`#2707 `__ Build " +"failure in pgRouting 3.7.1 on Alpine" +msgstr "" + +msgid "" +"`#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 " +"`__" +msgstr "" + +msgid "" +"`#2680 `__ fails to " +"compile under mingw64 gcc 13.2" +msgstr "" + +msgid "" +"`#2689 `__ When point " +"is a vertex, the withPoints family do not return results." +msgstr "" + +msgid "C/C++ code enhancemet" +msgstr "" + +msgid "TRSP family" +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 " +"`__" +msgstr "" + +msgid "" +"`#2656 `__ Stop support" +" of PostgreSQL12 on pgrouting v3.7" +msgstr "" + +msgid "Stopping support of PostgreSQL 12" +msgstr "" + +msgid "CI does not test for PostgreSQL 12" +msgstr "" + +msgid "New experimental functions" +msgstr "" + +msgid "Metrics" +msgstr "" + +msgid "pgr_betweennessCentrality" +msgstr "" + +msgid "Official functions changes" +msgstr "" + +msgid "" +"`#2605 `__ Standarize " +"spanning tree functions output" +msgstr "" + +msgid "Functions:" +msgstr "" + +msgid "Experimental promoted to proposed." +msgstr "" + +msgid "" +"`#2635 `__ " +"pgr_LineGraph ignores directed flag and use negative values for " +"identifiers." +msgstr "" + +msgid "``pgr_lineGraph``" +msgstr "" + +msgid "Code enhancement" +msgstr "" + +msgid "" +"`#2599 `__ Driving " +"distance cleanup" +msgstr "" + +msgid "" +"`#2607 `__ Read " +"postgresql data on C++" +msgstr "" + +msgid "" +"`#2614 `__ Clang tidy " +"does not work" +msgstr "" + msgid "pgRouting 3.6" msgstr "" @@ -15647,9 +15552,6 @@ msgid "" "`__" msgstr "" -msgid "Build" -msgstr "" - msgid "Explicit minimum requirements:" msgstr "" @@ -15758,31 +15660,11 @@ msgid "" "output pgr_aStar" msgstr "" -msgid "``pgr_aStar`` (`One to One`) added ``start_vid`` and ``end_vid`` columns." -msgstr "" - -msgid "``pgr_aStar`` (`One to Many`) added ``end_vid`` column." -msgstr "" - -msgid "``pgr_aStar`` (`Many to One`) added ``start_vid`` column." -msgstr "" - msgid "" "`#2523 `__ Standarize " "output pgr_bdAstar" msgstr "" -msgid "" -"``pgr_bdAstar`` (`One to One`) added ``start_vid`` and ``end_vid`` " -"columns." -msgstr "" - -msgid "``pgr_bdAstar`` (`One to Many`) added ``end_vid`` column." -msgstr "" - -msgid "``pgr_bdAstar`` (`Many to One`) added ``start_vid`` column." -msgstr "" - msgid "" "`#2547 `__ Standarize " "output and modifying signature pgr_KSP" @@ -15790,7 +15672,7 @@ msgstr "" msgid "" "`#2548 `__ Standarize " -"output pgr_drivingdistance" +"output pgr_drivingDistance" msgstr "" msgid "Proposed functions changes" @@ -15940,17 +15822,6 @@ msgstr "" msgid "Dijkstra" msgstr "" -msgid "" -"``pgr_dijkstra`` (`One to One`) added ``start_vid`` and ``end_vid`` " -"columns." -msgstr "" - -msgid "``pgr_dijkstra`` (`One to Many`) added ``end_vid`` column." -msgstr "" - -msgid "``pgr_dijkstra`` (`Many to One`) added ``start_vid`` column." -msgstr "" - msgid "pgRouting 3.4" msgstr "" @@ -16010,13 +15881,13 @@ msgid "" "doesn't give all correct shortest path" msgstr "" -msgid "New proposed functions" +msgid "New proposed functions." msgstr "" msgid "With points" msgstr "" -msgid "``pgr_withPointsVia`` (One Via)" +msgid "pgr_withPointsVia(One Via)" msgstr "" msgid "Turn Restrictions" @@ -16025,88 +15896,73 @@ msgstr "" msgid "Via with turn restrictions" msgstr "" -msgid "``pgr_trspVia`` (One Via)" -msgstr "" - -msgid "``pgr_trspVia_withPoints`` (One Via)" -msgstr "" - -msgid "``pgr_trsp``" -msgstr "" - -msgid "``pgr_trsp`` (One to One)" -msgstr "" - -msgid "``pgr_trsp`` (One to Many)" -msgstr "" - -msgid "``pgr_trsp`` (Many to One)" +msgid "pgr_trspVia(One Via)" msgstr "" -msgid "``pgr_trsp`` (Many to Many)" +msgid "pgr_trspVia_withPoints(One Via)" msgstr "" -msgid "``pgr_trsp`` (Combinations)" +msgid "pgr_trsp" msgstr "" msgid "``pgr_trsp_withPoints``" msgstr "" -msgid "``pgr_trsp_withPoints`` (One to One)" +msgid "pgr_trsp_withPoints(One to One)" msgstr "" -msgid "``pgr_trsp_withPoints`` (One to Many)" +msgid "pgr_trsp_withPoints(One to Many)" msgstr "" -msgid "``pgr_trsp_withPoints`` (Many to One)" +msgid "pgr_trsp_withPoints(Many to One)" msgstr "" -msgid "``pgr_trsp_withPoints`` (Many to Many)" +msgid "pgr_trsp_withPoints(Many to Many)" msgstr "" -msgid "``pgr_trsp_withPoints`` (Combinations)" +msgid "pgr_trsp_withPoints(Combinations)" msgstr "" msgid "Topology" msgstr "" -msgid "``pgr_degree``" -msgstr "" - msgid "Utilities" msgstr "" -msgid "``pgr_findCloseEdges`` (One point)" +msgid "pgr_findCloseEdges(One point)" msgstr "" -msgid "``pgr_findCloseEdges`` (Many points)" +msgid "pgr_findCloseEdges(Many points)" msgstr "" msgid "Ordering" msgstr "" -msgid "``pgr_cuthillMckeeOrdering``" +msgid "pgr_cuthillMckeeOrdering" msgstr "" msgid "Unclassified" msgstr "" +msgid "pgr_hawickCircuits" +msgstr "" + msgid "Flow functions" msgstr "" -msgid "``pgr_maxCardinalityMatch(text)``" +msgid "pgr_maxCardinalityMatch(text)" msgstr "" -msgid "Deprecating ``pgr_maxCardinalityMatch(text,boolean)``" +msgid "Deprecating: pgr_maxCardinalityMatch(text,boolean)" msgstr "" msgid "Deprecated Functions" msgstr "" -msgid "``pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)``" +msgid "pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)" msgstr "" -msgid "``pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text)``" +msgid "pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text)" msgstr "" msgid "pgRouting 3.3" @@ -16381,12 +16237,6 @@ msgstr "" msgid "Removing support for Boost v1.53, v1.54 & v1.55" msgstr "" -msgid "pgr_bellmanFord(Combinations)" -msgstr "" - -msgid "pgr_binaryBreadthFirstSearch(Combinations)" -msgstr "" - msgid "pgr_bipartite" msgstr "" @@ -16396,9 +16246,6 @@ msgstr "" msgid "Dijkstra Near" msgstr "" -msgid "pgr_edwardMoore(Combinations)" -msgstr "" - msgid "pgr_isPlanar" msgstr "" @@ -16408,51 +16255,15 @@ msgstr "" msgid "pgr_makeConnected" msgstr "" -msgid "pgr_maxFlowMinCost(Combinations)" -msgstr "" - -msgid "pgr_maxFlowMinCost_Cost(Combinations)" -msgstr "" - msgid "Astar" msgstr "" -msgid "pgr_aStar(Combinations)" -msgstr "" - -msgid "pgr_aStarCost(Combinations)" -msgstr "" - msgid "Bidirectional Astar" msgstr "" -msgid "pgr_bdAstar(Combinations)" -msgstr "" - -msgid "pgr_bdAstarCost(Combinations)" -msgstr "" - msgid "Bidirectional Dijkstra" msgstr "" -msgid "pgr_bdDijkstra(Combinations)" -msgstr "" - -msgid "pgr_bdDijkstraCost(Combinations)" -msgstr "" - -msgid "pgr_boykovKolmogorov(Combinations)" -msgstr "" - -msgid "pgr_edmondsKarp(Combinations)" -msgstr "" - -msgid "pgr_maxFlow(Combinations)" -msgstr "" - -msgid "pgr_pushRelabel(Combinations)" -msgstr "" - msgid "pgRouting 3.1" msgstr "" @@ -16710,7 +16521,7 @@ msgid "" "of information" msgstr "" -msgid "New functions" +msgid "New Functions" msgstr "" msgid "Kruskal family" @@ -16749,148 +16560,94 @@ msgstr "" msgid "aStar Family" msgstr "" -msgid "pgr_aStar(one to many)" -msgstr "" - -msgid "pgr_aStar(many to one)" -msgstr "" - -msgid "pgr_aStar(many to many)" -msgstr "" - -msgid "pgr_aStarCost(one to one)" -msgstr "" - -msgid "pgr_aStarCost(one to many)" -msgstr "" - -msgid "pgr_aStarCost(many to one)" +msgid "pgr_aStarCost(One to One)" msgstr "" -msgid "pgr_aStarCost(many to many)" +msgid "pgr_aStarCost(One to Many)" msgstr "" -msgid "pgr_aStarCostMatrix(one to one)" +msgid "pgr_aStarCost(Many to One)" msgstr "" -msgid "pgr_aStarCostMatrix(one to many)" +msgid "pgr_aStarCost(Many to Many)" msgstr "" -msgid "pgr_aStarCostMatrix(many to one)" -msgstr "" - -msgid "pgr_aStarCostMatrix(many to many)" +msgid "pgr_aStarCostMatrix" msgstr "" msgid "bdAstar Family" msgstr "" -msgid "pgr_bdAstar(one to many)" -msgstr "" - -msgid "pgr_bdAstar(many to one)" -msgstr "" - -msgid "pgr_bdAstar(many to many)" -msgstr "" - -msgid "pgr_bdAstarCost(one to one)" +msgid "pgr_bdAstarCost(One to One)" msgstr "" -msgid "pgr_bdAstarCost(one to many)" +msgid "pgr_bdAstarCost(One to Many)" msgstr "" -msgid "pgr_bdAstarCost(many to one)" +msgid "pgr_bdAstarCost(Many to One)" msgstr "" -msgid "pgr_bdAstarCost(many to many)" +msgid "pgr_bdAstarCost(Many to Many)" msgstr "" -msgid "pgr_bdAstarCostMatrix(one to one)" -msgstr "" - -msgid "pgr_bdAstarCostMatrix(one to many)" -msgstr "" - -msgid "pgr_bdAstarCostMatrix(many to one)" -msgstr "" - -msgid "pgr_bdAstarCostMatrix(many to many)" +msgid "pgr_bdAstarCostMatrix" msgstr "" msgid "bdDijkstra Family" msgstr "" -msgid "pgr_bdDijkstra(one to many)" -msgstr "" - -msgid "pgr_bdDijkstra(many to one)" -msgstr "" - -msgid "pgr_bdDijkstra(many to many)" -msgstr "" - -msgid "pgr_bdDijkstraCost(one to one)" -msgstr "" - -msgid "pgr_bdDijkstraCost(one to many)" -msgstr "" - -msgid "pgr_bdDijkstraCost(many to one)" -msgstr "" - -msgid "pgr_bdDijkstraCost(many to many)" +msgid "pgr_bdDijkstraCost(One to One)" msgstr "" -msgid "pgr_bdDijkstraCostMatrix(one to one)" +msgid "pgr_bdDijkstraCost(One to Many)" msgstr "" -msgid "pgr_bdDijkstraCostMatrix(one to many)" +msgid "pgr_bdDijkstraCost(Many to One)" msgstr "" -msgid "pgr_bdDijkstraCostMatrix(many to one)" +msgid "pgr_bdDijkstraCost(Many to Many)" msgstr "" -msgid "pgr_bdDijkstraCostMatrix(many to many)" +msgid "pgr_bdDijkstraCostMatrix" msgstr "" msgid "Flow Family" msgstr "" -msgid "pgr_pushRelabel(one to one)" +msgid "pgr_pushRelabel(One to One)" msgstr "" -msgid "pgr_pushRelabel(one to many)" +msgid "pgr_pushRelabel(One to Many)" msgstr "" -msgid "pgr_pushRelabel(many to one)" +msgid "pgr_pushRelabel(Many to One)" msgstr "" -msgid "pgr_pushRelabel(many to many)" +msgid "pgr_pushRelabel(Many to Many)" msgstr "" -msgid "pgr_edmondsKarp(one to one)" +msgid "pgr_edmondsKarp(One to One)" msgstr "" -msgid "pgr_edmondsKarp(one to many)" +msgid "pgr_edmondsKarp(One to Many)" msgstr "" -msgid "pgr_edmondsKarp(many to one)" +msgid "pgr_edmondsKarp(Many to One)" msgstr "" -msgid "pgr_edmondsKarp(many to many)" +msgid "pgr_edmondsKarp(Many to Many)" msgstr "" -msgid "pgr_boykovKolmogorov (one to one)" +msgid "pgr_boykovKolmogorov (One to One)" msgstr "" -msgid "pgr_boykovKolmogorov (one to many)" +msgid "pgr_boykovKolmogorov (One to Many)" msgstr "" -msgid "pgr_boykovKolmogorov (many to one)" +msgid "pgr_boykovKolmogorov (Many to One)" msgstr "" -msgid "pgr_boykovKolmogorov (many to many)" +msgid "pgr_boykovKolmogorov (Many to Many)" msgstr "" msgid "pgr_maxCardinalityMatching" @@ -16899,21 +16656,24 @@ msgstr "" msgid "pgr_maxFlow" msgstr "" -msgid "pgr_edgeDisjointPaths(one to one)" +msgid "pgr_edgeDisjointPaths(One to One)" msgstr "" -msgid "pgr_edgeDisjointPaths(one to many)" +msgid "pgr_edgeDisjointPaths(One to Many)" msgstr "" -msgid "pgr_edgeDisjointPaths(many to one)" +msgid "pgr_edgeDisjointPaths(Many to One)" msgstr "" -msgid "pgr_edgeDisjointPaths(many to many)" +msgid "pgr_edgeDisjointPaths(Many to Many)" msgstr "" msgid "Components family" msgstr "" +msgid "pgr_connectedComponents" +msgstr "" + msgid "pgr_strongComponents" msgstr "" @@ -17106,7 +16866,7 @@ msgstr "" msgid "pgr_johnson" msgstr "" -msgid "pgr_astar" +msgid "pgr_aStar" msgstr "" msgid "pgr_bdAstar" @@ -17127,6 +16887,9 @@ msgstr "" msgid "pgr_drivingDistance" msgstr "" +msgid "pgr_KSP" +msgstr "" + msgid "pgr_dijkstraVia (proposed)" msgstr "" @@ -17338,22 +17101,13 @@ msgstr "" msgid "Parameter names changed" msgstr "" -msgid "The many version results are the union of the one to one version" +msgid "The many version results are the union of the One to One version" msgstr "" msgid "New Signatures" msgstr "" -msgid "pgr_bdAstar(one to one)" -msgstr "" - -msgid "New Proposed functions" -msgstr "" - -msgid "pgr_bdAstarCostMatrix" -msgstr "" - -msgid "pgr_bdDijkstraCostMatrix" +msgid "pgr_bdAstar(One to One)" msgstr "" msgid "pgr_lineGraph" @@ -17439,31 +17193,7 @@ msgstr "" msgid "pgr_bdDijkstra" msgstr "" -msgid "New Proposed Signatures" -msgstr "" - -msgid "pgr_astar(one to many)" -msgstr "" - -msgid "pgr_astar(many to one)" -msgstr "" - -msgid "pgr_astar(many to many)" -msgstr "" - -msgid "pgr_astarCost(one to one)" -msgstr "" - -msgid "pgr_astarCost(one to many)" -msgstr "" - -msgid "pgr_astarCost(many to one)" -msgstr "" - -msgid "pgr_astarCost(many to many)" -msgstr "" - -msgid "pgr_astarCostMatrix" +msgid "Deprecated signatures." msgstr "" msgid "pgr_bddijkstra - use pgr_bdDijkstra instead" @@ -17538,52 +17268,46 @@ msgstr "" msgid "pgr_TSP" msgstr "" -msgid "pgr_aStar" -msgstr "" - -msgid "New Functions" -msgstr "" - msgid "pgr_eucledianTSP" msgstr "" msgid "pgr_withPointsCostMatrix" msgstr "" -msgid "pgr_maxFlowPushRelabel(one to one)" +msgid "pgr_maxFlowPushRelabel(One to One)" msgstr "" -msgid "pgr_maxFlowPushRelabel(one to many)" +msgid "pgr_maxFlowPushRelabel(One to Many)" msgstr "" -msgid "pgr_maxFlowPushRelabel(many to one)" +msgid "pgr_maxFlowPushRelabel(Many to One)" msgstr "" -msgid "pgr_maxFlowPushRelabel(many to many)" +msgid "pgr_maxFlowPushRelabel(Many to Many)" msgstr "" -msgid "pgr_maxFlowEdmondsKarp(one to one)" +msgid "pgr_maxFlowEdmondsKarp(One to One)" msgstr "" -msgid "pgr_maxFlowEdmondsKarp(one to many)" +msgid "pgr_maxFlowEdmondsKarp(One to Many)" msgstr "" -msgid "pgr_maxFlowEdmondsKarp(many to one)" +msgid "pgr_maxFlowEdmondsKarp(Many to One)" msgstr "" -msgid "pgr_maxFlowEdmondsKarp(many to many)" +msgid "pgr_maxFlowEdmondsKarp(Many to Many)" msgstr "" -msgid "pgr_maxFlowBoykovKolmogorov (one to one)" +msgid "pgr_maxFlowBoykovKolmogorov (One to One)" msgstr "" -msgid "pgr_maxFlowBoykovKolmogorov (one to many)" +msgid "pgr_maxFlowBoykovKolmogorov (One to Many)" msgstr "" -msgid "pgr_maxFlowBoykovKolmogorov (many to one)" +msgid "pgr_maxFlowBoykovKolmogorov (Many to One)" msgstr "" -msgid "pgr_maxFlowBoykovKolmogorov (many to many)" +msgid "pgr_maxFlowBoykovKolmogorov (Many to Many)" msgstr "" msgid "pgr_maximumCardinalityMatching" @@ -17595,7 +17319,7 @@ msgstr "" msgid "pgr_tsp - use pgr_TSP or pgr_eucledianTSP instead" msgstr "" -msgid "pgr_astar - use pgr_aStar instead" +msgid "pgr_aStar - use pgr_aStar instead" msgstr "" msgid "pgr_flip_edges" @@ -17687,6 +17411,9 @@ msgstr "" msgid "Improvements" msgstr "" +msgid "pgr_nodeNetwork" +msgstr "" + msgid "Adding a row_where and outall optional parameters" msgstr "" @@ -17699,43 +17426,43 @@ msgstr "" msgid "pgr_Johnson" msgstr "" -msgid "pgr_dijkstraCost(one to one)" +msgid "pgr_dijkstraCost(One to One)" msgstr "" -msgid "pgr_dijkstraCost(one to many)" +msgid "pgr_dijkstraCost(One to Many)" msgstr "" -msgid "pgr_dijkstraCost(many to one)" +msgid "pgr_dijkstraCost(Many to One)" msgstr "" -msgid "pgr_dijkstraCost(many to many)" +msgid "pgr_dijkstraCost(Many to Many)" msgstr "" msgid "Proposed Functionality" msgstr "" -msgid "pgr_withPoints(one to one)" +msgid "pgr_withPoints(One to One)" msgstr "" -msgid "pgr_withPoints(one to many)" +msgid "pgr_withPoints(One to Many)" msgstr "" -msgid "pgr_withPoints(many to one)" +msgid "pgr_withPoints(Many to One)" msgstr "" -msgid "pgr_withPoints(many to many)" +msgid "pgr_withPoints(Many to Many)" msgstr "" -msgid "pgr_withPointsCost(one to one)" +msgid "pgr_withPointsCost(One to One)" msgstr "" -msgid "pgr_withPointsCost(one to many)" +msgid "pgr_withPointsCost(One to Many)" msgstr "" -msgid "pgr_withPointsCost(many to one)" +msgid "pgr_withPointsCost(Many to One)" msgstr "" -msgid "pgr_withPointsCost(many to many)" +msgid "pgr_withPointsCost(Many to Many)" msgstr "" msgid "pgr_withPointsDD(single vertex)" @@ -17781,25 +17508,10 @@ msgid "" " on Github." msgstr "" -msgid "pgr_dijkstra(one to many)" -msgstr "" - -msgid "pgr_dijkstra(many to one)" -msgstr "" - -msgid "pgr_dijkstra(many to many)" -msgstr "" - -msgid "pgr_drivingDistance(multiple vertices)" -msgstr "" - msgid "Refactored" msgstr "" -msgid "pgr_dijkstra(one to one)" -msgstr "" - -msgid "pgr_drivingDistance(single vertex)" +msgid "pgr_dijkstra(One to One)" msgstr "" msgid "" @@ -18516,7 +18228,7 @@ msgid "" msgstr "" msgid "" -"pgRouting suplies some functions to create a routing topology and to " +"pgRouting supplies some functions to create a routing topology and to " "analyze the topology." msgstr "" @@ -18546,6 +18258,7 @@ 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" diff --git a/locale/es/LC_MESSAGES/index.po b/locale/es/LC_MESSAGES/index.po index eab7937eab8..1f7a4e7c0e6 100644 --- a/locale/es/LC_MESSAGES/index.po +++ b/locale/es/LC_MESSAGES/index.po @@ -1,11 +1,11 @@ # SOME DESCRIPTIVE TITLE. -# Copyright (C) pgRouting Contributors - Version v3.7.2 +# Copyright (C) pgRouting Contributors - Version v3.8 # This file is distributed under the same license as the pgRouting package. # FIRST AUTHOR , 2022. # msgid "" msgstr "" -"Project-Id-Version: pgRouting v3.7.2\n" +"Project-Id-Version: pgRouting v3.8\n" "Report-Msgid-Bugs-To: \n" "POT-Creation-Date: 2022-06-25 12:55-0500\n" "PO-Revision-Date: 2022-09-29 16:37+0000\n" diff --git a/locale/es/LC_MESSAGES/pgrouting_doc_strings.po b/locale/es/LC_MESSAGES/pgrouting_doc_strings.po index 89e257a6ce1..a518ce74faf 100644 --- a/locale/es/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/es/LC_MESSAGES/pgrouting_doc_strings.po @@ -1,5 +1,5 @@ # SOME DESCRIPTIVE TITLE. -# Copyright (C) pgRouting Contributors - Version v3.7.2 +# Copyright (C) pgRouting Contributors - Version v3.8 # This file is distributed under the same license as the pgRouting package. # FIRST AUTHOR , 2022. # Pedro Jose Rios Vergara , 2022. @@ -8,7 +8,7 @@ # DeepL , 2024. msgid "" msgstr "" -"Project-Id-Version: pgRouting v3.7.2\n" +"Project-Id-Version: pgRouting v3.8\n" "Report-Msgid-Bugs-To: \n" "POT-Creation-Date: 2024-10-17 00:50+0000\n" "PO-Revision-Date: 2024-10-10 19:43+0000\n" diff --git a/locale/ja/LC_MESSAGES/index.po b/locale/ja/LC_MESSAGES/index.po index 94d698138cf..bcd74129d65 100644 --- a/locale/ja/LC_MESSAGES/index.po +++ b/locale/ja/LC_MESSAGES/index.po @@ -1,11 +1,11 @@ # SOME DESCRIPTIVE TITLE. -# Copyright (C) pgRouting Contributors - Version v3.7.2 +# Copyright (C) pgRouting Contributors - Version v3.8 # This file is distributed under the same license as the pgRouting package. # FIRST AUTHOR , 2022. # msgid "" msgstr "" -"Project-Id-Version: pgRouting v3.7.2\n" +"Project-Id-Version: pgRouting v3.8\n" "Report-Msgid-Bugs-To: \n" "POT-Creation-Date: 2022-06-25 12:55-0500\n" "PO-Revision-Date: 2024-05-01 03:45+0000\n" diff --git a/locale/ja/LC_MESSAGES/pgrouting_doc_strings.po b/locale/ja/LC_MESSAGES/pgrouting_doc_strings.po index 03a8e94e1d4..b066408dc9a 100644 --- a/locale/ja/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/ja/LC_MESSAGES/pgrouting_doc_strings.po @@ -1,5 +1,5 @@ # SOME DESCRIPTIVE TITLE. -# Copyright (C) pgRouting Contributors - Version v3.7.2 +# Copyright (C) pgRouting Contributors - Version v3.8 # This file is distributed under the same license as the pgRouting package. # FIRST AUTHOR , 2022. # Translators: @@ -18,7 +18,7 @@ # Celia Virginia Vergara Castillo , 2024. msgid "" msgstr "" -"Project-Id-Version: PROJECT VERSION 3.7.1\n" +"Project-Id-Version: pgRouting v3.8\n" "Report-Msgid-Bugs-To: \n" "POT-Creation-Date: 2024-10-17 00:50+0000\n" "PO-Revision-Date: 2024-09-23 01:16+0000\n" diff --git a/locale/ko/LC_MESSAGES/index.po b/locale/ko/LC_MESSAGES/index.po index cbb8231af2b..9b4ec98d7ae 100644 --- a/locale/ko/LC_MESSAGES/index.po +++ b/locale/ko/LC_MESSAGES/index.po @@ -1,11 +1,11 @@ # SOME DESCRIPTIVE TITLE. -# Copyright (C) pgRouting Contributors - Version v3.7.2 +# Copyright (C) pgRouting Contributors - Version v3.8 # This file is distributed under the same license as the pgRouting package. # FIRST AUTHOR , YEAR. # msgid "" msgstr "" -"Project-Id-Version: pgRouting v3.7.2\n" +"Project-Id-Version: pgRouting v3.8\n" "Report-Msgid-Bugs-To: \n" "POT-Creation-Date: 2022-06-25 12:55-0500\n" "PO-Revision-Date: 2022-11-15 15:30+0000\n" diff --git a/locale/ko/LC_MESSAGES/pgrouting_doc_strings.po b/locale/ko/LC_MESSAGES/pgrouting_doc_strings.po index 288efe44eba..ceb795f6991 100644 --- a/locale/ko/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/ko/LC_MESSAGES/pgrouting_doc_strings.po @@ -1,11 +1,11 @@ # SOME DESCRIPTIVE TITLE. -# Copyright (C) pgRouting Contributors - Version v3.7.2 +# Copyright (C) pgRouting Contributors - Version v3.8 # This file is distributed under the same license as the pgRouting package. # Regina Obe , 2022. # Hyung-Gyu Ryoo , 2022. msgid "" msgstr "" -"Project-Id-Version: pgRouting v3.7.2\n" +"Project-Id-Version: pgRouting v3.8\n" "Report-Msgid-Bugs-To: \n" "POT-Creation-Date: 2024-10-17 00:50+0000\n" "PO-Revision-Date: 2022-12-13 12:30+0000\n" diff --git a/locale/pot/index.pot b/locale/pot/index.pot index 2938ac31f07..5eb079c0e4d 100644 --- a/locale/pot/index.pot +++ b/locale/pot/index.pot @@ -1,12 +1,12 @@ # SOME DESCRIPTIVE TITLE. -# Copyright (C) pgRouting Contributors - Version v3.7.2 +# Copyright (C) pgRouting Contributors - Version v3.8 # This file is distributed under the same license as the pgRouting package. # FIRST AUTHOR , YEAR. # #, fuzzy msgid "" msgstr "" -"Project-Id-Version: pgRouting v3.7.2\n" +"Project-Id-Version: pgRouting v3.8\n" "Report-Msgid-Bugs-To: \n" "POT-Creation-Date: 2022-06-25 12:55-0500\n" "PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n" diff --git a/locale/pot/pgrouting_doc_strings.pot b/locale/pot/pgrouting_doc_strings.pot index 52b33b4fcfc..ad5e96c11a4 100644 --- a/locale/pot/pgrouting_doc_strings.pot +++ b/locale/pot/pgrouting_doc_strings.pot @@ -1,14 +1,14 @@ # SOME DESCRIPTIVE TITLE. -# Copyright (C) pgRouting Contributors - Version v3.7.2 +# Copyright (C) pgRouting Contributors - Version v3.8 # This file is distributed under the same license as the pgRouting package. # FIRST AUTHOR , YEAR. # #, fuzzy msgid "" msgstr "" -"Project-Id-Version: pgRouting v3.7.2\n" +"Project-Id-Version: pgRouting v3.8\n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2025-01-06 09:19-0600\n" +"POT-Creation-Date: 2025-02-27 16:46+0000\n" "PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n" "Last-Translator: FULL NAME \n" "Language-Team: LANGUAGE \n" @@ -595,7 +595,7 @@ msgstr "" msgid "References" msgstr "" -msgid "`Boost's metric appro's metric approximation `__" +msgid "`Boost: metric TSP approx `__" msgstr "" msgid "`University of Waterloo TSP `__" @@ -1486,7 +1486,7 @@ msgstr "" msgid "https://en.wikipedia.org/wiki/Vehicle_routing_problem" msgstr "" -msgid "The queries use the :doc:`sampledata` network." +msgid ":doc:`sampledata`" msgstr "" msgid "A* - Family of functions" @@ -1636,7 +1636,7 @@ msgstr "" msgid ":doc:`bdAstar-family`" msgstr "" -msgid "https://www.boost.org/libs/graph/doc/astar_search.html" +msgid "`Boost: A* search `__" msgstr "" msgid "https://en.wikipedia.org/wiki/A*_search_algorithm" @@ -2410,7 +2410,7 @@ msgstr "" msgid "For large graphs where there is a path bewtween the starting vertex and ending vertex:" msgstr "" -msgid "It is expected to terminate faster than pgr_astar" +msgid "It is expected to terminate faster than pgr_aStar" msgstr "" msgid ":doc:`aStar-family`" @@ -2530,19 +2530,7 @@ msgstr "" msgid "Identifier of the color of the edge." msgstr "" -msgid "`Boost: Sequential Vertex Coloring algorithm documentation `__" -msgstr "" - -msgid "`Wikipedia: Graph coloring `__" -msgstr "" - -msgid "`Boost: is_bipartite `__" -msgstr "" - -msgid "`Wikipedia: bipartite graph `__" -msgstr "" - -msgid "`Boost: Edge Coloring Algorithm documentation `__" +msgid "`Boost: `__" msgstr "" msgid "Components - Family of functions" @@ -2632,7 +2620,7 @@ msgstr "" msgid "Node" msgstr "" -msgid "Adjecent nodes" +msgid "Adjacent nodes" msgstr "" msgid "Number of adjacent nodes" @@ -3007,9 +2995,6 @@ msgstr "" msgid "Now, the routing graph has an edge connecting with node :math:`7`." msgstr "" -msgid ":doc:`sampledata`" -msgstr "" - msgid "https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/lecture16.pdf" msgstr "" @@ -3940,132 +3925,18 @@ msgstr "" msgid ":doc:`release_notes`" msgstr "" -msgid "Current release" -msgstr "" - -msgid "pgRouting 3.7.2 Release Notes" +msgid "pgRouting 3.8.0 Release Notes" msgstr "" msgid "No Changes Yet" msgstr "" -msgid "pgRouting 3.7.1 Release Notes" -msgstr "" - -msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.7.1 `__" -msgstr "" - -msgid "Bug fixes" -msgstr "" - -msgid "`#2680 `__ fails to compile under mingw64 gcc 13.2" -msgstr "" - -msgid "`#2689 `__ When point is a vertex, the withPoints family do not return results." -msgstr "" - -msgid "C/C++ code enhancemet" -msgstr "" - -msgid "TRSP family" -msgstr "" - -msgid "pgRouting 3.7.0 Release Notes" -msgstr "" - -msgid "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" -msgstr "" - -msgid "Stopping support of PostgreSQL 12" -msgstr "" - -msgid "CI does not test for PostgreSQL 12" -msgstr "" - -msgid "New experimental functions" -msgstr "" - -msgid "Metrics" -msgstr "" - -msgid "pgr_betweennessCentrality" -msgstr "" - -msgid "Official functions changes" -msgstr "" - -msgid "`#2605 `__ Standarize spanning tree functions output" -msgstr "" - -msgid "Functions:" -msgstr "" - -msgid "``pgr_kruskalDD``" -msgstr "" - -msgid "``pgr_kruskalDFS``" -msgstr "" - -msgid "``pgr_kruskalBFS``" -msgstr "" - -msgid "``pgr_primDD``" -msgstr "" - -msgid "``pgr_primDFS``" -msgstr "" - -msgid "``pgr_primBFS``" -msgstr "" - -msgid "Standarizing output columns to |result-spantree|" -msgstr "" - -msgid "Added ``pred`` result columns." -msgstr "" - -msgid "Experimental promoted to proposed." -msgstr "" - -msgid "`#2635 `__ pgr_LineGraph ignores directed flag and use negative values for identifiers." -msgstr "" - -msgid "``pgr_lineGraph``" -msgstr "" - -msgid "Promoted to **proposed** signature." -msgstr "" - -msgid "Works for directed and undirected graphs." -msgstr "" - -msgid "Code enhancement" -msgstr "" - -msgid "`#2599 `__ Driving distance cleanup" -msgstr "" - -msgid "`#2607 `__ Read postgresql data on C++" -msgstr "" - -msgid "`#2614 `__ Clang tidy does not work" -msgstr "" - msgid "All releases" msgstr "" msgid "Kruskal - Family of functions" msgstr "" -msgid "Boost Graph Inside" -msgstr "" - msgid "Kruskal's algorithm is a greedy minimum spanning tree algorithm that in each cycle finds and adds the edge of the least possible weight that connects any two trees in the forest." msgstr "" @@ -4093,12 +3964,6 @@ msgstr "" msgid "All deprecated functions will be removed on next mayor version 4.0.0" msgstr "" -msgid "Migration of functions" -msgstr "" - -msgid "Migrating functions" -msgstr "" - msgid "Migration of ``pgr_aStar``" msgstr "" @@ -4234,7 +4099,7 @@ msgstr "" msgid "If needed add the new columns, for example:" msgstr "" -msgid "Migration of ``pgr_drivingdistance``" +msgid "Migration of ``pgr_drivingDistance``" msgstr "" msgid "Starting from `v3.6.0 `__ :doc:`pgr_drivingDistance` result columns are being standardized." @@ -4252,10 +4117,10 @@ msgstr "" msgid "|result-spantree|" msgstr "" -msgid "``pgr_drivingdistance`` (Single vertex)" +msgid "pgr_drivingDistance(Single vertex)" msgstr "" -msgid "``pgr_drivingdistance`` (Multiple vertices)" +msgid "pgr_drivingDistance(Multiple vertices)" msgstr "" msgid "Output columns were |result-dij-dd|" @@ -4303,12 +4168,21 @@ msgstr "" msgid "|result-bfs|" msgstr "" +msgid "``pgr_kruskalDD``" +msgstr "" + msgid "Single vertex" msgstr "" msgid "Multiple vertices" msgstr "" +msgid "``pgr_kruskalDFS``" +msgstr "" + +msgid "``pgr_kruskalBFS``" +msgstr "" + msgid "Output columns were |result-bfs|" msgstr "" @@ -4435,6 +4309,15 @@ msgstr "" msgid "Starting from `v3.7.0 `__ :doc:`pgr_primDD`, :doc:`pgr_primBFS` and :doc:`pgr_primDFS` result columns are being standardized." msgstr "" +msgid "``pgr_primDD``" +msgstr "" + +msgid "``pgr_primDFS``" +msgstr "" + +msgid "``pgr_primBFS``" +msgstr "" + msgid "Prim single vertex" msgstr "" @@ -4594,7 +4477,118 @@ msgstr "" msgid "If needed filter out the additional columns, for example, to return the original columns:" msgstr "" -msgid "Migration of turn restrictions" +msgid "Migration of ``pgr_trsp`` (Vertices)" +msgstr "" + +msgid "Signature:" +msgstr "" + +msgid "Deprecated" +msgstr "" + +msgid "`v3.4.0 `__" +msgstr "" + +msgid ":doc:`pgr_dijkstra`" +msgstr "" + +msgid ":doc:`pgr_trsp`" +msgstr "" + +msgid "`Migration of restrictions`_" +msgstr "" + +msgid "Use ``pgr_dijkstra`` when there are no restrictions." +msgstr "" + +msgid "Use :doc:`pgr_dijkstra` instead." +msgstr "" + +msgid "To get the original column names:" +msgstr "" + +msgid "``id1`` is the node" +msgstr "" + +msgid "``id2`` is the edge" +msgstr "" + +msgid "Use ``pgr_trsp`` when there are restrictions." +msgstr "" + +msgid "Use :doc:`pgr_trsp` (One to One) instead." +msgstr "" + +msgid "Migration of ``pgr_trsp`` (Edges)" +msgstr "" + +msgid ":doc:`pgr_withPoints`" +msgstr "" + +msgid ":doc:`pgr_trsp_withPoints`" +msgstr "" + +msgid "Use ``pgr_withPoints`` when there are no restrictions." +msgstr "" + +msgid "Use :doc:`pgr_withPoints` (One to One) instead." +msgstr "" + +msgid "Use ``pgr_trsp_withPoints`` when there are restrictions." +msgstr "" + +msgid "Use :doc:`pgr_trsp_withPoints` instead." +msgstr "" + +msgid "Migration of ``pgr_trspViaVertices``" +msgstr "" + +msgid ":doc:`pgr_dijkstraVia`" +msgstr "" + +msgid ":doc:`pgr_trspVia`" +msgstr "" + +msgid "Use ``pgr_dijkstraVia`` when there are no restrictions" +msgstr "" + +msgid "Use :doc:`pgr_dijkstraVia` instead." +msgstr "" + +msgid "``id1`` is the path identifier" +msgstr "" + +msgid "``id2`` is the node" +msgstr "" + +msgid "``id3`` is the edge" +msgstr "" + +msgid "Use ``pgr_trspVia`` when there are restrictions" +msgstr "" + +msgid "Use :doc:`pgr_trspVia` instead." +msgstr "" + +msgid "Migration of ``pgr_trspViaEdges``" +msgstr "" + +msgid ":doc:`pgr_withPointsVia`" +msgstr "" + +msgid ":doc:`pgr_trspVia_withPoints`" +msgstr "" + +msgid "Use ``pgr_withPointsVia`` when there are no restrictions" +msgstr "" + +msgid "Use :doc:`pgr_withPointsVia` instead." +msgstr "" + +msgid "Use ``pgr_trspVia_withPoints`` when there are restrictions" +msgstr "" + +msgid "Use :doc:`pgr_trspVia_withPoints` instead." msgstr "" msgid "Migration of restrictions" @@ -4735,256 +4729,31 @@ msgstr "" msgid "The migrated table contents:" msgstr "" -msgid "Migration of ``pgr_trsp`` (Vertices)" +msgid ":doc:`withPoints-category`" msgstr "" -msgid ":doc:`pgr_trsp` signatures have changed and many issues have been fixed in the new signatures. This section will show how to migrate from the old signatures to the new replacement functions. This also affects the restrictions." +msgid "Ordering - Family of functions" msgstr "" -msgid "The integral type of the ``Edges SQL`` can only be ``INTEGER``." +msgid "pgRouting Concepts" msgstr "" -msgid "The floating point type of the ``Edges SQL`` can only be ``FLOAT``." +msgid "This is a simple guide that go through some of the steps for getting started with pgRouting. This guide covers:" msgstr "" -msgid "``directed`` flag is compulsory." +msgid "Graphs" msgstr "" -msgid "Does not autodetect if ``reverse_cost`` column exist." +msgid "A graph is an ordered pair :math:`G = (V ,E)` where:" msgstr "" -msgid "User must be careful to match the existence of the column with the value of ``has_rcost`` parameter." +msgid ":math:`V` is a set of vertices, also called nodes." msgstr "" -msgid "The restrictions inner query is optional." +msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V \\}`" msgstr "" -msgid "The output column names are meaningless" -msgstr "" - -msgid "Migrate by using:" -msgstr "" - -msgid ":doc:`pgr_dijkstra` when there are no restrictions," -msgstr "" - -msgid ":doc:`pgr_trsp` (One to One) when there are restrictions." -msgstr "" - -msgid "Migrating ``pgr_trsp`` (Vertices) using ``pgr_dijkstra``" -msgstr "" - -msgid "The following query does not have restrictions." -msgstr "" - -msgid "A message about deprecation is shown" -msgstr "" - -msgid "Deprecated functions will be removed on the next mayor version 4.0.0" -msgstr "" - -msgid "Use :doc:`pgr_dijkstra` instead." -msgstr "" - -msgid "The types casting has been removed." -msgstr "" - -msgid ":doc:`pgr_dijkstra`:" -msgstr "" - -msgid "Autodetects if ``reverse_cost`` column is in the edges SQL." -msgstr "" - -msgid "Accepts ``ANY-INTEGER`` on integral types" -msgstr "" - -msgid "Accepts ``ANY-NUMERICAL`` on floating point types" -msgstr "" - -msgid "``directed`` flag has a default value of ``true``." -msgstr "" - -msgid "Use the same value that on the original query." -msgstr "" - -msgid "In this example it is ``true`` which is the default value." -msgstr "" - -msgid "The flag has been omitted and the default is been used." -msgstr "" - -msgid "When the need of using strictly the same (meaningless) names and types of the function been migrated then:" -msgstr "" - -msgid "``id1`` is the node" -msgstr "" - -msgid "``id2`` is the edge" -msgstr "" - -msgid "Migrating ``pgr_trsp`` (Vertices) using ``pgr_trsp``" -msgstr "" - -msgid "The following query has restrictions." -msgstr "" - -msgid "The restrictions are the last parameter of the function" -msgstr "" - -msgid "Using the old structure of restrictions" -msgstr "" - -msgid "Use :doc:`pgr_trsp` (One to One) instead." -msgstr "" - -msgid "The new structure of restrictions is been used." -msgstr "" - -msgid "It is the second parameter." -msgstr "" - -msgid ":doc:`pgr_trsp`:" -msgstr "" - -msgid "Migration of ``pgr_trsp`` (Edges)" -msgstr "" - -msgid "The integral types of the ``sql`` can only be ``INTEGER``." -msgstr "" - -msgid "The floating point type of the ``sql`` can only be ``FLOAT``." -msgstr "" - -msgid "For these migration guide the following points will be used:" -msgstr "" - -msgid ":doc:`pgr_withPoints` when there are no restrictions," -msgstr "" - -msgid ":doc:`pgr_trsp_withPoints` (One to One) when there are restrictions." -msgstr "" - -msgid "Migrating ``pgr_trsp`` (Edges) using ``pgr_withPoints``" -msgstr "" - -msgid "Use :doc:`pgr_withPoints` instead." -msgstr "" - -msgid "Do not show details, as the deprecated function does not show details." -msgstr "" - -msgid ":doc:`pgr_withPoints`:" -msgstr "" - -msgid "On the points query do not include the ``side`` column." -msgstr "" - -msgid "When the need of using strictly the same (meaningless) names and types, and node values of the function been migrated then:" -msgstr "" - -msgid "Migrating ``pgr_trsp`` (Edges) using ``pgr_trsp_withPoints``" -msgstr "" - -msgid "Use :doc:`pgr_trsp_withPoints` instead." -msgstr "" - -msgid ":doc:`pgr_trsp_withPoints`:" -msgstr "" - -msgid "Migration of ``pgr_trspViaVertices``" -msgstr "" - -msgid "The integral types of the ``Edges SQL`` can only be ``INTEGER``." -msgstr "" - -msgid ":doc:`pgr_dijkstraVia` when there are no restrictions," -msgstr "" - -msgid ":doc:`pgr_trspVia` when there are restrictions." -msgstr "" - -msgid "Migrating ``pgr_trspViaVertices`` using ``pgr_dijkstraVia``" -msgstr "" - -msgid "Use :doc:`pgr_dijkstraVia` instead." -msgstr "" - -msgid ":doc:`pgr_dijkstraVia`:" -msgstr "" - -msgid "``id1`` is the path identifier" -msgstr "" - -msgid "``id2`` is the node" -msgstr "" - -msgid "``id3`` is the edge" -msgstr "" - -msgid "Migrating ``pgr_trspViaVertices`` using ``pgr_trspVia``" -msgstr "" - -msgid "Use :doc:`pgr_trspVia` instead." -msgstr "" - -msgid ":doc:`pgr_trspVia`:" -msgstr "" - -msgid "Migration of ``pgr_trspViaEdges``" -msgstr "" - -msgid "And will travel thru the following Via points :math:`4\\rightarrow3\\rightarrow6`" -msgstr "" - -msgid ":doc:`pgr_withPointsVia` when there are no restrictions," -msgstr "" - -msgid ":doc:`pgr_trspVia_withPoints` when there are restrictions." -msgstr "" - -msgid "Migrating ``pgr_trspViaEdges`` using ``pgr_withPointsVia``" -msgstr "" - -msgid "Use :doc:`pgr_withPointsVia` instead." -msgstr "" - -msgid ":doc:`pgr_withPointsVia`:" -msgstr "" - -msgid "Migrating ``pgr_trspViaEdges`` using ``pgr_trspVia_withPoints``" -msgstr "" - -msgid "Use :doc:`pgr_trspVia_withPoints` instead." -msgstr "" - -msgid ":doc:`pgr_trspVia_withPoints`:" -msgstr "" - -msgid ":doc:`withPoints-category`" -msgstr "" - -msgid "Ordering - Family of functions" -msgstr "" - -msgid "pgRouting Concepts" -msgstr "" - -msgid "This is a simple guide that go through some of the steps for getting started with pgRouting. This guide covers:" -msgstr "" - -msgid "Graphs" -msgstr "" - -msgid "A graph is an ordered pair :math:`G = (V ,E)` where:" -msgstr "" - -msgid ":math:`V` is a set of vertices, also called nodes." -msgstr "" - -msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V \\}`" -msgstr "" - -msgid "There are different kinds of graphs:" +msgid "There are different kinds of graphs:" msgstr "" msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V\\}`" @@ -5887,9 +5656,6 @@ msgstr "" msgid "Parameters for the Via functions" msgstr "" -msgid ":doc:`pgr_dijkstraVia`" -msgstr "" - msgid "SQL query as described." msgstr "" @@ -5923,9 +5689,6 @@ msgstr "" msgid "For the TRSP functions" msgstr "" -msgid ":doc:`pgr_trsp`" -msgstr "" - msgid "Array of identifiers of destination vertices." msgstr "" @@ -5965,9 +5728,6 @@ msgstr "" msgid "Used in functions the following:" msgstr "" -msgid ":doc:`pgr_withPoints`" -msgstr "" - msgid "Returns set of ``(seq, path_seq [, start_pid] [, end_pid], node, edge, cost, agg_cost)``" msgstr "" @@ -6208,7 +5968,7 @@ msgstr "" msgid "Upgrading the database" msgstr "" -msgid "To upgrade pgRouting in the database to version 3.7.2 use the following command:" +msgid "To upgrade pgRouting in the database to version 3.8.0 use the following command:" msgstr "" msgid "More information can be found in https://www.postgresql.org/docs/current/sql-createextension.html" @@ -6592,7 +6352,7 @@ msgstr "" msgid ":doc:`migration`" msgstr "" -msgid "pgr_KSP" +msgid "``pgr_KSP``" msgstr "" msgid "``pgr_KSP`` — Yen's algorithm for K shortest paths using Dijkstra." @@ -6607,25 +6367,25 @@ msgstr "" msgid "Result columns standarized to: |nksp-result|" msgstr "" -msgid "``pgr_ksp`` (One to One)" +msgid "pgr_ksp(One to One)" msgstr "" msgid "Added ``start_vid`` and ``end_vid`` result columns." msgstr "" -msgid "New overload functions:" +msgid "New proposed signatures:" msgstr "" -msgid "``pgr_ksp`` (One to Many)" +msgid "pgr_ksp(One to Many)" msgstr "" -msgid "``pgr_ksp`` (Many to One)" +msgid "pgr_ksp(Many to One)" msgstr "" -msgid "``pgr_ksp`` (Many to Many)" +msgid "pgr_ksp(Many to Many)" msgstr "" -msgid "``pgr_ksp`` (Combinations)" +msgid "pgr_ksp(Combinations)" msgstr "" msgid "Version 2.1.0" @@ -6640,12 +6400,18 @@ msgstr "" msgid "Version 2.0.0" msgstr "" -msgid "**Official** function" +msgid "Official function." msgstr "" msgid "The K shortest path routing algorithm based on Yen's algorithm. \"K\" is the number of shortest paths desired." msgstr "" +msgid "|Boost| Boost Graph Inside" +msgstr "" + +msgid "Boost Graph inside" +msgstr "" + msgid "Signatures" msgstr "" @@ -6757,7 +6523,7 @@ msgstr "" msgid "``pgr_TSP``" msgstr "" -msgid "``pgr_TSP`` - Aproximation using *metric* algorithm." +msgid "``pgr_TSP`` - Approximation using *metric* algorithm." msgstr "" msgid "Availability:" @@ -6934,7 +6700,10 @@ msgstr "" msgid "``pgr_TSPeuclidean``" msgstr "" -msgid "``pgr_TSPeuclidean`` - Aproximation using *metric* algorithm." +msgid "``pgr_TSPeuclidean`` - Approximation using *metric* algorithm." +msgstr "" + +msgid "Using `Boost: metric TSP approx `__" msgstr "" msgid "The Simulated Annealing Algorithm related parameters are ignored: `max_processing_time`, `tries_per_temperature`, `max_changes_per_temperature`, `max_consecutive_non_changes`, `initial_temperature`, `final_temperature`, `cooling_factor`, `randomize`" @@ -6946,7 +6715,7 @@ msgstr "" msgid "Name change from pgr_eucledianTSP" msgstr "" -msgid "New **Official** function" +msgid "New official function." msgstr "" msgid "Any duplicated identifier will be ignored. The coordinates that will be kept" @@ -7015,9 +6784,6 @@ msgstr "" msgid "Visualy, The first image is the `optimal solution `__ and the second image is the solution obtained with ``pgr_TSPeuclidean``." msgstr "" -msgid ":doc:`sampledata` network." -msgstr "" - msgid "``pgr_aStar``" msgstr "" @@ -7027,43 +6793,40 @@ msgstr "" msgid "Standarizing output columns to |short-generic-result|" msgstr "" -msgid "``pgr_aStar`` (`One to One`_) added ``start_vid`` and ``end_vid`` columns." +msgid "pgr_aStar(One to One) added ``start_vid`` and ``end_vid`` columns." msgstr "" -msgid "``pgr_aStar`` (`One to Many`_) added ``end_vid`` column." +msgid "pgr_aStar(One to Many) added ``end_vid`` column." msgstr "" -msgid "``pgr_aStar`` (`Many to One`_) added ``start_vid`` column." +msgid "pgr_aStar(Many to One) added ``start_vid`` column." msgstr "" msgid "Version 3.2.0" msgstr "" -msgid "New **proposed** signature:" -msgstr "" - -msgid "``pgr_aStar`` (`Combinations`_)" +msgid "New proposed signature:" msgstr "" -msgid "Version 2.4.0" +msgid "pgr_aStar(Combinations)" msgstr "" -msgid "New **Proposed** signatures:" +msgid "Function promoted to official." msgstr "" -msgid "``pgr_aStar`` (`One to Many`_)" +msgid "Version 2.4.0" msgstr "" -msgid "``pgr_aStar`` (`Many to One`_)" +msgid "pgr_aStar(One to Many)" msgstr "" -msgid "``pgr_aStar`` (`Many to Many`_)" +msgid "pgr_aStar(Many to One)" msgstr "" -msgid "Signature change on ``pgr_astar`` (`One to One`_)" +msgid "pgr_aStar(Many to Many)" msgstr "" -msgid "**Official** ``pgr_aStar`` (`One to One`_)" +msgid "Signature change on pgr_aStar(One to One)" msgstr "" msgid "The results are equivalent to the union of the results of the `pgr_aStar(` `One to One`_ `)` on the:" @@ -7126,16 +6889,16 @@ msgstr "" msgid "Manually assigned vertex combinations." msgstr "" -msgid "pgr_aStarCost" +msgid "``pgr_aStarCost``" msgstr "" msgid "``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm." msgstr "" -msgid "``pgr_aStarCost`` (`Combinations`_)" +msgid "pgr_aStarCost(Combinations)" msgstr "" -msgid "New **proposed** function" +msgid "New proposed function." msgstr "" msgid "The ``pgr_aStarCost`` function sumarizes of the cost of the shortest path using the A* algorithm." @@ -7246,6 +7009,9 @@ msgstr "" msgid "Renamed from version 1.x" msgstr "" +msgid "Support" +msgstr "" + msgid "Returns the polygon part of an alpha shape." msgstr "" @@ -7312,7 +7078,7 @@ msgstr "" msgid "`ST_ConcaveHull `__" msgstr "" -msgid "pgr_analyzeGraph" +msgid "``pgr_analyzeGraph``" msgstr "" msgid "``pgr_analyzeGraph`` — Analyzes the network topology." @@ -7525,9 +7291,6 @@ msgstr "" msgid "Selecting the rows WHERE the geometry is near the place='myhouse' of the table ``othertable``. (note the use of quote_literal)" msgstr "" -msgid "The examples use the :doc:`sampledata` network." -msgstr "" - msgid ":doc:`pgr_analyzeOneWay`" msgstr "" @@ -7537,7 +7300,7 @@ msgstr "" msgid ":doc:`pgr_nodeNetwork` to create nodes to a not noded edge table." msgstr "" -msgid "pgr_analyzeOneWay" +msgid "``pgr_analyzeOneWay``" msgstr "" msgid "``pgr_analyzeOneWay`` — Analyzes oneway Sstreets and identifies flipped segments." @@ -7642,7 +7405,7 @@ msgstr "" msgid "Version 2.5.0" msgstr "" -msgid "New **experimental** function" +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." @@ -7669,7 +7432,7 @@ msgstr "" msgid "Nodes in red are the articulation points." msgstr "" -msgid "Boost: `Biconnected components & articulation points `__" +msgid "`Boost: Biconnected components & articulation points `__" msgstr "" msgid "wikipedia: `Biconnected component `__" @@ -7681,34 +7444,31 @@ msgstr "" msgid "``pgr_bdAstar`` — Shortest path using the bidirectional A* algorithm." msgstr "" -msgid "``pgr_bdAstar`` (`One to One`_) added ``start_vid`` and ``end_vid`` columns." +msgid "pgr_bdAstar(One to One) added ``start_vid`` and ``end_vid`` columns." msgstr "" -msgid "``pgr_bdAstar`` (`One to Many`_) added ``end_vid`` column." +msgid "pgr_bdAstar(One to Many) added ``end_vid`` column." msgstr "" -msgid "``pgr_bdAstar`` (`Many to One`_) added ``start_vid`` column." +msgid "pgr_bdAstar(Many to One) added ``start_vid`` column." msgstr "" -msgid "``pgr_bdAstar`` (`Combinations`_)" -msgstr "" - -msgid "``pgr_bdAstar`` (`One to Many`_)" +msgid "pgr_bdAstar(Combinations)" msgstr "" -msgid "``pgr_bdAstar`` (`Many to One`_)" +msgid "pgr_bdAstar(One to Many)" msgstr "" -msgid "``pgr_bdAstar`` (`Many to Many`_)" +msgid "pgr_bdAstar(Many to One)" msgstr "" -msgid "Signature change on ``pgr_bdAstar`` (`One to One`_)" +msgid "pgr_bdAstar(Many to Many)" msgstr "" -msgid "**Official** ``pgr_bdAstar`` (`One to One`_)" +msgid "Signature change on pgr_bdAstar(One to One)" msgstr "" -msgid "The results are equivalent to the union of the results of the `pgr_bdAStar(` `One to One`_ `)` on the:" +msgid "The results are equivalent to the union of the results of the pgr_bdAStar(One to One) on the:" msgstr "" msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])" @@ -7726,13 +7486,13 @@ msgstr "" msgid "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_, [**options**])" msgstr "" -msgid "pgr_bdAstarCost" +msgid "``pgr_bdAstarCost``" msgstr "" msgid "``pgr_bdAstarCost`` - Total cost of the shortest path using the bidirectional A* algorithm." msgstr "" -msgid "``pgr_bdAstarCost`` (`Combinations`_)" +msgid "pgr_bdAstarCost(Combinations)" msgstr "" msgid "The ``pgr_bdAstarCost`` function sumarizes of the cost of the shortest path using the bidirectional A* algorithm." @@ -7771,25 +7531,19 @@ msgstr "" msgid "``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra algorithm." msgstr "" -msgid "pgr_bdDijkstra(`Combinations`_)" -msgstr "" - -msgid "New **Proposed** functions:" -msgstr "" - -msgid "``pgr_bdDijkstra`` (`One to Many`_)" +msgid "pgr_bdDijkstra(Combinations)" msgstr "" -msgid "``pgr_bdDijkstra`` (`Many to One`_)" +msgid "pgr_bdDijkstra(One to Many)" msgstr "" -msgid "``pgr_bdDijkstra`` (`Many to Many`_)" +msgid "pgr_bdDijkstra(Many to One)" msgstr "" -msgid "Signature change on ``pgr_bdDijsktra`` (`One to One`_)" +msgid "pgr_bdDijkstra(Many to Many)" msgstr "" -msgid "**Official** ``pgr_bdDijkstra`` (`One to One`_)" +msgid "Signature change on pgr_bdDijsktra(One to One)" msgstr "" msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" @@ -7834,9 +7588,6 @@ msgstr "" msgid "Using a combinations table on an **undirected** graph" msgstr "" -msgid "https://www.cs.princeton.edu/courses/archive/spr06/cos423/Handouts/EPP%20shortest%20path%20algorithms.pdf" -msgstr "" - msgid "https://en.wikipedia.org/wiki/Bidirectional_search" msgstr "" @@ -7846,7 +7597,7 @@ msgstr "" msgid "``pgr_bdDijkstraCost`` — Returns the shortest path's cost using Bidirectional Dijkstra algorithm." msgstr "" -msgid "``pgr_bdDijkstraCost`` (`Combinations`_)" +msgid "pgr_bdDijkstraCost(Combinations)" msgstr "" msgid "The ``pgr_bdDijkstraCost`` function sumarizes of the cost of the shortest path using the bidirectional Dijkstra Algorithm." @@ -7894,25 +7645,10 @@ msgstr "" msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm." msgstr "" -msgid "New **experimental** signature:" -msgstr "" - -msgid "``pgr_bellmanFord`` (`Combinations`_)" -msgstr "" - -msgid "New **experimental** signatures:" -msgstr "" - -msgid "``pgr_bellmanFord`` (`One to One`_)" -msgstr "" - -msgid "``pgr_bellmanFord`` (`One to Many`_)" +msgid "New experimental signature:" msgstr "" -msgid "``pgr_bellmanFord`` (`Many to One`_)" -msgstr "" - -msgid "``pgr_bellmanFord`` (`Many to Many`_)" +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." @@ -7960,19 +7696,22 @@ msgstr "" msgid "Using a combinations table on an **undirected** graph." msgstr "" +msgid "`Boost: Bellman Ford `__" +msgstr "" + msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" msgstr "" -msgid "``pgr_betweennessCentrality``" +msgid "Boost Graph Inside" msgstr "" -msgid "``pgr_betweennessCentrality`` - Calculates the relative betweeness centrality using Brandes Algorithm" +msgid "``pgr_betweennessCentrality`` - Experimental" msgstr "" -msgid "Version 3.7.0" +msgid "``pgr_betweennessCentrality`` - Calculates the relative betweenness centrality using Brandes Algorithm" msgstr "" -msgid "New **experimental** function:" +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." @@ -8032,10 +7771,7 @@ msgstr "" msgid "Relative betweenness centrality score of the vertex (will be in range [0,1])" msgstr "" -msgid "Boost's `betweenness_centrality `_" -msgstr "" - -msgid "Queries use the :doc:`sampledata` network." +msgid "`Boost: betweenness centrality `_" msgstr "" msgid "``pgr_biconnectedComponents``" @@ -8086,9 +7822,6 @@ msgstr "" msgid "Identifier of the edge that belongs to the ``component``." msgstr "" -msgid "Boost: `Biconnected components `__" -msgstr "" - msgid "``pgr_binaryBreadthFirstSearch`` - Experimental" msgstr "" @@ -8098,19 +7831,7 @@ msgstr "" msgid "Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-negative integer, is termed as a 'binary graph'." msgstr "" -msgid "pgr_binaryBreadthFirstSearch(`Combinations`_)" -msgstr "" - -msgid "pgr_binaryBreadthFirstSearch(`One to One`_)" -msgstr "" - -msgid "pgr_binaryBreadthFirstSearch(`One to Many`_)" -msgstr "" - -msgid "pgr_binaryBreadthFirstSearch(`Many to One`_)" -msgstr "" - -msgid "pgr_binaryBreadthFirstSearch(`Many to Many`_)" +msgid "pgr_binaryBreadthFirstSearch(Combinations)" msgstr "" msgid "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." @@ -8143,21 +7864,21 @@ msgstr "" msgid "**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :math:`1``)" msgstr "" +msgid "`Boost: Breadth First Search `__" +msgstr "" + msgid "https://cp-algorithms.com/graph/01_bfs.html" msgstr "" msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants" msgstr "" -msgid "pgr_bipartite -Experimental" +msgid "``pgr_bipartite`` - Experimental" msgstr "" msgid "``pgr_bipartite`` — Disjoint sets of vertices such that no two vertices within the same set are adjacent." msgstr "" -msgid "New **experimental** signature" -msgstr "" - msgid "A bipartite graph is a graph with two sets of vertices which are connected to each other, but not within themselves. A bipartite graph is possible if the graph coloring is possible using two colors such that vertices in a set are colored with the same color." msgstr "" @@ -8194,25 +7915,25 @@ msgstr "" msgid "Edges in blue represent odd length cycle subgraph." msgstr "" -msgid "``pgr_boykovKolmogorov``" +msgid "`Boost: is_bipartite `__" msgstr "" -msgid "``pgr_boykovKolmogorov`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Boykov Kolmogorov algorithm." +msgid "`Wikipedia: bipartite graph `__" msgstr "" -msgid "New **proposed** signature" +msgid "``pgr_boykovKolmogorov``" msgstr "" -msgid "``pgr_boykovKolmogorov`` (`Combinations`_)" +msgid "``pgr_boykovKolmogorov`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Boykov Kolmogorov algorithm." msgstr "" -msgid "Renamed from ``pgr_maxFlowBoykovKolmogorov``" +msgid "pgr_boykovKolmogorov(Combinations)" msgstr "" -msgid "**Proposed** function" +msgid "Renamed from ``pgr_maxFlowBoykovKolmogorov``" msgstr "" -msgid "New **Experimental** function" +msgid "Function promoted to proposed." msgstr "" msgid "Running time: Polynomial" @@ -8251,7 +7972,7 @@ msgstr "" msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`." msgstr "" -msgid "https://www.boost.org/libs/graph/doc/boykov_kolmogorov_max_flow.html" +msgid "`Boost: Boykov Kolmogorov max flow `__" msgstr "" msgid "``pgr_breadthFirstSearch`` - Experimental" @@ -8260,12 +7981,6 @@ msgstr "" msgid "``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth First Search algorithm." msgstr "" -msgid "``pgr_breadthFirstSearch`` (`Single Vertex`_)" -msgstr "" - -msgid "``pgr_breadthFirstSearch`` (`Multiple Vertices`_)" -msgstr "" - msgid "Provides the Breadth First Search traversal order from a root vertex to a particular depth." msgstr "" @@ -8320,9 +8035,6 @@ msgstr "" msgid "descending" msgstr "" -msgid "`Boost: Breadth First Search algorithm documentation `__" -msgstr "" - msgid "`Wikipedia: Breadth First Search algorithm `__" msgstr "" @@ -8356,7 +8068,7 @@ msgstr "" msgid "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29" msgstr "" -msgid "**Supported versions**" +msgid "`Boost: Connected components `__" msgstr "" msgid "``pgr_chinesePostman`` - Experimental" @@ -8407,7 +8119,7 @@ msgstr "" msgid "Minimum costs of a circuit path." msgstr "" -msgid "pgr_connectedComponents" +msgid "``pgr_connectedComponents``" msgstr "" msgid "``pgr_connectedComponents`` — Connected components of an undirected graph using a DFS-based approach." @@ -8440,9 +8152,6 @@ msgstr "" msgid "Connecting disconnected components" msgstr "" -msgid "Boost: `Connected components `__" -msgstr "" - msgid "wikipedia: `Connected component `__" msgstr "" @@ -8455,6 +8164,9 @@ msgstr "" msgid "Name change from ``pgr_contractGraph``" msgstr "" +msgid "Bug fixes" +msgstr "" + msgid "Contraction reduces the size of the graph by removing some of the vertices and edges and, for example, might add edges that represent a sequence of original edges decreasing the total time and space used in graph algorithms." msgstr "" @@ -8596,7 +8308,7 @@ msgstr "" msgid "Only linear contraction" msgstr "" -msgid "pgr_createTopology" +msgid "``pgr_createTopology``" msgstr "" msgid "``pgr_createTopology`` — Builds a network topology based on the geometry information." @@ -8755,10 +8467,7 @@ msgstr "" msgid "This example start a clean topology, with 5 edges, and then its incremented to the rest of the edges." msgstr "" -msgid "The example uses the :doc:`sampledata` network." -msgstr "" - -msgid "pgr_createVerticesTable" +msgid "``pgr_createVerticesTable``" msgstr "" msgid "``pgr_createVerticesTable`` — Reconstructs the vertices table based on the source and target information." @@ -8929,7 +8638,7 @@ msgstr "" msgid "`Wikipedia: Cuthill-McKee Ordering `__" msgstr "" -msgid "pgr_dagShortestPath - Experimental" +msgid "``pgr_dagShortestPath`` - Experimental" msgstr "" msgid "``pgr_dagShortestPath`` — Returns the shortest path for weighted directed acyclic graphs(DAG). In particular, the DAG shortest paths algorithm implemented by Boost.Graph." @@ -8992,6 +8701,9 @@ msgstr "" msgid "Making **start_vids** the same as **end_vids**" msgstr "" +msgid "`Boost: DAG shortest paths `__" +msgstr "" + msgid "https://en.wikipedia.org/wiki/Topological_sorting" msgstr "" @@ -9091,15 +8803,6 @@ msgstr "" msgid "Version 3.3.0" msgstr "" -msgid "Promoted to **proposed** function" -msgstr "" - -msgid "``pgr_depthFirstSearch`` (`Single Vertex`_)" -msgstr "" - -msgid "``pgr_depthFirstSearch`` (`Multiple Vertices`_)" -msgstr "" - msgid "Depth First Search algorithm is a traversal algorithm which starts from a root vertex, goes as deep as possible, and backtracks once a vertex is 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 "" @@ -9139,10 +8842,10 @@ msgstr "" msgid "Same as `Single vertex`_ but with edges in descending order of ``id``." msgstr "" -msgid "`Boost: Depth First Search algorithm documentation `__" +msgid "`Boost: Depth First Search `__" msgstr "" -msgid "`Boost: Undirected DFS algorithm documentation `__" +msgid "`Boost: Undirected DFS `__" msgstr "" msgid "`Wikipedia: Depth First Search algorithm `__" @@ -9157,43 +8860,34 @@ msgstr "" msgid "Version 3.5.0" msgstr "" -msgid "``pgr_dijkstra`` (`One to One`_) added ``start_vid`` and ``end_vid`` columns." +msgid "pgr_dijkstra(One to One) added ``start_vid`` and ``end_vid`` columns." msgstr "" -msgid "``pgr_dijkstra`` (`One to Many`_) added ``end_vid`` column." +msgid "pgr_dijkstra(One to Many) added ``end_vid`` column." msgstr "" -msgid "``pgr_dijkstra`` (`Many to One`_) added ``start_vid`` column." +msgid "pgr_dijkstra(Many to One) added ``start_vid`` column." msgstr "" msgid "Version 3.1.0" msgstr "" -msgid "``pgr_dijkstra`` (`Combinations`_)" -msgstr "" - -msgid "**Official** functions" +msgid "pgr_dijkstra(Combinations)" msgstr "" msgid "Version 2.2.0" msgstr "" -msgid "New **proposed** functions:" +msgid "pgr_dijkstra(One to Many)" msgstr "" -msgid "``pgr_dijkstra`` (`One to Many`_)" +msgid "pgr_dijkstra(Many to One)" msgstr "" -msgid "``pgr_dijkstra`` (`Many to One`_)" +msgid "pgr_dijkstra(Many to Many)" msgstr "" -msgid "``pgr_dijkstra`` (`Many to Many`_)" -msgstr "" - -msgid "Signature change on ``pgr_dijkstra`` (`One to One`_)" -msgstr "" - -msgid "**Official** ``pgr_dijkstra`` (`One to One`_)" +msgid "Signature change on pgr_dijkstra(One to One)" msgstr "" msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])" @@ -9373,6 +9067,12 @@ msgstr "" msgid "37) Using `Combinations`_" msgstr "" +msgid "e Also" +msgstr "" + +msgid "`Boost: Dijkstra shortest paths `__" +msgstr "" + msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgstr "" @@ -9382,7 +9082,7 @@ msgstr "" msgid "``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra algorithm." msgstr "" -msgid "``pgr_dijkstraCost`` (`Combinations`_)" +msgid "pgr_dijkstraCost(Combinations)" msgstr "" msgid "The ``pgr_dijkstraCost`` function sumarizes of the cost of the shortest path using Dijkstra Algorithm." @@ -9625,9 +9325,6 @@ msgstr "" msgid "When ``false``: ``cap`` limit per ``Start vid`` will be returned" msgstr "" -msgid "boost: https://www.boost.org/libs/graph/doc/table_of_contents.html" -msgstr "" - msgid "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" msgstr "" @@ -9763,6 +9460,9 @@ msgstr "" msgid "``pgr_drivingDistance`` - Returns the driving distance from a start node." msgstr "" +msgid "Standarizing output columns to |result-spantree|" +msgstr "" + msgid "Added ``depth`` and ``start_vid`` result columns." msgstr "" @@ -9772,13 +9472,16 @@ msgstr "" msgid "Added ``depth`` and ``pred`` result columns." msgstr "" -msgid "Signature change pgr_drivingDistance(single vertex)" +msgid "Signature change:" msgstr "" -msgid "New **Official** pgr_drivingDistance(multiple vertices)" +msgid "pgr_drivingDistance(single vertex)" +msgstr "" + +msgid "New official signature:" msgstr "" -msgid "Official:: pgr_drivingDistance(single vertex)" +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." @@ -9820,7 +9523,7 @@ msgstr "" msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` on an undirected graph" msgstr "" -msgid "pgr_edgeColoring - Experimental" +msgid "``pgr_edgeColoring`` - Experimental" msgstr "" msgid "``pgr_edgeColoring`` — Returns the edge coloring of undirected and loop-free graphs" @@ -9880,13 +9583,16 @@ msgstr "" msgid "Graph coloring of pgRouting :doc:`sampledata`" msgstr "" -msgid "``pgr_edgeDisjointPaths``" +msgid "`Boost: Edge Coloring `__" msgstr "" -msgid "``pgr_edgeDisjointPaths`` — Calculates edge disjoint paths between two groups of vertices." +msgid "`Wikipedia: Graph coloring `__" msgstr "" -msgid "New **proposed** function:" +msgid "``pgr_edgeDisjointPaths``" +msgstr "" + +msgid "``pgr_edgeDisjointPaths`` — Calculates edge disjoint paths between two groups of vertices." msgstr "" msgid "pgr_edgeDisjointPaths(Combinations)" @@ -9952,7 +9658,7 @@ 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." msgstr "" -msgid "``pgr_edmondsKarp`` (`Combinations`_)" +msgid "pgr_edmondsKarp(Combinations)" msgstr "" msgid "Renamed from ``pgr_maxFlowEdmondsKarp``" @@ -9976,31 +9682,19 @@ msgstr "" msgid "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -msgid "https://www.boost.org/libs/graph/doc/edmonds_karp_max_flow.html" +msgid "`Boost: edmonds_karp_max_flow `__" msgstr "" msgid "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm" msgstr "" -msgid "``pgr_edwardMoore - Experimental``" +msgid "``pgr_edwardMoore`` - Experimental" msgstr "" msgid "``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore algorithm." msgstr "" -msgid "``pgr_edwardMoore`` (`Combinations`_)" -msgstr "" - -msgid "``pgr_edwardMoore`` (`One to One`_)" -msgstr "" - -msgid "``pgr_edwardMoore`` (`One to Many`_)" -msgstr "" - -msgid "``pgr_edwardMoore`` (`Many to One`_)" -msgstr "" - -msgid "``pgr_edwardMoore`` (`Many to Many`_)" +msgid "pgr_edwardMoore(Combinations)" msgstr "" msgid "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." @@ -10045,7 +9739,7 @@ msgstr "" msgid "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm" msgstr "" -msgid "pgr_extractVertices -- Proposed" +msgid "``pgr_extractVertices`` -- Proposed" msgstr "" msgid "``pgr_extractVertices`` — Extracts the vertices information" @@ -10132,21 +9826,12 @@ msgstr "" msgid "To get the query generated used to get the vertex information, use ``dryrun := true``." msgstr "" -msgid "``pgr_findCloseEdges``" +msgid "``pgr_findCloseEdges`` - Proposed" msgstr "" msgid "``pgr_findCloseEdges`` - Finds the close edges to a point geometry." msgstr "" -msgid "New **proposed** signatures:" -msgstr "" - -msgid "``pgr_findCloseEdges`` (`One point`_)" -msgstr "" - -msgid "``pgr_findCloseEdges`` (`Many points`_)" -msgstr "" - msgid "``pgr_findCloseEdges`` - An utility function that finds the closest edge to a point geometry." msgstr "" @@ -10174,6 +9859,9 @@ msgstr "" msgid "One point" msgstr "" +msgid "**options:** [cap, partial, dryrun]``" +msgstr "" + msgid "Default: ``cap => 1``" msgstr "" @@ -10540,18 +10228,12 @@ msgstr "" msgid "Boost `floyd-Warshall `_" msgstr "" -msgid "Queries uses the :doc:`sampledata` network." -msgstr "" - msgid "``pgr_full_version``" msgstr "" msgid "``pgr_full_version`` — Get the details of pgRouting version information." msgstr "" -msgid "New **official** function" -msgstr "" - msgid "Get complete details of pgRouting version information" msgstr "" @@ -10618,13 +10300,10 @@ msgstr "" msgid "Git hash of pgRouting build" msgstr "" -msgid "``pgr_hawickCircuits - Experimental``" +msgid "``pgr_hawickCircuits`` - Experimental" msgstr "" -msgid "``pgr_hawickCircuits`` — Returns the list of cirucits using hawick circuits algorithm." -msgstr "" - -msgid "``pgr_hawickCircuits``" +msgid "``pgr_hawickCircuits`` — Returns the list of ciruits 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." @@ -10723,7 +10402,7 @@ msgstr "" msgid "The new graph is not planar because it has a :math:`K_5` subgraph. Edges in blue represent :math:`K_5` subgraph." msgstr "" -msgid "https://www.boost.org/libs/graph/doc/boyer_myrvold.html" +msgid "`Boost: Boyer Myrvold `__" msgstr "" msgid "``pgr_johnson``" @@ -10765,6 +10444,9 @@ msgstr "" msgid "``pgr_kruskalBFS`` — Kruskal's algorithm for Minimum Spanning Tree with breadth First Search ordering." msgstr "" +msgid "Added ``pred`` result columns." +msgstr "" + msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm." msgstr "" @@ -10825,7 +10507,7 @@ msgstr "" msgid "pgr_kruskalDFS(`Edges SQL`_, **root vids**, [``max_depth``])" msgstr "" -msgid "pgr_lengauerTarjanDominatorTree -Experimental" +msgid "``pgr_lengauerTarjanDominatorTree`` - Experimental" msgstr "" msgid "``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all vertices." @@ -10876,18 +10558,21 @@ msgstr "" msgid "Dominator tree of another component." msgstr "" -msgid "`Boost: Lengauer-Tarjan dominator tree algorithm `__" +msgid "`Boost: Lengauer-Tarjan dominator `__" msgstr "" msgid "`Wikipedia: dominator tree `__" msgstr "" -msgid "pgr_lineGraph - Proposed" +msgid "``pgr_lineGraph`` - Proposed" msgstr "" msgid "``pgr_lineGraph`` — Transforms the given graph into its corresponding edge-based graph." msgstr "" +msgid "Works for directed and undirected graphs." +msgstr "" + msgid "Given a graph :math:`G`, its line graph :math:`L(G)` is a graph such that:" msgstr "" @@ -11098,7 +10783,7 @@ msgstr "" msgid "Full line graph of subgraph of edges :math:`\\{4, 7, 8, 10\\}`" msgstr "" -msgid "The examples of this section are based on the :doc:`sampledata` network. The examples include the subgraph including edges 4, 7, 8, and 10 with ``reverse_cost``." +msgid "The examples include the subgraph including edges 4, 7, 8, and 10 with ``reverse_cost``." msgstr "" msgid "The data" @@ -11275,25 +10960,28 @@ msgstr "" msgid "Returns set of |result-component-make|" msgstr "" -msgid "Query done on :doc:`sampledata` network gives the list of edges that are needed to connect the graph." +msgid "List of edges that are needed to connect the graph." msgstr "" -msgid "https://www.boost.org/libs/graph/doc/make_connected.html" +msgid "`Boost: make connected `__" msgstr "" -msgid "pgr_maxCardinalityMatch" +msgid "``pgr_maxCardinalityMatch``" msgstr "" msgid "``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a graph." msgstr "" +msgid "pgr_maxCardinalityMatch(text) returns only ``edge`` column." +msgstr "" + msgid "Deprecated signature" msgstr "" -msgid "``pgr_maxCardinalityMatch(text,boolean)``" +msgid "pgr_maxCardinalityMatch(text,boolean)" msgstr "" -msgid "``directed => false`` when used." +msgid "directed => ``false`` when used." msgstr "" msgid "Renamed from ``pgr_maximumCardinalityMatching``" @@ -11335,7 +11023,7 @@ msgstr "" msgid "Identifier of the edge in the original query." msgstr "" -msgid "https://www.boost.org/libs/graph/doc/maximum_matching.html" +msgid "`Boost: maximum_matching `__" msgstr "" msgid "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29" @@ -11350,10 +11038,7 @@ 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." msgstr "" -msgid "``pgr_maxFlow`` (`Combinations`_)" -msgstr "" - -msgid "New **Proposed** function" +msgid "pgr_maxFlow(Combinations)" msgstr "" msgid "Calculates the maximum flow from the sources to the targets." @@ -11389,7 +11074,7 @@ msgstr "" msgid "Maximum flow possible from the source(s) to the target(s)" msgstr "" -msgid "https://www.boost.org/libs/graph/doc/push_relabel_max_flow.html" +msgid "`Boost: push relabel max flow `__" msgstr "" msgid "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm" @@ -11401,7 +11086,10 @@ msgstr "" msgid "``pgr_maxFlowMinCost`` — Calculates the edges that minimizes the total cost of the maximum flow on a graph" msgstr "" -msgid "``pgr_maxFlowMinCost`` (`Combinations`_)" +msgid "pgr_maxFlowMinCost(Combinations)" +msgstr "" + +msgid "|boost| graph inside." msgstr "" msgid "**TODO** check which statement is true:" @@ -11443,16 +11131,13 @@ msgstr "" msgid "Returns set of |result-flow-mincost|" msgstr "" -msgid "https://www.boost.org/libs/graph/doc/successive_shortest_path_nonnegative_weights.html" -msgstr "" - msgid "``pgr_maxFlowMinCost_Cost`` - Experimental" msgstr "" msgid "``pgr_maxFlowMinCost_Cost`` — Calculates the minimum total cost of the maximum flow on a graph" msgstr "" -msgid "``pgr_maxFlowMinCost_Cost`` (`Combinations`_)" +msgid "pgr_maxFlowMinCost_Cost(Combinations)" msgstr "" msgid "**The cost value of all input edges must be nonnegative.**" @@ -11485,7 +11170,7 @@ msgstr "" msgid "Minimum Cost Maximum Flow possible from the source(s) to the target(s)" msgstr "" -msgid "pgr_nodeNetwork" +msgid "``pgr_nodeNetwork``" msgstr "" msgid "``pgr_nodeNetwork`` - Nodes an network edge table." @@ -11944,7 +11629,7 @@ 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." msgstr "" -msgid "``pgr_pushRelabel`` (`Combinations`_)" +msgid "pgr_pushRelabel(Combinations)" msgstr "" msgid "Renamed from ``pgr_maxFlowPushRelabel``" @@ -11965,15 +11650,12 @@ msgstr "" msgid "pgr_pushRelabel(`Edges SQL`_, `Combinations SQL`_)" msgstr "" -msgid "pgr_sequentialVertexColoring - Proposed" +msgid "``pgr_sequentialVertexColoring`` - Proposed" msgstr "" msgid "``pgr_sequentialVertexColoring`` — Returns the vertex coloring of an undirected graph, using greedy approach." msgstr "" -msgid "Promoted to **proposed** signature" -msgstr "" - msgid "Sequential vertex coloring algorithm is a graph coloring algorithm in which color identifiers are assigned to the vertices of a graph in a sequential manner, such that no edge connects two identically colored vertices." msgstr "" @@ -12007,7 +11689,10 @@ msgstr "" msgid "pgr_sequentialVertexColoring(`Edges SQL`_)" msgstr "" -msgid "pgr_stoerWagner - Experimental" +msgid "`Boost: Sequential Vertex Coloring `__" +msgstr "" + +msgid "``pgr_stoerWagner`` - Experimental" msgstr "" msgid "``pgr_stoerWagner`` — The min-cut of graph using stoerWagner algorithm." @@ -12076,6 +11761,9 @@ msgstr "" msgid "Using :doc:`pgr_connectedComponents`" msgstr "" +msgid "`Boost: Stoer Wagner min cut `__" +msgstr "" + msgid "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm" msgstr "" @@ -12100,7 +11788,7 @@ msgstr "" msgid "The strong components of the graph" msgstr "" -msgid "Boost: `Strong components `__" +msgid "`Boost: Strong components `__" msgstr "" msgid "wikipedia: `Strongly connected component `__" @@ -12154,6 +11842,9 @@ msgstr "" msgid "Graph is not a DAG" msgstr "" +msgid "`Boost: topological sort `__" +msgstr "" + msgid "``pgr_transitiveClosure`` - Experimental" msgstr "" @@ -12205,55 +11896,55 @@ msgstr "" msgid "Identifiers of the vertices that are reachable from vertex v." msgstr "" -msgid "https://en.wikipedia.org/wiki/Transitive_closure" +msgid "`Boost: transitive closure `__" msgstr "" -msgid "pgr_trsp - Proposed" +msgid "https://en.wikipedia.org/wiki/Transitive_closure" msgstr "" -msgid "``pgr_trsp`` - routing vertices with restrictions." +msgid "``pgr_trsp`` - Proposed" msgstr "" -msgid "New proposed signatures" +msgid "``pgr_trsp`` - routing vertices with restrictions." msgstr "" -msgid "``pgr_trsp`` (`One to One`_)" +msgid "pgr_trsp(One to One)" msgstr "" -msgid "``pgr_trsp`` (`One to Many`_)" +msgid "pgr_trsp(One to Many)" msgstr "" -msgid "``pgr_trsp`` (`Many to One`_)" +msgid "pgr_trsp(Many to One)" msgstr "" -msgid "``pgr_trsp`` (`Many to Many`_)" +msgid "pgr_trsp(Many to Many)" msgstr "" -msgid "``pgr_trsp`` (`Combinations`_)" +msgid "pgr_trsp(Combinations)" msgstr "" msgid "Deprecated signatures" msgstr "" -msgid "``pgr_trsp(text,integer,integer,boolean,boolean,text)``" +msgid "pgr_trsp(text,integer,integer,boolean,boolean,text)" msgstr "" -msgid "``pgr_trsp(text,integer,float,integer,float,boolean,boolean,text)``" +msgid "pgr_trsp(text,integer,float,integer,float,boolean,boolean,text)" msgstr "" -msgid "``pgr_trspViaVertices(text,anyarray,boolean,boolean,text)``" +msgid "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)" msgstr "" -msgid "``pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)``" +msgid "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)" msgstr "" msgid "New prototypes" msgstr "" -msgid "``pgr_trspViaVertices``" +msgid "pgr_trspViaVertices" msgstr "" -msgid "``pgr_trspViaEdges``" +msgid "pgr_trspViaEdges" msgstr "" msgid "Turn restricted shortest path (TRSP) is an algorithm that receives turn restrictions in form of a query like those found in real world navigable road networks." @@ -12313,12 +12004,6 @@ msgstr "" msgid "``pgr_trspVia`` Route that goes through a list of vertices with restrictions." msgstr "" -msgid "New proposed function:" -msgstr "" - -msgid "``pgr_trspVia`` (`One Via`_)" -msgstr "" - msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths." msgstr "" @@ -12382,9 +12067,6 @@ msgstr "" msgid "``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/or points with restrictions." msgstr "" -msgid "``pgr_trspVia_withPoints`` (`One Via`_)" -msgstr "" - msgid "Given a graph, a set of restriction on the graph edges, a set of points on the graphs edges and a list of vertices, this function is equivalent to 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 "" @@ -12508,30 +12190,12 @@ 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." msgstr "" -msgid "pgr_trsp_withPoints - Proposed" +msgid "``pgr_trsp_withPoints`` - Proposed" msgstr "" msgid "``pgr_trsp_withPoints`` Routing Vertex/Point with restrictions." msgstr "" -msgid "New proposed signatures:" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (`One to One`_)" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (`One to Many`_)" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (`Many to One`_)" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (`Many to Many`_)" -msgstr "" - -msgid "``pgr_trsp_withPoints`` (`Combinations`_)" -msgstr "" - msgid "Modify the graph to include points defined by points_sql. Using Dijkstra algorithm, find the shortest path" msgstr "" @@ -12613,15 +12277,12 @@ msgstr "" msgid "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" +msgid "``pgr_turnRestrictedPath`` - Experimental" msgstr "" msgid "``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex - Vertex routing with restrictions" msgstr "" -msgid "New experimental function" -msgstr "" - msgid "Using Yen's algorithm to obtain K shortest paths and analyze the paths to select the paths that do not use the restrictions" msgstr "" @@ -12688,7 +12349,7 @@ msgstr "" msgid "pgRouting Version for this documentation" msgstr "" -msgid "pgr_vrpOneDepot - Experimental" +msgid "``pgr_vrpOneDepot`` - Experimental" msgstr "" msgid "**No documentation available**" @@ -12946,7 +12607,10 @@ msgstr "" msgid "Signature change: ``driving_side`` parameter changed from named optional to unnamed compulsory **driving side**." msgstr "" -msgid "``pgr_withPointsDD`` (`Single vertex`)" +msgid "pgr_withPointsDD(Single vertex)" +msgstr "" + +msgid "pgr_withPointsDD(Multiple vertices)" msgstr "" msgid "Added ``depth``, ``pred`` and ``start_vid`` column." @@ -12961,10 +12625,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." @@ -13045,7 +12709,7 @@ msgstr "" msgid ":doc:`pgr_alphaShape`" msgstr "" -msgid "pgr_withPointsKSP - Proposed" +msgid "``pgr_withPointsKSP`` - Proposed" msgstr "" msgid "``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra." @@ -13054,25 +12718,22 @@ msgstr "" msgid "Standarizing output columns to |nksp-result|" msgstr "" -msgid "``pgr_withPointsKSP`` (One to One)" +msgid "pgr_withPointsKSP(One to One)" msgstr "" -msgid "New overload functions" +msgid "pgr_withPointsKSP(One to Many)" msgstr "" -msgid "``pgr_withPointsKSP`` (One to Many)" +msgid "pgr_withPointsKSP(Many to One)" msgstr "" -msgid "``pgr_withPointsKSP`` (Many to One)" +msgid "pgr_withPointsKSP(Many to Many)" msgstr "" -msgid "``pgr_withPointsKSP`` (Many to Many)" +msgid "pgr_withPointsKSP(Combinations)" 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." @@ -13165,9 +12826,6 @@ msgstr "" msgid "``pgr_withPointsVia`` - Route that goes through a list of vertices and/or points." msgstr "" -msgid "New **proposed** function ``pgr_withPointsVia`` (`One Via`_)" -msgstr "" - msgid "Given a graph, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`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 "" @@ -13234,15 +12892,6 @@ msgstr "" msgid ":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph." msgstr "" -msgid ":doc:`pgr_withPointsVia`" -msgstr "" - -msgid ":doc:`pgr_trspVia`" -msgstr "" - -msgid ":doc:`pgr_trspVia_withPoints`" -msgstr "" - msgid ":doc:`withPoints-family` - Functions based on Dijkstra algorithm." msgstr "" @@ -13273,21 +12922,126 @@ msgstr "" msgid "Minors 3.x" msgstr "" +msgid "pgRouting 3.8" +msgstr "" + msgid "pgRouting 3.7" msgstr "" -msgid "pgRouting 3.6" +msgid "pgRouting 3.7.3 Release Notes" msgstr "" -msgid "pgRouting 3.6.3 Release Notes" +msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.7.3 `__" msgstr "" -msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.6.3 `__" +msgid "`#2731 `__ Build Failure on Ubuntu 22" +msgstr "" + +msgid "pgRouting 3.7.2 Release Notes" +msgstr "" + +msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.7.2 `__" msgstr "" msgid "Build" msgstr "" +msgid "`#2713 `__ cmake missing some policies and min version" +msgstr "" + +msgid "Using OLD policies: CMP0148, CMP0144, CMP0167" +msgstr "" + +msgid "Minimum cmake version 3.12" +msgstr "" + +msgid "`#2707 `__ Build failure in pgRouting 3.7.1 on Alpine" +msgstr "" + +msgid "`#2706 `__ winnie crashing on pgr_betweennessCentrality" +msgstr "" + +msgid "pgRouting 3.7.1 Release Notes" +msgstr "" + +msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.7.1 `__" +msgstr "" + +msgid "`#2680 `__ fails to compile under mingw64 gcc 13.2" +msgstr "" + +msgid "`#2689 `__ When point is a vertex, the withPoints family do not return results." +msgstr "" + +msgid "C/C++ code enhancemet" +msgstr "" + +msgid "TRSP family" +msgstr "" + +msgid "pgRouting 3.7.0 Release Notes" +msgstr "" + +msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.7.0 `__" +msgstr "" + +msgid "`#2656 `__ Stop support of PostgreSQL12 on pgrouting v3.7" +msgstr "" + +msgid "Stopping support of PostgreSQL 12" +msgstr "" + +msgid "CI does not test for PostgreSQL 12" +msgstr "" + +msgid "New experimental functions" +msgstr "" + +msgid "Metrics" +msgstr "" + +msgid "pgr_betweennessCentrality" +msgstr "" + +msgid "Official functions changes" +msgstr "" + +msgid "`#2605 `__ Standarize spanning tree functions output" +msgstr "" + +msgid "Functions:" +msgstr "" + +msgid "Experimental promoted to proposed." +msgstr "" + +msgid "`#2635 `__ pgr_LineGraph ignores directed flag and use negative values for identifiers." +msgstr "" + +msgid "``pgr_lineGraph``" +msgstr "" + +msgid "Code enhancement" +msgstr "" + +msgid "`#2599 `__ Driving distance cleanup" +msgstr "" + +msgid "`#2607 `__ Read postgresql data on C++" +msgstr "" + +msgid "`#2614 `__ Clang tidy does not work" +msgstr "" + +msgid "pgRouting 3.6" +msgstr "" + +msgid "pgRouting 3.6.3 Release Notes" +msgstr "" + +msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.6.3 `__" +msgstr "" + msgid "Explicit minimum requirements:" msgstr "" @@ -13378,31 +13132,13 @@ msgstr "" msgid "`#2516 `__ Standarize output pgr_aStar" msgstr "" -msgid "``pgr_aStar`` (`One to One`) added ``start_vid`` and ``end_vid`` columns." -msgstr "" - -msgid "``pgr_aStar`` (`One to Many`) added ``end_vid`` column." -msgstr "" - -msgid "``pgr_aStar`` (`Many to One`) added ``start_vid`` column." -msgstr "" - msgid "`#2523 `__ Standarize output pgr_bdAstar" msgstr "" -msgid "``pgr_bdAstar`` (`One to One`) added ``start_vid`` and ``end_vid`` columns." -msgstr "" - -msgid "``pgr_bdAstar`` (`One to Many`) added ``end_vid`` column." -msgstr "" - -msgid "``pgr_bdAstar`` (`Many to One`) added ``start_vid`` column." -msgstr "" - msgid "`#2547 `__ Standarize output and modifying signature pgr_KSP" msgstr "" -msgid "`#2548 `__ Standarize output pgr_drivingdistance" +msgid "`#2548 `__ Standarize output pgr_drivingDistance" msgstr "" msgid "Proposed functions changes" @@ -13516,15 +13252,6 @@ msgstr "" msgid "Dijkstra" msgstr "" -msgid "``pgr_dijkstra`` (`One to One`) added ``start_vid`` and ``end_vid`` columns." -msgstr "" - -msgid "``pgr_dijkstra`` (`One to Many`) added ``end_vid`` column." -msgstr "" - -msgid "``pgr_dijkstra`` (`Many to One`) added ``start_vid`` column." -msgstr "" - msgid "pgRouting 3.4" msgstr "" @@ -13561,13 +13288,13 @@ msgstr "" msgid "`#1891 `__: pgr_ksp doesn't give all correct shortest path" msgstr "" -msgid "New proposed functions" +msgid "New proposed functions." msgstr "" msgid "With points" msgstr "" -msgid "``pgr_withPointsVia`` (One Via)" +msgid "pgr_withPointsVia(One Via)" msgstr "" msgid "Turn Restrictions" @@ -13576,88 +13303,73 @@ msgstr "" msgid "Via with turn restrictions" msgstr "" -msgid "``pgr_trspVia`` (One Via)" -msgstr "" - -msgid "``pgr_trspVia_withPoints`` (One Via)" -msgstr "" - -msgid "``pgr_trsp``" -msgstr "" - -msgid "``pgr_trsp`` (One to One)" -msgstr "" - -msgid "``pgr_trsp`` (One to Many)" -msgstr "" - -msgid "``pgr_trsp`` (Many to One)" +msgid "pgr_trspVia(One Via)" msgstr "" -msgid "``pgr_trsp`` (Many to Many)" +msgid "pgr_trspVia_withPoints(One Via)" msgstr "" -msgid "``pgr_trsp`` (Combinations)" +msgid "pgr_trsp" msgstr "" msgid "``pgr_trsp_withPoints``" msgstr "" -msgid "``pgr_trsp_withPoints`` (One to One)" +msgid "pgr_trsp_withPoints(One to One)" msgstr "" -msgid "``pgr_trsp_withPoints`` (One to Many)" +msgid "pgr_trsp_withPoints(One to Many)" msgstr "" -msgid "``pgr_trsp_withPoints`` (Many to One)" +msgid "pgr_trsp_withPoints(Many to One)" msgstr "" -msgid "``pgr_trsp_withPoints`` (Many to Many)" +msgid "pgr_trsp_withPoints(Many to Many)" msgstr "" -msgid "``pgr_trsp_withPoints`` (Combinations)" +msgid "pgr_trsp_withPoints(Combinations)" msgstr "" msgid "Topology" msgstr "" -msgid "``pgr_degree``" -msgstr "" - msgid "Utilities" msgstr "" -msgid "``pgr_findCloseEdges`` (One point)" +msgid "pgr_findCloseEdges(One point)" msgstr "" -msgid "``pgr_findCloseEdges`` (Many points)" +msgid "pgr_findCloseEdges(Many points)" msgstr "" msgid "Ordering" msgstr "" -msgid "``pgr_cuthillMckeeOrdering``" +msgid "pgr_cuthillMckeeOrdering" msgstr "" msgid "Unclassified" msgstr "" +msgid "pgr_hawickCircuits" +msgstr "" + msgid "Flow functions" msgstr "" -msgid "``pgr_maxCardinalityMatch(text)``" +msgid "pgr_maxCardinalityMatch(text)" msgstr "" -msgid "Deprecating ``pgr_maxCardinalityMatch(text,boolean)``" +msgid "Deprecating: pgr_maxCardinalityMatch(text,boolean)" msgstr "" msgid "Deprecated Functions" msgstr "" -msgid "``pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)``" +msgid "pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)" msgstr "" -msgid "``pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text)``" +msgid "pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text)" msgstr "" msgid "pgRouting 3.3" @@ -13861,12 +13573,6 @@ msgstr "" msgid "Removing support for Boost v1.53, v1.54 & v1.55" msgstr "" -msgid "pgr_bellmanFord(Combinations)" -msgstr "" - -msgid "pgr_binaryBreadthFirstSearch(Combinations)" -msgstr "" - msgid "pgr_bipartite" msgstr "" @@ -13876,9 +13582,6 @@ msgstr "" msgid "Dijkstra Near" msgstr "" -msgid "pgr_edwardMoore(Combinations)" -msgstr "" - msgid "pgr_isPlanar" msgstr "" @@ -13888,51 +13591,15 @@ msgstr "" msgid "pgr_makeConnected" msgstr "" -msgid "pgr_maxFlowMinCost(Combinations)" -msgstr "" - -msgid "pgr_maxFlowMinCost_Cost(Combinations)" -msgstr "" - msgid "Astar" msgstr "" -msgid "pgr_aStar(Combinations)" -msgstr "" - -msgid "pgr_aStarCost(Combinations)" -msgstr "" - msgid "Bidirectional Astar" msgstr "" -msgid "pgr_bdAstar(Combinations)" -msgstr "" - -msgid "pgr_bdAstarCost(Combinations)" -msgstr "" - msgid "Bidirectional Dijkstra" msgstr "" -msgid "pgr_bdDijkstra(Combinations)" -msgstr "" - -msgid "pgr_bdDijkstraCost(Combinations)" -msgstr "" - -msgid "pgr_boykovKolmogorov(Combinations)" -msgstr "" - -msgid "pgr_edmondsKarp(Combinations)" -msgstr "" - -msgid "pgr_maxFlow(Combinations)" -msgstr "" - -msgid "pgr_pushRelabel(Combinations)" -msgstr "" - msgid "pgRouting 3.1" msgstr "" @@ -14092,7 +13759,7 @@ msgstr "" msgid "`#1006 `__: No loss of information" msgstr "" -msgid "New functions" +msgid "New Functions" msgstr "" msgid "Kruskal family" @@ -14131,148 +13798,94 @@ msgstr "" msgid "aStar Family" msgstr "" -msgid "pgr_aStar(one to many)" -msgstr "" - -msgid "pgr_aStar(many to one)" -msgstr "" - -msgid "pgr_aStar(many to many)" -msgstr "" - -msgid "pgr_aStarCost(one to one)" -msgstr "" - -msgid "pgr_aStarCost(one to many)" +msgid "pgr_aStarCost(One to One)" msgstr "" -msgid "pgr_aStarCost(many to one)" +msgid "pgr_aStarCost(One to Many)" msgstr "" -msgid "pgr_aStarCost(many to many)" +msgid "pgr_aStarCost(Many to One)" msgstr "" -msgid "pgr_aStarCostMatrix(one to one)" +msgid "pgr_aStarCost(Many to Many)" msgstr "" -msgid "pgr_aStarCostMatrix(one to many)" -msgstr "" - -msgid "pgr_aStarCostMatrix(many to one)" -msgstr "" - -msgid "pgr_aStarCostMatrix(many to many)" +msgid "pgr_aStarCostMatrix" msgstr "" msgid "bdAstar Family" msgstr "" -msgid "pgr_bdAstar(one to many)" -msgstr "" - -msgid "pgr_bdAstar(many to one)" +msgid "pgr_bdAstarCost(One to One)" msgstr "" -msgid "pgr_bdAstar(many to many)" +msgid "pgr_bdAstarCost(One to Many)" msgstr "" -msgid "pgr_bdAstarCost(one to one)" +msgid "pgr_bdAstarCost(Many to One)" msgstr "" -msgid "pgr_bdAstarCost(one to many)" +msgid "pgr_bdAstarCost(Many to Many)" msgstr "" -msgid "pgr_bdAstarCost(many to one)" -msgstr "" - -msgid "pgr_bdAstarCost(many to many)" -msgstr "" - -msgid "pgr_bdAstarCostMatrix(one to one)" -msgstr "" - -msgid "pgr_bdAstarCostMatrix(one to many)" -msgstr "" - -msgid "pgr_bdAstarCostMatrix(many to one)" -msgstr "" - -msgid "pgr_bdAstarCostMatrix(many to many)" +msgid "pgr_bdAstarCostMatrix" msgstr "" msgid "bdDijkstra Family" msgstr "" -msgid "pgr_bdDijkstra(one to many)" -msgstr "" - -msgid "pgr_bdDijkstra(many to one)" +msgid "pgr_bdDijkstraCost(One to One)" msgstr "" -msgid "pgr_bdDijkstra(many to many)" +msgid "pgr_bdDijkstraCost(One to Many)" msgstr "" -msgid "pgr_bdDijkstraCost(one to one)" +msgid "pgr_bdDijkstraCost(Many to One)" msgstr "" -msgid "pgr_bdDijkstraCost(one to many)" +msgid "pgr_bdDijkstraCost(Many to Many)" msgstr "" -msgid "pgr_bdDijkstraCost(many to one)" -msgstr "" - -msgid "pgr_bdDijkstraCost(many to many)" -msgstr "" - -msgid "pgr_bdDijkstraCostMatrix(one to one)" -msgstr "" - -msgid "pgr_bdDijkstraCostMatrix(one to many)" -msgstr "" - -msgid "pgr_bdDijkstraCostMatrix(many to one)" -msgstr "" - -msgid "pgr_bdDijkstraCostMatrix(many to many)" +msgid "pgr_bdDijkstraCostMatrix" msgstr "" msgid "Flow Family" msgstr "" -msgid "pgr_pushRelabel(one to one)" +msgid "pgr_pushRelabel(One to One)" msgstr "" -msgid "pgr_pushRelabel(one to many)" +msgid "pgr_pushRelabel(One to Many)" msgstr "" -msgid "pgr_pushRelabel(many to one)" +msgid "pgr_pushRelabel(Many to One)" msgstr "" -msgid "pgr_pushRelabel(many to many)" +msgid "pgr_pushRelabel(Many to Many)" msgstr "" -msgid "pgr_edmondsKarp(one to one)" +msgid "pgr_edmondsKarp(One to One)" msgstr "" -msgid "pgr_edmondsKarp(one to many)" +msgid "pgr_edmondsKarp(One to Many)" msgstr "" -msgid "pgr_edmondsKarp(many to one)" +msgid "pgr_edmondsKarp(Many to One)" msgstr "" -msgid "pgr_edmondsKarp(many to many)" +msgid "pgr_edmondsKarp(Many to Many)" msgstr "" -msgid "pgr_boykovKolmogorov (one to one)" +msgid "pgr_boykovKolmogorov (One to One)" msgstr "" -msgid "pgr_boykovKolmogorov (one to many)" +msgid "pgr_boykovKolmogorov (One to Many)" msgstr "" -msgid "pgr_boykovKolmogorov (many to one)" +msgid "pgr_boykovKolmogorov (Many to One)" msgstr "" -msgid "pgr_boykovKolmogorov (many to many)" +msgid "pgr_boykovKolmogorov (Many to Many)" msgstr "" msgid "pgr_maxCardinalityMatching" @@ -14281,21 +13894,24 @@ msgstr "" msgid "pgr_maxFlow" msgstr "" -msgid "pgr_edgeDisjointPaths(one to one)" +msgid "pgr_edgeDisjointPaths(One to One)" msgstr "" -msgid "pgr_edgeDisjointPaths(one to many)" +msgid "pgr_edgeDisjointPaths(One to Many)" msgstr "" -msgid "pgr_edgeDisjointPaths(many to one)" +msgid "pgr_edgeDisjointPaths(Many to One)" msgstr "" -msgid "pgr_edgeDisjointPaths(many to many)" +msgid "pgr_edgeDisjointPaths(Many to Many)" msgstr "" msgid "Components family" msgstr "" +msgid "pgr_connectedComponents" +msgstr "" + msgid "pgr_strongComponents" msgstr "" @@ -14461,7 +14077,7 @@ msgstr "" msgid "pgr_johnson" msgstr "" -msgid "pgr_astar" +msgid "pgr_aStar" msgstr "" msgid "pgr_bdAstar" @@ -14482,6 +14098,9 @@ msgstr "" msgid "pgr_drivingDistance" msgstr "" +msgid "pgr_KSP" +msgstr "" + msgid "pgr_dijkstraVia (proposed)" msgstr "" @@ -14653,22 +14272,13 @@ msgstr "" msgid "Parameter names changed" msgstr "" -msgid "The many version results are the union of the one to one version" +msgid "The many version results are the union of the One to One version" msgstr "" msgid "New Signatures" msgstr "" -msgid "pgr_bdAstar(one to one)" -msgstr "" - -msgid "New Proposed functions" -msgstr "" - -msgid "pgr_bdAstarCostMatrix" -msgstr "" - -msgid "pgr_bdDijkstraCostMatrix" +msgid "pgr_bdAstar(One to One)" msgstr "" msgid "pgr_lineGraph" @@ -14740,31 +14350,7 @@ msgstr "" msgid "pgr_bdDijkstra" msgstr "" -msgid "New Proposed Signatures" -msgstr "" - -msgid "pgr_astar(one to many)" -msgstr "" - -msgid "pgr_astar(many to one)" -msgstr "" - -msgid "pgr_astar(many to many)" -msgstr "" - -msgid "pgr_astarCost(one to one)" -msgstr "" - -msgid "pgr_astarCost(one to many)" -msgstr "" - -msgid "pgr_astarCost(many to one)" -msgstr "" - -msgid "pgr_astarCost(many to many)" -msgstr "" - -msgid "pgr_astarCostMatrix" +msgid "Deprecated signatures." msgstr "" msgid "pgr_bddijkstra - use pgr_bdDijkstra instead" @@ -14827,52 +14413,46 @@ msgstr "" msgid "pgr_TSP" msgstr "" -msgid "pgr_aStar" -msgstr "" - -msgid "New Functions" -msgstr "" - msgid "pgr_eucledianTSP" msgstr "" msgid "pgr_withPointsCostMatrix" msgstr "" -msgid "pgr_maxFlowPushRelabel(one to one)" +msgid "pgr_maxFlowPushRelabel(One to One)" msgstr "" -msgid "pgr_maxFlowPushRelabel(one to many)" +msgid "pgr_maxFlowPushRelabel(One to Many)" msgstr "" -msgid "pgr_maxFlowPushRelabel(many to one)" +msgid "pgr_maxFlowPushRelabel(Many to One)" msgstr "" -msgid "pgr_maxFlowPushRelabel(many to many)" +msgid "pgr_maxFlowPushRelabel(Many to Many)" msgstr "" -msgid "pgr_maxFlowEdmondsKarp(one to one)" +msgid "pgr_maxFlowEdmondsKarp(One to One)" msgstr "" -msgid "pgr_maxFlowEdmondsKarp(one to many)" +msgid "pgr_maxFlowEdmondsKarp(One to Many)" msgstr "" -msgid "pgr_maxFlowEdmondsKarp(many to one)" +msgid "pgr_maxFlowEdmondsKarp(Many to One)" msgstr "" -msgid "pgr_maxFlowEdmondsKarp(many to many)" +msgid "pgr_maxFlowEdmondsKarp(Many to Many)" msgstr "" -msgid "pgr_maxFlowBoykovKolmogorov (one to one)" +msgid "pgr_maxFlowBoykovKolmogorov (One to One)" msgstr "" -msgid "pgr_maxFlowBoykovKolmogorov (one to many)" +msgid "pgr_maxFlowBoykovKolmogorov (One to Many)" msgstr "" -msgid "pgr_maxFlowBoykovKolmogorov (many to one)" +msgid "pgr_maxFlowBoykovKolmogorov (Many to One)" msgstr "" -msgid "pgr_maxFlowBoykovKolmogorov (many to many)" +msgid "pgr_maxFlowBoykovKolmogorov (Many to Many)" msgstr "" msgid "pgr_maximumCardinalityMatching" @@ -14884,7 +14464,7 @@ msgstr "" msgid "pgr_tsp - use pgr_TSP or pgr_eucledianTSP instead" msgstr "" -msgid "pgr_astar - use pgr_aStar instead" +msgid "pgr_aStar - use pgr_aStar instead" msgstr "" msgid "pgr_flip_edges" @@ -14956,6 +14536,9 @@ msgstr "" msgid "Improvements" msgstr "" +msgid "pgr_nodeNetwork" +msgstr "" + msgid "Adding a row_where and outall optional parameters" msgstr "" @@ -14968,43 +14551,43 @@ msgstr "" msgid "pgr_Johnson" msgstr "" -msgid "pgr_dijkstraCost(one to one)" +msgid "pgr_dijkstraCost(One to One)" msgstr "" -msgid "pgr_dijkstraCost(one to many)" +msgid "pgr_dijkstraCost(One to Many)" msgstr "" -msgid "pgr_dijkstraCost(many to one)" +msgid "pgr_dijkstraCost(Many to One)" msgstr "" -msgid "pgr_dijkstraCost(many to many)" +msgid "pgr_dijkstraCost(Many to Many)" msgstr "" msgid "Proposed Functionality" msgstr "" -msgid "pgr_withPoints(one to one)" +msgid "pgr_withPoints(One to One)" msgstr "" -msgid "pgr_withPoints(one to many)" +msgid "pgr_withPoints(One to Many)" msgstr "" -msgid "pgr_withPoints(many to one)" +msgid "pgr_withPoints(Many to One)" msgstr "" -msgid "pgr_withPoints(many to many)" +msgid "pgr_withPoints(Many to Many)" msgstr "" -msgid "pgr_withPointsCost(one to one)" +msgid "pgr_withPointsCost(One to One)" msgstr "" -msgid "pgr_withPointsCost(one to many)" +msgid "pgr_withPointsCost(One to Many)" msgstr "" -msgid "pgr_withPointsCost(many to one)" +msgid "pgr_withPointsCost(Many to One)" msgstr "" -msgid "pgr_withPointsCost(many to many)" +msgid "pgr_withPointsCost(Many to Many)" msgstr "" msgid "pgr_withPointsDD(single vertex)" @@ -15046,25 +14629,10 @@ msgstr "" msgid "To see the issues closed by this release see the `Git closed issues for 2.1.0 `_ on Github." msgstr "" -msgid "pgr_dijkstra(one to many)" -msgstr "" - -msgid "pgr_dijkstra(many to one)" -msgstr "" - -msgid "pgr_dijkstra(many to many)" -msgstr "" - -msgid "pgr_drivingDistance(multiple vertices)" -msgstr "" - msgid "Refactored" msgstr "" -msgid "pgr_dijkstra(one to one)" -msgstr "" - -msgid "pgr_drivingDistance(single vertex)" +msgid "pgr_dijkstra(One to One)" msgstr "" msgid "pgr_alphaShape function now can generate better (multi)polygon with holes and alpha parameter." @@ -15652,7 +15220,7 @@ 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." msgstr "" -msgid "pgRouting suplies some functions to create a routing topology and to analyze the topology." +msgid "pgRouting supplies some functions to create a routing topology and to analyze the topology." msgstr "" msgid "Additional functions to create a graph:" diff --git a/locale/zh_Hans/LC_MESSAGES/index.po b/locale/zh_Hans/LC_MESSAGES/index.po index 768909a5b9d..dcb38e1c1a7 100644 --- a/locale/zh_Hans/LC_MESSAGES/index.po +++ b/locale/zh_Hans/LC_MESSAGES/index.po @@ -1,11 +1,11 @@ # SOME DESCRIPTIVE TITLE. -# Copyright (C) pgRouting Contributors - Version v3.7.2 +# Copyright (C) pgRouting Contributors - Version v3.8 # This file is distributed under the same license as the pgRouting package. # FIRST AUTHOR , YEAR. # msgid "" msgstr "" -"Project-Id-Version: pgRouting v3.7.2\n" +"Project-Id-Version: pgRouting v3.8\n" "Report-Msgid-Bugs-To: \n" "POT-Creation-Date: 2022-06-25 12:55-0500\n" "PO-Revision-Date: 2024-09-23 14:18+0000\n" diff --git a/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po b/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po index 7812a76b3ec..801fd089369 100644 --- a/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po +++ b/locale/zh_Hans/LC_MESSAGES/pgrouting_doc_strings.po @@ -1,5 +1,5 @@ # SOME DESCRIPTIVE TITLE. -# Copyright (C) pgRouting Contributors - Version v3.7.2 +# Copyright (C) pgRouting Contributors - Version v3.8 # This file is distributed under the same license as the pgRouting package. # Regina Obe , 2023. # Wangdapeng , 2023. @@ -9,7 +9,7 @@ # DeepL , 2024. msgid "" msgstr "" -"Project-Id-Version: pgRouting v3.7.2\n" +"Project-Id-Version: pgRouting v3.8\n" "Report-Msgid-Bugs-To: \n" "POT-Creation-Date: 2024-10-17 00:50+0000\n" "PO-Revision-Date: 2024-10-10 19:47+0000\n" diff --git a/sql/scripts/build-extension-update-files.pl b/sql/scripts/build-extension-update-files.pl index 8fa53588527..84894310b48 100755 --- a/sql/scripts/build-extension-update-files.pl +++ b/sql/scripts/build-extension-update-files.pl @@ -64,6 +64,7 @@ my $version_3_5 = qr/(3.5.[\d+])/; my $version_3_6 = qr/(3.6.[\d+])/; my $version_3_7 = qr/(3.7.[\d+])/; +my $version_3_8 = qr/(3.8.[\d+])/; # add minor here my $version_2 = qr/(2.[\d+].[\d+])/; @@ -73,7 +74,7 @@ my $mayor_format = qr/([\d+]).[\d+].[\d+]/; -my $current = $version_3_7; +my $current = $version_3_8; sub Usage { diff --git a/sql/sigs/pgrouting--3.8.sig b/sql/sigs/pgrouting--3.8.sig new file mode 100644 index 00000000000..460e9e69d68 --- /dev/null +++ b/sql/sigs/pgrouting--3.8.sig @@ -0,0 +1,344 @@ +pgr_alphashape(geometry,double precision) +_pgr_alphashape(text,double precision) +pgr_analyzegraph(text,double precision,text,text,text,text,text) +pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text) +_pgr_array_reverse(anyarray) +_pgr_articulationpoints(text) +pgr_articulationpoints(text) +pgr_astarcostmatrix(text,anyarray,boolean,integer,double precision,double precision) +pgr_astarcost(text,anyarray,anyarray,boolean,integer,double precision,double precision) +pgr_astarcost(text,anyarray,bigint,boolean,integer,double precision,double precision) +pgr_astarcost(text,bigint,anyarray,boolean,integer,double precision,double precision) +pgr_astarcost(text,bigint,bigint,boolean,integer,double precision,double precision) +pgr_astarcost(text,text,boolean,integer,double precision,double precision) +pgr_astar(text,anyarray,anyarray,boolean,integer,double precision,double precision) +_pgr_astar(text,anyarray,anyarray,boolean,integer,double precision,double precision,boolean,boolean) +pgr_astar(text,anyarray,bigint,boolean,integer,double precision,double precision) +pgr_astar(text,bigint,anyarray,boolean,integer,double precision,double precision) +pgr_astar(text,bigint,bigint,boolean,integer,double precision,double precision) +pgr_astar(text,text,boolean,integer,double precision,double precision) +_pgr_astar(text,text,boolean,integer,double precision,double precision,boolean) +pgr_bdastarcostmatrix(text,anyarray,boolean,integer,numeric,numeric) +pgr_bdastarcost(text,anyarray,anyarray,boolean,integer,numeric,numeric) +pgr_bdastarcost(text,anyarray,bigint,boolean,integer,numeric,numeric) +pgr_bdastarcost(text,bigint,anyarray,boolean,integer,numeric,numeric) +pgr_bdastarcost(text,bigint,bigint,boolean,integer,numeric,numeric) +pgr_bdastarcost(text,text,boolean,integer,numeric,numeric) +_pgr_bdastar(text,anyarray,anyarray,boolean,integer,double precision,double precision,boolean) +pgr_bdastar(text,anyarray,anyarray,boolean,integer,numeric,numeric) +pgr_bdastar(text,anyarray,bigint,boolean,integer,numeric,numeric) +pgr_bdastar(text,bigint,anyarray,boolean,integer,numeric,numeric) +pgr_bdastar(text,bigint,bigint,boolean,integer,numeric,numeric) +_pgr_bdastar(text,text,boolean,integer,double precision,double precision,boolean) +pgr_bdastar(text,text,boolean,integer,numeric,numeric) +pgr_bddijkstracostmatrix(text,anyarray,boolean) +pgr_bddijkstracost(text,anyarray,anyarray,boolean) +pgr_bddijkstracost(text,anyarray,bigint,boolean) +pgr_bddijkstracost(text,bigint,anyarray,boolean) +pgr_bddijkstracost(text,bigint,bigint,boolean) +pgr_bddijkstracost(text,text,boolean) +pgr_bddijkstra(text,anyarray,anyarray,boolean) +_pgr_bddijkstra(text,anyarray,anyarray,boolean,boolean) +pgr_bddijkstra(text,anyarray,bigint,boolean) +pgr_bddijkstra(text,bigint,anyarray,boolean) +pgr_bddijkstra(text,bigint,bigint,boolean) +pgr_bddijkstra(text,text,boolean) +_pgr_bddijkstra(text,text,boolean,boolean) +pgr_bellmanford(text,anyarray,anyarray,boolean) +_pgr_bellmanford(text,anyarray,anyarray,boolean,boolean) +pgr_bellmanford(text,anyarray,bigint,boolean) +pgr_bellmanford(text,bigint,anyarray,boolean) +pgr_bellmanford(text,bigint,bigint,boolean) +pgr_bellmanford(text,text,boolean) +_pgr_bellmanford(text,text,boolean,boolean) +_pgr_betweennesscentrality(text,boolean) +pgr_betweennesscentrality(text,boolean) +_pgr_biconnectedcomponents(text) +pgr_biconnectedcomponents(text) +_pgr_binarybreadthfirstsearch(text,anyarray,anyarray,boolean) +pgr_binarybreadthfirstsearch(text,anyarray,anyarray,boolean) +pgr_binarybreadthfirstsearch(text,anyarray,bigint,boolean) +pgr_binarybreadthfirstsearch(text,bigint,anyarray,boolean) +pgr_binarybreadthfirstsearch(text,bigint,bigint,boolean) +_pgr_binarybreadthfirstsearch(text,text,boolean) +pgr_binarybreadthfirstsearch(text,text,boolean) +_pgr_bipartite(text) +pgr_bipartite(text) +_pgr_boost_version() +pgr_boykovkolmogorov(text,anyarray,anyarray) +pgr_boykovkolmogorov(text,anyarray,bigint) +pgr_boykovkolmogorov(text,bigint,anyarray) +pgr_boykovkolmogorov(text,bigint,bigint) +pgr_boykovkolmogorov(text,text) +_pgr_breadthfirstsearch(text,anyarray,bigint,boolean) +pgr_breadthfirstsearch(text,anyarray,bigint,boolean) +pgr_breadthfirstsearch(text,bigint,bigint,boolean) +_pgr_bridges(text) +pgr_bridges(text) +_pgr_build_type() +_pgr_checkcolumn(text,text,text,boolean,boolean) +_pgr_checkquery(text) +_pgr_checkverttab(text,text[],integer,text) +pgr_chinesepostmancost(text) +pgr_chinesepostman(text) +_pgr_chinesepostman(text,boolean) +_pgr_compilation_date() +_pgr_compiler_version() +_pgr_connectedcomponents(text) +pgr_connectedcomponents(text) +_pgr_contraction(text,bigint[],integer,bigint[],boolean) +pgr_contraction(text,bigint[],integer,bigint[],boolean) +_pgr_createindex(text,text,text,integer,text) +_pgr_createindex(text,text,text,text,integer,text) +pgr_createtopology(text,double precision,text,text,text,text,text,boolean) +pgr_createverticestable(text,text,text,text,text) +_pgr_cuthillmckeeordering(text) +pgr_cuthillmckeeordering(text) +pgr_dagshortestpath(text,anyarray,anyarray) +_pgr_dagshortestpath(text,anyarray,anyarray,boolean,boolean) +pgr_dagshortestpath(text,anyarray,bigint) +pgr_dagshortestpath(text,bigint,anyarray) +pgr_dagshortestpath(text,bigint,bigint) +pgr_dagshortestpath(text,text) +_pgr_dagshortestpath(text,text,boolean,boolean) +pgr_degree(text,text,boolean) +_pgr_depthfirstsearch(text,anyarray,boolean,bigint) +pgr_depthfirstsearch(text,anyarray,boolean,bigint) +pgr_depthfirstsearch(text,bigint,boolean,bigint) +pgr_dijkstracostmatrix(text,anyarray,boolean) +pgr_dijkstracost(text,anyarray,anyarray,boolean) +pgr_dijkstracost(text,anyarray,bigint,boolean) +pgr_dijkstracost(text,bigint,anyarray,boolean) +pgr_dijkstracost(text,bigint,bigint,boolean) +pgr_dijkstracost(text,text,boolean) +pgr_dijkstranearcost(text,anyarray,anyarray,boolean,bigint,boolean) +pgr_dijkstranearcost(text,anyarray,bigint,boolean,bigint) +pgr_dijkstranearcost(text,bigint,anyarray,boolean,bigint) +pgr_dijkstranearcost(text,text,boolean,bigint,boolean) +_pgr_dijkstranear(text,anyarray,anyarray,bigint,boolean) +pgr_dijkstranear(text,anyarray,anyarray,boolean,bigint,boolean) +_pgr_dijkstranear(text,anyarray,bigint,bigint,boolean) +pgr_dijkstranear(text,anyarray,bigint,boolean,bigint) +_pgr_dijkstranear(text,bigint,anyarray,bigint,boolean) +pgr_dijkstranear(text,bigint,anyarray,boolean,bigint) +pgr_dijkstranear(text,text,boolean,bigint,boolean) +pgr_dijkstra(text,anyarray,anyarray,boolean) +_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint) +_pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean) +pgr_dijkstra(text,anyarray,bigint,boolean) +pgr_dijkstra(text,bigint,anyarray,boolean) +pgr_dijkstra(text,bigint,bigint,boolean) +pgr_dijkstra(text,text,boolean) +_pgr_dijkstra(text,text,boolean,boolean,bigint,boolean) +_pgr_dijkstra(text,text,boolean,boolean,boolean) +_pgr_dijkstravia(text,anyarray,boolean,boolean,boolean) +pgr_dijkstravia(text,anyarray,boolean,boolean,boolean) +_pgr_drivingdistance(text,anyarray,double precision,boolean,boolean) +pgr_drivingdistance(text,anyarray,double precision,boolean,boolean) +pgr_drivingdistance(text,bigint,double precision,boolean) +_pgr_drivingdistancev4(text,anyarray,double precision,boolean,boolean) +_pgr_edgecoloring(text) +pgr_edgecoloring(text) +_pgr_edgedisjointpaths(text,anyarray,anyarray,boolean) +pgr_edgedisjointpaths(text,anyarray,anyarray,boolean) +pgr_edgedisjointpaths(text,anyarray,bigint,boolean) +pgr_edgedisjointpaths(text,bigint,anyarray,boolean) +pgr_edgedisjointpaths(text,bigint,bigint,boolean) +_pgr_edgedisjointpaths(text,text,boolean) +pgr_edgedisjointpaths(text,text,boolean) +pgr_edmondskarp(text,anyarray,anyarray) +pgr_edmondskarp(text,anyarray,bigint) +pgr_edmondskarp(text,bigint,anyarray) +pgr_edmondskarp(text,bigint,bigint) +pgr_edmondskarp(text,text) +_pgr_edwardmoore(text,anyarray,anyarray,boolean) +pgr_edwardmoore(text,anyarray,anyarray,boolean) +pgr_edwardmoore(text,anyarray,bigint,boolean) +pgr_edwardmoore(text,bigint,anyarray,boolean) +pgr_edwardmoore(text,bigint,bigint,boolean) +_pgr_edwardmoore(text,text,boolean) +pgr_edwardmoore(text,text,boolean) +_pgr_endpoint(geometry) +pgr_extractvertices(text,boolean) +pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean) +pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean) +_pgr_floydwarshall(text,boolean) +pgr_floydwarshall(text,boolean) +pgr_full_version() +_pgr_getcolumnname(text,text,integer,text) +_pgr_getcolumnname(text,text,text,integer,text) +_pgr_getcolumntype(text,text,integer,text) +_pgr_getcolumntype(text,text,text,integer,text) +_pgr_get_statement(text) +_pgr_gettablename(text,integer,text) +_pgr_git_hash() +_pgr_hawickcircuits(text) +pgr_hawickcircuits(text) +_pgr_iscolumnindexed(text,text,integer,text) +_pgr_iscolumnindexed(text,text,text,integer,text) +_pgr_iscolumnintable(text,text) +_pgr_isplanar(text) +pgr_isplanar(text) +_pgr_johnson(text,boolean) +pgr_johnson(text,boolean) +pgr_kruskalbfs(text,anyarray,bigint) +pgr_kruskalbfs(text,bigint,bigint) +pgr_kruskaldd(text,anyarray,double precision) +pgr_kruskaldd(text,anyarray,numeric) +pgr_kruskaldd(text,bigint,double precision) +pgr_kruskaldd(text,bigint,numeric) +pgr_kruskaldfs(text,anyarray,bigint) +pgr_kruskaldfs(text,bigint,bigint) +pgr_kruskal(text) +_pgr_kruskal(text,anyarray,text,bigint,double precision) +_pgr_kruskalv4(text,anyarray,text,bigint,double precision) +pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean) +_pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean) +pgr_ksp(text,anyarray,bigint,integer,boolean,boolean) +pgr_ksp(text,bigint,anyarray,integer,boolean,boolean) +_pgr_ksp(text,bigint,bigint,integer,boolean,boolean) +pgr_ksp(text,bigint,bigint,integer,boolean,boolean) +_pgr_ksp(text,text,integer,boolean,boolean) +pgr_ksp(text,text,integer,boolean,boolean) +_pgr_lengauertarjandominatortree(text,bigint) +pgr_lengauertarjandominatortree(text,bigint) +_pgr_lib_version() +_pgr_linegraphfull(text) +pgr_linegraphfull(text) +_pgr_linegraph(text,boolean) +pgr_linegraph(text,boolean) +_pgr_makeconnected(text) +pgr_makeconnected(text) +pgr_maxcardinalitymatch(text) +_pgr_maxcardinalitymatch(text,boolean) +pgr_maxcardinalitymatch(text,boolean) +pgr_maxflowmincost_cost(text,anyarray,anyarray) +pgr_maxflowmincost_cost(text,anyarray,bigint) +pgr_maxflowmincost_cost(text,bigint,anyarray) +pgr_maxflowmincost_cost(text,bigint,bigint) +pgr_maxflowmincost_cost(text,text) +pgr_maxflowmincost(text,anyarray,anyarray) +_pgr_maxflowmincost(text,anyarray,anyarray,boolean) +pgr_maxflowmincost(text,anyarray,bigint) +pgr_maxflowmincost(text,bigint,anyarray) +pgr_maxflowmincost(text,bigint,bigint) +pgr_maxflowmincost(text,text) +_pgr_maxflowmincost(text,text,boolean) +pgr_maxflow(text,anyarray,anyarray) +_pgr_maxflow(text,anyarray,anyarray,integer,boolean) +pgr_maxflow(text,anyarray,bigint) +pgr_maxflow(text,bigint,anyarray) +pgr_maxflow(text,bigint,bigint) +pgr_maxflow(text,text) +_pgr_maxflow(text,text,integer,boolean) +_pgr_msg(integer,text,text) +pgr_nodenetwork(text,double precision,text,text,text,text,boolean) +_pgr_onerror(boolean,integer,text,text,text,text) +_pgr_operating_system() +_pgr_parameter_check(text,text,boolean) +_pgr_pgsql_version() +_pgr_pickdelivereuclidean(text,text,double precision,integer,integer) +pgr_pickdelivereuclidean(text,text,double precision,integer,integer) +_pgr_pickdeliver(text,text,text,double precision,integer,integer) +pgr_pickdeliver(text,text,text,double precision,integer,integer) +_pgr_pointtoid(geometry,double precision,text,integer) +pgr_primbfs(text,anyarray,bigint) +pgr_primbfs(text,bigint,bigint) +pgr_primdd(text,anyarray,double precision) +pgr_primdd(text,anyarray,numeric) +pgr_primdd(text,bigint,double precision) +pgr_primdd(text,bigint,numeric) +pgr_primdfs(text,anyarray,bigint) +pgr_primdfs(text,bigint,bigint) +pgr_prim(text) +_pgr_prim(text,anyarray,text,bigint,double precision) +_pgr_primv4(text,anyarray,text,bigint,double precision) +pgr_pushrelabel(text,anyarray,anyarray) +pgr_pushrelabel(text,anyarray,bigint) +pgr_pushrelabel(text,bigint,anyarray) +pgr_pushrelabel(text,bigint,bigint) +pgr_pushrelabel(text,text) +_pgr_quote_ident(text) +_pgr_sequentialvertexcoloring(text) +pgr_sequentialvertexcoloring(text) +_pgr_startpoint(geometry) +_pgr_stoerwagner(text) +pgr_stoerwagner(text) +_pgr_strongcomponents(text) +pgr_strongcomponents(text) +_pgr_topologicalsort(text) +pgr_topologicalsort(text) +_pgr_transitiveclosure(text) +pgr_transitiveclosure(text) +_pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text) +pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text) +pgr_trsp(text,integer,integer,boolean,boolean,text) +_pgr_trsp(text,text,anyarray,anyarray,boolean) +pgr_trsp(text,text,anyarray,anyarray,boolean) +_pgr_trsp(text,text,anyarray,bigint,boolean) +pgr_trsp(text,text,anyarray,bigint,boolean) +_pgr_trsp(text,text,bigint,anyarray,boolean) +pgr_trsp(text,text,bigint,anyarray,boolean) +_pgr_trsp(text,text,bigint,bigint,boolean) +pgr_trsp(text,text,bigint,bigint,boolean) +pgr_trsp(text,text,text,boolean) +_pgr_trspv4(text,text,anyarray,anyarray,boolean) +_pgr_trspv4(text,text,text,boolean) +pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text) +_pgr_trspvia(text,text,anyarray,boolean,boolean,boolean) +pgr_trspvia(text,text,anyarray,boolean,boolean,boolean) +pgr_trspviavertices(text,anyarray,boolean,boolean,text) +_pgr_trspviavertices(text,integer[],boolean,boolean,text) +_pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean) +pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean) +_pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean) +pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean) +pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean) +pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean) +pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean) +_pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean) +pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean) +_pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean) +pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean) +_pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean) +pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean) +_pgr_turnrestrictedpath(text,text,bigint,bigint,integer,boolean,boolean,boolean,boolean) +pgr_turnrestrictedpath(text,text,bigint,bigint,integer,boolean,boolean,boolean,boolean) +pgr_version() +_pgr_versionless(text,text) +_pgr_vrponedepot(text,text,text,integer) +pgr_vrponedepot(text,text,text,integer) +pgr_withpointscostmatrix(text,text,anyarray,boolean,character) +pgr_withpointscost(text,text,anyarray,anyarray,boolean,character) +pgr_withpointscost(text,text,anyarray,bigint,boolean,character) +pgr_withpointscost(text,text,bigint,anyarray,boolean,character) +pgr_withpointscost(text,text,bigint,bigint,boolean,character) +pgr_withpointscost(text,text,text,boolean,character) +_pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean) +pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean) +pgr_withpointsdd(text,text,anyarray,double precision,character,boolean,boolean,boolean) +pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean) +pgr_withpointsdd(text,text,bigint,double precision,character,boolean,boolean) +_pgr_withpointsddv4(text,text,anyarray,double precision,character,boolean,boolean,boolean) +pgr_withpointsksp(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean) +_pgr_withpointsksp(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean) +pgr_withpointsksp(text,text,anyarray,bigint,integer,character,boolean,boolean,boolean) +pgr_withpointsksp(text,text,bigint,anyarray,integer,character,boolean,boolean,boolean) +_pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean) +pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean) +pgr_withpointsksp(text,text,bigint,bigint,integer,character,boolean,boolean,boolean) +_pgr_withpointsksp(text,text,text,integer,character,boolean,boolean,boolean) +pgr_withpointsksp(text,text,text,integer,character,boolean,boolean,boolean) +pgr_withpoints(text,text,anyarray,anyarray,boolean,character,boolean) +_pgr_withpoints(text,text,anyarray,anyarray,boolean,character,boolean,boolean,boolean) +pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean) +pgr_withpoints(text,text,bigint,anyarray,boolean,character,boolean) +pgr_withpoints(text,text,bigint,bigint,boolean,character,boolean) +pgr_withpoints(text,text,text,boolean,character,boolean) +_pgr_withpoints(text,text,text,boolean,character,boolean,boolean) +_pgr_withpointsvia(text,bigint[],double precision[],boolean) +_pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean) +pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean) +_trsp(text,text,anyarray,anyarray,boolean) +_v4trsp(text,text,anyarray,anyarray,boolean) +_v4trsp(text,text,text,boolean) diff --git a/tools/developer/pumpup_version.sh b/tools/developer/pumpup_version.sh index 92bb3abd2ce..d6dacf89763 100755 --- a/tools/developer/pumpup_version.sh +++ b/tools/developer/pumpup_version.sh @@ -151,8 +151,8 @@ fi # ------ # Documentation related # ------ -perl -pi -e 's/# Copyright(.*) v(.*)$/# Copyright$1 v'"${NEW_VERSION}${NEW_KIND}"'/' locale/pot/*.pot -perl -pi -e 's/# Copyright(.*) v(.*)$/# Copyright$1 v'"${NEW_VERSION}${NEW_KIND}"'/' locale/*/*/*.po -perl -pi -e 's/('"${MAYOR}.${MINOR}"')/'"${NEW_MAYOR}.${NEW_MINOR}\', \'${MAYOR}.${MINOR}"'/g' doc/_static/page_history.js bash tools/transifex/update_locale.sh +perl -pi -e 's/# Copyright(.*) v(.*)$/# Copyright$1 v'"${NEW_MAYOR}.${NEW_MINOR}"'/' locale/pot/*.pot locale/*/*/*.po +perl -pi -e 's/Id-Version: pgRouting v'"${MAYOR}.${MINOR}"'/Id-Version: pgRouting v'"${NEW_MAYOR}.${NEW_MINOR}"'/' locale/*/*/*.po locale/pot/*.pot +perl -pi -e "s/versionsArr = \[/versionsArr = \['${NEW_MAYOR}.${NEW_MINOR}',/" doc/_static/page_history.js diff --git a/tools/testers/pg_prove_tests.sh b/tools/testers/pg_prove_tests.sh index 7132a5a1815..99867249fc7 100755 --- a/tools/testers/pg_prove_tests.sh +++ b/tools/testers/pg_prove_tests.sh @@ -37,7 +37,7 @@ echo "$PGPORT" pushd ./tools/testers/ || exit 1 -bash setup_db.sh "${PGPORT}" "${PGDATABASE}" "${PGUSER}" "3.7.3" +bash setup_db.sh "${PGPORT}" "${PGDATABASE}" "${PGUSER}" "3.8.0" PGOPTIONS="-c client_min_messages=WARNING" pg_prove --failures --Q --recurse \ -S on_error_rollback=off \