Dfs and bfs inn python

def dfs(graph, start):
    visited, stack = set(), [start]
    while stack:
        vertex = stack.pop()
        if vertex not in visited:
            visited.add(vertex)
            stack.extend(graph[vertex] - visited)
    return visited

dfs(graph, 'A') # {'E', 'D', 'F', 'A', 'C', 'B'}

Source: eddmann.com

Similar codes

17 votes311 views4 answers
WARNING: You are using pip version 21.2.3; however, version 21.2.4 is available
Python
9 votes299 views3 answers
Python remove empty list
Python
9 votes307 views1 answer
Python delete none from list
Python
0 vote314 views3 answers
Autoextract scrapy spider
Python
0 vote289 views1 answer
Python time function duration and memory usage
Python
2 votes297 views2 answers
How to change key to value and versa in python dictionary
Python
0 vote376 views1 answer
Django Abstract base classe
Python Django
0 vote304 views1 answer
Cannot find opera binary selenium python
Python
1 vote308 views2 answers
Pyttsx3 set volume
Python
0 vote293 views1 answer
Pandas count all values in whole dataframe
Python