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 vote182 views1 answer
Python sh command
Python
1 vote175 views1 answer
Frequency of occurrence of that element in the list and the positions
Python
0 vote178 views1 answer
Parsing a file and adding a number at starting of every line sentence python
Python
1 vote156 views1 answer
Split a text file into multiple paragraphs python
Python
0 vote162 views1 answer
Named tuple python iterate
Python
9 votes192 views2 answers
Python extract values that have different values in a column
Python
6 votes157 views2 answers
Imshow grayscale
Python
0 vote222 views1 answer
Dump ML Model
Python
9 votes166 views6 answers
How to use print in python
Python
2 votes158 views2 answers
Python fillna with mode
Python