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 vote126 views1 answer
Extends template django
Python
2 votes151 views1 answer
Python backslash in string
Python
1 vote169 views1 answer
No such table: django_session admin
Python Django
14 votes170 views5 answers
View all columns pandas
Python
1 vote123 views1 answer
Sort python dictionary by date
Python
0 vote165 views10 answers
Sqlite3 with flask web application CRUD pdf
Python Flask
0 vote133 views1 answer
Get or create django
Python
12 votes146 views3 answers
Pprint python
Python
8 votes124 views6 answers
Python int to binary
Python
0 vote134 views1 answer
Create animation from sequence of image python
Python