What are some examples of BFS in algorithms?

Can you explain what BFS is in algorithms?

BFS, or Breadth-First Search, is an algorithm for traversing or searching tree or graph data structures.

What are some practical examples of BFS?

Some examples include finding the shortest path in unweighted graphs, web crawling, and social network analysis.

How does BFS differ from DFS?

BFS explores all neighbors at the present depth before moving on to nodes at the next depth level, while DFS goes as deep as possible down one path before backtracking.

Can you give me a code example of BFS?

Sure! Here's a simple Python implementation of BFS:

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