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

3 votes104 views1 answer
Factorial program
Python
0 vote155 views1 answer
Django cms create page programmatically
Python Django
0 vote144 views1 answer
Adding extra fields to user model django
Python Django
0 vote103 views1 answer
How to use fastapi ApiClient with pytest
Python
52 votes143 views6 answers
Sorting a dictionary in python
Python
3 votes109 views2 answers
How to edit a specific line in text file in python
Python
0 vote112 views1 answer
How to make a stopwatch in pythoon
Python
7 votes118 views1 answer
Filter dataframe multiple conditions
Python
0 vote125 views1 answer
Qlcdnumber set value python
Python
-1 vote128 views3 answers
Play Video in Google Colab
Python