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

1 vote224 views1 answer
Get first element of tuple python
Python
16 votes221 views3 answers
Python gitignore
Python
15 votes226 views5 answers
Skimage python
Python
3 votes205 views1 answer
For every file in the folder do python
Python
0 vote228 views1 answer
3d array
Python
-1 vote209 views1 answer
Python plt show legend
Python
0 vote160 views1 answer
Learn jinja2
Python
1 vote212 views1 answer
How to sort dict by value
Python
0 vote214 views1 answer
How to do an infinte while in python
Python
0 vote222 views1 answer
Python .on event triggers
Python