onyx_online/grokking-algorithms
1
0
Fork 0
mirror of https://github.com/onyx-and-iris/grokking-algorithms.git synced 2025-11-03 22:11:45 +00:00
Code Issues Packages Projects Releases Wiki Activity

use set for visited

Browse Source
This commit is contained in:
onyx-and-iris 2024-01-11 18:54:08 +00:00
parent 10914ee208
commit 6301018adc
2 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
chapter6/ex6.1.py
View File

@ -21,7 +21,7 @@ graph = {
"f": [], "f": [],
} }
visited = [] visited = set()
def bfs(): def bfs():
@ -36,7 +36,7 @@ def bfs():
if current_node.name in visited: if current_node.name in visited:
continue continue
visited.append(current_node.name) visited.add(current_node.name)
next_nodes = graph[current_node.name] next_nodes = graph[current_node.name]
for node in next_nodes: for node in next_nodes:

4
chapter6/ex6.2.py
View File

@ -21,7 +21,7 @@ graph = {
"bat": [], "bat": [],
} }
visited = [] visited = set()
def bfs(): def bfs():
@ -36,7 +36,7 @@ def bfs():
if current_node.name in visited: if current_node.name in visited:
continue continue
visited.append(current_node.name) visited.add(current_node.name)
next_nodes = graph[current_node.name] next_nodes = graph[current_node.name]
for node in next_nodes: for node in next_nodes: