lesson
Graph Traversal: Breadth-First Search
Implement breadth-first search using a queue and analyse its time and space complexity
Updated 6 days ago · 1 view
Premium Lesson
You've completed the free lessons in this track. Upgrade to unlock all 8 lessons, practice questions, and your personal tutor.
This lesson is part of a track
Public learning track
Graph Algorithms and Algorithm Design Paradigms
11th Grade · Technology · UK A-Level
8 lessons
Goal
Implement graph traversal and pathfinding algorithms, and apply advanced algorithmic paradigms like greedy algorithms and dynamic programming.
8 lessons
0 of 8 done
- Graph Traversal: Breadth-First SearchYou are here
- 2Graph Traversal: Depth-First SearchPremiumUp next
- 3Dijkstra's Shortest Path AlgorithmNot started yet
- 4A* Pathfinding AlgorithmNot started yet
- 5Comparing Pathfinding Algorithm ComplexityNot started yet
- 6Greedy AlgorithmsNot started yet
- 7Dynamic Programming: IntroductionNot started yet
- 8Analysing and Comparing Algorithm PerformanceNot started yet
