To see the issues closed by this release see the [Git closed milestone for 2.6.1 ](https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.6.1%22%20) on Github.
* Fixes server crash on several functions.
* pgr_floydWarshall
* pgr_johnson
* pgr_astar
* pgr_bdAstar
* pgr_bdDijstra
* pgr_alphashape
* pgr_dijkstraCostMatrix
* pgr_dijkstra
* pgr_dijkstraCost
* pgr_drivingDistance
* pgr_KSP
* pgr_dijkstraVia (proposed)
* pgr_boykovKolmogorov (proposed)
* pgr_edgeDisjointPaths (proposed)
* pgr_edmondsKarp (proposed)
* pgr_maxCardinalityMatch (proposed)
* pgr_maxFlow (proposed)
* pgr_withPoints (proposed)
* pgr_withPointsCost (proposed)
* pgr_withPointsKSP (proposed)
* pgr_withPointsDD (proposed)
* pgr_withPointsCostMatrix (proposed)
* pgr_contractGraph (experimental)
* pgr_pushRelabel (experimental)
* pgr_vrpOneDepot (experimental)
* pgr_gsoc_vrppdtw (experimental)
* Fixes for deprecated functions where also applied but not tested
To see the issues closed by this release see the [Git closed milestone for 2.5.4 ](https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.4%22%20) on Github.
* Fixes server crash on several functions.
* pgr_floydWarshall
* pgr_johnson
* pgr_astar
* pgr_bdAstar
* pgr_bdDijstra
* pgr_alphashape
* pgr_dijkstraCostMatrix
* pgr_dijkstra
* pgr_dijkstraCost
* pgr_drivingDistance
* pgr_KSP
* pgr_dijkstraVia (proposed)
* pgr_boykovKolmogorov (proposed)
* pgr_edgeDisjointPaths (proposed)
* pgr_edmondsKarp (proposed)
* pgr_maxCardinalityMatch (proposed)
* pgr_maxFlow (proposed)
* pgr_withPoints (proposed)
* pgr_withPointsCost (proposed)
* pgr_withPointsKSP (proposed)
* pgr_withPointsDD (proposed)
* pgr_withPointsCostMatrix (proposed)
* pgr_contractGraph (experimental)
* pgr_pushRelabel (experimental)
* pgr_vrpOneDepot (experimental)
* pgr_gsoc_vrppdtw (experimental)
* Fixes for deprecated functions where also applied but not tested
@@ -145,13 +145,13 @@ Next, we set the original_id of all of the vertices in the results graph that we
:start-after: -- q3
:end-before: -- q4
Then, we cross reference all of the other newly created vertices that do not have the same original_id and set thier original_id values.
Then, we cross reference all of the other newly created vertices that do not have the same original_id and set their original_id values.
.. literalinclude:: doc-pgr_lineGraphFull.queries
:start-after: -- q4
:end-before: -- q5
The only vertices left that have not been mapped are a few of the leaf vertices from the original graph. The following sql completes the mapping for these leaf vertices (in the case of this example graph there are no leaf vertices but this is nessessary for larger graphs).
The only vertices left that have not been mapped are a few of the leaf vertices from the original graph. The following sql completes the mapping for these leaf vertices (in the case of this example graph there are no leaf vertices but this is necessary for larger graphs).
To see the issues closed by this release see the `Git closed milestone for 2.6.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.6.1%22%20>`_ on Github.
* Fixes server crash on several functions.
* pgr_floydWarshall
* pgr_johnson
* pgr_astar
* pgr_bdAstar
* pgr_bdDijstra
* pgr_alphashape
* pgr_dijkstraCostMatrix
* pgr_dijkstra
* pgr_dijkstraCost
* pgr_drivingDistance
* pgr_KSP
* pgr_dijkstraVia (proposed)
* pgr_boykovKolmogorov (proposed)
* pgr_edgeDisjointPaths (proposed)
* pgr_edmondsKarp (proposed)
* pgr_maxCardinalityMatch (proposed)
* pgr_maxFlow (proposed)
* pgr_withPoints (proposed)
* pgr_withPointsCost (proposed)
* pgr_withPointsKSP (proposed)
* pgr_withPointsDD (proposed)
* pgr_withPointsCostMatrix (proposed)
* pgr_contractGraph (experimental)
* pgr_pushRelabel (experimental)
* pgr_vrpOneDepot (experimental)
* pgr_gsoc_vrppdtw (experimental)
* Fixes for deprecated functions where also applied but not tested
* Removed compilation warning for g++8
* Fixed a fallthrugh on Astar and bdAstar.
.. _changelog_2_6_0:
pgRouting 2.6.0 Release Notes
...
...
@@ -75,6 +117,45 @@ To see the issues closed by this release see the `Git closed milestone for 2.6.0
To see the issues closed by this release see the `Git closed milestone for 2.5.4 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.4%22%20>`_ on Github.
* Fixes server crash on several functions.
* pgr_floydWarshall
* pgr_johnson
* pgr_astar
* pgr_bdAstar
* pgr_bdDijstra
* pgr_alphashape
* pgr_dijkstraCostMatrix
* pgr_dijkstra
* pgr_dijkstraCost
* pgr_drivingDistance
* pgr_KSP
* pgr_dijkstraVia (proposed)
* pgr_boykovKolmogorov (proposed)
* pgr_edgeDisjointPaths (proposed)
* pgr_edmondsKarp (proposed)
* pgr_maxCardinalityMatch (proposed)
* pgr_maxFlow (proposed)
* pgr_withPoints (proposed)
* pgr_withPointsCost (proposed)
* pgr_withPointsKSP (proposed)
* pgr_withPointsDD (proposed)
* pgr_withPointsCostMatrix (proposed)
* pgr_contractGraph (experimental)
* pgr_pushRelabel (experimental)
* pgr_vrpOneDepot (experimental)
* pgr_gsoc_vrppdtw (experimental)
* Fixes for deprecated functions where also applied but not tested