How can I implement DFS and BFS in Python?

How can I implement DFS and BFS in Python?

You can implement Depth-First Search (DFS) and Breadth-First Search (BFS) using recursion and queues. Would you like a code example?

Yes, please provide a code example for both algorithms.

Sure! Here's a simple implementation:

# DFS implementation

def dfs(graph, start, visited=None):
    if visited is None:
        visited = set()
    visited.add(start)
    for neighbor in graph[start]:
        if neighbor not in visited:
            dfs(graph, neighbor, visited)
    return visited

# BFS implementation
from collections import deque

def bfs(graph, start):
    visited = set()
    queue = deque([start])
    while queue:
        vertex = queue.popleft()
        if vertex not in visited:
            visited.add(vertex)
            queue.extend(neighbor for neighbor in graph[vertex] if neighbor not in visited)
    return visited

This code defines both DFS and BFS functions. Do you need help with anything else?

What kind of graphs can I use these algorithms on?

You can use DFS and BFS on both directed and undirected graphs, as well as weighted and unweighted graphs. They are versatile algorithms!

Are there any specific use cases for DFS and BFS?

Yes, DFS is often used in pathfinding and topological sorting, while BFS is great for finding the shortest path in unweighted graphs.