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 vote174 views1 answer
Jupyter_ascending
Python
8 votes202 views2 answers
Split range python
Python
0 vote174 views2 answers
Django ajax body to json
Python
0 vote218 views1 answer
Django insert bulk data
Python Django
8 votes279 views2 answers
Django create empty migration
Python Django
0 vote181 views1 answer
Updating many to many field in django using pk
Python
0 vote270 views2 answers
Fetch api flask url redirect
Python Flask
3 votes172 views1 answer
Python sort complexity
Python
0 vote199 views1 answer
Python extract all characters from string before a character
Python
0 vote188 views1 answer
Xgboost feature importance
Python