Depth-First Search

Medium

Depth-First Search

DFS explores as far as possible along each branch before backtracking. Implemented using stack or recursion.

📊 Complexity

Type	Value
Best	O(V + E)
Average	O(V + E)
Worst	O(V + E)
Space	O(V)

🏷️ Tags

GraphSearchStackRecursion

📖 Introduction

Depth-First Search (DFS) is a graph traversal algorithm that explores as far as possible along a branch, then backtracks when there are no more nodes to visit.

1/39

🔧Start DFS Algorithm

Initialize visited array and stack. DFS uses a Stack to explore depth-first.

🔒

Depth-First Search

Medium

Depth-First Search

DFS explores as far as possible along each branch before backtracking. Implemented using stack or recursion.

📊 Complexity

Type	Value
Best	O(V + E)
Average	O(V + E)
Worst	O(V + E)
Space	O(V)

🏷️ Tags

GraphSearchStackRecursion

📖 Introduction

Depth-First Search (DFS) is a graph traversal algorithm that explores as far as possible along a branch, then backtracks when there are no more nodes to visit.

1/39

🔧Start DFS Algorithm

Initialize visited array and stack. DFS uses a Stack to explore depth-first.

🔒

🔧Start DFS Algorithm