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 vote153 views1 answer
Qtablewidget clear python
Python
5 votes135 views2 answers
Install pandas in python mac
Python
2 votes151 views1 answer
Flask make static directory
Python
2 votes185 views1 answer
How to make otp generator in python
Python
0 vote176 views1 answer
How to discover which index labels are in other
Python
0 vote178 views1 answer
Numpy documentation realpython
Python
3 votes170 views1 answer
Lambda with two columns pandas
Python
1 vote135 views1 answer
Use incognito mode in selenium webdriver
Python
1 vote272 views3 answers
List of dict to df
Python
2 votes168 views2 answers
Write object to file python
Python