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

1 vote163 views1 answer
Correr servidor django
Python Django
0 vote138 views1 answer
How to make a random int in python
Python
0 vote136 views1 answer
Gene wilder pure imagination
Python
0 vote153 views1 answer
The Python 2 bindings for rpm are needed for this module. If you require Python 3 support use the `dnf` Ansible module instead.. The Python 2 yum module is needed for this module. If you require Python 3 support use the `dnf` Ansible module instead.
Python
0 vote133 views1 answer
How to code discord bot 8ball python
Python
0 vote105 views1 answer
Opencv change color
Python
0 vote132 views2 answers
Py search and get objects from array
Python
1 vote128 views1 answer
Numpy dot product
Python
-1 vote128 views2 answers
Write a python program to multiplies all the items in a list.
Python
1 vote136 views1 answer
Pandas find median of non zero values in a column
Python