BFS
← Back to Traversal
Breadth-First Search explores a graph level by level using a queue. It visits all neighbors of a vertex before moving to the next level. BFS finds the shortest path in unweighted graphs and is used in many applications including web crawlers and social network analysis.