BFS and DFS

#DFS and BFS
from collections import deque
# Define the graph
graph = {
    'A': ['B', 'C'],
    'B': ['A', 'D', 'E'],
    'C': ['A', 'F'],
    'D': ['B'],
    'E': ['B', 'F'],
    'F': ['C', 'E']
}
# BFS - Breadth First Search
def bfs(graph, start):
    visited = {start}
    queue = deque([start]) # FIFO: First In First Out
    while queue:
        node = queue.popleft() # return leftmost element
        print(node, end=' ')
        for neighbour in graph[node]:
            if neighbour not in visited:
                visited.add(neighbour)
                queue.append(neighbour)
# DFS - Depth First Search
def dfs(graph, start):
    visited = set()
    stack = [start] # LIFO: Last In First Out
    while stack:
        node = stack.pop() # return rightmost element
        if node not in visited:
            print(node, end= ' ')
            visited.add(node)
            stack.extend(reversed(graph[node]))
print("BFS Traversal:")
bfs(graph, 'A') # Output: A B C D E F
print("\nDFS Traversal:")
dfs(graph, 'A') # Output: A B D E F C