Commit 5b7c47e

committed

Corrected dfs function call, needs dfs_2

1 parent 10815b3 commit 5b7c47eCopy full SHA for 5b7c47e

File tree

-5

lines changed

-5

lines changed

Lines changed: 5 additions & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-# Given a graph, there are two methods to`
	`1`	`+# Given a graph, there are two methods to`
`2`	`2`	`# perform traversal on it.`
`3`	`3`	`# 1. Depth First Search (DFS)`
`4`	`4`	`# 2. Breadth First Search (BFS)`
`@@ -17,9 +17,9 @@ def dfs_2(graph, start, visited=None):`
`17`	`17`	`visited = set()`
`18`	`18`	`visited.add(start)`
`19`	`19`	`for next in graph[start] - visited:`
`20`		`- dfs(graph, next, visited)`
	`20`	`+ dfs_2(graph, next, visited)`
`21`	`21`	`return visited`
`22`		`-`
	`22`	`+`
`23`	`23`	`def bfs(graph, start):`
`24`	`24`	`visited, queue = set(), [start]`
`25`	`25`	`while queue:`
`@@ -30,7 +30,7 @@ def bfs(graph, start):`
`30`	`30`	`return visited`
`31`	`31`
`32`	`32`	`# bfs(graph, 'A') # {'B', 'C', 'A', 'F', 'D', 'E'}`
`33`		`-`
	`33`	`+`
`34`	`34`	`def dfs_paths(graph, start, goal):`
`35`	`35`	`stack = [(start, [start])]`
`36`	`36`	`while stack:`
`@@ -47,6 +47,6 @@ def dfs_paths(graph, start, goal):`
`47`	`47`	`'D': set(['B']),`
`48`	`48`	`'E': set(['B', 'F']),`
`49`	`49`	`'F': set(['C', 'E'])}`
`50`		`-`
	`50`	`+`
`51`	`51`	`result = list(dfs_paths(graph, 'A', 'F')) # [['A', 'C', 'F'], ['A', 'B', 'E', 'F']]`
`52`	`52`	`print(result)`

Comments

(0)