Release Notes - pgRouting Manual (3.4)
Release Notes
To see the full list of changes check the list of Git commits on Github.
Contents
pgRouting 3.4.2 Release Notes
To see all issues & pull requests closed by this release see the Git closed milestone for 3.4.2
Issue fixes
pgRouting 3.4.1 Release Notes
To see all issues & pull requests closed by this release see the Git closed milestone for 3.4.1
Issue fixes
pgRouting 3.4.0 Release Notes
To see all issues & pull requests closed by this release see the Git closed milestone for 3.4.0
Issue fixes
-
#1891 : pgr_ksp doesn’t give all correct shortest path
New proposed functions
-
With points
-
pgr_withPointsVia
(One Via)
-
-
Turn Restrictions
-
Via with turn restrictions
-
pgr_trspVia
(One Via) -
pgr_trspVia_withPoints
(One Via)
-
-
pgr_trsp
-
pgr_trsp
(One to One) -
pgr_trsp
(One to Many) -
pgr_trsp
(Many to One) -
pgr_trsp
(Many to Many) -
pgr_trsp
(Combinations)
-
-
pgr_trsp_withPoints
-
pgr_trsp_withPoints
(One to One) -
pgr_trsp_withPoints
(One to Many) -
pgr_trsp_withPoints
(Many to One) -
pgr_trsp_withPoints
(Many to Many) -
pgr_trsp_withPoints
(Combinations)
-
-
-
Topology
-
pgr_degree
-
-
Utilities
-
pgr_findCloseEdges
(One point) -
pgr_findCloseEdges
(Many points)
-
New experimental functions
-
Ordering
-
pgr_cuthillMckeeOrdering
-
-
Unclassified
-
pgr_hawickCircuits
-
Official functions changes
-
Flow functions
-
pgr_maxCardinalityMatch(text)
-
Deprecating
pgr_maxCardinalityMatch(text,boolean)
-
-
Deprecated functions
-
Turn Restrictions
-
pgr_trsp(text,integer,integer,boolean,boolean,text)
-
pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)
-
pgr_trspViaVertices(text,anyarray,boolean,boolean,text)
-
pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text)
-
pgRouting 3.3.5 Release Notes
-
#2401 : pgRouting 3.4.0 do not build docs when sphinx is too low or missing
pgRouting 3.3.4 Release Notes
To see all issues & pull requests closed by this release see the Git closed milestone for 3.3.4
Issue fixes
-
#2400 : pgRouting 3.3.3 does not build in focal
pgRouting 3.3.3 Release Notes
To see all issues & pull requests closed by this release see the Git closed milestone for 3.3.3
Issue fixes
-
#1891 : pgr_ksp doesn’t give all correct shortest path
Official functions changes
-
Flow functions
-
pgr_maxCardinalityMatch(text,boolean)
-
Ignoring optional boolean parameter, as the algorithm works only for undirected graphs.
-
-
pgRouting 3.3.2 Release Notes
To see all issues & pull requests closed by this release see the Git closed milestone for 3.3.2
-
Revised documentation
-
Simplifying table names and table columns, for example:
-
edges
instead ofedge_table
-
Removing unused columns
category_id
andreverse_category_id
.
-
-
combinations
instead ofcombinations_table
-
Using PostGIS standard for geometry column.
-
geom
instead ofthe_geom
-
-
-
Avoiding usage of functions that modify indexes, columns etc on tables.
-
Using
pgr_extractVertices
to create a routing topology
-
-
Restructure of the pgRouting concepts page.
-
Issue fixes
pgRouting 3.3.1 Release Notes
To see all issues & pull requests closed by this release see the Git closed milestone for 3.3.1 on Github.
Issue fixes
pgRouting 3.3.0 Release Notes
To see all issues & pull requests closed by this release see the Git closed milestone for 3.3.0 on Github.
Issue fixes
-
#2057 : trspViaEdges columns in different order
-
#2087 : pgr_extractVertices to proposed
-
#2201 : pgr_depthFirstSearch to proposed
-
#2202 : pgr_sequentialVertexColoring to proposed
-
#2203 : pgr_dijkstraNear and pgr_dijkstraNearCost to proposed
New experimental functions
-
Coloring
-
pgr_edgeColoring
-
Experimental promoted to Proposed
-
Dijkstra
-
pgr_dijkstraNear
-
pgr_dijkstraNear(Combinations)
-
pgr_dijkstraNear(Many to Many)
-
pgr_dijkstraNear(Many to One)
-
pgr_dijkstraNear(One to Many)
-
-
pgr_dijkstraNearCost
-
pgr_dijkstraNearCost(Combinations)
-
pgr_dijkstraNearCost(Many to Many)
-
pgr_dijkstraNearCost(Many to One)
-
pgr_dijkstraNearCost(One to Many)
-
-
-
Coloring
-
pgr_sequentialVertexColoring
-
-
Topology
-
pgr_extractVertices
-
-
Traversal
-
pgr_depthFirstSearch(Multiple vertices)
-
pgr_depthFirstSearch(Single vertex)
-
pgRouting 3.2.2 Release Notes
To see all issues & pull requests closed by this release see the Git closed milestone for 3.2.2 on Github.
Issues
pgRouting 3.2.1 Release Notes
To see all issues & pull requests closed by this release see the Git closed milestone for 3.2.1 on Github.
Issue fixes
-
#1883 : pgr_TSPEuclidean crashes connection on Windows
-
The solution is to use Boost::graph::metric_tsp_approx
-
To not break user’s code the optional parameters related to the TSP Annaeling are ignored
-
The function with the annaeling optional parameters is deprecated
-
pgRouting 3.2.0 Release Notes
To see all issues & pull requests closed by this release see the Git closed milestone for 3.2.0 on Github.
Build
-
#1850 : Change Boost min version to 1.56
-
Removing support for Boost v1.53, v1.54 & v1.55
-
New experimental functions
-
pgr_bellmanFord(Combinations)
-
pgr_binaryBreadthFirstSearch(Combinations)
-
pgr_bipartite
-
pgr_dagShortestPath(Combinations)
-
pgr_depthFirstSearch
-
Dijkstra Near
-
pgr_dijkstraNear
-
pgr_dijkstraNear(One to Many)
-
pgr_dijkstraNear(Many to One)
-
pgr_dijkstraNear(Many to Many)
-
pgr_dijkstraNear(Combinations)
-
-
pgr_dijkstraNearCost
-
pgr_dijkstraNearCost(One to Many)
-
pgr_dijkstraNearCost(Many to One)
-
pgr_dijkstraNearCost(Many to Many)
-
pgr_dijkstraNearCost(Combinations)
-
-
-
pgr_edwardMoore(Combinations)
-
pgr_isPlanar
-
pgr_lengauerTarjanDominatorTree
-
pgr_makeConnected
-
Flow
-
pgr_maxFlowMinCost(Combinations)
-
pgr_maxFlowMinCost_Cost(Combinations)
-
-
pgr_sequentialVertexColoring
New proposed functions
-
Astar
-
pgr_aStar(Combinations)
-
pgr_aStarCost(Combinations)
-
-
Bidirectional Astar
-
pgr_bdAstar(Combinations)
-
pgr_bdAstarCost(Combinations)
-
-
Bidirectional Dijkstra
-
pgr_bdDijkstra(Combinations)
-
pgr_bdDijkstraCost(Combinations)
-
-
Flow
-
pgr_boykovKolmogorov(Combinations)
-
pgr_edgeDisjointPaths(Combinations)
-
pgr_edmondsKarp(Combinations)
-
pgr_maxFlow(Combinations)
-
pgr_pushRelabel(Combinations)
-
-
pgr_withPoints(Combinations)
-
pgr_withPointsCost(Combinations)
pgRouting 3.1.4 Release Notes
To see all issues & pull requests closed by this release see the Git closed milestone for 3.1.4 on Github.
Issues fixes
-
#2189 : Build error on RHEL 7
pgRouting 3.1.3 Release Notes
To see all issues & pull requests closed by this release see the Git closed milestone for 3.1.3 on Github.
Issues fixes
pgRouting 3.1.2 Release Notes
To see all issues & pull requests closed by this release see the Git closed milestone for 3.1.2 on Github.
Issues fixes
-
#1304 : FreeBSD 12 64-bit crashes on pgr_vrOneDepot tests Experimental Function
-
#1356 : tools/testers/pg_prove_tests.sh fails when PostgreSQL port is not passed
-
#1725 : Server crash on pgr_pickDeliver and pgr_vrpOneDepot on openbsd
-
#1760 : TSP server crash on ubuntu 20.04 #1760
-
#1770 : Remove warnings when using clang compiler
pgRouting 3.1.1 Release Notes
To see all issues & pull requests closed by this release see the Git closed milestone for 3.1.1 on Github.
Issues fixes
-
#1733 : pgr_bdAstar fails when source or target vertex does not exist in the graph
-
#1647 : Linear Contraction contracts self loops
-
#1640 : pgr_withPoints fails when points_sql is empty
-
#1616 : Path evaluation on C++ not updated before the results go back to C
-
#1300 : pgr_chinesePostman crash on test data
pgRouting 3.1.0 Release Notes
To see all issues & pull requests closed by this release see the Git closed milestone for 3.1.0 on Github.
New proposed functions
-
pgr_dijkstra(combinations)
-
pgr_dijkstraCost(combinations)
Build changes
-
Minimal requirement for Sphinx: version 1.8
pgRouting 3.0.6 Release Notes
To see all issues & pull requests closed by this release see the Git closed milestone for 3.0.6 on Github.
Issues fixes
-
#2189 : Build error on RHEL 7
pgRouting 3.0.5 Release Notes
To see all issues & pull requests closed by this release see the Git closed milestone for 3.0.5 on Github.
Backport issues fixes
pgRouting 3.0.4 Release Notes
To see all issues & pull requests closed by this release see the Git closed milestone for 3.0.4 on Github.
Backport issues fixes
-
#1304 : FreeBSD 12 64-bit crashes on pgr_vrOneDepot tests Experimental Function
-
#1356 : tools/testers/pg_prove_tests.sh fails when PostgreSQL port is not passed
-
#1725 : Server crash on pgr_pickDeliver and pgr_vrpOneDepot on openbsd
-
#1760 : TSP server crash on ubuntu 20.04 #1760
-
#1770 : Remove warnings when using clang compiler
pgRouting 3.0.3 Release Notes
Backport issues fixes
-
#1733 : pgr_bdAstar fails when source or target vertex does not exist in the graph
-
#1647 : Linear Contraction contracts self loops
-
#1640 : pgr_withPoints fails when points_sql is empty
-
#1616 : Path evaluation on C++ not updated before the results go back to C
-
#1300 : pgr_chinesePostman crash on test data
pgRouting 3.0.2 Release Notes
To see all issues & pull requests closed by this release see the Git closed milestone for 3.0.2 on Github.
Issues fixes
-
#1378 : Visual Studio build failing
pgRouting 3.0.1 Release Notes
To see all issues & pull requests closed by this release see the Git closed milestone for 3.0.1 on Github.
Issues fixes
-
#232 : Honor client cancel requests in C /C++ code
pgRouting 3.0.0 Release Notes
To see all issues & pull requests closed by this release see the Git closed milestone for 3.0.0 on Github.
Fixed Issues
-
#1153 : Renamed pgr_eucledianTSP to pgr_TSPeuclidean
-
#1188 : Removed CGAL dependency
-
#1002 : Fixed contraction issues:
New functions
-
Kruskal family
-
pgr_kruskal
-
pgr_kruskalBFS
-
pgr_kruskalDD
-
pgr_kruskalDFS
-
-
Prim family
-
pgr_prim
-
pgr_primDD
-
pgr_primDFS
-
pgr_primBFS
-
Proposed moved to official on pgRouting
-
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)
-
-
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)
-
-
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)
-
-
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_maxCardinalityMatching
-
pgr_maxFlow
-
pgr_edgeDisjointPaths(one to one)
-
pgr_edgeDisjointPaths(one to many)
-
pgr_edgeDisjointPaths(many to one)
-
pgr_edgeDisjointPaths(many to many)
-
-
Components family
-
pgr_connectedComponents
-
pgr_strongComponents
-
pgr_biconnectedComponents
-
pgr_articulationPoints
-
pgr_bridges
-
-
Contraction:
-
Removed unnecessary column seq
-
Bug Fixes
-
New Experimental functions
-
pgr_maxFlowMinCost
-
pgr_maxFlowMinCost_Cost
-
pgr_extractVertices
-
pgr_turnRestrictedPath
-
pgr_stoerWagner
-
pgr_dagShortestpath
-
pgr_topologicalSort
-
pgr_transitiveClosure
-
VRP category
-
pgr_pickDeliverEuclidean
-
pgr_pickDeliver
-
-
Chinese Postman family
-
pgr_chinesePostman
-
pgr_chinesePostmanCost
-
-
Breadth First Search family
-
pgr_breadthFirstSearch
-
pgr_binaryBreadthFirstSearch
-
-
Bellman Ford family
-
pgr_bellmanFord
-
pgr_edwardMoore
-
Moved to legacy
-
Experimental functions
-
pgr_labelGraph - Use the components family of functions instead.
-
Max flow - functions were renamed on v2.5.0
-
pgr_maxFlowPushRelabel
-
pgr_maxFlowBoykovKolmogorov
-
pgr_maxFlowEdmondsKarp
-
pgr_maximumcardinalitymatching
-
-
VRP
-
pgr_gsoc_vrppdtw
-
-
-
TSP old signatures
-
pgr_pointsAsPolygon
-
pgr_alphaShape old signature
pgRouting 2.6.3 Release Notes
To see the issues closed by this release see the Git closed milestone for 2.6.3 on Github.
Bug fixes
pgRouting 2.6.2 Release Notes
To see the issues closed by this release see the Git closed milestone for 2.6.2 on Github.
Bug fixes
pgRouting 2.6.1 Release Notes
To see the issues closed by this release see the Git closed milestone for 2.6.1 on Github.
-
Fixes server crash on several functions.
-
pgr_floydWarshall
-
pgr_johnson
-
pgr_astar
-
pgr_bdAstar
-
pgr_bdDijstra
-
pgr_alphashape
-
pgr_dijkstraCostMatrix
-
pgr_dijkstra
-
pgr_dijkstraCost
-
pgr_drivingDistance
-
pgr_KSP
-
pgr_dijkstraVia (proposed)
-
pgr_boykovKolmogorov (proposed)
-
pgr_edgeDisjointPaths (proposed)
-
pgr_edmondsKarp (proposed)
-
pgr_maxCardinalityMatch (proposed)
-
pgr_maxFlow (proposed)
-
pgr_withPoints (proposed)
-
pgr_withPointsCost (proposed)
-
pgr_withPointsKSP (proposed)
-
pgr_withPointsDD (proposed)
-
pgr_withPointsCostMatrix (proposed)
-
pgr_contractGraph (experimental)
-
pgr_pushRelabel (experimental)
-
pgr_vrpOneDepot (experimental)
-
pgr_gsoc_vrppdtw (experimental)
-
Fixes for deprecated functions where also applied but not tested
-
-
Removed compilation warning for g++8
-
Fixed a fallthrugh on Astar and bdAstar.
pgRouting 2.6.0 Release Notes
To see the issues closed by this release see the Git closed milestone for 2.6.0 on Github.
New experimental functions
-
pgr_lineGraphFull
Bug fixes
-
Fix pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean[,text])
-
without restrictions
-
calls pgr_dijkstra when both end points have a fraction IN (0,1)
-
calls pgr_withPoints when at least one fraction NOT IN (0,1)
-
-
with restrictions
-
calls original trsp code
-
-
Internal code
-
Cleaned the internal code of trsp(text,integer,integer,boolean,boolean [, text])
-
Removed the use of pointers
-
Internal code can accept BIGINT
-
-
Cleaned the internal code of withPoints
pgRouting 2.5.5 Release Notes
To see the issues closed by this release see the Git closed milestone for 2.5.5 on Github.
Bug fixes
-
Fixes driving distance when vertex is not part of the graph
-
Fixes windows test
-
Fixes build for python3 and perl5
pgRouting 2.5.4 Release Notes
To see the issues closed by this release see the Git closed milestone for 2.5.4 on Github.
-
Fixes server crash on several functions.
-
pgr_floydWarshall
-
pgr_johnson
-
pgr_astar
-
pgr_bdAstar
-
pgr_bdDijstra
-
pgr_alphashape
-
pgr_dijkstraCostMatrix
-
pgr_dijkstra
-
pgr_dijkstraCost
-
pgr_drivingDistance
-
pgr_KSP
-
pgr_dijkstraVia (proposed)
-
pgr_boykovKolmogorov (proposed)
-
pgr_edgeDisjointPaths (proposed)
-
pgr_edmondsKarp (proposed)
-
pgr_maxCardinalityMatch (proposed)
-
pgr_maxFlow (proposed)
-
pgr_withPoints (proposed)
-
pgr_withPointsCost (proposed)
-
pgr_withPointsKSP (proposed)
-
pgr_withPointsDD (proposed)
-
pgr_withPointsCostMatrix (proposed)
-
pgr_contractGraph (experimental)
-
pgr_pushRelabel (experimental)
-
pgr_vrpOneDepot (experimental)
-
pgr_gsoc_vrppdtw (experimental)
-
Fixes for deprecated functions where also applied but not tested
-
-
Removed compilation warning for g++8
-
Fixed a fallthrugh on Astar and bdAstar.
pgRouting 2.5.3 Release Notes
To see the issues closed by this release see the Git closed milestone for 2.5.3 on Github.
Bug fixes
-
Fix for postgresql 11: Removed a compilation error when compiling with postgreSQL
pgRouting 2.5.2 Release Notes
To see the issues closed by this release see the Git closed milestone for 2.5.2 on Github.
Bug fixes
-
Fix for postgresql 10.1: Removed a compiler condition
pgRouting 2.5.1 Release Notes
To see the issues closed by this release see the Git closed milestone for 2.5.1 on Github.
Bug fixes
-
Fixed prerequisite minimum version of: cmake
pgRouting 2.5.0 Release Notes
To see the issues closed by this release see the Git closed issues for 2.5.0 on Github.
enhancement:
-
pgr_version is now on SQL language
Breaking change on:
-
pgr_edgeDisjointPaths:
-
Added path_id, cost and agg_cost columns on the result
-
Parameter names changed
-
The many version results are the union of the one to one version
-
New Signatures:
-
pgr_bdAstar(one to one)
New Proposed functions
-
pgr_bdAstar(one to many)
-
pgr_bdAstar(many to one)
-
pgr_bdAstar(many to many)
-
pgr_bdAstarCost(one to one)
-
pgr_bdAstarCost(one to many)
-
pgr_bdAstarCost(many to one)
-
pgr_bdAstarCost(many to many)
-
pgr_bdAstarCostMatrix
-
pgr_bdDijkstra(one to many)
-
pgr_bdDijkstra(many to one)
-
pgr_bdDijkstra(many to many)
-
pgr_bdDijkstraCost(one to one)
-
pgr_bdDijkstraCost(one to many)
-
pgr_bdDijkstraCost(many to one)
-
pgr_bdDijkstraCost(many to many)
-
pgr_bdDijkstraCostMatrix
-
pgr_lineGraph
-
pgr_lineGraphFull
-
pgr_connectedComponents
-
pgr_strongComponents
-
pgr_biconnectedComponents
-
pgr_articulationPoints
-
pgr_bridges
Deprecated Signatures
-
pgr_bdastar - use pgr_bdAstar instead
Renamed Functions
-
pgr_maxFlowPushRelabel - use pgr_pushRelabel instead
-
pgr_maxFlowEdmondsKarp -use pgr_edmondsKarp instead
-
pgr_maxFlowBoykovKolmogorov - use pgr_boykovKolmogorov instead
-
pgr_maximumCardinalityMatching - use pgr_maxCardinalityMatch instead
Deprecated function
-
pgr_pointToEdgeNode
pgRouting 2.4.2 Release Notes
To see the issues closed by this release see the Git closed milestone for 2.4.2 on Github.
Improvement
-
Works for postgreSQL 10
Bug fixes
-
Fixed: Unexpected error column "cname"
-
Replace __linux__ with __GLIBC__ for glibc-specific headers and functions
pgRouting 2.4.1 Release Notes
To see the issues closed by this release see the Git closed milestone for 2.4.1 on Github.
Bug fixes
-
Fixed compiling error on macOS
-
Condition error on pgr_withPoints
pgRouting 2.4.0 Release Notes
To see the issues closed by this release see the Git closed issues for 2.4.0 on Github.
New Signatures
-
pgr_bdDijkstra
New Proposed Signatures
-
pgr_maxFlow
-
pgr_astar(one to many)
-
pgr_astar(many to one)
-
pgr_astar(many to many)
-
pgr_astarCost(one to one)
-
pgr_astarCost(one to many)
-
pgr_astarCost(many to one)
-
pgr_astarCost(many to many)
-
pgr_astarCostMatrix
Deprecated Signatures
-
pgr_bddijkstra - use pgr_bdDijkstra instead
Deprecated Functions
-
pgr_pointsToVids
Bug fixes
-
Bug fixes on proposed functions
-
pgr_withPointsKSP: fixed ordering
-
-
TRSP original code is used with no changes on the compilation warnings
pgRouting 2.3.2 Release Notes
To see the issues closed by this release see the Git closed issues for 2.3.2 on Github.
Bug Fixes
-
Fixed pgr_gsoc_vrppdtw crash when all orders fit on one truck.
-
Fixed pgr_trsp:
-
Alternate code is not executed when the point is in reality a vertex
-
Fixed ambiguity on seq
-
pgRouting 2.3.1 Release Notes
To see the issues closed by this release see the Git closed issues for 2.3.1 on Github.
Bug Fixes
-
Leaks on proposed max_flow functions
-
Regression error on pgr_trsp
-
Types discrepancy on pgr_createVerticesTable
pgRouting 2.3.0 Release Notes
To see the issues closed by this release see the Git closed issues for 2.3.0 on Github.
New Signatures
-
pgr_TSP
-
pgr_aStar
New Functions
-
pgr_eucledianTSP
New Proposed functions
-
pgr_dijkstraCostMatrix
-
pgr_withPointsCostMatrix
-
pgr_maxFlowPushRelabel(one to one)
-
pgr_maxFlowPushRelabel(one to many)
-
pgr_maxFlowPushRelabel(many to one)
-
pgr_maxFlowPushRelabel(many to many)
-
pgr_maxFlowEdmondsKarp(one to one)
-
pgr_maxFlowEdmondsKarp(one to many)
-
pgr_maxFlowEdmondsKarp(many to one)
-
pgr_maxFlowEdmondsKarp(many to many)
-
pgr_maxFlowBoykovKolmogorov (one to one)
-
pgr_maxFlowBoykovKolmogorov (one to many)
-
pgr_maxFlowBoykovKolmogorov (many to one)
-
pgr_maxFlowBoykovKolmogorov (many to many)
-
pgr_maximumCardinalityMatching
-
pgr_edgeDisjointPaths(one to one)
-
pgr_edgeDisjointPaths(one to many)
-
pgr_edgeDisjointPaths(many to one)
-
pgr_edgeDisjointPaths(many to many)
-
pgr_contractGraph
Deprecated Signatures
-
pgr_tsp - use pgr_TSP or pgr_eucledianTSP instead
-
pgr_astar - use pgr_aStar instead
Deprecated Functions
-
pgr_flip_edges
-
pgr_vidsToDmatrix
-
pgr_pointsToDMatrix
-
pgr_textToPoints
pgRouting 2.2.4 Release Notes
To see the issues closed by this release see the Git closed issues for 2.2.4 on Github.
Bug Fixes
-
Bogus uses of extern "C"
-
Build error on Fedora 24 + GCC 6.0
-
Regression error pgr_nodeNetwork
pgRouting 2.2.3 Release Notes
To see the issues closed by this release see the Git closed issues for 2.2.3 on Github.
Bug Fixes
-
Fixed compatibility issues with PostgreSQL 9.6.
pgRouting 2.2.2 Release Notes
To see the issues closed by this release see the Git closed issues for 2.2.2 on Github.
Bug Fixes
-
Fixed regression error on pgr_drivingDistance
pgRouting 2.2.1 Release Notes
To see the issues closed by this release see the Git closed issues for 2.2.1 on Github.
Bug Fixes
-
Server crash fix on pgr_alphaShape
-
Bug fix on With Points family of functions
pgRouting 2.2.0 Release Notes
To see the issues closed by this release see the Git closed issues for 2.2.0 on Github.
Improvements
-
pgr_nodeNetwork
-
Adding a row_where and outall optional parameters
-
-
Signature fix
-
pgr_dijkstra - to match what is documented
-
New Functions
-
pgr_floydWarshall
-
pgr_Johnson
-
pgr_dijkstraCost(one to one)
-
pgr_dijkstraCost(one to many)
-
pgr_dijkstraCost(many to one)
-
pgr_dijkstraCost(many to many)
Proposed functionality
-
pgr_withPoints(one to one)
-
pgr_withPoints(one to many)
-
pgr_withPoints(many to one)
-
pgr_withPoints(many to many)
-
pgr_withPointsCost(one to one)
-
pgr_withPointsCost(one to many)
-
pgr_withPointsCost(many to one)
-
pgr_withPointsCost(many to many)
-
pgr_withPointsDD(single vertex)
-
pgr_withPointsDD(multiple vertices)
-
pgr_withPointsKSP
-
pgr_dijkstraVia
Deprecated functions:
-
pgr_apspWarshall use pgr_floydWarshall instead
-
pgr_apspJohnson use pgr_Johnson instead
-
pgr_kDijkstraCost use pgr_dijkstraCost instead
-
pgr_kDijkstraPath use pgr_dijkstra instead
Renamed and deprecated function
-
pgr_makeDistanceMatrix renamed to _pgr_makeDistanceMatrix
pgRouting 2.1.0 Release Notes
To see the issues closed by this release see the Git closed issues for 2.1.0 on Github.
New Signatures
-
pgr_dijkstra(one to many)
-
pgr_dijkstra(many to one)
-
pgr_dijkstra(many to many)
-
pgr_drivingDistance(multiple vertices)
Refactored
-
pgr_dijkstra(one to one)
-
pgr_ksp
-
pgr_drivingDistance(single vertex)
Improvements
-
pgr_alphaShape function now can generate better (multi)polygon with holes and alpha parameter.
Proposed functionality
-
Proposed functions from Steve Woodbridge, (Classified as Convenience by the author.)
-
pgr_pointToEdgeNode - convert a point geometry to a vertex_id based on closest edge.
-
pgr_flipEdges - flip the edges in an array of geometries so the connect end to end.
-
pgr_textToPoints - convert a string of x,y;x,y;… locations into point geometries.
-
pgr_pointsToVids - convert an array of point geometries into vertex ids.
-
pgr_pointsToDMatrix - Create a distance matrix from an array of points.
-
pgr_vidsToDMatrix - Create a distance matrix from an array of vertix_id.
-
pgr_vidsToDMatrix - Create a distance matrix from an array of vertix_id.
-
-
Added proposed functions from GSoc Projects:
-
pgr_vrppdtw
-
pgr_vrponedepot
-
Deprecated functions
-
pgr_getColumnName
-
pgr_getTableName
-
pgr_isColumnCndexed
-
pgr_isColumnInTable
-
pgr_quote_ident
-
pgr_versionless
-
pgr_startPoint
-
pgr_endPoint
-
pgr_pointToId
No longer supported
-
Removed the 1.x legacy functions
Bug Fixes
-
Some bug fixes in other functions
Refactoring Internal Code
-
A C and C++ library for developer was created
-
encapsulates postgreSQL related functions
-
encapsulates Boost.Graph graphs
-
Directed Boost.Graph
-
Undirected Boost.graph.
-
-
allow any-integer in the id’s
-
allow any-numerical on the cost/reverse_cost columns
-
-
Instead of generating many libraries: - All functions are encapsulated in one library - The library has the prefix 2-1-0
pgRouting 2.0.1 Release Notes
Minor bug fixes.
Bug Fixes
-
No track of the bug fixes were kept.
pgRouting 2.0.0 Release Notes
To see the issues closed by this release see the Git closed issues for 2.0.0 on Github.
With the release of pgRouting 2.0.0 the library has abandoned backwards compatibility to pgRouting 1.x Release Notes releases. The main Goals for this release are:
-
Major restructuring of pgRouting.
-
Standardization of the function naming
-
Preparation of the project for future development.
As a result of this effort:
-
pgRouting has a simplified structure
-
Significant new functionality has being added
-
Documentation has being integrated
-
Testing has being integrated
-
And made it easier for multiple developers to make contributions.
Important Changes
-
Graph Analytics - tools for detecting and fixing connection some problems in a graph
-
A collection of useful utility functions
-
Two new All Pairs Short Path algorithms (pgr_apspJohnson, pgr_apspWarshall)
-
Bi-directional Dijkstra and A-star search algorithms (pgr_bdAstar, pgr_bdDijkstra)
-
One to many nodes search (pgr_kDijkstra)
-
K alternate paths shortest path (pgr_ksp)
-
New TSP solver that simplifies the code and the build process (pgr_tsp), dropped "Gaul Library" dependency
-
Turn Restricted shortest path (pgr_trsp) that replaces Shooting Star
-
Dropped support for Shooting Star
-
Built a test infrastructure that is run before major code changes are checked in
-
Tested and fixed most all of the outstanding bugs reported against 1.x that existing in the 2.0-dev code base.
-
Improved build process for Windows
-
Automated testing on Linux and Windows platforms trigger by every commit
-
Modular library design
-
Compatibility with PostgreSQL 9.1 or newer
-
Compatibility with PostGIS 2.0 or newer
-
Installs as PostgreSQL EXTENSION
-
Return types re factored and unified
-
Support for table SCHEMA in function parameters
-
Support for
st_
PostGIS function prefix -
Added
pgr_
prefix to functions and types -
Better documentation: https://docs.pgrouting.org
-
shooting_star is discontinued
pgRouting 1.x Release Notes
To see the issues closed by this release see the
Git closed issues for 1.x
on Github.
The following release notes have been copied from the previous
RELEASE_NOTES
file and are kept as a reference.
Changes for release 1.05
-
Bug fixes
Changes for release 1.03
-
Much faster topology creation
-
Bug fixes
Changes for release 1.02
-
Shooting* bug fixes
-
Compilation problems solved
Changes for release 1.01
-
Shooting* bug fixes
Changes for release 1.0
-
Core and extra functions are separated
-
Cmake build process
-
Bug fixes
Changes for release 1.0.0b
-
Additional SQL file with more simple names for wrapper functions
-
Bug fixes
Changes for release 1.0.0a
-
Shooting* shortest path algorithm for real road networks
-
Several SQL bugs were fixed
Changes for release 0.9.9
-
PostgreSQL 8.2 support
-
Shortest path functions return empty result if they could not find any path
Changes for release 0.9.8
-
Renumbering scheme was added to shortest path functions
-
Directed shortest path functions were added
-
routing_postgis.sql was modified to use dijkstra in TSP search