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 vote319 views1 answer
Python selenium send keys enter send
Python
0 vote312 views1 answer
Split by backslash python
Python
0 vote348 views1 answer
Shutdown flask server with request
Python
0 vote343 views1 answer
The requested resource was not found on this server. django
Python Django
1 vote316 views1 answer
Flask sending post request
Python
1 vote326 views1 answer
Seaborn plot set ylabel
Python
1 vote277 views1 answer
Python close all figures
Python
1 vote323 views2 answers
How to define the name of your tkinter window
Python
13 votes329 views3 answers
Actual keystroke python
Python
0 vote344 views1 answer
Boto3 rename file s3
Python