Algomination
Data Structures
AboutContact

Algomination

Learn algorithms and data structures through smooth, interactive visualizations.

SortingSearchingArray AlgorithmsData StructuresAboutContact

© 2026Algomination. Created by Omang Rawat & Rahul Soni.

Omang Rawat
Rahul Soni
All data structures

Graph Traversal (BFS & DFS)

Time O(V + E)Space O(V)

Explore a graph from a start node. Breadth-first search fans out level by level using a queue; depth-first search dives deep using a stack.

Start: A(click a node to change)
ABCDEFG
Queueempty
Pick a start node, then run BFS (queue) or DFS (stack) to watch the frontier expand.
StartVisitingVisited

About Graph Traversal (BFS & DFS)

Explore a graph from a start node. Breadth-first search fans out level by level using a queue; depth-first search dives deep using a stack.

Time complexity: O(V + E). Space complexity: O(V).

Use the interactive visualizer above to run Graph Traversal (BFS & DFS) on your own input and watch every comparison, swap, and operation animate step by step — pause, scrub, or replay at any speed.