fixed broken links to latest to point to 2.3

Author: cvvergara

docs/source/chapters/advanced.rst

@@ -240,7 +240,6 @@ will affect the next shortest path search, and there is no need to rebuild your
 network.
 
 .. literalinclude:: solutions/advanced_problems.sql
-  :language: sql
   :start-after: ad-10.txt
   :end-before: tmp.txt
 

docs/source/chapters/function.rst

@@ -43,7 +43,6 @@ What the function does internally:
 .. _exercise-19:
 
 .. literalinclude:: solutions/fromAtoB.sql
-  :language: sql
   :start-after: atob-2.txt
   :end-before: atob-3.txt
 
@@ -58,7 +57,6 @@ What the function does not do:
 .. rubric:: Example query
 
 .. literalinclude:: solutions/fromAtoB.sql
-  :language: sql
   :start-after: atob-3.txt
   :end-before: ROLLBACK
 

docs/source/chapters/shortest_path.rst

@@ -61,7 +61,7 @@ You can specify when to consider the graph as `directed
       OR EMPTY SET
 
 Description of the parameters can be found in `pgr_dijkstra
-<http://docs.pgrouting.org/latest/en/src/dijkstra/doc/pgr_dijkstra.html#description-of-the-signatures>`_.
+<http://docs.pgrouting.org/2.3/en/src/dijkstra/doc/pgr_dijkstra.html#description-of-the-signatures>`_.
 
 .. note::
   * Many pgRouting functions have ``sql::text`` as one of their arguments. While
@@ -200,7 +200,7 @@ compact result.
       OR EMPTY SET
 
 Description of the parameters can be found in `pgr_dijkstraCost
-<http://docs.pgrouting.org/latest/en/src/dijkstra/doc/pgr_dijkstraCost.html#description-of-the-signatures>`_
+<http://docs.pgrouting.org/2.3/en/src/dijkstra/doc/pgr_dijkstraCost.html#description-of-the-signatures>`_
 
 .. _exercise-5:
 .. rubric:: Exercise 5 - "Many Pedestrians going to different destinations returning aggregate costs."
@@ -236,7 +236,7 @@ search.
 Returns a set of ``pgr_costResult`` (seq, id1, id2, cost) rows, that make up a path.
 
 Description of the parameters can be found in `pgr_astar
-<http://docs.pgrouting.org/latest/en/src/astar/doc/pgr_astar.html#description>`_.
+<http://docs.pgrouting.org/2.3/en/src/astar/doc/pgr_astar.html#description>`_.
 
 .. _exercise-6:
 .. rubric:: Exercise 6 - "Single Pedestrian Routing with Astar."

docs/source/chapters/topology.rst

@@ -114,7 +114,7 @@ This function:
   pgr_createTopology('<table>', <tolerance>, '<geometry column>', '<gid>')
 
 For additional information see `pgr_createTopology
-<http://docs.pgrouting.org/latest/en/src/topology/doc/pgr_createTopology.html>`_.
+<http://docs.pgrouting.org/2.3/en/src/topology/doc/pgr_createTopology.html>`_.
 
 First add source and target column, then run the ``pgr_createTopology`` function
 ... and wait.
@@ -154,13 +154,13 @@ Verify the Routing Network Topology
 
 To verify that there is a basic `Routing Network Topology`:
 
-.. code-block:: sql
+::
 
   \d planet_osm_roads
 
 Also a new table containing the vertices information was created:
 
-.. code-block:: sql
+::
 
   \d planet_osm_roads_vertices_pgr
 

docs/source/chapters/wrapper.rst

@@ -247,7 +247,6 @@ shortest path Dijkstra function.
   * the cost in seconds (travel time)
 
 .. literalinclude:: solutions/wrapper_problems.sql
-  :language: sql
   :start-after: w-17.txt
   :end-before: w-18.txt
 
@@ -260,7 +259,6 @@ shortest path Dijkstra function.
 * Additionally provide information for orientation (heading).
 
 .. literalinclude:: solutions/wrapper_problems.sql
-  :language: sql
   :start-after: w-18.txt
   :end-before: w-19.txt