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 vote347 views6 answers
Python tuple methods
Python
3 votes353 views3 answers
Import flask
Python Flask
1 vote353 views1 answer
How to convert async function to sync function in python
Python
1 vote373 views1 answer
Django how to set a navbar active
Python Django
0 vote361 views1 answer
Draw networkx graph using plt.pause
Python
1 vote333 views1 answer
Finding the Variance and Standard Deviation of a list of numbers in Python
Python
7 votes350 views2 answers
Dunkleosteus
Python
0 vote308 views1 answer
Pytorch calculate mse mae
Python
2 votes300 views3 answers
Display entire row pandas
Python
0 vote359 views1 answer
How to use wbtools in python
Python