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

0 vote317 views1 answer
Upload data to s3 bucket python
Python
80 votes308 views6 answers
How to find python version
Python
5 votes349 views3 answers
Python subplot space between plots
Python
1 vote299 views1 answer
Circular array python
Python
4 votes299 views3 answers
Python vs Java
Python
0 vote312 views1 answer
How to use + with strings
Python
0 vote285 views1 answer
Or en python
Python
93 votes350 views6 answers
Creating virtual environment python
Python
0 vote304 views1 answer
Numpy fill empty array
Python
0 vote317 views1 answer
How to execute queries with cxoracle python
Python