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

4 votes127 views2 answers
Sklearn
Python
0 vote174 views1 answer
Get feature names from one hot encoder
Python
81 votes154 views6 answers
Python convert string to date
Python
-2 votes145 views1 answer
Python sort list string
Python
-1 vote157 views1 answer
Inverse matrix gauss python
Python
4 votes132 views2 answers
Change django admin title
Python
1 vote139 views1 answer
Final class variable python
Python
0 vote164 views2 answers
Pywhatkit.text to handwriting(text,rgb=[0,0,0])
Python
0 vote139 views1 answer
Tuple: Create tuple
Python
6 votes107 views1 answer
Business logic in django
Python