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 vote352 views1 answer
Kick member discord py
Python
0 vote322 views1 answer
Monthly precipitation in python
Python
0 vote432 views1 answer
Circular import python
Python
0 vote356 views1 answer
How does sns boxplot determine outliers
Python
14 votes328 views2 answers
How to check if a dictionary is empty in python
Python
0 vote335 views1 answer
How to cut image python
Python
0 vote312 views1 answer
Come mettere una scelta su python
Python
0 vote404 views1 answer
Django create ap
Python
1 vote375 views1 answer
Print even numbers in python
Python
92 votes337 views6 answers
Turn python script into exe
Python