[doc] Update release_notes and NEWS

* pgr_bipartite * pgr_lengauerTarjanDominatorTree
pgRouting · Dec 15, 2020 · 72827e5 · 72827e5
1 parent 4ba866b
commit 72827e5
Show file tree

Hide file tree

Showing 2 changed files with 4 additions and 0 deletions.
diff --git a/NEWS b/NEWS
@@ -6,6 +6,7 @@ pgRouting 3.2.0 Release Notes
 
 * pgr_bellmanFord(Combinations)
 * pgr_binaryBreadthFirstSearch(Combinations)
+* pgr_bipartite
 * pgr_dagShortestPath(Combinations)
 * pgr_depthFirstSearch
 * pgr_dijkstraNear(One to Many)
@@ -18,6 +19,7 @@ pgRouting 3.2.0 Release Notes
 * pgr_dijkstraNearCost(Combinations)
 * pgr_edwardMoore(Combinations)
 * pgr_isPlanar
+* pgr_lengauerTarjanDominatorTree
 * pgr_makeConnected
 * pgr_maxFlowMinCost(Combinations)
 * pgr_maxFlowMinCost_Cost(Combinations)

diff --git a/doc/src/release_notes.rst b/doc/src/release_notes.rst
@@ -65,6 +65,7 @@ pgRouting 3.2.0 Release Notes
 
 * pgr_bellmanFord(Combinations)
 * pgr_binaryBreadthFirstSearch(Combinations)
+* pgr_bipartite
 * pgr_dagShortestPath(Combinations)
 * pgr_depthFirstSearch
 * pgr_dijkstraNear(One to Many)
@@ -77,6 +78,7 @@ pgRouting 3.2.0 Release Notes
 * pgr_dijkstraNearCost(Combinations)
 * pgr_edwardMoore(Combinations)
 * pgr_isPlanar
+* pgr_lengauerTarjanDominatorTree
 * pgr_makeConnected
 * pgr_maxFlowMinCost(Combinations)
 * pgr_maxFlowMinCost_Cost(Combinations)