CS Visual Lab
Explore
Learning Paths
5 modules live
Get Started
Graphs: BFS & DFS
Module 4.8 — Node-by-node traversal with frontier/visited coloring
Graph:
Binary Tree
General Graph
Cyclic Graph
Algorithm:
BFS
DFS
Start:
A
B
C
D
E
F
G
Step
Reset
Speed:
0.5x
1x
2x
Step 0 / 0
A
B
C
D
E
F
G
Unvisited
Frontier
Visiting
Visited
Traversal Order (BFS)
Press Play to start
Queue (FIFO)
(empty)
BFS vs DFS
BFS
Uses Queue (FIFO)
Level by level
Shortest path
O(V + E)
DFS
Uses Stack (LIFO)
Deep first
Cycle detection
O(V + E)
Graph Stats
Vertices
7
Edges
6
Visited
0 / 7
Use Cases
BFS:
Shortest path, level-order, web crawling, social network distance
DFS:
Topological sort, cycle detection, maze solving, connected components