BFS Traversal
TraversalEasyVisualize graph exploration level-by-level using FIFO queues and unweighted distances.
Alt+Shift+Q
Configuration Panel
Complexity Mappings
Time ComplexityO(V + E)
Space ComplexityO(V) queue & visited buffers
Interactive SVG Graph Canvas
🖱️ Middle-drag to Pan🎡 Scroll wheel to Zoom⌨️ Shift-drag snap to 20px grid
Inspector Panel
Select a vertex or edge to inspect details.
Graph Wizard
Conceptual Overview
Breadth-First Search (BFS) is a fundamental traversal algorithm that explores all vertices of a graph at the current depth level before moving to the next level.
Algorithm Mechanism
Initialize a FIFO queue with the start node, marking it visited. Loop until queue is empty, popping the front node and pushing all unvisited neighbors, updating distances.
Source: CP-Algorithms reference guide