Update docs.

diff --git a/src/pyutils/graph.py b/src/pyutils/graph.py
index 24a921372bf5d28cc0a08d386236b9f72bac45e0..099bc2c9ca9bc6f9d359c655a1bbb9354829744e 100644 (file)
--- a/src/pyutils/graph.py
+++ b/src/pyutils/graph.py
@@ -309,11 +309,11 @@ class Graph(object):
 
         .. note::
 
-        This method runs Dijkstra's algorithm
-        (https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm)
-        internally and caches the results.  Subsequent calls made with
-        the same source node before modifying the graph are less
-        expensive due to these cached intermediate results.
+            This method runs Dijkstra's algorithm
+            (https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm)
+            internally and caches the results.  Subsequent calls made with
+            the same source node before modifying the graph are less
+            expensive due to these cached intermediate results.
 
         Returns:
             A tuple containing the minimum distance of the path and the path itself.