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 vote299 views1 answer
Django filter values with e and operator
Python Django
15 votes256 views4 answers
How to install package in python shell
Python
0 vote268 views1 answer
NameError: name 'accuracy_score' is not defined
Python
0 vote248 views1 answer
Verilog import module
Python
0 vote250 views1 answer
Jupyter notebook not showing all columns
Python
12 votes266 views6 answers
Set python 3 as default mac
Python
16 votes257 views6 answers
Python install pandas
Python
0 vote233 views1 answer
Hebrew range
Python
3 votes240 views2 answers
What day i s it
Python
1 vote253 views2 answers
Get the torch version
Python