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

0 vote361 views1 answer
Take substring of every element in dataframe
Python
1 vote482 views3 answers
Convert c++ code to python online
Python
2 votes341 views1 answer
Np.pad
Python
-1 vote351 views2 answers
Shutil remove
Python
3 votes329 views2 answers
Discord.py edit messages
Python
2 votes339 views2 answers
Python kill process windows
Python
0 vote445 views1 answer
How to export schema in graphene django
Python Django
0 vote349 views1 answer
Add halt for 10 seconds in selenium python
Python
3 votes325 views2 answers
Python dict order a dict by key
Python
12 votes337 views4 answers
Rotate labels matplotlib
Python