fix graph/find_shortest_path (keon#389)

chruit30 · keon · commit 763221d7bdd9 · 2018-08-15T05:51:29.000-07:00
diff --git a/algorithms/graph/find_path.py b/algorithms/graph/find_path.py
@@ -43,7 +43,7 @@ def find_shortest_path(graph, start, end, path=[]):
     shortest = None
     for node in graph[start]:
         if node not in path:
-            newpath = find_shortest_path(graph, start, end, path)
+            newpath = find_shortest_path(graph, node, end, path)
             if newpath:
                 if not shortest or len(newpath) < len(shortest):
                     shortest = newpath
