Home
BFS
DFS
Prim's Algorithm
Kruskal's Algorithm
Interactive BFS Graph Traversal Visualizer
Algorithm
Example
Visualizer
Create/Edit Your Graph
Number of Nodes (1–20):
Generate Nodes
Select Start Node:
Edges (add manually)
Add Edge
Build & Run
Clear
Legend
Not Visited Node
Visited Node
Current Node
Traversed Edge
Play
Step Forward
Step Backward
Speech rate:
1x
Step-by-Step Description
Queue History