Breadth First Search

Breadth-First Search (BFS) explores a graph much like finding connections in a social network. Starting from a source node, it first visits all of its direct friends (neighbors), then all of their friends, and so on, level by level. It uses a queue to keep track of who to visit next, ensuring it doesn't go too deep down one path. This makes it perfect for finding the shortest path in an unweighted graph.

queue = new Queue()

queue.enq(src)

mark src as visited

while queue is not empty:

    u = queue.deq()

    for each neighbor v of u:

        if v is not visited:

            queue.enq(v)

            mark v as visited