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 vote284 views1 answer
Convert .tiff image stack to unit8 format
Python
0 vote302 views1 answer
Rdflib get toal number of triples
Python
0 vote258 views1 answer
Python list.append string return empty
Python
8 votes279 views4 answers
How to change icon in pygame
Python
0 vote292 views1 answer
Fill a column based on values in another column pandas
Python
0 vote368 views1 answer
Finding Maximum Elements along columns using Python numpy.argmax()
Python
2 votes255 views1 answer
When did guido van rossum create python
Python
11 votes283 views5 answers
Poetry python
Python
0 vote274 views1 answer
Flask where to put db.create_all
Python
0 vote266 views1 answer
Verilog import module
Python