DSA Notes
HubAlgorithm vs Data Structure - Key DifferencesReal-World Applications of DSATime and Space Complexity OverviewWhat is DSA? Data Structures and AlgorithmsWhy Learn Data Structures and AlgorithmsAsymptotic Analysis - Understanding Algorithm GrowthBest, Average, and Worst Case AnalysisBig O Notation - Upper Bound AnalysisBig Omega Notation - Lower Bound AnalysisBig Theta Notation - Tight Bound AnalysisSpace Complexity - Memory AnalysisTime Complexity Examples and AnalysisArray Interview Problems and SolutionsArray Operations - Insert, Delete, SearchArray Rotation TechniquesArray Searching TechniquesArrays - Fundamental Data StructureDynamic Arrays - Flexible SizingMultidimensional Arrays - 2D and BeyondSliding Window Technique for ArraysAnagram Problems - Character RearrangementPalindrome Problems and SolutionsPattern Searching in StringsString Interview Problems CollectionString Matching Algorithms - Pattern SearchingString Operations - Concatenation, Substring, ManipulationString Data Structure - FundamentalsCircular Linked List - Ring StructureDoubly Linked List - Bidirectional TraversalLinked List Interview ProblemsLinked List - Data Structure FundamentalsLinked List Operations - Insert, Delete, ReverseReverse Linked List - Iterative and RecursiveSingly Linked List - Implementation and OperationsBalanced Parentheses - Stack ApplicationInfix, Prefix, Postfix Expressions - Stack ApplicationStack Implementation TechniquesStack Interview Problems and SolutionsStack Data Structure - LIFO PrincipleStack using Arrays - Static ImplementationStack using Linked Lists - Dynamic ImplementationCircular Queue - Efficient Space UsageDeque (Double Ended Queue)Priority Queue - Custom OrderingQueue Applications - Real-World Use CasesQueue Implementation - Array and Linked ListQueue Interview Problems and SolutionsQueue Data Structure - FIFO PrincipleAVL Tree - Self-Balancing Binary Search TreeBinary Search Tree (BST)Binary Tree - Structure and OperationsFenwick Tree (Binary Indexed Tree)Red-Black Tree - Another Balanced BSTSegment Tree - Range Query Data StructureTree Interview Problems CollectionTree Data Structure FundamentalsTree Traversals - Inorder, Preorder, Postorder, Level OrderHeap Data StructureHeap OperationsHeap Interview ProblemsMax-HeapMin-Heap Implementation and Use CasesPriority Queue using HeapBellman-Ford AlgorithmBreadth-First Search (BFS) AlgorithmDepth-First Search (DFS) AlgorithmDijkstra\Floyd-Warshall AlgorithmGraph Interview ProblemsGraph Data Structure FundamentalsGraph Representation MethodsKruskal\Minimum Spanning Tree (MST)Prim\Shortest Path Algorithms: Complete ComparisonTopological SortingUnion-Find (Disjoint Set Union)Separate ChainingCollision HandlingHash FunctionsHashing FundamentalsHashing Interview ProblemsOpen AddressingBubble Sort - Simple Sorting AlgorithmCounting Sort - Non-Comparison SortingHeap Sort - Heap Based SortingInsertion Sort - Build Sorted ArrayMerge Sort - Divide and ConquerQuick Sort - Partition Based SortingRadix Sort - Digit Based SortingSelection Sort - Selection Based SortingSorting Algorithms Comparison - Choosing the Right AlgorithmSorting Algorithms - Fundamentals and ConceptsBinary Search - Efficient SearchingInterpolation Search - Intelligent SearchingLinear Search - Sequential Search AlgorithmSearch Algorithms ComparisonSearching Algorithm Interview ProblemsTernary Search AlgorithmBacktracking with RecursionRecursion Fundamentals - Base Case and RecurrenceRecursion Problems and SolutionsRecursion Tree - Visualizing Function CallsRecursion vs Iteration - Comparing ApproachesTail Recursion - Optimization TechniqueDynamic Programming Interview ProblemsDynamic Programming FundamentalsFibonacci with Dynamic Programming0/1 Knapsack ProblemLongest Common Subsequence (LCS)Longest Increasing Subsequence (LIS)Matrix Chain MultiplicationMemoization (Top-Down Dynamic Programming)Tabulation (Bottom-Up Dynamic Programming)Activity Selection ProblemFractional KnapsackGreedy Interview ProblemsGreedy Algorithm FundamentalsHuffman Coding — Data Structures & AlgorithmsJob Sequencing with DeadlinesBacktracking FundamentalsBacktracking Practice ProblemsN-Queens ProblemRat in a MazeSubset GenerationSudoku SolverCodeforces Guide for Competitive ProgrammersCommon Competitive Programming TechniquesContest Strategies for Competitive ProgrammingCompetitive Programming IntroductionFast Input/Output for Competitive ProgrammingLeetCode Guide for Interview PreparationBit Manipulation - Advanced TechniquesBloom Filter - Probabilistic Data StructureComputational Geometry - Algorithms and TechniquesDisjoint Set Union (DSU) - Union FindRandomized Algorithms - Probabilistic ComputingSkip List - Probabilistic Balanced StructureSuffix Array - String IndexingTrie - Prefix Tree for Efficient SearchingAutocomplete System Using TrieLibrary Management System Using DSARoute Finder Using GraphsMini Search Engine ProjectSocial Network Analysis Using GraphsEssential Coding Patterns for InterviewsDSA Cheatsheet: Quick ReferenceEssential DSA Interview QuestionsFAANG DSA Sheet: Company-Specific Patterns and ProblemsProblem Solving Strategies for Coding InterviewsComplexity CheatsheetImportant Algorithms SummaryBest Practice Platforms for DSARecommended Books for DSA
Learn BFS traversal with queue-based implementation, level-order processing, shortest path in unweighted graphs, and real applications.
The Intuition
Imagine you drop a stone into a still pond. Ripples spread outward in circles — first reaching everything 1 meter away, then 2 meters, then 3 meters. BFS explores a graph the same way: it visits all vertices at distance 1 from the source, then all at distance 2, then distance 3, and so on.
This "level by level" exploration is what makes BFS perfect for finding the shortest path in unweighted graphs — it literally explores nodes in order of their distance from the source.
How BFS Works
BFS uses a queue (FIFO) to track which vertex to explore next:
- Start at the source vertex, mark it visited, add it to the queue
- Dequeue a vertex, process it
- Enqueue all unvisited neighbors (mark them visited)
- Repeat until the queue is empty
The key insight: because we process vertices in FIFO order, we guarantee that the first time we reach any vertex, we reached it via the shortest path.
Dry Run Example
Graph
0 --- 1 --- 4
| |
2 --- 3
BFS from vertex 0
Step 1: Queue=[0], Visited={0}
Step 2: Dequeue 0, enqueue neighbors 1,2
Queue=[1,2], Visited={0,1,2}
Step 3: Dequeue 1, enqueue unvisited neighbors 3,4
Queue=[2,3,4], Visited={0,1,2,3,4}
Step 4: Dequeue 2, neighbor 3 already visited
Queue=[3,4], Visited={0,1,2,3,4}
Step 5: Dequeue 3, all neighbors visited
Queue=[4], Visited={0,1,2,3,4}
Step 6: Dequeue 4, all neighbors visited
Queue=[], Done!
BFS Order: 0, 1, 2, 3, 4
Level 0: {0}
Level 1: {1, 2}
Level 2: {3, 4}
Python Implementation
Example
from collections import deque
def bfs(graph, start):
"""Basic BFS traversal returning visit order."""
visited = set([start])
queue = deque([start])
order = []
while queue:
vertex = queue.popleft()
order.append(vertex)
for neighbor in graph[vertex]:
if neighbor not in visited:
visited.add(neighbor)
queue.append(neighbor)
return order
def bfs_shortest_path(graph, start, end):
"""Find shortest path in unweighted graph."""
visited = set([start])
queue = deque([(start, [start])])
while queue:
vertex, path = queue.popleft()
if vertex == end:
return path
for neighbor in graph[vertex]:
if neighbor not in visited:
visited.add(neighbor)
queue.append((neighbor, path + [neighbor]))
return None # No path exists
def bfs_level_order(graph, start):
"""BFS with level tracking."""
visited = set([start])
queue = deque([start])
level = 0
levels = {}
while queue:
size = len(queue) # Process entire current level
for _ in range(size):
vertex = queue.popleft()
levels[vertex] = level
for neighbor in graph[vertex]:
if neighbor not in visited:
visited.add(neighbor)
queue.append(neighbor)
level += 1
return levels
# Example usage
graph = {
0: [1, 2],
1: [0, 3, 4],
2: [0, 3],
3: [1, 2],
4: [1]
}
print(bfs(graph, 0)) # [0, 1, 2, 3, 4]
print(bfs_shortest_path(graph, 0, 4)) # [0, 1, 4]
print(bfs_level_order(graph, 0)) # {0:0, 1:1, 2:1, 3:2, 4:2}
C++ Implementation
Example
#include <vector>
#include <queue>
#include <unordered_set>
using namespace std;
vector<int> bfs(vector<vector<int>>& graph, int start) {
vector<int> order;
vector<bool> visited(graph.size(), false);
queue<int> q;
visited[start] = true;
q.push(start);
while (!q.empty()) {
int vertex = q.front();
q.pop();
order.push_back(vertex);
for (int neighbor : graph[vertex]) {
if (!visited[neighbor]) {
visited[neighbor] = true;
q.push(neighbor);
}
}
}
return order;
}
Time and Space Complexity
- Time: O(V + E) — we visit every vertex once and check every edge once
- Space: O(V) — for the visited set and queue (in worst case, all vertices could be in queue)
Why BFS Gives Shortest Path
BFS processes nodes level by level. When we first discover a node, it is from the closest possible source because:
- All distance-1 nodes are queued before any distance-2 node
- All distance-2 nodes are processed before any distance-3 node
- Therefore, first discovery = shortest distance
This ONLY works for unweighted graphs (or graphs where all edges have equal weight). For weighted graphs, use Dijkstra's algorithm.
Applications of BFS
- Shortest path in unweighted graph (the primary use case)
- Level-order traversal of trees (BFS on a tree)
- Finding connected components (run BFS from each unvisited vertex)
- Bipartite checking (try to 2-color the graph level by level)
- Web crawling (discover pages layer by layer from a seed URL)
- Social network analysis (find degrees of separation)
- Puzzle solving (shortest sequence of moves in games like sliding puzzle)
Common Interview Patterns
- Grid BFS: Treat a 2D grid as a graph, each cell connects to 4 neighbors. Used for "shortest path in maze" problems.
- Multi-source BFS: Start BFS from multiple sources simultaneously (e.g., "rotting oranges" problem).
- 0-1 BFS: For graphs with edge weights 0 or 1, use a deque — push weight-0 edges to front, weight-1 to back. Still O(V+E).
Exam Focus
Revise definitions, diagrams, examples, and short-answer points for Breadth-First Search (BFS) Algorithm.
Interview Use
Prepare one clear explanation, one practical example, and one common mistake for this Data Structures & Algorithms topic.
Search Terms
data-structures-algorithms, data structures & algorithms, data, structures, algorithms, graphs, bfs, algorithm
Related Data Structures & Algorithms Topics
Continue learning this concept
GraphsBellman-Ford AlgorithmLearn Bellman-Ford shortest path algorithm that handles negative edge weights, detects negative cycles, with complete implementation and analysis.GraphsDepth-First Search (DFS) AlgorithmMaster DFS traversal using recursion and stack, understand pre/post ordering, cycle detection, and connected component discovery.GraphsDijkstra\Master Dijkstra\GraphsFloyd-Warshall AlgorithmMaster the all-pairs shortest path algorithm using dynamic programming with three nested loops, path reconstruction, and practical applications.GraphsKruskal\Learn Kruskal\GraphsPrim\Master Prim\