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 vote293 views1 answer
Qt convert image to base64
Python
0 vote362 views1 answer
Plt text verticalalignment
Python
0 vote303 views1 answer
Overview of correlations | calculate pearson's r | calculate graph correlation
Python
137 votes299 views6 answers
Python input function
Python
3 votes289 views1 answer
Default argument in flask route
Python
1 vote335 views1 answer
Python count words in file
Python
0 vote287 views1 answer
Ubuntu install pip for python 3.8
Python
24 votes262 views6 answers
Windows activate venv
Python
0 vote264 views1 answer
Numpy symmetrize array
Python
0 vote280 views1 answer
Clicking items in selenium
Python