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 vote303 views1 answer
Python how to get rid of spaces in print
Python
0 vote277 views1 answer
Method for format age in python
Python
2 votes265 views1 answer
Plot histogram in seaborn
Python
8 votes262 views2 answers
Import math sqrt python
Python
2 votes269 views2 answers
Python isdigit negative
Python
0 vote362 views1 answer
Is_valid method django
Python
0 vote250 views1 answer
Foreignkey as users from a user group django
Python
9 votes255 views6 answers
Python text to speech
Python
0 vote259 views1 answer
Python update header row
Python
34 votes241 views6 answers
How to update a python package
Python