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 vote149 views1 answer
Size of the query process in python BigQuery
Python
0 vote167 views1 answer
WARNING: Ignoring invalid distribution c program files python39libsite-packages
Python
0 vote153 views1 answer
Python load a txt file and assign a variable
Python
1 vote154 views1 answer
Python inheritance remove an attribute
Python
0 vote153 views1 answer
Python ffmpeg get video fps
Python
19 votes149 views1 answer
How to change the scale of a picture in pygame
Python
1 vote158 views1 answer
Os.system return value
Python
0 vote264 views1 answer
Pandas rolling mean (also known as the moving average).
Python
0 vote144 views1 answer
Ansible playbook to set passwordless sudo
Python
2 votes157 views1 answer
Groups the DataFrame using the specified columns
Python