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 vote199 views1 answer
Run sql query on pandas dataframe
Python
0 vote239 views2 answers
Convert files to JPEG
Python
0 vote197 views1 answer
Permcheck codility python
Python
2 votes196 views1 answer
Drop column
Python
1 vote211 views1 answer
Oython
Python
0 vote209 views1 answer
Python list key string
Python
0 vote202 views1 answer
Procfile heroku python example
Python
0 vote235 views1 answer
Gogle query python simple
Python
0 vote244 views1 answer
Python returned non-zero exit status 1.
Python
31 votes191 views3 answers
Python get names of columns
Python