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 vote285 views1 answer
AttributeError: Can't get attribute on <module '__main__' from manage.py
Python
0 vote245 views2 answers
How to update sklearn
Python
1 vote222 views1 answer
Failed to execute script
Python
2 votes260 views1 answer
Convert time zone pandas
Python
39 votes230 views2 answers
String to list of characters python
Python
-1 vote255 views1 answer
Pandas mask multiple condition
Python
1 vote238 views1 answer
ImportError: cannot import name 'TFAutoModel' from 'transformers'
Python
0 vote235 views1 answer
Np.random.randint to generate -1 +1
Python
0 vote250 views1 answer
How to convert a matrix string back to a matrix python
Python
1 vote231 views2 answers
Get the torch version
Python