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

3 votes100 views3 answers
Python create dictionary from csv
Python
0 vote131 views1 answer
Procfile for django heroku
Python Django
1 vote100 views1 answer
Python background function
Python
13 votes97 views4 answers
Python get screen size
Python
2 votes140 views1 answer
Pass in queryset as filter django
Python Django
4 votes123 views3 answers
Python get script name
Python
0 vote96 views1 answer
Python pandas markdown print export
Python
1 vote104 views1 answer
E: Unable to locate package python3-pip docker file
Python
1 vote106 views1 answer
Delete last message discord.py
Python
2 votes96 views4 answers
Pandas frequency
Python