Release of pgRouting 3.0.0

 

The pgRouting development team is pleased to announce the release of pgRouting version 3.0.0
It includes several new graph functions to be used on a postgreSQL-PostGIS database.

Documentation can be found at: https://docs.pgrouting.org/3.0

 

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 (breaking change)

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

OSGeo Sponsors


View all sponsors