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

14 votes107 views4 answers
Spyder python
Python
0 vote116 views1 answer
Python OPERATORS, Data Types: LIST, SET, TUPLE, DICTIONARY
Python
27 votes118 views2 answers
Auto-py-to-exe with python3
Python
0 vote105 views1 answer
Cbv uk django
Python
1 vote113 views1 answer
Flask run app reset on change
Python
6 votes128 views3 answers
Pdb step into
Python
1 vote117 views4 answers
Numpy count occurrences in array
Python
0 vote102 views1 answer
Open python choose encoding
Python
0 vote109 views1 answer
List dictionary to json file python with tab
Python
0 vote101 views1 answer
Python ssl module is not available
Python