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 vote229 views1 answer
Python update header row
Python
133 votes211 views6 answers
Python input
Python
0 vote223 views1 answer
Save list pickle
Python
8 votes232 views1 answer
Python install module from script
Python
-1 vote227 views1 answer
Decimal conversion python
Python
5 votes228 views3 answers
Python download from web
Python
1 vote247 views1 answer
ValueError: There may be at most 1 Subject headers in a message
Python
0 vote224 views1 answer
Scatter density plot seaborn
Python
-1 vote219 views1 answer
Sort dict of dicts by key
Python
0 vote213 views1 answer
ModuleNotFoundError: No module named 'yaspin'
Python