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 vote266 views1 answer
Csv logger keras
Python
3 votes269 views1 answer
Json not readable python
Python
1 vote277 views2 answers
Block window if another window is open tkinter
Python
4 votes264 views2 answers
Python wait until
Python
0 vote279 views1 answer
Indent python code
Python
0 vote286 views1 answer
Search object in array python
Python
0 vote256 views1 answer
Pairplot with selected field
Python
0 vote257 views1 answer
How to get all links from a google search using python
Python
5 votes291 views2 answers
Get pyhton file path python
Python
3 votes285 views1 answer
Print decimal formatting in python
Python