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 vote152 views1 answer
Spark write progress bar jupyter
Python
1 vote153 views1 answer
Spike python
Python
0 vote145 views1 answer
Python divide string in half
Python
0 vote158 views1 answer
How to resize image with pillow in django
Python
0 vote145 views1 answer
Python textbox
Python
0 vote131 views3 answers
Fibonacci series in python using recursion
Python
2 votes114 views1 answer
Django.core.exceptions.improperlyconfigured: wsgi application 'backend.wsgi.application' could not be loaded; error importing module.
Python
1 vote173 views1 answer
Python module install a whl
Python
0 vote202 views1 answer
Renpy quickstart
Python
1 vote159 views1 answer
Mnist fashion dataset
Python