Breadth-First Search (BFS)
BFS
A graph traversal algorithm that systematically explores all nodes at the present depth prior to moving on to the next depth level. Starting from a designated node, BFS visits neighbors first and then their neighbors, ensuring it finds the shortest path in an unweighted graph.
8 connections Built by Tim Jones