Git-Mirrors/master-algorithms-py
1
0
Fork 0
mirror of https://github.com/autistic-symposium/master-algorithms-py.git synced 2025-04-29 20:26:07 -04:00
Code Issues Packages Projects Releases Wiki Activity

Update bfs.py

Browse Source
This commit is contained in:
bt3gl 2023-08-08 16:14:09 -07:00 committed by GitHub
parent f117ec52e5
commit c8fad05719
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 9 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
graphs/bfs.py
View File

@ -18,34 +18,32 @@ class Graph:
def bfs(graph, v, discovered): def bfs(graph, v, discovered):
q = deque() queue = deque(v)
discovered[v] = True discovered[v] = True
q.append(v) while queue:
while q: v = queue.popleft()
v = q.popleft()
print(v, end=' ') print(v, end=' ')
for u in graph.adj_list[v]: for u in graph.adj_list[v]:
if not discovered[u]: if not discovered[u]:
discovered[u] = True discovered[u] = True
q.append(u) queue.append(u)
def recursive_bfs(graph, q, discovered): def recursive_bfs(graph, queue, discovered):
if not q: if not queue:
return return
v = q.popleft() v = queue.popleft()
print(v, end=' ') print(v, end=' ')
for u in graph.adj_list[v]: for u in graph.adj_list[v]:
if not discovered[u]: if not discovered[u]:
discovered[u] = True discovered[u] = True
q.append(u) queue.append(u)
recursive_bfs(graph, q, discovered) recursive_bfs(graph, queue, discovered)