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

2 votes241 views1 answer
Validate IP Address
Python
0 vote197 views1 answer
Rqg3
Python
0 vote187 views1 answer
Create limit using matplotlib
Python
0 vote200 views1 answer
Convert hex rgb to matplotlib color
Python
0 vote201 views1 answer
Launching tensorboard from a python script
Python
10 votes183 views2 answers
Python convert hex number to decimal
Python
0 vote265 views1 answer
How to write a script to display an image in python
Python
5 votes190 views6 answers
Python epoch to datetime
Python
0 vote225 views1 answer
Python dlib
Python
0 vote200 views1 answer
Python no label in legend matplot
Python