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 vote222 views1 answer
Django forms request
Python
0 vote196 views1 answer
Python list inster 0
Python
10 votes207 views3 answers
Fibonacci series python recursion
Python
7 votes225 views1 answer
Jupyter install user environment
Python
4 votes200 views2 answers
Check if a string is float python
Python
6 votes190 views2 answers
Unique list values python ordered
Python
2 votes180 views2 answers
'flask' is not recognized as an internal or external command, operable program or batch file.
Python
1 vote207 views2 answers
Run flask app windows
Python
0 vote206 views1 answer
How to solve not in base 10 in python when using decimals
Python
0 vote200 views1 answer
Statsmodels fitted values
Python