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

1 vote212 views1 answer
How to find the cube of a number in python
Python
0 vote188 views1 answer
Any and all in python3
Python
0 vote218 views1 answer
Entry point to programming Spark with the Dataset and DataFrame API
Python
-2 votes240 views1 answer
How to check a set is empty in python
Python
1 vote203 views1 answer
Python slicing multi dimensional array
Python
9 votes238 views2 answers
Django delete instance
Python Django
1 vote283 views1 answer
Django __str__ self multiple
Python Django
0 vote266 views3 answers
Add a new button in the index of the page wagtail
Python
8 votes153 views1 answer
How to change a json file in json python
Python
2 votes216 views2 answers
How to read csv file online into pandas
Python