Interactive DSA and system design

Learn complex engineering ideas by watching them move.

27stepsO(V + E)averageO(V)space

Graphs lab

DFS Backtracking Graph Traversal

Step 1 / 27

FIFO Queue

FrontEmptyBack

Recursion Stack

Empty

Min-Priority Queue

Empty

Visiting Active Node Visited Shortest Path

Animation speed

Space play / pause←→ stepR reset

Current operation

Initialize DFS

We start the Depth-First Search traversal at Node A. The recursion stack is empty and all nodes are unvisited.

Algorithm state

AStart NodeNoneVisited Order

Select Start Node

Click a node to restart the graph traversal from that starting point.

Complexity notes

O(V + E)averageO(V + E)worstO(V)spaceNostable

Synced code trace

function DFS(graph, start) {  const visited = new Set();  function explore(node) {    visited.add(node);    for (const neighbor of graph[node]) {      if (!visited.has(neighbor))        explore(neighbor);    }  }  explore(start);}

Interactive Notes

✓ Notes are saved automatically and persist per step.