Created
August 25, 2022 15:18
-
-
Save 0scarB/4dda83fcfbadf61a9b463ff2aaf41453 to your computer and use it in GitHub Desktop.
DFS returning path
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def dfs(graph, start, goal, path=None, visited=None): | |
| path = path or [] | |
| visited = visited or set() | |
| path.append(start) | |
| visited.add(start) | |
| if start == goal: | |
| return path | |
| for neighbor in graph[start]: | |
| if neighbor not in visited: | |
| try: | |
| return dfs(graph, neighbor, goal, path, visited) | |
| except ValueError: | |
| pass | |
| raise ValueError(f"Could not find path from {start=} to {goal=}") | |
| if __name__ == "__main__": | |
| path = dfs( | |
| { | |
| 0: [2, 3, 4], | |
| 1: [0, 6], | |
| 2: [4, 6], | |
| 3: [2, 4, 5, 6], | |
| 4: [0, 1, 2, 3, 5, 6], | |
| 5: [0, 1, 3, 4], | |
| 6: [1, 2, 4, 5] | |
| }, | |
| 0, | |
| 1 | |
| ) | |
| print(path) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment