Depth-First Search

Watch DFS plunge as deep as possible along each branch, backtracking only when it hits a dead end.

Time: O(V + E)

Space: O(V)

Uses: Stack

Cycle Detection: Yes

Start Node:

Speed: 1000ms

Step 1 of 0Infinity%

Unvisited

In Stack

Current

Visited

Call Stack (top → bottom):

Empty

Time:O(V + E)

Space:O(V)

Data Structure:Stack

Finds Cycles:Yes

Question 1 of 3

What data structure underlies DFS (iteratively)?

DSAverse

Graph Algorithms

Loading Graph Algorithms...

BFS Traversal

visited: 0 / 7