(doc) fixing grammar, spelling and sphinx issues

Author: cvvergara

NEWS.md

@@ -32,13 +32,13 @@ For developers:
 
 Documentation build
 
-* The doxygen documentation is build by default
-* The HTML documentation is build by default
-* The translated languages (en, es, sv, zh_Hans) HTML documentation is build by
+* The doxygen documentation is built by default
+* The HTML documentation is built by default
+* The translated languages (en, es, sv, zh_Hans) HTML documentation are built by
   default
 * `WITH-DOC` is not used anymore
 
-User's Documentation is not build when
+User Documentation is not built when
 
 * Sphinx is not found
 * When all Sphinx formats are OFF
@@ -53,7 +53,7 @@ User's Documentation is not build when
 
   * For example: for HTML output is on `build/doc/_build/html` directory
 
-Developers's Documentation is not build when
+Developers' Documentation is not built when
 
 * Doxygen is not found
 * To not build Doxygen documentation: `-DBUILD_DOXY=OFF`
@@ -336,7 +336,7 @@ SQL signatures and output standardization
 * [#2907](https://github.com/pgRouting/pgrouting/issues/2907): pgr_bellmanFord
 * [#2908](https://github.com/pgRouting/pgrouting/issues/2908): pgr_binaryBreadthFirstSearch
 * [#2910](https://github.com/pgRouting/pgrouting/issues/2910): pgr_edwardMoore
-* [#2913](https://github.com/pgRouting/pgrouting/issues/2913): pgr_DAGshortestPath
+* [#2913](https://github.com/pgRouting/pgrouting/issues/2913): pgr_dagShortestPath
 
 **Standardized to ``(start_vid, end_vid, agg_cost)``**
 
@@ -346,7 +346,7 @@ SQL signatures and output standardization
 **Standardized to ``(seq, path_id, path_seq, start_vid, end_vid, node, edge, cost, agg_cost)``**
 
 * [#2909](https://github.com/pgRouting/pgrouting/issues/2909): pgr_edgeDisjointPaths
-* [#2909](https://github.com/pgRouting/pgrouting/issues/2909): pgr_turnRestrictedPaths
+* [#2909](https://github.com/pgRouting/pgrouting/issues/2909): pgr_turnRestrictedPath
 
 **Standardized to ``(edge, color)``**
 

doc/bdAstar/pgr_bdAstarCostMatrix.rst

@@ -34,7 +34,7 @@ Description
 
 **The main characteristics are:**
 
-* Internally uses the :doc:`pgr_bdAstar` algorithm
+* Internally uses the :doc:`pgr_bdAstar` algorithm.
 * Returns a cost matrix.
 * No ordering is performed
 * let `v` and `u` are nodes on the graph:

doc/src/release_notes.rst

@@ -67,13 +67,13 @@ For developers:
 Documentation build
 ...............................................................................
 
-* The doxygen documentation is build by default
-* The HTML documentation is build by default
-* The translated languages (en, es, sv, zh_Hans) HTML documentation is build by
+* The doxygen documentation is built by default
+* The HTML documentation is built by default
+* The translated languages (en, es, sv, zh_Hans) HTML documentation are built by
   default
 * `WITH-DOC` is not used anymore
 
-User's Documentation is not build when
+User Documentation is not built when
 
 * Sphinx is not found
 * When all Sphinx formats are OFF
@@ -88,7 +88,7 @@ User's Documentation is not build when
 
   * For example: for HTML output is on `build/doc/_build/html` directory
 
-Developers's Documentation is not build when
+Developers' Documentation is not built when
 
 * Doxygen is not found
 * To not build Doxygen documentation: `-DBUILD_DOXY=OFF`
@@ -392,7 +392,7 @@ SQL signatures and output standardization
 * :issue:`2907`: pgr_bellmanFord
 * :issue:`2908`: pgr_binaryBreadthFirstSearch
 * :issue:`2910`: pgr_edwardMoore
-* :issue:`2913`: pgr_DAGshortestPath
+* :issue:`2913`: pgr_dagShortestPath
 
 .. rubric:: Standardized to |matrix-result|
 
@@ -402,7 +402,7 @@ SQL signatures and output standardization
 .. rubric:: Standardized to |generic-result|
 
 * :issue:`2909`: pgr_edgeDisjointPaths
-* :issue:`2909`: pgr_turnRestrictedPaths
+* :issue:`2909`: pgr_turnRestrictedPath
 
 .. rubric:: Standardized to |result_edge_color|
 

doc/traversal/pgr_binaryBreadthFirstSearch.rst

@@ -51,8 +51,8 @@ vertices can be found using Breadth First Search in :math:`O(|E|)` in an
 unweighted graph, i.e. the distance is the minimal number of edges that you
 need to traverse from the source to another vertex. We can interpret such a
 graph also as a weighted graph, where every edge has the weight :math:`1`.
-If not all edges in graph have the same weight, that we need a more general
-algorithm, like Dijkstra's Algorithm which runs in :math:`O(|E|log|V|)` time.
+If not all edges in graph have the same weight, then we a more general
+algorithm is needed, like Dijkstra's Algorithm which runs in :math:`O(|E|log|V|)` time.
 
 However if the weights are more constrained, we can use a faster algorithm.
 This algorithm, termed as 'Binary Breadth First Search' as well as '0-1 BFS',