Commit55e0b0f

authored and

committed

Corrected wrong DFS implementation (#903)

1 parent6e2fb22 commit55e0b0fCopy full SHA for 55e0b0f

File tree

-1

lines changed

-1

lines changed

Lines changed: 0 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -16,7 +16,6 @@ def dfs(graph, start):`
`16`	`16`	`to the node's children onto the iterator stack. When the iterator at the top of the stack terminates, we'll pop`
`17`	`17`	`it off the stack."""`
`18`	`18`	`explored,stack=set(), [start]`
`19`		`-explored.add(start)`
`20`	`19`	`whilestack:`
`21`	`20`	`v=stack.pop()# one difference from BFS is to pop last element here instead of first one`
`22`	`21`

Comments

(0)