Traversal Tester — Graph & Tree Visualizer

🕸️

Traversal Tester v2

Presets

Binary Tree

7 nodes · 6 edges · balanced

Cyclic Graph

6 nodes · 8 edges · has cycles

Algorithm

Breadth-First Search

Explores level by level using a queue

BFS

DFS — Iterative

Stack-based depth-first traversal

DFS

DFS — Recursive

Call-stack depth-first with backtrack

DFS

Start Node

Playback Speed

Slow Fast

Edit Mode

Add Node

Click canvas → add node
Click node → select it
Shift+Click node → connect to selected
Right-click node → delete node
Drag node → reposition

⬡ Select ＋ Add Node ⟵ Add Edge ✕ Delete

Right-click node → delete

🕸️

Load a preset or click the canvas
to start building your graph

—

Current Step

No traversal

Run a traversal to see step-by-step explanations here.

Visit Order

—

Queue / Stack / Frame

—

Graph Stats

0

Nodes

0

Edges

—

Steps

BFS

Algorithm

Final Visit Order

        Run traversal to see result
      