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 vote212 views1 answer
Delete history django simple
Python Django
0 vote166 views1 answer
Pyttsx3 speech to mp3
Python
0 vote182 views1 answer
Numpy element sum privous
Python
2 votes189 views2 answers
Pypi
Python
0 vote192 views1 answer
Python if index not out of range
Python
3 votes179 views2 answers
Python file location path
Python
0 vote189 views2 answers
Django get superuser password
Python
3 votes185 views3 answers
Pytest
Python
-1 vote199 views3 answers
Find the sum of all the multiples of 3 or 5 below 1000 python
Python
19 votes183 views1 answer
10 minute timer
Python