Back to course home

0% completed

# Graph Traversal - Breadth First Search (BFS)

Breadth-First Search (BFS) is a graph traversal algorithm that explores a graph's vertices (nodes) level by level. It starts from a selected source node and moves outward to visit all the nodes at the same distance from the source before moving on to nodes at the following distance level.

BFS is particularly useful for finding the shortest path in unweighted graphs and for systematically exploring graphs.

Here is a complete description of the Breadth-First Search algorithm:

**1. Use a Queue**

- BFS uses a queue to keep track of the nodes to be visited

.....

.....

.....

Like the course? Get enrolled and start learning!