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

-2 votes333 views4 answers
Codeforces
Python
1 vote302 views1 answer
Skip items for loop
Python
0 vote396 views1 answer
Python: subset top 5 values in a column
Python
40 votes330 views3 answers
Python push to dataframe pandas
Python
0 vote327 views1 answer
How to multiply integer value with float values in python
Python
0 vote300 views1 answer
All classification algorithim compare
Python
4 votes336 views2 answers
Compare multiple columns in pandas
Python
4 votes318 views4 answers
Interface graphique sur python
Python
15 votes334 views2 answers
Python 3.9 beautifulsoup kurulumu
Python
0 vote335 views1 answer
Random.choices without repetition
Python