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

3 votes181 views3 answers
How to take matrix input in python
Python
0 vote176 views1 answer
How to iclude parcentage in pivot table in pandas
Python
0 vote209 views1 answer
Np.linspace() in python
Python
2 votes163 views1 answer
Python for loop with increment
Python
4 votes290 views2 answers
Generate random prime number python
Python
0 vote171 views1 answer
F2 polar or nonpolar
Python
0 vote177 views1 answer
How to add legend on side of the chart python
Python
0 vote173 views1 answer
Pygame scroll event
Python
1 vote161 views1 answer
Plt normalized histogram
Python
0 vote175 views1 answer
Get current url with parameters url django
Python