Graph Traversal

Graph BFS & DFS Visualizer

Watch Breadth-First Search (BFS) and Depth-First Search (DFS) traverse the graph step-by-step. Track frontiers, visited sets, and traversal trees in real-time.

BFS — Queue

Level-by-level frontier expansion.

DFS — Stack

Dive deep before backtracking.

$O(|V|+|E|)$

Both visit every node and edge once.

View Mode: Select start/target node by clicking it. Current Start: Node 0, Current Target: Node 6

Speed:

Queue (BFS)

Empty (Idle)

Graph BFS & DFS Visualizer

BFS — Queue

DFS — Stack

O(∣V∣+∣E∣)O(|V|+|E|)O(∣V∣+∣E∣)

$O(|V|+|E|)$