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 vote119 views2 answers
Unable to import wx
Python
-1 vote120 views2 answers
Detect grayscale image in python opencv
Python
5 votes78 views1 answer
If string include word in list
Python
7 votes125 views6 answers
Python function
Python
6 votes125 views2 answers
Decimal in python
Python
20 votes121 views2 answers
Which function to use in random module for a list in python
Python
0 vote128 views1 answer
Pandas groupby and show specific column
Python
1 vote126 views1 answer
How to equal two arrays in python with out linking them
Python
0 vote132 views1 answer
Pandas get data from upper row
Python
0 vote155 views1 answer
Scipy solve equation numerically
Python