目录

pgRouting 扩展了 PostGIS/PostgreSQL 地理空间数据库，以提供地理空间路由和其他网络分析功能。

这是pgRouting v4.0.2 手册 。

pgRouting 手册根据 Creative Commons Attribution-Share Alike 3.0 License 。 您可以随意使用本材料，但我们要求您将功劳归功于 pgRouting 项目，并尽可能提供返回 https://pgrouting.org 的链接。 有关 pgRouting 中使用的其他许可证，请参阅 许可 。

常规

• 介绍
  • 许可
  • 贡献者
  • 更多信息
• 安装
  • 简洁版本
  • 获取源码
  • 在数据库中启用和升级
  • 依赖
  • 配置
  • 构建
  • 测试
  • 另请参阅
• 支持
  • 报告问题
  • Mailing List, Matrix, GIS StackExchange
  • 商业支持

• 本手册示例中使用的 示例数据 。

Pgrouting 概念

• pgRouting 概念
  • 图
  • 没有几何信息的图
  • 具有几何图形的图
  • 检查路由拓扑
  • 函数的结构
  • 函数的重载
  • 内部查询
  • 参数
  • 结果列
  • 性能技巧
  • 如何贡献
  • 另请参阅

函数族

All Pairs - 函数族

• pgr_floydWarshall - Floyd-Warshall 算法。

• pgr_johnson - Johnson算法

A* - 函数族

• pgr_aStar - A* 最短路径算法。

• pgr_aStarCost - 获取最短路径的总成本。

• pgr_aStarCostMatrix - 获取最短路径的成本矩阵。

双向A* - 函数族

• pgr_bdAstar - 获取路径的双向A*算法。

• pgr_bdAstarCost - 双向 A* 算法计算路径成本。

• pgr_bdAstarCostMatrix - 用于计算路径成本矩阵的双向 A* 算法。

双向 Dijkstra - 函数族

• pgr_bdDijkstra - 最短路径的双向 Dijkstra 算法。

• pgr_bdDijkstraCost - 双向 Dijkstra 计算最短路径的成本

• pgr_bdDijkstraCostMatrix - 创建最短路径成本矩阵的双向 Dijkstra 算法。

分量 - 函数族

• pgr_connectedComponents - 无向图的连通分量。

• pgr_strongComponents - 有向图的强连通分量。

• pgr_biconnectedComponents - 无向图的双连通分量。

• pgr_articulationPoints - 无向图的铰接点。

• pgr_bridges - 无向图的桥。

收缩 - 函数族

• pgr_contraction

Dijkstra - 函数族

• pgr_dijkstra - Dijkstra 最短路径算法。

• pgr_dijkstraCost - 获取最短路径的总成本。

• pgr_dijkstraCostMatrix - 使用 pgr_dijkstra 创建成本矩阵。

• pgr_drivingDistance - 使用 pgr_dijkstra 计算流域信息。

• pgr_KSP - 使用 Yen 算法和 pgr_dijkstra 来获得 K 条最短路径。

• pgr_dijkstraVia - 获取经过一系列顶点的路径。

• pgr_dijkstraNear - 获取到最近顶点的路线。

• pgr_dijkstraNearCost - 获取最近顶点的成本。

Flow - 函数族

• pgr_maxFlow - 仅使用 Push 和 Relabel 算法进行最大流量计算。

• pgr_boykovKolmogorov - Boykov 和 Kolmogorov 的边流动细节。

• pgr_edmondsKarp - 带有边流量详细信息的 Edmonds 和 Karp 算法。

• pgr_pushRelabel - 推送和重新标记算法以及边流量的详细信息。

• Applications

  • pgr_edgeDisjointPaths - 计算两组顶点之间的边不相交路径。

  • pgr_maxCardinalityMatch - 计算图中的最大基数匹配。

Kruskal - 函数族

• pgr_kruskal

• pgr_kruskalBFS

• pgr_kruskalDD

• pgr_kruskalDFS

Metrics - 功能系列

• pgr_degree - 返回顶点集及其关联边数统计。

Prim - 函数族

• pgr_prim

• pgr_primBFS

• pgr_primDD

• pgr_primDFS

参考

• pgr_version

• pgr_full_version

TRSP - 函数族

• pgr_trsp - Routing with restrictions.

• pgr_trspVia - 有限制的通过顶点路由。

• pgr_trsp_withPoints - 有限制的顶点/点路由。

• pgr_trspVia_withPoints - 通过有限制的顶点/点路由。

Traveling Sales Person - 函数族

• pgr_TSP- 当输入作为矩阵单元信息给出时。

• pgr_TSPeuclidean - 当输入是坐标时。

实用工具函数集

• pgr_extractVertices - 根据边表信息提取顶点信息。

• pgr_findCloseEdges - 动态查找最近道路边线

• pgr_separateCrossing - 断开相互交叉的几何图形。

• pgr_separateTouching - 断开相互（接近）接触的几何图形。

withPoints - 函数族

• pgr_withPoints - 从/到图表上任意点的路线。

• pgr_withPointsCost - 最短路径的成本。

• pgr_withPointsCostMatrix - 最短路径的成本。

• pgr_withPointsKSP -K 最短路径。

• pgr_withPointsDD -行驶距离。

• pgr_withPointsVia - 通过路由

按类别划分的函数

成本 - 类别

• pgr_aStarCost

• pgr_bdAstarCost

• pgr_dijkstraCost

• pgr_dijkstraNearCost

• pgr_bdDijkstraCost

• pgr_withPointsCost

成本矩阵 - 类别

• pgr_aStarCostMatrix

• pgr_dijkstraCostMatrix

• pgr_bdAstarCostMatrix

• pgr_bdDijkstraCostMatrix

• pgr_withPointsCostMatrix

驾驶距离 - 类别

• pgr_drivingDistance - 基于 Dijkstra 算法的行驶距离

• pgr_primDD - 基于Prim算法的行驶距离

• pgr_kruskalDD - 基于Kruskal算法的行驶距离

• pgr_withPointsDD - 基于 pgr_withPoints 的行驶距离

K最短路径 - 类别

• pgr_KSP - 基于 pgr_dijkstra 的 Yen 算法

• pgr_withPointsKSP - 基于 pgr_withPoints 的 Yen 算法

生成树 - 类别

• Kruskal - 函数族

• Prim - 函数族

BFS - 类别

• pgr_kruskalBFS

• pgr_primBFS

DFS - 类别

• pgr_kruskalDFS

• pgr_primDFS

withPoints - 类别

• withPoints - 函数族 - 基于 Dijkstra 算法的函数。

• 来自 TRSP - 函数族:

  • pgr_trsp_withPoints - 有限制的顶点/点路由。

  • pgr_trspVia_withPoints - 通过有限制的顶点/点路由。

可用函数，但不是官方 pgRouting 函数

• 提议的功能

• 实验性函数

发布说明

pgRouting 4.0.2 Release Notes

To see all issues & pull requests closed by this release see the Github milestone for 4.0.2

4.0.2 Summary of changes by function

• pgr_dijkstraVia

  • Fix: bad alloc

• pgr_drivingDistance

  • Standardizing negative distance behaviour

    • Throws when \(distance < 0\).

    • Standard message and hint.

• pgr_withPointsDD

  • Standardizing negative distance behaviour

    • Throws when \(distance < 0\).

    • Standard message and hint.

• pgr_withPointsVia

  • Fix: bad alloc

4.0.2 Bug Fixes

• #3110: pgr_dijkstraVia throws std::bad_alloc when a node does not exist

• #3091: Catchment functions when negative distance do not have a standardized behaviour

pgRouting 4.0.1 Release Notes

To see all issues & pull requests closed by this release see the Github milestone for 4.0.1

Bug修复

• #2966: pgr_withPoints does not pick optimal route when fraction = 1

• #3034: metrics driver should not be using new

Code enhancements

• #3044: Check and fix assert.hpp for cppcoreguidelines-explicit-virtual-functions

• #3040: Check and fix cppcoreguidelines-virtual-class-destructor

• #3039: Check and fix cppcoreguidelines-special-member-functions

• #3038: Check and fix cppcoreguidelines-prefer-member-initializer

• #3037: Check and fix cppcoreguidelines-init-variables

• #3035: Pass by reference on existing drivers

Administration

• #3031: pgtap license to Creative commons and License texts standardization

pgRouting 4.0.0 Release Notes

To see all issues & pull requests closed by this release see the Github milestone for 4.0.0

构建

• C++ standard is std17

  • Using this standard, all supported toolchains across our CI matrix will work.

  • The code is not yet modified to use std17:

    • If needed: -DCMAKE_CXX_STANDARD=14 to lower the standard.

• The user's documentation is built by default.

• The doxygen documentation is built by default.

For developers:

• Set -DUSE_CLANG_TIDY=ON for clang tidy checks.

• Tidy checks are done on CI.

Documentation build

• The doxygen documentation is built by default

• The HTML documentation is built by default

• The translated languages (en, es, sv, zh_Hans) HTML documentation are built by default

• WITH-DOC is not used anymore

User Documentation is not built when

• Sphinx is not found

• When all Sphinx formats are OFF

  • To not build HTML default format: -DBUILD_HTML=OFF

• When all languages are OFF

  • To build only English: -DES=OFF -DSV=OFF -DZH_HANS=OFF

• Documentation output location: build/doc/_build/<format>

  • For example: for HTML output is on build/doc/_build/html directory

Developers' Documentation is not built when

• Doxygen is not found

• To not build Doxygen documentation: -DBUILD_DOXY=OFF

Summary of changes by function

• pgr_aStar

  • 组合签名已升级为正式版本。

• pgr_aStarCost

  • 组合签名已升级为正式版本。

• pgr_bandwidth

  • 新实验性功能。

• pgr_bdAstar

  • 组合签名已升级为正式版本。

• pgr_bdAstarCost

  • 组合签名已升级为正式版本。

• pgr_bdDijkstra

  • Output columns standardized to (seq, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)

  • 组合签名已升级为正式版本。

• pgr_bdDijkstraCost

  • 组合签名已升级为正式版本。

• pgr_bellmanFord

  • Output columns standardized to (seq, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)

• pgr_binaryBreadthFirstSearch

  • Output columns standardized to (seq, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)

• pgr_bipartite

  • Output columns standardized to (node, color)

• pgr_boykovKolmogorov

  • 组合签名已升级为正式版本。

• pgr_breadthFirstSearch

  :

  • 将输出列标准化为 (seq, depth, start_vid, pred, node, edge, cost, agg_cost)

• pgr_contraction

  • Breaking change, signatures no longer available:

    • pgr_contraction(text,bigint[],integer,bigint[],boolean)

• pgr_dagShortestPath

  • Output columns standardized to (seq, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)

• pgr_depthFirstSearch

  :

  • 将输出列标准化为 (seq, depth, start_vid, pred, node, edge, cost, agg_cost)

• pgr_dijkstra

  • 组合签名已升级为正式版本。

• pgr_dijkstraCost

  • 组合签名已升级为正式版本。

• pgr_dijkstraNear

  • 函数正式发布。

• pgr_dijkstraNearCost

  • 函数正式发布。

• pgr_dijkstraVia

  • 函数正式发布。

• pgr_edgeColoring

  • Output columns standardized to (edge, color)

• pgr_edgeDisjointPaths

  • Output columns standardized to (seq, path_id, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)

  • 组合签名已升级为正式版本。

• pgr_edmondsKarp

  • 组合签名已升级为正式版本。

• pgr_edwardMoore

  • Output columns standardized to (seq, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)

  版本3.2.0

  • 新实验性签名：

    • pgr_edwardMoore(组合)

  版本3.0.0

  • 新实验性功能。

• pgr_kingOrdering

  • 新实验性功能。

• pgr_KSP

  • 所有签名均已升级为正式版本。

• pgr_maxCardinalityMatch

  • Breaking change, signatures no longer available:

    • pgr_maxCardinalityMatch(text,boolean)

• pgr_maxFlow

  • 组合签名已升级为正式版本。

• pgr_pushRelabel

  • 组合签名已升级为正式版本。

• pgr_sequentialVertexColoring

  • Output columns standardized to (node, color)

• pgr_sloanOrdering

  • 新实验性功能。

• pgr_topologicalSort

  • Standardize output to (seq, node)

• pgr_transitiveClosure

  • Standardized output to (node,targets)

• pgr_trsp

  • 函数正式发布。

  • Breaking change, signatures no longer available:

    • pgr_trsp(text,integer,integer,boolean,boolean,text)

    • pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)

• pgr_trspVia

  • 函数正式发布。

  • Breaking change, signatures no longer available:

    • pgr_trspviavertices(text,anyarray,boolean,boolean,text)

• pgr_trspVia_withPoints

  • 函数正式发布。

  • Driving side parameter is positional unnamed.

    • Valid values depend on kind of graph

  • Breaking change, signatures no longer available:

    • pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)

    • pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)

• pgr_trsp_withPoints

  • 函数正式发布。

  • Driving side parameter is positional unnamed and compulsory.

    • Valid values depend on kind of graph

  • Breaking change, signatures no longer available:

    • 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_TSP

  • Results change depending on input order

  • Only for undirected graphs

  • Breaking change, signatures no longer available:

    • pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)

• pgr_TSPeuclidean

  • Results change depending on input order

  • Breaking change, signatures no longer available:

    • pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, integer,double precision,double precision,double precision,boolean)

• pgr_turnRestrictedPath

  • Output columns standardized to (seq, path_id, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)

• pgr_withPoints

  • 函数正式发布。

  • Driving side parameter is positional unnamed and compulsory.

    • Valid values depend on kind of graph

  • Output columns standardized to (seq, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)

  • Breaking change, signatures no longer available:

    • pgr_withpoints(text,text,anyarray,anyarray,boolean,character,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_withPointsCost

  • 函数正式发布。

  • Driving side parameter is unnamed and compulsory.

    • Valid values depend on kind of graph

  • Output columns standardized to (start_vid, end_vid, agg_cost)

  • Breaking change, signatures no longer available:

    • 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_withPointsCostMatrix

  • 函数正式发布。

  • Driving side parameter is positional unnamed and compulsory.

    • Valid values depend on kind of graph

  • Output columns standardized to (start_vid, end_vid, agg_cost)

  • Breaking change, signatures no longer available:

    • pgr_withpointscostmatrix(text,text,anyarray,boolean,character)

• pgr_withPointsDD

  • 函数正式发布。

  • Breaking change, signatures no longer available:

    • pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)

    • pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)

• pgr_withPointsKSP

  • 函数正式发布。

  • Breaking change, signatures no longer available:

    • pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)

• pgr_withPointsVia

  • 函数正式发布。

  • Driving side parameter is positional unnamed and compulsory.

    • Valid values depend on kind of graph

  • Breaking change, signatures no longer available:

    • pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)

正式版功能函数

• #2701: pgr_trsp

• #2701: pgr_trsp

• #2701: pgr_trspVia

• #2701: pgr_trspVia_withPoints

• #2701: pgr_trsp_withPoints

• #2700: pgr_withPoints

• #2700: pgr_withPointsCost

• #2700: pgr_withPointsCostMatrix

• #2700: pgr_withPointsDD

• #2700: pgr_withPointsKSP

• #2700: pgr_withPointsVia

• #2983: pgr_dijkstraNear

• #2983: pgr_dijkstraNearCost

• #2983: pgr_dijkstraVia

正式版函数签名

• #2718: pgr_aStar(Combinations)

• #2718: pgr_aStarCost(Combinations)

• #2718: pgr_bdAstar(Combinations)

• #2718: pgr_bdAstarCost(Combinations)

• #2718: pgr_bdDijkstra(Combinations)

• #2718: pgr_bdDijkstraCost(Combinations)

• #2718: pgr_dijkstra(Combinations)

• #2718: pgr_dijkstraCost(Combinations)

• #2718: pgr_KSP(All signatures)

• #2718: pgr_boykovKolmogorov(Combinations)

• #2718: pgr_edmondsKarp(Combinations)

• #2718: pgr_maxFlow(Combinations)

• #2718: pgr_pushRelabel(Combinations)

New experimental functions.

• Metrics

  • #2951: pgr_bandwidth

• 排序

  • #2954: pgr_kingOrdering

  • #2955: pgr_sloanOrdering

SQL signatures and output standardization

#2904: Standardize output columns of functions with different output

columns within overloads

Standardized to (seq, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)

• #2905: pgr_withPoints

• #2906: pgr_bdDijkstra

• #2907: pgr_bellmanFord

• #2908: pgr_binaryBreadthFirstSearch

• #2910: pgr_edwardMoore

• #2913: pgr_dagShortestPath

Standardized to (start_vid, end_vid, agg_cost)

• #2905: pgr_withPointsCost

• #2905: pgr_withPointsCostMatrix

Standardized to (seq, path_id, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)

• #2909: pgr_edgeDisjointPaths

• #2909: pgr_turnRestrictedPath

Standardized to (edge, color)

• #2924: pgr_edgeColoring

Standardized to (node, color)

• #2924: pgr_bipartite

• #2927: pgr_sequentialVertexColoring

Standardized to (seq, depth, start_vid, pred, node, edge, cost, agg_cost)

• #2931: pgr_breadthFirstSearch

• #2931: pgr_depthFirstSearch

Standardized to (seq, node)

• #2934: pgr_topologicalSort

Standardized to (node,targets)

• #2934: pgr_transitiveClosure

移除已弃用的 SQL 函数签名

• #2798: pgr_contraction

  • Breaking change, signatures no longer available:

    • pgr_contraction(text,bigint[],integer,bigint[],boolean)

• #2683: pgr_trsp

  • Breaking change, signatures no longer available:

    • pgr_trsp(text,integer,integer,boolean,boolean,text)

    • pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)

• #2683: pgr_trspVia

  • Breaking change, signatures no longer available:

    • pgr_trspviavertices(text,anyarray,boolean,boolean,text)

• #2700: pgr_withPointsVia

  • Breaking change, signatures no longer available:

    • pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)

• #2888: pgr_findCloseEdges

  • pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)

  • pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)

• #2890: pgr_withPointsDD

  • Breaking change, signatures no longer available:

    • pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)

    • pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)

• #2895: pgr_withPointsKSP

  • Breaking change, signatures no longer available:

    • pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)

• #2899: pgr_maxCardinalityMatch

  • Breaking change, signatures no longer available:

    • pgr_maxCardinalityMatch(text,boolean)

• #2901: pgr_TSP

  • Breaking change, signatures no longer available:

    • pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)

• #2901: pgr_TSPeuclidean

  • Breaking change, signatures no longer available:

    • pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, integer,double precision,double precision,double precision,boolean)

移除已弃用的SQL函数

• #2681: pgr_trspViaedges

• #2682: pgr_trspViaVertices

• #2748: pgr_alphaShape

• #2751: pgr_createTopology

• #2752: pgr_analyzeGraph

• #2755: pgr_analyzeOneWay

• #2827: pgr_createVerticesTable

• #2886: pgr_nodeNetwork

Removal of SQL deprecated internal functions

• #2748 _pgr_alphaShape(text,double precision)

• #2861 _pgr_checkVertTab(text,text[],integer,text)

• #2861 _pgr_createIndex(text,text,text,integer,text)

• #2861 _pgr_createIndex(text,text,text,text,integer,text)

• #2913 _pgr_dagShortestPath(text,anyarray,anyarray,boolean,boolean)

• #2913 _pgr_dagShortestPath(text,text,boolean,boolean)

• #2730 _pgr_dijkstraNear(text,anyarray,anyarray,bigint,boolean)

• #2730 _pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)

• #2730 _pgr_dijkstraNear(text,bigint,anyarray,bigint,boolean)

• #2730 _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)

• #2730 _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)

• #2730 _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)

• #2730 _pgr_dijkstra(text,text,boolean,boolean,boolean)

• #2735 _pgr_drivingDistance(text,anyarray,double precision,boolean,boolean)

• #2861 _pgr_endPoint(geometry)

• #2861 __pgr_getColumnName(text,text,integer,text)

• #2861 __pgr_getColumnName(text,text,text,integer,text)

• #2861 __pgr_getColumnType(text,text,integer,text)

• #2861 __pgr_getColumnType(text,text,text,integer,text)

• #2861 __pgr_getTableName(text,integer,text)

• #2861 _pgr_isColumnIndexed(text,text,integer,text)

• #2861 _pgr_isColumnIndexed(text,text,text,integer,text)

• #2861 _pgr_isColumnIntable(text,text)

• #2745 _pgr_kruskal(text,anyarray,text,bigint,double precision)

• #2897 _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean)

• #2897 _pgr_ksp(text,bigint,bigint,integer,boolean,boolean)

• #2897 _pgr_ksp(text,text,integer,boolean,boolean)

• #2899 _pgr_maxCardinalityMatch(text,boolean)

• #2861 _pgr_msg(integer,text,text)

• #2861 _pgr_onerror(boolean,integer,text,text,text,text)

• #2861 _pgr_pointtoid(geometry,double precision,text,integer)

• #2743 _pgr_prim(text,anyarray,text,bigint,double precision)

• #2861 _pgr_quote_ident(text)

• #2861 _pgr_startPoint(geometry)

• #2683 _pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)

• #2683 _pgr_trsp(text,text,anyarray,anyarray,boolean)

• #2683 _pgr_trsp(text,text,anyarray,bigint,boolean)

• #2683 _pgr_trsp(text,text,bigint,anyarray,boolean)

• #2683 _pgr_trsp(text,text,bigint,bigint,boolean)

• #2682 _pgr_trspViaVertices(text,integer[],boolean,boolean,text)

• #2919 _pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)

• #2919 _pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)

• #2919 _pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)

• #2901 _pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)

• #2901 _pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)

• #2861 _pgr_versionLess(text,text)

• #2890 _pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)

• #2895 _pgr_withPointsKSP(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean)

• #2895 _pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)

• #2895 _pgr_withPointsKSP(text,text,text,integer,character,boolean,boolean,boolean)

• #2741 _pgr_withPointsVia(text,bigint[],double precision[],boolean)

• #2741 _pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)

• #2683 _trsp(text,text,anyarray,anyarray,boolean)

• #2683 _v4trsp(text,text,anyarray,anyarray,boolean)

• #2683 _v4trsp(text,text,text,boolean)

Summary of functions and signatures no longer on pgrouting

• #2748 pgr_alphashape(geometry,double precision)

• #2752 pgr_analyzegraph(text,double precision,text,text,text,text,text)

• #2755 pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)

• #2798 pgr_contraction(text,bigint[],integer,bigint[],boolean)

• #2751 pgr_createtopology(text,double precision,text,text,text,text,text,boolean)

• #2827 pgr_createverticestable(text,text,text,text,text)

• #2888 pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)

• #2888 pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)

• #2899 pgr_maxCardinalityMatch(text,boolean)

• #2886 pgr_nodenetwork(text,double precision,text,text,text,text,boolean)

• #2683 pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)

• #2683 pgr_trsp(text,integer,integer,boolean,boolean,text)

• #2681 pgr_trspViaedges(text,integer[],double precision[],boolean,boolean,text)

• #2682 pgr_trspViaVertices(text,anyarray,boolean,boolean,text)

• #2919 pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)

• #2919 pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)

• #2919 pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)

• #2919 pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)

• #2919 pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)

• #2919 pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)

• #2901 pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)

• #2901 pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)

• #2919 pgr_withPointsCostMatrix(text,text,anyarray,boolean,character)

• #2919 pgr_withPointsCost(text,text,anyarray,anyarray,boolean,character)

• #2919 pgr_withPointsCost(text,text,anyarray,bigint,boolean,character)

• #2919 pgr_withPointsCost(text,text,bigint,anyarray,boolean,character)

• #2919 pgr_withPointsCost(text,text,bigint,bigint,boolean,character)

• #2919 pgr_withPointsCost(text,text,text,boolean,character)

• #2890 pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)

• #2890 pgr_withPointsDD(text,text,bigint,double precision,boolean,character,boolean)

• #2895 pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)

• #2919 pgr_withPoints(text,text,anyarray,anyarray,boolean,character,boolean)

• #2919 pgr_withPoints(text,text,anyarray,bigint,boolean,character,boolean)

• #2919 pgr_withPoints(text,text,bigint,anyarray,boolean,character,boolean)

• #2919 pgr_withPoints(text,text,bigint,bigint,boolean,character,boolean)

• #2919 pgr_withPoints(text,text,text,boolean,character,boolean)

• #2919 pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)

Code enhancements

• 移除未使用的C/C++代码

• Refactor the Script to build the update PostgreSQL file.

• One process & driver for:

  • allpairs: johnson and Floyd-Warshall

  • Shortest path: Dijkstra and withPoints using Dijkstra

弃用内部C/C++函数

Deprecated functions are substituted by new function.

• _pgr_drivingDistance => _pgr_drivingDistancev4

• _pgr_withPointsDD => _pgr_withPointsddv4

• _pgr_kruskal => _pgr_kruskalv4

• _pgr_prim => _pgr_primv4

• _pgr_dijkstra => _pgr_dijkstra_v4

• _pgr_withPointsKSP => _pgr_withPointsKSP_v4

• _pgr_trspVia_withPoints => _pgr_trspVia_withPoints_v4

• _pgr_trsp_withPoints => _pgr_trsp_withPoints_v4

• _pgr_withPointsVia => _pgr_withPointsvia_v4

遗留代码中内部 C/C++ 函数

• #2683 _trsp

• #2683 _v4trsp

• #2748 _pgr_alphaShape

• #2913 _pgr_dagShortestPath

所有版本

• 发布说明
  • pgRouting 4
  • pgRouting 3
  • pgRouting 2
  • pgRouting 1

索引和表格

• 索引

• 搜索页面