update literalincludes for new example paths

Author: minrk

docs/source/reference/dag_dependencies.rst

@@ -81,7 +81,7 @@ The code to generate the simple DAG:
 For demonstration purposes, we have a function that generates a random DAG with a given
 number of nodes and edges.
 
-.. literalinclude:: ../../../examples/dagdeps.py
+.. literalinclude:: ../examples/dagdeps.py
     :language: python
     :lines: 20-36
 
@@ -140,7 +140,7 @@ These objects store a variety of metadata about each task, including various tim
 We can validate that the dependencies were respected by checking that each task was
 started after all of its predecessors were completed:
 
-.. literalinclude:: ../../../examples/dagdeps.py
+.. literalinclude:: ../examples/dagdeps.py
     :language: python
     :lines: 64-70
 

docs/source/tutorial/asyncresult.rst

@@ -108,7 +108,7 @@ Map results are iterable!
 When an AsyncResult object has multiple results (e.g. the :class:`~AsyncMapResult`
 object), you can iterate through results themselves, and act on them as they arrive:
 
-.. literalinclude:: ../../../examples/itermapresult.py
+.. literalinclude:: ../examples/itermapresult.py
     :language: python
     :lines: 20-67
 

docs/source/tutorial/demos.rst

@@ -103,7 +103,7 @@ step the counts from each engine will be added up. To perform this
 calculation, we will need two top-level functions from :file:`pidigits.py`,
 :func:`compute_two_digit_freqs` and :func:`reduce_freqs`:
 
-.. literalinclude:: ../../../examples/pi/pidigits.py
+.. literalinclude:: ../examples/pi/pidigits.py
    :language: python
    :lines: 52-67