[pgrouting-users] Release pgRouting v3.0.0

[Stephen Woodbridge]

Vicky and the pgRouting team,

Congrats! on a truly amazing release. The list of new functions is very 
impressive.
It is a pleasure to see how this community has grown over the years with 
Vicky's leadership.

Great job,
   -Steve W

On 5/20/2020 9:10 PM, Vicky Vergara wrote:
> Hello OSGeo community
>
> The release of pgRouting version 3.0.0 is ready [1]
> There are a lot of changes, new functions in all categories
> - official
> - proposed
> - experimental
>
> This release was planned to be done originally on the end of last 
> year, but due to many tasks like:
> - move up as many functions as we could from proposed to official
> - move up as many experimental functions to either proposed or to 
> official.
> - CI testing as many operative systems testing as we could.
>
> The release was delayed to the code sprint, which unfortunately was 
> cancelled, but that did not stop the team from keeping on schedule.
>
> Please read the documentation [2] and we have also a complete spanish 
> version of the documentation [3]
>
> Regards
> From pgRouting team
>
> [1] https://github.com/pgRouting/pgrouting/releases/tag/v3.0.0
> [2] https://docs.pgrouting.org/3.0/en/
> [3] https://docs.pgrouting.org/3.0/es/
>
> A comprehensive list of changes:
>
> /New functions/
>
>  *
>
>     Kruskal family
>
>       o pgr_kruskal
>       o pgr_kruskalBFS
>       o pgr_kruskalDD
>       o pgr_kruskalDFS
>  *
>
>     Prim family
>
>       o pgr_prim
>       o pgr_primDD
>       o pgr_primDFS
>       o pgr_primBFS
>
> /Proposed moved to official on pgRouting/
>
>  *
>
>     aStar Family
>
>       o pgr_aStar(one to many)
>       o pgr_aStar(many to one)
>       o pgr_aStar(many to many)
>       o pgr_aStarCost(one to one)
>       o pgr_aStarCost(one to many)
>       o pgr_aStarCost(many to one)
>       o pgr_aStarCost(many to many)
>       o pgr_aStarCostMatrix(one to one)
>       o pgr_aStarCostMatrix(one to many)
>       o pgr_aStarCostMatrix(many to one)
>       o pgr_aStarCostMatrix(many to many)
>  *
>
>     bdAstar Family
>
>       o pgr_bdAstar(one to many)
>       o pgr_bdAstar(many to one)
>       o pgr_bdAstar(many to many)
>       o pgr_bdAstarCost(one to one)
>       o pgr_bdAstarCost(one to many)
>       o pgr_bdAstarCost(many to one)
>       o pgr_bdAstarCost(many to many)
>       o pgr_bdAstarCostMatrix(one to one)
>       o pgr_bdAstarCostMatrix(one to many)
>       o pgr_bdAstarCostMatrix(many to one)
>       o pgr_bdAstarCostMatrix(many to many)
>  *
>
>     bdDijkstra Family
>
>       o pgr_bdDijkstra(one to many)
>       o pgr_bdDijkstra(many to one)
>       o pgr_bdDijkstra(many to many)
>       o pgr_bdDijkstraCost(one to one)
>       o pgr_bdDijkstraCost(one to many)
>       o pgr_bdDijkstraCost(many to one)
>       o pgr_bdDijkstraCost(many to many)
>       o pgr_bdDijkstraCostMatrix(one to one)
>       o pgr_bdDijkstraCostMatrix(one to many)
>       o pgr_bdDijkstraCostMatrix(many to one)
>       o pgr_bdDijkstraCostMatrix(many to many)
>  *
>
>     Flow Family
>
>       o pgr_pushRelabel(one to one)
>       o pgr_pushRelabel(one to many)
>       o pgr_pushRelabel(many to one)
>       o pgr_pushRelabel(many to many)
>       o pgr_edmondsKarp(one to one)
>       o pgr_edmondsKarp(one to many)
>       o pgr_edmondsKarp(many to one)
>       o pgr_edmondsKarp(many to many)
>       o pgr_boykovKolmogorov (one to one)
>       o pgr_boykovKolmogorov (one to many)
>       o pgr_boykovKolmogorov (many to one)
>       o pgr_boykovKolmogorov (many to many)
>       o pgr_maxCardinalityMatching
>       o pgr_maxFlow
>       o pgr_edgeDisjointPaths(one to one)
>       o pgr_edgeDisjointPaths(one to many)
>       o pgr_edgeDisjointPaths(many to one)
>       o pgr_edgeDisjointPaths(many to many)
>  *
>
>     Components family
>
>       o pgr_connectedComponents
>       o pgr_strongComponents
>       o pgr_biconnectedComponents
>       o pgr_articulationPoints
>       o pgr_bridges
>  *
>
>     Contraction:
>
>       o Removed unnecessary column seq (breaking change)
>
> /New Experimental functions/
>
>  *
>
>     pgr_maxFlowMinCost
>
>  *
>
>     pgr_maxFlowMinCost_Cost
>
>  *
>
>     pgr_extractVertices
>
>  *
>
>     pgr_turnRestrictedPath
>
>  *
>
>     pgr_stoerWagner
>
>  *
>
>     pgr_dagShortestpath
>
>  *
>
>     pgr_topologicalSort
>
>  *
>
>     pgr_transitiveClosure
>
>  *
>
>     VRP category
>
>       o pgr_pickDeliverEuclidean
>       o pgr_pickDeliver
>  *
>
>     Chinese Postman family
>
>       o pgr_chinesePostman
>       o pgr_chinesePostmanCost
>  *
>
>     Breadth First Search family
>
>       o pgr_breadthFirstSearch
>       o pgr_binaryBreadthFirstSearch
>  *
>
>     Bellman Ford family
>
>       o pgr_bellmanFord
>       o pgr_edwardMoore
>
>
>
> -- 
> Georepublic UG (haftungsbeschränkt)
> Salzmannstraße 44,
> 81739 München, Germany
>
> Vicky Vergara
> Operations Research
>
> eMail: vicky at georepublic.de  <http://georepublic.de>
> Web:https://georepublic.info
>
> Tel: +49 (089) 4161 7698-1
> Fax: +49 (089) 4161 7698-9
>
> Commercial register: Amtsgericht München, HRB 181428
> CEO: Daniel Kastl
>
>
> _______________________________________________
> Pgrouting-users mailing list
> Pgrouting-users at lists.osgeo.org
> https://lists.osgeo.org/mailman/listinfo/pgrouting-users