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 vote193 views1 answer
Python string to operator
Python
0 vote227 views1 answer
Django model meta ordering multiple ordering
Python Django
0 vote183 views1 answer
How to show Screen keyboard ubuntu with python
Python
0 vote182 views1 answer
Django MESSAGE_TAGS
Python
5 votes232 views1 answer
Python string replace index
Python
0 vote184 views1 answer
Multiprocessing pool pass additional arguments
Python
0 vote247 views1 answer
Python cassandra
Python
30 votes192 views5 answers
Python iterate through files in directory
Python
0 vote210 views1 answer
Install python windows powershell
Python
0 vote218 views1 answer
How to define number in python
Python