Algorithms, Data Structures, DFS, Bfs, Graphs.
nodes) of the current node. It processes the neighbours one by one. 4. Enqueue neighbours: For each unvisited neighbour of the current node, add it to the end of the queue. This ensures that nodes at the same level are processed before moving to the next level. 5. Dequeue the next node: Remove the