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 vote179 views1 answer
Pandas loop over chunk of rows
Python
16 votes196 views6 answers
Python turtle setup
Python
0 vote183 views1 answer
Int' object is not subscriptable in python
Python
0 vote183 views1 answer
B'[AUTHENTICATIONFAILED] Invalid credentials (Failure)'
Python
1 vote238 views1 answer
Django crispy forms foundation for site
Python
4 votes204 views2 answers
Mkvirtualenv environment python 3
Python
2 votes182 views2 answers
Python program to find first n prime numbers
Python
23 votes175 views6 answers
Flask post
Python
1 vote183 views1 answer
Extract data from lichess python
Python
2 votes187 views1 answer
Tensorflow reduce_sum
Python