Depth First Search Visualization & Animation

Category: algorithms

Difficulty: intermediate

  • graph
  • dfs-connectivity

Depth First Search

intermediate

visited:
[ ]
Visited0
Edges0
Depth0
ABCDEFG
drag nodes
Empty
BOTTOM
Starting DFS from node A. We'll explore as deep as possible before backtracking — like solving a maze by always turning left.