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 vote144 views1 answer
Flask minimal install
Python Flask
9 votes105 views3 answers
How to make a random variable in python
Python
0 vote138 views1 answer
AttributeError: This QueryDict instance is immutable django
Python Django
0 vote186 views1 answer
Pyplot define plotsize
Python
1 vote109 views2 answers
Install fasttext python
Python
0 vote99 views1 answer
Python ip location lookup
Python
4 votes101 views2 answers
How to plot two columns graphs in python
Python
0 vote126 views1 answer
Torch print floating precision
Python
9 votes112 views6 answers
How to make a calculator in python
Python
0 vote147 views1 answer
Django change settings at runtime
Python Django