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

4 votes143 views3 answers
OSError: [Errno 98] Address already in use
Python
7 votes133 views1 answer
Short if else in python
Python
21 votes143 views1 answer
How to plot a graph using matplotlib
Python
6 votes140 views2 answers
How many nan in array python
Python
0 vote145 views1 answer
Django create object with default today date
Python
0 vote154 views1 answer
Gtk label set label
Python
8 votes130 views2 answers
Python float print 2 digits
Python
0 vote222 views1 answer
The day before today python datetime
Python
1 vote152 views4 answers
Python ip camera
Python
8 votes129 views1 answer
Remove strings from a list python if they're short
Python