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 vote263 views1 answer
Python second element of every tuple in list
Python
3 votes287 views2 answers
How to print last element in a list python
Python
0 vote259 views1 answer
Change python from 3.8 to 3.7
Python
13 votes297 views4 answers
Pickle save
Python
9 votes300 views2 answers
Python: remove specific values in a dataframe
Python
51 votes305 views4 answers
Online python compiler with all modules
Python
4 votes267 views1 answer
Python loop for i =0 i<len
Python
4 votes287 views2 answers
Python Program to count the number of lowercase letters and uppercase letters in a string.
Python
5 votes273 views1 answer
Make linked list in python
Python
1 vote275 views3 answers
Pyttsx3
Python