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

1 vote156 views1 answer
How to convert character to factor in python
Python
0 vote134 views1 answer
You will be passed a file path P and string S on the command line. Output the number of times the string S appears in the file P.
Python
0 vote124 views1 answer
No module named 'fastai.text.all'
Python
2 votes144 views3 answers
Pandas print dataframe without index
Python
0 vote121 views1 answer
Pass context data with templateview in django
Python
2 votes120 views3 answers
Python format currency
Python
0 vote185 views1 answer
Python googledriver download
Python
0 vote119 views1 answer
Longueur liste python
Python
0 vote152 views2 answers
Flask return html
Python
-1 vote123 views4 answers
Play video in colab
Python