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 vote323 views1 answer
Python pandas get labels
Python
0 vote353 views1 answer
Pandas read csv encoding thai
Python
0 vote359 views1 answer
Dynamic grid using tkinter
Python
0 vote359 views1 answer
Sqlite3 python parameterized query insert into
Python
0 vote421 views1 answer
Django include all columns admin show
Python Django
1 vote343 views1 answer
Backup django db from one database to another
Python
0 vote354 views1 answer
Filters rows using the given condition
Python
0 vote356 views10 answers
Installez django-cruds-adminlte
Python
0 vote341 views1 answer
How to add a under line of the button in tkinter python
Python
0 vote333 views2 answers
Change index of dataframe with list
Python