Master programming syntax, solve interactive challenges & run live code in Syntaxis Explore Arena →
menu_book Course Curriculum (Data Structures & Algorithms) expand_more
Complexity & Foundations
Big O notation Big Omega notation Big Theta notation Constant time Logarithmic time Linear time Quadratic time Amortized analysis Space complexity Recursion stack
Arrays & Strings
Array traversal Array insertion Array deletion Two pointers Sliding window Prefix sums String reversal Palindrome check Frequency counting Matrix traversal
Linked Lists
Singly linked list Linked list insertion Linked list deletion Reverse linked list Find middle node Detect cycle Merge sorted lists Doubly linked list Circular linked list LRU list concept
Stacks & Queues
Stack push pop Balanced parentheses Monotonic stack Queue enqueue dequeue Circular queue Deque Priority queue concept Breadth-first queue Min stack Evaluate postfix expression
Hashing
Hash map lookup Hash set membership Two sum Group anagrams First unique character Collision concept Load factor concept Open addressing concept Separate chaining concept Memoization with hash map
Trees & Heaps
Binary tree traversal Preorder traversal Inorder traversal Postorder traversal Level order traversal Binary search tree search BST insertion Tree height Min heap Heap sort
Graphs
Adjacency list Adjacency matrix Depth-first search Breadth-first search Connected components Cycle detection directed graph Topological sort Dijkstra shortest path Union find Minimum spanning tree concept
Sorting Searching & DP
Bubble sort Insertion sort Selection sort Merge sort Quick sort Binary search Lower bound Dynamic programming Fibonacci 0 1 knapsack Longest increasing subsequence
Data Structures & Algorithms / Graphs

Breadth-first search

Learn Breadth-first search in Data Structures & Algorithms with a focused explanation, a topic-specific example, edge guidance, and a mastery check.

12 min read • Advanced
data-structures-algorithms-064.py
python 
from collections import deque
graph={0:[1,2],1:[3],2:[4],3:[],4:[]};q=deque([0]);seen={0}
while q:
    n=q.popleft();print(n)
    for v in graph[n]:
        if v not in seen:seen.add(v);q.append(v)
What to watch
Content source & attribution
Original Syntaxis Content · Original Syntaxis Content

Lesson quizzes

Breadth-first search Mastery Check →
← PREVIOUS
Depth-first search
NEXT →
Connected components