Breadth-First Search

Medium

BFS explores nodes level by level, starting from the nearest nodes. Implemented using a queue.

📊 Complexity

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

🏷️ Tags

GraphSearchQueueShortest Path

📖 Introduction

Breadth-First Search (BFS) is a graph traversal algorithm that visits nodes closest to the starting node first, then progressively visits farther nodes.

1/30

🔧Start BFS Algorithm

Initialize visited array and queue. visited stores whether each node has been visited.

Breadth-First Search

Medium

Breadth-First Search

BFS explores nodes level by level, starting from the nearest nodes. Implemented using a queue.

📊 Complexity

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

🏷️ Tags

GraphSearchQueueShortest Path

📖 Introduction

Breadth-First Search (BFS) is a graph traversal algorithm that visits nodes closest to the starting node first, then progressively visits farther nodes.

1/30

🔧Start BFS Algorithm

Initialize visited array and queue. visited stores whether each node has been visited.

🔧Start BFS Algorithm