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

51 votes318 views6 answers
Print colored text python
Python
0 vote274 views1 answer
Random string generate python of 2.7
Python
6 votes353 views1 answer
Button in flask
Python Flask
0 vote307 views1 answer
Pillow python update image
Python
0 vote327 views5 answers
Pattern
Python
0 vote323 views1 answer
Django cms api
Python
0 vote296 views1 answer
Returns all column names as a list
Python
1 vote282 views2 answers
Python get attributes of class
Python
0 vote292 views1 answer
Unction which takes in a list of integers and returns a dictionary of the five number summary..
Python
1 vote346 views6 answers
Quick sort python
Python