Breadth-First Search (BFS)
Breadth-First Search explores nodes layer by layer using a Queue. It is ideal for finding the shortest path in unweighted graphs.
📜 Live Explanation
Ready to start BFS.
🚉 Queue (First-In, First-Out)
Queue is empty