What is BFS in Python and how can I implement it?

What is BFS in Python and how can I implement it?

BFS, or Breadth-First Search, is an algorithm for traversing or searching tree or graph data structures. In Python, you can implement it using a queue.

Can you show me a simple example of BFS in Python?

Sure! Here's a basic 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

What kind of data structures can I use with BFS?

BFS can be used with graphs and trees. You can represent these structures using adjacency lists, adjacency matrices, or edge lists.

Are there any limitations or drawbacks of using BFS?

Yes, BFS can consume a lot of memory, especially for wide trees or graphs, as it stores all child nodes at the current level before moving to the next.