faif · faif · Sep 26, 2020 · faif · Sep 26, 2020 · techntools
diff --git a/patterns/other/graph_search.py b/patterns/other/graph_search.py
-            node = edge_to[node]
-        path.insert(0, start)
-        return path
+                    if end in edge_to.keys():
diff --git a/patterns/other/graph_search.py b/patterns/other/graph_search.py
+    ['G', 'E', 'F']
+
+    # unreachable node
+    >>> print(graph_search.find_path_dfs('C', 'H'))
diff --git a/patterns/other/graph_search.py b/patterns/other/graph_search.py
+    None
+
+    # non existing node
+    >>> print(graph_search.find_path_dfs('C', 'X'))