Dfs and bfs in python

def bfs(graph, start):
    visited, queue = set(), [start]
    while queue:
        vertex = queue.pop(0)
        if vertex not in visited:
            visited.add(vertex)
            queue.extend(graph[vertex] - visited)
    return visited

bfs(graph, 'A') # {'B', 'C', 'A', 'F', 'D', 'E'}

Source: eddmann.com

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

Dfs and bfs in python

def shortest_path(graph, start, goal):
    try:
        return next(bfs_paths(graph, start, goal))
    except StopIteration:
        return None

shortest_path(graph, 'A', 'F') # ['A', 'C', 'F']

Source: eddmann.com

Dfs and bfs in python

def dfs_paths(graph, start, goal, path=None):
    if path is None:
        path = [start]
    if start == goal:
        yield path
    for next in graph[start] - set(path):
        yield from dfs_paths(graph, next, goal, path + [next])

list(dfs_paths(graph, 'C', 'F')) # [['C', 'F'], ['C', 'A', 'B', 'E', 'F']]

Source: eddmann.com

Similar codes

0 vote127 views1 answer
Fixing Messy columns
Python
0 vote133 views1 answer
ImportError: OpenCV loader: missing configuration file: ['config.py']. Check OpenCV installation.
Python
-4 votes198 views1 answer
Hello world python 2
Python
-1 vote135 views2 answers
Python print 2d array as table
Python
1 vote149 views1 answer
Python how often element in list
Python
0 vote121 views1 answer
Python except keyboardinterrupt
Python
1 vote113 views1 answer
For en python
Python
0 vote127 views2 answers
Python default dictonary
Python
1 vote147 views1 answer
Requirements.txt flask
Python
0 vote175 views1 answer
Flask request file upload to dropbox
Python