Important to packagers:

The minimum boost version is now 1.56, to be used with C++11
Boost version starting from 1.75 requires C++14

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_dijkstraNearCost

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

Attachments