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 vote97 views1 answer
Tensorboard 2.1.0 has requirement grpcio>=1.24.3, but you'll have grpcio 1.15.0 which is incompatible
Python
0 vote109 views3 answers
A program that asks for the user's input of a list of numbers and sort it in reverse in python
Python
0 vote95 views2 answers
Loop through list of tuples python
Python
7 votes945 views1 answer
What is r strip function in python
Python
0 vote150 views3 answers
Flask socketio with gevent
Python Flask
0 vote110 views1 answer
Running code once in a while loop python
Python
0 vote117 views1 answer
Extract text from span python
Python
24 votes57 views4 answers
Valueerror: the truth value of a series is ambiguous. use a.empty, a.bool(), a.item(), a.any() or a.all().
Python
0 vote130 views1 answer
Gtk entry not editable python
Python
0 vote102 views1 answer
Disable console messages in Flask server
Python